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 U bit if the N bit is set.
222 // Canonicalize illegal integer setcc's.
223 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
226 return ISD::CondCode(Op);
229 /// getSetCCAndOperation - Return the result of a logical AND between different
230 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
231 /// function returns zero if it is not possible to represent the resultant
233 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
235 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
236 // Cannot fold a signed setcc with an unsigned setcc.
237 return ISD::SETCC_INVALID;
239 // Combine all of the condition bits.
240 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
242 // Canonicalize illegal integer setcc's.
246 case ISD::SETUO: // e.g. SETUGT & SETULT
247 Result = ISD::SETFALSE;
249 case ISD::SETUEQ: // e.g. SETUGE & SETULE
258 const TargetMachine &SelectionDAG::getTarget() const {
259 return TLI.getTargetMachine();
262 //===----------------------------------------------------------------------===//
263 // SelectionDAG Class
264 //===----------------------------------------------------------------------===//
266 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
267 /// SelectionDAG, including nodes (like loads) that have uses of their token
268 /// chain but no other uses and no side effect. If a node is passed in as an
269 /// argument, it is used as the seed for node deletion.
270 void SelectionDAG::RemoveDeadNodes(SDNode *N) {
271 // Create a dummy node (which is not added to allnodes), that adds a reference
272 // to the root node, preventing it from being deleted.
273 HandleSDNode Dummy(getRoot());
275 bool MadeChange = false;
277 // If we have a hint to start from, use it.
278 if (N && N->use_empty()) {
283 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
284 if (I->use_empty() && I->getOpcode() != 65535) {
285 // Node is dead, recursively delete newly dead uses.
290 // Walk the nodes list, removing the nodes we've marked as dead.
292 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ) {
299 // If the root changed (e.g. it was a dead load, update the root).
300 setRoot(Dummy.getValue());
303 /// DestroyDeadNode - We know that N is dead. Nuke it from the CSE maps for the
304 /// graph. If it is the last user of any of its operands, recursively process
305 /// them the same way.
307 void SelectionDAG::DestroyDeadNode(SDNode *N) {
308 // Okay, we really are going to delete this node. First take this out of the
309 // appropriate CSE map.
310 RemoveNodeFromCSEMaps(N);
312 // Next, brutally remove the operand list. This is safe to do, as there are
313 // no cycles in the graph.
314 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
318 // Now that we removed this operand, see if there are no uses of it left.
322 delete[] N->OperandList;
326 // Mark the node as dead.
327 N->MorphNodeTo(65535);
330 void SelectionDAG::DeleteNode(SDNode *N) {
331 assert(N->use_empty() && "Cannot delete a node that is not dead!");
333 // First take this out of the appropriate CSE map.
334 RemoveNodeFromCSEMaps(N);
336 // Finally, remove uses due to operands of this node, remove from the
337 // AllNodes list, and delete the node.
338 DeleteNodeNotInCSEMaps(N);
341 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
343 // Remove it from the AllNodes list.
346 // Drop all of the operands and decrement used nodes use counts.
347 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
348 I->Val->removeUser(N);
349 delete[] N->OperandList;
356 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
357 /// correspond to it. This is useful when we're about to delete or repurpose
358 /// the node. We don't want future request for structurally identical nodes
359 /// to return N anymore.
360 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
362 switch (N->getOpcode()) {
363 case ISD::HANDLENODE: return; // noop.
365 Erased = Constants.erase(std::make_pair(cast<ConstantSDNode>(N)->getValue(),
366 N->getValueType(0)));
368 case ISD::TargetConstant:
369 Erased = TargetConstants.erase(std::make_pair(
370 cast<ConstantSDNode>(N)->getValue(),
371 N->getValueType(0)));
373 case ISD::ConstantFP: {
374 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
375 Erased = ConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
378 case ISD::TargetConstantFP: {
379 uint64_t V = DoubleToBits(cast<ConstantFPSDNode>(N)->getValue());
380 Erased = TargetConstantFPs.erase(std::make_pair(V, N->getValueType(0)));
384 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
387 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
388 "Cond code doesn't exist!");
389 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
390 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
392 case ISD::GlobalAddress: {
393 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
394 Erased = GlobalValues.erase(std::make_pair(GN->getGlobal(),
398 case ISD::TargetGlobalAddress: {
399 GlobalAddressSDNode *GN = cast<GlobalAddressSDNode>(N);
400 Erased =TargetGlobalValues.erase(std::make_pair(GN->getGlobal(),
404 case ISD::FrameIndex:
405 Erased = FrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
407 case ISD::TargetFrameIndex:
408 Erased = TargetFrameIndices.erase(cast<FrameIndexSDNode>(N)->getIndex());
411 Erased = JumpTableIndices.erase(cast<JumpTableSDNode>(N)->getIndex());
413 case ISD::TargetJumpTable:
415 TargetJumpTableIndices.erase(cast<JumpTableSDNode>(N)->getIndex());
417 case ISD::ConstantPool:
418 Erased = ConstantPoolIndices.
419 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
420 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
421 cast<ConstantPoolSDNode>(N)->getAlignment())));
423 case ISD::TargetConstantPool:
424 Erased = TargetConstantPoolIndices.
425 erase(std::make_pair(cast<ConstantPoolSDNode>(N)->get(),
426 std::make_pair(cast<ConstantPoolSDNode>(N)->getOffset(),
427 cast<ConstantPoolSDNode>(N)->getAlignment())));
429 case ISD::BasicBlock:
430 Erased = BBNodes.erase(cast<BasicBlockSDNode>(N)->getBasicBlock());
432 case ISD::ExternalSymbol:
433 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
435 case ISD::TargetExternalSymbol:
437 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
440 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
441 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
444 Erased = RegNodes.erase(std::make_pair(cast<RegisterSDNode>(N)->getReg(),
445 N->getValueType(0)));
447 case ISD::SRCVALUE: {
448 SrcValueSDNode *SVN = cast<SrcValueSDNode>(N);
449 Erased =ValueNodes.erase(std::make_pair(SVN->getValue(), SVN->getOffset()));
453 Erased = Loads.erase(std::make_pair(N->getOperand(1),
454 std::make_pair(N->getOperand(0),
455 N->getValueType(0))));
458 if (N->getNumValues() == 1) {
459 if (N->getNumOperands() == 0) {
460 Erased = NullaryOps.erase(std::make_pair(N->getOpcode(),
461 N->getValueType(0)));
462 } else if (N->getNumOperands() == 1) {
464 UnaryOps.erase(std::make_pair(N->getOpcode(),
465 std::make_pair(N->getOperand(0),
466 N->getValueType(0))));
467 } else if (N->getNumOperands() == 2) {
469 BinaryOps.erase(std::make_pair(N->getOpcode(),
470 std::make_pair(N->getOperand(0),
473 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
475 OneResultNodes.erase(std::make_pair(N->getOpcode(),
476 std::make_pair(N->getValueType(0),
480 // Remove the node from the ArbitraryNodes map.
481 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
482 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
484 ArbitraryNodes.erase(std::make_pair(N->getOpcode(),
485 std::make_pair(RV, Ops)));
490 // Verify that the node was actually in one of the CSE maps, unless it has a
491 // flag result (which cannot be CSE'd) or is one of the special cases that are
492 // not subject to CSE.
493 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
494 !N->isTargetOpcode()) {
496 assert(0 && "Node is not in map!");
501 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
502 /// has been taken out and modified in some way. If the specified node already
503 /// exists in the CSE maps, do not modify the maps, but return the existing node
504 /// instead. If it doesn't exist, add it and return null.
506 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
507 assert(N->getNumOperands() && "This is a leaf node!");
508 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
509 return 0; // Never add these nodes.
511 // Check that remaining values produced are not flags.
512 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
513 if (N->getValueType(i) == MVT::Flag)
514 return 0; // Never CSE anything that produces a flag.
516 if (N->getNumValues() == 1) {
517 if (N->getNumOperands() == 1) {
518 SDNode *&U = UnaryOps[std::make_pair(N->getOpcode(),
519 std::make_pair(N->getOperand(0),
520 N->getValueType(0)))];
523 } else if (N->getNumOperands() == 2) {
524 SDNode *&B = BinaryOps[std::make_pair(N->getOpcode(),
525 std::make_pair(N->getOperand(0),
530 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
531 SDNode *&ORN = OneResultNodes[std::make_pair(N->getOpcode(),
532 std::make_pair(N->getValueType(0), Ops))];
537 if (N->getOpcode() == ISD::LOAD) {
538 SDNode *&L = Loads[std::make_pair(N->getOperand(1),
539 std::make_pair(N->getOperand(0),
540 N->getValueType(0)))];
544 // Remove the node from the ArbitraryNodes map.
545 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
546 std::vector<SDOperand> Ops(N->op_begin(), N->op_end());
547 SDNode *&AN = ArbitraryNodes[std::make_pair(N->getOpcode(),
548 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, SDOperand Op) {
561 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
562 return 0; // Never add these nodes.
564 // Check that remaining values produced are not flags.
565 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
566 if (N->getValueType(i) == MVT::Flag)
567 return 0; // Never CSE anything that produces a flag.
569 if (N->getNumValues() == 1) {
570 return &UnaryOps[std::make_pair(N->getOpcode(),
571 std::make_pair(Op, N->getValueType(0)))];
573 // Remove the node from the ArbitraryNodes map.
574 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
575 std::vector<SDOperand> Ops;
577 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
578 std::make_pair(RV, Ops))];
583 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
584 /// were replaced with those specified. If this node is never memoized,
585 /// return null, otherwise return a pointer to the slot it would take. If a
586 /// node already exists with these operands, the slot will be non-null.
587 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
588 SDOperand Op1, SDOperand Op2) {
589 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
590 return 0; // Never add these nodes.
592 // Check that remaining values produced are not flags.
593 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
594 if (N->getValueType(i) == MVT::Flag)
595 return 0; // Never CSE anything that produces a flag.
597 if (N->getNumValues() == 1) {
598 return &BinaryOps[std::make_pair(N->getOpcode(),
599 std::make_pair(Op1, Op2))];
601 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
602 std::vector<SDOperand> Ops;
605 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
606 std::make_pair(RV, Ops))];
612 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
613 /// were replaced with those specified. If this node is never memoized,
614 /// return null, otherwise return a pointer to the slot it would take. If a
615 /// node already exists with these operands, the slot will be non-null.
616 SDNode **SelectionDAG::FindModifiedNodeSlot(SDNode *N,
617 const std::vector<SDOperand> &Ops) {
618 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
619 return 0; // Never add these nodes.
621 // Check that remaining values produced are not flags.
622 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
623 if (N->getValueType(i) == MVT::Flag)
624 return 0; // Never CSE anything that produces a flag.
626 if (N->getNumValues() == 1) {
627 if (N->getNumOperands() == 1) {
628 return &UnaryOps[std::make_pair(N->getOpcode(),
629 std::make_pair(Ops[0],
630 N->getValueType(0)))];
631 } else if (N->getNumOperands() == 2) {
632 return &BinaryOps[std::make_pair(N->getOpcode(),
633 std::make_pair(Ops[0], Ops[1]))];
635 return &OneResultNodes[std::make_pair(N->getOpcode(),
636 std::make_pair(N->getValueType(0),
640 if (N->getOpcode() == ISD::LOAD) {
641 return &Loads[std::make_pair(Ops[1],
642 std::make_pair(Ops[0], N->getValueType(0)))];
644 std::vector<MVT::ValueType> RV(N->value_begin(), N->value_end());
645 return &ArbitraryNodes[std::make_pair(N->getOpcode(),
646 std::make_pair(RV, Ops))];
653 SelectionDAG::~SelectionDAG() {
654 while (!AllNodes.empty()) {
655 SDNode *N = AllNodes.begin();
656 delete [] N->OperandList;
659 AllNodes.pop_front();
663 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
664 if (Op.getValueType() == VT) return Op;
665 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
666 return getNode(ISD::AND, Op.getValueType(), Op,
667 getConstant(Imm, Op.getValueType()));
670 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT) {
671 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
672 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
674 // Mask out any bits that are not valid for this constant.
676 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
678 SDNode *&N = Constants[std::make_pair(Val, VT)];
679 if (N) return SDOperand(N, 0);
680 N = new ConstantSDNode(false, Val, VT);
681 AllNodes.push_back(N);
682 return SDOperand(N, 0);
685 SDOperand SelectionDAG::getString(const std::string &Val) {
686 StringSDNode *&N = StringNodes[Val];
688 N = new StringSDNode(Val);
689 AllNodes.push_back(N);
691 return SDOperand(N, 0);
694 SDOperand SelectionDAG::getTargetConstant(uint64_t Val, MVT::ValueType VT) {
695 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
696 // Mask out any bits that are not valid for this constant.
698 Val &= ((uint64_t)1 << MVT::getSizeInBits(VT)) - 1;
700 SDNode *&N = TargetConstants[std::make_pair(Val, VT)];
701 if (N) return SDOperand(N, 0);
702 N = new ConstantSDNode(true, Val, VT);
703 AllNodes.push_back(N);
704 return SDOperand(N, 0);
707 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT) {
708 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
710 Val = (float)Val; // Mask out extra precision.
712 // Do the map lookup using the actual bit pattern for the floating point
713 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
714 // we don't have issues with SNANs.
715 SDNode *&N = ConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
716 if (N) return SDOperand(N, 0);
717 N = new ConstantFPSDNode(false, Val, VT);
718 AllNodes.push_back(N);
719 return SDOperand(N, 0);
722 SDOperand SelectionDAG::getTargetConstantFP(double Val, MVT::ValueType VT) {
723 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
725 Val = (float)Val; // Mask out extra precision.
727 // Do the map lookup using the actual bit pattern for the floating point
728 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
729 // we don't have issues with SNANs.
730 SDNode *&N = TargetConstantFPs[std::make_pair(DoubleToBits(Val), VT)];
731 if (N) return SDOperand(N, 0);
732 N = new ConstantFPSDNode(true, Val, VT);
733 AllNodes.push_back(N);
734 return SDOperand(N, 0);
737 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
738 MVT::ValueType VT, int offset) {
739 SDNode *&N = GlobalValues[std::make_pair(GV, offset)];
740 if (N) return SDOperand(N, 0);
741 N = new GlobalAddressSDNode(false, GV, VT, offset);
742 AllNodes.push_back(N);
743 return SDOperand(N, 0);
746 SDOperand SelectionDAG::getTargetGlobalAddress(const GlobalValue *GV,
747 MVT::ValueType VT, int offset) {
748 SDNode *&N = TargetGlobalValues[std::make_pair(GV, offset)];
749 if (N) return SDOperand(N, 0);
750 N = new GlobalAddressSDNode(true, GV, VT, offset);
751 AllNodes.push_back(N);
752 return SDOperand(N, 0);
755 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT) {
756 SDNode *&N = FrameIndices[FI];
757 if (N) return SDOperand(N, 0);
758 N = new FrameIndexSDNode(FI, VT, false);
759 AllNodes.push_back(N);
760 return SDOperand(N, 0);
763 SDOperand SelectionDAG::getTargetFrameIndex(int FI, MVT::ValueType VT) {
764 SDNode *&N = TargetFrameIndices[FI];
765 if (N) return SDOperand(N, 0);
766 N = new FrameIndexSDNode(FI, VT, true);
767 AllNodes.push_back(N);
768 return SDOperand(N, 0);
771 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT) {
772 SDNode *&N = JumpTableIndices[JTI];
773 if (N) return SDOperand(N, 0);
774 N = new JumpTableSDNode(JTI, VT, false);
775 AllNodes.push_back(N);
776 return SDOperand(N, 0);
779 SDOperand SelectionDAG::getTargetJumpTable(int JTI, MVT::ValueType VT) {
780 SDNode *&N = TargetJumpTableIndices[JTI];
781 if (N) return SDOperand(N, 0);
782 N = new JumpTableSDNode(JTI, VT, true);
783 AllNodes.push_back(N);
784 return SDOperand(N, 0);
787 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
788 unsigned Alignment, int Offset) {
789 SDNode *&N = ConstantPoolIndices[std::make_pair(C,
790 std::make_pair(Offset, Alignment))];
791 if (N) return SDOperand(N, 0);
792 N = new ConstantPoolSDNode(false, C, VT, Offset, Alignment);
793 AllNodes.push_back(N);
794 return SDOperand(N, 0);
797 SDOperand SelectionDAG::getTargetConstantPool(Constant *C, MVT::ValueType VT,
798 unsigned Alignment, int Offset) {
799 SDNode *&N = TargetConstantPoolIndices[std::make_pair(C,
800 std::make_pair(Offset, Alignment))];
801 if (N) return SDOperand(N, 0);
802 N = new ConstantPoolSDNode(true, C, VT, Offset, Alignment);
803 AllNodes.push_back(N);
804 return SDOperand(N, 0);
807 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
808 SDNode *&N = BBNodes[MBB];
809 if (N) return SDOperand(N, 0);
810 N = new BasicBlockSDNode(MBB);
811 AllNodes.push_back(N);
812 return SDOperand(N, 0);
815 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
816 if ((unsigned)VT >= ValueTypeNodes.size())
817 ValueTypeNodes.resize(VT+1);
818 if (ValueTypeNodes[VT] == 0) {
819 ValueTypeNodes[VT] = new VTSDNode(VT);
820 AllNodes.push_back(ValueTypeNodes[VT]);
823 return SDOperand(ValueTypeNodes[VT], 0);
826 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
827 SDNode *&N = ExternalSymbols[Sym];
828 if (N) return SDOperand(N, 0);
829 N = new ExternalSymbolSDNode(false, Sym, VT);
830 AllNodes.push_back(N);
831 return SDOperand(N, 0);
834 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
836 SDNode *&N = TargetExternalSymbols[Sym];
837 if (N) return SDOperand(N, 0);
838 N = new ExternalSymbolSDNode(true, Sym, VT);
839 AllNodes.push_back(N);
840 return SDOperand(N, 0);
843 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
844 if ((unsigned)Cond >= CondCodeNodes.size())
845 CondCodeNodes.resize(Cond+1);
847 if (CondCodeNodes[Cond] == 0) {
848 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
849 AllNodes.push_back(CondCodeNodes[Cond]);
851 return SDOperand(CondCodeNodes[Cond], 0);
854 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
855 RegisterSDNode *&Reg = RegNodes[std::make_pair(RegNo, VT)];
857 Reg = new RegisterSDNode(RegNo, VT);
858 AllNodes.push_back(Reg);
860 return SDOperand(Reg, 0);
863 SDOperand SelectionDAG::SimplifySetCC(MVT::ValueType VT, SDOperand N1,
864 SDOperand N2, ISD::CondCode Cond) {
865 // These setcc operations always fold.
869 case ISD::SETFALSE2: return getConstant(0, VT);
871 case ISD::SETTRUE2: return getConstant(1, VT);
883 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
887 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
888 uint64_t C2 = N2C->getValue();
889 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
890 uint64_t C1 = N1C->getValue();
892 // Sign extend the operands if required
893 if (ISD::isSignedIntSetCC(Cond)) {
894 C1 = N1C->getSignExtended();
895 C2 = N2C->getSignExtended();
899 default: assert(0 && "Unknown integer setcc!");
900 case ISD::SETEQ: return getConstant(C1 == C2, VT);
901 case ISD::SETNE: return getConstant(C1 != C2, VT);
902 case ISD::SETULT: return getConstant(C1 < C2, VT);
903 case ISD::SETUGT: return getConstant(C1 > C2, VT);
904 case ISD::SETULE: return getConstant(C1 <= C2, VT);
905 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
906 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
907 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
908 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
909 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
912 // If the LHS is a ZERO_EXTEND, perform the comparison on the input.
913 if (N1.getOpcode() == ISD::ZERO_EXTEND) {
914 unsigned InSize = MVT::getSizeInBits(N1.getOperand(0).getValueType());
916 // If the comparison constant has bits in the upper part, the
917 // zero-extended value could never match.
918 if (C2 & (~0ULL << InSize)) {
919 unsigned VSize = MVT::getSizeInBits(N1.getValueType());
923 case ISD::SETEQ: return getConstant(0, VT);
926 case ISD::SETNE: return getConstant(1, VT);
929 // True if the sign bit of C2 is set.
930 return getConstant((C2 & (1ULL << VSize)) != 0, VT);
933 // True if the sign bit of C2 isn't set.
934 return getConstant((C2 & (1ULL << VSize)) == 0, VT);
940 // Otherwise, we can perform the comparison with the low bits.
948 return getSetCC(VT, N1.getOperand(0),
949 getConstant(C2, N1.getOperand(0).getValueType()),
952 break; // todo, be more careful with signed comparisons
954 } else if (N1.getOpcode() == ISD::SIGN_EXTEND_INREG &&
955 (Cond == ISD::SETEQ || Cond == ISD::SETNE)) {
956 MVT::ValueType ExtSrcTy = cast<VTSDNode>(N1.getOperand(1))->getVT();
957 unsigned ExtSrcTyBits = MVT::getSizeInBits(ExtSrcTy);
958 MVT::ValueType ExtDstTy = N1.getValueType();
959 unsigned ExtDstTyBits = MVT::getSizeInBits(ExtDstTy);
961 // If the extended part has any inconsistent bits, it cannot ever
962 // compare equal. In other words, they have to be all ones or all
965 (~0ULL >> (64-ExtSrcTyBits)) & (~0ULL << (ExtDstTyBits-1));
966 if ((C2 & ExtBits) != 0 && (C2 & ExtBits) != ExtBits)
967 return getConstant(Cond == ISD::SETNE, VT);
969 // Otherwise, make this a use of a zext.
970 return getSetCC(VT, getZeroExtendInReg(N1.getOperand(0), ExtSrcTy),
971 getConstant(C2 & (~0ULL>>(64-ExtSrcTyBits)), ExtDstTy),
975 uint64_t MinVal, MaxVal;
976 unsigned OperandBitSize = MVT::getSizeInBits(N2C->getValueType(0));
977 if (ISD::isSignedIntSetCC(Cond)) {
978 MinVal = 1ULL << (OperandBitSize-1);
979 if (OperandBitSize != 1) // Avoid X >> 64, which is undefined.
980 MaxVal = ~0ULL >> (65-OperandBitSize);
985 MaxVal = ~0ULL >> (64-OperandBitSize);
988 // Canonicalize GE/LE comparisons to use GT/LT comparisons.
989 if (Cond == ISD::SETGE || Cond == ISD::SETUGE) {
990 if (C2 == MinVal) return getConstant(1, VT); // X >= MIN --> true
991 --C2; // X >= C1 --> X > (C1-1)
992 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
993 (Cond == ISD::SETGE) ? ISD::SETGT : ISD::SETUGT);
996 if (Cond == ISD::SETLE || Cond == ISD::SETULE) {
997 if (C2 == MaxVal) return getConstant(1, VT); // X <= MAX --> true
998 ++C2; // X <= C1 --> X < (C1+1)
999 return getSetCC(VT, N1, getConstant(C2, N2.getValueType()),
1000 (Cond == ISD::SETLE) ? ISD::SETLT : ISD::SETULT);
1003 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal)
1004 return getConstant(0, VT); // X < MIN --> false
1006 // Canonicalize setgt X, Min --> setne X, Min
1007 if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MinVal)
1008 return getSetCC(VT, N1, N2, ISD::SETNE);
1010 // If we have setult X, 1, turn it into seteq X, 0
1011 if ((Cond == ISD::SETLT || Cond == ISD::SETULT) && C2 == MinVal+1)
1012 return getSetCC(VT, N1, getConstant(MinVal, N1.getValueType()),
1014 // If we have setugt X, Max-1, turn it into seteq X, Max
1015 else if ((Cond == ISD::SETGT || Cond == ISD::SETUGT) && C2 == MaxVal-1)
1016 return getSetCC(VT, N1, getConstant(MaxVal, N1.getValueType()),
1019 // If we have "setcc X, C1", check to see if we can shrink the immediate
1022 // SETUGT X, SINTMAX -> SETLT X, 0
1023 if (Cond == ISD::SETUGT && OperandBitSize != 1 &&
1024 C2 == (~0ULL >> (65-OperandBitSize)))
1025 return getSetCC(VT, N1, getConstant(0, N2.getValueType()), ISD::SETLT);
1027 // FIXME: Implement the rest of these.
1030 // Fold bit comparisons when we can.
1031 if ((Cond == ISD::SETEQ || Cond == ISD::SETNE) &&
1032 VT == N1.getValueType() && N1.getOpcode() == ISD::AND)
1033 if (ConstantSDNode *AndRHS =
1034 dyn_cast<ConstantSDNode>(N1.getOperand(1))) {
1035 if (Cond == ISD::SETNE && C2 == 0) {// (X & 8) != 0 --> (X & 8) >> 3
1036 // Perform the xform if the AND RHS is a single bit.
1037 if ((AndRHS->getValue() & (AndRHS->getValue()-1)) == 0) {
1038 return getNode(ISD::SRL, VT, N1,
1039 getConstant(Log2_64(AndRHS->getValue()),
1040 TLI.getShiftAmountTy()));
1042 } else if (Cond == ISD::SETEQ && C2 == AndRHS->getValue()) {
1043 // (X & 8) == 8 --> (X & 8) >> 3
1044 // Perform the xform if C2 is a single bit.
1045 if ((C2 & (C2-1)) == 0) {
1046 return getNode(ISD::SRL, VT, N1,
1047 getConstant(Log2_64(C2),TLI.getShiftAmountTy()));
1052 } else if (isa<ConstantSDNode>(N1.Val)) {
1053 // Ensure that the constant occurs on the RHS.
1054 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1057 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
1058 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
1059 double C1 = N1C->getValue(), C2 = N2C->getValue();
1062 default: break; // FIXME: Implement the rest of these!
1063 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1064 case ISD::SETNE: return getConstant(C1 != C2, VT);
1065 case ISD::SETLT: return getConstant(C1 < C2, VT);
1066 case ISD::SETGT: return getConstant(C1 > C2, VT);
1067 case ISD::SETLE: return getConstant(C1 <= C2, VT);
1068 case ISD::SETGE: return getConstant(C1 >= C2, VT);
1071 // Ensure that the constant occurs on the RHS.
1072 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1075 // Could not fold it.
1079 /// getNode - Gets or creates the specified node.
1081 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1082 SDNode *&N = NullaryOps[std::make_pair(Opcode, VT)];
1084 N = new SDNode(Opcode, VT);
1085 AllNodes.push_back(N);
1087 return SDOperand(N, 0);
1090 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1091 SDOperand Operand) {
1093 // Constant fold unary operations with an integer constant operand.
1094 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1095 uint64_t Val = C->getValue();
1098 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1099 case ISD::ANY_EXTEND:
1100 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1101 case ISD::TRUNCATE: return getConstant(Val, VT);
1102 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
1103 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
1104 case ISD::BIT_CONVERT:
1105 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1106 return getConstantFP(BitsToFloat(Val), VT);
1107 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1108 return getConstantFP(BitsToDouble(Val), VT);
1112 default: assert(0 && "Invalid bswap!"); break;
1113 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1114 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1115 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1120 default: assert(0 && "Invalid ctpop!"); break;
1121 case MVT::i1: return getConstant(Val != 0, VT);
1123 Tmp1 = (unsigned)Val & 0xFF;
1124 return getConstant(CountPopulation_32(Tmp1), VT);
1126 Tmp1 = (unsigned)Val & 0xFFFF;
1127 return getConstant(CountPopulation_32(Tmp1), VT);
1129 return getConstant(CountPopulation_32((unsigned)Val), VT);
1131 return getConstant(CountPopulation_64(Val), VT);
1135 default: assert(0 && "Invalid ctlz!"); break;
1136 case MVT::i1: return getConstant(Val == 0, VT);
1138 Tmp1 = (unsigned)Val & 0xFF;
1139 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1141 Tmp1 = (unsigned)Val & 0xFFFF;
1142 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1144 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1146 return getConstant(CountLeadingZeros_64(Val), VT);
1150 default: assert(0 && "Invalid cttz!"); break;
1151 case MVT::i1: return getConstant(Val == 0, VT);
1153 Tmp1 = (unsigned)Val | 0x100;
1154 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1156 Tmp1 = (unsigned)Val | 0x10000;
1157 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1159 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1161 return getConstant(CountTrailingZeros_64(Val), VT);
1166 // Constant fold unary operations with an floating point constant operand.
1167 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1170 return getConstantFP(-C->getValue(), VT);
1172 return getConstantFP(fabs(C->getValue()), VT);
1174 case ISD::FP_EXTEND:
1175 return getConstantFP(C->getValue(), VT);
1176 case ISD::FP_TO_SINT:
1177 return getConstant((int64_t)C->getValue(), VT);
1178 case ISD::FP_TO_UINT:
1179 return getConstant((uint64_t)C->getValue(), VT);
1180 case ISD::BIT_CONVERT:
1181 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1182 return getConstant(FloatToBits(C->getValue()), VT);
1183 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1184 return getConstant(DoubleToBits(C->getValue()), VT);
1188 unsigned OpOpcode = Operand.Val->getOpcode();
1190 case ISD::TokenFactor:
1191 return Operand; // Factor of one node? No factor.
1192 case ISD::SIGN_EXTEND:
1193 if (Operand.getValueType() == VT) return Operand; // noop extension
1194 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1195 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1196 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1198 case ISD::ZERO_EXTEND:
1199 if (Operand.getValueType() == VT) return Operand; // noop extension
1200 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1201 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1202 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1204 case ISD::ANY_EXTEND:
1205 if (Operand.getValueType() == VT) return Operand; // noop extension
1206 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1207 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1208 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1209 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1212 if (Operand.getValueType() == VT) return Operand; // noop truncate
1213 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1214 if (OpOpcode == ISD::TRUNCATE)
1215 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1216 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1217 OpOpcode == ISD::ANY_EXTEND) {
1218 // If the source is smaller than the dest, we still need an extend.
1219 if (Operand.Val->getOperand(0).getValueType() < VT)
1220 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1221 else if (Operand.Val->getOperand(0).getValueType() > VT)
1222 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1224 return Operand.Val->getOperand(0);
1227 case ISD::BIT_CONVERT:
1228 // Basic sanity checking.
1229 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1230 && "Cannot BIT_CONVERT between two different types!");
1231 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1232 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1233 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1234 if (OpOpcode == ISD::UNDEF)
1235 return getNode(ISD::UNDEF, VT);
1237 case ISD::SCALAR_TO_VECTOR:
1238 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1239 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1240 "Illegal SCALAR_TO_VECTOR node!");
1243 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1244 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1245 Operand.Val->getOperand(0));
1246 if (OpOpcode == ISD::FNEG) // --X -> X
1247 return Operand.Val->getOperand(0);
1250 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1251 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1256 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1257 SDNode *&E = UnaryOps[std::make_pair(Opcode, std::make_pair(Operand, VT))];
1258 if (E) return SDOperand(E, 0);
1259 E = N = new SDNode(Opcode, Operand);
1261 N = new SDNode(Opcode, Operand);
1263 N->setValueTypes(VT);
1264 AllNodes.push_back(N);
1265 return SDOperand(N, 0);
1270 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1271 SDOperand N1, SDOperand N2) {
1274 case ISD::TokenFactor:
1275 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1276 N2.getValueType() == MVT::Other && "Invalid token factor!");
1285 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1292 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1299 assert(N1.getValueType() == N2.getValueType() &&
1300 N1.getValueType() == VT && "Binary operator types must match!");
1302 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1303 assert(N1.getValueType() == VT &&
1304 MVT::isFloatingPoint(N1.getValueType()) &&
1305 MVT::isFloatingPoint(N2.getValueType()) &&
1306 "Invalid FCOPYSIGN!");
1313 assert(VT == N1.getValueType() &&
1314 "Shift operators return type must be the same as their first arg");
1315 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1316 VT != MVT::i1 && "Shifts only work on integers");
1318 case ISD::FP_ROUND_INREG: {
1319 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1320 assert(VT == N1.getValueType() && "Not an inreg round!");
1321 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1322 "Cannot FP_ROUND_INREG integer types");
1323 assert(EVT <= VT && "Not rounding down!");
1326 case ISD::AssertSext:
1327 case ISD::AssertZext:
1328 case ISD::SIGN_EXTEND_INREG: {
1329 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1330 assert(VT == N1.getValueType() && "Not an inreg extend!");
1331 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1332 "Cannot *_EXTEND_INREG FP types");
1333 assert(EVT <= VT && "Not extending!");
1340 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1341 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1343 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1344 int64_t Val = N1C->getValue();
1345 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1346 Val <<= 64-FromBits;
1347 Val >>= 64-FromBits;
1348 return getConstant(Val, VT);
1352 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1354 case ISD::ADD: return getConstant(C1 + C2, VT);
1355 case ISD::SUB: return getConstant(C1 - C2, VT);
1356 case ISD::MUL: return getConstant(C1 * C2, VT);
1358 if (C2) return getConstant(C1 / C2, VT);
1361 if (C2) return getConstant(C1 % C2, VT);
1364 if (C2) return getConstant(N1C->getSignExtended() /
1365 N2C->getSignExtended(), VT);
1368 if (C2) return getConstant(N1C->getSignExtended() %
1369 N2C->getSignExtended(), VT);
1371 case ISD::AND : return getConstant(C1 & C2, VT);
1372 case ISD::OR : return getConstant(C1 | C2, VT);
1373 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1374 case ISD::SHL : return getConstant(C1 << C2, VT);
1375 case ISD::SRL : return getConstant(C1 >> C2, VT);
1376 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1378 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1381 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1385 } else { // Cannonicalize constant to RHS if commutative
1386 if (isCommutativeBinOp(Opcode)) {
1387 std::swap(N1C, N2C);
1393 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1394 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1397 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1399 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1400 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1401 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1403 if (C2) return getConstantFP(C1 / C2, VT);
1406 if (C2) return getConstantFP(fmod(C1, C2), VT);
1408 case ISD::FCOPYSIGN: {
1419 if (u2.I < 0) // Sign bit of RHS set?
1420 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1422 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1423 return getConstantFP(u1.F, VT);
1427 } else { // Cannonicalize constant to RHS if commutative
1428 if (isCommutativeBinOp(Opcode)) {
1429 std::swap(N1CFP, N2CFP);
1435 // Canonicalize an UNDEF to the RHS, even over a constant.
1436 if (N1.getOpcode() == ISD::UNDEF) {
1437 if (isCommutativeBinOp(Opcode)) {
1441 case ISD::FP_ROUND_INREG:
1442 case ISD::SIGN_EXTEND_INREG:
1448 return N1; // fold op(undef, arg2) -> undef
1455 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1460 // Fold a bunch of operators when the RHS is undef.
1461 if (N2.getOpcode() == ISD::UNDEF) {
1475 return N2; // fold op(arg1, undef) -> undef
1480 return getConstant(0, VT); // fold op(arg1, undef) -> 0
1482 return getConstant(MVT::getIntVTBitMask(VT), VT);
1488 // Finally, fold operations that do not require constants.
1490 case ISD::FP_ROUND_INREG:
1491 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1493 case ISD::SIGN_EXTEND_INREG: {
1494 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1495 if (EVT == VT) return N1; // Not actually extending
1499 // FIXME: figure out how to safely handle things like
1500 // int foo(int x) { return 1 << (x & 255); }
1501 // int bar() { return foo(256); }
1506 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1507 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1508 return getNode(Opcode, VT, N1, N2.getOperand(0));
1509 else if (N2.getOpcode() == ISD::AND)
1510 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1511 // If the and is only masking out bits that cannot effect the shift,
1512 // eliminate the and.
1513 unsigned NumBits = MVT::getSizeInBits(VT);
1514 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1515 return getNode(Opcode, VT, N1, N2.getOperand(0));
1521 // Memoize this node if possible.
1523 if (VT != MVT::Flag) {
1524 SDNode *&BON = BinaryOps[std::make_pair(Opcode, std::make_pair(N1, N2))];
1525 if (BON) return SDOperand(BON, 0);
1527 BON = N = new SDNode(Opcode, N1, N2);
1529 N = new SDNode(Opcode, N1, N2);
1532 N->setValueTypes(VT);
1533 AllNodes.push_back(N);
1534 return SDOperand(N, 0);
1537 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1538 SDOperand N1, SDOperand N2, SDOperand N3) {
1539 // Perform various simplifications.
1540 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1541 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1542 ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
1545 // Use SimplifySetCC to simplify SETCC's.
1546 SDOperand Simp = SimplifySetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1547 if (Simp.Val) return Simp;
1552 if (N1C->getValue())
1553 return N2; // select true, X, Y -> X
1555 return N3; // select false, X, Y -> Y
1557 if (N2 == N3) return N2; // select C, X, X -> X
1561 if (N2C->getValue()) // Unconditional branch
1562 return getNode(ISD::BR, MVT::Other, N1, N3);
1564 return N1; // Never-taken branch
1566 case ISD::VECTOR_SHUFFLE:
1567 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1568 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1569 N3.getOpcode() == ISD::BUILD_VECTOR &&
1570 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1571 "Illegal VECTOR_SHUFFLE node!");
1575 std::vector<SDOperand> Ops;
1581 // Memoize node if it doesn't produce a flag.
1583 if (VT != MVT::Flag) {
1584 SDNode *&E = OneResultNodes[std::make_pair(Opcode,std::make_pair(VT, Ops))];
1585 if (E) return SDOperand(E, 0);
1586 E = N = new SDNode(Opcode, N1, N2, N3);
1588 N = new SDNode(Opcode, N1, N2, N3);
1590 N->setValueTypes(VT);
1591 AllNodes.push_back(N);
1592 return SDOperand(N, 0);
1595 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1596 SDOperand N1, SDOperand N2, SDOperand N3,
1598 std::vector<SDOperand> Ops;
1604 return getNode(Opcode, VT, Ops);
1607 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1608 SDOperand N1, SDOperand N2, SDOperand N3,
1609 SDOperand N4, SDOperand N5) {
1610 std::vector<SDOperand> Ops;
1617 return getNode(Opcode, VT, Ops);
1620 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1621 SDOperand Chain, SDOperand Ptr,
1623 SDNode *&N = Loads[std::make_pair(Ptr, std::make_pair(Chain, VT))];
1624 if (N) return SDOperand(N, 0);
1625 N = new SDNode(ISD::LOAD, Chain, Ptr, SV);
1627 // Loads have a token chain.
1628 setNodeValueTypes(N, VT, MVT::Other);
1629 AllNodes.push_back(N);
1630 return SDOperand(N, 0);
1633 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1634 SDOperand Chain, SDOperand Ptr,
1636 std::vector<SDOperand> Ops;
1638 Ops.push_back(Chain);
1641 Ops.push_back(getConstant(Count, MVT::i32));
1642 Ops.push_back(getValueType(EVT));
1643 std::vector<MVT::ValueType> VTs;
1645 VTs.push_back(MVT::Vector); VTs.push_back(MVT::Other); // Add token chain.
1646 return getNode(ISD::VLOAD, VTs, Ops);
1649 SDOperand SelectionDAG::getExtLoad(unsigned Opcode, MVT::ValueType VT,
1650 SDOperand Chain, SDOperand Ptr, SDOperand SV,
1651 MVT::ValueType EVT) {
1652 std::vector<SDOperand> Ops;
1654 Ops.push_back(Chain);
1657 Ops.push_back(getValueType(EVT));
1658 std::vector<MVT::ValueType> VTs;
1660 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1661 return getNode(Opcode, VTs, Ops);
1664 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
1665 assert((!V || isa<PointerType>(V->getType())) &&
1666 "SrcValue is not a pointer?");
1667 SDNode *&N = ValueNodes[std::make_pair(V, Offset)];
1668 if (N) return SDOperand(N, 0);
1670 N = new SrcValueSDNode(V, Offset);
1671 AllNodes.push_back(N);
1672 return SDOperand(N, 0);
1675 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1676 SDOperand Chain, SDOperand Ptr,
1678 std::vector<SDOperand> Ops;
1680 Ops.push_back(Chain);
1683 std::vector<MVT::ValueType> VTs;
1685 VTs.push_back(VT); VTs.push_back(MVT::Other); // Add token chain.
1686 return getNode(ISD::VAARG, VTs, Ops);
1689 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1690 std::vector<SDOperand> &Ops) {
1691 switch (Ops.size()) {
1692 case 0: return getNode(Opcode, VT);
1693 case 1: return getNode(Opcode, VT, Ops[0]);
1694 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1695 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1699 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(Ops[1].Val);
1702 case ISD::TRUNCSTORE: {
1703 assert(Ops.size() == 5 && "TRUNCSTORE takes 5 operands!");
1704 MVT::ValueType EVT = cast<VTSDNode>(Ops[4])->getVT();
1705 #if 0 // FIXME: If the target supports EVT natively, convert to a truncate/store
1706 // If this is a truncating store of a constant, convert to the desired type
1707 // and store it instead.
1708 if (isa<Constant>(Ops[0])) {
1709 SDOperand Op = getNode(ISD::TRUNCATE, EVT, N1);
1710 if (isa<Constant>(Op))
1713 // Also for ConstantFP?
1715 if (Ops[0].getValueType() == EVT) // Normal store?
1716 return getNode(ISD::STORE, VT, Ops[0], Ops[1], Ops[2], Ops[3]);
1717 assert(Ops[1].getValueType() > EVT && "Not a truncation?");
1718 assert(MVT::isInteger(Ops[1].getValueType()) == MVT::isInteger(EVT) &&
1719 "Can't do FP-INT conversion!");
1722 case ISD::SELECT_CC: {
1723 assert(Ops.size() == 5 && "SELECT_CC takes 5 operands!");
1724 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1725 "LHS and RHS of condition must have same type!");
1726 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1727 "True and False arms of SelectCC must have same type!");
1728 assert(Ops[2].getValueType() == VT &&
1729 "select_cc node must be of same type as true and false value!");
1733 assert(Ops.size() == 5 && "BR_CC takes 5 operands!");
1734 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1735 "LHS/RHS of comparison should match types!");
1742 if (VT != MVT::Flag) {
1744 OneResultNodes[std::make_pair(Opcode, std::make_pair(VT, Ops))];
1745 if (E) return SDOperand(E, 0);
1746 E = N = new SDNode(Opcode, Ops);
1748 N = new SDNode(Opcode, Ops);
1750 N->setValueTypes(VT);
1751 AllNodes.push_back(N);
1752 return SDOperand(N, 0);
1755 SDOperand SelectionDAG::getNode(unsigned Opcode,
1756 std::vector<MVT::ValueType> &ResultTys,
1757 std::vector<SDOperand> &Ops) {
1758 if (ResultTys.size() == 1)
1759 return getNode(Opcode, ResultTys[0], Ops);
1764 case ISD::ZEXTLOAD: {
1765 MVT::ValueType EVT = cast<VTSDNode>(Ops[3])->getVT();
1766 assert(Ops.size() == 4 && ResultTys.size() == 2 && "Bad *EXTLOAD!");
1767 // If they are asking for an extending load from/to the same thing, return a
1769 if (ResultTys[0] == EVT)
1770 return getLoad(ResultTys[0], Ops[0], Ops[1], Ops[2]);
1771 if (MVT::isVector(ResultTys[0])) {
1772 assert(EVT == MVT::getVectorBaseType(ResultTys[0]) &&
1773 "Invalid vector extload!");
1775 assert(EVT < ResultTys[0] &&
1776 "Should only be an extending load, not truncating!");
1778 assert((Opcode == ISD::EXTLOAD || MVT::isInteger(ResultTys[0])) &&
1779 "Cannot sign/zero extend a FP/Vector load!");
1780 assert(MVT::isInteger(ResultTys[0]) == MVT::isInteger(EVT) &&
1781 "Cannot convert from FP to Int or Int -> FP!");
1785 // FIXME: figure out how to safely handle things like
1786 // int foo(int x) { return 1 << (x & 255); }
1787 // int bar() { return foo(256); }
1789 case ISD::SRA_PARTS:
1790 case ISD::SRL_PARTS:
1791 case ISD::SHL_PARTS:
1792 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1793 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1794 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1795 else if (N3.getOpcode() == ISD::AND)
1796 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1797 // If the and is only masking out bits that cannot effect the shift,
1798 // eliminate the and.
1799 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1800 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1801 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1807 // Memoize the node unless it returns a flag.
1809 if (ResultTys.back() != MVT::Flag) {
1811 ArbitraryNodes[std::make_pair(Opcode, std::make_pair(ResultTys, Ops))];
1812 if (E) return SDOperand(E, 0);
1813 E = N = new SDNode(Opcode, Ops);
1815 N = new SDNode(Opcode, Ops);
1817 setNodeValueTypes(N, ResultTys);
1818 AllNodes.push_back(N);
1819 return SDOperand(N, 0);
1822 void SelectionDAG::setNodeValueTypes(SDNode *N,
1823 std::vector<MVT::ValueType> &RetVals) {
1824 switch (RetVals.size()) {
1826 case 1: N->setValueTypes(RetVals[0]); return;
1827 case 2: setNodeValueTypes(N, RetVals[0], RetVals[1]); return;
1831 std::list<std::vector<MVT::ValueType> >::iterator I =
1832 std::find(VTList.begin(), VTList.end(), RetVals);
1833 if (I == VTList.end()) {
1834 VTList.push_front(RetVals);
1838 N->setValueTypes(&(*I)[0], I->size());
1841 void SelectionDAG::setNodeValueTypes(SDNode *N, MVT::ValueType VT1,
1842 MVT::ValueType VT2) {
1843 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1844 E = VTList.end(); I != E; ++I) {
1845 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2) {
1846 N->setValueTypes(&(*I)[0], 2);
1850 std::vector<MVT::ValueType> V;
1853 VTList.push_front(V);
1854 N->setValueTypes(&(*VTList.begin())[0], 2);
1857 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1858 /// specified operands. If the resultant node already exists in the DAG,
1859 /// this does not modify the specified node, instead it returns the node that
1860 /// already exists. If the resultant node does not exist in the DAG, the
1861 /// input node is returned. As a degenerate case, if you specify the same
1862 /// input operands as the node already has, the input node is returned.
1863 SDOperand SelectionDAG::
1864 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1865 SDNode *N = InN.Val;
1866 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1868 // Check to see if there is no change.
1869 if (Op == N->getOperand(0)) return InN;
1871 // See if the modified node already exists.
1872 SDNode **NewSlot = FindModifiedNodeSlot(N, Op);
1873 if (NewSlot && *NewSlot)
1874 return SDOperand(*NewSlot, InN.ResNo);
1876 // Nope it doesn't. Remove the node from it's current place in the maps.
1878 RemoveNodeFromCSEMaps(N);
1880 // Now we update the operands.
1881 N->OperandList[0].Val->removeUser(N);
1883 N->OperandList[0] = Op;
1885 // If this gets put into a CSE map, add it.
1886 if (NewSlot) *NewSlot = N;
1890 SDOperand SelectionDAG::
1891 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1892 SDNode *N = InN.Val;
1893 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1895 // Check to see if there is no change.
1896 bool AnyChange = false;
1897 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1898 return InN; // No operands changed, just return the input node.
1900 // See if the modified node already exists.
1901 SDNode **NewSlot = FindModifiedNodeSlot(N, Op1, Op2);
1902 if (NewSlot && *NewSlot)
1903 return SDOperand(*NewSlot, InN.ResNo);
1905 // Nope it doesn't. Remove the node from it's current place in the maps.
1907 RemoveNodeFromCSEMaps(N);
1909 // Now we update the operands.
1910 if (N->OperandList[0] != Op1) {
1911 N->OperandList[0].Val->removeUser(N);
1912 Op1.Val->addUser(N);
1913 N->OperandList[0] = Op1;
1915 if (N->OperandList[1] != Op2) {
1916 N->OperandList[1].Val->removeUser(N);
1917 Op2.Val->addUser(N);
1918 N->OperandList[1] = Op2;
1921 // If this gets put into a CSE map, add it.
1922 if (NewSlot) *NewSlot = N;
1926 SDOperand SelectionDAG::
1927 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
1928 std::vector<SDOperand> Ops;
1932 return UpdateNodeOperands(N, Ops);
1935 SDOperand SelectionDAG::
1936 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1937 SDOperand Op3, SDOperand Op4) {
1938 std::vector<SDOperand> Ops;
1943 return UpdateNodeOperands(N, Ops);
1946 SDOperand SelectionDAG::
1947 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1948 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
1949 std::vector<SDOperand> Ops;
1955 return UpdateNodeOperands(N, Ops);
1959 SDOperand SelectionDAG::
1960 UpdateNodeOperands(SDOperand InN, const std::vector<SDOperand> &Ops) {
1961 SDNode *N = InN.Val;
1962 assert(N->getNumOperands() == Ops.size() &&
1963 "Update with wrong number of operands");
1965 // Check to see if there is no change.
1966 unsigned NumOps = Ops.size();
1967 bool AnyChange = false;
1968 for (unsigned i = 0; i != NumOps; ++i) {
1969 if (Ops[i] != N->getOperand(i)) {
1975 // No operands changed, just return the input node.
1976 if (!AnyChange) return InN;
1978 // See if the modified node already exists.
1979 SDNode **NewSlot = FindModifiedNodeSlot(N, Ops);
1980 if (NewSlot && *NewSlot)
1981 return SDOperand(*NewSlot, InN.ResNo);
1983 // Nope it doesn't. Remove the node from it's current place in the maps.
1985 RemoveNodeFromCSEMaps(N);
1987 // Now we update the operands.
1988 for (unsigned i = 0; i != NumOps; ++i) {
1989 if (N->OperandList[i] != Ops[i]) {
1990 N->OperandList[i].Val->removeUser(N);
1991 Ops[i].Val->addUser(N);
1992 N->OperandList[i] = Ops[i];
1996 // If this gets put into a CSE map, add it.
1997 if (NewSlot) *NewSlot = N;
2004 /// SelectNodeTo - These are used for target selectors to *mutate* the
2005 /// specified node to have the specified return type, Target opcode, and
2006 /// operands. Note that target opcodes are stored as
2007 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
2009 /// Note that SelectNodeTo returns the resultant node. If there is already a
2010 /// node of the specified opcode and operands, it returns that node instead of
2011 /// the current one.
2012 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2013 MVT::ValueType VT) {
2014 // If an identical node already exists, use it.
2015 SDNode *&ON = NullaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc, VT)];
2016 if (ON) return SDOperand(ON, 0);
2018 RemoveNodeFromCSEMaps(N);
2020 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2021 N->setValueTypes(VT);
2023 ON = N; // Memoize the new node.
2024 return SDOperand(N, 0);
2027 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2028 MVT::ValueType VT, SDOperand Op1) {
2029 // If an identical node already exists, use it.
2030 SDNode *&ON = UnaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2031 std::make_pair(Op1, VT))];
2032 if (ON) return SDOperand(ON, 0);
2034 RemoveNodeFromCSEMaps(N);
2035 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2036 N->setValueTypes(VT);
2037 N->setOperands(Op1);
2039 ON = N; // Memoize the new node.
2040 return SDOperand(N, 0);
2043 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2044 MVT::ValueType VT, SDOperand Op1,
2046 // If an identical node already exists, use it.
2047 SDNode *&ON = BinaryOps[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2048 std::make_pair(Op1, Op2))];
2049 if (ON) return SDOperand(ON, 0);
2051 RemoveNodeFromCSEMaps(N);
2052 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2053 N->setValueTypes(VT);
2054 N->setOperands(Op1, Op2);
2056 ON = N; // Memoize the new node.
2057 return SDOperand(N, 0);
2060 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2061 MVT::ValueType VT, SDOperand Op1,
2062 SDOperand Op2, SDOperand Op3) {
2063 // If an identical node already exists, use it.
2064 std::vector<SDOperand> OpList;
2065 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2066 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2067 std::make_pair(VT, OpList))];
2068 if (ON) return SDOperand(ON, 0);
2070 RemoveNodeFromCSEMaps(N);
2071 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2072 N->setValueTypes(VT);
2073 N->setOperands(Op1, Op2, Op3);
2075 ON = N; // Memoize the new node.
2076 return SDOperand(N, 0);
2079 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2080 MVT::ValueType VT, SDOperand Op1,
2081 SDOperand Op2, SDOperand Op3,
2083 // If an identical node already exists, use it.
2084 std::vector<SDOperand> OpList;
2085 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2086 OpList.push_back(Op4);
2087 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2088 std::make_pair(VT, OpList))];
2089 if (ON) return SDOperand(ON, 0);
2091 RemoveNodeFromCSEMaps(N);
2092 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2093 N->setValueTypes(VT);
2094 N->setOperands(Op1, Op2, Op3, Op4);
2096 ON = N; // Memoize the new node.
2097 return SDOperand(N, 0);
2100 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2101 MVT::ValueType VT, SDOperand Op1,
2102 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2104 // If an identical node already exists, use it.
2105 std::vector<SDOperand> OpList;
2106 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2107 OpList.push_back(Op4); OpList.push_back(Op5);
2108 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2109 std::make_pair(VT, OpList))];
2110 if (ON) return SDOperand(ON, 0);
2112 RemoveNodeFromCSEMaps(N);
2113 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2114 N->setValueTypes(VT);
2115 N->setOperands(Op1, Op2, Op3, Op4, Op5);
2117 ON = N; // Memoize the new node.
2118 return SDOperand(N, 0);
2121 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2122 MVT::ValueType VT, SDOperand Op1,
2123 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2124 SDOperand Op5, SDOperand Op6) {
2125 // If an identical node already exists, use it.
2126 std::vector<SDOperand> OpList;
2127 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2128 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2129 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2130 std::make_pair(VT, OpList))];
2131 if (ON) return SDOperand(ON, 0);
2133 RemoveNodeFromCSEMaps(N);
2134 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2135 N->setValueTypes(VT);
2136 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6);
2138 ON = N; // Memoize the new node.
2139 return SDOperand(N, 0);
2142 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2143 MVT::ValueType VT, SDOperand Op1,
2144 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2145 SDOperand Op5, SDOperand Op6,
2147 // If an identical node already exists, use it.
2148 std::vector<SDOperand> OpList;
2149 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2150 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2151 OpList.push_back(Op7);
2152 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2153 std::make_pair(VT, OpList))];
2154 if (ON) return SDOperand(ON, 0);
2156 RemoveNodeFromCSEMaps(N);
2157 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2158 N->setValueTypes(VT);
2159 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7);
2161 ON = N; // Memoize the new node.
2162 return SDOperand(N, 0);
2164 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2165 MVT::ValueType VT, SDOperand Op1,
2166 SDOperand Op2, SDOperand Op3,SDOperand Op4,
2167 SDOperand Op5, SDOperand Op6,
2168 SDOperand Op7, SDOperand Op8) {
2169 // If an identical node already exists, use it.
2170 std::vector<SDOperand> OpList;
2171 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2172 OpList.push_back(Op4); OpList.push_back(Op5); OpList.push_back(Op6);
2173 OpList.push_back(Op7); OpList.push_back(Op8);
2174 SDNode *&ON = OneResultNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2175 std::make_pair(VT, OpList))];
2176 if (ON) return SDOperand(ON, 0);
2178 RemoveNodeFromCSEMaps(N);
2179 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2180 N->setValueTypes(VT);
2181 N->setOperands(Op1, Op2, Op3, Op4, Op5, Op6, Op7, Op8);
2183 ON = N; // Memoize the new node.
2184 return SDOperand(N, 0);
2187 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2188 MVT::ValueType VT1, MVT::ValueType VT2,
2189 SDOperand Op1, SDOperand Op2) {
2190 // If an identical node already exists, use it.
2191 std::vector<SDOperand> OpList;
2192 OpList.push_back(Op1); OpList.push_back(Op2);
2193 std::vector<MVT::ValueType> VTList;
2194 VTList.push_back(VT1); VTList.push_back(VT2);
2195 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2196 std::make_pair(VTList, OpList))];
2197 if (ON) return SDOperand(ON, 0);
2199 RemoveNodeFromCSEMaps(N);
2200 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2201 setNodeValueTypes(N, VT1, VT2);
2202 N->setOperands(Op1, Op2);
2204 ON = N; // Memoize the new node.
2205 return SDOperand(N, 0);
2208 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2209 MVT::ValueType VT1, MVT::ValueType VT2,
2210 SDOperand Op1, SDOperand Op2,
2212 // If an identical node already exists, use it.
2213 std::vector<SDOperand> OpList;
2214 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2215 std::vector<MVT::ValueType> VTList;
2216 VTList.push_back(VT1); VTList.push_back(VT2);
2217 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2218 std::make_pair(VTList, OpList))];
2219 if (ON) return SDOperand(ON, 0);
2221 RemoveNodeFromCSEMaps(N);
2222 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2223 setNodeValueTypes(N, VT1, VT2);
2224 N->setOperands(Op1, Op2, Op3);
2226 ON = N; // Memoize the new node.
2227 return SDOperand(N, 0);
2230 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2231 MVT::ValueType VT1, MVT::ValueType VT2,
2232 SDOperand Op1, SDOperand Op2,
2233 SDOperand Op3, SDOperand Op4) {
2234 // If an identical node already exists, use it.
2235 std::vector<SDOperand> OpList;
2236 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2237 OpList.push_back(Op4);
2238 std::vector<MVT::ValueType> VTList;
2239 VTList.push_back(VT1); VTList.push_back(VT2);
2240 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2241 std::make_pair(VTList, OpList))];
2242 if (ON) return SDOperand(ON, 0);
2244 RemoveNodeFromCSEMaps(N);
2245 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2246 setNodeValueTypes(N, VT1, VT2);
2247 N->setOperands(Op1, Op2, Op3, Op4);
2249 ON = N; // Memoize the new node.
2250 return SDOperand(N, 0);
2253 SDOperand SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2254 MVT::ValueType VT1, MVT::ValueType VT2,
2255 SDOperand Op1, SDOperand Op2,
2256 SDOperand Op3, SDOperand Op4,
2258 // If an identical node already exists, use it.
2259 std::vector<SDOperand> OpList;
2260 OpList.push_back(Op1); OpList.push_back(Op2); OpList.push_back(Op3);
2261 OpList.push_back(Op4); OpList.push_back(Op5);
2262 std::vector<MVT::ValueType> VTList;
2263 VTList.push_back(VT1); VTList.push_back(VT2);
2264 SDNode *&ON = ArbitraryNodes[std::make_pair(ISD::BUILTIN_OP_END+TargetOpc,
2265 std::make_pair(VTList, OpList))];
2266 if (ON) return SDOperand(ON, 0);
2268 RemoveNodeFromCSEMaps(N);
2269 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2270 setNodeValueTypes(N, VT1, VT2);
2271 N->setOperands(Op1, Op2, Op3, Op4, Op5);
2273 ON = N; // Memoize the new node.
2274 return SDOperand(N, 0);
2277 /// getTargetNode - These are used for target selectors to create a new node
2278 /// with specified return type(s), target opcode, and operands.
2280 /// Note that getTargetNode returns the resultant node. If there is already a
2281 /// node of the specified opcode and operands, it returns that node instead of
2282 /// the current one.
2283 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2284 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2286 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2288 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2290 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2291 SDOperand Op1, SDOperand Op2) {
2292 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2294 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2295 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2296 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2298 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2299 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2301 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4).Val;
2303 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2304 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2305 SDOperand Op4, SDOperand Op5) {
2306 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3, Op4, Op5).Val;
2308 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2309 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2310 SDOperand Op4, SDOperand Op5, SDOperand Op6) {
2311 std::vector<SDOperand> Ops;
2319 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2321 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2322 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2323 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2325 std::vector<SDOperand> Ops;
2334 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2336 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2337 SDOperand Op1, SDOperand Op2, SDOperand Op3,
2338 SDOperand Op4, SDOperand Op5, SDOperand Op6,
2339 SDOperand Op7, SDOperand Op8) {
2340 std::vector<SDOperand> Ops;
2350 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2352 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2353 std::vector<SDOperand> &Ops) {
2354 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops).Val;
2356 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2357 MVT::ValueType VT2, SDOperand Op1) {
2358 std::vector<MVT::ValueType> ResultTys;
2359 ResultTys.push_back(VT1);
2360 ResultTys.push_back(VT2);
2361 std::vector<SDOperand> Ops;
2363 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2365 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2366 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2) {
2367 std::vector<MVT::ValueType> ResultTys;
2368 ResultTys.push_back(VT1);
2369 ResultTys.push_back(VT2);
2370 std::vector<SDOperand> Ops;
2373 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2375 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2376 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2378 std::vector<MVT::ValueType> ResultTys;
2379 ResultTys.push_back(VT1);
2380 ResultTys.push_back(VT2);
2381 std::vector<SDOperand> Ops;
2385 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2387 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2388 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2389 SDOperand Op3, SDOperand Op4) {
2390 std::vector<MVT::ValueType> ResultTys;
2391 ResultTys.push_back(VT1);
2392 ResultTys.push_back(VT2);
2393 std::vector<SDOperand> Ops;
2398 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2400 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2401 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2402 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2403 std::vector<MVT::ValueType> ResultTys;
2404 ResultTys.push_back(VT1);
2405 ResultTys.push_back(VT2);
2406 std::vector<SDOperand> Ops;
2412 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2414 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2415 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2416 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2418 std::vector<MVT::ValueType> ResultTys;
2419 ResultTys.push_back(VT1);
2420 ResultTys.push_back(VT2);
2421 std::vector<SDOperand> Ops;
2428 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2430 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2431 MVT::ValueType VT2, SDOperand Op1, SDOperand Op2,
2432 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2433 SDOperand Op6, SDOperand Op7) {
2434 std::vector<MVT::ValueType> ResultTys;
2435 ResultTys.push_back(VT1);
2436 ResultTys.push_back(VT2);
2437 std::vector<SDOperand> Ops;
2445 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2447 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2448 MVT::ValueType VT2, MVT::ValueType VT3,
2449 SDOperand Op1, SDOperand Op2) {
2450 std::vector<MVT::ValueType> ResultTys;
2451 ResultTys.push_back(VT1);
2452 ResultTys.push_back(VT2);
2453 ResultTys.push_back(VT3);
2454 std::vector<SDOperand> Ops;
2457 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2459 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2460 MVT::ValueType VT2, MVT::ValueType VT3,
2461 SDOperand Op1, SDOperand Op2,
2462 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2463 std::vector<MVT::ValueType> ResultTys;
2464 ResultTys.push_back(VT1);
2465 ResultTys.push_back(VT2);
2466 ResultTys.push_back(VT3);
2467 std::vector<SDOperand> Ops;
2473 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2475 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2476 MVT::ValueType VT2, MVT::ValueType VT3,
2477 SDOperand Op1, SDOperand Op2,
2478 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2480 std::vector<MVT::ValueType> ResultTys;
2481 ResultTys.push_back(VT1);
2482 ResultTys.push_back(VT2);
2483 ResultTys.push_back(VT3);
2484 std::vector<SDOperand> Ops;
2491 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2493 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2494 MVT::ValueType VT2, MVT::ValueType VT3,
2495 SDOperand Op1, SDOperand Op2,
2496 SDOperand Op3, SDOperand Op4, SDOperand Op5,
2497 SDOperand Op6, SDOperand Op7) {
2498 std::vector<MVT::ValueType> ResultTys;
2499 ResultTys.push_back(VT1);
2500 ResultTys.push_back(VT2);
2501 ResultTys.push_back(VT3);
2502 std::vector<SDOperand> Ops;
2510 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2512 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2513 MVT::ValueType VT2, std::vector<SDOperand> &Ops) {
2514 std::vector<MVT::ValueType> ResultTys;
2515 ResultTys.push_back(VT1);
2516 ResultTys.push_back(VT2);
2517 return getNode(ISD::BUILTIN_OP_END+Opcode, ResultTys, Ops).Val;
2520 // ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2521 /// This can cause recursive merging of nodes in the DAG.
2523 /// This version assumes From/To have a single result value.
2525 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2526 std::vector<SDNode*> *Deleted) {
2527 SDNode *From = FromN.Val, *To = ToN.Val;
2528 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2529 "Cannot replace with this method!");
2530 assert(From != To && "Cannot replace uses of with self");
2532 while (!From->use_empty()) {
2533 // Process users until they are all gone.
2534 SDNode *U = *From->use_begin();
2536 // This node is about to morph, remove its old self from the CSE maps.
2537 RemoveNodeFromCSEMaps(U);
2539 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2541 if (I->Val == From) {
2542 From->removeUser(U);
2547 // Now that we have modified U, add it back to the CSE maps. If it already
2548 // exists there, recursively merge the results together.
2549 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2550 ReplaceAllUsesWith(U, Existing, Deleted);
2552 if (Deleted) Deleted->push_back(U);
2553 DeleteNodeNotInCSEMaps(U);
2558 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2559 /// This can cause recursive merging of nodes in the DAG.
2561 /// This version assumes From/To have matching types and numbers of result
2564 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2565 std::vector<SDNode*> *Deleted) {
2566 assert(From != To && "Cannot replace uses of with self");
2567 assert(From->getNumValues() == To->getNumValues() &&
2568 "Cannot use this version of ReplaceAllUsesWith!");
2569 if (From->getNumValues() == 1) { // If possible, use the faster version.
2570 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
2574 while (!From->use_empty()) {
2575 // Process users until they are all gone.
2576 SDNode *U = *From->use_begin();
2578 // This node is about to morph, remove its old self from the CSE maps.
2579 RemoveNodeFromCSEMaps(U);
2581 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2583 if (I->Val == From) {
2584 From->removeUser(U);
2589 // Now that we have modified U, add it back to the CSE maps. If it already
2590 // exists there, recursively merge the results together.
2591 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2592 ReplaceAllUsesWith(U, Existing, Deleted);
2594 if (Deleted) Deleted->push_back(U);
2595 DeleteNodeNotInCSEMaps(U);
2600 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2601 /// This can cause recursive merging of nodes in the DAG.
2603 /// This version can replace From with any result values. To must match the
2604 /// number and types of values returned by From.
2605 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2606 const std::vector<SDOperand> &To,
2607 std::vector<SDNode*> *Deleted) {
2608 assert(From->getNumValues() == To.size() &&
2609 "Incorrect number of values to replace with!");
2610 if (To.size() == 1 && To[0].Val->getNumValues() == 1) {
2611 // Degenerate case handled above.
2612 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2616 while (!From->use_empty()) {
2617 // Process users until they are all gone.
2618 SDNode *U = *From->use_begin();
2620 // This node is about to morph, remove its old self from the CSE maps.
2621 RemoveNodeFromCSEMaps(U);
2623 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2625 if (I->Val == From) {
2626 const SDOperand &ToOp = To[I->ResNo];
2627 From->removeUser(U);
2629 ToOp.Val->addUser(U);
2632 // Now that we have modified U, add it back to the CSE maps. If it already
2633 // exists there, recursively merge the results together.
2634 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2635 ReplaceAllUsesWith(U, Existing, Deleted);
2637 if (Deleted) Deleted->push_back(U);
2638 DeleteNodeNotInCSEMaps(U);
2643 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2644 /// uses of other values produced by From.Val alone. The Deleted vector is
2645 /// handled the same was as for ReplaceAllUsesWith.
2646 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2647 std::vector<SDNode*> &Deleted) {
2648 assert(From != To && "Cannot replace a value with itself");
2649 // Handle the simple, trivial, case efficiently.
2650 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2651 ReplaceAllUsesWith(From, To, &Deleted);
2655 // Get all of the users in a nice, deterministically ordered, uniqued set.
2656 SetVector<SDNode*> Users(From.Val->use_begin(), From.Val->use_end());
2658 while (!Users.empty()) {
2659 // We know that this user uses some value of From. If it is the right
2660 // value, update it.
2661 SDNode *User = Users.back();
2664 for (SDOperand *Op = User->OperandList,
2665 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2667 // Okay, we know this user needs to be updated. Remove its old self
2668 // from the CSE maps.
2669 RemoveNodeFromCSEMaps(User);
2671 // Update all operands that match "From".
2672 for (; Op != E; ++Op) {
2674 From.Val->removeUser(User);
2676 To.Val->addUser(User);
2680 // Now that we have modified User, add it back to the CSE maps. If it
2681 // already exists there, recursively merge the results together.
2682 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2683 unsigned NumDeleted = Deleted.size();
2684 ReplaceAllUsesWith(User, Existing, &Deleted);
2686 // User is now dead.
2687 Deleted.push_back(User);
2688 DeleteNodeNotInCSEMaps(User);
2690 // We have to be careful here, because ReplaceAllUsesWith could have
2691 // deleted a user of From, which means there may be dangling pointers
2692 // in the "Users" setvector. Scan over the deleted node pointers and
2693 // remove them from the setvector.
2694 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2695 Users.remove(Deleted[i]);
2697 break; // Exit the operand scanning loop.
2704 //===----------------------------------------------------------------------===//
2706 //===----------------------------------------------------------------------===//
2709 /// getValueTypeList - Return a pointer to the specified value type.
2711 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2712 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2717 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2718 /// indicated value. This method ignores uses of other values defined by this
2720 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2721 assert(Value < getNumValues() && "Bad value!");
2723 // If there is only one value, this is easy.
2724 if (getNumValues() == 1)
2725 return use_size() == NUses;
2726 if (Uses.size() < NUses) return false;
2728 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2730 std::set<SDNode*> UsersHandled;
2732 for (std::vector<SDNode*>::const_iterator UI = Uses.begin(), E = Uses.end();
2735 if (User->getNumOperands() == 1 ||
2736 UsersHandled.insert(User).second) // First time we've seen this?
2737 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2738 if (User->getOperand(i) == TheValue) {
2740 return false; // too many uses
2745 // Found exactly the right number of uses?
2750 // isOnlyUse - Return true if this node is the only use of N.
2751 bool SDNode::isOnlyUse(SDNode *N) const {
2753 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2764 // isOperand - Return true if this node is an operand of N.
2765 bool SDOperand::isOperand(SDNode *N) const {
2766 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2767 if (*this == N->getOperand(i))
2772 bool SDNode::isOperand(SDNode *N) const {
2773 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2774 if (this == N->OperandList[i].Val)
2779 const char *SDNode::getOperationName(const SelectionDAG *G) const {
2780 switch (getOpcode()) {
2782 if (getOpcode() < ISD::BUILTIN_OP_END)
2783 return "<<Unknown DAG Node>>";
2786 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2787 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2788 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2790 TargetLowering &TLI = G->getTargetLoweringInfo();
2792 TLI.getTargetNodeName(getOpcode());
2793 if (Name) return Name;
2796 return "<<Unknown Target Node>>";
2799 case ISD::PCMARKER: return "PCMarker";
2800 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2801 case ISD::SRCVALUE: return "SrcValue";
2802 case ISD::EntryToken: return "EntryToken";
2803 case ISD::TokenFactor: return "TokenFactor";
2804 case ISD::AssertSext: return "AssertSext";
2805 case ISD::AssertZext: return "AssertZext";
2807 case ISD::STRING: return "String";
2808 case ISD::BasicBlock: return "BasicBlock";
2809 case ISD::VALUETYPE: return "ValueType";
2810 case ISD::Register: return "Register";
2812 case ISD::Constant: return "Constant";
2813 case ISD::ConstantFP: return "ConstantFP";
2814 case ISD::GlobalAddress: return "GlobalAddress";
2815 case ISD::FrameIndex: return "FrameIndex";
2816 case ISD::JumpTable: return "JumpTable";
2817 case ISD::ConstantPool: return "ConstantPool";
2818 case ISD::ExternalSymbol: return "ExternalSymbol";
2819 case ISD::INTRINSIC_WO_CHAIN: {
2820 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2821 return Intrinsic::getName((Intrinsic::ID)IID);
2823 case ISD::INTRINSIC_VOID:
2824 case ISD::INTRINSIC_W_CHAIN: {
2825 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2826 return Intrinsic::getName((Intrinsic::ID)IID);
2829 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2830 case ISD::TargetConstant: return "TargetConstant";
2831 case ISD::TargetConstantFP:return "TargetConstantFP";
2832 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2833 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2834 case ISD::TargetJumpTable: return "TargetJumpTable";
2835 case ISD::TargetConstantPool: return "TargetConstantPool";
2836 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2838 case ISD::CopyToReg: return "CopyToReg";
2839 case ISD::CopyFromReg: return "CopyFromReg";
2840 case ISD::UNDEF: return "undef";
2841 case ISD::MERGE_VALUES: return "mergevalues";
2842 case ISD::INLINEASM: return "inlineasm";
2843 case ISD::HANDLENODE: return "handlenode";
2844 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
2847 case ISD::FABS: return "fabs";
2848 case ISD::FNEG: return "fneg";
2849 case ISD::FSQRT: return "fsqrt";
2850 case ISD::FSIN: return "fsin";
2851 case ISD::FCOS: return "fcos";
2854 case ISD::ADD: return "add";
2855 case ISD::SUB: return "sub";
2856 case ISD::MUL: return "mul";
2857 case ISD::MULHU: return "mulhu";
2858 case ISD::MULHS: return "mulhs";
2859 case ISD::SDIV: return "sdiv";
2860 case ISD::UDIV: return "udiv";
2861 case ISD::SREM: return "srem";
2862 case ISD::UREM: return "urem";
2863 case ISD::AND: return "and";
2864 case ISD::OR: return "or";
2865 case ISD::XOR: return "xor";
2866 case ISD::SHL: return "shl";
2867 case ISD::SRA: return "sra";
2868 case ISD::SRL: return "srl";
2869 case ISD::ROTL: return "rotl";
2870 case ISD::ROTR: return "rotr";
2871 case ISD::FADD: return "fadd";
2872 case ISD::FSUB: return "fsub";
2873 case ISD::FMUL: return "fmul";
2874 case ISD::FDIV: return "fdiv";
2875 case ISD::FREM: return "frem";
2876 case ISD::FCOPYSIGN: return "fcopysign";
2877 case ISD::VADD: return "vadd";
2878 case ISD::VSUB: return "vsub";
2879 case ISD::VMUL: return "vmul";
2880 case ISD::VSDIV: return "vsdiv";
2881 case ISD::VUDIV: return "vudiv";
2882 case ISD::VAND: return "vand";
2883 case ISD::VOR: return "vor";
2884 case ISD::VXOR: return "vxor";
2886 case ISD::SETCC: return "setcc";
2887 case ISD::SELECT: return "select";
2888 case ISD::SELECT_CC: return "select_cc";
2889 case ISD::VSELECT: return "vselect";
2890 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2891 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2892 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2893 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2894 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2895 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2896 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2897 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2898 case ISD::VBIT_CONVERT: return "vbit_convert";
2899 case ISD::ADDC: return "addc";
2900 case ISD::ADDE: return "adde";
2901 case ISD::SUBC: return "subc";
2902 case ISD::SUBE: return "sube";
2903 case ISD::SHL_PARTS: return "shl_parts";
2904 case ISD::SRA_PARTS: return "sra_parts";
2905 case ISD::SRL_PARTS: return "srl_parts";
2907 // Conversion operators.
2908 case ISD::SIGN_EXTEND: return "sign_extend";
2909 case ISD::ZERO_EXTEND: return "zero_extend";
2910 case ISD::ANY_EXTEND: return "any_extend";
2911 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2912 case ISD::TRUNCATE: return "truncate";
2913 case ISD::FP_ROUND: return "fp_round";
2914 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2915 case ISD::FP_EXTEND: return "fp_extend";
2917 case ISD::SINT_TO_FP: return "sint_to_fp";
2918 case ISD::UINT_TO_FP: return "uint_to_fp";
2919 case ISD::FP_TO_SINT: return "fp_to_sint";
2920 case ISD::FP_TO_UINT: return "fp_to_uint";
2921 case ISD::BIT_CONVERT: return "bit_convert";
2923 // Control flow instructions
2924 case ISD::BR: return "br";
2925 case ISD::BRIND: return "brind";
2926 case ISD::BRCOND: return "brcond";
2927 case ISD::BR_CC: return "br_cc";
2928 case ISD::RET: return "ret";
2929 case ISD::CALLSEQ_START: return "callseq_start";
2930 case ISD::CALLSEQ_END: return "callseq_end";
2933 case ISD::LOAD: return "load";
2934 case ISD::STORE: return "store";
2935 case ISD::VLOAD: return "vload";
2936 case ISD::EXTLOAD: return "extload";
2937 case ISD::SEXTLOAD: return "sextload";
2938 case ISD::ZEXTLOAD: return "zextload";
2939 case ISD::TRUNCSTORE: return "truncstore";
2940 case ISD::VAARG: return "vaarg";
2941 case ISD::VACOPY: return "vacopy";
2942 case ISD::VAEND: return "vaend";
2943 case ISD::VASTART: return "vastart";
2944 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2945 case ISD::EXTRACT_ELEMENT: return "extract_element";
2946 case ISD::BUILD_PAIR: return "build_pair";
2947 case ISD::STACKSAVE: return "stacksave";
2948 case ISD::STACKRESTORE: return "stackrestore";
2950 // Block memory operations.
2951 case ISD::MEMSET: return "memset";
2952 case ISD::MEMCPY: return "memcpy";
2953 case ISD::MEMMOVE: return "memmove";
2956 case ISD::BSWAP: return "bswap";
2957 case ISD::CTPOP: return "ctpop";
2958 case ISD::CTTZ: return "cttz";
2959 case ISD::CTLZ: return "ctlz";
2962 case ISD::LOCATION: return "location";
2963 case ISD::DEBUG_LOC: return "debug_loc";
2964 case ISD::DEBUG_LABEL: return "debug_label";
2967 switch (cast<CondCodeSDNode>(this)->get()) {
2968 default: assert(0 && "Unknown setcc condition!");
2969 case ISD::SETOEQ: return "setoeq";
2970 case ISD::SETOGT: return "setogt";
2971 case ISD::SETOGE: return "setoge";
2972 case ISD::SETOLT: return "setolt";
2973 case ISD::SETOLE: return "setole";
2974 case ISD::SETONE: return "setone";
2976 case ISD::SETO: return "seto";
2977 case ISD::SETUO: return "setuo";
2978 case ISD::SETUEQ: return "setue";
2979 case ISD::SETUGT: return "setugt";
2980 case ISD::SETUGE: return "setuge";
2981 case ISD::SETULT: return "setult";
2982 case ISD::SETULE: return "setule";
2983 case ISD::SETUNE: return "setune";
2985 case ISD::SETEQ: return "seteq";
2986 case ISD::SETGT: return "setgt";
2987 case ISD::SETGE: return "setge";
2988 case ISD::SETLT: return "setlt";
2989 case ISD::SETLE: return "setle";
2990 case ISD::SETNE: return "setne";
2995 void SDNode::dump() const { dump(0); }
2996 void SDNode::dump(const SelectionDAG *G) const {
2997 std::cerr << (void*)this << ": ";
2999 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
3000 if (i) std::cerr << ",";
3001 if (getValueType(i) == MVT::Other)
3004 std::cerr << MVT::getValueTypeString(getValueType(i));
3006 std::cerr << " = " << getOperationName(G);
3009 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
3010 if (i) std::cerr << ", ";
3011 std::cerr << (void*)getOperand(i).Val;
3012 if (unsigned RN = getOperand(i).ResNo)
3013 std::cerr << ":" << RN;
3016 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
3017 std::cerr << "<" << CSDN->getValue() << ">";
3018 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
3019 std::cerr << "<" << CSDN->getValue() << ">";
3020 } else if (const GlobalAddressSDNode *GADN =
3021 dyn_cast<GlobalAddressSDNode>(this)) {
3022 int offset = GADN->getOffset();
3024 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
3026 std::cerr << " + " << offset;
3028 std::cerr << " " << offset;
3029 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
3030 std::cerr << "<" << FIDN->getIndex() << ">";
3031 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
3032 int offset = CP->getOffset();
3033 std::cerr << "<" << *CP->get() << ">";
3035 std::cerr << " + " << offset;
3037 std::cerr << " " << offset;
3038 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
3040 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
3042 std::cerr << LBB->getName() << " ";
3043 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
3044 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
3045 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
3046 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
3048 std::cerr << " #" << R->getReg();
3050 } else if (const ExternalSymbolSDNode *ES =
3051 dyn_cast<ExternalSymbolSDNode>(this)) {
3052 std::cerr << "'" << ES->getSymbol() << "'";
3053 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
3055 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
3057 std::cerr << "<null:" << M->getOffset() << ">";
3058 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
3059 std::cerr << ":" << getValueTypeString(N->getVT());
3063 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
3064 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3065 if (N->getOperand(i).Val->hasOneUse())
3066 DumpNodes(N->getOperand(i).Val, indent+2, G);
3068 std::cerr << "\n" << std::string(indent+2, ' ')
3069 << (void*)N->getOperand(i).Val << ": <multiple use>";
3072 std::cerr << "\n" << std::string(indent, ' ');
3076 void SelectionDAG::dump() const {
3077 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
3078 std::vector<const SDNode*> Nodes;
3079 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
3083 std::sort(Nodes.begin(), Nodes.end());
3085 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
3086 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
3087 DumpNodes(Nodes[i], 2, this);
3090 DumpNodes(getRoot().Val, 2, this);
3092 std::cerr << "\n\n";
3095 /// InsertISelMapEntry - A helper function to insert a key / element pair
3096 /// into a SDOperand to SDOperand map. This is added to avoid the map
3097 /// insertion operator from being inlined.
3098 void SelectionDAG::InsertISelMapEntry(std::map<SDOperand, SDOperand> &Map,
3099 SDNode *Key, unsigned KeyResNo,
3100 SDNode *Element, unsigned ElementResNo) {
3101 Map.insert(std::make_pair(SDOperand(Key, KeyResNo),
3102 SDOperand(Element, ElementResNo)));