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 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
78 unsigned i = 0, e = N->getNumOperands();
80 // Skip over all of the undef values.
81 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
84 // Do not accept an all-undef vector.
85 if (i == e) return false;
87 // Do not accept build_vectors that aren't all constants or which have non-~0
89 SDOperand NotZero = N->getOperand(i);
90 if (isa<ConstantSDNode>(NotZero)) {
91 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
93 } else if (isa<ConstantFPSDNode>(NotZero)) {
94 MVT::ValueType VT = NotZero.getValueType();
96 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
100 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
107 // Okay, we have at least one ~0 value, check to see if the rest match or are
109 for (++i; i != e; ++i)
110 if (N->getOperand(i) != NotZero &&
111 N->getOperand(i).getOpcode() != ISD::UNDEF)
117 /// isBuildVectorAllZeros - Return true if the specified node is a
118 /// BUILD_VECTOR where all of the elements are 0 or undef.
119 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
120 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
122 unsigned i = 0, e = N->getNumOperands();
124 // Skip over all of the undef values.
125 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
128 // Do not accept an all-undef vector.
129 if (i == e) return false;
131 // Do not accept build_vectors that aren't all constants or which have non-~0
133 SDOperand Zero = N->getOperand(i);
134 if (isa<ConstantSDNode>(Zero)) {
135 if (!cast<ConstantSDNode>(Zero)->isNullValue())
137 } else if (isa<ConstantFPSDNode>(Zero)) {
138 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0))
143 // Okay, we have at least one ~0 value, check to see if the rest match or are
145 for (++i; i != e; ++i)
146 if (N->getOperand(i) != Zero &&
147 N->getOperand(i).getOpcode() != ISD::UNDEF)
152 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
153 /// when given the operation for (X op Y).
154 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
155 // To perform this operation, we just need to swap the L and G bits of the
157 unsigned OldL = (Operation >> 2) & 1;
158 unsigned OldG = (Operation >> 1) & 1;
159 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
160 (OldL << 1) | // New G bit
161 (OldG << 2)); // New L bit.
164 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
165 /// 'op' is a valid SetCC operation.
166 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
167 unsigned Operation = Op;
169 Operation ^= 7; // Flip L, G, E bits, but not U.
171 Operation ^= 15; // Flip all of the condition bits.
172 if (Operation > ISD::SETTRUE2)
173 Operation &= ~8; // Don't let N and U bits get set.
174 return ISD::CondCode(Operation);
178 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
179 /// signed operation and 2 if the result is an unsigned comparison. Return zero
180 /// if the operation does not depend on the sign of the input (setne and seteq).
181 static int isSignedOp(ISD::CondCode Opcode) {
183 default: assert(0 && "Illegal integer setcc operation!");
185 case ISD::SETNE: return 0;
189 case ISD::SETGE: return 1;
193 case ISD::SETUGE: return 2;
197 /// getSetCCOrOperation - Return the result of a logical OR between different
198 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
199 /// returns SETCC_INVALID if it is not possible to represent the resultant
201 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
203 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
204 // Cannot fold a signed integer setcc with an unsigned integer setcc.
205 return ISD::SETCC_INVALID;
207 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
209 // If the N and U bits get set then the resultant comparison DOES suddenly
210 // care about orderedness, and is true when ordered.
211 if (Op > ISD::SETTRUE2)
212 Op &= ~16; // Clear the N bit.
213 return ISD::CondCode(Op);
216 /// getSetCCAndOperation - Return the result of a logical AND between different
217 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
218 /// function returns zero if it is not possible to represent the resultant
220 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
222 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
223 // Cannot fold a signed setcc with an unsigned setcc.
224 return ISD::SETCC_INVALID;
226 // Combine all of the condition bits.
227 return ISD::CondCode(Op1 & Op2);
230 const TargetMachine &SelectionDAG::getTarget() const {
231 return TLI.getTargetMachine();
234 //===----------------------------------------------------------------------===//
235 // SelectionDAG Class
236 //===----------------------------------------------------------------------===//
238 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
239 /// SelectionDAG, including nodes (like loads) that have uses of their token
240 /// chain but no other uses and no side effect. If a node is passed in as an
241 /// argument, it is used as the seed for node deletion.
242 void SelectionDAG::RemoveDeadNodes(SDNode *N) {
243 // Create a dummy node (which is not added to allnodes), that adds a reference
244 // to the root node, preventing it from being deleted.
245 HandleSDNode Dummy(getRoot());
247 bool MadeChange = false;
249 // If we have a hint to start from, use it.
250 if (N && N->use_empty()) {
255 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
256 if (I->use_empty() && I->getOpcode() != 65535) {
257 // Node is dead, recursively delete newly dead uses.
262 // Walk the nodes list, removing the nodes we've marked as dead.
264 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ) {
271 // If the root changed (e.g. it was a dead load, update the root).
272 setRoot(Dummy.getValue());
275 /// DestroyDeadNode - We know that N is dead. Nuke it from the CSE maps for the
276 /// graph. If it is the last user of any of its operands, recursively process
277 /// them the same way.
279 void SelectionDAG::DestroyDeadNode(SDNode *N) {
280 // Okay, we really are going to delete this node. First take this out of the
281 // appropriate CSE map.
282 RemoveNodeFromCSEMaps(N);
284 // Next, brutally remove the operand list. This is safe to do, as there are
285 // no cycles in the graph.
286 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
290 // Now that we removed this operand, see if there are no uses of it left.
294 delete[] N->OperandList;
298 // Mark the node as dead.
299 N->MorphNodeTo(65535);
302 void SelectionDAG::DeleteNode(SDNode *N) {
303 assert(N->use_empty() && "Cannot delete a node that is not dead!");
305 // First take this out of the appropriate CSE map.
306 RemoveNodeFromCSEMaps(N);
308 // Finally, remove uses due to operands of this node, remove from the
309 // AllNodes list, and delete the node.
310 DeleteNodeNotInCSEMaps(N);
313 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
315 // Remove it from the AllNodes list.
318 // Drop all of the operands and decrement used nodes use counts.
319 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
320 I->Val->removeUser(N);
321 delete[] N->OperandList;
328 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
329 /// correspond to it. This is useful when we're about to delete or repurpose
330 /// the node. We don't want future request for structurally identical nodes
331 /// to return N anymore.
332 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
334 switch (N->getOpcode()) {
335 case ISD::HANDLENODE: return; // noop.
337 Erased = Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(),
338 N->getValueType(0)));
340 case ISD::TargetConstant:
341 Erased = TargetConstants.erase(std::make_pair(
342 cast<ConstantSDNode>(N)->getValue(),
343 N->getValueType(0)));
345 case ISD::ConstantFP: {
346 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
347 Erased = ConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
350 case ISD::TargetConstantFP: {
351 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
352 Erased = TargetConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
356 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
359 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
360 "Cond code doesn't exist!");
361 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
362 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
364 case ISD::GlobalAddress: {
365 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
366 Erased = GlobalValues.erase(std::make_pair(GN->getGlobal(),
370 case ISD::TargetGlobalAddress: {
371 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
372 Erased =TargetGlobalValues.erase(std::make_pair(GN->getGlobal(),
376 case ISD::FrameIndex:
377 Erased = FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
379 case ISD::TargetFrameIndex:
380 Erased = TargetFrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
382 case ISD::ConstantPool:
383 Erased = ConstantPoolIndices.
384 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
385 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
386 cast<ConstantPoolSDNode>(N)->getAlignment())));
388 case ISD::TargetConstantPool:
389 Erased = TargetConstantPoolIndices.
390 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
391 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
392 cast<ConstantPoolSDNode>(N)->getAlignment())));
394 case ISD::BasicBlock:
395 Erased = BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock());
397 case ISD::ExternalSymbol:
398 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
400 case ISD::TargetExternalSymbol:
402 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
405 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
406 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
409 Erased = RegNodes.erase(std::make_pair(cast<RegisterSDNode>(N)->getReg(),
410 N->getValueType(0)));
412 case ISD::SRCVALUE: {
413 SrcValueSDNode *SVN = cast<SrcValueSDNode>(N);
414 Erased =ValueNodes.erase(std::make_pair(SVN->getValue(), SVN->getOffset()));
418 Erased = Loads.erase(std::make_pair(N->getOperand(1),
419 std::make_pair(N->getOperand(0),
420 N->getValueType(0))));
423 if (N->getNumValues() == 1) {
424 if (N->getNumOperands() == 0) {
425 Erased = NullaryOps.erase(std::make_pair(N->getOpcode(),
426 N->getValueType(0)));
427 } else if (N->getNumOperands() == 1) {
429 UnaryOps.erase(std::make_pair(N->getOpcode(),
430 std::make_pair(N->getOperand(0),
431 N->getValueType(0))));
432 } else if (N->getNumOperands() == 2) {
434 BinaryOps.erase(std::make_pair(N->getOpcode(),
435 std::make_pair(N->getOperand(0),
438 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
440 OneResultNodes.erase(std::make_pair(N->getOpcode(),
441 std::make_pair(N->getValueType(0),
445 // Remove the node from the ArbitraryNodes map.
446 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
447 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
449 ArbitraryNodes.erase(std::make_pair(N->getOpcode(),
450 std::make_pair(RV, Ops)));
455 // Verify that the node was actually in one of the CSE maps, unless it has a
456 // flag result (which cannot be CSE'd) or is one of the special cases that are
457 // not subject to CSE.
458 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
459 !N->isTargetOpcode()) {
461 assert(0 && "Node is not in map!");
466 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
467 /// has been taken out and modified in some way. If the specified node already
468 /// exists in the CSE maps, do not modify the maps, but return the existing node
469 /// instead. If it doesn't exist, add it and return null.
471 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
472 assert(N->getNumOperands() && "This is a leaf node!");
473 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
474 return 0; // Never add these nodes.
476 // Check that remaining values produced are not flags.
477 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
478 if (N->getValueType(i) == MVT::Flag)
479 return 0; // Never CSE anything that produces a flag.
481 if (N->getNumValues() == 1) {
482 if (N->getNumOperands() == 1) {
483 SDNode *&U = UnaryOps[std::make_pair(N->getOpcode(),
484 std::make_pair(N->getOperand(0),
485 N->getValueType(0)))];
488 } else if (N->getNumOperands() == 2) {
489 SDNode *&B = BinaryOps[std::make_pair(N->getOpcode(),
490 std::make_pair(N->getOperand(0),
495 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
496 SDNode *&ORN = OneResultNodes[std::make_pair(N->getOpcode(),
497 std::make_pair(N->getValueType(0), Ops))];
502 if (N->getOpcode() == ISD::LOAD) {
503 SDNode *&L = Loads[std::make_pair(N->getOperand(1),
504 std::make_pair(N->getOperand(0),
505 N->getValueType(0)))];
509 // Remove the node from the ArbitraryNodes map.
510 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
511 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
512 SDNode *&AN = ArbitraryNodes[std::make_pair(N->getOpcode(),
513 std::make_pair(RV, Ops))];
521 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
522 /// were replaced with those specified. If this node is never memoized,
523 /// return null, otherwise return a pointer to the slot it would take. If a
524 /// node already exists with these operands, the slot will be non-null.
525 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op) {
526 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
527 return 0; // Never add these nodes.
529 // Check that remaining values produced are not flags.
530 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
531 if (N->getValueType(i) == MVT::Flag)
532 return 0; // Never CSE anything that produces a flag.
534 if (N->getNumValues() == 1) {
535 return &UnaryOps[std::make_pair(N->getOpcode(),
536 std::make_pair(Op, N->getValueType(0)))];
538 // Remove the node from the ArbitraryNodes map.
539 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
540 std::vector<SDOperand> Ops;
542 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
543 std::make_pair(RV, Ops))];
548 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
549 /// were replaced with those specified. If this node is never memoized,
550 /// return null, otherwise return a pointer to the slot it would take. If a
551 /// node already exists with these operands, the slot will be non-null.
552 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
553 SDOperand Op1, SDOperand Op2) {
554 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
555 return 0; // Never add these nodes.
557 // Check that remaining values produced are not flags.
558 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
559 if (N->getValueType(i) == MVT::Flag)
560 return 0; // Never CSE anything that produces a flag.
562 if (N->getNumValues() == 1) {
563 return &BinaryOps[std::make_pair(N->getOpcode(),
564 std::make_pair(Op1, Op2))];
566 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
567 std::vector<SDOperand> Ops;
570 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
571 std::make_pair(RV, Ops))];
577 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
578 /// were replaced with those specified. If this node is never memoized,
579 /// return null, otherwise return a pointer to the slot it would take. If a
580 /// node already exists with these operands, the slot will be non-null.
581 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
582 const std::vector<SDOperand> &Ops) {
583 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
584 return 0; // Never add these nodes.
586 // Check that remaining values produced are not flags.
587 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
588 if (N->getValueType(i) == MVT::Flag)
589 return 0; // Never CSE anything that produces a flag.
591 if (N->getNumValues() == 1) {
592 if (N->getNumOperands() == 1) {
593 return &UnaryOps[std::make_pair(N->getOpcode(),
594 std::make_pair(Ops[0],
595 N->getValueType(0)))];
596 } else if (N->getNumOperands() == 2) {
597 return &BinaryOps[std::make_pair(N->getOpcode(),
598 std::make_pair(Ops[0], Ops[1]))];
600 return &OneResultNodes[std::make_pair(N->getOpcode(),
601 std::make_pair(N->getValueType(0),
605 if (N->getOpcode() == ISD::LOAD) {
606 return &Loads[std::make_pair(Ops[1],
607 std::make_pair(Ops[0], N->getValueType(0)))];
609 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
610 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
611 std::make_pair(RV, Ops))];
618 SelectionDAG::~SelectionDAG() {
619 while (!AllNodes.empty()) {
620 SDNode *N = AllNodes.begin();
621 delete [] N->OperandList;
624 AllNodes.pop_front();
628 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
629 if (Op.getValueType() == VT) return Op;
630 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
631 return getNode(ISD::AND, Op.getValueType(), Op,
632 getConstant(Imm, Op.getValueType()));
635 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) {
636 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
637 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
639 // Mask out any bits that are not valid for this constant.
641 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
643 SDNode *&N = Constants[std::make_pair(Val, VT)];
644 if (N) return SDOperand(N, 0);
645 N = new ConstantSDNode(false, Val, VT);
646 AllNodes.push_back(N);
647 return SDOperand(N, 0);
650 SDOperand SelectionDAG::getString(const std::string &Val) {
651 StringSDNode *&N = StringNodes[Val];
653 N = new StringSDNode(Val);
654 AllNodes.push_back(N);
656 return SDOperand(N, 0);
659 SDOperand SelectionDAG::getTargetConstant(uint64_t Val, MVT::ValueType VT) {
660 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
661 // Mask out any bits that are not valid for this constant.
663 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
665 SDNode *&N = TargetConstants[std::make_pair(Val, VT)];
666 if (N) return SDOperand(N, 0);
667 N = new ConstantSDNode(true, Val, VT);
668 AllNodes.push_back(N);
669 return SDOperand(N, 0);
672 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) {
673 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
675 Val = (float)Val; // Mask out extra precision.
677 // Do the map lookup using the actual bit pattern for the floating point
678 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
679 // we don't have issues with SNANs.
680 SDNode *&N = ConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
681 if (N) return SDOperand(N, 0);
682 N = new ConstantFPSDNode(false, Val, VT);
683 AllNodes.push_back(N);
684 return SDOperand(N, 0);
687 SDOperand SelectionDAG::getTargetConstantFP(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 = TargetConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
696 if (N) return SDOperand(N, 0);
697 N = new ConstantFPSDNode(true, Val, VT);
698 AllNodes.push_back(N);
699 return SDOperand(N, 0);
702 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
703 MVT::ValueType VT, int offset) {
704 SDNode *&N = GlobalValues[std::make_pair(GV, offset)];
705 if (N) return SDOperand(N, 0);
706 N = new GlobalAddressSDNode(false, GV, VT, offset);
707 AllNodes.push_back(N);
708 return SDOperand(N, 0);
711 SDOperand SelectionDAG::getTargetGlobalAddress(const GlobalValue *GV,
712 MVT::ValueType VT, int offset) {
713 SDNode *&N = TargetGlobalValues[std::make_pair(GV, offset)];
714 if (N) return SDOperand(N, 0);
715 N = new GlobalAddressSDNode(true, GV, VT, offset);
716 AllNodes.push_back(N);
717 return SDOperand(N, 0);
720 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) {
721 SDNode *&N = FrameIndices[FI];
722 if (N) return SDOperand(N, 0);
723 N = new FrameIndexSDNode(FI, VT, false);
724 AllNodes.push_back(N);
725 return SDOperand(N, 0);
728 SDOperand SelectionDAG::getTargetFrameIndex(int FI, MVT::ValueType VT) {
729 SDNode *&N = TargetFrameIndices[FI];
730 if (N) return SDOperand(N, 0);
731 N = new FrameIndexSDNode(FI, VT, true);
732 AllNodes.push_back(N);
733 return SDOperand(N, 0);
736 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
737 unsigned Alignment, int Offset) {
738 SDNode *&N = ConstantPoolIndices[std::make_pair(C,
739 std::make_pair(Offset, Alignment))];
740 if (N) return SDOperand(N, 0);
741 N = new ConstantPoolSDNode(false, C, VT, Offset, Alignment);
742 AllNodes.push_back(N);
743 return SDOperand(N, 0);
746 SDOperand SelectionDAG::getTargetConstantPool(Constant *C, MVT::ValueType VT,
747 unsigned Alignment, int Offset) {
748 SDNode *&N = TargetConstantPoolIndices[std::make_pair(C,
749 std::make_pair(Offset, Alignment))];
750 if (N) return SDOperand(N, 0);
751 N = new ConstantPoolSDNode(true, C, VT, Offset, Alignment);
752 AllNodes.push_back(N);
753 return SDOperand(N, 0);
756 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
757 SDNode *&N = BBNodes[MBB];
758 if (N) return SDOperand(N, 0);
759 N = new BasicBlockSDNode(MBB);
760 AllNodes.push_back(N);
761 return SDOperand(N, 0);
764 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
765 if ((unsigned)VT >= ValueTypeNodes.size())
766 ValueTypeNodes.resize(VT+1);
767 if (ValueTypeNodes[VT] == 0) {
768 ValueTypeNodes[VT] = new VTSDNode(VT);
769 AllNodes.push_back(ValueTypeNodes[VT]);
772 return SDOperand(ValueTypeNodes[VT], 0);
775 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
776 SDNode *&N = ExternalSymbols[Sym];
777 if (N) return SDOperand(N, 0);
778 N = new ExternalSymbolSDNode(false, Sym, VT);
779 AllNodes.push_back(N);
780 return SDOperand(N, 0);
783 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
785 SDNode *&N = TargetExternalSymbols[Sym];
786 if (N) return SDOperand(N, 0);
787 N = new ExternalSymbolSDNode(true, Sym, VT);
788 AllNodes.push_back(N);
789 return SDOperand(N, 0);
792 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
793 if ((unsigned)Cond >= CondCodeNodes.size())
794 CondCodeNodes.resize(Cond+1);
796 if (CondCodeNodes[Cond] == 0) {
797 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
798 AllNodes.push_back(CondCodeNodes[Cond]);
800 return SDOperand(CondCodeNodes[Cond], 0);
803 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
804 RegisterSDNode *&Reg = RegNodes[std::make_pair(RegNo, VT)];
806 Reg = new RegisterSDNode(RegNo, VT);
807 AllNodes.push_back(Reg);
809 return SDOperand(Reg, 0);
812 SDOperand SelectionDAG::SimplifySetCC(MVT::ValueType VT, SDOperand N1,
813 SDOperand N2, ISD::CondCode Cond) {
814 // These setcc operations always fold.
818 case ISD::SETFALSE2: return getConstant(0, VT);
820 case ISD::SETTRUE2: return getConstant(1, VT);
823 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
824 uint64_t C2 = N2C->getValue();
825 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
826 uint64_t C1 = N1C->getValue();
828 // Sign extend the operands if required
829 if (ISD::isSignedIntSetCC(Cond)) {
830 C1 = N1C->getSignExtended();
831 C2 = N2C->getSignExtended();
835 default: assert(0 && "Unknown integer setcc!");
836 case ISD::SETEQ: return getConstant(C1 == C2, VT);
837 case ISD::SETNE: return getConstant(C1 != C2, VT);
838 case ISD::SETULT: return getConstant(C1 < C2, VT);
839 case ISD::SETUGT: return getConstant(C1 > C2, VT);
840 case ISD::SETULE: return getConstant(C1 <= C2, VT);
841 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
842 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
843 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
844 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
845 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
848 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
849 if (N1.getOpcode() == ISD::ZERO_EXTEND) {
850 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType());
852 // If the comparison constant has bits in the upper part, the
853 // zero-extended value could never match.
854 if (C2 & (~0ULL << InSize)) {
855 unsigned VSize = MVT::getSizeInBits(N1.getValueType());
859 case ISD::SETEQ: return getConstant(0, VT);
862 case ISD::SETNE: return getConstant(1, VT);
865 // True if the sign bit of C2 is set.
866 return getConstant((C2 & (1ULL << VSize)) != 0, VT);
869 // True if the sign bit of C2 isn't set.
870 return getConstant((C2 & (1ULL << VSize)) == 0, VT);
876 // Otherwise, we can perform the comparison with the low bits.
884 return getSetCC(VT, N1.getOperand(0),
885 getConstant(C2, N1.getOperand(0).getValueType()),
888 break; // todo, be more careful with signed comparisons
890 } else if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG &&
891 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
892 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N1.getOperand(1))->getVT();
893 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy);
894 MVT::ValueType ExtDstTy = N1.getValueType();
895 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy);
897 // If the extended part has any inconsistent bits, it cannot ever
898 // compare equal. In other words, they have to be all ones or all
901 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1));
902 if ((C2 & ExtBits) != 0 && (C2 & ExtBits) != ExtBits)
903 return getConstant(Cond == ISD::SETNE, VT);
905 // Otherwise, make this a use of a zext.
906 return getSetCC(VT, getZeroExtendInReg(N1.getOperand(0), ExtSrcTy),
907 getConstant(C2 & (~0ULL>>(64-ExtSrcTyBits)), ExtDstTy),
911 uint64_t MinVal, MaxVal;
912 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0));
913 if (ISD::isSignedIntSetCC(Cond)) {
914 MinVal = 1ULL << (OperandBitSize-1);
915 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined.
916 MaxVal = ~0ULL >> (65-OperandBitSize);
921 MaxVal = ~0ULL >> (64-OperandBitSize);
924 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
925 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
926 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true
927 --C2; // X >= C1 --> X > (C1-1)
928 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
929 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
932 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
933 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true
934 ++C2; // X <= C1 --> X < (C1+1)
935 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
936 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
939 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal)
940 return getConstant(0, VT); // X < MIN --> false
942 // Canonicalize setgt X, Min --> setne X, Min
943 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal)
944 return getSetCC(VT, N1, N2, ISD::SETNE);
946 // If we have setult X, 1, turn it into seteq X, 0
947 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1)
948 return getSetCC(VT, N1, getConstant(MinVal, N1.getValueType()),
950 // If we have setugt X, Max-1, turn it into seteq X, Max
951 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1)
952 return getSetCC(VT, N1, getConstant(MaxVal, N1.getValueType()),
955 // If we have "setcc X, C1", check to see if we can shrink the immediate
958 // SETUGT X, SINTMAX -> SETLT X, 0
959 if (Cond == ISD::SETUGT && OperandBitSize != 1 &&
960 C2 == (~0ULL >> (65-OperandBitSize)))
961 return getSetCC(VT, N1, getConstant(0, N2.getValueType()), ISD::SETLT);
963 // FIXME: Implement the rest of these.
966 // Fold bit comparisons when we can.
967 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
968 VT == N1.getValueType() && N1.getOpcode() == ISD::AND)
969 if (ConstantSDNode *AndRHS =
970 dyn_cast<ConstantSDNode>(N1.getOperand(1))) {
971 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
972 // Perform the xform if the AND RHS is a single bit.
973 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) {
974 return getNode(ISD::SRL, VT, N1,
975 getConstant(Log2_64(AndRHS->getValue()),
976 TLI.getShiftAmountTy()));
978 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) {
979 // (X & 8) == 8 --> (X & 8) >> 3
980 // Perform the xform if C2 is a single bit.
981 if ((C2 & (C2-1)) == 0) {
982 return getNode(ISD::SRL, VT, N1,
983 getConstant(Log2_64(C2),TLI.getShiftAmountTy()));
988 } else if (isa<ConstantSDNode>(N1.Val)) {
989 // Ensure that the constant occurs on the RHS.
990 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
993 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
994 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
995 double C1 = N1C->getValue(), C2 = N2C->getValue();
998 default: break; // FIXME: Implement the rest of these!
999 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1000 case ISD::SETNE: return getConstant(C1 != C2, VT);
1001 case ISD::SETLT: return getConstant(C1 < C2, VT);
1002 case ISD::SETGT: return getConstant(C1 > C2, VT);
1003 case ISD::SETLE: return getConstant(C1 <= C2, VT);
1004 case ISD::SETGE: return getConstant(C1 >= C2, VT);
1007 // Ensure that the constant occurs on the RHS.
1008 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1011 // Could not fold it.
1015 /// getNode - Gets or creates the specified node.
1017 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1018 SDNode *&N = NullaryOps[std::make_pair(Opcode, VT)];
1020 N = new SDNode(Opcode, VT);
1021 AllNodes.push_back(N);
1023 return SDOperand(N, 0);
1026 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1027 SDOperand Operand) {
1029 // Constant fold unary operations with an integer constant operand.
1030 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1031 uint64_t Val = C->getValue();
1034 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1035 case ISD::ANY_EXTEND:
1036 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1037 case ISD::TRUNCATE: return getConstant(Val, VT);
1038 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
1039 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
1040 case ISD::BIT_CONVERT:
1041 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1042 return getConstantFP(BitsToFloat(Val), VT);
1043 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1044 return getConstantFP(BitsToDouble(Val), VT);
1048 default: assert(0 && "Invalid bswap!"); break;
1049 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1050 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1051 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1056 default: assert(0 && "Invalid ctpop!"); break;
1057 case MVT::i1: return getConstant(Val != 0, VT);
1059 Tmp1 = (unsigned)Val & 0xFF;
1060 return getConstant(CountPopulation_32(Tmp1), VT);
1062 Tmp1 = (unsigned)Val & 0xFFFF;
1063 return getConstant(CountPopulation_32(Tmp1), VT);
1065 return getConstant(CountPopulation_32((unsigned)Val), VT);
1067 return getConstant(CountPopulation_64(Val), VT);
1071 default: assert(0 && "Invalid ctlz!"); break;
1072 case MVT::i1: return getConstant(Val == 0, VT);
1074 Tmp1 = (unsigned)Val & 0xFF;
1075 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1077 Tmp1 = (unsigned)Val & 0xFFFF;
1078 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1080 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1082 return getConstant(CountLeadingZeros_64(Val), VT);
1086 default: assert(0 && "Invalid cttz!"); break;
1087 case MVT::i1: return getConstant(Val == 0, VT);
1089 Tmp1 = (unsigned)Val | 0x100;
1090 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1092 Tmp1 = (unsigned)Val | 0x10000;
1093 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1095 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1097 return getConstant(CountTrailingZeros_64(Val), VT);
1102 // Constant fold unary operations with an floating point constant operand.
1103 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1106 return getConstantFP(-C->getValue(), VT);
1108 return getConstantFP(fabs(C->getValue()), VT);
1110 case ISD::FP_EXTEND:
1111 return getConstantFP(C->getValue(), VT);
1112 case ISD::FP_TO_SINT:
1113 return getConstant((int64_t)C->getValue(), VT);
1114 case ISD::FP_TO_UINT:
1115 return getConstant((uint64_t)C->getValue(), VT);
1116 case ISD::BIT_CONVERT:
1117 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1118 return getConstant(FloatToBits(C->getValue()), VT);
1119 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1120 return getConstant(DoubleToBits(C->getValue()), VT);
1124 unsigned OpOpcode = Operand.Val->getOpcode();
1126 case ISD::TokenFactor:
1127 return Operand; // Factor of one node? No factor.
1128 case ISD::SIGN_EXTEND:
1129 if (Operand.getValueType() == VT) return Operand; // noop extension
1130 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1131 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1132 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1134 case ISD::ZERO_EXTEND:
1135 if (Operand.getValueType() == VT) return Operand; // noop extension
1136 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1137 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1138 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1140 case ISD::ANY_EXTEND:
1141 if (Operand.getValueType() == VT) return Operand; // noop extension
1142 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1143 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1144 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1145 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1148 if (Operand.getValueType() == VT) return Operand; // noop truncate
1149 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1150 if (OpOpcode == ISD::TRUNCATE)
1151 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1152 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1153 OpOpcode == ISD::ANY_EXTEND) {
1154 // If the source is smaller than the dest, we still need an extend.
1155 if (Operand.Val->getOperand(0).getValueType() < VT)
1156 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1157 else if (Operand.Val->getOperand(0).getValueType() > VT)
1158 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1160 return Operand.Val->getOperand(0);
1163 case ISD::BIT_CONVERT:
1164 // Basic sanity checking.
1165 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1166 && "Cannot BIT_CONVERT between two different types!");
1167 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1168 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1169 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1170 if (OpOpcode == ISD::UNDEF)
1171 return getNode(ISD::UNDEF, VT);
1173 case ISD::SCALAR_TO_VECTOR:
1174 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1175 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1176 "Illegal SCALAR_TO_VECTOR node!");
1179 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1180 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1181 Operand.Val->getOperand(0));
1182 if (OpOpcode == ISD::FNEG) // --X -> X
1183 return Operand.Val->getOperand(0);
1186 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1187 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1192 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1193 SDNode *&E = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))];
1194 if (E) return SDOperand(E, 0);
1195 E = N = new SDNode(Opcode, Operand);
1197 N = new SDNode(Opcode, Operand);
1199 N->setValueTypes(VT);
1200 AllNodes.push_back(N);
1201 return SDOperand(N, 0);
1206 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1207 SDOperand N1, SDOperand N2) {
1210 case ISD::TokenFactor:
1211 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1212 N2.getValueType() == MVT::Other && "Invalid token factor!");
1221 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1228 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1235 assert(N1.getValueType() == N2.getValueType() &&
1236 N1.getValueType() == VT && "Binary operator types must match!");
1238 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1239 assert(N1.getValueType() == VT &&
1240 MVT::isFloatingPoint(N1.getValueType()) &&
1241 MVT::isFloatingPoint(N2.getValueType()) &&
1242 "Invalid FCOPYSIGN!");
1249 assert(VT == N1.getValueType() &&
1250 "Shift operators return type must be the same as their first arg");
1251 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1252 VT != MVT::i1 && "Shifts only work on integers");
1254 case ISD::FP_ROUND_INREG: {
1255 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1256 assert(VT == N1.getValueType() && "Not an inreg round!");
1257 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1258 "Cannot FP_ROUND_INREG integer types");
1259 assert(EVT <= VT && "Not rounding down!");
1262 case ISD::AssertSext:
1263 case ISD::AssertZext:
1264 case ISD::SIGN_EXTEND_INREG: {
1265 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1266 assert(VT == N1.getValueType() && "Not an inreg extend!");
1267 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1268 "Cannot *_EXTEND_INREG FP types");
1269 assert(EVT <= VT && "Not extending!");
1276 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1277 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1280 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1282 case ISD::ADD: return getConstant(C1 + C2, VT);
1283 case ISD::SUB: return getConstant(C1 - C2, VT);
1284 case ISD::MUL: return getConstant(C1 * C2, VT);
1286 if (C2) return getConstant(C1 / C2, VT);
1289 if (C2) return getConstant(C1 % C2, VT);
1292 if (C2) return getConstant(N1C->getSignExtended() /
1293 N2C->getSignExtended(), VT);
1296 if (C2) return getConstant(N1C->getSignExtended() %
1297 N2C->getSignExtended(), VT);
1299 case ISD::AND : return getConstant(C1 & C2, VT);
1300 case ISD::OR : return getConstant(C1 | C2, VT);
1301 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1302 case ISD::SHL : return getConstant(C1 << C2, VT);
1303 case ISD::SRL : return getConstant(C1 >> C2, VT);
1304 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1306 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1309 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1313 } else { // Cannonicalize constant to RHS if commutative
1314 if (isCommutativeBinOp(Opcode)) {
1315 std::swap(N1C, N2C);
1321 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1322 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1325 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1327 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1328 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1329 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1331 if (C2) return getConstantFP(C1 / C2, VT);
1334 if (C2) return getConstantFP(fmod(C1, C2), VT);
1336 case ISD::FCOPYSIGN: {
1347 if (u2.I < 0) // Sign bit of RHS set?
1348 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1350 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1351 return getConstantFP(u1.F, VT);
1355 } else { // Cannonicalize constant to RHS if commutative
1356 if (isCommutativeBinOp(Opcode)) {
1357 std::swap(N1CFP, N2CFP);
1363 // Finally, fold operations that do not require constants.
1365 case ISD::FP_ROUND_INREG:
1366 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1368 case ISD::SIGN_EXTEND_INREG: {
1369 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1370 if (EVT == VT) return N1; // Not actually extending
1374 // FIXME: figure out how to safely handle things like
1375 // int foo(int x) { return 1 << (x & 255); }
1376 // int bar() { return foo(256); }
1381 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1382 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1383 return getNode(Opcode, VT, N1, N2.getOperand(0));
1384 else if (N2.getOpcode() == ISD::AND)
1385 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1386 // If the and is only masking out bits that cannot effect the shift,
1387 // eliminate the and.
1388 unsigned NumBits = MVT::getSizeInBits(VT);
1389 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1390 return getNode(Opcode, VT, N1, N2.getOperand(0));
1396 // Memoize this node if possible.
1398 if (VT != MVT::Flag) {
1399 SDNode *&BON = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))];
1400 if (BON) return SDOperand(BON, 0);
1402 BON = N = new SDNode(Opcode, N1, N2);
1404 N = new SDNode(Opcode, N1, N2);
1407 N->setValueTypes(VT);
1408 AllNodes.push_back(N);
1409 return SDOperand(N, 0);
1412 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1413 SDOperand N1, SDOperand N2, SDOperand N3) {
1414 // Perform various simplifications.
1415 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1416 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1417 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
1420 // Use SimplifySetCC to simplify SETCC's.
1421 SDOperand Simp = SimplifySetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1422 if (Simp.Val) return Simp;
1427 if (N1C->getValue())
1428 return N2; // select true, X, Y -> X
1430 return N3; // select false, X, Y -> Y
1432 if (N2 == N3) return N2; // select C, X, X -> X
1436 if (N2C->getValue()) // Unconditional branch
1437 return getNode(ISD::BR, MVT::Other, N1, N3);
1439 return N1; // Never-taken branch
1441 case ISD::VECTOR_SHUFFLE:
1442 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1443 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1444 N3.getOpcode() == ISD::BUILD_VECTOR &&
1445 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1446 "Illegal VECTOR_SHUFFLE node!");
1450 std::vector<SDOperand> Ops;
1456 // Memoize node if it doesn't produce a flag.
1458 if (VT != MVT::Flag) {
1459 SDNode *&E = OneResultNodes[std::make_pair(Opcode,std::make_pair(VT, Ops))];
1460 if (E) return SDOperand(E, 0);
1461 E = N = new SDNode(Opcode, N1, N2, N3);
1463 N = new SDNode(Opcode, N1, N2, N3);
1465 N->setValueTypes(VT);
1466 AllNodes.push_back(N);
1467 return SDOperand(N, 0);
1470 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1471 SDOperand N1, SDOperand N2, SDOperand N3,
1473 std::vector<SDOperand> Ops;
1479 return getNode(Opcode, VT, Ops);
1482 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1483 SDOperand N1, SDOperand N2, SDOperand N3,
1484 SDOperand N4, SDOperand N5) {
1485 std::vector<SDOperand> Ops;
1492 return getNode(Opcode, VT, Ops);
1495 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1496 SDOperand Chain, SDOperand Ptr,
1498 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))];
1499 if (N) return SDOperand(N, 0);
1500 N = new SDNode(ISD::LOAD, Chain, Ptr, SV);
1502 // Loads have a token chain.
1503 setNodeValueTypes(N, VT, MVT::Other);
1504 AllNodes.push_back(N);
1505 return SDOperand(N, 0);
1508 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1509 SDOperand Chain, SDOperand Ptr,
1511 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, EVT))];
1512 if (N) return SDOperand(N, 0);
1513 std::vector<SDOperand> Ops;
1515 Ops.push_back(Chain);
1518 Ops.push_back(getConstant(Count, MVT::i32));
1519 Ops.push_back(getValueType(EVT));
1520 std::vector<MVT::ValueType> VTs;
1522 VTs.push_back(MVT::Vector); VTs.push_back(MVT::Other); // Add token chain.
1523 return getNode(ISD::VLOAD, VTs, Ops);
1526 SDOperand SelectionDAG::getExtLoad(unsigned Opcode, MVT::ValueType VT,
1527 SDOperand Chain, SDOperand Ptr, SDOperand SV,
1528 MVT::ValueType EVT) {
1529 std::vector<SDOperand> Ops;
1531 Ops.push_back(Chain);
1534 Ops.push_back(getValueType(EVT));
1535 std::vector<MVT::ValueType> VTs;
1537 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1538 return getNode(Opcode, VTs, Ops);
1541 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
1542 assert((!V || isa<PointerType>(V->getType())) &&
1543 "SrcValue is not a pointer?");
1544 SDNode *&N = ValueNodes[std::make_pair(V, Offset)];
1545 if (N) return SDOperand(N, 0);
1547 N = new SrcValueSDNode(V, Offset);
1548 AllNodes.push_back(N);
1549 return SDOperand(N, 0);
1552 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1553 SDOperand Chain, SDOperand Ptr,
1555 std::vector<SDOperand> Ops;
1557 Ops.push_back(Chain);
1560 std::vector<MVT::ValueType> VTs;
1562 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1563 return getNode(ISD::VAARG, VTs, Ops);
1566 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1567 std::vector<SDOperand> &Ops) {
1568 switch (Ops.size()) {
1569 case 0: return getNode(Opcode, VT);
1570 case 1: return getNode(Opcode, VT, Ops[0]);
1571 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1572 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1576 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Ops[1].Val);
1579 case ISD::TRUNCSTORE: {
1580 assert(Ops.size() == 5 && "TRUNCSTORE takes 5 operands!");
1581 MVT::ValueType EVT = cast<VTSDNode>(Ops[4])->getVT();
1582 #if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store
1583 // If this is a truncating store of a constant, convert to the desired type
1584 // and store it instead.
1585 if (isa<Constant>(Ops[0])) {
1586 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1);
1587 if (isa<Constant>(Op))
1590 // Also for ConstantFP?
1592 if (Ops[0].getValueType() == EVT) // Normal store?
1593 return getNode(ISD::STORE, VT, Ops[0], Ops[1], Ops[2], Ops[3]);
1594 assert(Ops[1].getValueType() > EVT && "Not a truncation?");
1595 assert(MVT::isInteger(Ops[1].getValueType()) == MVT::isInteger(EVT) &&
1596 "Can't do FP-INT conversion!");
1599 case ISD::SELECT_CC: {
1600 assert(Ops.size() == 5 && "SELECT_CC takes 5 operands!");
1601 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1602 "LHS and RHS of condition must have same type!");
1603 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1604 "True and False arms of SelectCC must have same type!");
1605 assert(Ops[2].getValueType() == VT &&
1606 "select_cc node must be of same type as true and false value!");
1610 assert(Ops.size() == 5 && "BR_CC takes 5 operands!");
1611 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1612 "LHS/RHS of comparison should match types!");
1619 if (VT != MVT::Flag) {
1621 OneResultNodes[std::make_pair(Opcode, std::make_pair(VT, Ops))];
1622 if (E) return SDOperand(E, 0);
1623 E = N = new SDNode(Opcode, Ops);
1625 N = new SDNode(Opcode, Ops);
1627 N->setValueTypes(VT);
1628 AllNodes.push_back(N);
1629 return SDOperand(N, 0);
1632 SDOperand SelectionDAG::getNode(unsigned Opcode,
1633 std::vector<MVT::ValueType> &ResultTys,
1634 std::vector<SDOperand> &Ops) {
1635 if (ResultTys.size() == 1)
1636 return getNode(Opcode, ResultTys[0], Ops);
1641 case ISD::ZEXTLOAD: {
1642 MVT::ValueType EVT = cast<VTSDNode>(Ops[3])->getVT();
1643 assert(Ops.size() == 4 && ResultTys.size() == 2 && "Bad *EXTLOAD!");
1644 // If they are asking for an extending load from/to the same thing, return a
1646 if (ResultTys[0] == EVT)
1647 return getLoad(ResultTys[0], Ops[0], Ops[1], Ops[2]);
1648 if (MVT::isVector(ResultTys[0])) {
1649 assert(EVT == MVT::getVectorBaseType(ResultTys[0]) &&
1650 "Invalid vector extload!");
1652 assert(EVT < ResultTys[0] &&
1653 "Should only be an extending load, not truncating!");
1655 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(ResultTys[0])) &&
1656 "Cannot sign/zero extend a FP/Vector load!");
1657 assert(MVT::isInteger(ResultTys[0]) == MVT::isInteger(EVT) &&
1658 "Cannot convert from FP to Int or Int -> FP!");
1662 // FIXME: figure out how to safely handle things like
1663 // int foo(int x) { return 1 << (x & 255); }
1664 // int bar() { return foo(256); }
1666 case ISD::SRA_PARTS:
1667 case ISD::SRL_PARTS:
1668 case ISD::SHL_PARTS:
1669 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1670 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1671 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1672 else if (N3.getOpcode() == ISD::AND)
1673 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1674 // If the and is only masking out bits that cannot effect the shift,
1675 // eliminate the and.
1676 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1677 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1678 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1684 // Memoize the node unless it returns a flag.
1686 if (ResultTys.back() != MVT::Flag) {
1688 ArbitraryNodes[std::make_pair(Opcode, std::make_pair(ResultTys, Ops))];
1689 if (E) return SDOperand(E, 0);
1690 E = N = new SDNode(Opcode, Ops);
1692 N = new SDNode(Opcode, Ops);
1694 setNodeValueTypes(N, ResultTys);
1695 AllNodes.push_back(N);
1696 return SDOperand(N, 0);
1699 void SelectionDAG::setNodeValueTypes(SDNode *N,
1700 std::vector<MVT::ValueType> &RetVals) {
1701 switch (RetVals.size()) {
1703 case 1: N->setValueTypes(RetVals[0]); return;
1704 case 2: setNodeValueTypes(N, RetVals[0], RetVals[1]); return;
1708 std::list<std::vector<MVT::ValueType> >::iterator I =
1709 std::find(VTList.begin(), VTList.end(), RetVals);
1710 if (I == VTList.end()) {
1711 VTList.push_front(RetVals);
1715 N->setValueTypes(&(*I)[0], I->size());
1718 void SelectionDAG::setNodeValueTypes(SDNode *N, MVT::ValueType VT1,
1719 MVT::ValueType VT2) {
1720 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1721 E = VTList.end(); I != E; ++I) {
1722 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) {
1723 N->setValueTypes(&(*I)[0], 2);
1727 std::vector<MVT::ValueType> V;
1730 VTList.push_front(V);
1731 N->setValueTypes(&(*VTList.begin())[0], 2);
1734 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1735 /// specified operands. If the resultant node already exists in the DAG,
1736 /// this does not modify the specified node, instead it returns the node that
1737 /// already exists. If the resultant node does not exist in the DAG, the
1738 /// input node is returned. As a degenerate case, if you specify the same
1739 /// input operands as the node already has, the input node is returned.
1740 SDOperand SelectionDAG::
1741 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1742 SDNode *N = InN.Val;
1743 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1745 // Check to see if there is no change.
1746 if (Op == N->getOperand(0)) return InN;
1748 // See if the modified node already exists.
1749 SDNode **NewSlot = FindModifiedNodeSlot(N, Op);
1750 if (NewSlot && *NewSlot)
1751 return SDOperand(*NewSlot, InN.ResNo);
1753 // Nope it doesn't. Remove the node from it's current place in the maps.
1755 RemoveNodeFromCSEMaps(N);
1757 // Now we update the operands.
1758 N->OperandList[0].Val->removeUser(N);
1760 N->OperandList[0] = Op;
1762 // If this gets put into a CSE map, add it.
1763 if (NewSlot) *NewSlot = N;
1767 SDOperand SelectionDAG::
1768 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1769 SDNode *N = InN.Val;
1770 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1772 // Check to see if there is no change.
1773 bool AnyChange = false;
1774 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1775 return InN; // No operands changed, just return the input node.
1777 // See if the modified node already exists.
1778 SDNode **NewSlot = FindModifiedNodeSlot(N, Op1, Op2);
1779 if (NewSlot && *NewSlot)
1780 return SDOperand(*NewSlot, InN.ResNo);
1782 // Nope it doesn't. Remove the node from it's current place in the maps.
1784 RemoveNodeFromCSEMaps(N);
1786 // Now we update the operands.
1787 if (N->OperandList[0] != Op1) {
1788 N->OperandList[0].Val->removeUser(N);
1789 Op1.Val->addUser(N);
1790 N->OperandList[0] = Op1;
1792 if (N->OperandList[1] != Op2) {
1793 N->OperandList[1].Val->removeUser(N);
1794 Op2.Val->addUser(N);
1795 N->OperandList[1] = Op2;
1798 // If this gets put into a CSE map, add it.
1799 if (NewSlot) *NewSlot = N;
1803 SDOperand SelectionDAG::
1804 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
1805 std::vector<SDOperand> Ops;
1809 return UpdateNodeOperands(N, Ops);
1812 SDOperand SelectionDAG::
1813 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1814 SDOperand Op3, SDOperand Op4) {
1815 std::vector<SDOperand> Ops;
1820 return UpdateNodeOperands(N, Ops);
1823 SDOperand SelectionDAG::
1824 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1825 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
1826 std::vector<SDOperand> Ops;
1832 return UpdateNodeOperands(N, Ops);
1836 SDOperand SelectionDAG::
1837 UpdateNodeOperands(SDOperand InN, const std::vector<SDOperand> &Ops) {
1838 SDNode *N = InN.Val;
1839 assert(N->getNumOperands() == Ops.size() &&
1840 "Update with wrong number of operands");
1842 // Check to see if there is no change.
1843 unsigned NumOps = Ops.size();
1844 bool AnyChange = false;
1845 for (unsigned i = 0; i != NumOps; ++i) {
1846 if (Ops[i] != N->getOperand(i)) {
1852 // No operands changed, just return the input node.
1853 if (!AnyChange) return InN;
1855 // See if the modified node already exists.
1856 SDNode **NewSlot = FindModifiedNodeSlot(N, Ops);
1857 if (NewSlot && *NewSlot)
1858 return SDOperand(*NewSlot, InN.ResNo);
1860 // Nope it doesn't. Remove the node from it's current place in the maps.
1862 RemoveNodeFromCSEMaps(N);
1864 // Now we update the operands.
1865 for (unsigned i = 0; i != NumOps; ++i) {
1866 if (N->OperandList[i] != Ops[i]) {
1867 N->OperandList[i].Val->removeUser(N);
1868 Ops[i].Val->addUser(N);
1869 N->OperandList[i] = Ops[i];
1873 // If this gets put into a CSE map, add it.
1874 if (NewSlot) *NewSlot = N;
1881 /// SelectNodeTo - These are used for target selectors to *mutate* the
1882 /// specified node to have the specified return type, Target opcode, and
1883 /// operands. Note that target opcodes are stored as
1884 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
1886 /// Note that SelectNodeTo returns the resultant node. If there is already a
1887 /// node of the specified opcode and operands, it returns that node instead of
1888 /// the current one.
1889 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1890 MVT::ValueType VT) {
1891 // If an identical node already exists, use it.
1892 SDNode *&ON = NullaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, VT)];
1893 if (ON) return SDOperand(ON, 0);
1895 RemoveNodeFromCSEMaps(N);
1897 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1898 N->setValueTypes(VT);
1900 ON = N; // Memoize the new node.
1901 return SDOperand(N, 0);
1904 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1905 MVT::ValueType VT, SDOperand Op1) {
1906 // If an identical node already exists, use it.
1907 SDNode *&ON = UnaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1908 std::make_pair(Op1, VT))];
1909 if (ON) return SDOperand(ON, 0);
1911 RemoveNodeFromCSEMaps(N);
1912 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1913 N->setValueTypes(VT);
1914 N->setOperands(Op1);
1916 ON = N; // Memoize the new node.
1917 return SDOperand(N, 0);
1920 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1921 MVT::ValueType VT, SDOperand Op1,
1923 // If an identical node already exists, use it.
1924 SDNode *&ON = BinaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1925 std::make_pair(Op1, Op2))];
1926 if (ON) return SDOperand(ON, 0);
1928 RemoveNodeFromCSEMaps(N);
1929 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1930 N->setValueTypes(VT);
1931 N->setOperands(Op1, Op2);
1933 ON = N; // Memoize the new node.
1934 return SDOperand(N, 0);
1937 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1938 MVT::ValueType VT, SDOperand Op1,
1939 SDOperand Op2, SDOperand Op3) {
1940 // If an identical node already exists, use it.
1941 std::vector<SDOperand> OpList;
1942 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
1943 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1944 std::make_pair(VT, OpList))];
1945 if (ON) return SDOperand(ON, 0);
1947 RemoveNodeFromCSEMaps(N);
1948 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1949 N->setValueTypes(VT);
1950 N->setOperands(Op1, Op2, Op3);
1952 ON = N; // Memoize the new node.
1953 return SDOperand(N, 0);
1956 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1957 MVT::ValueType VT, SDOperand Op1,
1958 SDOperand Op2, SDOperand Op3,
1960 // If an identical node already exists, use it.
1961 std::vector<SDOperand> OpList;
1962 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
1963 OpList.push_back(Op4);
1964 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1965 std::make_pair(VT, OpList))];
1966 if (ON) return SDOperand(ON, 0);
1968 RemoveNodeFromCSEMaps(N);
1969 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1970 N->setValueTypes(VT);
1971 N->setOperands(Op1, Op2, Op3, Op4);
1973 ON = N; // Memoize the new node.
1974 return SDOperand(N, 0);
1977 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1978 MVT::ValueType VT, SDOperand Op1,
1979 SDOperand Op2, SDOperand Op3,SDOperand Op4,
1981 // If an identical node already exists, use it.
1982 std::vector<SDOperand> OpList;
1983 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
1984 OpList.push_back(Op4); OpList.push_back(Op5);
1985 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1986 std::make_pair(VT, OpList))];
1987 if (ON) return SDOperand(ON, 0);
1989 RemoveNodeFromCSEMaps(N);
1990 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1991 N->setValueTypes(VT);
1992 N->setOperands(Op1, Op2, Op3, Op4, Op5);
1994 ON = N; // Memoize the new node.
1995 return SDOperand(N, 0);
1998 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1999 MVT::ValueType VT, SDOperand Op1,
2000 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2001 SDOperand Op5, SDOperand Op6) {
2002 // If an identical node already exists, use it.
2003 std::vector<SDOperand> OpList;
2004 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2005 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2006 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2007 std::make_pair(VT, OpList))];
2008 if (ON) return SDOperand(ON, 0);
2010 RemoveNodeFromCSEMaps(N);
2011 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2012 N->setValueTypes(VT);
2013 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6);
2015 ON = N; // Memoize the new node.
2016 return SDOperand(N, 0);
2019 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2020 MVT::ValueType VT, SDOperand Op1,
2021 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2022 SDOperand Op5, SDOperand Op6,
2024 // If an identical node already exists, use it.
2025 std::vector<SDOperand> OpList;
2026 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2027 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2028 OpList.push_back(Op7);
2029 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2030 std::make_pair(VT, OpList))];
2031 if (ON) return SDOperand(ON, 0);
2033 RemoveNodeFromCSEMaps(N);
2034 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2035 N->setValueTypes(VT);
2036 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7);
2038 ON = N; // Memoize the new node.
2039 return SDOperand(N, 0);
2041 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2042 MVT::ValueType VT, SDOperand Op1,
2043 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2044 SDOperand Op5, SDOperand Op6,
2045 SDOperand Op7, SDOperand Op8) {
2046 // If an identical node already exists, use it.
2047 std::vector<SDOperand> OpList;
2048 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2049 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2050 OpList.push_back(Op7); OpList.push_back(Op8);
2051 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2052 std::make_pair(VT, OpList))];
2053 if (ON) return SDOperand(ON, 0);
2055 RemoveNodeFromCSEMaps(N);
2056 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2057 N->setValueTypes(VT);
2058 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7, Op8);
2060 ON = N; // Memoize the new node.
2061 return SDOperand(N, 0);
2064 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2065 MVT::ValueType VT1, MVT::ValueType VT2,
2066 SDOperand Op1, SDOperand Op2) {
2067 // If an identical node already exists, use it.
2068 std::vector<SDOperand> OpList;
2069 OpList.push_back(Op1); OpList.push_back(Op2);
2070 std::vector<MVT::ValueType> VTList;
2071 VTList.push_back(VT1); VTList.push_back(VT2);
2072 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2073 std::make_pair(VTList, OpList))];
2074 if (ON) return SDOperand(ON, 0);
2076 RemoveNodeFromCSEMaps(N);
2077 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2078 setNodeValueTypes(N, VT1, VT2);
2079 N->setOperands(Op1, Op2);
2081 ON = N; // Memoize the new node.
2082 return SDOperand(N, 0);
2085 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2086 MVT::ValueType VT1, MVT::ValueType VT2,
2087 SDOperand Op1, SDOperand Op2,
2089 // If an identical node already exists, use it.
2090 std::vector<SDOperand> OpList;
2091 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2092 std::vector<MVT::ValueType> VTList;
2093 VTList.push_back(VT1); VTList.push_back(VT2);
2094 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2095 std::make_pair(VTList, OpList))];
2096 if (ON) return SDOperand(ON, 0);
2098 RemoveNodeFromCSEMaps(N);
2099 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2100 setNodeValueTypes(N, VT1, VT2);
2101 N->setOperands(Op1, Op2, Op3);
2103 ON = N; // Memoize the new node.
2104 return SDOperand(N, 0);
2107 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2108 MVT::ValueType VT1, MVT::ValueType VT2,
2109 SDOperand Op1, SDOperand Op2,
2110 SDOperand Op3, SDOperand Op4) {
2111 // If an identical node already exists, use it.
2112 std::vector<SDOperand> OpList;
2113 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2114 OpList.push_back(Op4);
2115 std::vector<MVT::ValueType> VTList;
2116 VTList.push_back(VT1); VTList.push_back(VT2);
2117 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2118 std::make_pair(VTList, OpList))];
2119 if (ON) return SDOperand(ON, 0);
2121 RemoveNodeFromCSEMaps(N);
2122 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2123 setNodeValueTypes(N, VT1, VT2);
2124 N->setOperands(Op1, Op2, Op3, Op4);
2126 ON = N; // Memoize the new node.
2127 return SDOperand(N, 0);
2130 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2131 MVT::ValueType VT1, MVT::ValueType VT2,
2132 SDOperand Op1, SDOperand Op2,
2133 SDOperand Op3, SDOperand Op4,
2135 // If an identical node already exists, use it.
2136 std::vector<SDOperand> OpList;
2137 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2138 OpList.push_back(Op4); OpList.push_back(Op5);
2139 std::vector<MVT::ValueType> VTList;
2140 VTList.push_back(VT1); VTList.push_back(VT2);
2141 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2142 std::make_pair(VTList, OpList))];
2143 if (ON) return SDOperand(ON, 0);
2145 RemoveNodeFromCSEMaps(N);
2146 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2147 setNodeValueTypes(N, VT1, VT2);
2148 N->setOperands(Op1, Op2, Op3, Op4, Op5);
2150 ON = N; // Memoize the new node.
2151 return SDOperand(N, 0);
2154 /// getTargetNode - These are used for target selectors to create a new node
2155 /// with specified return type(s), target opcode, and operands.
2157 /// Note that getTargetNode returns the resultant node. If there is already a
2158 /// node of the specified opcode and operands, it returns that node instead of
2159 /// the current one.
2160 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2161 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2163 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2165 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2167 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2168 SDOperand Op1, SDOperand Op2) {
2169 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2171 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2172 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2173 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2175 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2176 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2178 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4).Val;
2180 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2181 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2182 SDOperand Op4, SDOperand Op5) {
2183 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4, Op5).Val;
2185 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2186 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2187 SDOperand Op4, SDOperand Op5, SDOperand Op6) {
2188 std::vector<SDOperand> Ops;
2196 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2198 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2199 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2200 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2202 std::vector<SDOperand> Ops;
2211 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2213 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2214 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2215 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2216 SDOperand Op7, SDOperand Op8) {
2217 std::vector<SDOperand> Ops;
2227 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2229 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2230 std::vector<SDOperand> &Ops) {
2231 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2233 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2234 MVT::ValueType VT2, SDOperand Op1) {
2235 std::vector<MVT::ValueType> ResultTys;
2236 ResultTys.push_back(VT1);
2237 ResultTys.push_back(VT2);
2238 std::vector<SDOperand> Ops;
2240 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2242 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2243 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2) {
2244 std::vector<MVT::ValueType> ResultTys;
2245 ResultTys.push_back(VT1);
2246 ResultTys.push_back(VT2);
2247 std::vector<SDOperand> Ops;
2250 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2252 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2253 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2255 std::vector<MVT::ValueType> ResultTys;
2256 ResultTys.push_back(VT1);
2257 ResultTys.push_back(VT2);
2258 std::vector<SDOperand> Ops;
2262 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2264 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2265 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2266 SDOperand Op3, SDOperand Op4) {
2267 std::vector<MVT::ValueType> ResultTys;
2268 ResultTys.push_back(VT1);
2269 ResultTys.push_back(VT2);
2270 std::vector<SDOperand> Ops;
2275 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2277 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2278 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2279 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2280 std::vector<MVT::ValueType> ResultTys;
2281 ResultTys.push_back(VT1);
2282 ResultTys.push_back(VT2);
2283 std::vector<SDOperand> Ops;
2289 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2291 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2292 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2293 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2295 std::vector<MVT::ValueType> ResultTys;
2296 ResultTys.push_back(VT1);
2297 ResultTys.push_back(VT2);
2298 std::vector<SDOperand> Ops;
2305 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2307 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2308 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2309 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2310 SDOperand Op6, SDOperand Op7) {
2311 std::vector<MVT::ValueType> ResultTys;
2312 ResultTys.push_back(VT1);
2313 ResultTys.push_back(VT2);
2314 std::vector<SDOperand> Ops;
2322 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2324 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2325 MVT::ValueType VT2, MVT::ValueType VT3,
2326 SDOperand Op1, SDOperand Op2) {
2327 std::vector<MVT::ValueType> ResultTys;
2328 ResultTys.push_back(VT1);
2329 ResultTys.push_back(VT2);
2330 ResultTys.push_back(VT3);
2331 std::vector<SDOperand> Ops;
2334 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2336 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2337 MVT::ValueType VT2, MVT::ValueType VT3,
2338 SDOperand Op1, SDOperand Op2,
2339 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2340 std::vector<MVT::ValueType> ResultTys;
2341 ResultTys.push_back(VT1);
2342 ResultTys.push_back(VT2);
2343 ResultTys.push_back(VT3);
2344 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, MVT::ValueType VT3,
2354 SDOperand Op1, SDOperand Op2,
2355 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2357 std::vector<MVT::ValueType> ResultTys;
2358 ResultTys.push_back(VT1);
2359 ResultTys.push_back(VT2);
2360 ResultTys.push_back(VT3);
2361 std::vector<SDOperand> Ops;
2368 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2370 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2371 MVT::ValueType VT2, MVT::ValueType VT3,
2372 SDOperand Op1, SDOperand Op2,
2373 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2374 SDOperand Op6, SDOperand Op7) {
2375 std::vector<MVT::ValueType> ResultTys;
2376 ResultTys.push_back(VT1);
2377 ResultTys.push_back(VT2);
2378 ResultTys.push_back(VT3);
2379 std::vector<SDOperand> Ops;
2387 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2389 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2390 MVT::ValueType VT2, std::vector<SDOperand> &Ops) {
2391 std::vector<MVT::ValueType> ResultTys;
2392 ResultTys.push_back(VT1);
2393 ResultTys.push_back(VT2);
2394 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2397 // ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2398 /// This can cause recursive merging of nodes in the DAG.
2400 /// This version assumes From/To have a single result value.
2402 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2403 std::vector<SDNode*> *Deleted) {
2404 SDNode *From = FromN.Val, *To = ToN.Val;
2405 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2406 "Cannot replace with this method!");
2407 assert(From != To && "Cannot replace uses of with self");
2409 while (!From->use_empty()) {
2410 // Process users until they are all gone.
2411 SDNode *U = *From->use_begin();
2413 // This node is about to morph, remove its old self from the CSE maps.
2414 RemoveNodeFromCSEMaps(U);
2416 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2418 if (I->Val == From) {
2419 From->removeUser(U);
2424 // Now that we have modified U, add it back to the CSE maps. If it already
2425 // exists there, recursively merge the results together.
2426 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2427 ReplaceAllUsesWith(U, Existing, Deleted);
2429 if (Deleted) Deleted->push_back(U);
2430 DeleteNodeNotInCSEMaps(U);
2435 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2436 /// This can cause recursive merging of nodes in the DAG.
2438 /// This version assumes From/To have matching types and numbers of result
2441 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2442 std::vector<SDNode*> *Deleted) {
2443 assert(From != To && "Cannot replace uses of with self");
2444 assert(From->getNumValues() == To->getNumValues() &&
2445 "Cannot use this version of ReplaceAllUsesWith!");
2446 if (From->getNumValues() == 1) { // If possible, use the faster version.
2447 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
2451 while (!From->use_empty()) {
2452 // Process users until they are all gone.
2453 SDNode *U = *From->use_begin();
2455 // This node is about to morph, remove its old self from the CSE maps.
2456 RemoveNodeFromCSEMaps(U);
2458 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2460 if (I->Val == From) {
2461 From->removeUser(U);
2466 // Now that we have modified U, add it back to the CSE maps. If it already
2467 // exists there, recursively merge the results together.
2468 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2469 ReplaceAllUsesWith(U, Existing, Deleted);
2471 if (Deleted) Deleted->push_back(U);
2472 DeleteNodeNotInCSEMaps(U);
2477 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2478 /// This can cause recursive merging of nodes in the DAG.
2480 /// This version can replace From with any result values. To must match the
2481 /// number and types of values returned by From.
2482 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2483 const std::vector<SDOperand> &To,
2484 std::vector<SDNode*> *Deleted) {
2485 assert(From->getNumValues() == To.size() &&
2486 "Incorrect number of values to replace with!");
2487 if (To.size() == 1 && To[0].Val->getNumValues() == 1) {
2488 // Degenerate case handled above.
2489 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2493 while (!From->use_empty()) {
2494 // Process users until they are all gone.
2495 SDNode *U = *From->use_begin();
2497 // This node is about to morph, remove its old self from the CSE maps.
2498 RemoveNodeFromCSEMaps(U);
2500 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2502 if (I->Val == From) {
2503 const SDOperand &ToOp = To[I->ResNo];
2504 From->removeUser(U);
2506 ToOp.Val->addUser(U);
2509 // Now that we have modified U, add it back to the CSE maps. If it already
2510 // exists there, recursively merge the results together.
2511 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2512 ReplaceAllUsesWith(U, Existing, Deleted);
2514 if (Deleted) Deleted->push_back(U);
2515 DeleteNodeNotInCSEMaps(U);
2520 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2521 /// uses of other values produced by From.Val alone. The Deleted vector is
2522 /// handled the same was as for ReplaceAllUsesWith.
2523 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2524 std::vector<SDNode*> &Deleted) {
2525 assert(From != To && "Cannot replace a value with itself");
2526 // Handle the simple, trivial, case efficiently.
2527 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2528 ReplaceAllUsesWith(From, To, &Deleted);
2532 // Get all of the users in a nice, deterministically ordered, uniqued set.
2533 SetVector<SDNode*> Users(From.Val->use_begin(), From.Val->use_end());
2535 while (!Users.empty()) {
2536 // We know that this user uses some value of From. If it is the right
2537 // value, update it.
2538 SDNode *User = Users.back();
2541 for (SDOperand *Op = User->OperandList,
2542 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2544 // Okay, we know this user needs to be updated. Remove its old self
2545 // from the CSE maps.
2546 RemoveNodeFromCSEMaps(User);
2548 // Update all operands that match "From".
2549 for (; Op != E; ++Op) {
2551 From.Val->removeUser(User);
2553 To.Val->addUser(User);
2557 // Now that we have modified User, add it back to the CSE maps. If it
2558 // already exists there, recursively merge the results together.
2559 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2560 unsigned NumDeleted = Deleted.size();
2561 ReplaceAllUsesWith(User, Existing, &Deleted);
2563 // User is now dead.
2564 Deleted.push_back(User);
2565 DeleteNodeNotInCSEMaps(User);
2567 // We have to be careful here, because ReplaceAllUsesWith could have
2568 // deleted a user of From, which means there may be dangling pointers
2569 // in the "Users" setvector. Scan over the deleted node pointers and
2570 // remove them from the setvector.
2571 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2572 Users.remove(Deleted[i]);
2574 break; // Exit the operand scanning loop.
2581 //===----------------------------------------------------------------------===//
2583 //===----------------------------------------------------------------------===//
2586 /// getValueTypeList - Return a pointer to the specified value type.
2588 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2589 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2594 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2595 /// indicated value. This method ignores uses of other values defined by this
2597 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2598 assert(Value < getNumValues() && "Bad value!");
2600 // If there is only one value, this is easy.
2601 if (getNumValues() == 1)
2602 return use_size() == NUses;
2603 if (Uses.size() < NUses) return false;
2605 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2607 std::set<SDNode*> UsersHandled;
2609 for (std::vector<SDNode*>::const_iterator UI = Uses.begin(), E = Uses.end();
2612 if (User->getNumOperands() == 1 ||
2613 UsersHandled.insert(User).second) // First time we've seen this?
2614 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2615 if (User->getOperand(i) == TheValue) {
2617 return false; // too many uses
2622 // Found exactly the right number of uses?
2627 // isOnlyUse - Return true if this node is the only use of N.
2628 bool SDNode::isOnlyUse(SDNode *N) const {
2630 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2641 // isOperand - Return true if this node is an operand of N.
2642 bool SDOperand::isOperand(SDNode *N) const {
2643 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2644 if (*this == N->getOperand(i))
2649 bool SDNode::isOperand(SDNode *N) const {
2650 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2651 if (this == N->OperandList[i].Val)
2656 const char *SDNode::getOperationName(const SelectionDAG *G) const {
2657 switch (getOpcode()) {
2659 if (getOpcode() < ISD::BUILTIN_OP_END)
2660 return "<<Unknown DAG Node>>";
2663 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2664 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2665 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2667 TargetLowering &TLI = G->getTargetLoweringInfo();
2669 TLI.getTargetNodeName(getOpcode());
2670 if (Name) return Name;
2673 return "<<Unknown Target Node>>";
2676 case ISD::PCMARKER: return "PCMarker";
2677 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2678 case ISD::SRCVALUE: return "SrcValue";
2679 case ISD::EntryToken: return "EntryToken";
2680 case ISD::TokenFactor: return "TokenFactor";
2681 case ISD::AssertSext: return "AssertSext";
2682 case ISD::AssertZext: return "AssertZext";
2684 case ISD::STRING: return "String";
2685 case ISD::BasicBlock: return "BasicBlock";
2686 case ISD::VALUETYPE: return "ValueType";
2687 case ISD::Register: return "Register";
2689 case ISD::Constant: return "Constant";
2690 case ISD::ConstantFP: return "ConstantFP";
2691 case ISD::GlobalAddress: return "GlobalAddress";
2692 case ISD::FrameIndex: return "FrameIndex";
2693 case ISD::ConstantPool: return "ConstantPool";
2694 case ISD::ExternalSymbol: return "ExternalSymbol";
2695 case ISD::INTRINSIC_WO_CHAIN: {
2696 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2697 return Intrinsic::getName((Intrinsic::ID)IID);
2699 case ISD::INTRINSIC_VOID:
2700 case ISD::INTRINSIC_W_CHAIN: {
2701 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2702 return Intrinsic::getName((Intrinsic::ID)IID);
2705 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2706 case ISD::TargetConstant: return "TargetConstant";
2707 case ISD::TargetConstantFP:return "TargetConstantFP";
2708 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2709 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2710 case ISD::TargetConstantPool: return "TargetConstantPool";
2711 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2713 case ISD::CopyToReg: return "CopyToReg";
2714 case ISD::CopyFromReg: return "CopyFromReg";
2715 case ISD::UNDEF: return "undef";
2716 case ISD::MERGE_VALUES: return "mergevalues";
2717 case ISD::INLINEASM: return "inlineasm";
2718 case ISD::HANDLENODE: return "handlenode";
2721 case ISD::FABS: return "fabs";
2722 case ISD::FNEG: return "fneg";
2723 case ISD::FSQRT: return "fsqrt";
2724 case ISD::FSIN: return "fsin";
2725 case ISD::FCOS: return "fcos";
2728 case ISD::ADD: return "add";
2729 case ISD::SUB: return "sub";
2730 case ISD::MUL: return "mul";
2731 case ISD::MULHU: return "mulhu";
2732 case ISD::MULHS: return "mulhs";
2733 case ISD::SDIV: return "sdiv";
2734 case ISD::UDIV: return "udiv";
2735 case ISD::SREM: return "srem";
2736 case ISD::UREM: return "urem";
2737 case ISD::AND: return "and";
2738 case ISD::OR: return "or";
2739 case ISD::XOR: return "xor";
2740 case ISD::SHL: return "shl";
2741 case ISD::SRA: return "sra";
2742 case ISD::SRL: return "srl";
2743 case ISD::ROTL: return "rotl";
2744 case ISD::ROTR: return "rotr";
2745 case ISD::FADD: return "fadd";
2746 case ISD::FSUB: return "fsub";
2747 case ISD::FMUL: return "fmul";
2748 case ISD::FDIV: return "fdiv";
2749 case ISD::FREM: return "frem";
2750 case ISD::FCOPYSIGN: return "fcopysign";
2751 case ISD::VADD: return "vadd";
2752 case ISD::VSUB: return "vsub";
2753 case ISD::VMUL: return "vmul";
2754 case ISD::VSDIV: return "vsdiv";
2755 case ISD::VUDIV: return "vudiv";
2756 case ISD::VAND: return "vand";
2757 case ISD::VOR: return "vor";
2758 case ISD::VXOR: return "vxor";
2760 case ISD::SETCC: return "setcc";
2761 case ISD::SELECT: return "select";
2762 case ISD::SELECT_CC: return "select_cc";
2763 case ISD::VSELECT: return "vselect";
2764 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2765 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2766 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2767 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2768 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2769 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2770 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2771 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2772 case ISD::VBIT_CONVERT: return "vbit_convert";
2773 case ISD::ADDC: return "addc";
2774 case ISD::ADDE: return "adde";
2775 case ISD::SUBC: return "subc";
2776 case ISD::SUBE: return "sube";
2777 case ISD::SHL_PARTS: return "shl_parts";
2778 case ISD::SRA_PARTS: return "sra_parts";
2779 case ISD::SRL_PARTS: return "srl_parts";
2781 // Conversion operators.
2782 case ISD::SIGN_EXTEND: return "sign_extend";
2783 case ISD::ZERO_EXTEND: return "zero_extend";
2784 case ISD::ANY_EXTEND: return "any_extend";
2785 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2786 case ISD::TRUNCATE: return "truncate";
2787 case ISD::FP_ROUND: return "fp_round";
2788 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2789 case ISD::FP_EXTEND: return "fp_extend";
2791 case ISD::SINT_TO_FP: return "sint_to_fp";
2792 case ISD::UINT_TO_FP: return "uint_to_fp";
2793 case ISD::FP_TO_SINT: return "fp_to_sint";
2794 case ISD::FP_TO_UINT: return "fp_to_uint";
2795 case ISD::BIT_CONVERT: return "bit_convert";
2797 // Control flow instructions
2798 case ISD::BR: return "br";
2799 case ISD::BRCOND: return "brcond";
2800 case ISD::BR_CC: return "br_cc";
2801 case ISD::RET: return "ret";
2802 case ISD::CALLSEQ_START: return "callseq_start";
2803 case ISD::CALLSEQ_END: return "callseq_end";
2806 case ISD::LOAD: return "load";
2807 case ISD::STORE: return "store";
2808 case ISD::VLOAD: return "vload";
2809 case ISD::EXTLOAD: return "extload";
2810 case ISD::SEXTLOAD: return "sextload";
2811 case ISD::ZEXTLOAD: return "zextload";
2812 case ISD::TRUNCSTORE: return "truncstore";
2813 case ISD::VAARG: return "vaarg";
2814 case ISD::VACOPY: return "vacopy";
2815 case ISD::VAEND: return "vaend";
2816 case ISD::VASTART: return "vastart";
2817 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2818 case ISD::EXTRACT_ELEMENT: return "extract_element";
2819 case ISD::BUILD_PAIR: return "build_pair";
2820 case ISD::STACKSAVE: return "stacksave";
2821 case ISD::STACKRESTORE: return "stackrestore";
2823 // Block memory operations.
2824 case ISD::MEMSET: return "memset";
2825 case ISD::MEMCPY: return "memcpy";
2826 case ISD::MEMMOVE: return "memmove";
2829 case ISD::BSWAP: return "bswap";
2830 case ISD::CTPOP: return "ctpop";
2831 case ISD::CTTZ: return "cttz";
2832 case ISD::CTLZ: return "ctlz";
2835 case ISD::LOCATION: return "location";
2836 case ISD::DEBUG_LOC: return "debug_loc";
2837 case ISD::DEBUG_LABEL: return "debug_label";
2840 switch (cast<CondCodeSDNode>(this)->get()) {
2841 default: assert(0 && "Unknown setcc condition!");
2842 case ISD::SETOEQ: return "setoeq";
2843 case ISD::SETOGT: return "setogt";
2844 case ISD::SETOGE: return "setoge";
2845 case ISD::SETOLT: return "setolt";
2846 case ISD::SETOLE: return "setole";
2847 case ISD::SETONE: return "setone";
2849 case ISD::SETO: return "seto";
2850 case ISD::SETUO: return "setuo";
2851 case ISD::SETUEQ: return "setue";
2852 case ISD::SETUGT: return "setugt";
2853 case ISD::SETUGE: return "setuge";
2854 case ISD::SETULT: return "setult";
2855 case ISD::SETULE: return "setule";
2856 case ISD::SETUNE: return "setune";
2858 case ISD::SETEQ: return "seteq";
2859 case ISD::SETGT: return "setgt";
2860 case ISD::SETGE: return "setge";
2861 case ISD::SETLT: return "setlt";
2862 case ISD::SETLE: return "setle";
2863 case ISD::SETNE: return "setne";
2868 void SDNode::dump() const { dump(0); }
2869 void SDNode::dump(const SelectionDAG *G) const {
2870 std::cerr << (void*)this << ": ";
2872 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
2873 if (i) std::cerr << ",";
2874 if (getValueType(i) == MVT::Other)
2877 std::cerr << MVT::getValueTypeString(getValueType(i));
2879 std::cerr << " = " << getOperationName(G);
2882 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2883 if (i) std::cerr << ", ";
2884 std::cerr << (void*)getOperand(i).Val;
2885 if (unsigned RN = getOperand(i).ResNo)
2886 std::cerr << ":" << RN;
2889 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
2890 std::cerr << "<" << CSDN->getValue() << ">";
2891 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
2892 std::cerr << "<" << CSDN->getValue() << ">";
2893 } else if (const GlobalAddressSDNode *GADN =
2894 dyn_cast<GlobalAddressSDNode>(this)) {
2895 int offset = GADN->getOffset();
2897 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
2899 std::cerr << " + " << offset;
2901 std::cerr << " " << offset;
2902 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
2903 std::cerr << "<" << FIDN->getIndex() << ">";
2904 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
2905 int offset = CP->getOffset();
2906 std::cerr << "<" << *CP->get() << ">";
2908 std::cerr << " + " << offset;
2910 std::cerr << " " << offset;
2911 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
2913 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
2915 std::cerr << LBB->getName() << " ";
2916 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
2917 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
2918 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
2919 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
2921 std::cerr << " #" << R->getReg();
2923 } else if (const ExternalSymbolSDNode *ES =
2924 dyn_cast<ExternalSymbolSDNode>(this)) {
2925 std::cerr << "'" << ES->getSymbol() << "'";
2926 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
2928 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
2930 std::cerr << "<null:" << M->getOffset() << ">";
2931 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
2932 std::cerr << ":" << getValueTypeString(N->getVT());
2936 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
2937 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2938 if (N->getOperand(i).Val->hasOneUse())
2939 DumpNodes(N->getOperand(i).Val, indent+2, G);
2941 std::cerr << "\n" << std::string(indent+2, ' ')
2942 << (void*)N->getOperand(i).Val << ": <multiple use>";
2945 std::cerr << "\n" << std::string(indent, ' ');
2949 void SelectionDAG::dump() const {
2950 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
2951 std::vector<const SDNode*> Nodes;
2952 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
2956 std::sort(Nodes.begin(), Nodes.end());
2958 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2959 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
2960 DumpNodes(Nodes[i], 2, this);
2963 DumpNodes(getRoot().Val, 2, this);
2965 std::cerr << "\n\n";
2968 /// InsertISelMapEntry - A helper function to insert a key / element pair
2969 /// into a SDOperand to SDOperand map. This is added to avoid the map
2970 /// insertion operator from being inlined.
2971 void SelectionDAG::InsertISelMapEntry(std::map<SDOperand, SDOperand> &Map,
2972 SDNode *Key, unsigned KeyResNo,
2973 SDNode *Element, unsigned ElementResNo) {
2974 Map.insert(std::make_pair(SDOperand(Key, KeyResNo),
2975 SDOperand(Element, ElementResNo)));