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/Intrinsics.h"
18 #include "llvm/Assembly/Writer.h"
19 #include "llvm/CodeGen/MachineBasicBlock.h"
20 #include "llvm/CodeGen/MachineConstantPool.h"
21 #include "llvm/Support/MathExtras.h"
22 #include "llvm/Target/MRegisterInfo.h"
23 #include "llvm/Target/TargetLowering.h"
24 #include "llvm/Target/TargetInstrInfo.h"
25 #include "llvm/Target/TargetMachine.h"
26 #include "llvm/ADT/SetVector.h"
27 #include "llvm/ADT/SmallVector.h"
28 #include "llvm/ADT/StringExtras.h"
35 /// makeVTList - Return an instance of the SDVTList struct initialized with the
36 /// specified members.
37 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
38 SDVTList Res = {VTs, NumVTs};
42 // isInvertibleForFree - Return true if there is no cost to emitting the logical
43 // inverse of this node.
44 static bool isInvertibleForFree(SDOperand N) {
45 if (isa<ConstantSDNode>(N.Val)) return true;
46 if (N.Val->getOpcode() == ISD::SETCC && N.Val->hasOneUse())
51 //===----------------------------------------------------------------------===//
52 // ConstantFPSDNode Class
53 //===----------------------------------------------------------------------===//
55 /// isExactlyValue - We don't rely on operator== working on double values, as
56 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
57 /// As such, this method can be used to do an exact bit-for-bit comparison of
58 /// two floating point values.
59 bool ConstantFPSDNode::isExactlyValue(double V) const {
60 return DoubleToBits(V) == DoubleToBits(Value);
63 //===----------------------------------------------------------------------===//
65 //===----------------------------------------------------------------------===//
67 /// isBuildVectorAllOnes - Return true if the specified node is a
68 /// BUILD_VECTOR where all of the elements are ~0 or undef.
69 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
70 // Look through a bit convert.
71 if (N->getOpcode() == ISD::BIT_CONVERT)
72 N = N->getOperand(0).Val;
74 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
76 unsigned i = 0, e = N->getNumOperands();
78 // Skip over all of the undef values.
79 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
82 // Do not accept an all-undef vector.
83 if (i == e) return false;
85 // Do not accept build_vectors that aren't all constants or which have non-~0
87 SDOperand NotZero = N->getOperand(i);
88 if (isa<ConstantSDNode>(NotZero)) {
89 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
91 } else if (isa<ConstantFPSDNode>(NotZero)) {
92 MVT::ValueType VT = NotZero.getValueType();
94 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
98 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
105 // Okay, we have at least one ~0 value, check to see if the rest match or are
107 for (++i; i != e; ++i)
108 if (N->getOperand(i) != NotZero &&
109 N->getOperand(i).getOpcode() != ISD::UNDEF)
115 /// isBuildVectorAllZeros - Return true if the specified node is a
116 /// BUILD_VECTOR where all of the elements are 0 or undef.
117 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
118 // Look through a bit convert.
119 if (N->getOpcode() == ISD::BIT_CONVERT)
120 N = N->getOperand(0).Val;
122 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
124 unsigned i = 0, e = N->getNumOperands();
126 // Skip over all of the undef values.
127 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
130 // Do not accept an all-undef vector.
131 if (i == e) return false;
133 // Do not accept build_vectors that aren't all constants or which have non-~0
135 SDOperand Zero = N->getOperand(i);
136 if (isa<ConstantSDNode>(Zero)) {
137 if (!cast<ConstantSDNode>(Zero)->isNullValue())
139 } else if (isa<ConstantFPSDNode>(Zero)) {
140 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0))
145 // Okay, we have at least one ~0 value, check to see if the rest match or are
147 for (++i; i != e; ++i)
148 if (N->getOperand(i) != Zero &&
149 N->getOperand(i).getOpcode() != ISD::UNDEF)
154 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
155 /// when given the operation for (X op Y).
156 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
157 // To perform this operation, we just need to swap the L and G bits of the
159 unsigned OldL = (Operation >> 2) & 1;
160 unsigned OldG = (Operation >> 1) & 1;
161 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
162 (OldL << 1) | // New G bit
163 (OldG << 2)); // New L bit.
166 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
167 /// 'op' is a valid SetCC operation.
168 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
169 unsigned Operation = Op;
171 Operation ^= 7; // Flip L, G, E bits, but not U.
173 Operation ^= 15; // Flip all of the condition bits.
174 if (Operation > ISD::SETTRUE2)
175 Operation &= ~8; // Don't let N and U bits get set.
176 return ISD::CondCode(Operation);
180 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
181 /// signed operation and 2 if the result is an unsigned comparison. Return zero
182 /// if the operation does not depend on the sign of the input (setne and seteq).
183 static int isSignedOp(ISD::CondCode Opcode) {
185 default: assert(0 && "Illegal integer setcc operation!");
187 case ISD::SETNE: return 0;
191 case ISD::SETGE: return 1;
195 case ISD::SETUGE: return 2;
199 /// getSetCCOrOperation - Return the result of a logical OR between different
200 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
201 /// returns SETCC_INVALID if it is not possible to represent the resultant
203 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
205 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
206 // Cannot fold a signed integer setcc with an unsigned integer setcc.
207 return ISD::SETCC_INVALID;
209 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
211 // If the N and U bits get set then the resultant comparison DOES suddenly
212 // care about orderedness, and is true when ordered.
213 if (Op > ISD::SETTRUE2)
214 Op &= ~16; // Clear the U bit if the N bit is set.
216 // Canonicalize illegal integer setcc's.
217 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
220 return ISD::CondCode(Op);
223 /// getSetCCAndOperation - Return the result of a logical AND between different
224 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
225 /// function returns zero if it is not possible to represent the resultant
227 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
229 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
230 // Cannot fold a signed setcc with an unsigned setcc.
231 return ISD::SETCC_INVALID;
233 // Combine all of the condition bits.
234 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
236 // Canonicalize illegal integer setcc's.
240 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
241 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
242 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
243 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
250 const TargetMachine &SelectionDAG::getTarget() const {
251 return TLI.getTargetMachine();
254 //===----------------------------------------------------------------------===//
255 // SelectionDAG Class
256 //===----------------------------------------------------------------------===//
258 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
260 void SelectionDAG::RemoveDeadNodes() {
261 // Create a dummy node (which is not added to allnodes), that adds a reference
262 // to the root node, preventing it from being deleted.
263 HandleSDNode Dummy(getRoot());
265 SmallVector<SDNode*, 128> DeadNodes;
267 // Add all obviously-dead nodes to the DeadNodes worklist.
268 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
270 DeadNodes.push_back(I);
272 // Process the worklist, deleting the nodes and adding their uses to the
274 while (!DeadNodes.empty()) {
275 SDNode *N = DeadNodes.back();
276 DeadNodes.pop_back();
278 // Take the node out of the appropriate CSE map.
279 RemoveNodeFromCSEMaps(N);
281 // Next, brutally remove the operand list. This is safe to do, as there are
282 // no cycles in the graph.
283 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
284 SDNode *Operand = I->Val;
285 Operand->removeUser(N);
287 // Now that we removed this operand, see if there are no uses of it left.
288 if (Operand->use_empty())
289 DeadNodes.push_back(Operand);
291 delete[] N->OperandList;
295 // Finally, remove N itself.
299 // If the root changed (e.g. it was a dead load, update the root).
300 setRoot(Dummy.getValue());
303 void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) {
304 SmallVector<SDNode*, 16> DeadNodes;
305 DeadNodes.push_back(N);
307 // Process the worklist, deleting the nodes and adding their uses to the
309 while (!DeadNodes.empty()) {
310 SDNode *N = DeadNodes.back();
311 DeadNodes.pop_back();
313 // Take the node out of the appropriate CSE map.
314 RemoveNodeFromCSEMaps(N);
316 // Next, brutally remove the operand list. This is safe to do, as there are
317 // no cycles in the graph.
318 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
319 SDNode *Operand = I->Val;
320 Operand->removeUser(N);
322 // Now that we removed this operand, see if there are no uses of it left.
323 if (Operand->use_empty())
324 DeadNodes.push_back(Operand);
326 delete[] N->OperandList;
330 // Finally, remove N itself.
331 Deleted.push_back(N);
336 void SelectionDAG::DeleteNode(SDNode *N) {
337 assert(N->use_empty() && "Cannot delete a node that is not dead!");
339 // First take this out of the appropriate CSE map.
340 RemoveNodeFromCSEMaps(N);
342 // Finally, remove uses due to operands of this node, remove from the
343 // AllNodes list, and delete the node.
344 DeleteNodeNotInCSEMaps(N);
347 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
349 // Remove it from the AllNodes list.
352 // Drop all of the operands and decrement used nodes use counts.
353 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
354 I->Val->removeUser(N);
355 delete[] N->OperandList;
362 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
363 /// correspond to it. This is useful when we're about to delete or repurpose
364 /// the node. We don't want future request for structurally identical nodes
365 /// to return N anymore.
366 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
368 switch (N->getOpcode()) {
369 case ISD::HANDLENODE: return; // noop.
371 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
374 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
375 "Cond code doesn't exist!");
376 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
377 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
379 case ISD::ExternalSymbol:
380 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
382 case ISD::TargetExternalSymbol:
384 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
387 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
388 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
391 // Remove it from the CSE Map.
392 Erased = CSEMap.RemoveNode(N);
396 // Verify that the node was actually in one of the CSE maps, unless it has a
397 // flag result (which cannot be CSE'd) or is one of the special cases that are
398 // not subject to CSE.
399 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
400 !N->isTargetOpcode()) {
403 assert(0 && "Node is not in map!");
408 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
409 /// has been taken out and modified in some way. If the specified node already
410 /// exists in the CSE maps, do not modify the maps, but return the existing node
411 /// instead. If it doesn't exist, add it and return null.
413 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
414 assert(N->getNumOperands() && "This is a leaf node!");
415 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
416 return 0; // Never add these nodes.
418 // Check that remaining values produced are not flags.
419 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
420 if (N->getValueType(i) == MVT::Flag)
421 return 0; // Never CSE anything that produces a flag.
423 SDNode *New = CSEMap.GetOrInsertNode(N);
424 if (New != N) return New; // Node already existed.
428 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
429 /// were replaced with those specified. If this node is never memoized,
430 /// return null, otherwise return a pointer to the slot it would take. If a
431 /// node already exists with these operands, the slot will be non-null.
432 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
434 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
435 return 0; // Never add these nodes.
437 // Check that remaining values produced are not flags.
438 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
439 if (N->getValueType(i) == MVT::Flag)
440 return 0; // Never CSE anything that produces a flag.
442 SelectionDAGCSEMap::NodeID ID;
443 ID.SetOpcode(N->getOpcode());
444 ID.SetValueTypes(N->getVTList());
446 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
449 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
450 /// were replaced with those specified. If this node is never memoized,
451 /// return null, otherwise return a pointer to the slot it would take. If a
452 /// node already exists with these operands, the slot will be non-null.
453 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
454 SDOperand Op1, SDOperand Op2,
456 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
457 return 0; // Never add these nodes.
459 // Check that remaining values produced are not flags.
460 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
461 if (N->getValueType(i) == MVT::Flag)
462 return 0; // Never CSE anything that produces a flag.
464 SelectionDAGCSEMap::NodeID ID;
465 ID.SetOpcode(N->getOpcode());
466 ID.SetValueTypes(N->getVTList());
467 ID.SetOperands(Op1, Op2);
468 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
472 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
473 /// were replaced with those specified. If this node is never memoized,
474 /// return null, otherwise return a pointer to the slot it would take. If a
475 /// node already exists with these operands, the slot will be non-null.
476 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
477 const SDOperand *Ops,unsigned NumOps,
479 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
480 return 0; // Never add these nodes.
482 // Check that remaining values produced are not flags.
483 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
484 if (N->getValueType(i) == MVT::Flag)
485 return 0; // Never CSE anything that produces a flag.
487 SelectionDAGCSEMap::NodeID ID;
488 ID.SetOpcode(N->getOpcode());
489 ID.SetValueTypes(N->getVTList());
490 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
491 ID.AddInteger(LD->getAddressingMode());
492 ID.AddInteger(LD->getExtensionType());
493 ID.AddInteger(LD->getLoadedVT());
494 ID.AddPointer(LD->getSrcValue());
495 ID.AddInteger(LD->getSrcValueOffset());
496 ID.AddInteger(LD->getAlignment());
497 ID.AddInteger(LD->isVolatile());
499 ID.SetOperands(Ops, NumOps);
500 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
504 SelectionDAG::~SelectionDAG() {
505 while (!AllNodes.empty()) {
506 SDNode *N = AllNodes.begin();
507 N->SetNextInBucket(0);
508 delete [] N->OperandList;
511 AllNodes.pop_front();
515 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
516 if (Op.getValueType() == VT) return Op;
517 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
518 return getNode(ISD::AND, Op.getValueType(), Op,
519 getConstant(Imm, Op.getValueType()));
522 SDOperand SelectionDAG::getString(const std::string &Val) {
523 StringSDNode *&N = StringNodes[Val];
525 N = new StringSDNode(Val);
526 AllNodes.push_back(N);
528 return SDOperand(N, 0);
531 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
532 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
533 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
535 // Mask out any bits that are not valid for this constant.
536 Val &= MVT::getIntVTBitMask(VT);
538 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
539 SelectionDAGCSEMap::NodeID ID(Opc, getVTList(VT));
542 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
543 return SDOperand(E, 0);
544 SDNode *N = new ConstantSDNode(isT, Val, VT);
545 CSEMap.InsertNode(N, IP);
546 AllNodes.push_back(N);
547 return SDOperand(N, 0);
551 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
553 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
555 Val = (float)Val; // Mask out extra precision.
557 // Do the map lookup using the actual bit pattern for the floating point
558 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
559 // we don't have issues with SNANs.
560 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
561 SelectionDAGCSEMap::NodeID ID(Opc, getVTList(VT));
562 ID.AddInteger(DoubleToBits(Val));
564 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
565 return SDOperand(E, 0);
566 SDNode *N = new ConstantFPSDNode(isTarget, Val, VT);
567 CSEMap.InsertNode(N, IP);
568 AllNodes.push_back(N);
569 return SDOperand(N, 0);
572 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
573 MVT::ValueType VT, int Offset,
575 unsigned Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
576 SelectionDAGCSEMap::NodeID ID(Opc, getVTList(VT));
578 ID.AddInteger(Offset);
580 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
581 return SDOperand(E, 0);
582 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
583 CSEMap.InsertNode(N, IP);
584 AllNodes.push_back(N);
585 return SDOperand(N, 0);
588 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
590 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
591 SelectionDAGCSEMap::NodeID ID(Opc, getVTList(VT));
594 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
595 return SDOperand(E, 0);
596 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
597 CSEMap.InsertNode(N, IP);
598 AllNodes.push_back(N);
599 return SDOperand(N, 0);
602 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
603 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
604 SelectionDAGCSEMap::NodeID ID(Opc, getVTList(VT));
607 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
608 return SDOperand(E, 0);
609 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
610 CSEMap.InsertNode(N, IP);
611 AllNodes.push_back(N);
612 return SDOperand(N, 0);
615 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
616 unsigned Alignment, int Offset,
618 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
619 SelectionDAGCSEMap::NodeID ID(Opc, getVTList(VT));
620 ID.AddInteger(Alignment);
621 ID.AddInteger(Offset);
624 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
625 return SDOperand(E, 0);
626 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
627 CSEMap.InsertNode(N, IP);
628 AllNodes.push_back(N);
629 return SDOperand(N, 0);
633 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
635 unsigned Alignment, int Offset,
637 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
638 SelectionDAGCSEMap::NodeID ID(Opc, getVTList(VT));
639 ID.AddInteger(Alignment);
640 ID.AddInteger(Offset);
641 C->AddSelectionDAGCSEId(&ID);
643 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
644 return SDOperand(E, 0);
645 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
646 CSEMap.InsertNode(N, IP);
647 AllNodes.push_back(N);
648 return SDOperand(N, 0);
652 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
653 SelectionDAGCSEMap::NodeID ID(ISD::BasicBlock, getVTList(MVT::Other));
656 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
657 return SDOperand(E, 0);
658 SDNode *N = new BasicBlockSDNode(MBB);
659 CSEMap.InsertNode(N, IP);
660 AllNodes.push_back(N);
661 return SDOperand(N, 0);
664 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
665 if ((unsigned)VT >= ValueTypeNodes.size())
666 ValueTypeNodes.resize(VT+1);
667 if (ValueTypeNodes[VT] == 0) {
668 ValueTypeNodes[VT] = new VTSDNode(VT);
669 AllNodes.push_back(ValueTypeNodes[VT]);
672 return SDOperand(ValueTypeNodes[VT], 0);
675 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
676 SDNode *&N = ExternalSymbols[Sym];
677 if (N) return SDOperand(N, 0);
678 N = new ExternalSymbolSDNode(false, Sym, VT);
679 AllNodes.push_back(N);
680 return SDOperand(N, 0);
683 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
685 SDNode *&N = TargetExternalSymbols[Sym];
686 if (N) return SDOperand(N, 0);
687 N = new ExternalSymbolSDNode(true, Sym, VT);
688 AllNodes.push_back(N);
689 return SDOperand(N, 0);
692 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
693 if ((unsigned)Cond >= CondCodeNodes.size())
694 CondCodeNodes.resize(Cond+1);
696 if (CondCodeNodes[Cond] == 0) {
697 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
698 AllNodes.push_back(CondCodeNodes[Cond]);
700 return SDOperand(CondCodeNodes[Cond], 0);
703 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
704 SelectionDAGCSEMap::NodeID ID(ISD::Register, getVTList(VT));
705 ID.AddInteger(RegNo);
707 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
708 return SDOperand(E, 0);
709 SDNode *N = new RegisterSDNode(RegNo, VT);
710 CSEMap.InsertNode(N, IP);
711 AllNodes.push_back(N);
712 return SDOperand(N, 0);
715 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
716 assert((!V || isa<PointerType>(V->getType())) &&
717 "SrcValue is not a pointer?");
719 SelectionDAGCSEMap::NodeID ID(ISD::SRCVALUE, getVTList(MVT::Other));
721 ID.AddInteger(Offset);
723 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
724 return SDOperand(E, 0);
725 SDNode *N = new SrcValueSDNode(V, Offset);
726 CSEMap.InsertNode(N, IP);
727 AllNodes.push_back(N);
728 return SDOperand(N, 0);
731 SDOperand SelectionDAG::SimplifySetCC(MVT::ValueType VT, SDOperand N1,
732 SDOperand N2, ISD::CondCode Cond) {
733 // These setcc operations always fold.
737 case ISD::SETFALSE2: return getConstant(0, VT);
739 case ISD::SETTRUE2: return getConstant(1, VT);
751 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
755 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
756 uint64_t C2 = N2C->getValue();
757 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
758 uint64_t C1 = N1C->getValue();
760 // Sign extend the operands if required
761 if (ISD::isSignedIntSetCC(Cond)) {
762 C1 = N1C->getSignExtended();
763 C2 = N2C->getSignExtended();
767 default: assert(0 && "Unknown integer setcc!");
768 case ISD::SETEQ: return getConstant(C1 == C2, VT);
769 case ISD::SETNE: return getConstant(C1 != C2, VT);
770 case ISD::SETULT: return getConstant(C1 < C2, VT);
771 case ISD::SETUGT: return getConstant(C1 > C2, VT);
772 case ISD::SETULE: return getConstant(C1 <= C2, VT);
773 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
774 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
775 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
776 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
777 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
780 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
781 if (N1.getOpcode() == ISD::ZERO_EXTEND) {
782 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType());
784 // If the comparison constant has bits in the upper part, the
785 // zero-extended value could never match.
786 if (C2 & (~0ULL << InSize)) {
787 unsigned VSize = MVT::getSizeInBits(N1.getValueType());
791 case ISD::SETEQ: return getConstant(0, VT);
794 case ISD::SETNE: return getConstant(1, VT);
797 // True if the sign bit of C2 is set.
798 return getConstant((C2 & (1ULL << VSize)) != 0, VT);
801 // True if the sign bit of C2 isn't set.
802 return getConstant((C2 & (1ULL << VSize)) == 0, VT);
808 // Otherwise, we can perform the comparison with the low bits.
816 return getSetCC(VT, N1.getOperand(0),
817 getConstant(C2, N1.getOperand(0).getValueType()),
820 break; // todo, be more careful with signed comparisons
822 } else if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG &&
823 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
824 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N1.getOperand(1))->getVT();
825 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy);
826 MVT::ValueType ExtDstTy = N1.getValueType();
827 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy);
829 // If the extended part has any inconsistent bits, it cannot ever
830 // compare equal. In other words, they have to be all ones or all
833 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1));
834 if ((C2 & ExtBits) != 0 && (C2 & ExtBits) != ExtBits)
835 return getConstant(Cond == ISD::SETNE, VT);
837 // Otherwise, make this a use of a zext.
838 return getSetCC(VT, getZeroExtendInReg(N1.getOperand(0), ExtSrcTy),
839 getConstant(C2 & (~0ULL>>(64-ExtSrcTyBits)), ExtDstTy),
843 uint64_t MinVal, MaxVal;
844 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0));
845 if (ISD::isSignedIntSetCC(Cond)) {
846 MinVal = 1ULL << (OperandBitSize-1);
847 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined.
848 MaxVal = ~0ULL >> (65-OperandBitSize);
853 MaxVal = ~0ULL >> (64-OperandBitSize);
856 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
857 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
858 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true
859 --C2; // X >= C1 --> X > (C1-1)
860 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
861 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
864 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
865 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true
866 ++C2; // X <= C1 --> X < (C1+1)
867 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
868 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
871 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal)
872 return getConstant(0, VT); // X < MIN --> false
874 // Canonicalize setgt X, Min --> setne X, Min
875 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal)
876 return getSetCC(VT, N1, N2, ISD::SETNE);
878 // If we have setult X, 1, turn it into seteq X, 0
879 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1)
880 return getSetCC(VT, N1, getConstant(MinVal, N1.getValueType()),
882 // If we have setugt X, Max-1, turn it into seteq X, Max
883 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1)
884 return getSetCC(VT, N1, getConstant(MaxVal, N1.getValueType()),
887 // If we have "setcc X, C1", check to see if we can shrink the immediate
890 // SETUGT X, SINTMAX -> SETLT X, 0
891 if (Cond == ISD::SETUGT && OperandBitSize != 1 &&
892 C2 == (~0ULL >> (65-OperandBitSize)))
893 return getSetCC(VT, N1, getConstant(0, N2.getValueType()), ISD::SETLT);
895 // FIXME: Implement the rest of these.
898 // Fold bit comparisons when we can.
899 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
900 VT == N1.getValueType() && N1.getOpcode() == ISD::AND)
901 if (ConstantSDNode *AndRHS =
902 dyn_cast<ConstantSDNode>(N1.getOperand(1))) {
903 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
904 // Perform the xform if the AND RHS is a single bit.
905 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) {
906 return getNode(ISD::SRL, VT, N1,
907 getConstant(Log2_64(AndRHS->getValue()),
908 TLI.getShiftAmountTy()));
910 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) {
911 // (X & 8) == 8 --> (X & 8) >> 3
912 // Perform the xform if C2 is a single bit.
913 if ((C2 & (C2-1)) == 0) {
914 return getNode(ISD::SRL, VT, N1,
915 getConstant(Log2_64(C2),TLI.getShiftAmountTy()));
920 } else if (isa<ConstantSDNode>(N1.Val)) {
921 // Ensure that the constant occurs on the RHS.
922 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
925 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
926 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
927 double C1 = N1C->getValue(), C2 = N2C->getValue();
930 default: break; // FIXME: Implement the rest of these!
931 case ISD::SETEQ: return getConstant(C1 == C2, VT);
932 case ISD::SETNE: return getConstant(C1 != C2, VT);
933 case ISD::SETLT: return getConstant(C1 < C2, VT);
934 case ISD::SETGT: return getConstant(C1 > C2, VT);
935 case ISD::SETLE: return getConstant(C1 <= C2, VT);
936 case ISD::SETGE: return getConstant(C1 >= C2, VT);
939 // Ensure that the constant occurs on the RHS.
940 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
943 // Could not fold it.
947 /// getNode - Gets or creates the specified node.
949 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
950 SelectionDAGCSEMap::NodeID ID(Opcode, getVTList(VT));
952 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
953 return SDOperand(E, 0);
954 SDNode *N = new SDNode(Opcode, VT);
955 CSEMap.InsertNode(N, IP);
957 AllNodes.push_back(N);
958 return SDOperand(N, 0);
961 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
964 // Constant fold unary operations with an integer constant operand.
965 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
966 uint64_t Val = C->getValue();
969 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
970 case ISD::ANY_EXTEND:
971 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
972 case ISD::TRUNCATE: return getConstant(Val, VT);
973 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
974 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
975 case ISD::BIT_CONVERT:
976 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
977 return getConstantFP(BitsToFloat(Val), VT);
978 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
979 return getConstantFP(BitsToDouble(Val), VT);
983 default: assert(0 && "Invalid bswap!"); break;
984 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
985 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
986 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
991 default: assert(0 && "Invalid ctpop!"); break;
992 case MVT::i1: return getConstant(Val != 0, VT);
994 Tmp1 = (unsigned)Val & 0xFF;
995 return getConstant(CountPopulation_32(Tmp1), VT);
997 Tmp1 = (unsigned)Val & 0xFFFF;
998 return getConstant(CountPopulation_32(Tmp1), VT);
1000 return getConstant(CountPopulation_32((unsigned)Val), VT);
1002 return getConstant(CountPopulation_64(Val), VT);
1006 default: assert(0 && "Invalid ctlz!"); break;
1007 case MVT::i1: return getConstant(Val == 0, VT);
1009 Tmp1 = (unsigned)Val & 0xFF;
1010 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1012 Tmp1 = (unsigned)Val & 0xFFFF;
1013 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1015 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1017 return getConstant(CountLeadingZeros_64(Val), VT);
1021 default: assert(0 && "Invalid cttz!"); break;
1022 case MVT::i1: return getConstant(Val == 0, VT);
1024 Tmp1 = (unsigned)Val | 0x100;
1025 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1027 Tmp1 = (unsigned)Val | 0x10000;
1028 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1030 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1032 return getConstant(CountTrailingZeros_64(Val), VT);
1037 // Constant fold unary operations with an floating point constant operand.
1038 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1041 return getConstantFP(-C->getValue(), VT);
1043 return getConstantFP(fabs(C->getValue()), VT);
1045 case ISD::FP_EXTEND:
1046 return getConstantFP(C->getValue(), VT);
1047 case ISD::FP_TO_SINT:
1048 return getConstant((int64_t)C->getValue(), VT);
1049 case ISD::FP_TO_UINT:
1050 return getConstant((uint64_t)C->getValue(), VT);
1051 case ISD::BIT_CONVERT:
1052 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1053 return getConstant(FloatToBits(C->getValue()), VT);
1054 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1055 return getConstant(DoubleToBits(C->getValue()), VT);
1059 unsigned OpOpcode = Operand.Val->getOpcode();
1061 case ISD::TokenFactor:
1062 return Operand; // Factor of one node? No factor.
1063 case ISD::SIGN_EXTEND:
1064 if (Operand.getValueType() == VT) return Operand; // noop extension
1065 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1066 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1067 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1069 case ISD::ZERO_EXTEND:
1070 if (Operand.getValueType() == VT) return Operand; // noop extension
1071 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1072 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1073 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1075 case ISD::ANY_EXTEND:
1076 if (Operand.getValueType() == VT) return Operand; // noop extension
1077 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1078 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1079 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1080 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1083 if (Operand.getValueType() == VT) return Operand; // noop truncate
1084 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1085 if (OpOpcode == ISD::TRUNCATE)
1086 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1087 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1088 OpOpcode == ISD::ANY_EXTEND) {
1089 // If the source is smaller than the dest, we still need an extend.
1090 if (Operand.Val->getOperand(0).getValueType() < VT)
1091 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1092 else if (Operand.Val->getOperand(0).getValueType() > VT)
1093 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1095 return Operand.Val->getOperand(0);
1098 case ISD::BIT_CONVERT:
1099 // Basic sanity checking.
1100 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1101 && "Cannot BIT_CONVERT between two different types!");
1102 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1103 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1104 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1105 if (OpOpcode == ISD::UNDEF)
1106 return getNode(ISD::UNDEF, VT);
1108 case ISD::SCALAR_TO_VECTOR:
1109 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1110 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1111 "Illegal SCALAR_TO_VECTOR node!");
1114 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1115 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1116 Operand.Val->getOperand(0));
1117 if (OpOpcode == ISD::FNEG) // --X -> X
1118 return Operand.Val->getOperand(0);
1121 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1122 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1127 SDVTList VTs = getVTList(VT);
1128 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1129 SelectionDAGCSEMap::NodeID ID(Opcode, VTs, Operand);
1131 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1132 return SDOperand(E, 0);
1133 N = new SDNode(Opcode, Operand);
1134 N->setValueTypes(VTs);
1135 CSEMap.InsertNode(N, IP);
1137 N = new SDNode(Opcode, Operand);
1138 N->setValueTypes(VTs);
1140 AllNodes.push_back(N);
1141 return SDOperand(N, 0);
1146 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1147 SDOperand N1, SDOperand N2) {
1150 case ISD::TokenFactor:
1151 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1152 N2.getValueType() == MVT::Other && "Invalid token factor!");
1161 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1168 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1175 assert(N1.getValueType() == N2.getValueType() &&
1176 N1.getValueType() == VT && "Binary operator types must match!");
1178 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1179 assert(N1.getValueType() == VT &&
1180 MVT::isFloatingPoint(N1.getValueType()) &&
1181 MVT::isFloatingPoint(N2.getValueType()) &&
1182 "Invalid FCOPYSIGN!");
1189 assert(VT == N1.getValueType() &&
1190 "Shift operators return type must be the same as their first arg");
1191 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1192 VT != MVT::i1 && "Shifts only work on integers");
1194 case ISD::FP_ROUND_INREG: {
1195 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1196 assert(VT == N1.getValueType() && "Not an inreg round!");
1197 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1198 "Cannot FP_ROUND_INREG integer types");
1199 assert(EVT <= VT && "Not rounding down!");
1202 case ISD::AssertSext:
1203 case ISD::AssertZext:
1204 case ISD::SIGN_EXTEND_INREG: {
1205 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1206 assert(VT == N1.getValueType() && "Not an inreg extend!");
1207 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1208 "Cannot *_EXTEND_INREG FP types");
1209 assert(EVT <= VT && "Not extending!");
1216 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1217 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1219 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1220 int64_t Val = N1C->getValue();
1221 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1222 Val <<= 64-FromBits;
1223 Val >>= 64-FromBits;
1224 return getConstant(Val, VT);
1228 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1230 case ISD::ADD: return getConstant(C1 + C2, VT);
1231 case ISD::SUB: return getConstant(C1 - C2, VT);
1232 case ISD::MUL: return getConstant(C1 * C2, VT);
1234 if (C2) return getConstant(C1 / C2, VT);
1237 if (C2) return getConstant(C1 % C2, VT);
1240 if (C2) return getConstant(N1C->getSignExtended() /
1241 N2C->getSignExtended(), VT);
1244 if (C2) return getConstant(N1C->getSignExtended() %
1245 N2C->getSignExtended(), VT);
1247 case ISD::AND : return getConstant(C1 & C2, VT);
1248 case ISD::OR : return getConstant(C1 | C2, VT);
1249 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1250 case ISD::SHL : return getConstant(C1 << C2, VT);
1251 case ISD::SRL : return getConstant(C1 >> C2, VT);
1252 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1254 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1257 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1261 } else { // Cannonicalize constant to RHS if commutative
1262 if (isCommutativeBinOp(Opcode)) {
1263 std::swap(N1C, N2C);
1269 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1270 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1273 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1275 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1276 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1277 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1279 if (C2) return getConstantFP(C1 / C2, VT);
1282 if (C2) return getConstantFP(fmod(C1, C2), VT);
1284 case ISD::FCOPYSIGN: {
1295 if (u2.I < 0) // Sign bit of RHS set?
1296 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1298 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1299 return getConstantFP(u1.F, VT);
1303 } else { // Cannonicalize constant to RHS if commutative
1304 if (isCommutativeBinOp(Opcode)) {
1305 std::swap(N1CFP, N2CFP);
1311 // Canonicalize an UNDEF to the RHS, even over a constant.
1312 if (N1.getOpcode() == ISD::UNDEF) {
1313 if (isCommutativeBinOp(Opcode)) {
1317 case ISD::FP_ROUND_INREG:
1318 case ISD::SIGN_EXTEND_INREG:
1324 return N1; // fold op(undef, arg2) -> undef
1331 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1336 // Fold a bunch of operators when the RHS is undef.
1337 if (N2.getOpcode() == ISD::UNDEF) {
1351 return N2; // fold op(arg1, undef) -> undef
1356 return getConstant(0, VT); // fold op(arg1, undef) -> 0
1358 return getConstant(MVT::getIntVTBitMask(VT), VT);
1364 // Finally, fold operations that do not require constants.
1366 case ISD::FP_ROUND_INREG:
1367 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1369 case ISD::SIGN_EXTEND_INREG: {
1370 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1371 if (EVT == VT) return N1; // Not actually extending
1374 case ISD::EXTRACT_ELEMENT:
1375 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
1377 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
1378 // 64-bit integers into 32-bit parts. Instead of building the extract of
1379 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
1380 if (N1.getOpcode() == ISD::BUILD_PAIR)
1381 return N1.getOperand(N2C->getValue());
1383 // EXTRACT_ELEMENT of a constant int is also very common.
1384 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
1385 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
1386 return getConstant(C->getValue() >> Shift, VT);
1390 // FIXME: figure out how to safely handle things like
1391 // int foo(int x) { return 1 << (x & 255); }
1392 // int bar() { return foo(256); }
1397 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1398 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1399 return getNode(Opcode, VT, N1, N2.getOperand(0));
1400 else if (N2.getOpcode() == ISD::AND)
1401 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1402 // If the and is only masking out bits that cannot effect the shift,
1403 // eliminate the and.
1404 unsigned NumBits = MVT::getSizeInBits(VT);
1405 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1406 return getNode(Opcode, VT, N1, N2.getOperand(0));
1412 // Memoize this node if possible.
1414 SDVTList VTs = getVTList(VT);
1415 if (VT != MVT::Flag) {
1416 SelectionDAGCSEMap::NodeID ID(Opcode, VTs, N1, N2);
1418 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1419 return SDOperand(E, 0);
1420 N = new SDNode(Opcode, N1, N2);
1421 N->setValueTypes(VTs);
1422 CSEMap.InsertNode(N, IP);
1424 N = new SDNode(Opcode, N1, N2);
1425 N->setValueTypes(VTs);
1428 AllNodes.push_back(N);
1429 return SDOperand(N, 0);
1432 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1433 SDOperand N1, SDOperand N2, SDOperand N3) {
1434 // Perform various simplifications.
1435 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1436 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1437 //ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
1440 // Use SimplifySetCC to simplify SETCC's.
1441 SDOperand Simp = SimplifySetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1442 if (Simp.Val) return Simp;
1447 if (N1C->getValue())
1448 return N2; // select true, X, Y -> X
1450 return N3; // select false, X, Y -> Y
1452 if (N2 == N3) return N2; // select C, X, X -> X
1456 if (N2C->getValue()) // Unconditional branch
1457 return getNode(ISD::BR, MVT::Other, N1, N3);
1459 return N1; // Never-taken branch
1461 case ISD::VECTOR_SHUFFLE:
1462 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1463 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1464 N3.getOpcode() == ISD::BUILD_VECTOR &&
1465 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1466 "Illegal VECTOR_SHUFFLE node!");
1470 // Memoize node if it doesn't produce a flag.
1472 SDVTList VTs = getVTList(VT);
1473 if (VT != MVT::Flag) {
1474 SelectionDAGCSEMap::NodeID ID(Opcode, VTs, N1, N2, N3);
1476 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1477 return SDOperand(E, 0);
1478 N = new SDNode(Opcode, N1, N2, N3);
1479 N->setValueTypes(VTs);
1480 CSEMap.InsertNode(N, IP);
1482 N = new SDNode(Opcode, N1, N2, N3);
1483 N->setValueTypes(VTs);
1485 AllNodes.push_back(N);
1486 return SDOperand(N, 0);
1489 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1490 SDOperand N1, SDOperand N2, SDOperand N3,
1492 SDOperand Ops[] = { N1, N2, N3, N4 };
1493 return getNode(Opcode, VT, Ops, 4);
1496 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1497 SDOperand N1, SDOperand N2, SDOperand N3,
1498 SDOperand N4, SDOperand N5) {
1499 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
1500 return getNode(Opcode, VT, Ops, 5);
1503 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1504 SDOperand Chain, SDOperand Ptr,
1505 const Value *SV, int SVOffset,
1507 // FIXME: Alignment == 1 for now.
1508 unsigned Alignment = 1;
1509 SDVTList VTs = getVTList(VT, MVT::Other);
1510 SDOperand Undef = getNode(ISD::UNDEF, VT);
1511 SelectionDAGCSEMap::NodeID ID(ISD::LOAD, VTs, Chain, Ptr, Undef);
1512 ID.AddInteger(ISD::UNINDEXED);
1513 ID.AddInteger(ISD::NON_EXTLOAD);
1516 ID.AddInteger(SVOffset);
1517 ID.AddInteger(Alignment);
1518 ID.AddInteger(isVolatile);
1520 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1521 return SDOperand(E, 0);
1522 SDNode *N = new LoadSDNode(Chain, Ptr, Undef, ISD::NON_EXTLOAD, VT,
1523 SV, SVOffset, Alignment, isVolatile);
1524 N->setValueTypes(VTs);
1525 CSEMap.InsertNode(N, IP);
1526 AllNodes.push_back(N);
1527 return SDOperand(N, 0);
1530 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
1531 SDOperand Chain, SDOperand Ptr, const Value *SV,
1532 int SVOffset, MVT::ValueType EVT,
1534 // If they are asking for an extending load from/to the same thing, return a
1537 ExtType = ISD::NON_EXTLOAD;
1539 if (MVT::isVector(VT))
1540 assert(EVT == MVT::getVectorBaseType(VT) && "Invalid vector extload!");
1542 assert(EVT < VT && "Should only be an extending load, not truncating!");
1543 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
1544 "Cannot sign/zero extend a FP/Vector load!");
1545 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
1546 "Cannot convert from FP to Int or Int -> FP!");
1548 // FIXME: Alignment == 1 for now.
1549 unsigned Alignment = 1;
1550 SDVTList VTs = getVTList(VT, MVT::Other);
1551 SDOperand Undef = getNode(ISD::UNDEF, VT);
1552 SelectionDAGCSEMap::NodeID ID(ISD::LOAD, VTs, Chain, Ptr, Undef);
1553 ID.AddInteger(ISD::UNINDEXED);
1554 ID.AddInteger(ExtType);
1557 ID.AddInteger(SVOffset);
1558 ID.AddInteger(Alignment);
1559 ID.AddInteger(isVolatile);
1561 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1562 return SDOperand(E, 0);
1563 SDNode *N = new LoadSDNode(Chain, Ptr, Undef, ExtType, EVT, SV, SVOffset,
1564 Alignment, isVolatile);
1565 N->setValueTypes(VTs);
1566 CSEMap.InsertNode(N, IP);
1567 AllNodes.push_back(N);
1568 return SDOperand(N, 0);
1571 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1572 SDOperand Chain, SDOperand Ptr,
1574 SDOperand Ops[] = { Chain, Ptr, SV, getConstant(Count, MVT::i32),
1575 getValueType(EVT) };
1576 return getNode(ISD::VLOAD, getVTList(MVT::Vector, MVT::Other), Ops, 5);
1579 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Value,
1580 SDOperand Ptr, SDOperand SV) {
1581 SDVTList VTs = getVTList(MVT::Other);
1582 SDOperand Ops[] = { Chain, Value, Ptr, SV };
1583 SelectionDAGCSEMap::NodeID ID(ISD::STORE, VTs, Ops, 4);
1585 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1586 return SDOperand(E, 0);
1587 SDNode *N = new SDNode(ISD::STORE, Chain, Value, Ptr, SV);
1588 N->setValueTypes(VTs);
1589 CSEMap.InsertNode(N, IP);
1590 AllNodes.push_back(N);
1591 return SDOperand(N, 0);
1594 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1595 SDOperand Chain, SDOperand Ptr,
1597 SDOperand Ops[] = { Chain, Ptr, SV };
1598 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
1601 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1602 const SDOperand *Ops, unsigned NumOps) {
1604 case 0: return getNode(Opcode, VT);
1605 case 1: return getNode(Opcode, VT, Ops[0]);
1606 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1607 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1613 case ISD::TRUNCSTORE: {
1614 assert(NumOps == 5 && "TRUNCSTORE takes 5 operands!");
1615 MVT::ValueType EVT = cast<VTSDNode>(Ops[4])->getVT();
1616 #if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store
1617 // If this is a truncating store of a constant, convert to the desired type
1618 // and store it instead.
1619 if (isa<Constant>(Ops[0])) {
1620 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1);
1621 if (isa<Constant>(Op))
1624 // Also for ConstantFP?
1626 if (Ops[0].getValueType() == EVT) // Normal store?
1627 return getStore(Ops[0], Ops[1], Ops[2], Ops[3]);
1628 assert(Ops[1].getValueType() > EVT && "Not a truncation?");
1629 assert(MVT::isInteger(Ops[1].getValueType()) == MVT::isInteger(EVT) &&
1630 "Can't do FP-INT conversion!");
1633 case ISD::SELECT_CC: {
1634 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
1635 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1636 "LHS and RHS of condition must have same type!");
1637 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1638 "True and False arms of SelectCC must have same type!");
1639 assert(Ops[2].getValueType() == VT &&
1640 "select_cc node must be of same type as true and false value!");
1644 assert(NumOps == 5 && "BR_CC takes 5 operands!");
1645 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1646 "LHS/RHS of comparison should match types!");
1653 SDVTList VTs = getVTList(VT);
1654 if (VT != MVT::Flag) {
1655 SelectionDAGCSEMap::NodeID ID(Opcode, VTs, Ops, NumOps);
1657 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1658 return SDOperand(E, 0);
1659 N = new SDNode(Opcode, Ops, NumOps);
1660 N->setValueTypes(VTs);
1661 CSEMap.InsertNode(N, IP);
1663 N = new SDNode(Opcode, Ops, NumOps);
1664 N->setValueTypes(VTs);
1666 AllNodes.push_back(N);
1667 return SDOperand(N, 0);
1670 SDOperand SelectionDAG::getNode(unsigned Opcode,
1671 std::vector<MVT::ValueType> &ResultTys,
1672 const SDOperand *Ops, unsigned NumOps) {
1673 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
1677 SDOperand SelectionDAG::getNode(unsigned Opcode,
1678 const MVT::ValueType *VTs, unsigned NumVTs,
1679 const SDOperand *Ops, unsigned NumOps) {
1681 return getNode(Opcode, VTs[0], Ops, NumOps);
1682 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
1685 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
1686 const SDOperand *Ops, unsigned NumOps) {
1687 if (VTList.NumVTs == 1)
1688 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
1691 // FIXME: figure out how to safely handle things like
1692 // int foo(int x) { return 1 << (x & 255); }
1693 // int bar() { return foo(256); }
1695 case ISD::SRA_PARTS:
1696 case ISD::SRL_PARTS:
1697 case ISD::SHL_PARTS:
1698 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1699 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1700 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1701 else if (N3.getOpcode() == ISD::AND)
1702 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1703 // If the and is only masking out bits that cannot effect the shift,
1704 // eliminate the and.
1705 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1706 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1707 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1713 // Memoize the node unless it returns a flag.
1715 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
1716 SelectionDAGCSEMap::NodeID ID;
1717 ID.SetOpcode(Opcode);
1718 ID.SetValueTypes(VTList);
1719 ID.SetOperands(&Ops[0], NumOps);
1721 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1722 return SDOperand(E, 0);
1723 N = new SDNode(Opcode, Ops, NumOps);
1724 N->setValueTypes(VTList);
1725 CSEMap.InsertNode(N, IP);
1727 N = new SDNode(Opcode, Ops, NumOps);
1728 N->setValueTypes(VTList);
1730 AllNodes.push_back(N);
1731 return SDOperand(N, 0);
1734 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
1735 return makeVTList(SDNode::getValueTypeList(VT), 1);
1738 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
1739 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1740 E = VTList.end(); I != E; ++I) {
1741 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
1742 return makeVTList(&(*I)[0], 2);
1744 std::vector<MVT::ValueType> V;
1747 VTList.push_front(V);
1748 return makeVTList(&(*VTList.begin())[0], 2);
1750 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
1751 MVT::ValueType VT3) {
1752 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1753 E = VTList.end(); I != E; ++I) {
1754 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
1756 return makeVTList(&(*I)[0], 3);
1758 std::vector<MVT::ValueType> V;
1762 VTList.push_front(V);
1763 return makeVTList(&(*VTList.begin())[0], 3);
1766 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
1768 case 0: assert(0 && "Cannot have nodes without results!");
1769 case 1: return makeVTList(SDNode::getValueTypeList(VTs[0]), 1);
1770 case 2: return getVTList(VTs[0], VTs[1]);
1771 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
1775 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1776 E = VTList.end(); I != E; ++I) {
1777 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
1779 bool NoMatch = false;
1780 for (unsigned i = 2; i != NumVTs; ++i)
1781 if (VTs[i] != (*I)[i]) {
1786 return makeVTList(&*I->begin(), NumVTs);
1789 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
1790 return makeVTList(&*VTList.begin()->begin(), NumVTs);
1794 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1795 /// specified operands. If the resultant node already exists in the DAG,
1796 /// this does not modify the specified node, instead it returns the node that
1797 /// already exists. If the resultant node does not exist in the DAG, the
1798 /// input node is returned. As a degenerate case, if you specify the same
1799 /// input operands as the node already has, the input node is returned.
1800 SDOperand SelectionDAG::
1801 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1802 SDNode *N = InN.Val;
1803 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1805 // Check to see if there is no change.
1806 if (Op == N->getOperand(0)) return InN;
1808 // See if the modified node already exists.
1809 void *InsertPos = 0;
1810 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
1811 return SDOperand(Existing, InN.ResNo);
1813 // Nope it doesn't. Remove the node from it's current place in the maps.
1815 RemoveNodeFromCSEMaps(N);
1817 // Now we update the operands.
1818 N->OperandList[0].Val->removeUser(N);
1820 N->OperandList[0] = Op;
1822 // If this gets put into a CSE map, add it.
1823 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
1827 SDOperand SelectionDAG::
1828 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1829 SDNode *N = InN.Val;
1830 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1832 // Check to see if there is no change.
1833 bool AnyChange = false;
1834 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1835 return InN; // No operands changed, just return the input node.
1837 // See if the modified node already exists.
1838 void *InsertPos = 0;
1839 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
1840 return SDOperand(Existing, InN.ResNo);
1842 // Nope it doesn't. Remove the node from it's current place in the maps.
1844 RemoveNodeFromCSEMaps(N);
1846 // Now we update the operands.
1847 if (N->OperandList[0] != Op1) {
1848 N->OperandList[0].Val->removeUser(N);
1849 Op1.Val->addUser(N);
1850 N->OperandList[0] = Op1;
1852 if (N->OperandList[1] != Op2) {
1853 N->OperandList[1].Val->removeUser(N);
1854 Op2.Val->addUser(N);
1855 N->OperandList[1] = Op2;
1858 // If this gets put into a CSE map, add it.
1859 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
1863 SDOperand SelectionDAG::
1864 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
1865 SDOperand Ops[] = { Op1, Op2, Op3 };
1866 return UpdateNodeOperands(N, Ops, 3);
1869 SDOperand SelectionDAG::
1870 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1871 SDOperand Op3, SDOperand Op4) {
1872 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
1873 return UpdateNodeOperands(N, Ops, 4);
1876 SDOperand SelectionDAG::
1877 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1878 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
1879 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
1880 return UpdateNodeOperands(N, Ops, 5);
1884 SDOperand SelectionDAG::
1885 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
1886 SDNode *N = InN.Val;
1887 assert(N->getNumOperands() == NumOps &&
1888 "Update with wrong number of operands");
1890 // Check to see if there is no change.
1891 bool AnyChange = false;
1892 for (unsigned i = 0; i != NumOps; ++i) {
1893 if (Ops[i] != N->getOperand(i)) {
1899 // No operands changed, just return the input node.
1900 if (!AnyChange) return InN;
1902 // See if the modified node already exists.
1903 void *InsertPos = 0;
1904 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
1905 return SDOperand(Existing, InN.ResNo);
1907 // Nope it doesn't. Remove the node from it's current place in the maps.
1909 RemoveNodeFromCSEMaps(N);
1911 // Now we update the operands.
1912 for (unsigned i = 0; i != NumOps; ++i) {
1913 if (N->OperandList[i] != Ops[i]) {
1914 N->OperandList[i].Val->removeUser(N);
1915 Ops[i].Val->addUser(N);
1916 N->OperandList[i] = Ops[i];
1920 // If this gets put into a CSE map, add it.
1921 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
1928 /// SelectNodeTo - These are used for target selectors to *mutate* the
1929 /// specified node to have the specified return type, Target opcode, and
1930 /// operands. Note that target opcodes are stored as
1931 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
1933 /// Note that SelectNodeTo returns the resultant node. If there is already a
1934 /// node of the specified opcode and operands, it returns that node instead of
1935 /// the current one.
1936 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1937 MVT::ValueType VT) {
1938 SDVTList VTs = getVTList(VT);
1939 SelectionDAGCSEMap::NodeID ID(ISD::BUILTIN_OP_END+TargetOpc, VTs);
1941 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
1944 RemoveNodeFromCSEMaps(N);
1946 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1947 N->setValueTypes(VTs);
1949 CSEMap.InsertNode(N, IP);
1953 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1954 MVT::ValueType VT, SDOperand Op1) {
1955 // If an identical node already exists, use it.
1956 SDVTList VTs = getVTList(VT);
1957 SelectionDAGCSEMap::NodeID ID(ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1);
1959 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
1962 RemoveNodeFromCSEMaps(N);
1963 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1964 N->setValueTypes(VTs);
1965 N->setOperands(Op1);
1966 CSEMap.InsertNode(N, IP);
1970 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1971 MVT::ValueType VT, SDOperand Op1,
1973 // If an identical node already exists, use it.
1974 SDVTList VTs = getVTList(VT);
1975 SelectionDAGCSEMap::NodeID ID(ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1, Op2);
1977 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
1980 RemoveNodeFromCSEMaps(N);
1981 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1982 N->setValueTypes(VTs);
1983 N->setOperands(Op1, Op2);
1985 CSEMap.InsertNode(N, IP); // Memoize the new node.
1989 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1990 MVT::ValueType VT, SDOperand Op1,
1991 SDOperand Op2, SDOperand Op3) {
1992 // If an identical node already exists, use it.
1993 SDVTList VTs = getVTList(VT);
1994 SelectionDAGCSEMap::NodeID ID(ISD::BUILTIN_OP_END+TargetOpc, VTs,
1997 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2000 RemoveNodeFromCSEMaps(N);
2001 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2002 N->setValueTypes(VTs);
2003 N->setOperands(Op1, Op2, Op3);
2005 CSEMap.InsertNode(N, IP); // Memoize the new node.
2009 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2010 MVT::ValueType VT, const SDOperand *Ops,
2012 // If an identical node already exists, use it.
2013 SDVTList VTs = getVTList(VT);
2014 SelectionDAGCSEMap::NodeID ID(ISD::BUILTIN_OP_END+TargetOpc, VTs);
2015 for (unsigned i = 0; i != NumOps; ++i)
2016 ID.AddOperand(Ops[i]);
2018 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2021 RemoveNodeFromCSEMaps(N);
2022 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2023 N->setValueTypes(VTs);
2024 N->setOperands(Ops, NumOps);
2026 CSEMap.InsertNode(N, IP); // Memoize the new node.
2030 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2031 MVT::ValueType VT1, MVT::ValueType VT2,
2032 SDOperand Op1, SDOperand Op2) {
2033 SDVTList VTs = getVTList(VT1, VT2);
2034 SelectionDAGCSEMap::NodeID ID(ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1, Op2);
2036 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2039 RemoveNodeFromCSEMaps(N);
2040 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2041 N->setValueTypes(VTs);
2042 N->setOperands(Op1, Op2);
2044 CSEMap.InsertNode(N, IP); // Memoize the new node.
2048 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2049 MVT::ValueType VT1, MVT::ValueType VT2,
2050 SDOperand Op1, SDOperand Op2,
2052 // If an identical node already exists, use it.
2053 SDVTList VTs = getVTList(VT1, VT2);
2054 SelectionDAGCSEMap::NodeID ID(ISD::BUILTIN_OP_END+TargetOpc, VTs,
2057 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2060 RemoveNodeFromCSEMaps(N);
2061 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2062 N->setValueTypes(VTs);
2063 N->setOperands(Op1, Op2, Op3);
2065 CSEMap.InsertNode(N, IP); // Memoize the new node.
2070 /// getTargetNode - These are used for target selectors to create a new node
2071 /// with specified return type(s), target opcode, and operands.
2073 /// Note that getTargetNode returns the resultant node. If there is already a
2074 /// node of the specified opcode and operands, it returns that node instead of
2075 /// the current one.
2076 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2077 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2079 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2081 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2083 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2084 SDOperand Op1, SDOperand Op2) {
2085 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2087 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2088 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2089 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2091 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2092 const SDOperand *Ops, unsigned NumOps) {
2093 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
2095 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2096 MVT::ValueType VT2, SDOperand Op1) {
2097 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2098 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
2100 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2101 MVT::ValueType VT2, SDOperand Op1,
2103 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2104 SDOperand Ops[] = { Op1, Op2 };
2105 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
2107 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2108 MVT::ValueType VT2, SDOperand Op1,
2109 SDOperand Op2, SDOperand Op3) {
2110 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2111 SDOperand Ops[] = { Op1, Op2, Op3 };
2112 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
2114 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2116 const SDOperand *Ops, unsigned NumOps) {
2117 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2118 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
2120 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2121 MVT::ValueType VT2, MVT::ValueType VT3,
2122 SDOperand Op1, SDOperand Op2) {
2123 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2124 SDOperand Ops[] = { Op1, Op2 };
2125 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
2127 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2128 MVT::ValueType VT2, MVT::ValueType VT3,
2129 const SDOperand *Ops, unsigned NumOps) {
2130 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2131 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
2134 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2135 /// This can cause recursive merging of nodes in the DAG.
2137 /// This version assumes From/To have a single result value.
2139 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2140 std::vector<SDNode*> *Deleted) {
2141 SDNode *From = FromN.Val, *To = ToN.Val;
2142 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2143 "Cannot replace with this method!");
2144 assert(From != To && "Cannot replace uses of with self");
2146 while (!From->use_empty()) {
2147 // Process users until they are all gone.
2148 SDNode *U = *From->use_begin();
2150 // This node is about to morph, remove its old self from the CSE maps.
2151 RemoveNodeFromCSEMaps(U);
2153 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2155 if (I->Val == From) {
2156 From->removeUser(U);
2161 // Now that we have modified U, add it back to the CSE maps. If it already
2162 // exists there, recursively merge the results together.
2163 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2164 ReplaceAllUsesWith(U, Existing, Deleted);
2166 if (Deleted) Deleted->push_back(U);
2167 DeleteNodeNotInCSEMaps(U);
2172 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2173 /// This can cause recursive merging of nodes in the DAG.
2175 /// This version assumes From/To have matching types and numbers of result
2178 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2179 std::vector<SDNode*> *Deleted) {
2180 assert(From != To && "Cannot replace uses of with self");
2181 assert(From->getNumValues() == To->getNumValues() &&
2182 "Cannot use this version of ReplaceAllUsesWith!");
2183 if (From->getNumValues() == 1) { // If possible, use the faster version.
2184 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
2188 while (!From->use_empty()) {
2189 // Process users until they are all gone.
2190 SDNode *U = *From->use_begin();
2192 // This node is about to morph, remove its old self from the CSE maps.
2193 RemoveNodeFromCSEMaps(U);
2195 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2197 if (I->Val == From) {
2198 From->removeUser(U);
2203 // Now that we have modified U, add it back to the CSE maps. If it already
2204 // exists there, recursively merge the results together.
2205 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2206 ReplaceAllUsesWith(U, Existing, Deleted);
2208 if (Deleted) Deleted->push_back(U);
2209 DeleteNodeNotInCSEMaps(U);
2214 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2215 /// This can cause recursive merging of nodes in the DAG.
2217 /// This version can replace From with any result values. To must match the
2218 /// number and types of values returned by From.
2219 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2220 const SDOperand *To,
2221 std::vector<SDNode*> *Deleted) {
2222 if (From->getNumValues() == 1 && To[0].Val->getNumValues() == 1) {
2223 // Degenerate case handled above.
2224 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2228 while (!From->use_empty()) {
2229 // Process users until they are all gone.
2230 SDNode *U = *From->use_begin();
2232 // This node is about to morph, remove its old self from the CSE maps.
2233 RemoveNodeFromCSEMaps(U);
2235 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2237 if (I->Val == From) {
2238 const SDOperand &ToOp = To[I->ResNo];
2239 From->removeUser(U);
2241 ToOp.Val->addUser(U);
2244 // Now that we have modified U, add it back to the CSE maps. If it already
2245 // exists there, recursively merge the results together.
2246 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2247 ReplaceAllUsesWith(U, Existing, Deleted);
2249 if (Deleted) Deleted->push_back(U);
2250 DeleteNodeNotInCSEMaps(U);
2255 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2256 /// uses of other values produced by From.Val alone. The Deleted vector is
2257 /// handled the same was as for ReplaceAllUsesWith.
2258 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2259 std::vector<SDNode*> &Deleted) {
2260 assert(From != To && "Cannot replace a value with itself");
2261 // Handle the simple, trivial, case efficiently.
2262 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2263 ReplaceAllUsesWith(From, To, &Deleted);
2267 // Get all of the users in a nice, deterministically ordered, uniqued set.
2268 SetVector<SDNode*> Users(From.Val->use_begin(), From.Val->use_end());
2270 while (!Users.empty()) {
2271 // We know that this user uses some value of From. If it is the right
2272 // value, update it.
2273 SDNode *User = Users.back();
2276 for (SDOperand *Op = User->OperandList,
2277 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2279 // Okay, we know this user needs to be updated. Remove its old self
2280 // from the CSE maps.
2281 RemoveNodeFromCSEMaps(User);
2283 // Update all operands that match "From".
2284 for (; Op != E; ++Op) {
2286 From.Val->removeUser(User);
2288 To.Val->addUser(User);
2292 // Now that we have modified User, add it back to the CSE maps. If it
2293 // already exists there, recursively merge the results together.
2294 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2295 unsigned NumDeleted = Deleted.size();
2296 ReplaceAllUsesWith(User, Existing, &Deleted);
2298 // User is now dead.
2299 Deleted.push_back(User);
2300 DeleteNodeNotInCSEMaps(User);
2302 // We have to be careful here, because ReplaceAllUsesWith could have
2303 // deleted a user of From, which means there may be dangling pointers
2304 // in the "Users" setvector. Scan over the deleted node pointers and
2305 // remove them from the setvector.
2306 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2307 Users.remove(Deleted[i]);
2309 break; // Exit the operand scanning loop.
2316 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
2317 /// their allnodes order. It returns the maximum id.
2318 unsigned SelectionDAG::AssignNodeIds() {
2320 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
2327 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
2328 /// based on their topological order. It returns the maximum id and a vector
2329 /// of the SDNodes* in assigned order by reference.
2330 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
2331 unsigned DAGSize = AllNodes.size();
2332 std::vector<unsigned> InDegree(DAGSize);
2333 std::vector<SDNode*> Sources;
2335 // Use a two pass approach to avoid using a std::map which is slow.
2337 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
2340 unsigned Degree = N->use_size();
2341 InDegree[N->getNodeId()] = Degree;
2343 Sources.push_back(N);
2347 while (!Sources.empty()) {
2348 SDNode *N = Sources.back();
2350 TopOrder.push_back(N);
2351 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
2353 unsigned Degree = --InDegree[P->getNodeId()];
2355 Sources.push_back(P);
2359 // Second pass, assign the actual topological order as node ids.
2361 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
2363 (*TI)->setNodeId(Id++);
2370 //===----------------------------------------------------------------------===//
2372 //===----------------------------------------------------------------------===//
2374 // Out-of-line virtual method to give class a home.
2375 void SDNode::ANCHOR() {
2378 /// getValueTypeList - Return a pointer to the specified value type.
2380 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2381 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2386 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2387 /// indicated value. This method ignores uses of other values defined by this
2389 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2390 assert(Value < getNumValues() && "Bad value!");
2392 // If there is only one value, this is easy.
2393 if (getNumValues() == 1)
2394 return use_size() == NUses;
2395 if (Uses.size() < NUses) return false;
2397 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2399 std::set<SDNode*> UsersHandled;
2401 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
2403 if (User->getNumOperands() == 1 ||
2404 UsersHandled.insert(User).second) // First time we've seen this?
2405 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2406 if (User->getOperand(i) == TheValue) {
2408 return false; // too many uses
2413 // Found exactly the right number of uses?
2418 // isOnlyUse - Return true if this node is the only use of N.
2419 bool SDNode::isOnlyUse(SDNode *N) const {
2421 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2432 // isOperand - Return true if this node is an operand of N.
2433 bool SDOperand::isOperand(SDNode *N) const {
2434 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2435 if (*this == N->getOperand(i))
2440 bool SDNode::isOperand(SDNode *N) const {
2441 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2442 if (this == N->OperandList[i].Val)
2447 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
2448 assert(Num < NumOperands && "Invalid child # of SDNode!");
2449 return cast<ConstantSDNode>(OperandList[Num])->getValue();
2452 const char *SDNode::getOperationName(const SelectionDAG *G) const {
2453 switch (getOpcode()) {
2455 if (getOpcode() < ISD::BUILTIN_OP_END)
2456 return "<<Unknown DAG Node>>";
2459 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2460 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2461 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2463 TargetLowering &TLI = G->getTargetLoweringInfo();
2465 TLI.getTargetNodeName(getOpcode());
2466 if (Name) return Name;
2469 return "<<Unknown Target Node>>";
2472 case ISD::PCMARKER: return "PCMarker";
2473 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2474 case ISD::SRCVALUE: return "SrcValue";
2475 case ISD::EntryToken: return "EntryToken";
2476 case ISD::TokenFactor: return "TokenFactor";
2477 case ISD::AssertSext: return "AssertSext";
2478 case ISD::AssertZext: return "AssertZext";
2480 case ISD::STRING: return "String";
2481 case ISD::BasicBlock: return "BasicBlock";
2482 case ISD::VALUETYPE: return "ValueType";
2483 case ISD::Register: return "Register";
2485 case ISD::Constant: return "Constant";
2486 case ISD::ConstantFP: return "ConstantFP";
2487 case ISD::GlobalAddress: return "GlobalAddress";
2488 case ISD::FrameIndex: return "FrameIndex";
2489 case ISD::JumpTable: return "JumpTable";
2490 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
2491 case ISD::ConstantPool: return "ConstantPool";
2492 case ISD::ExternalSymbol: return "ExternalSymbol";
2493 case ISD::INTRINSIC_WO_CHAIN: {
2494 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2495 return Intrinsic::getName((Intrinsic::ID)IID);
2497 case ISD::INTRINSIC_VOID:
2498 case ISD::INTRINSIC_W_CHAIN: {
2499 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2500 return Intrinsic::getName((Intrinsic::ID)IID);
2503 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2504 case ISD::TargetConstant: return "TargetConstant";
2505 case ISD::TargetConstantFP:return "TargetConstantFP";
2506 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2507 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2508 case ISD::TargetJumpTable: return "TargetJumpTable";
2509 case ISD::TargetConstantPool: return "TargetConstantPool";
2510 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2512 case ISD::CopyToReg: return "CopyToReg";
2513 case ISD::CopyFromReg: return "CopyFromReg";
2514 case ISD::UNDEF: return "undef";
2515 case ISD::MERGE_VALUES: return "mergevalues";
2516 case ISD::INLINEASM: return "inlineasm";
2517 case ISD::HANDLENODE: return "handlenode";
2518 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
2519 case ISD::CALL: return "call";
2522 case ISD::FABS: return "fabs";
2523 case ISD::FNEG: return "fneg";
2524 case ISD::FSQRT: return "fsqrt";
2525 case ISD::FSIN: return "fsin";
2526 case ISD::FCOS: return "fcos";
2527 case ISD::FPOWI: return "fpowi";
2530 case ISD::ADD: return "add";
2531 case ISD::SUB: return "sub";
2532 case ISD::MUL: return "mul";
2533 case ISD::MULHU: return "mulhu";
2534 case ISD::MULHS: return "mulhs";
2535 case ISD::SDIV: return "sdiv";
2536 case ISD::UDIV: return "udiv";
2537 case ISD::SREM: return "srem";
2538 case ISD::UREM: return "urem";
2539 case ISD::AND: return "and";
2540 case ISD::OR: return "or";
2541 case ISD::XOR: return "xor";
2542 case ISD::SHL: return "shl";
2543 case ISD::SRA: return "sra";
2544 case ISD::SRL: return "srl";
2545 case ISD::ROTL: return "rotl";
2546 case ISD::ROTR: return "rotr";
2547 case ISD::FADD: return "fadd";
2548 case ISD::FSUB: return "fsub";
2549 case ISD::FMUL: return "fmul";
2550 case ISD::FDIV: return "fdiv";
2551 case ISD::FREM: return "frem";
2552 case ISD::FCOPYSIGN: return "fcopysign";
2553 case ISD::VADD: return "vadd";
2554 case ISD::VSUB: return "vsub";
2555 case ISD::VMUL: return "vmul";
2556 case ISD::VSDIV: return "vsdiv";
2557 case ISD::VUDIV: return "vudiv";
2558 case ISD::VAND: return "vand";
2559 case ISD::VOR: return "vor";
2560 case ISD::VXOR: return "vxor";
2562 case ISD::SETCC: return "setcc";
2563 case ISD::SELECT: return "select";
2564 case ISD::SELECT_CC: return "select_cc";
2565 case ISD::VSELECT: return "vselect";
2566 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2567 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2568 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2569 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2570 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2571 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2572 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2573 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2574 case ISD::VBIT_CONVERT: return "vbit_convert";
2575 case ISD::ADDC: return "addc";
2576 case ISD::ADDE: return "adde";
2577 case ISD::SUBC: return "subc";
2578 case ISD::SUBE: return "sube";
2579 case ISD::SHL_PARTS: return "shl_parts";
2580 case ISD::SRA_PARTS: return "sra_parts";
2581 case ISD::SRL_PARTS: return "srl_parts";
2583 // Conversion operators.
2584 case ISD::SIGN_EXTEND: return "sign_extend";
2585 case ISD::ZERO_EXTEND: return "zero_extend";
2586 case ISD::ANY_EXTEND: return "any_extend";
2587 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2588 case ISD::TRUNCATE: return "truncate";
2589 case ISD::FP_ROUND: return "fp_round";
2590 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2591 case ISD::FP_EXTEND: return "fp_extend";
2593 case ISD::SINT_TO_FP: return "sint_to_fp";
2594 case ISD::UINT_TO_FP: return "uint_to_fp";
2595 case ISD::FP_TO_SINT: return "fp_to_sint";
2596 case ISD::FP_TO_UINT: return "fp_to_uint";
2597 case ISD::BIT_CONVERT: return "bit_convert";
2599 // Control flow instructions
2600 case ISD::BR: return "br";
2601 case ISD::BRIND: return "brind";
2602 case ISD::BRCOND: return "brcond";
2603 case ISD::BR_CC: return "br_cc";
2604 case ISD::RET: return "ret";
2605 case ISD::CALLSEQ_START: return "callseq_start";
2606 case ISD::CALLSEQ_END: return "callseq_end";
2609 case ISD::LOAD: return "load";
2610 case ISD::STORE: return "store";
2611 case ISD::VLOAD: return "vload";
2612 case ISD::TRUNCSTORE: return "truncstore";
2613 case ISD::VAARG: return "vaarg";
2614 case ISD::VACOPY: return "vacopy";
2615 case ISD::VAEND: return "vaend";
2616 case ISD::VASTART: return "vastart";
2617 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2618 case ISD::EXTRACT_ELEMENT: return "extract_element";
2619 case ISD::BUILD_PAIR: return "build_pair";
2620 case ISD::STACKSAVE: return "stacksave";
2621 case ISD::STACKRESTORE: return "stackrestore";
2623 // Block memory operations.
2624 case ISD::MEMSET: return "memset";
2625 case ISD::MEMCPY: return "memcpy";
2626 case ISD::MEMMOVE: return "memmove";
2629 case ISD::BSWAP: return "bswap";
2630 case ISD::CTPOP: return "ctpop";
2631 case ISD::CTTZ: return "cttz";
2632 case ISD::CTLZ: return "ctlz";
2635 case ISD::LOCATION: return "location";
2636 case ISD::DEBUG_LOC: return "debug_loc";
2637 case ISD::DEBUG_LABEL: return "debug_label";
2640 switch (cast<CondCodeSDNode>(this)->get()) {
2641 default: assert(0 && "Unknown setcc condition!");
2642 case ISD::SETOEQ: return "setoeq";
2643 case ISD::SETOGT: return "setogt";
2644 case ISD::SETOGE: return "setoge";
2645 case ISD::SETOLT: return "setolt";
2646 case ISD::SETOLE: return "setole";
2647 case ISD::SETONE: return "setone";
2649 case ISD::SETO: return "seto";
2650 case ISD::SETUO: return "setuo";
2651 case ISD::SETUEQ: return "setue";
2652 case ISD::SETUGT: return "setugt";
2653 case ISD::SETUGE: return "setuge";
2654 case ISD::SETULT: return "setult";
2655 case ISD::SETULE: return "setule";
2656 case ISD::SETUNE: return "setune";
2658 case ISD::SETEQ: return "seteq";
2659 case ISD::SETGT: return "setgt";
2660 case ISD::SETGE: return "setge";
2661 case ISD::SETLT: return "setlt";
2662 case ISD::SETLE: return "setle";
2663 case ISD::SETNE: return "setne";
2668 void SDNode::dump() const { dump(0); }
2669 void SDNode::dump(const SelectionDAG *G) const {
2670 std::cerr << (void*)this << ": ";
2672 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
2673 if (i) std::cerr << ",";
2674 if (getValueType(i) == MVT::Other)
2677 std::cerr << MVT::getValueTypeString(getValueType(i));
2679 std::cerr << " = " << getOperationName(G);
2682 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2683 if (i) std::cerr << ", ";
2684 std::cerr << (void*)getOperand(i).Val;
2685 if (unsigned RN = getOperand(i).ResNo)
2686 std::cerr << ":" << RN;
2689 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
2690 std::cerr << "<" << CSDN->getValue() << ">";
2691 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
2692 std::cerr << "<" << CSDN->getValue() << ">";
2693 } else if (const GlobalAddressSDNode *GADN =
2694 dyn_cast<GlobalAddressSDNode>(this)) {
2695 int offset = GADN->getOffset();
2697 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
2699 std::cerr << " + " << offset;
2701 std::cerr << " " << offset;
2702 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
2703 std::cerr << "<" << FIDN->getIndex() << ">";
2704 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
2705 int offset = CP->getOffset();
2706 if (CP->isMachineConstantPoolEntry())
2707 std::cerr << "<" << *CP->getMachineCPVal() << ">";
2709 std::cerr << "<" << *CP->getConstVal() << ">";
2711 std::cerr << " + " << offset;
2713 std::cerr << " " << offset;
2714 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
2716 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
2718 std::cerr << LBB->getName() << " ";
2719 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
2720 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
2721 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
2722 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
2724 std::cerr << " #" << R->getReg();
2726 } else if (const ExternalSymbolSDNode *ES =
2727 dyn_cast<ExternalSymbolSDNode>(this)) {
2728 std::cerr << "'" << ES->getSymbol() << "'";
2729 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
2731 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
2733 std::cerr << "<null:" << M->getOffset() << ">";
2734 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
2735 std::cerr << ":" << getValueTypeString(N->getVT());
2736 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
2738 switch (LD->getExtensionType()) {
2739 default: doExt = false; break;
2741 std::cerr << " <anyext ";
2744 std::cerr << " <sext ";
2747 std::cerr << " <zext ";
2751 std::cerr << MVT::getValueTypeString(LD->getLoadedVT()) << ">";
2753 if (LD->getAddressingMode() == ISD::PRE_INDEXED)
2754 std::cerr << " <pre>";
2755 else if (LD->getAddressingMode() == ISD::POST_INDEXED)
2756 std::cerr << " <post>";
2760 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
2761 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2762 if (N->getOperand(i).Val->hasOneUse())
2763 DumpNodes(N->getOperand(i).Val, indent+2, G);
2765 std::cerr << "\n" << std::string(indent+2, ' ')
2766 << (void*)N->getOperand(i).Val << ": <multiple use>";
2769 std::cerr << "\n" << std::string(indent, ' ');
2773 void SelectionDAG::dump() const {
2774 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
2775 std::vector<const SDNode*> Nodes;
2776 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
2780 std::sort(Nodes.begin(), Nodes.end());
2782 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2783 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
2784 DumpNodes(Nodes[i], 2, this);
2787 DumpNodes(getRoot().Val, 2, this);
2789 std::cerr << "\n\n";
2792 const Type *ConstantPoolSDNode::getType() const {
2793 if (isMachineConstantPoolEntry())
2794 return Val.MachineCPVal->getType();
2795 return Val.ConstVal->getType();