1 //===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the SelectionDAG class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/CodeGen/SelectionDAG.h"
15 #include "llvm/Constants.h"
16 #include "llvm/GlobalValue.h"
17 #include "llvm/Intrinsics.h"
18 #include "llvm/Assembly/Writer.h"
19 #include "llvm/CodeGen/MachineBasicBlock.h"
20 #include "llvm/Support/MathExtras.h"
21 #include "llvm/Target/MRegisterInfo.h"
22 #include "llvm/Target/TargetLowering.h"
23 #include "llvm/Target/TargetInstrInfo.h"
24 #include "llvm/Target/TargetMachine.h"
25 #include "llvm/ADT/SetVector.h"
26 #include "llvm/ADT/StringExtras.h"
33 static bool isCommutativeBinOp(unsigned Opcode) {
43 case ISD::XOR: return true;
44 default: return false; // FIXME: Need commutative info for user ops!
48 // isInvertibleForFree - Return true if there is no cost to emitting the logical
49 // inverse of this node.
50 static bool isInvertibleForFree(SDOperand N) {
51 if (isa<ConstantSDNode>(N.Val)) return true;
52 if (N.Val->getOpcode() == ISD::SETCC && N.Val->hasOneUse())
57 //===----------------------------------------------------------------------===//
58 // ConstantFPSDNode Class
59 //===----------------------------------------------------------------------===//
61 /// isExactlyValue - We don't rely on operator== working on double values, as
62 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
63 /// As such, this method can be used to do an exact bit-for-bit comparison of
64 /// two floating point values.
65 bool ConstantFPSDNode::isExactlyValue(double V) const {
66 return DoubleToBits(V) == DoubleToBits(Value);
69 //===----------------------------------------------------------------------===//
71 //===----------------------------------------------------------------------===//
73 /// isBuildVectorAllOnes - Return true if the specified node is a
74 /// BUILD_VECTOR where all of the elements are ~0 or undef.
75 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
76 // Look through a bit convert.
77 if (N->getOpcode() == ISD::BIT_CONVERT)
78 N = N->getOperand(0).Val;
80 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
82 unsigned i = 0, e = N->getNumOperands();
84 // Skip over all of the undef values.
85 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
88 // Do not accept an all-undef vector.
89 if (i == e) return false;
91 // Do not accept build_vectors that aren't all constants or which have non-~0
93 SDOperand NotZero = N->getOperand(i);
94 if (isa<ConstantSDNode>(NotZero)) {
95 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
97 } else if (isa<ConstantFPSDNode>(NotZero)) {
98 MVT::ValueType VT = NotZero.getValueType();
100 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
104 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
111 // Okay, we have at least one ~0 value, check to see if the rest match or are
113 for (++i; i != e; ++i)
114 if (N->getOperand(i) != NotZero &&
115 N->getOperand(i).getOpcode() != ISD::UNDEF)
121 /// isBuildVectorAllZeros - Return true if the specified node is a
122 /// BUILD_VECTOR where all of the elements are 0 or undef.
123 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
124 // Look through a bit convert.
125 if (N->getOpcode() == ISD::BIT_CONVERT)
126 N = N->getOperand(0).Val;
128 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
130 unsigned i = 0, e = N->getNumOperands();
132 // Skip over all of the undef values.
133 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
136 // Do not accept an all-undef vector.
137 if (i == e) return false;
139 // Do not accept build_vectors that aren't all constants or which have non-~0
141 SDOperand Zero = N->getOperand(i);
142 if (isa<ConstantSDNode>(Zero)) {
143 if (!cast<ConstantSDNode>(Zero)->isNullValue())
145 } else if (isa<ConstantFPSDNode>(Zero)) {
146 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0))
151 // Okay, we have at least one ~0 value, check to see if the rest match or are
153 for (++i; i != e; ++i)
154 if (N->getOperand(i) != Zero &&
155 N->getOperand(i).getOpcode() != ISD::UNDEF)
160 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
161 /// when given the operation for (X op Y).
162 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
163 // To perform this operation, we just need to swap the L and G bits of the
165 unsigned OldL = (Operation >> 2) & 1;
166 unsigned OldG = (Operation >> 1) & 1;
167 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
168 (OldL << 1) | // New G bit
169 (OldG << 2)); // New L bit.
172 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
173 /// 'op' is a valid SetCC operation.
174 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
175 unsigned Operation = Op;
177 Operation ^= 7; // Flip L, G, E bits, but not U.
179 Operation ^= 15; // Flip all of the condition bits.
180 if (Operation > ISD::SETTRUE2)
181 Operation &= ~8; // Don't let N and U bits get set.
182 return ISD::CondCode(Operation);
186 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
187 /// signed operation and 2 if the result is an unsigned comparison. Return zero
188 /// if the operation does not depend on the sign of the input (setne and seteq).
189 static int isSignedOp(ISD::CondCode Opcode) {
191 default: assert(0 && "Illegal integer setcc operation!");
193 case ISD::SETNE: return 0;
197 case ISD::SETGE: return 1;
201 case ISD::SETUGE: return 2;
205 /// getSetCCOrOperation - Return the result of a logical OR between different
206 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
207 /// returns SETCC_INVALID if it is not possible to represent the resultant
209 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
211 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
212 // Cannot fold a signed integer setcc with an unsigned integer setcc.
213 return ISD::SETCC_INVALID;
215 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
217 // If the N and U bits get set then the resultant comparison DOES suddenly
218 // care about orderedness, and is true when ordered.
219 if (Op > ISD::SETTRUE2)
220 Op &= ~16; // Clear the N bit.
221 return ISD::CondCode(Op);
224 /// getSetCCAndOperation - Return the result of a logical AND between different
225 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
226 /// function returns zero if it is not possible to represent the resultant
228 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
230 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
231 // Cannot fold a signed setcc with an unsigned setcc.
232 return ISD::SETCC_INVALID;
234 // Combine all of the condition bits.
235 return ISD::CondCode(Op1 & Op2);
238 const TargetMachine &SelectionDAG::getTarget() const {
239 return TLI.getTargetMachine();
242 //===----------------------------------------------------------------------===//
243 // SelectionDAG Class
244 //===----------------------------------------------------------------------===//
246 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
247 /// SelectionDAG, including nodes (like loads) that have uses of their token
248 /// chain but no other uses and no side effect. If a node is passed in as an
249 /// argument, it is used as the seed for node deletion.
250 void SelectionDAG::RemoveDeadNodes(SDNode *N) {
251 // Create a dummy node (which is not added to allnodes), that adds a reference
252 // to the root node, preventing it from being deleted.
253 HandleSDNode Dummy(getRoot());
255 bool MadeChange = false;
257 // If we have a hint to start from, use it.
258 if (N && N->use_empty()) {
263 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
264 if (I->use_empty() && I->getOpcode() != 65535) {
265 // Node is dead, recursively delete newly dead uses.
270 // Walk the nodes list, removing the nodes we've marked as dead.
272 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ) {
279 // If the root changed (e.g. it was a dead load, update the root).
280 setRoot(Dummy.getValue());
283 /// DestroyDeadNode - We know that N is dead. Nuke it from the CSE maps for the
284 /// graph. If it is the last user of any of its operands, recursively process
285 /// them the same way.
287 void SelectionDAG::DestroyDeadNode(SDNode *N) {
288 // Okay, we really are going to delete this node. First take this out of the
289 // appropriate CSE map.
290 RemoveNodeFromCSEMaps(N);
292 // Next, brutally remove the operand list. This is safe to do, as there are
293 // no cycles in the graph.
294 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
298 // Now that we removed this operand, see if there are no uses of it left.
302 delete[] N->OperandList;
306 // Mark the node as dead.
307 N->MorphNodeTo(65535);
310 void SelectionDAG::DeleteNode(SDNode *N) {
311 assert(N->use_empty() && "Cannot delete a node that is not dead!");
313 // First take this out of the appropriate CSE map.
314 RemoveNodeFromCSEMaps(N);
316 // Finally, remove uses due to operands of this node, remove from the
317 // AllNodes list, and delete the node.
318 DeleteNodeNotInCSEMaps(N);
321 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
323 // Remove it from the AllNodes list.
326 // Drop all of the operands and decrement used nodes use counts.
327 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
328 I->Val->removeUser(N);
329 delete[] N->OperandList;
336 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
337 /// correspond to it. This is useful when we're about to delete or repurpose
338 /// the node. We don't want future request for structurally identical nodes
339 /// to return N anymore.
340 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
342 switch (N->getOpcode()) {
343 case ISD::HANDLENODE: return; // noop.
345 Erased = Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(),
346 N->getValueType(0)));
348 case ISD::TargetConstant:
349 Erased = TargetConstants.erase(std::make_pair(
350 cast<ConstantSDNode>(N)->getValue(),
351 N->getValueType(0)));
353 case ISD::ConstantFP: {
354 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
355 Erased = ConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
358 case ISD::TargetConstantFP: {
359 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
360 Erased = TargetConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
364 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
367 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
368 "Cond code doesn't exist!");
369 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
370 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
372 case ISD::GlobalAddress: {
373 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
374 Erased = GlobalValues.erase(std::make_pair(GN->getGlobal(),
378 case ISD::TargetGlobalAddress: {
379 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
380 Erased =TargetGlobalValues.erase(std::make_pair(GN->getGlobal(),
384 case ISD::FrameIndex:
385 Erased = FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
387 case ISD::TargetFrameIndex:
388 Erased = TargetFrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
390 case ISD::ConstantPool:
391 Erased = ConstantPoolIndices.
392 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
393 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
394 cast<ConstantPoolSDNode>(N)->getAlignment())));
396 case ISD::TargetConstantPool:
397 Erased = TargetConstantPoolIndices.
398 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
399 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
400 cast<ConstantPoolSDNode>(N)->getAlignment())));
402 case ISD::BasicBlock:
403 Erased = BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock());
405 case ISD::ExternalSymbol:
406 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
408 case ISD::TargetExternalSymbol:
410 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
413 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
414 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
417 Erased = RegNodes.erase(std::make_pair(cast<RegisterSDNode>(N)->getReg(),
418 N->getValueType(0)));
420 case ISD::SRCVALUE: {
421 SrcValueSDNode *SVN = cast<SrcValueSDNode>(N);
422 Erased =ValueNodes.erase(std::make_pair(SVN->getValue(), SVN->getOffset()));
426 Erased = Loads.erase(std::make_pair(N->getOperand(1),
427 std::make_pair(N->getOperand(0),
428 N->getValueType(0))));
431 if (N->getNumValues() == 1) {
432 if (N->getNumOperands() == 0) {
433 Erased = NullaryOps.erase(std::make_pair(N->getOpcode(),
434 N->getValueType(0)));
435 } else if (N->getNumOperands() == 1) {
437 UnaryOps.erase(std::make_pair(N->getOpcode(),
438 std::make_pair(N->getOperand(0),
439 N->getValueType(0))));
440 } else if (N->getNumOperands() == 2) {
442 BinaryOps.erase(std::make_pair(N->getOpcode(),
443 std::make_pair(N->getOperand(0),
446 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
448 OneResultNodes.erase(std::make_pair(N->getOpcode(),
449 std::make_pair(N->getValueType(0),
453 // Remove the node from the ArbitraryNodes map.
454 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
455 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
457 ArbitraryNodes.erase(std::make_pair(N->getOpcode(),
458 std::make_pair(RV, Ops)));
463 // Verify that the node was actually in one of the CSE maps, unless it has a
464 // flag result (which cannot be CSE'd) or is one of the special cases that are
465 // not subject to CSE.
466 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
467 !N->isTargetOpcode()) {
469 assert(0 && "Node is not in map!");
474 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
475 /// has been taken out and modified in some way. If the specified node already
476 /// exists in the CSE maps, do not modify the maps, but return the existing node
477 /// instead. If it doesn't exist, add it and return null.
479 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
480 assert(N->getNumOperands() && "This is a leaf node!");
481 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
482 return 0; // Never add these nodes.
484 // Check that remaining values produced are not flags.
485 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
486 if (N->getValueType(i) == MVT::Flag)
487 return 0; // Never CSE anything that produces a flag.
489 if (N->getNumValues() == 1) {
490 if (N->getNumOperands() == 1) {
491 SDNode *&U = UnaryOps[std::make_pair(N->getOpcode(),
492 std::make_pair(N->getOperand(0),
493 N->getValueType(0)))];
496 } else if (N->getNumOperands() == 2) {
497 SDNode *&B = BinaryOps[std::make_pair(N->getOpcode(),
498 std::make_pair(N->getOperand(0),
503 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
504 SDNode *&ORN = OneResultNodes[std::make_pair(N->getOpcode(),
505 std::make_pair(N->getValueType(0), Ops))];
510 if (N->getOpcode() == ISD::LOAD) {
511 SDNode *&L = Loads[std::make_pair(N->getOperand(1),
512 std::make_pair(N->getOperand(0),
513 N->getValueType(0)))];
517 // Remove the node from the ArbitraryNodes map.
518 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
519 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
520 SDNode *&AN = ArbitraryNodes[std::make_pair(N->getOpcode(),
521 std::make_pair(RV, Ops))];
529 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
530 /// were replaced with those specified. If this node is never memoized,
531 /// return null, otherwise return a pointer to the slot it would take. If a
532 /// node already exists with these operands, the slot will be non-null.
533 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op) {
534 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
535 return 0; // Never add these nodes.
537 // Check that remaining values produced are not flags.
538 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
539 if (N->getValueType(i) == MVT::Flag)
540 return 0; // Never CSE anything that produces a flag.
542 if (N->getNumValues() == 1) {
543 return &UnaryOps[std::make_pair(N->getOpcode(),
544 std::make_pair(Op, N->getValueType(0)))];
546 // Remove the node from the ArbitraryNodes map.
547 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
548 std::vector<SDOperand> Ops;
550 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
551 std::make_pair(RV, Ops))];
556 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
557 /// were replaced with those specified. If this node is never memoized,
558 /// return null, otherwise return a pointer to the slot it would take. If a
559 /// node already exists with these operands, the slot will be non-null.
560 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
561 SDOperand Op1, SDOperand Op2) {
562 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
563 return 0; // Never add these nodes.
565 // Check that remaining values produced are not flags.
566 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
567 if (N->getValueType(i) == MVT::Flag)
568 return 0; // Never CSE anything that produces a flag.
570 if (N->getNumValues() == 1) {
571 return &BinaryOps[std::make_pair(N->getOpcode(),
572 std::make_pair(Op1, Op2))];
574 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
575 std::vector<SDOperand> Ops;
578 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
579 std::make_pair(RV, Ops))];
585 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
586 /// were replaced with those specified. If this node is never memoized,
587 /// return null, otherwise return a pointer to the slot it would take. If a
588 /// node already exists with these operands, the slot will be non-null.
589 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
590 const std::vector<SDOperand> &Ops) {
591 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
592 return 0; // Never add these nodes.
594 // Check that remaining values produced are not flags.
595 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
596 if (N->getValueType(i) == MVT::Flag)
597 return 0; // Never CSE anything that produces a flag.
599 if (N->getNumValues() == 1) {
600 if (N->getNumOperands() == 1) {
601 return &UnaryOps[std::make_pair(N->getOpcode(),
602 std::make_pair(Ops[0],
603 N->getValueType(0)))];
604 } else if (N->getNumOperands() == 2) {
605 return &BinaryOps[std::make_pair(N->getOpcode(),
606 std::make_pair(Ops[0], Ops[1]))];
608 return &OneResultNodes[std::make_pair(N->getOpcode(),
609 std::make_pair(N->getValueType(0),
613 if (N->getOpcode() == ISD::LOAD) {
614 return &Loads[std::make_pair(Ops[1],
615 std::make_pair(Ops[0], N->getValueType(0)))];
617 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
618 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
619 std::make_pair(RV, Ops))];
626 SelectionDAG::~SelectionDAG() {
627 while (!AllNodes.empty()) {
628 SDNode *N = AllNodes.begin();
629 delete [] N->OperandList;
632 AllNodes.pop_front();
636 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
637 if (Op.getValueType() == VT) return Op;
638 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
639 return getNode(ISD::AND, Op.getValueType(), Op,
640 getConstant(Imm, Op.getValueType()));
643 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) {
644 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
645 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
647 // Mask out any bits that are not valid for this constant.
649 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
651 SDNode *&N = Constants[std::make_pair(Val, VT)];
652 if (N) return SDOperand(N, 0);
653 N = new ConstantSDNode(false, Val, VT);
654 AllNodes.push_back(N);
655 return SDOperand(N, 0);
658 SDOperand SelectionDAG::getString(const std::string &Val) {
659 StringSDNode *&N = StringNodes[Val];
661 N = new StringSDNode(Val);
662 AllNodes.push_back(N);
664 return SDOperand(N, 0);
667 SDOperand SelectionDAG::getTargetConstant(uint64_t Val, MVT::ValueType VT) {
668 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
669 // Mask out any bits that are not valid for this constant.
671 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
673 SDNode *&N = TargetConstants[std::make_pair(Val, VT)];
674 if (N) return SDOperand(N, 0);
675 N = new ConstantSDNode(true, Val, VT);
676 AllNodes.push_back(N);
677 return SDOperand(N, 0);
680 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) {
681 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
683 Val = (float)Val; // Mask out extra precision.
685 // Do the map lookup using the actual bit pattern for the floating point
686 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
687 // we don't have issues with SNANs.
688 SDNode *&N = ConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
689 if (N) return SDOperand(N, 0);
690 N = new ConstantFPSDNode(false, Val, VT);
691 AllNodes.push_back(N);
692 return SDOperand(N, 0);
695 SDOperand SelectionDAG::getTargetConstantFP(double Val, MVT::ValueType VT) {
696 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
698 Val = (float)Val; // Mask out extra precision.
700 // Do the map lookup using the actual bit pattern for the floating point
701 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
702 // we don't have issues with SNANs.
703 SDNode *&N = TargetConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
704 if (N) return SDOperand(N, 0);
705 N = new ConstantFPSDNode(true, Val, VT);
706 AllNodes.push_back(N);
707 return SDOperand(N, 0);
710 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
711 MVT::ValueType VT, int offset) {
712 SDNode *&N = GlobalValues[std::make_pair(GV, offset)];
713 if (N) return SDOperand(N, 0);
714 N = new GlobalAddressSDNode(false, GV, VT, offset);
715 AllNodes.push_back(N);
716 return SDOperand(N, 0);
719 SDOperand SelectionDAG::getTargetGlobalAddress(const GlobalValue *GV,
720 MVT::ValueType VT, int offset) {
721 SDNode *&N = TargetGlobalValues[std::make_pair(GV, offset)];
722 if (N) return SDOperand(N, 0);
723 N = new GlobalAddressSDNode(true, GV, VT, offset);
724 AllNodes.push_back(N);
725 return SDOperand(N, 0);
728 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) {
729 SDNode *&N = FrameIndices[FI];
730 if (N) return SDOperand(N, 0);
731 N = new FrameIndexSDNode(FI, VT, false);
732 AllNodes.push_back(N);
733 return SDOperand(N, 0);
736 SDOperand SelectionDAG::getTargetFrameIndex(int FI, MVT::ValueType VT) {
737 SDNode *&N = TargetFrameIndices[FI];
738 if (N) return SDOperand(N, 0);
739 N = new FrameIndexSDNode(FI, VT, true);
740 AllNodes.push_back(N);
741 return SDOperand(N, 0);
744 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
745 unsigned Alignment, int Offset) {
746 SDNode *&N = ConstantPoolIndices[std::make_pair(C,
747 std::make_pair(Offset, Alignment))];
748 if (N) return SDOperand(N, 0);
749 N = new ConstantPoolSDNode(false, C, VT, Offset, Alignment);
750 AllNodes.push_back(N);
751 return SDOperand(N, 0);
754 SDOperand SelectionDAG::getTargetConstantPool(Constant *C, MVT::ValueType VT,
755 unsigned Alignment, int Offset) {
756 SDNode *&N = TargetConstantPoolIndices[std::make_pair(C,
757 std::make_pair(Offset, Alignment))];
758 if (N) return SDOperand(N, 0);
759 N = new ConstantPoolSDNode(true, C, VT, Offset, Alignment);
760 AllNodes.push_back(N);
761 return SDOperand(N, 0);
764 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
765 SDNode *&N = BBNodes[MBB];
766 if (N) return SDOperand(N, 0);
767 N = new BasicBlockSDNode(MBB);
768 AllNodes.push_back(N);
769 return SDOperand(N, 0);
772 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
773 if ((unsigned)VT >= ValueTypeNodes.size())
774 ValueTypeNodes.resize(VT+1);
775 if (ValueTypeNodes[VT] == 0) {
776 ValueTypeNodes[VT] = new VTSDNode(VT);
777 AllNodes.push_back(ValueTypeNodes[VT]);
780 return SDOperand(ValueTypeNodes[VT], 0);
783 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
784 SDNode *&N = ExternalSymbols[Sym];
785 if (N) return SDOperand(N, 0);
786 N = new ExternalSymbolSDNode(false, Sym, VT);
787 AllNodes.push_back(N);
788 return SDOperand(N, 0);
791 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
793 SDNode *&N = TargetExternalSymbols[Sym];
794 if (N) return SDOperand(N, 0);
795 N = new ExternalSymbolSDNode(true, Sym, VT);
796 AllNodes.push_back(N);
797 return SDOperand(N, 0);
800 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
801 if ((unsigned)Cond >= CondCodeNodes.size())
802 CondCodeNodes.resize(Cond+1);
804 if (CondCodeNodes[Cond] == 0) {
805 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
806 AllNodes.push_back(CondCodeNodes[Cond]);
808 return SDOperand(CondCodeNodes[Cond], 0);
811 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
812 RegisterSDNode *&Reg = RegNodes[std::make_pair(RegNo, VT)];
814 Reg = new RegisterSDNode(RegNo, VT);
815 AllNodes.push_back(Reg);
817 return SDOperand(Reg, 0);
820 SDOperand SelectionDAG::SimplifySetCC(MVT::ValueType VT, SDOperand N1,
821 SDOperand N2, ISD::CondCode Cond) {
822 // These setcc operations always fold.
826 case ISD::SETFALSE2: return getConstant(0, VT);
828 case ISD::SETTRUE2: return getConstant(1, VT);
831 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
832 uint64_t C2 = N2C->getValue();
833 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
834 uint64_t C1 = N1C->getValue();
836 // Sign extend the operands if required
837 if (ISD::isSignedIntSetCC(Cond)) {
838 C1 = N1C->getSignExtended();
839 C2 = N2C->getSignExtended();
843 default: assert(0 && "Unknown integer setcc!");
844 case ISD::SETEQ: return getConstant(C1 == C2, VT);
845 case ISD::SETNE: return getConstant(C1 != C2, VT);
846 case ISD::SETULT: return getConstant(C1 < C2, VT);
847 case ISD::SETUGT: return getConstant(C1 > C2, VT);
848 case ISD::SETULE: return getConstant(C1 <= C2, VT);
849 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
850 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
851 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
852 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
853 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
856 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
857 if (N1.getOpcode() == ISD::ZERO_EXTEND) {
858 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType());
860 // If the comparison constant has bits in the upper part, the
861 // zero-extended value could never match.
862 if (C2 & (~0ULL << InSize)) {
863 unsigned VSize = MVT::getSizeInBits(N1.getValueType());
867 case ISD::SETEQ: return getConstant(0, VT);
870 case ISD::SETNE: return getConstant(1, VT);
873 // True if the sign bit of C2 is set.
874 return getConstant((C2 & (1ULL << VSize)) != 0, VT);
877 // True if the sign bit of C2 isn't set.
878 return getConstant((C2 & (1ULL << VSize)) == 0, VT);
884 // Otherwise, we can perform the comparison with the low bits.
892 return getSetCC(VT, N1.getOperand(0),
893 getConstant(C2, N1.getOperand(0).getValueType()),
896 break; // todo, be more careful with signed comparisons
898 } else if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG &&
899 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
900 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N1.getOperand(1))->getVT();
901 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy);
902 MVT::ValueType ExtDstTy = N1.getValueType();
903 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy);
905 // If the extended part has any inconsistent bits, it cannot ever
906 // compare equal. In other words, they have to be all ones or all
909 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1));
910 if ((C2 & ExtBits) != 0 && (C2 & ExtBits) != ExtBits)
911 return getConstant(Cond == ISD::SETNE, VT);
913 // Otherwise, make this a use of a zext.
914 return getSetCC(VT, getZeroExtendInReg(N1.getOperand(0), ExtSrcTy),
915 getConstant(C2 & (~0ULL>>(64-ExtSrcTyBits)), ExtDstTy),
919 uint64_t MinVal, MaxVal;
920 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0));
921 if (ISD::isSignedIntSetCC(Cond)) {
922 MinVal = 1ULL << (OperandBitSize-1);
923 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined.
924 MaxVal = ~0ULL >> (65-OperandBitSize);
929 MaxVal = ~0ULL >> (64-OperandBitSize);
932 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
933 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
934 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true
935 --C2; // X >= C1 --> X > (C1-1)
936 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
937 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
940 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
941 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true
942 ++C2; // X <= C1 --> X < (C1+1)
943 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
944 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
947 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal)
948 return getConstant(0, VT); // X < MIN --> false
950 // Canonicalize setgt X, Min --> setne X, Min
951 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal)
952 return getSetCC(VT, N1, N2, ISD::SETNE);
954 // If we have setult X, 1, turn it into seteq X, 0
955 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1)
956 return getSetCC(VT, N1, getConstant(MinVal, N1.getValueType()),
958 // If we have setugt X, Max-1, turn it into seteq X, Max
959 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1)
960 return getSetCC(VT, N1, getConstant(MaxVal, N1.getValueType()),
963 // If we have "setcc X, C1", check to see if we can shrink the immediate
966 // SETUGT X, SINTMAX -> SETLT X, 0
967 if (Cond == ISD::SETUGT && OperandBitSize != 1 &&
968 C2 == (~0ULL >> (65-OperandBitSize)))
969 return getSetCC(VT, N1, getConstant(0, N2.getValueType()), ISD::SETLT);
971 // FIXME: Implement the rest of these.
974 // Fold bit comparisons when we can.
975 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
976 VT == N1.getValueType() && N1.getOpcode() == ISD::AND)
977 if (ConstantSDNode *AndRHS =
978 dyn_cast<ConstantSDNode>(N1.getOperand(1))) {
979 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
980 // Perform the xform if the AND RHS is a single bit.
981 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) {
982 return getNode(ISD::SRL, VT, N1,
983 getConstant(Log2_64(AndRHS->getValue()),
984 TLI.getShiftAmountTy()));
986 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) {
987 // (X & 8) == 8 --> (X & 8) >> 3
988 // Perform the xform if C2 is a single bit.
989 if ((C2 & (C2-1)) == 0) {
990 return getNode(ISD::SRL, VT, N1,
991 getConstant(Log2_64(C2),TLI.getShiftAmountTy()));
996 } else if (isa<ConstantSDNode>(N1.Val)) {
997 // Ensure that the constant occurs on the RHS.
998 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1001 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
1002 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
1003 double C1 = N1C->getValue(), C2 = N2C->getValue();
1006 default: break; // FIXME: Implement the rest of these!
1007 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1008 case ISD::SETNE: return getConstant(C1 != C2, VT);
1009 case ISD::SETLT: return getConstant(C1 < C2, VT);
1010 case ISD::SETGT: return getConstant(C1 > C2, VT);
1011 case ISD::SETLE: return getConstant(C1 <= C2, VT);
1012 case ISD::SETGE: return getConstant(C1 >= C2, VT);
1015 // Ensure that the constant occurs on the RHS.
1016 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1019 // Could not fold it.
1023 /// getNode - Gets or creates the specified node.
1025 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1026 SDNode *&N = NullaryOps[std::make_pair(Opcode, VT)];
1028 N = new SDNode(Opcode, VT);
1029 AllNodes.push_back(N);
1031 return SDOperand(N, 0);
1034 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1035 SDOperand Operand) {
1037 // Constant fold unary operations with an integer constant operand.
1038 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1039 uint64_t Val = C->getValue();
1042 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1043 case ISD::ANY_EXTEND:
1044 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1045 case ISD::TRUNCATE: return getConstant(Val, VT);
1046 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
1047 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
1048 case ISD::BIT_CONVERT:
1049 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1050 return getConstantFP(BitsToFloat(Val), VT);
1051 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1052 return getConstantFP(BitsToDouble(Val), VT);
1056 default: assert(0 && "Invalid bswap!"); break;
1057 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1058 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1059 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1064 default: assert(0 && "Invalid ctpop!"); break;
1065 case MVT::i1: return getConstant(Val != 0, VT);
1067 Tmp1 = (unsigned)Val & 0xFF;
1068 return getConstant(CountPopulation_32(Tmp1), VT);
1070 Tmp1 = (unsigned)Val & 0xFFFF;
1071 return getConstant(CountPopulation_32(Tmp1), VT);
1073 return getConstant(CountPopulation_32((unsigned)Val), VT);
1075 return getConstant(CountPopulation_64(Val), VT);
1079 default: assert(0 && "Invalid ctlz!"); break;
1080 case MVT::i1: return getConstant(Val == 0, VT);
1082 Tmp1 = (unsigned)Val & 0xFF;
1083 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1085 Tmp1 = (unsigned)Val & 0xFFFF;
1086 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1088 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1090 return getConstant(CountLeadingZeros_64(Val), VT);
1094 default: assert(0 && "Invalid cttz!"); break;
1095 case MVT::i1: return getConstant(Val == 0, VT);
1097 Tmp1 = (unsigned)Val | 0x100;
1098 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1100 Tmp1 = (unsigned)Val | 0x10000;
1101 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1103 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1105 return getConstant(CountTrailingZeros_64(Val), VT);
1110 // Constant fold unary operations with an floating point constant operand.
1111 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1114 return getConstantFP(-C->getValue(), VT);
1116 return getConstantFP(fabs(C->getValue()), VT);
1118 case ISD::FP_EXTEND:
1119 return getConstantFP(C->getValue(), VT);
1120 case ISD::FP_TO_SINT:
1121 return getConstant((int64_t)C->getValue(), VT);
1122 case ISD::FP_TO_UINT:
1123 return getConstant((uint64_t)C->getValue(), VT);
1124 case ISD::BIT_CONVERT:
1125 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1126 return getConstant(FloatToBits(C->getValue()), VT);
1127 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1128 return getConstant(DoubleToBits(C->getValue()), VT);
1132 unsigned OpOpcode = Operand.Val->getOpcode();
1134 case ISD::TokenFactor:
1135 return Operand; // Factor of one node? No factor.
1136 case ISD::SIGN_EXTEND:
1137 if (Operand.getValueType() == VT) return Operand; // noop extension
1138 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1139 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1140 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1142 case ISD::ZERO_EXTEND:
1143 if (Operand.getValueType() == VT) return Operand; // noop extension
1144 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1145 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1146 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1148 case ISD::ANY_EXTEND:
1149 if (Operand.getValueType() == VT) return Operand; // noop extension
1150 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1151 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1152 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1153 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1156 if (Operand.getValueType() == VT) return Operand; // noop truncate
1157 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1158 if (OpOpcode == ISD::TRUNCATE)
1159 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1160 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1161 OpOpcode == ISD::ANY_EXTEND) {
1162 // If the source is smaller than the dest, we still need an extend.
1163 if (Operand.Val->getOperand(0).getValueType() < VT)
1164 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1165 else if (Operand.Val->getOperand(0).getValueType() > VT)
1166 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1168 return Operand.Val->getOperand(0);
1171 case ISD::BIT_CONVERT:
1172 // Basic sanity checking.
1173 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1174 && "Cannot BIT_CONVERT between two different types!");
1175 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1176 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1177 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1178 if (OpOpcode == ISD::UNDEF)
1179 return getNode(ISD::UNDEF, VT);
1181 case ISD::SCALAR_TO_VECTOR:
1182 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1183 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1184 "Illegal SCALAR_TO_VECTOR node!");
1187 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1188 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1189 Operand.Val->getOperand(0));
1190 if (OpOpcode == ISD::FNEG) // --X -> X
1191 return Operand.Val->getOperand(0);
1194 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1195 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1200 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1201 SDNode *&E = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))];
1202 if (E) return SDOperand(E, 0);
1203 E = N = new SDNode(Opcode, Operand);
1205 N = new SDNode(Opcode, Operand);
1207 N->setValueTypes(VT);
1208 AllNodes.push_back(N);
1209 return SDOperand(N, 0);
1214 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1215 SDOperand N1, SDOperand N2) {
1218 case ISD::TokenFactor:
1219 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1220 N2.getValueType() == MVT::Other && "Invalid token factor!");
1229 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1236 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1243 assert(N1.getValueType() == N2.getValueType() &&
1244 N1.getValueType() == VT && "Binary operator types must match!");
1246 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1247 assert(N1.getValueType() == VT &&
1248 MVT::isFloatingPoint(N1.getValueType()) &&
1249 MVT::isFloatingPoint(N2.getValueType()) &&
1250 "Invalid FCOPYSIGN!");
1257 assert(VT == N1.getValueType() &&
1258 "Shift operators return type must be the same as their first arg");
1259 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1260 VT != MVT::i1 && "Shifts only work on integers");
1262 case ISD::FP_ROUND_INREG: {
1263 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1264 assert(VT == N1.getValueType() && "Not an inreg round!");
1265 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1266 "Cannot FP_ROUND_INREG integer types");
1267 assert(EVT <= VT && "Not rounding down!");
1270 case ISD::AssertSext:
1271 case ISD::AssertZext:
1272 case ISD::SIGN_EXTEND_INREG: {
1273 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1274 assert(VT == N1.getValueType() && "Not an inreg extend!");
1275 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1276 "Cannot *_EXTEND_INREG FP types");
1277 assert(EVT <= VT && "Not extending!");
1284 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1285 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1288 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1290 case ISD::ADD: return getConstant(C1 + C2, VT);
1291 case ISD::SUB: return getConstant(C1 - C2, VT);
1292 case ISD::MUL: return getConstant(C1 * C2, VT);
1294 if (C2) return getConstant(C1 / C2, VT);
1297 if (C2) return getConstant(C1 % C2, VT);
1300 if (C2) return getConstant(N1C->getSignExtended() /
1301 N2C->getSignExtended(), VT);
1304 if (C2) return getConstant(N1C->getSignExtended() %
1305 N2C->getSignExtended(), VT);
1307 case ISD::AND : return getConstant(C1 & C2, VT);
1308 case ISD::OR : return getConstant(C1 | C2, VT);
1309 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1310 case ISD::SHL : return getConstant(C1 << C2, VT);
1311 case ISD::SRL : return getConstant(C1 >> C2, VT);
1312 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1314 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1317 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1321 } else { // Cannonicalize constant to RHS if commutative
1322 if (isCommutativeBinOp(Opcode)) {
1323 std::swap(N1C, N2C);
1329 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1330 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1333 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1335 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1336 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1337 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1339 if (C2) return getConstantFP(C1 / C2, VT);
1342 if (C2) return getConstantFP(fmod(C1, C2), VT);
1344 case ISD::FCOPYSIGN: {
1355 if (u2.I < 0) // Sign bit of RHS set?
1356 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1358 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1359 return getConstantFP(u1.F, VT);
1363 } else { // Cannonicalize constant to RHS if commutative
1364 if (isCommutativeBinOp(Opcode)) {
1365 std::swap(N1CFP, N2CFP);
1371 // Finally, fold operations that do not require constants.
1373 case ISD::FP_ROUND_INREG:
1374 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1376 case ISD::SIGN_EXTEND_INREG: {
1377 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1378 if (EVT == VT) return N1; // Not actually extending
1382 // FIXME: figure out how to safely handle things like
1383 // int foo(int x) { return 1 << (x & 255); }
1384 // int bar() { return foo(256); }
1389 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1390 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1391 return getNode(Opcode, VT, N1, N2.getOperand(0));
1392 else if (N2.getOpcode() == ISD::AND)
1393 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1394 // If the and is only masking out bits that cannot effect the shift,
1395 // eliminate the and.
1396 unsigned NumBits = MVT::getSizeInBits(VT);
1397 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1398 return getNode(Opcode, VT, N1, N2.getOperand(0));
1404 // Memoize this node if possible.
1406 if (VT != MVT::Flag) {
1407 SDNode *&BON = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))];
1408 if (BON) return SDOperand(BON, 0);
1410 BON = N = new SDNode(Opcode, N1, N2);
1412 N = new SDNode(Opcode, N1, N2);
1415 N->setValueTypes(VT);
1416 AllNodes.push_back(N);
1417 return SDOperand(N, 0);
1420 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1421 SDOperand N1, SDOperand N2, SDOperand N3) {
1422 // Perform various simplifications.
1423 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1424 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1425 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
1428 // Use SimplifySetCC to simplify SETCC's.
1429 SDOperand Simp = SimplifySetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1430 if (Simp.Val) return Simp;
1435 if (N1C->getValue())
1436 return N2; // select true, X, Y -> X
1438 return N3; // select false, X, Y -> Y
1440 if (N2 == N3) return N2; // select C, X, X -> X
1444 if (N2C->getValue()) // Unconditional branch
1445 return getNode(ISD::BR, MVT::Other, N1, N3);
1447 return N1; // Never-taken branch
1449 case ISD::VECTOR_SHUFFLE:
1450 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1451 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1452 N3.getOpcode() == ISD::BUILD_VECTOR &&
1453 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1454 "Illegal VECTOR_SHUFFLE node!");
1458 std::vector<SDOperand> Ops;
1464 // Memoize node if it doesn't produce a flag.
1466 if (VT != MVT::Flag) {
1467 SDNode *&E = OneResultNodes[std::make_pair(Opcode,std::make_pair(VT, Ops))];
1468 if (E) return SDOperand(E, 0);
1469 E = N = new SDNode(Opcode, N1, N2, N3);
1471 N = new SDNode(Opcode, N1, N2, N3);
1473 N->setValueTypes(VT);
1474 AllNodes.push_back(N);
1475 return SDOperand(N, 0);
1478 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1479 SDOperand N1, SDOperand N2, SDOperand N3,
1481 std::vector<SDOperand> Ops;
1487 return getNode(Opcode, VT, Ops);
1490 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1491 SDOperand N1, SDOperand N2, SDOperand N3,
1492 SDOperand N4, SDOperand N5) {
1493 std::vector<SDOperand> Ops;
1500 return getNode(Opcode, VT, Ops);
1503 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1504 SDOperand Chain, SDOperand Ptr,
1506 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))];
1507 if (N) return SDOperand(N, 0);
1508 N = new SDNode(ISD::LOAD, Chain, Ptr, SV);
1510 // Loads have a token chain.
1511 setNodeValueTypes(N, VT, MVT::Other);
1512 AllNodes.push_back(N);
1513 return SDOperand(N, 0);
1516 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1517 SDOperand Chain, SDOperand Ptr,
1519 std::vector<SDOperand> Ops;
1521 Ops.push_back(Chain);
1524 Ops.push_back(getConstant(Count, MVT::i32));
1525 Ops.push_back(getValueType(EVT));
1526 std::vector<MVT::ValueType> VTs;
1528 VTs.push_back(MVT::Vector); VTs.push_back(MVT::Other); // Add token chain.
1529 return getNode(ISD::VLOAD, VTs, Ops);
1532 SDOperand SelectionDAG::getExtLoad(unsigned Opcode, MVT::ValueType VT,
1533 SDOperand Chain, SDOperand Ptr, SDOperand SV,
1534 MVT::ValueType EVT) {
1535 std::vector<SDOperand> Ops;
1537 Ops.push_back(Chain);
1540 Ops.push_back(getValueType(EVT));
1541 std::vector<MVT::ValueType> VTs;
1543 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1544 return getNode(Opcode, VTs, Ops);
1547 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
1548 assert((!V || isa<PointerType>(V->getType())) &&
1549 "SrcValue is not a pointer?");
1550 SDNode *&N = ValueNodes[std::make_pair(V, Offset)];
1551 if (N) return SDOperand(N, 0);
1553 N = new SrcValueSDNode(V, Offset);
1554 AllNodes.push_back(N);
1555 return SDOperand(N, 0);
1558 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1559 SDOperand Chain, SDOperand Ptr,
1561 std::vector<SDOperand> Ops;
1563 Ops.push_back(Chain);
1566 std::vector<MVT::ValueType> VTs;
1568 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1569 return getNode(ISD::VAARG, VTs, Ops);
1572 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1573 std::vector<SDOperand> &Ops) {
1574 switch (Ops.size()) {
1575 case 0: return getNode(Opcode, VT);
1576 case 1: return getNode(Opcode, VT, Ops[0]);
1577 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1578 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1582 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Ops[1].Val);
1585 case ISD::TRUNCSTORE: {
1586 assert(Ops.size() == 5 && "TRUNCSTORE takes 5 operands!");
1587 MVT::ValueType EVT = cast<VTSDNode>(Ops[4])->getVT();
1588 #if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store
1589 // If this is a truncating store of a constant, convert to the desired type
1590 // and store it instead.
1591 if (isa<Constant>(Ops[0])) {
1592 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1);
1593 if (isa<Constant>(Op))
1596 // Also for ConstantFP?
1598 if (Ops[0].getValueType() == EVT) // Normal store?
1599 return getNode(ISD::STORE, VT, Ops[0], Ops[1], Ops[2], Ops[3]);
1600 assert(Ops[1].getValueType() > EVT && "Not a truncation?");
1601 assert(MVT::isInteger(Ops[1].getValueType()) == MVT::isInteger(EVT) &&
1602 "Can't do FP-INT conversion!");
1605 case ISD::SELECT_CC: {
1606 assert(Ops.size() == 5 && "SELECT_CC takes 5 operands!");
1607 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1608 "LHS and RHS of condition must have same type!");
1609 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1610 "True and False arms of SelectCC must have same type!");
1611 assert(Ops[2].getValueType() == VT &&
1612 "select_cc node must be of same type as true and false value!");
1616 assert(Ops.size() == 5 && "BR_CC takes 5 operands!");
1617 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1618 "LHS/RHS of comparison should match types!");
1625 if (VT != MVT::Flag) {
1627 OneResultNodes[std::make_pair(Opcode, std::make_pair(VT, Ops))];
1628 if (E) return SDOperand(E, 0);
1629 E = N = new SDNode(Opcode, Ops);
1631 N = new SDNode(Opcode, Ops);
1633 N->setValueTypes(VT);
1634 AllNodes.push_back(N);
1635 return SDOperand(N, 0);
1638 SDOperand SelectionDAG::getNode(unsigned Opcode,
1639 std::vector<MVT::ValueType> &ResultTys,
1640 std::vector<SDOperand> &Ops) {
1641 if (ResultTys.size() == 1)
1642 return getNode(Opcode, ResultTys[0], Ops);
1647 case ISD::ZEXTLOAD: {
1648 MVT::ValueType EVT = cast<VTSDNode>(Ops[3])->getVT();
1649 assert(Ops.size() == 4 && ResultTys.size() == 2 && "Bad *EXTLOAD!");
1650 // If they are asking for an extending load from/to the same thing, return a
1652 if (ResultTys[0] == EVT)
1653 return getLoad(ResultTys[0], Ops[0], Ops[1], Ops[2]);
1654 if (MVT::isVector(ResultTys[0])) {
1655 assert(EVT == MVT::getVectorBaseType(ResultTys[0]) &&
1656 "Invalid vector extload!");
1658 assert(EVT < ResultTys[0] &&
1659 "Should only be an extending load, not truncating!");
1661 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(ResultTys[0])) &&
1662 "Cannot sign/zero extend a FP/Vector load!");
1663 assert(MVT::isInteger(ResultTys[0]) == MVT::isInteger(EVT) &&
1664 "Cannot convert from FP to Int or Int -> FP!");
1668 // FIXME: figure out how to safely handle things like
1669 // int foo(int x) { return 1 << (x & 255); }
1670 // int bar() { return foo(256); }
1672 case ISD::SRA_PARTS:
1673 case ISD::SRL_PARTS:
1674 case ISD::SHL_PARTS:
1675 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1676 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1677 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1678 else if (N3.getOpcode() == ISD::AND)
1679 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1680 // If the and is only masking out bits that cannot effect the shift,
1681 // eliminate the and.
1682 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1683 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1684 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1690 // Memoize the node unless it returns a flag.
1692 if (ResultTys.back() != MVT::Flag) {
1694 ArbitraryNodes[std::make_pair(Opcode, std::make_pair(ResultTys, Ops))];
1695 if (E) return SDOperand(E, 0);
1696 E = N = new SDNode(Opcode, Ops);
1698 N = new SDNode(Opcode, Ops);
1700 setNodeValueTypes(N, ResultTys);
1701 AllNodes.push_back(N);
1702 return SDOperand(N, 0);
1705 void SelectionDAG::setNodeValueTypes(SDNode *N,
1706 std::vector<MVT::ValueType> &RetVals) {
1707 switch (RetVals.size()) {
1709 case 1: N->setValueTypes(RetVals[0]); return;
1710 case 2: setNodeValueTypes(N, RetVals[0], RetVals[1]); return;
1714 std::list<std::vector<MVT::ValueType> >::iterator I =
1715 std::find(VTList.begin(), VTList.end(), RetVals);
1716 if (I == VTList.end()) {
1717 VTList.push_front(RetVals);
1721 N->setValueTypes(&(*I)[0], I->size());
1724 void SelectionDAG::setNodeValueTypes(SDNode *N, MVT::ValueType VT1,
1725 MVT::ValueType VT2) {
1726 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1727 E = VTList.end(); I != E; ++I) {
1728 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) {
1729 N->setValueTypes(&(*I)[0], 2);
1733 std::vector<MVT::ValueType> V;
1736 VTList.push_front(V);
1737 N->setValueTypes(&(*VTList.begin())[0], 2);
1740 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1741 /// specified operands. If the resultant node already exists in the DAG,
1742 /// this does not modify the specified node, instead it returns the node that
1743 /// already exists. If the resultant node does not exist in the DAG, the
1744 /// input node is returned. As a degenerate case, if you specify the same
1745 /// input operands as the node already has, the input node is returned.
1746 SDOperand SelectionDAG::
1747 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1748 SDNode *N = InN.Val;
1749 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1751 // Check to see if there is no change.
1752 if (Op == N->getOperand(0)) return InN;
1754 // See if the modified node already exists.
1755 SDNode **NewSlot = FindModifiedNodeSlot(N, Op);
1756 if (NewSlot && *NewSlot)
1757 return SDOperand(*NewSlot, InN.ResNo);
1759 // Nope it doesn't. Remove the node from it's current place in the maps.
1761 RemoveNodeFromCSEMaps(N);
1763 // Now we update the operands.
1764 N->OperandList[0].Val->removeUser(N);
1766 N->OperandList[0] = Op;
1768 // If this gets put into a CSE map, add it.
1769 if (NewSlot) *NewSlot = N;
1773 SDOperand SelectionDAG::
1774 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1775 SDNode *N = InN.Val;
1776 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1778 // Check to see if there is no change.
1779 bool AnyChange = false;
1780 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1781 return InN; // No operands changed, just return the input node.
1783 // See if the modified node already exists.
1784 SDNode **NewSlot = FindModifiedNodeSlot(N, Op1, Op2);
1785 if (NewSlot && *NewSlot)
1786 return SDOperand(*NewSlot, InN.ResNo);
1788 // Nope it doesn't. Remove the node from it's current place in the maps.
1790 RemoveNodeFromCSEMaps(N);
1792 // Now we update the operands.
1793 if (N->OperandList[0] != Op1) {
1794 N->OperandList[0].Val->removeUser(N);
1795 Op1.Val->addUser(N);
1796 N->OperandList[0] = Op1;
1798 if (N->OperandList[1] != Op2) {
1799 N->OperandList[1].Val->removeUser(N);
1800 Op2.Val->addUser(N);
1801 N->OperandList[1] = Op2;
1804 // If this gets put into a CSE map, add it.
1805 if (NewSlot) *NewSlot = N;
1809 SDOperand SelectionDAG::
1810 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
1811 std::vector<SDOperand> Ops;
1815 return UpdateNodeOperands(N, Ops);
1818 SDOperand SelectionDAG::
1819 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1820 SDOperand Op3, SDOperand Op4) {
1821 std::vector<SDOperand> Ops;
1826 return UpdateNodeOperands(N, Ops);
1829 SDOperand SelectionDAG::
1830 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1831 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
1832 std::vector<SDOperand> Ops;
1838 return UpdateNodeOperands(N, Ops);
1842 SDOperand SelectionDAG::
1843 UpdateNodeOperands(SDOperand InN, const std::vector<SDOperand> &Ops) {
1844 SDNode *N = InN.Val;
1845 assert(N->getNumOperands() == Ops.size() &&
1846 "Update with wrong number of operands");
1848 // Check to see if there is no change.
1849 unsigned NumOps = Ops.size();
1850 bool AnyChange = false;
1851 for (unsigned i = 0; i != NumOps; ++i) {
1852 if (Ops[i] != N->getOperand(i)) {
1858 // No operands changed, just return the input node.
1859 if (!AnyChange) return InN;
1861 // See if the modified node already exists.
1862 SDNode **NewSlot = FindModifiedNodeSlot(N, Ops);
1863 if (NewSlot && *NewSlot)
1864 return SDOperand(*NewSlot, InN.ResNo);
1866 // Nope it doesn't. Remove the node from it's current place in the maps.
1868 RemoveNodeFromCSEMaps(N);
1870 // Now we update the operands.
1871 for (unsigned i = 0; i != NumOps; ++i) {
1872 if (N->OperandList[i] != Ops[i]) {
1873 N->OperandList[i].Val->removeUser(N);
1874 Ops[i].Val->addUser(N);
1875 N->OperandList[i] = Ops[i];
1879 // If this gets put into a CSE map, add it.
1880 if (NewSlot) *NewSlot = N;
1887 /// SelectNodeTo - These are used for target selectors to *mutate* the
1888 /// specified node to have the specified return type, Target opcode, and
1889 /// operands. Note that target opcodes are stored as
1890 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
1892 /// Note that SelectNodeTo returns the resultant node. If there is already a
1893 /// node of the specified opcode and operands, it returns that node instead of
1894 /// the current one.
1895 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1896 MVT::ValueType VT) {
1897 // If an identical node already exists, use it.
1898 SDNode *&ON = NullaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, VT)];
1899 if (ON) return SDOperand(ON, 0);
1901 RemoveNodeFromCSEMaps(N);
1903 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1904 N->setValueTypes(VT);
1906 ON = N; // Memoize the new node.
1907 return SDOperand(N, 0);
1910 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1911 MVT::ValueType VT, SDOperand Op1) {
1912 // If an identical node already exists, use it.
1913 SDNode *&ON = UnaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1914 std::make_pair(Op1, VT))];
1915 if (ON) return SDOperand(ON, 0);
1917 RemoveNodeFromCSEMaps(N);
1918 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1919 N->setValueTypes(VT);
1920 N->setOperands(Op1);
1922 ON = N; // Memoize the new node.
1923 return SDOperand(N, 0);
1926 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1927 MVT::ValueType VT, SDOperand Op1,
1929 // If an identical node already exists, use it.
1930 SDNode *&ON = BinaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1931 std::make_pair(Op1, Op2))];
1932 if (ON) return SDOperand(ON, 0);
1934 RemoveNodeFromCSEMaps(N);
1935 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1936 N->setValueTypes(VT);
1937 N->setOperands(Op1, Op2);
1939 ON = N; // Memoize the new node.
1940 return SDOperand(N, 0);
1943 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1944 MVT::ValueType VT, SDOperand Op1,
1945 SDOperand Op2, SDOperand Op3) {
1946 // If an identical node already exists, use it.
1947 std::vector<SDOperand> OpList;
1948 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
1949 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1950 std::make_pair(VT, OpList))];
1951 if (ON) return SDOperand(ON, 0);
1953 RemoveNodeFromCSEMaps(N);
1954 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1955 N->setValueTypes(VT);
1956 N->setOperands(Op1, Op2, Op3);
1958 ON = N; // Memoize the new node.
1959 return SDOperand(N, 0);
1962 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1963 MVT::ValueType VT, SDOperand Op1,
1964 SDOperand Op2, SDOperand Op3,
1966 // If an identical node already exists, use it.
1967 std::vector<SDOperand> OpList;
1968 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
1969 OpList.push_back(Op4);
1970 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1971 std::make_pair(VT, OpList))];
1972 if (ON) return SDOperand(ON, 0);
1974 RemoveNodeFromCSEMaps(N);
1975 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1976 N->setValueTypes(VT);
1977 N->setOperands(Op1, Op2, Op3, Op4);
1979 ON = N; // Memoize the new node.
1980 return SDOperand(N, 0);
1983 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
1984 MVT::ValueType VT, SDOperand Op1,
1985 SDOperand Op2, SDOperand Op3,SDOperand Op4,
1987 // If an identical node already exists, use it.
1988 std::vector<SDOperand> OpList;
1989 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
1990 OpList.push_back(Op4); OpList.push_back(Op5);
1991 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
1992 std::make_pair(VT, OpList))];
1993 if (ON) return SDOperand(ON, 0);
1995 RemoveNodeFromCSEMaps(N);
1996 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
1997 N->setValueTypes(VT);
1998 N->setOperands(Op1, Op2, Op3, Op4, Op5);
2000 ON = N; // Memoize the new node.
2001 return SDOperand(N, 0);
2004 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2005 MVT::ValueType VT, SDOperand Op1,
2006 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2007 SDOperand Op5, SDOperand Op6) {
2008 // If an identical node already exists, use it.
2009 std::vector<SDOperand> OpList;
2010 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2011 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2012 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2013 std::make_pair(VT, OpList))];
2014 if (ON) return SDOperand(ON, 0);
2016 RemoveNodeFromCSEMaps(N);
2017 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2018 N->setValueTypes(VT);
2019 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6);
2021 ON = N; // Memoize the new node.
2022 return SDOperand(N, 0);
2025 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2026 MVT::ValueType VT, SDOperand Op1,
2027 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2028 SDOperand Op5, SDOperand Op6,
2030 // If an identical node already exists, use it.
2031 std::vector<SDOperand> OpList;
2032 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2033 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2034 OpList.push_back(Op7);
2035 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2036 std::make_pair(VT, OpList))];
2037 if (ON) return SDOperand(ON, 0);
2039 RemoveNodeFromCSEMaps(N);
2040 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2041 N->setValueTypes(VT);
2042 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7);
2044 ON = N; // Memoize the new node.
2045 return SDOperand(N, 0);
2047 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2048 MVT::ValueType VT, SDOperand Op1,
2049 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2050 SDOperand Op5, SDOperand Op6,
2051 SDOperand Op7, SDOperand Op8) {
2052 // If an identical node already exists, use it.
2053 std::vector<SDOperand> OpList;
2054 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2055 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2056 OpList.push_back(Op7); OpList.push_back(Op8);
2057 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2058 std::make_pair(VT, OpList))];
2059 if (ON) return SDOperand(ON, 0);
2061 RemoveNodeFromCSEMaps(N);
2062 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2063 N->setValueTypes(VT);
2064 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7, Op8);
2066 ON = N; // Memoize the new node.
2067 return SDOperand(N, 0);
2070 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2071 MVT::ValueType VT1, MVT::ValueType VT2,
2072 SDOperand Op1, SDOperand Op2) {
2073 // If an identical node already exists, use it.
2074 std::vector<SDOperand> OpList;
2075 OpList.push_back(Op1); OpList.push_back(Op2);
2076 std::vector<MVT::ValueType> VTList;
2077 VTList.push_back(VT1); VTList.push_back(VT2);
2078 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2079 std::make_pair(VTList, OpList))];
2080 if (ON) return SDOperand(ON, 0);
2082 RemoveNodeFromCSEMaps(N);
2083 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2084 setNodeValueTypes(N, VT1, VT2);
2085 N->setOperands(Op1, Op2);
2087 ON = N; // Memoize the new node.
2088 return SDOperand(N, 0);
2091 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2092 MVT::ValueType VT1, MVT::ValueType VT2,
2093 SDOperand Op1, SDOperand Op2,
2095 // If an identical node already exists, use it.
2096 std::vector<SDOperand> OpList;
2097 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2098 std::vector<MVT::ValueType> VTList;
2099 VTList.push_back(VT1); VTList.push_back(VT2);
2100 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2101 std::make_pair(VTList, OpList))];
2102 if (ON) return SDOperand(ON, 0);
2104 RemoveNodeFromCSEMaps(N);
2105 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2106 setNodeValueTypes(N, VT1, VT2);
2107 N->setOperands(Op1, Op2, Op3);
2109 ON = N; // Memoize the new node.
2110 return SDOperand(N, 0);
2113 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2114 MVT::ValueType VT1, MVT::ValueType VT2,
2115 SDOperand Op1, SDOperand Op2,
2116 SDOperand Op3, SDOperand Op4) {
2117 // If an identical node already exists, use it.
2118 std::vector<SDOperand> OpList;
2119 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2120 OpList.push_back(Op4);
2121 std::vector<MVT::ValueType> VTList;
2122 VTList.push_back(VT1); VTList.push_back(VT2);
2123 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2124 std::make_pair(VTList, OpList))];
2125 if (ON) return SDOperand(ON, 0);
2127 RemoveNodeFromCSEMaps(N);
2128 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2129 setNodeValueTypes(N, VT1, VT2);
2130 N->setOperands(Op1, Op2, Op3, Op4);
2132 ON = N; // Memoize the new node.
2133 return SDOperand(N, 0);
2136 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2137 MVT::ValueType VT1, MVT::ValueType VT2,
2138 SDOperand Op1, SDOperand Op2,
2139 SDOperand Op3, SDOperand Op4,
2141 // If an identical node already exists, use it.
2142 std::vector<SDOperand> OpList;
2143 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2144 OpList.push_back(Op4); OpList.push_back(Op5);
2145 std::vector<MVT::ValueType> VTList;
2146 VTList.push_back(VT1); VTList.push_back(VT2);
2147 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2148 std::make_pair(VTList, OpList))];
2149 if (ON) return SDOperand(ON, 0);
2151 RemoveNodeFromCSEMaps(N);
2152 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2153 setNodeValueTypes(N, VT1, VT2);
2154 N->setOperands(Op1, Op2, Op3, Op4, Op5);
2156 ON = N; // Memoize the new node.
2157 return SDOperand(N, 0);
2160 /// getTargetNode - These are used for target selectors to create a new node
2161 /// with specified return type(s), target opcode, and operands.
2163 /// Note that getTargetNode returns the resultant node. If there is already a
2164 /// node of the specified opcode and operands, it returns that node instead of
2165 /// the current one.
2166 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2167 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2169 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2171 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2173 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2174 SDOperand Op1, SDOperand Op2) {
2175 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2177 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2178 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2179 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2181 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2182 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2184 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4).Val;
2186 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2187 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2188 SDOperand Op4, SDOperand Op5) {
2189 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4, Op5).Val;
2191 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2192 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2193 SDOperand Op4, SDOperand Op5, SDOperand Op6) {
2194 std::vector<SDOperand> Ops;
2202 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2204 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2205 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2206 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2208 std::vector<SDOperand> Ops;
2217 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2219 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2220 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2221 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2222 SDOperand Op7, SDOperand Op8) {
2223 std::vector<SDOperand> Ops;
2233 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2235 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2236 std::vector<SDOperand> &Ops) {
2237 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2239 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2240 MVT::ValueType VT2, SDOperand Op1) {
2241 std::vector<MVT::ValueType> ResultTys;
2242 ResultTys.push_back(VT1);
2243 ResultTys.push_back(VT2);
2244 std::vector<SDOperand> Ops;
2246 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2248 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2249 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2) {
2250 std::vector<MVT::ValueType> ResultTys;
2251 ResultTys.push_back(VT1);
2252 ResultTys.push_back(VT2);
2253 std::vector<SDOperand> Ops;
2256 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2258 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2259 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2261 std::vector<MVT::ValueType> ResultTys;
2262 ResultTys.push_back(VT1);
2263 ResultTys.push_back(VT2);
2264 std::vector<SDOperand> Ops;
2268 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2270 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2271 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2272 SDOperand Op3, SDOperand Op4) {
2273 std::vector<MVT::ValueType> ResultTys;
2274 ResultTys.push_back(VT1);
2275 ResultTys.push_back(VT2);
2276 std::vector<SDOperand> Ops;
2281 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2283 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2284 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2285 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2286 std::vector<MVT::ValueType> ResultTys;
2287 ResultTys.push_back(VT1);
2288 ResultTys.push_back(VT2);
2289 std::vector<SDOperand> Ops;
2295 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2297 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2298 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2299 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2301 std::vector<MVT::ValueType> ResultTys;
2302 ResultTys.push_back(VT1);
2303 ResultTys.push_back(VT2);
2304 std::vector<SDOperand> Ops;
2311 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2313 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2314 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2315 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2316 SDOperand Op6, SDOperand Op7) {
2317 std::vector<MVT::ValueType> ResultTys;
2318 ResultTys.push_back(VT1);
2319 ResultTys.push_back(VT2);
2320 std::vector<SDOperand> Ops;
2328 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2330 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2331 MVT::ValueType VT2, MVT::ValueType VT3,
2332 SDOperand Op1, SDOperand Op2) {
2333 std::vector<MVT::ValueType> ResultTys;
2334 ResultTys.push_back(VT1);
2335 ResultTys.push_back(VT2);
2336 ResultTys.push_back(VT3);
2337 std::vector<SDOperand> Ops;
2340 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2342 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2343 MVT::ValueType VT2, MVT::ValueType VT3,
2344 SDOperand Op1, SDOperand Op2,
2345 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2346 std::vector<MVT::ValueType> ResultTys;
2347 ResultTys.push_back(VT1);
2348 ResultTys.push_back(VT2);
2349 ResultTys.push_back(VT3);
2350 std::vector<SDOperand> Ops;
2356 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2358 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2359 MVT::ValueType VT2, MVT::ValueType VT3,
2360 SDOperand Op1, SDOperand Op2,
2361 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2363 std::vector<MVT::ValueType> ResultTys;
2364 ResultTys.push_back(VT1);
2365 ResultTys.push_back(VT2);
2366 ResultTys.push_back(VT3);
2367 std::vector<SDOperand> Ops;
2374 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2376 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2377 MVT::ValueType VT2, MVT::ValueType VT3,
2378 SDOperand Op1, SDOperand Op2,
2379 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2380 SDOperand Op6, SDOperand Op7) {
2381 std::vector<MVT::ValueType> ResultTys;
2382 ResultTys.push_back(VT1);
2383 ResultTys.push_back(VT2);
2384 ResultTys.push_back(VT3);
2385 std::vector<SDOperand> Ops;
2393 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2395 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2396 MVT::ValueType VT2, std::vector<SDOperand> &Ops) {
2397 std::vector<MVT::ValueType> ResultTys;
2398 ResultTys.push_back(VT1);
2399 ResultTys.push_back(VT2);
2400 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2403 // ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2404 /// This can cause recursive merging of nodes in the DAG.
2406 /// This version assumes From/To have a single result value.
2408 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2409 std::vector<SDNode*> *Deleted) {
2410 SDNode *From = FromN.Val, *To = ToN.Val;
2411 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2412 "Cannot replace with this method!");
2413 assert(From != To && "Cannot replace uses of with self");
2415 while (!From->use_empty()) {
2416 // Process users until they are all gone.
2417 SDNode *U = *From->use_begin();
2419 // This node is about to morph, remove its old self from the CSE maps.
2420 RemoveNodeFromCSEMaps(U);
2422 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2424 if (I->Val == From) {
2425 From->removeUser(U);
2430 // Now that we have modified U, add it back to the CSE maps. If it already
2431 // exists there, recursively merge the results together.
2432 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2433 ReplaceAllUsesWith(U, Existing, Deleted);
2435 if (Deleted) Deleted->push_back(U);
2436 DeleteNodeNotInCSEMaps(U);
2441 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2442 /// This can cause recursive merging of nodes in the DAG.
2444 /// This version assumes From/To have matching types and numbers of result
2447 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2448 std::vector<SDNode*> *Deleted) {
2449 assert(From != To && "Cannot replace uses of with self");
2450 assert(From->getNumValues() == To->getNumValues() &&
2451 "Cannot use this version of ReplaceAllUsesWith!");
2452 if (From->getNumValues() == 1) { // If possible, use the faster version.
2453 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
2457 while (!From->use_empty()) {
2458 // Process users until they are all gone.
2459 SDNode *U = *From->use_begin();
2461 // This node is about to morph, remove its old self from the CSE maps.
2462 RemoveNodeFromCSEMaps(U);
2464 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2466 if (I->Val == From) {
2467 From->removeUser(U);
2472 // Now that we have modified U, add it back to the CSE maps. If it already
2473 // exists there, recursively merge the results together.
2474 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2475 ReplaceAllUsesWith(U, Existing, Deleted);
2477 if (Deleted) Deleted->push_back(U);
2478 DeleteNodeNotInCSEMaps(U);
2483 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2484 /// This can cause recursive merging of nodes in the DAG.
2486 /// This version can replace From with any result values. To must match the
2487 /// number and types of values returned by From.
2488 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2489 const std::vector<SDOperand> &To,
2490 std::vector<SDNode*> *Deleted) {
2491 assert(From->getNumValues() == To.size() &&
2492 "Incorrect number of values to replace with!");
2493 if (To.size() == 1 && To[0].Val->getNumValues() == 1) {
2494 // Degenerate case handled above.
2495 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2499 while (!From->use_empty()) {
2500 // Process users until they are all gone.
2501 SDNode *U = *From->use_begin();
2503 // This node is about to morph, remove its old self from the CSE maps.
2504 RemoveNodeFromCSEMaps(U);
2506 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2508 if (I->Val == From) {
2509 const SDOperand &ToOp = To[I->ResNo];
2510 From->removeUser(U);
2512 ToOp.Val->addUser(U);
2515 // Now that we have modified U, add it back to the CSE maps. If it already
2516 // exists there, recursively merge the results together.
2517 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2518 ReplaceAllUsesWith(U, Existing, Deleted);
2520 if (Deleted) Deleted->push_back(U);
2521 DeleteNodeNotInCSEMaps(U);
2526 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2527 /// uses of other values produced by From.Val alone. The Deleted vector is
2528 /// handled the same was as for ReplaceAllUsesWith.
2529 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2530 std::vector<SDNode*> &Deleted) {
2531 assert(From != To && "Cannot replace a value with itself");
2532 // Handle the simple, trivial, case efficiently.
2533 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2534 ReplaceAllUsesWith(From, To, &Deleted);
2538 // Get all of the users in a nice, deterministically ordered, uniqued set.
2539 SetVector<SDNode*> Users(From.Val->use_begin(), From.Val->use_end());
2541 while (!Users.empty()) {
2542 // We know that this user uses some value of From. If it is the right
2543 // value, update it.
2544 SDNode *User = Users.back();
2547 for (SDOperand *Op = User->OperandList,
2548 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2550 // Okay, we know this user needs to be updated. Remove its old self
2551 // from the CSE maps.
2552 RemoveNodeFromCSEMaps(User);
2554 // Update all operands that match "From".
2555 for (; Op != E; ++Op) {
2557 From.Val->removeUser(User);
2559 To.Val->addUser(User);
2563 // Now that we have modified User, add it back to the CSE maps. If it
2564 // already exists there, recursively merge the results together.
2565 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2566 unsigned NumDeleted = Deleted.size();
2567 ReplaceAllUsesWith(User, Existing, &Deleted);
2569 // User is now dead.
2570 Deleted.push_back(User);
2571 DeleteNodeNotInCSEMaps(User);
2573 // We have to be careful here, because ReplaceAllUsesWith could have
2574 // deleted a user of From, which means there may be dangling pointers
2575 // in the "Users" setvector. Scan over the deleted node pointers and
2576 // remove them from the setvector.
2577 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2578 Users.remove(Deleted[i]);
2580 break; // Exit the operand scanning loop.
2587 //===----------------------------------------------------------------------===//
2589 //===----------------------------------------------------------------------===//
2592 /// getValueTypeList - Return a pointer to the specified value type.
2594 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2595 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2600 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2601 /// indicated value. This method ignores uses of other values defined by this
2603 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2604 assert(Value < getNumValues() && "Bad value!");
2606 // If there is only one value, this is easy.
2607 if (getNumValues() == 1)
2608 return use_size() == NUses;
2609 if (Uses.size() < NUses) return false;
2611 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2613 std::set<SDNode*> UsersHandled;
2615 for (std::vector<SDNode*>::const_iterator UI = Uses.begin(), E = Uses.end();
2618 if (User->getNumOperands() == 1 ||
2619 UsersHandled.insert(User).second) // First time we've seen this?
2620 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2621 if (User->getOperand(i) == TheValue) {
2623 return false; // too many uses
2628 // Found exactly the right number of uses?
2633 // isOnlyUse - Return true if this node is the only use of N.
2634 bool SDNode::isOnlyUse(SDNode *N) const {
2636 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2647 // isOperand - Return true if this node is an operand of N.
2648 bool SDOperand::isOperand(SDNode *N) const {
2649 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2650 if (*this == N->getOperand(i))
2655 bool SDNode::isOperand(SDNode *N) const {
2656 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2657 if (this == N->OperandList[i].Val)
2662 const char *SDNode::getOperationName(const SelectionDAG *G) const {
2663 switch (getOpcode()) {
2665 if (getOpcode() < ISD::BUILTIN_OP_END)
2666 return "<<Unknown DAG Node>>";
2669 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2670 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2671 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2673 TargetLowering &TLI = G->getTargetLoweringInfo();
2675 TLI.getTargetNodeName(getOpcode());
2676 if (Name) return Name;
2679 return "<<Unknown Target Node>>";
2682 case ISD::PCMARKER: return "PCMarker";
2683 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2684 case ISD::SRCVALUE: return "SrcValue";
2685 case ISD::EntryToken: return "EntryToken";
2686 case ISD::TokenFactor: return "TokenFactor";
2687 case ISD::AssertSext: return "AssertSext";
2688 case ISD::AssertZext: return "AssertZext";
2690 case ISD::STRING: return "String";
2691 case ISD::BasicBlock: return "BasicBlock";
2692 case ISD::VALUETYPE: return "ValueType";
2693 case ISD::Register: return "Register";
2695 case ISD::Constant: return "Constant";
2696 case ISD::ConstantFP: return "ConstantFP";
2697 case ISD::GlobalAddress: return "GlobalAddress";
2698 case ISD::FrameIndex: return "FrameIndex";
2699 case ISD::ConstantPool: return "ConstantPool";
2700 case ISD::ExternalSymbol: return "ExternalSymbol";
2701 case ISD::INTRINSIC_WO_CHAIN: {
2702 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2703 return Intrinsic::getName((Intrinsic::ID)IID);
2705 case ISD::INTRINSIC_VOID:
2706 case ISD::INTRINSIC_W_CHAIN: {
2707 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2708 return Intrinsic::getName((Intrinsic::ID)IID);
2711 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2712 case ISD::TargetConstant: return "TargetConstant";
2713 case ISD::TargetConstantFP:return "TargetConstantFP";
2714 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2715 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2716 case ISD::TargetConstantPool: return "TargetConstantPool";
2717 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2719 case ISD::CopyToReg: return "CopyToReg";
2720 case ISD::CopyFromReg: return "CopyFromReg";
2721 case ISD::UNDEF: return "undef";
2722 case ISD::MERGE_VALUES: return "mergevalues";
2723 case ISD::INLINEASM: return "inlineasm";
2724 case ISD::HANDLENODE: return "handlenode";
2725 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
2728 case ISD::FABS: return "fabs";
2729 case ISD::FNEG: return "fneg";
2730 case ISD::FSQRT: return "fsqrt";
2731 case ISD::FSIN: return "fsin";
2732 case ISD::FCOS: return "fcos";
2735 case ISD::ADD: return "add";
2736 case ISD::SUB: return "sub";
2737 case ISD::MUL: return "mul";
2738 case ISD::MULHU: return "mulhu";
2739 case ISD::MULHS: return "mulhs";
2740 case ISD::SDIV: return "sdiv";
2741 case ISD::UDIV: return "udiv";
2742 case ISD::SREM: return "srem";
2743 case ISD::UREM: return "urem";
2744 case ISD::AND: return "and";
2745 case ISD::OR: return "or";
2746 case ISD::XOR: return "xor";
2747 case ISD::SHL: return "shl";
2748 case ISD::SRA: return "sra";
2749 case ISD::SRL: return "srl";
2750 case ISD::ROTL: return "rotl";
2751 case ISD::ROTR: return "rotr";
2752 case ISD::FADD: return "fadd";
2753 case ISD::FSUB: return "fsub";
2754 case ISD::FMUL: return "fmul";
2755 case ISD::FDIV: return "fdiv";
2756 case ISD::FREM: return "frem";
2757 case ISD::FCOPYSIGN: return "fcopysign";
2758 case ISD::VADD: return "vadd";
2759 case ISD::VSUB: return "vsub";
2760 case ISD::VMUL: return "vmul";
2761 case ISD::VSDIV: return "vsdiv";
2762 case ISD::VUDIV: return "vudiv";
2763 case ISD::VAND: return "vand";
2764 case ISD::VOR: return "vor";
2765 case ISD::VXOR: return "vxor";
2767 case ISD::SETCC: return "setcc";
2768 case ISD::SELECT: return "select";
2769 case ISD::SELECT_CC: return "select_cc";
2770 case ISD::VSELECT: return "vselect";
2771 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2772 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2773 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2774 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2775 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2776 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2777 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2778 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2779 case ISD::VBIT_CONVERT: return "vbit_convert";
2780 case ISD::ADDC: return "addc";
2781 case ISD::ADDE: return "adde";
2782 case ISD::SUBC: return "subc";
2783 case ISD::SUBE: return "sube";
2784 case ISD::SHL_PARTS: return "shl_parts";
2785 case ISD::SRA_PARTS: return "sra_parts";
2786 case ISD::SRL_PARTS: return "srl_parts";
2788 // Conversion operators.
2789 case ISD::SIGN_EXTEND: return "sign_extend";
2790 case ISD::ZERO_EXTEND: return "zero_extend";
2791 case ISD::ANY_EXTEND: return "any_extend";
2792 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2793 case ISD::TRUNCATE: return "truncate";
2794 case ISD::FP_ROUND: return "fp_round";
2795 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2796 case ISD::FP_EXTEND: return "fp_extend";
2798 case ISD::SINT_TO_FP: return "sint_to_fp";
2799 case ISD::UINT_TO_FP: return "uint_to_fp";
2800 case ISD::FP_TO_SINT: return "fp_to_sint";
2801 case ISD::FP_TO_UINT: return "fp_to_uint";
2802 case ISD::BIT_CONVERT: return "bit_convert";
2804 // Control flow instructions
2805 case ISD::BR: return "br";
2806 case ISD::BRCOND: return "brcond";
2807 case ISD::BR_CC: return "br_cc";
2808 case ISD::RET: return "ret";
2809 case ISD::CALLSEQ_START: return "callseq_start";
2810 case ISD::CALLSEQ_END: return "callseq_end";
2813 case ISD::LOAD: return "load";
2814 case ISD::STORE: return "store";
2815 case ISD::VLOAD: return "vload";
2816 case ISD::EXTLOAD: return "extload";
2817 case ISD::SEXTLOAD: return "sextload";
2818 case ISD::ZEXTLOAD: return "zextload";
2819 case ISD::TRUNCSTORE: return "truncstore";
2820 case ISD::VAARG: return "vaarg";
2821 case ISD::VACOPY: return "vacopy";
2822 case ISD::VAEND: return "vaend";
2823 case ISD::VASTART: return "vastart";
2824 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2825 case ISD::EXTRACT_ELEMENT: return "extract_element";
2826 case ISD::BUILD_PAIR: return "build_pair";
2827 case ISD::STACKSAVE: return "stacksave";
2828 case ISD::STACKRESTORE: return "stackrestore";
2830 // Block memory operations.
2831 case ISD::MEMSET: return "memset";
2832 case ISD::MEMCPY: return "memcpy";
2833 case ISD::MEMMOVE: return "memmove";
2836 case ISD::BSWAP: return "bswap";
2837 case ISD::CTPOP: return "ctpop";
2838 case ISD::CTTZ: return "cttz";
2839 case ISD::CTLZ: return "ctlz";
2842 case ISD::LOCATION: return "location";
2843 case ISD::DEBUG_LOC: return "debug_loc";
2844 case ISD::DEBUG_LABEL: return "debug_label";
2847 switch (cast<CondCodeSDNode>(this)->get()) {
2848 default: assert(0 && "Unknown setcc condition!");
2849 case ISD::SETOEQ: return "setoeq";
2850 case ISD::SETOGT: return "setogt";
2851 case ISD::SETOGE: return "setoge";
2852 case ISD::SETOLT: return "setolt";
2853 case ISD::SETOLE: return "setole";
2854 case ISD::SETONE: return "setone";
2856 case ISD::SETO: return "seto";
2857 case ISD::SETUO: return "setuo";
2858 case ISD::SETUEQ: return "setue";
2859 case ISD::SETUGT: return "setugt";
2860 case ISD::SETUGE: return "setuge";
2861 case ISD::SETULT: return "setult";
2862 case ISD::SETULE: return "setule";
2863 case ISD::SETUNE: return "setune";
2865 case ISD::SETEQ: return "seteq";
2866 case ISD::SETGT: return "setgt";
2867 case ISD::SETGE: return "setge";
2868 case ISD::SETLT: return "setlt";
2869 case ISD::SETLE: return "setle";
2870 case ISD::SETNE: return "setne";
2875 void SDNode::dump() const { dump(0); }
2876 void SDNode::dump(const SelectionDAG *G) const {
2877 std::cerr << (void*)this << ": ";
2879 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
2880 if (i) std::cerr << ",";
2881 if (getValueType(i) == MVT::Other)
2884 std::cerr << MVT::getValueTypeString(getValueType(i));
2886 std::cerr << " = " << getOperationName(G);
2889 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2890 if (i) std::cerr << ", ";
2891 std::cerr << (void*)getOperand(i).Val;
2892 if (unsigned RN = getOperand(i).ResNo)
2893 std::cerr << ":" << RN;
2896 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
2897 std::cerr << "<" << CSDN->getValue() << ">";
2898 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
2899 std::cerr << "<" << CSDN->getValue() << ">";
2900 } else if (const GlobalAddressSDNode *GADN =
2901 dyn_cast<GlobalAddressSDNode>(this)) {
2902 int offset = GADN->getOffset();
2904 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
2906 std::cerr << " + " << offset;
2908 std::cerr << " " << offset;
2909 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
2910 std::cerr << "<" << FIDN->getIndex() << ">";
2911 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
2912 int offset = CP->getOffset();
2913 std::cerr << "<" << *CP->get() << ">";
2915 std::cerr << " + " << offset;
2917 std::cerr << " " << offset;
2918 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
2920 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
2922 std::cerr << LBB->getName() << " ";
2923 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
2924 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
2925 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
2926 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
2928 std::cerr << " #" << R->getReg();
2930 } else if (const ExternalSymbolSDNode *ES =
2931 dyn_cast<ExternalSymbolSDNode>(this)) {
2932 std::cerr << "'" << ES->getSymbol() << "'";
2933 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
2935 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
2937 std::cerr << "<null:" << M->getOffset() << ">";
2938 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
2939 std::cerr << ":" << getValueTypeString(N->getVT());
2943 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
2944 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2945 if (N->getOperand(i).Val->hasOneUse())
2946 DumpNodes(N->getOperand(i).Val, indent+2, G);
2948 std::cerr << "\n" << std::string(indent+2, ' ')
2949 << (void*)N->getOperand(i).Val << ": <multiple use>";
2952 std::cerr << "\n" << std::string(indent, ' ');
2956 void SelectionDAG::dump() const {
2957 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
2958 std::vector<const SDNode*> Nodes;
2959 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
2963 std::sort(Nodes.begin(), Nodes.end());
2965 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2966 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
2967 DumpNodes(Nodes[i], 2, this);
2970 DumpNodes(getRoot().Val, 2, this);
2972 std::cerr << "\n\n";
2975 /// InsertISelMapEntry - A helper function to insert a key / element pair
2976 /// into a SDOperand to SDOperand map. This is added to avoid the map
2977 /// insertion operator from being inlined.
2978 void SelectionDAG::InsertISelMapEntry(std::map<SDOperand, SDOperand> &Map,
2979 SDNode *Key, unsigned KeyResNo,
2980 SDNode *Element, unsigned ElementResNo) {
2981 Map.insert(std::make_pair(SDOperand(Key, KeyResNo),
2982 SDOperand(Element, ElementResNo)));