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/Support/MathExtras.h"
21 #include "llvm/Target/MRegisterInfo.h"
22 #include "llvm/Target/TargetLowering.h"
23 #include "llvm/Target/TargetInstrInfo.h"
24 #include "llvm/Target/TargetMachine.h"
25 #include "llvm/ADT/SetVector.h"
26 #include "llvm/ADT/StringExtras.h"
33 static bool isCommutativeBinOp(unsigned Opcode) {
43 case ISD::XOR: return true;
44 default: return false; // FIXME: Need commutative info for user ops!
48 // isInvertibleForFree - Return true if there is no cost to emitting the logical
49 // inverse of this node.
50 static bool isInvertibleForFree(SDOperand N) {
51 if (isa<ConstantSDNode>(N.Val)) return true;
52 if (N.Val->getOpcode() == ISD::SETCC && N.Val->hasOneUse())
57 //===----------------------------------------------------------------------===//
58 // ConstantFPSDNode Class
59 //===----------------------------------------------------------------------===//
61 /// isExactlyValue - We don't rely on operator== working on double values, as
62 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
63 /// As such, this method can be used to do an exact bit-for-bit comparison of
64 /// two floating point values.
65 bool ConstantFPSDNode::isExactlyValue(double V) const {
66 return DoubleToBits(V) == DoubleToBits(Value);
69 //===----------------------------------------------------------------------===//
71 //===----------------------------------------------------------------------===//
73 /// isBuildVectorAllOnes - Return true if the specified node is a
74 /// BUILD_VECTOR where all of the elements are ~0 or undef.
75 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
76 // Look through a bit convert.
77 if (N->getOpcode() == ISD::BIT_CONVERT)
78 N = N->getOperand(0).Val;
80 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
82 unsigned i = 0, e = N->getNumOperands();
84 // Skip over all of the undef values.
85 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
88 // Do not accept an all-undef vector.
89 if (i == e) return false;
91 // Do not accept build_vectors that aren't all constants or which have non-~0
93 SDOperand NotZero = N->getOperand(i);
94 if (isa<ConstantSDNode>(NotZero)) {
95 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
97 } else if (isa<ConstantFPSDNode>(NotZero)) {
98 MVT::ValueType VT = NotZero.getValueType();
100 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
104 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
111 // Okay, we have at least one ~0 value, check to see if the rest match or are
113 for (++i; i != e; ++i)
114 if (N->getOperand(i) != NotZero &&
115 N->getOperand(i).getOpcode() != ISD::UNDEF)
121 /// isBuildVectorAllZeros - Return true if the specified node is a
122 /// BUILD_VECTOR where all of the elements are 0 or undef.
123 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
124 // Look through a bit convert.
125 if (N->getOpcode() == ISD::BIT_CONVERT)
126 N = N->getOperand(0).Val;
128 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
130 unsigned i = 0, e = N->getNumOperands();
132 // Skip over all of the undef values.
133 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
136 // Do not accept an all-undef vector.
137 if (i == e) return false;
139 // Do not accept build_vectors that aren't all constants or which have non-~0
141 SDOperand Zero = N->getOperand(i);
142 if (isa<ConstantSDNode>(Zero)) {
143 if (!cast<ConstantSDNode>(Zero)->isNullValue())
145 } else if (isa<ConstantFPSDNode>(Zero)) {
146 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0))
151 // Okay, we have at least one ~0 value, check to see if the rest match or are
153 for (++i; i != e; ++i)
154 if (N->getOperand(i) != Zero &&
155 N->getOperand(i).getOpcode() != ISD::UNDEF)
160 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
161 /// when given the operation for (X op Y).
162 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
163 // To perform this operation, we just need to swap the L and G bits of the
165 unsigned OldL = (Operation >> 2) & 1;
166 unsigned OldG = (Operation >> 1) & 1;
167 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
168 (OldL << 1) | // New G bit
169 (OldG << 2)); // New L bit.
172 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
173 /// 'op' is a valid SetCC operation.
174 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
175 unsigned Operation = Op;
177 Operation ^= 7; // Flip L, G, E bits, but not U.
179 Operation ^= 15; // Flip all of the condition bits.
180 if (Operation > ISD::SETTRUE2)
181 Operation &= ~8; // Don't let N and U bits get set.
182 return ISD::CondCode(Operation);
186 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
187 /// signed operation and 2 if the result is an unsigned comparison. Return zero
188 /// if the operation does not depend on the sign of the input (setne and seteq).
189 static int isSignedOp(ISD::CondCode Opcode) {
191 default: assert(0 && "Illegal integer setcc operation!");
193 case ISD::SETNE: return 0;
197 case ISD::SETGE: return 1;
201 case ISD::SETUGE: return 2;
205 /// getSetCCOrOperation - Return the result of a logical OR between different
206 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
207 /// returns SETCC_INVALID if it is not possible to represent the resultant
209 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
211 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
212 // Cannot fold a signed integer setcc with an unsigned integer setcc.
213 return ISD::SETCC_INVALID;
215 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
217 // If the N and U bits get set then the resultant comparison DOES suddenly
218 // care about orderedness, and is true when ordered.
219 if (Op > ISD::SETTRUE2)
220 Op &= ~16; // Clear the N bit.
221 return ISD::CondCode(Op);
224 /// getSetCCAndOperation - Return the result of a logical AND between different
225 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
226 /// function returns zero if it is not possible to represent the resultant
228 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
230 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
231 // Cannot fold a signed setcc with an unsigned setcc.
232 return ISD::SETCC_INVALID;
234 // Combine all of the condition bits.
235 return ISD::CondCode(Op1 & Op2);
238 const TargetMachine &SelectionDAG::getTarget() const {
239 return TLI.getTargetMachine();
242 //===----------------------------------------------------------------------===//
243 // SelectionDAG Class
244 //===----------------------------------------------------------------------===//
246 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
247 /// SelectionDAG, including nodes (like loads) that have uses of their token
248 /// chain but no other uses and no side effect. If a node is passed in as an
249 /// argument, it is used as the seed for node deletion.
250 void SelectionDAG::RemoveDeadNodes(SDNode *N) {
251 // Create a dummy node (which is not added to allnodes), that adds a reference
252 // to the root node, preventing it from being deleted.
253 HandleSDNode Dummy(getRoot());
255 bool MadeChange = false;
257 // If we have a hint to start from, use it.
258 if (N && N->use_empty()) {
263 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
264 if (I->use_empty() && I->getOpcode() != 65535) {
265 // Node is dead, recursively delete newly dead uses.
270 // Walk the nodes list, removing the nodes we've marked as dead.
272 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ) {
279 // If the root changed (e.g. it was a dead load, update the root).
280 setRoot(Dummy.getValue());
283 /// DestroyDeadNode - We know that N is dead. Nuke it from the CSE maps for the
284 /// graph. If it is the last user of any of its operands, recursively process
285 /// them the same way.
287 void SelectionDAG::DestroyDeadNode(SDNode *N) {
288 // Okay, we really are going to delete this node. First take this out of the
289 // appropriate CSE map.
290 RemoveNodeFromCSEMaps(N);
292 // Next, brutally remove the operand list. This is safe to do, as there are
293 // no cycles in the graph.
294 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
298 // Now that we removed this operand, see if there are no uses of it left.
302 delete[] N->OperandList;
306 // Mark the node as dead.
307 N->MorphNodeTo(65535);
310 void SelectionDAG::DeleteNode(SDNode *N) {
311 assert(N->use_empty() && "Cannot delete a node that is not dead!");
313 // First take this out of the appropriate CSE map.
314 RemoveNodeFromCSEMaps(N);
316 // Finally, remove uses due to operands of this node, remove from the
317 // AllNodes list, and delete the node.
318 DeleteNodeNotInCSEMaps(N);
321 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
323 // Remove it from the AllNodes list.
326 // Drop all of the operands and decrement used nodes use counts.
327 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
328 I->Val->removeUser(N);
329 delete[] N->OperandList;
336 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
337 /// correspond to it. This is useful when we're about to delete or repurpose
338 /// the node. We don't want future request for structurally identical nodes
339 /// to return N anymore.
340 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
342 switch (N->getOpcode()) {
343 case ISD::HANDLENODE: return; // noop.
345 Erased = Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(),
346 N->getValueType(0)));
348 case ISD::TargetConstant:
349 Erased = TargetConstants.erase(std::make_pair(
350 cast<ConstantSDNode>(N)->getValue(),
351 N->getValueType(0)));
353 case ISD::ConstantFP: {
354 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
355 Erased = ConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
358 case ISD::TargetConstantFP: {
359 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
360 Erased = TargetConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
364 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
367 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
368 "Cond code doesn't exist!");
369 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
370 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
372 case ISD::GlobalAddress: {
373 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
374 Erased = GlobalValues.erase(std::make_pair(GN->getGlobal(),
378 case ISD::TargetGlobalAddress: {
379 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
380 Erased =TargetGlobalValues.erase(std::make_pair(GN->getGlobal(),
384 case ISD::FrameIndex:
385 Erased = FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
387 case ISD::TargetFrameIndex:
388 Erased = TargetFrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
391 Erased = JumpTableIndices.erase(cast<JumpTableSDNode>(N)->getIndex());
393 case ISD::TargetJumpTable:
395 TargetJumpTableIndices.erase(cast<JumpTableSDNode>(N)->getIndex());
397 case ISD::ConstantPool:
398 Erased = ConstantPoolIndices.
399 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
400 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
401 cast<ConstantPoolSDNode>(N)->getAlignment())));
403 case ISD::TargetConstantPool:
404 Erased = TargetConstantPoolIndices.
405 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
406 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
407 cast<ConstantPoolSDNode>(N)->getAlignment())));
409 case ISD::BasicBlock:
410 Erased = BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock());
412 case ISD::ExternalSymbol:
413 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
415 case ISD::TargetExternalSymbol:
417 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
420 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
421 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
424 Erased = RegNodes.erase(std::make_pair(cast<RegisterSDNode>(N)->getReg(),
425 N->getValueType(0)));
427 case ISD::SRCVALUE: {
428 SrcValueSDNode *SVN = cast<SrcValueSDNode>(N);
429 Erased =ValueNodes.erase(std::make_pair(SVN->getValue(), SVN->getOffset()));
433 Erased = Loads.erase(std::make_pair(N->getOperand(1),
434 std::make_pair(N->getOperand(0),
435 N->getValueType(0))));
438 if (N->getNumValues() == 1) {
439 if (N->getNumOperands() == 0) {
440 Erased = NullaryOps.erase(std::make_pair(N->getOpcode(),
441 N->getValueType(0)));
442 } else if (N->getNumOperands() == 1) {
444 UnaryOps.erase(std::make_pair(N->getOpcode(),
445 std::make_pair(N->getOperand(0),
446 N->getValueType(0))));
447 } else if (N->getNumOperands() == 2) {
449 BinaryOps.erase(std::make_pair(N->getOpcode(),
450 std::make_pair(N->getOperand(0),
453 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
455 OneResultNodes.erase(std::make_pair(N->getOpcode(),
456 std::make_pair(N->getValueType(0),
460 // Remove the node from the ArbitraryNodes map.
461 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
462 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
464 ArbitraryNodes.erase(std::make_pair(N->getOpcode(),
465 std::make_pair(RV, Ops)));
470 // Verify that the node was actually in one of the CSE maps, unless it has a
471 // flag result (which cannot be CSE'd) or is one of the special cases that are
472 // not subject to CSE.
473 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
474 !N->isTargetOpcode()) {
476 assert(0 && "Node is not in map!");
481 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
482 /// has been taken out and modified in some way. If the specified node already
483 /// exists in the CSE maps, do not modify the maps, but return the existing node
484 /// instead. If it doesn't exist, add it and return null.
486 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
487 assert(N->getNumOperands() && "This is a leaf node!");
488 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
489 return 0; // Never add these nodes.
491 // Check that remaining values produced are not flags.
492 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
493 if (N->getValueType(i) == MVT::Flag)
494 return 0; // Never CSE anything that produces a flag.
496 if (N->getNumValues() == 1) {
497 if (N->getNumOperands() == 1) {
498 SDNode *&U = UnaryOps[std::make_pair(N->getOpcode(),
499 std::make_pair(N->getOperand(0),
500 N->getValueType(0)))];
503 } else if (N->getNumOperands() == 2) {
504 SDNode *&B = BinaryOps[std::make_pair(N->getOpcode(),
505 std::make_pair(N->getOperand(0),
510 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
511 SDNode *&ORN = OneResultNodes[std::make_pair(N->getOpcode(),
512 std::make_pair(N->getValueType(0), Ops))];
517 if (N->getOpcode() == ISD::LOAD) {
518 SDNode *&L = Loads[std::make_pair(N->getOperand(1),
519 std::make_pair(N->getOperand(0),
520 N->getValueType(0)))];
524 // Remove the node from the ArbitraryNodes map.
525 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
526 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
527 SDNode *&AN = ArbitraryNodes[std::make_pair(N->getOpcode(),
528 std::make_pair(RV, Ops))];
536 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
537 /// were replaced with those specified. If this node is never memoized,
538 /// return null, otherwise return a pointer to the slot it would take. If a
539 /// node already exists with these operands, the slot will be non-null.
540 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op) {
541 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
542 return 0; // Never add these nodes.
544 // Check that remaining values produced are not flags.
545 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
546 if (N->getValueType(i) == MVT::Flag)
547 return 0; // Never CSE anything that produces a flag.
549 if (N->getNumValues() == 1) {
550 return &UnaryOps[std::make_pair(N->getOpcode(),
551 std::make_pair(Op, N->getValueType(0)))];
553 // Remove the node from the ArbitraryNodes map.
554 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
555 std::vector<SDOperand> Ops;
557 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
558 std::make_pair(RV, Ops))];
563 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
564 /// were replaced with those specified. If this node is never memoized,
565 /// return null, otherwise return a pointer to the slot it would take. If a
566 /// node already exists with these operands, the slot will be non-null.
567 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
568 SDOperand Op1, SDOperand Op2) {
569 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
570 return 0; // Never add these nodes.
572 // Check that remaining values produced are not flags.
573 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
574 if (N->getValueType(i) == MVT::Flag)
575 return 0; // Never CSE anything that produces a flag.
577 if (N->getNumValues() == 1) {
578 return &BinaryOps[std::make_pair(N->getOpcode(),
579 std::make_pair(Op1, Op2))];
581 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
582 std::vector<SDOperand> Ops;
585 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
586 std::make_pair(RV, Ops))];
592 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
593 /// were replaced with those specified. If this node is never memoized,
594 /// return null, otherwise return a pointer to the slot it would take. If a
595 /// node already exists with these operands, the slot will be non-null.
596 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
597 const std::vector<SDOperand> &Ops) {
598 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
599 return 0; // Never add these nodes.
601 // Check that remaining values produced are not flags.
602 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
603 if (N->getValueType(i) == MVT::Flag)
604 return 0; // Never CSE anything that produces a flag.
606 if (N->getNumValues() == 1) {
607 if (N->getNumOperands() == 1) {
608 return &UnaryOps[std::make_pair(N->getOpcode(),
609 std::make_pair(Ops[0],
610 N->getValueType(0)))];
611 } else if (N->getNumOperands() == 2) {
612 return &BinaryOps[std::make_pair(N->getOpcode(),
613 std::make_pair(Ops[0], Ops[1]))];
615 return &OneResultNodes[std::make_pair(N->getOpcode(),
616 std::make_pair(N->getValueType(0),
620 if (N->getOpcode() == ISD::LOAD) {
621 return &Loads[std::make_pair(Ops[1],
622 std::make_pair(Ops[0], N->getValueType(0)))];
624 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
625 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
626 std::make_pair(RV, Ops))];
633 SelectionDAG::~SelectionDAG() {
634 while (!AllNodes.empty()) {
635 SDNode *N = AllNodes.begin();
636 delete [] N->OperandList;
639 AllNodes.pop_front();
643 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
644 if (Op.getValueType() == VT) return Op;
645 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
646 return getNode(ISD::AND, Op.getValueType(), Op,
647 getConstant(Imm, Op.getValueType()));
650 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) {
651 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
652 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
654 // Mask out any bits that are not valid for this constant.
656 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
658 SDNode *&N = Constants[std::make_pair(Val, VT)];
659 if (N) return SDOperand(N, 0);
660 N = new ConstantSDNode(false, Val, VT);
661 AllNodes.push_back(N);
662 return SDOperand(N, 0);
665 SDOperand SelectionDAG::getString(const std::string &Val) {
666 StringSDNode *&N = StringNodes[Val];
668 N = new StringSDNode(Val);
669 AllNodes.push_back(N);
671 return SDOperand(N, 0);
674 SDOperand SelectionDAG::getTargetConstant(uint64_t Val, MVT::ValueType VT) {
675 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
676 // Mask out any bits that are not valid for this constant.
678 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
680 SDNode *&N = TargetConstants[std::make_pair(Val, VT)];
681 if (N) return SDOperand(N, 0);
682 N = new ConstantSDNode(true, Val, VT);
683 AllNodes.push_back(N);
684 return SDOperand(N, 0);
687 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) {
688 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
690 Val = (float)Val; // Mask out extra precision.
692 // Do the map lookup using the actual bit pattern for the floating point
693 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
694 // we don't have issues with SNANs.
695 SDNode *&N = ConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
696 if (N) return SDOperand(N, 0);
697 N = new ConstantFPSDNode(false, Val, VT);
698 AllNodes.push_back(N);
699 return SDOperand(N, 0);
702 SDOperand SelectionDAG::getTargetConstantFP(double Val, MVT::ValueType VT) {
703 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
705 Val = (float)Val; // Mask out extra precision.
707 // Do the map lookup using the actual bit pattern for the floating point
708 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
709 // we don't have issues with SNANs.
710 SDNode *&N = TargetConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
711 if (N) return SDOperand(N, 0);
712 N = new ConstantFPSDNode(true, Val, VT);
713 AllNodes.push_back(N);
714 return SDOperand(N, 0);
717 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
718 MVT::ValueType VT, int offset) {
719 SDNode *&N = GlobalValues[std::make_pair(GV, offset)];
720 if (N) return SDOperand(N, 0);
721 N = new GlobalAddressSDNode(false, GV, VT, offset);
722 AllNodes.push_back(N);
723 return SDOperand(N, 0);
726 SDOperand SelectionDAG::getTargetGlobalAddress(const GlobalValue *GV,
727 MVT::ValueType VT, int offset) {
728 SDNode *&N = TargetGlobalValues[std::make_pair(GV, offset)];
729 if (N) return SDOperand(N, 0);
730 N = new GlobalAddressSDNode(true, GV, VT, offset);
731 AllNodes.push_back(N);
732 return SDOperand(N, 0);
735 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) {
736 SDNode *&N = FrameIndices[FI];
737 if (N) return SDOperand(N, 0);
738 N = new FrameIndexSDNode(FI, VT, false);
739 AllNodes.push_back(N);
740 return SDOperand(N, 0);
743 SDOperand SelectionDAG::getTargetFrameIndex(int FI, MVT::ValueType VT) {
744 SDNode *&N = TargetFrameIndices[FI];
745 if (N) return SDOperand(N, 0);
746 N = new FrameIndexSDNode(FI, VT, true);
747 AllNodes.push_back(N);
748 return SDOperand(N, 0);
751 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT) {
752 SDNode *&N = JumpTableIndices[JTI];
753 if (N) return SDOperand(N, 0);
754 N = new JumpTableSDNode(JTI, VT, false);
755 AllNodes.push_back(N);
756 return SDOperand(N, 0);
759 SDOperand SelectionDAG::getTargetJumpTable(int JTI, MVT::ValueType VT) {
760 SDNode *&N = TargetJumpTableIndices[JTI];
761 if (N) return SDOperand(N, 0);
762 N = new JumpTableSDNode(JTI, VT, true);
763 AllNodes.push_back(N);
764 return SDOperand(N, 0);
767 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
768 unsigned Alignment, int Offset) {
769 SDNode *&N = ConstantPoolIndices[std::make_pair(C,
770 std::make_pair(Offset, Alignment))];
771 if (N) return SDOperand(N, 0);
772 N = new ConstantPoolSDNode(false, C, VT, Offset, Alignment);
773 AllNodes.push_back(N);
774 return SDOperand(N, 0);
777 SDOperand SelectionDAG::getTargetConstantPool(Constant *C, MVT::ValueType VT,
778 unsigned Alignment, int Offset) {
779 SDNode *&N = TargetConstantPoolIndices[std::make_pair(C,
780 std::make_pair(Offset, Alignment))];
781 if (N) return SDOperand(N, 0);
782 N = new ConstantPoolSDNode(true, C, VT, Offset, Alignment);
783 AllNodes.push_back(N);
784 return SDOperand(N, 0);
787 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
788 SDNode *&N = BBNodes[MBB];
789 if (N) return SDOperand(N, 0);
790 N = new BasicBlockSDNode(MBB);
791 AllNodes.push_back(N);
792 return SDOperand(N, 0);
795 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
796 if ((unsigned)VT >= ValueTypeNodes.size())
797 ValueTypeNodes.resize(VT+1);
798 if (ValueTypeNodes[VT] == 0) {
799 ValueTypeNodes[VT] = new VTSDNode(VT);
800 AllNodes.push_back(ValueTypeNodes[VT]);
803 return SDOperand(ValueTypeNodes[VT], 0);
806 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
807 SDNode *&N = ExternalSymbols[Sym];
808 if (N) return SDOperand(N, 0);
809 N = new ExternalSymbolSDNode(false, Sym, VT);
810 AllNodes.push_back(N);
811 return SDOperand(N, 0);
814 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
816 SDNode *&N = TargetExternalSymbols[Sym];
817 if (N) return SDOperand(N, 0);
818 N = new ExternalSymbolSDNode(true, Sym, VT);
819 AllNodes.push_back(N);
820 return SDOperand(N, 0);
823 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
824 if ((unsigned)Cond >= CondCodeNodes.size())
825 CondCodeNodes.resize(Cond+1);
827 if (CondCodeNodes[Cond] == 0) {
828 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
829 AllNodes.push_back(CondCodeNodes[Cond]);
831 return SDOperand(CondCodeNodes[Cond], 0);
834 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
835 RegisterSDNode *&Reg = RegNodes[std::make_pair(RegNo, VT)];
837 Reg = new RegisterSDNode(RegNo, VT);
838 AllNodes.push_back(Reg);
840 return SDOperand(Reg, 0);
843 SDOperand SelectionDAG::SimplifySetCC(MVT::ValueType VT, SDOperand N1,
844 SDOperand N2, ISD::CondCode Cond) {
845 // These setcc operations always fold.
849 case ISD::SETFALSE2: return getConstant(0, VT);
851 case ISD::SETTRUE2: return getConstant(1, VT);
854 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
855 uint64_t C2 = N2C->getValue();
856 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
857 uint64_t C1 = N1C->getValue();
859 // Sign extend the operands if required
860 if (ISD::isSignedIntSetCC(Cond)) {
861 C1 = N1C->getSignExtended();
862 C2 = N2C->getSignExtended();
866 default: assert(0 && "Unknown integer setcc!");
867 case ISD::SETEQ: return getConstant(C1 == C2, VT);
868 case ISD::SETNE: return getConstant(C1 != C2, VT);
869 case ISD::SETULT: return getConstant(C1 < C2, VT);
870 case ISD::SETUGT: return getConstant(C1 > C2, VT);
871 case ISD::SETULE: return getConstant(C1 <= C2, VT);
872 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
873 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
874 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
875 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
876 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
879 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
880 if (N1.getOpcode() == ISD::ZERO_EXTEND) {
881 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType());
883 // If the comparison constant has bits in the upper part, the
884 // zero-extended value could never match.
885 if (C2 & (~0ULL << InSize)) {
886 unsigned VSize = MVT::getSizeInBits(N1.getValueType());
890 case ISD::SETEQ: return getConstant(0, VT);
893 case ISD::SETNE: return getConstant(1, VT);
896 // True if the sign bit of C2 is set.
897 return getConstant((C2 & (1ULL << VSize)) != 0, VT);
900 // True if the sign bit of C2 isn't set.
901 return getConstant((C2 & (1ULL << VSize)) == 0, VT);
907 // Otherwise, we can perform the comparison with the low bits.
915 return getSetCC(VT, N1.getOperand(0),
916 getConstant(C2, N1.getOperand(0).getValueType()),
919 break; // todo, be more careful with signed comparisons
921 } else if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG &&
922 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
923 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N1.getOperand(1))->getVT();
924 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy);
925 MVT::ValueType ExtDstTy = N1.getValueType();
926 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy);
928 // If the extended part has any inconsistent bits, it cannot ever
929 // compare equal. In other words, they have to be all ones or all
932 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1));
933 if ((C2 & ExtBits) != 0 && (C2 & ExtBits) != ExtBits)
934 return getConstant(Cond == ISD::SETNE, VT);
936 // Otherwise, make this a use of a zext.
937 return getSetCC(VT, getZeroExtendInReg(N1.getOperand(0), ExtSrcTy),
938 getConstant(C2 & (~0ULL>>(64-ExtSrcTyBits)), ExtDstTy),
942 uint64_t MinVal, MaxVal;
943 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0));
944 if (ISD::isSignedIntSetCC(Cond)) {
945 MinVal = 1ULL << (OperandBitSize-1);
946 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined.
947 MaxVal = ~0ULL >> (65-OperandBitSize);
952 MaxVal = ~0ULL >> (64-OperandBitSize);
955 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
956 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
957 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true
958 --C2; // X >= C1 --> X > (C1-1)
959 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
960 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
963 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
964 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true
965 ++C2; // X <= C1 --> X < (C1+1)
966 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
967 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
970 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal)
971 return getConstant(0, VT); // X < MIN --> false
973 // Canonicalize setgt X, Min --> setne X, Min
974 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal)
975 return getSetCC(VT, N1, N2, ISD::SETNE);
977 // If we have setult X, 1, turn it into seteq X, 0
978 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1)
979 return getSetCC(VT, N1, getConstant(MinVal, N1.getValueType()),
981 // If we have setugt X, Max-1, turn it into seteq X, Max
982 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1)
983 return getSetCC(VT, N1, getConstant(MaxVal, N1.getValueType()),
986 // If we have "setcc X, C1", check to see if we can shrink the immediate
989 // SETUGT X, SINTMAX -> SETLT X, 0
990 if (Cond == ISD::SETUGT && OperandBitSize != 1 &&
991 C2 == (~0ULL >> (65-OperandBitSize)))
992 return getSetCC(VT, N1, getConstant(0, N2.getValueType()), ISD::SETLT);
994 // FIXME: Implement the rest of these.
997 // Fold bit comparisons when we can.
998 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
999 VT == N1.getValueType() && N1.getOpcode() == ISD::AND)
1000 if (ConstantSDNode *AndRHS =
1001 dyn_cast<ConstantSDNode>(N1.getOperand(1))) {
1002 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
1003 // Perform the xform if the AND RHS is a single bit.
1004 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) {
1005 return getNode(ISD::SRL, VT, N1,
1006 getConstant(Log2_64(AndRHS->getValue()),
1007 TLI.getShiftAmountTy()));
1009 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) {
1010 // (X & 8) == 8 --> (X & 8) >> 3
1011 // Perform the xform if C2 is a single bit.
1012 if ((C2 & (C2-1)) == 0) {
1013 return getNode(ISD::SRL, VT, N1,
1014 getConstant(Log2_64(C2),TLI.getShiftAmountTy()));
1019 } else if (isa<ConstantSDNode>(N1.Val)) {
1020 // Ensure that the constant occurs on the RHS.
1021 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1024 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
1025 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
1026 double C1 = N1C->getValue(), C2 = N2C->getValue();
1029 default: break; // FIXME: Implement the rest of these!
1030 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1031 case ISD::SETNE: return getConstant(C1 != C2, VT);
1032 case ISD::SETLT: return getConstant(C1 < C2, VT);
1033 case ISD::SETGT: return getConstant(C1 > C2, VT);
1034 case ISD::SETLE: return getConstant(C1 <= C2, VT);
1035 case ISD::SETGE: return getConstant(C1 >= C2, VT);
1038 // Ensure that the constant occurs on the RHS.
1039 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1042 // Could not fold it.
1046 /// getNode - Gets or creates the specified node.
1048 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1049 SDNode *&N = NullaryOps[std::make_pair(Opcode, VT)];
1051 N = new SDNode(Opcode, VT);
1052 AllNodes.push_back(N);
1054 return SDOperand(N, 0);
1057 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1058 SDOperand Operand) {
1060 // Constant fold unary operations with an integer constant operand.
1061 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1062 uint64_t Val = C->getValue();
1065 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1066 case ISD::ANY_EXTEND:
1067 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1068 case ISD::TRUNCATE: return getConstant(Val, VT);
1069 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
1070 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
1071 case ISD::BIT_CONVERT:
1072 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1073 return getConstantFP(BitsToFloat(Val), VT);
1074 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1075 return getConstantFP(BitsToDouble(Val), VT);
1079 default: assert(0 && "Invalid bswap!"); break;
1080 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1081 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1082 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1087 default: assert(0 && "Invalid ctpop!"); break;
1088 case MVT::i1: return getConstant(Val != 0, VT);
1090 Tmp1 = (unsigned)Val & 0xFF;
1091 return getConstant(CountPopulation_32(Tmp1), VT);
1093 Tmp1 = (unsigned)Val & 0xFFFF;
1094 return getConstant(CountPopulation_32(Tmp1), VT);
1096 return getConstant(CountPopulation_32((unsigned)Val), VT);
1098 return getConstant(CountPopulation_64(Val), VT);
1102 default: assert(0 && "Invalid ctlz!"); break;
1103 case MVT::i1: return getConstant(Val == 0, VT);
1105 Tmp1 = (unsigned)Val & 0xFF;
1106 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1108 Tmp1 = (unsigned)Val & 0xFFFF;
1109 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1111 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1113 return getConstant(CountLeadingZeros_64(Val), VT);
1117 default: assert(0 && "Invalid cttz!"); break;
1118 case MVT::i1: return getConstant(Val == 0, VT);
1120 Tmp1 = (unsigned)Val | 0x100;
1121 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1123 Tmp1 = (unsigned)Val | 0x10000;
1124 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1126 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1128 return getConstant(CountTrailingZeros_64(Val), VT);
1133 // Constant fold unary operations with an floating point constant operand.
1134 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1137 return getConstantFP(-C->getValue(), VT);
1139 return getConstantFP(fabs(C->getValue()), VT);
1141 case ISD::FP_EXTEND:
1142 return getConstantFP(C->getValue(), VT);
1143 case ISD::FP_TO_SINT:
1144 return getConstant((int64_t)C->getValue(), VT);
1145 case ISD::FP_TO_UINT:
1146 return getConstant((uint64_t)C->getValue(), VT);
1147 case ISD::BIT_CONVERT:
1148 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1149 return getConstant(FloatToBits(C->getValue()), VT);
1150 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1151 return getConstant(DoubleToBits(C->getValue()), VT);
1155 unsigned OpOpcode = Operand.Val->getOpcode();
1157 case ISD::TokenFactor:
1158 return Operand; // Factor of one node? No factor.
1159 case ISD::SIGN_EXTEND:
1160 if (Operand.getValueType() == VT) return Operand; // noop extension
1161 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1162 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1163 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1165 case ISD::ZERO_EXTEND:
1166 if (Operand.getValueType() == VT) return Operand; // noop extension
1167 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1168 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1169 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1171 case ISD::ANY_EXTEND:
1172 if (Operand.getValueType() == VT) return Operand; // noop extension
1173 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1174 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1175 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1176 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1179 if (Operand.getValueType() == VT) return Operand; // noop truncate
1180 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1181 if (OpOpcode == ISD::TRUNCATE)
1182 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1183 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1184 OpOpcode == ISD::ANY_EXTEND) {
1185 // If the source is smaller than the dest, we still need an extend.
1186 if (Operand.Val->getOperand(0).getValueType() < VT)
1187 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1188 else if (Operand.Val->getOperand(0).getValueType() > VT)
1189 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1191 return Operand.Val->getOperand(0);
1194 case ISD::BIT_CONVERT:
1195 // Basic sanity checking.
1196 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1197 && "Cannot BIT_CONVERT between two different types!");
1198 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1199 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1200 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1201 if (OpOpcode == ISD::UNDEF)
1202 return getNode(ISD::UNDEF, VT);
1204 case ISD::SCALAR_TO_VECTOR:
1205 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1206 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1207 "Illegal SCALAR_TO_VECTOR node!");
1210 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1211 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1212 Operand.Val->getOperand(0));
1213 if (OpOpcode == ISD::FNEG) // --X -> X
1214 return Operand.Val->getOperand(0);
1217 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1218 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1223 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1224 SDNode *&E = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))];
1225 if (E) return SDOperand(E, 0);
1226 E = N = new SDNode(Opcode, Operand);
1228 N = new SDNode(Opcode, Operand);
1230 N->setValueTypes(VT);
1231 AllNodes.push_back(N);
1232 return SDOperand(N, 0);
1237 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1238 SDOperand N1, SDOperand N2) {
1241 case ISD::TokenFactor:
1242 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1243 N2.getValueType() == MVT::Other && "Invalid token factor!");
1252 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1259 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1266 assert(N1.getValueType() == N2.getValueType() &&
1267 N1.getValueType() == VT && "Binary operator types must match!");
1269 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1270 assert(N1.getValueType() == VT &&
1271 MVT::isFloatingPoint(N1.getValueType()) &&
1272 MVT::isFloatingPoint(N2.getValueType()) &&
1273 "Invalid FCOPYSIGN!");
1280 assert(VT == N1.getValueType() &&
1281 "Shift operators return type must be the same as their first arg");
1282 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1283 VT != MVT::i1 && "Shifts only work on integers");
1285 case ISD::FP_ROUND_INREG: {
1286 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1287 assert(VT == N1.getValueType() && "Not an inreg round!");
1288 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1289 "Cannot FP_ROUND_INREG integer types");
1290 assert(EVT <= VT && "Not rounding down!");
1293 case ISD::AssertSext:
1294 case ISD::AssertZext:
1295 case ISD::SIGN_EXTEND_INREG: {
1296 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1297 assert(VT == N1.getValueType() && "Not an inreg extend!");
1298 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1299 "Cannot *_EXTEND_INREG FP types");
1300 assert(EVT <= VT && "Not extending!");
1307 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1308 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1311 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1313 case ISD::ADD: return getConstant(C1 + C2, VT);
1314 case ISD::SUB: return getConstant(C1 - C2, VT);
1315 case ISD::MUL: return getConstant(C1 * C2, VT);
1317 if (C2) return getConstant(C1 / C2, VT);
1320 if (C2) return getConstant(C1 % C2, VT);
1323 if (C2) return getConstant(N1C->getSignExtended() /
1324 N2C->getSignExtended(), VT);
1327 if (C2) return getConstant(N1C->getSignExtended() %
1328 N2C->getSignExtended(), VT);
1330 case ISD::AND : return getConstant(C1 & C2, VT);
1331 case ISD::OR : return getConstant(C1 | C2, VT);
1332 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1333 case ISD::SHL : return getConstant(C1 << C2, VT);
1334 case ISD::SRL : return getConstant(C1 >> C2, VT);
1335 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1337 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1340 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1344 } else { // Cannonicalize constant to RHS if commutative
1345 if (isCommutativeBinOp(Opcode)) {
1346 std::swap(N1C, N2C);
1352 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1353 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1356 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1358 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1359 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1360 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1362 if (C2) return getConstantFP(C1 / C2, VT);
1365 if (C2) return getConstantFP(fmod(C1, C2), VT);
1367 case ISD::FCOPYSIGN: {
1378 if (u2.I < 0) // Sign bit of RHS set?
1379 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1381 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1382 return getConstantFP(u1.F, VT);
1386 } else { // Cannonicalize constant to RHS if commutative
1387 if (isCommutativeBinOp(Opcode)) {
1388 std::swap(N1CFP, N2CFP);
1394 // Canonicalize an UNDEF to the RHS, even over a constant.
1395 if (N1.getOpcode() == ISD::UNDEF) {
1396 if (isCommutativeBinOp(Opcode)) {
1400 case ISD::FP_ROUND_INREG:
1401 case ISD::SIGN_EXTEND_INREG:
1406 return N1; // fold op(undef, arg2) -> undef
1411 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1416 // Fold a bunch of operators that
1417 if (N2.getOpcode() == ISD::UNDEF) {
1431 return N2; // fold op(arg1, undef) -> undef
1434 return getConstant(0, VT); // fold op(arg1, undef) -> 0
1436 return getConstant(MVT::getIntVTBitMask(VT), VT);
1440 // Finally, fold operations that do not require constants.
1442 case ISD::FP_ROUND_INREG:
1443 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1445 case ISD::SIGN_EXTEND_INREG: {
1446 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1447 if (EVT == VT) return N1; // Not actually extending
1451 // FIXME: figure out how to safely handle things like
1452 // int foo(int x) { return 1 << (x & 255); }
1453 // int bar() { return foo(256); }
1458 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1459 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1460 return getNode(Opcode, VT, N1, N2.getOperand(0));
1461 else if (N2.getOpcode() == ISD::AND)
1462 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1463 // If the and is only masking out bits that cannot effect the shift,
1464 // eliminate the and.
1465 unsigned NumBits = MVT::getSizeInBits(VT);
1466 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1467 return getNode(Opcode, VT, N1, N2.getOperand(0));
1473 // Memoize this node if possible.
1475 if (VT != MVT::Flag) {
1476 SDNode *&BON = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))];
1477 if (BON) return SDOperand(BON, 0);
1479 BON = N = new SDNode(Opcode, N1, N2);
1481 N = new SDNode(Opcode, N1, N2);
1484 N->setValueTypes(VT);
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) {
1491 // Perform various simplifications.
1492 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1493 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1494 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
1497 // Use SimplifySetCC to simplify SETCC's.
1498 SDOperand Simp = SimplifySetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1499 if (Simp.Val) return Simp;
1504 if (N1C->getValue())
1505 return N2; // select true, X, Y -> X
1507 return N3; // select false, X, Y -> Y
1509 if (N2 == N3) return N2; // select C, X, X -> X
1513 if (N2C->getValue()) // Unconditional branch
1514 return getNode(ISD::BR, MVT::Other, N1, N3);
1516 return N1; // Never-taken branch
1518 case ISD::VECTOR_SHUFFLE:
1519 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1520 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1521 N3.getOpcode() == ISD::BUILD_VECTOR &&
1522 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1523 "Illegal VECTOR_SHUFFLE node!");
1527 std::vector<SDOperand> Ops;
1533 // Memoize node if it doesn't produce a flag.
1535 if (VT != MVT::Flag) {
1536 SDNode *&E = OneResultNodes[std::make_pair(Opcode,std::make_pair(VT, Ops))];
1537 if (E) return SDOperand(E, 0);
1538 E = N = new SDNode(Opcode, N1, N2, N3);
1540 N = new SDNode(Opcode, N1, N2, N3);
1542 N->setValueTypes(VT);
1543 AllNodes.push_back(N);
1544 return SDOperand(N, 0);
1547 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1548 SDOperand N1, SDOperand N2, SDOperand N3,
1550 std::vector<SDOperand> Ops;
1556 return getNode(Opcode, VT, Ops);
1559 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1560 SDOperand N1, SDOperand N2, SDOperand N3,
1561 SDOperand N4, SDOperand N5) {
1562 std::vector<SDOperand> Ops;
1569 return getNode(Opcode, VT, Ops);
1572 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1573 SDOperand Chain, SDOperand Ptr,
1575 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))];
1576 if (N) return SDOperand(N, 0);
1577 N = new SDNode(ISD::LOAD, Chain, Ptr, SV);
1579 // Loads have a token chain.
1580 setNodeValueTypes(N, VT, MVT::Other);
1581 AllNodes.push_back(N);
1582 return SDOperand(N, 0);
1585 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1586 SDOperand Chain, SDOperand Ptr,
1588 std::vector<SDOperand> Ops;
1590 Ops.push_back(Chain);
1593 Ops.push_back(getConstant(Count, MVT::i32));
1594 Ops.push_back(getValueType(EVT));
1595 std::vector<MVT::ValueType> VTs;
1597 VTs.push_back(MVT::Vector); VTs.push_back(MVT::Other); // Add token chain.
1598 return getNode(ISD::VLOAD, VTs, Ops);
1601 SDOperand SelectionDAG::getExtLoad(unsigned Opcode, MVT::ValueType VT,
1602 SDOperand Chain, SDOperand Ptr, SDOperand SV,
1603 MVT::ValueType EVT) {
1604 std::vector<SDOperand> Ops;
1606 Ops.push_back(Chain);
1609 Ops.push_back(getValueType(EVT));
1610 std::vector<MVT::ValueType> VTs;
1612 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1613 return getNode(Opcode, VTs, Ops);
1616 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
1617 assert((!V || isa<PointerType>(V->getType())) &&
1618 "SrcValue is not a pointer?");
1619 SDNode *&N = ValueNodes[std::make_pair(V, Offset)];
1620 if (N) return SDOperand(N, 0);
1622 N = new SrcValueSDNode(V, Offset);
1623 AllNodes.push_back(N);
1624 return SDOperand(N, 0);
1627 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1628 SDOperand Chain, SDOperand Ptr,
1630 std::vector<SDOperand> Ops;
1632 Ops.push_back(Chain);
1635 std::vector<MVT::ValueType> VTs;
1637 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1638 return getNode(ISD::VAARG, VTs, Ops);
1641 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1642 std::vector<SDOperand> &Ops) {
1643 switch (Ops.size()) {
1644 case 0: return getNode(Opcode, VT);
1645 case 1: return getNode(Opcode, VT, Ops[0]);
1646 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1647 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1651 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Ops[1].Val);
1654 case ISD::TRUNCSTORE: {
1655 assert(Ops.size() == 5 && "TRUNCSTORE takes 5 operands!");
1656 MVT::ValueType EVT = cast<VTSDNode>(Ops[4])->getVT();
1657 #if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store
1658 // If this is a truncating store of a constant, convert to the desired type
1659 // and store it instead.
1660 if (isa<Constant>(Ops[0])) {
1661 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1);
1662 if (isa<Constant>(Op))
1665 // Also for ConstantFP?
1667 if (Ops[0].getValueType() == EVT) // Normal store?
1668 return getNode(ISD::STORE, VT, Ops[0], Ops[1], Ops[2], Ops[3]);
1669 assert(Ops[1].getValueType() > EVT && "Not a truncation?");
1670 assert(MVT::isInteger(Ops[1].getValueType()) == MVT::isInteger(EVT) &&
1671 "Can't do FP-INT conversion!");
1674 case ISD::SELECT_CC: {
1675 assert(Ops.size() == 5 && "SELECT_CC takes 5 operands!");
1676 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1677 "LHS and RHS of condition must have same type!");
1678 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1679 "True and False arms of SelectCC must have same type!");
1680 assert(Ops[2].getValueType() == VT &&
1681 "select_cc node must be of same type as true and false value!");
1685 assert(Ops.size() == 5 && "BR_CC takes 5 operands!");
1686 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1687 "LHS/RHS of comparison should match types!");
1694 if (VT != MVT::Flag) {
1696 OneResultNodes[std::make_pair(Opcode, std::make_pair(VT, Ops))];
1697 if (E) return SDOperand(E, 0);
1698 E = N = new SDNode(Opcode, Ops);
1700 N = new SDNode(Opcode, Ops);
1702 N->setValueTypes(VT);
1703 AllNodes.push_back(N);
1704 return SDOperand(N, 0);
1707 SDOperand SelectionDAG::getNode(unsigned Opcode,
1708 std::vector<MVT::ValueType> &ResultTys,
1709 std::vector<SDOperand> &Ops) {
1710 if (ResultTys.size() == 1)
1711 return getNode(Opcode, ResultTys[0], Ops);
1716 case ISD::ZEXTLOAD: {
1717 MVT::ValueType EVT = cast<VTSDNode>(Ops[3])->getVT();
1718 assert(Ops.size() == 4 && ResultTys.size() == 2 && "Bad *EXTLOAD!");
1719 // If they are asking for an extending load from/to the same thing, return a
1721 if (ResultTys[0] == EVT)
1722 return getLoad(ResultTys[0], Ops[0], Ops[1], Ops[2]);
1723 if (MVT::isVector(ResultTys[0])) {
1724 assert(EVT == MVT::getVectorBaseType(ResultTys[0]) &&
1725 "Invalid vector extload!");
1727 assert(EVT < ResultTys[0] &&
1728 "Should only be an extending load, not truncating!");
1730 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(ResultTys[0])) &&
1731 "Cannot sign/zero extend a FP/Vector load!");
1732 assert(MVT::isInteger(ResultTys[0]) == MVT::isInteger(EVT) &&
1733 "Cannot convert from FP to Int or Int -> FP!");
1737 // FIXME: figure out how to safely handle things like
1738 // int foo(int x) { return 1 << (x & 255); }
1739 // int bar() { return foo(256); }
1741 case ISD::SRA_PARTS:
1742 case ISD::SRL_PARTS:
1743 case ISD::SHL_PARTS:
1744 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1745 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1746 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1747 else if (N3.getOpcode() == ISD::AND)
1748 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1749 // If the and is only masking out bits that cannot effect the shift,
1750 // eliminate the and.
1751 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1752 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1753 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1759 // Memoize the node unless it returns a flag.
1761 if (ResultTys.back() != MVT::Flag) {
1763 ArbitraryNodes[std::make_pair(Opcode, std::make_pair(ResultTys, Ops))];
1764 if (E) return SDOperand(E, 0);
1765 E = N = new SDNode(Opcode, Ops);
1767 N = new SDNode(Opcode, Ops);
1769 setNodeValueTypes(N, ResultTys);
1770 AllNodes.push_back(N);
1771 return SDOperand(N, 0);
1774 void SelectionDAG::setNodeValueTypes(SDNode *N,
1775 std::vector<MVT::ValueType> &RetVals) {
1776 switch (RetVals.size()) {
1778 case 1: N->setValueTypes(RetVals[0]); return;
1779 case 2: setNodeValueTypes(N, RetVals[0], RetVals[1]); return;
1783 std::list<std::vector<MVT::ValueType> >::iterator I =
1784 std::find(VTList.begin(), VTList.end(), RetVals);
1785 if (I == VTList.end()) {
1786 VTList.push_front(RetVals);
1790 N->setValueTypes(&(*I)[0], I->size());
1793 void SelectionDAG::setNodeValueTypes(SDNode *N, MVT::ValueType VT1,
1794 MVT::ValueType VT2) {
1795 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1796 E = VTList.end(); I != E; ++I) {
1797 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) {
1798 N->setValueTypes(&(*I)[0], 2);
1802 std::vector<MVT::ValueType> V;
1805 VTList.push_front(V);
1806 N->setValueTypes(&(*VTList.begin())[0], 2);
1809 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1810 /// specified operands. If the resultant node already exists in the DAG,
1811 /// this does not modify the specified node, instead it returns the node that
1812 /// already exists. If the resultant node does not exist in the DAG, the
1813 /// input node is returned. As a degenerate case, if you specify the same
1814 /// input operands as the node already has, the input node is returned.
1815 SDOperand SelectionDAG::
1816 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1817 SDNode *N = InN.Val;
1818 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1820 // Check to see if there is no change.
1821 if (Op == N->getOperand(0)) return InN;
1823 // See if the modified node already exists.
1824 SDNode **NewSlot = FindModifiedNodeSlot(N, Op);
1825 if (NewSlot && *NewSlot)
1826 return SDOperand(*NewSlot, InN.ResNo);
1828 // Nope it doesn't. Remove the node from it's current place in the maps.
1830 RemoveNodeFromCSEMaps(N);
1832 // Now we update the operands.
1833 N->OperandList[0].Val->removeUser(N);
1835 N->OperandList[0] = Op;
1837 // If this gets put into a CSE map, add it.
1838 if (NewSlot) *NewSlot = N;
1842 SDOperand SelectionDAG::
1843 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1844 SDNode *N = InN.Val;
1845 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1847 // Check to see if there is no change.
1848 bool AnyChange = false;
1849 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1850 return InN; // No operands changed, just return the input node.
1852 // See if the modified node already exists.
1853 SDNode **NewSlot = FindModifiedNodeSlot(N, Op1, Op2);
1854 if (NewSlot && *NewSlot)
1855 return SDOperand(*NewSlot, InN.ResNo);
1857 // Nope it doesn't. Remove the node from it's current place in the maps.
1859 RemoveNodeFromCSEMaps(N);
1861 // Now we update the operands.
1862 if (N->OperandList[0] != Op1) {
1863 N->OperandList[0].Val->removeUser(N);
1864 Op1.Val->addUser(N);
1865 N->OperandList[0] = Op1;
1867 if (N->OperandList[1] != Op2) {
1868 N->OperandList[1].Val->removeUser(N);
1869 Op2.Val->addUser(N);
1870 N->OperandList[1] = Op2;
1873 // If this gets put into a CSE map, add it.
1874 if (NewSlot) *NewSlot = N;
1878 SDOperand SelectionDAG::
1879 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
1880 std::vector<SDOperand> Ops;
1884 return UpdateNodeOperands(N, Ops);
1887 SDOperand SelectionDAG::
1888 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1889 SDOperand Op3, SDOperand Op4) {
1890 std::vector<SDOperand> Ops;
1895 return UpdateNodeOperands(N, Ops);
1898 SDOperand SelectionDAG::
1899 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1900 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
1901 std::vector<SDOperand> Ops;
1907 return UpdateNodeOperands(N, Ops);
1911 SDOperand SelectionDAG::
1912 UpdateNodeOperands(SDOperand InN, const std::vector<SDOperand> &Ops) {
1913 SDNode *N = InN.Val;
1914 assert(N->getNumOperands() == Ops.size() &&
1915 "Update with wrong number of operands");
1917 // Check to see if there is no change.
1918 unsigned NumOps = Ops.size();
1919 bool AnyChange = false;
1920 for (unsigned i = 0; i != NumOps; ++i) {
1921 if (Ops[i] != N->getOperand(i)) {
1927 // No operands changed, just return the input node.
1928 if (!AnyChange) return InN;
1930 // See if the modified node already exists.
1931 SDNode **NewSlot = FindModifiedNodeSlot(N, Ops);
1932 if (NewSlot && *NewSlot)
1933 return SDOperand(*NewSlot, InN.ResNo);
1935 // Nope it doesn't. Remove the node from it's current place in the maps.
1937 RemoveNodeFromCSEMaps(N);
1939 // Now we update the operands.
1940 for (unsigned i = 0; i != NumOps; ++i) {
1941 if (N->OperandList[i] != Ops[i]) {
1942 N->OperandList[i].Val->removeUser(N);
1943 Ops[i].Val->addUser(N);
1944 N->OperandList[i] = Ops[i];
1948 // If this gets put into a CSE map, add it.
1949 if (NewSlot) *NewSlot = N;
1956 /// SelectNodeTo - These are used for target selectors to *mutate* the
1957 /// specified node to have the specified return type, Target opcode, and
1958 /// operands. Note that target opcodes are stored as
1959 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
1961 /// Note that SelectNodeTo returns the resultant node. If there is already a
1962 /// node of the specified opcode and operands, it returns that node instead of
1963 /// the current one.
1964 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1965 MVT::ValueType VT) {
1966 // If an identical node already exists, use it.
1967 SDNode *&ON = NullaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, VT)];
1968 if (ON) return SDOperand(ON, 0);
1970 RemoveNodeFromCSEMaps(N);
1972 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1973 N->setValueTypes(VT);
1975 ON = N; // Memoize the new node.
1976 return SDOperand(N, 0);
1979 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1980 MVT::ValueType VT, SDOperand Op1) {
1981 // If an identical node already exists, use it.
1982 SDNode *&ON = UnaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1983 std::make_pair(Op1, VT))];
1984 if (ON) return SDOperand(ON, 0);
1986 RemoveNodeFromCSEMaps(N);
1987 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1988 N->setValueTypes(VT);
1989 N->setOperands(Op1);
1991 ON = N; // Memoize the new node.
1992 return SDOperand(N, 0);
1995 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1996 MVT::ValueType VT, SDOperand Op1,
1998 // If an identical node already exists, use it.
1999 SDNode *&ON = BinaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2000 std::make_pair(Op1, Op2))];
2001 if (ON) return SDOperand(ON, 0);
2003 RemoveNodeFromCSEMaps(N);
2004 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2005 N->setValueTypes(VT);
2006 N->setOperands(Op1, Op2);
2008 ON = N; // Memoize the new node.
2009 return SDOperand(N, 0);
2012 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2013 MVT::ValueType VT, SDOperand Op1,
2014 SDOperand Op2, SDOperand Op3) {
2015 // If an identical node already exists, use it.
2016 std::vector<SDOperand> OpList;
2017 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2018 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2019 std::make_pair(VT, OpList))];
2020 if (ON) return SDOperand(ON, 0);
2022 RemoveNodeFromCSEMaps(N);
2023 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2024 N->setValueTypes(VT);
2025 N->setOperands(Op1, Op2, Op3);
2027 ON = N; // Memoize the new node.
2028 return SDOperand(N, 0);
2031 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2032 MVT::ValueType VT, SDOperand Op1,
2033 SDOperand Op2, SDOperand Op3,
2035 // If an identical node already exists, use it.
2036 std::vector<SDOperand> OpList;
2037 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2038 OpList.push_back(Op4);
2039 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2040 std::make_pair(VT, OpList))];
2041 if (ON) return SDOperand(ON, 0);
2043 RemoveNodeFromCSEMaps(N);
2044 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2045 N->setValueTypes(VT);
2046 N->setOperands(Op1, Op2, Op3, Op4);
2048 ON = N; // Memoize the new node.
2049 return SDOperand(N, 0);
2052 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2053 MVT::ValueType VT, SDOperand Op1,
2054 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2056 // If an identical node already exists, use it.
2057 std::vector<SDOperand> OpList;
2058 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2059 OpList.push_back(Op4); OpList.push_back(Op5);
2060 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2061 std::make_pair(VT, OpList))];
2062 if (ON) return SDOperand(ON, 0);
2064 RemoveNodeFromCSEMaps(N);
2065 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2066 N->setValueTypes(VT);
2067 N->setOperands(Op1, Op2, Op3, Op4, Op5);
2069 ON = N; // Memoize the new node.
2070 return SDOperand(N, 0);
2073 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2074 MVT::ValueType VT, SDOperand Op1,
2075 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2076 SDOperand Op5, SDOperand Op6) {
2077 // If an identical node already exists, use it.
2078 std::vector<SDOperand> OpList;
2079 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2080 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2081 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2082 std::make_pair(VT, OpList))];
2083 if (ON) return SDOperand(ON, 0);
2085 RemoveNodeFromCSEMaps(N);
2086 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2087 N->setValueTypes(VT);
2088 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6);
2090 ON = N; // Memoize the new node.
2091 return SDOperand(N, 0);
2094 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2095 MVT::ValueType VT, SDOperand Op1,
2096 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2097 SDOperand Op5, SDOperand Op6,
2099 // If an identical node already exists, use it.
2100 std::vector<SDOperand> OpList;
2101 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2102 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2103 OpList.push_back(Op7);
2104 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2105 std::make_pair(VT, OpList))];
2106 if (ON) return SDOperand(ON, 0);
2108 RemoveNodeFromCSEMaps(N);
2109 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2110 N->setValueTypes(VT);
2111 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7);
2113 ON = N; // Memoize the new node.
2114 return SDOperand(N, 0);
2116 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2117 MVT::ValueType VT, SDOperand Op1,
2118 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2119 SDOperand Op5, SDOperand Op6,
2120 SDOperand Op7, SDOperand Op8) {
2121 // If an identical node already exists, use it.
2122 std::vector<SDOperand> OpList;
2123 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2124 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2125 OpList.push_back(Op7); OpList.push_back(Op8);
2126 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2127 std::make_pair(VT, OpList))];
2128 if (ON) return SDOperand(ON, 0);
2130 RemoveNodeFromCSEMaps(N);
2131 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2132 N->setValueTypes(VT);
2133 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7, Op8);
2135 ON = N; // Memoize the new node.
2136 return SDOperand(N, 0);
2139 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2140 MVT::ValueType VT1, MVT::ValueType VT2,
2141 SDOperand Op1, SDOperand Op2) {
2142 // If an identical node already exists, use it.
2143 std::vector<SDOperand> OpList;
2144 OpList.push_back(Op1); OpList.push_back(Op2);
2145 std::vector<MVT::ValueType> VTList;
2146 VTList.push_back(VT1); VTList.push_back(VT2);
2147 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2148 std::make_pair(VTList, OpList))];
2149 if (ON) return SDOperand(ON, 0);
2151 RemoveNodeFromCSEMaps(N);
2152 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2153 setNodeValueTypes(N, VT1, VT2);
2154 N->setOperands(Op1, Op2);
2156 ON = N; // Memoize the new node.
2157 return SDOperand(N, 0);
2160 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2161 MVT::ValueType VT1, MVT::ValueType VT2,
2162 SDOperand Op1, SDOperand Op2,
2164 // If an identical node already exists, use it.
2165 std::vector<SDOperand> OpList;
2166 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2167 std::vector<MVT::ValueType> VTList;
2168 VTList.push_back(VT1); VTList.push_back(VT2);
2169 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2170 std::make_pair(VTList, OpList))];
2171 if (ON) return SDOperand(ON, 0);
2173 RemoveNodeFromCSEMaps(N);
2174 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2175 setNodeValueTypes(N, VT1, VT2);
2176 N->setOperands(Op1, Op2, Op3);
2178 ON = N; // Memoize the new node.
2179 return SDOperand(N, 0);
2182 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2183 MVT::ValueType VT1, MVT::ValueType VT2,
2184 SDOperand Op1, SDOperand Op2,
2185 SDOperand Op3, SDOperand Op4) {
2186 // If an identical node already exists, use it.
2187 std::vector<SDOperand> OpList;
2188 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2189 OpList.push_back(Op4);
2190 std::vector<MVT::ValueType> VTList;
2191 VTList.push_back(VT1); VTList.push_back(VT2);
2192 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2193 std::make_pair(VTList, OpList))];
2194 if (ON) return SDOperand(ON, 0);
2196 RemoveNodeFromCSEMaps(N);
2197 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2198 setNodeValueTypes(N, VT1, VT2);
2199 N->setOperands(Op1, Op2, Op3, Op4);
2201 ON = N; // Memoize the new node.
2202 return SDOperand(N, 0);
2205 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2206 MVT::ValueType VT1, MVT::ValueType VT2,
2207 SDOperand Op1, SDOperand Op2,
2208 SDOperand Op3, SDOperand Op4,
2210 // If an identical node already exists, use it.
2211 std::vector<SDOperand> OpList;
2212 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2213 OpList.push_back(Op4); OpList.push_back(Op5);
2214 std::vector<MVT::ValueType> VTList;
2215 VTList.push_back(VT1); VTList.push_back(VT2);
2216 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2217 std::make_pair(VTList, OpList))];
2218 if (ON) return SDOperand(ON, 0);
2220 RemoveNodeFromCSEMaps(N);
2221 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2222 setNodeValueTypes(N, VT1, VT2);
2223 N->setOperands(Op1, Op2, Op3, Op4, Op5);
2225 ON = N; // Memoize the new node.
2226 return SDOperand(N, 0);
2229 /// getTargetNode - These are used for target selectors to create a new node
2230 /// with specified return type(s), target opcode, and operands.
2232 /// Note that getTargetNode returns the resultant node. If there is already a
2233 /// node of the specified opcode and operands, it returns that node instead of
2234 /// the current one.
2235 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2236 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2238 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2240 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2242 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2243 SDOperand Op1, SDOperand Op2) {
2244 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2246 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2247 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2248 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2250 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2251 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2253 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4).Val;
2255 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2256 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2257 SDOperand Op4, SDOperand Op5) {
2258 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4, Op5).Val;
2260 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2261 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2262 SDOperand Op4, SDOperand Op5, SDOperand Op6) {
2263 std::vector<SDOperand> Ops;
2271 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2273 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2274 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2275 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2277 std::vector<SDOperand> Ops;
2286 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2288 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2289 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2290 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2291 SDOperand Op7, SDOperand Op8) {
2292 std::vector<SDOperand> Ops;
2302 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2304 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2305 std::vector<SDOperand> &Ops) {
2306 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2308 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2309 MVT::ValueType VT2, SDOperand Op1) {
2310 std::vector<MVT::ValueType> ResultTys;
2311 ResultTys.push_back(VT1);
2312 ResultTys.push_back(VT2);
2313 std::vector<SDOperand> Ops;
2315 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2317 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2318 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2) {
2319 std::vector<MVT::ValueType> ResultTys;
2320 ResultTys.push_back(VT1);
2321 ResultTys.push_back(VT2);
2322 std::vector<SDOperand> Ops;
2325 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2327 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2328 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2330 std::vector<MVT::ValueType> ResultTys;
2331 ResultTys.push_back(VT1);
2332 ResultTys.push_back(VT2);
2333 std::vector<SDOperand> Ops;
2337 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2339 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2340 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2341 SDOperand Op3, SDOperand Op4) {
2342 std::vector<MVT::ValueType> ResultTys;
2343 ResultTys.push_back(VT1);
2344 ResultTys.push_back(VT2);
2345 std::vector<SDOperand> Ops;
2350 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2352 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2353 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2354 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2355 std::vector<MVT::ValueType> ResultTys;
2356 ResultTys.push_back(VT1);
2357 ResultTys.push_back(VT2);
2358 std::vector<SDOperand> Ops;
2364 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2366 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2367 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2368 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2370 std::vector<MVT::ValueType> ResultTys;
2371 ResultTys.push_back(VT1);
2372 ResultTys.push_back(VT2);
2373 std::vector<SDOperand> Ops;
2380 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2382 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2383 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2384 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2385 SDOperand Op6, SDOperand Op7) {
2386 std::vector<MVT::ValueType> ResultTys;
2387 ResultTys.push_back(VT1);
2388 ResultTys.push_back(VT2);
2389 std::vector<SDOperand> Ops;
2397 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2399 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2400 MVT::ValueType VT2, MVT::ValueType VT3,
2401 SDOperand Op1, SDOperand Op2) {
2402 std::vector<MVT::ValueType> ResultTys;
2403 ResultTys.push_back(VT1);
2404 ResultTys.push_back(VT2);
2405 ResultTys.push_back(VT3);
2406 std::vector<SDOperand> Ops;
2409 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2411 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2412 MVT::ValueType VT2, MVT::ValueType VT3,
2413 SDOperand Op1, SDOperand Op2,
2414 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2415 std::vector<MVT::ValueType> ResultTys;
2416 ResultTys.push_back(VT1);
2417 ResultTys.push_back(VT2);
2418 ResultTys.push_back(VT3);
2419 std::vector<SDOperand> Ops;
2425 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2427 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2428 MVT::ValueType VT2, MVT::ValueType VT3,
2429 SDOperand Op1, SDOperand Op2,
2430 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2432 std::vector<MVT::ValueType> ResultTys;
2433 ResultTys.push_back(VT1);
2434 ResultTys.push_back(VT2);
2435 ResultTys.push_back(VT3);
2436 std::vector<SDOperand> Ops;
2443 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2445 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2446 MVT::ValueType VT2, MVT::ValueType VT3,
2447 SDOperand Op1, SDOperand Op2,
2448 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2449 SDOperand Op6, SDOperand Op7) {
2450 std::vector<MVT::ValueType> ResultTys;
2451 ResultTys.push_back(VT1);
2452 ResultTys.push_back(VT2);
2453 ResultTys.push_back(VT3);
2454 std::vector<SDOperand> Ops;
2462 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2464 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2465 MVT::ValueType VT2, std::vector<SDOperand> &Ops) {
2466 std::vector<MVT::ValueType> ResultTys;
2467 ResultTys.push_back(VT1);
2468 ResultTys.push_back(VT2);
2469 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2472 // ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2473 /// This can cause recursive merging of nodes in the DAG.
2475 /// This version assumes From/To have a single result value.
2477 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2478 std::vector<SDNode*> *Deleted) {
2479 SDNode *From = FromN.Val, *To = ToN.Val;
2480 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2481 "Cannot replace with this method!");
2482 assert(From != To && "Cannot replace uses of with self");
2484 while (!From->use_empty()) {
2485 // Process users until they are all gone.
2486 SDNode *U = *From->use_begin();
2488 // This node is about to morph, remove its old self from the CSE maps.
2489 RemoveNodeFromCSEMaps(U);
2491 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2493 if (I->Val == From) {
2494 From->removeUser(U);
2499 // Now that we have modified U, add it back to the CSE maps. If it already
2500 // exists there, recursively merge the results together.
2501 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2502 ReplaceAllUsesWith(U, Existing, Deleted);
2504 if (Deleted) Deleted->push_back(U);
2505 DeleteNodeNotInCSEMaps(U);
2510 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2511 /// This can cause recursive merging of nodes in the DAG.
2513 /// This version assumes From/To have matching types and numbers of result
2516 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2517 std::vector<SDNode*> *Deleted) {
2518 assert(From != To && "Cannot replace uses of with self");
2519 assert(From->getNumValues() == To->getNumValues() &&
2520 "Cannot use this version of ReplaceAllUsesWith!");
2521 if (From->getNumValues() == 1) { // If possible, use the faster version.
2522 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
2526 while (!From->use_empty()) {
2527 // Process users until they are all gone.
2528 SDNode *U = *From->use_begin();
2530 // This node is about to morph, remove its old self from the CSE maps.
2531 RemoveNodeFromCSEMaps(U);
2533 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2535 if (I->Val == From) {
2536 From->removeUser(U);
2541 // Now that we have modified U, add it back to the CSE maps. If it already
2542 // exists there, recursively merge the results together.
2543 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2544 ReplaceAllUsesWith(U, Existing, Deleted);
2546 if (Deleted) Deleted->push_back(U);
2547 DeleteNodeNotInCSEMaps(U);
2552 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2553 /// This can cause recursive merging of nodes in the DAG.
2555 /// This version can replace From with any result values. To must match the
2556 /// number and types of values returned by From.
2557 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2558 const std::vector<SDOperand> &To,
2559 std::vector<SDNode*> *Deleted) {
2560 assert(From->getNumValues() == To.size() &&
2561 "Incorrect number of values to replace with!");
2562 if (To.size() == 1 && To[0].Val->getNumValues() == 1) {
2563 // Degenerate case handled above.
2564 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2568 while (!From->use_empty()) {
2569 // Process users until they are all gone.
2570 SDNode *U = *From->use_begin();
2572 // This node is about to morph, remove its old self from the CSE maps.
2573 RemoveNodeFromCSEMaps(U);
2575 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2577 if (I->Val == From) {
2578 const SDOperand &ToOp = To[I->ResNo];
2579 From->removeUser(U);
2581 ToOp.Val->addUser(U);
2584 // Now that we have modified U, add it back to the CSE maps. If it already
2585 // exists there, recursively merge the results together.
2586 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2587 ReplaceAllUsesWith(U, Existing, Deleted);
2589 if (Deleted) Deleted->push_back(U);
2590 DeleteNodeNotInCSEMaps(U);
2595 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2596 /// uses of other values produced by From.Val alone. The Deleted vector is
2597 /// handled the same was as for ReplaceAllUsesWith.
2598 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2599 std::vector<SDNode*> &Deleted) {
2600 assert(From != To && "Cannot replace a value with itself");
2601 // Handle the simple, trivial, case efficiently.
2602 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2603 ReplaceAllUsesWith(From, To, &Deleted);
2607 // Get all of the users in a nice, deterministically ordered, uniqued set.
2608 SetVector<SDNode*> Users(From.Val->use_begin(), From.Val->use_end());
2610 while (!Users.empty()) {
2611 // We know that this user uses some value of From. If it is the right
2612 // value, update it.
2613 SDNode *User = Users.back();
2616 for (SDOperand *Op = User->OperandList,
2617 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2619 // Okay, we know this user needs to be updated. Remove its old self
2620 // from the CSE maps.
2621 RemoveNodeFromCSEMaps(User);
2623 // Update all operands that match "From".
2624 for (; Op != E; ++Op) {
2626 From.Val->removeUser(User);
2628 To.Val->addUser(User);
2632 // Now that we have modified User, add it back to the CSE maps. If it
2633 // already exists there, recursively merge the results together.
2634 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2635 unsigned NumDeleted = Deleted.size();
2636 ReplaceAllUsesWith(User, Existing, &Deleted);
2638 // User is now dead.
2639 Deleted.push_back(User);
2640 DeleteNodeNotInCSEMaps(User);
2642 // We have to be careful here, because ReplaceAllUsesWith could have
2643 // deleted a user of From, which means there may be dangling pointers
2644 // in the "Users" setvector. Scan over the deleted node pointers and
2645 // remove them from the setvector.
2646 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2647 Users.remove(Deleted[i]);
2649 break; // Exit the operand scanning loop.
2656 //===----------------------------------------------------------------------===//
2658 //===----------------------------------------------------------------------===//
2661 /// getValueTypeList - Return a pointer to the specified value type.
2663 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2664 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2669 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2670 /// indicated value. This method ignores uses of other values defined by this
2672 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2673 assert(Value < getNumValues() && "Bad value!");
2675 // If there is only one value, this is easy.
2676 if (getNumValues() == 1)
2677 return use_size() == NUses;
2678 if (Uses.size() < NUses) return false;
2680 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2682 std::set<SDNode*> UsersHandled;
2684 for (std::vector<SDNode*>::const_iterator UI = Uses.begin(), E = Uses.end();
2687 if (User->getNumOperands() == 1 ||
2688 UsersHandled.insert(User).second) // First time we've seen this?
2689 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2690 if (User->getOperand(i) == TheValue) {
2692 return false; // too many uses
2697 // Found exactly the right number of uses?
2702 // isOnlyUse - Return true if this node is the only use of N.
2703 bool SDNode::isOnlyUse(SDNode *N) const {
2705 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2716 // isOperand - Return true if this node is an operand of N.
2717 bool SDOperand::isOperand(SDNode *N) const {
2718 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2719 if (*this == N->getOperand(i))
2724 bool SDNode::isOperand(SDNode *N) const {
2725 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2726 if (this == N->OperandList[i].Val)
2731 const char *SDNode::getOperationName(const SelectionDAG *G) const {
2732 switch (getOpcode()) {
2734 if (getOpcode() < ISD::BUILTIN_OP_END)
2735 return "<<Unknown DAG Node>>";
2738 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2739 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2740 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2742 TargetLowering &TLI = G->getTargetLoweringInfo();
2744 TLI.getTargetNodeName(getOpcode());
2745 if (Name) return Name;
2748 return "<<Unknown Target Node>>";
2751 case ISD::PCMARKER: return "PCMarker";
2752 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2753 case ISD::SRCVALUE: return "SrcValue";
2754 case ISD::EntryToken: return "EntryToken";
2755 case ISD::TokenFactor: return "TokenFactor";
2756 case ISD::AssertSext: return "AssertSext";
2757 case ISD::AssertZext: return "AssertZext";
2759 case ISD::STRING: return "String";
2760 case ISD::BasicBlock: return "BasicBlock";
2761 case ISD::VALUETYPE: return "ValueType";
2762 case ISD::Register: return "Register";
2764 case ISD::Constant: return "Constant";
2765 case ISD::ConstantFP: return "ConstantFP";
2766 case ISD::GlobalAddress: return "GlobalAddress";
2767 case ISD::FrameIndex: return "FrameIndex";
2768 case ISD::JumpTable: return "JumpTable";
2769 case ISD::ConstantPool: return "ConstantPool";
2770 case ISD::ExternalSymbol: return "ExternalSymbol";
2771 case ISD::INTRINSIC_WO_CHAIN: {
2772 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2773 return Intrinsic::getName((Intrinsic::ID)IID);
2775 case ISD::INTRINSIC_VOID:
2776 case ISD::INTRINSIC_W_CHAIN: {
2777 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2778 return Intrinsic::getName((Intrinsic::ID)IID);
2781 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2782 case ISD::TargetConstant: return "TargetConstant";
2783 case ISD::TargetConstantFP:return "TargetConstantFP";
2784 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2785 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2786 case ISD::TargetJumpTable: return "TargetJumpTable";
2787 case ISD::TargetConstantPool: return "TargetConstantPool";
2788 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2790 case ISD::CopyToReg: return "CopyToReg";
2791 case ISD::CopyFromReg: return "CopyFromReg";
2792 case ISD::UNDEF: return "undef";
2793 case ISD::MERGE_VALUES: return "mergevalues";
2794 case ISD::INLINEASM: return "inlineasm";
2795 case ISD::HANDLENODE: return "handlenode";
2796 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
2799 case ISD::FABS: return "fabs";
2800 case ISD::FNEG: return "fneg";
2801 case ISD::FSQRT: return "fsqrt";
2802 case ISD::FSIN: return "fsin";
2803 case ISD::FCOS: return "fcos";
2806 case ISD::ADD: return "add";
2807 case ISD::SUB: return "sub";
2808 case ISD::MUL: return "mul";
2809 case ISD::MULHU: return "mulhu";
2810 case ISD::MULHS: return "mulhs";
2811 case ISD::SDIV: return "sdiv";
2812 case ISD::UDIV: return "udiv";
2813 case ISD::SREM: return "srem";
2814 case ISD::UREM: return "urem";
2815 case ISD::AND: return "and";
2816 case ISD::OR: return "or";
2817 case ISD::XOR: return "xor";
2818 case ISD::SHL: return "shl";
2819 case ISD::SRA: return "sra";
2820 case ISD::SRL: return "srl";
2821 case ISD::ROTL: return "rotl";
2822 case ISD::ROTR: return "rotr";
2823 case ISD::FADD: return "fadd";
2824 case ISD::FSUB: return "fsub";
2825 case ISD::FMUL: return "fmul";
2826 case ISD::FDIV: return "fdiv";
2827 case ISD::FREM: return "frem";
2828 case ISD::FCOPYSIGN: return "fcopysign";
2829 case ISD::VADD: return "vadd";
2830 case ISD::VSUB: return "vsub";
2831 case ISD::VMUL: return "vmul";
2832 case ISD::VSDIV: return "vsdiv";
2833 case ISD::VUDIV: return "vudiv";
2834 case ISD::VAND: return "vand";
2835 case ISD::VOR: return "vor";
2836 case ISD::VXOR: return "vxor";
2838 case ISD::SETCC: return "setcc";
2839 case ISD::SELECT: return "select";
2840 case ISD::SELECT_CC: return "select_cc";
2841 case ISD::VSELECT: return "vselect";
2842 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2843 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2844 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2845 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2846 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2847 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2848 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2849 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2850 case ISD::VBIT_CONVERT: return "vbit_convert";
2851 case ISD::ADDC: return "addc";
2852 case ISD::ADDE: return "adde";
2853 case ISD::SUBC: return "subc";
2854 case ISD::SUBE: return "sube";
2855 case ISD::SHL_PARTS: return "shl_parts";
2856 case ISD::SRA_PARTS: return "sra_parts";
2857 case ISD::SRL_PARTS: return "srl_parts";
2859 // Conversion operators.
2860 case ISD::SIGN_EXTEND: return "sign_extend";
2861 case ISD::ZERO_EXTEND: return "zero_extend";
2862 case ISD::ANY_EXTEND: return "any_extend";
2863 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2864 case ISD::TRUNCATE: return "truncate";
2865 case ISD::FP_ROUND: return "fp_round";
2866 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2867 case ISD::FP_EXTEND: return "fp_extend";
2869 case ISD::SINT_TO_FP: return "sint_to_fp";
2870 case ISD::UINT_TO_FP: return "uint_to_fp";
2871 case ISD::FP_TO_SINT: return "fp_to_sint";
2872 case ISD::FP_TO_UINT: return "fp_to_uint";
2873 case ISD::BIT_CONVERT: return "bit_convert";
2875 // Control flow instructions
2876 case ISD::BR: return "br";
2877 case ISD::BRIND: return "brind";
2878 case ISD::BRCOND: return "brcond";
2879 case ISD::BR_CC: return "br_cc";
2880 case ISD::RET: return "ret";
2881 case ISD::CALLSEQ_START: return "callseq_start";
2882 case ISD::CALLSEQ_END: return "callseq_end";
2885 case ISD::LOAD: return "load";
2886 case ISD::STORE: return "store";
2887 case ISD::VLOAD: return "vload";
2888 case ISD::EXTLOAD: return "extload";
2889 case ISD::SEXTLOAD: return "sextload";
2890 case ISD::ZEXTLOAD: return "zextload";
2891 case ISD::TRUNCSTORE: return "truncstore";
2892 case ISD::VAARG: return "vaarg";
2893 case ISD::VACOPY: return "vacopy";
2894 case ISD::VAEND: return "vaend";
2895 case ISD::VASTART: return "vastart";
2896 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2897 case ISD::EXTRACT_ELEMENT: return "extract_element";
2898 case ISD::BUILD_PAIR: return "build_pair";
2899 case ISD::STACKSAVE: return "stacksave";
2900 case ISD::STACKRESTORE: return "stackrestore";
2902 // Block memory operations.
2903 case ISD::MEMSET: return "memset";
2904 case ISD::MEMCPY: return "memcpy";
2905 case ISD::MEMMOVE: return "memmove";
2908 case ISD::BSWAP: return "bswap";
2909 case ISD::CTPOP: return "ctpop";
2910 case ISD::CTTZ: return "cttz";
2911 case ISD::CTLZ: return "ctlz";
2914 case ISD::LOCATION: return "location";
2915 case ISD::DEBUG_LOC: return "debug_loc";
2916 case ISD::DEBUG_LABEL: return "debug_label";
2919 switch (cast<CondCodeSDNode>(this)->get()) {
2920 default: assert(0 && "Unknown setcc condition!");
2921 case ISD::SETOEQ: return "setoeq";
2922 case ISD::SETOGT: return "setogt";
2923 case ISD::SETOGE: return "setoge";
2924 case ISD::SETOLT: return "setolt";
2925 case ISD::SETOLE: return "setole";
2926 case ISD::SETONE: return "setone";
2928 case ISD::SETO: return "seto";
2929 case ISD::SETUO: return "setuo";
2930 case ISD::SETUEQ: return "setue";
2931 case ISD::SETUGT: return "setugt";
2932 case ISD::SETUGE: return "setuge";
2933 case ISD::SETULT: return "setult";
2934 case ISD::SETULE: return "setule";
2935 case ISD::SETUNE: return "setune";
2937 case ISD::SETEQ: return "seteq";
2938 case ISD::SETGT: return "setgt";
2939 case ISD::SETGE: return "setge";
2940 case ISD::SETLT: return "setlt";
2941 case ISD::SETLE: return "setle";
2942 case ISD::SETNE: return "setne";
2947 void SDNode::dump() const { dump(0); }
2948 void SDNode::dump(const SelectionDAG *G) const {
2949 std::cerr << (void*)this << ": ";
2951 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
2952 if (i) std::cerr << ",";
2953 if (getValueType(i) == MVT::Other)
2956 std::cerr << MVT::getValueTypeString(getValueType(i));
2958 std::cerr << " = " << getOperationName(G);
2961 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2962 if (i) std::cerr << ", ";
2963 std::cerr << (void*)getOperand(i).Val;
2964 if (unsigned RN = getOperand(i).ResNo)
2965 std::cerr << ":" << RN;
2968 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
2969 std::cerr << "<" << CSDN->getValue() << ">";
2970 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
2971 std::cerr << "<" << CSDN->getValue() << ">";
2972 } else if (const GlobalAddressSDNode *GADN =
2973 dyn_cast<GlobalAddressSDNode>(this)) {
2974 int offset = GADN->getOffset();
2976 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
2978 std::cerr << " + " << offset;
2980 std::cerr << " " << offset;
2981 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
2982 std::cerr << "<" << FIDN->getIndex() << ">";
2983 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
2984 int offset = CP->getOffset();
2985 std::cerr << "<" << *CP->get() << ">";
2987 std::cerr << " + " << offset;
2989 std::cerr << " " << offset;
2990 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
2992 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
2994 std::cerr << LBB->getName() << " ";
2995 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
2996 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
2997 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
2998 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
3000 std::cerr << " #" << R->getReg();
3002 } else if (const ExternalSymbolSDNode *ES =
3003 dyn_cast<ExternalSymbolSDNode>(this)) {
3004 std::cerr << "'" << ES->getSymbol() << "'";
3005 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
3007 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
3009 std::cerr << "<null:" << M->getOffset() << ">";
3010 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
3011 std::cerr << ":" << getValueTypeString(N->getVT());
3015 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
3016 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3017 if (N->getOperand(i).Val->hasOneUse())
3018 DumpNodes(N->getOperand(i).Val, indent+2, G);
3020 std::cerr << "\n" << std::string(indent+2, ' ')
3021 << (void*)N->getOperand(i).Val << ": <multiple use>";
3024 std::cerr << "\n" << std::string(indent, ' ');
3028 void SelectionDAG::dump() const {
3029 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
3030 std::vector<const SDNode*> Nodes;
3031 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
3035 std::sort(Nodes.begin(), Nodes.end());
3037 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
3038 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
3039 DumpNodes(Nodes[i], 2, this);
3042 DumpNodes(getRoot().Val, 2, this);
3044 std::cerr << "\n\n";
3047 /// InsertISelMapEntry - A helper function to insert a key / element pair
3048 /// into a SDOperand to SDOperand map. This is added to avoid the map
3049 /// insertion operator from being inlined.
3050 void SelectionDAG::InsertISelMapEntry(std::map<SDOperand, SDOperand> &Map,
3051 SDNode *Key, unsigned KeyResNo,
3052 SDNode *Element, unsigned ElementResNo) {
3053 Map.insert(std::make_pair(SDOperand(Key, KeyResNo),
3054 SDOperand(Element, ElementResNo)));