1 //===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the SelectionDAG class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/CodeGen/SelectionDAG.h"
15 #include "llvm/Constants.h"
16 #include "llvm/GlobalValue.h"
17 #include "llvm/Intrinsics.h"
18 #include "llvm/Assembly/Writer.h"
19 #include "llvm/CodeGen/MachineBasicBlock.h"
20 #include "llvm/CodeGen/MachineConstantPool.h"
21 #include "llvm/Support/MathExtras.h"
22 #include "llvm/Target/MRegisterInfo.h"
23 #include "llvm/Target/TargetLowering.h"
24 #include "llvm/Target/TargetInstrInfo.h"
25 #include "llvm/Target/TargetMachine.h"
26 #include "llvm/ADT/SetVector.h"
27 #include "llvm/ADT/SmallPtrSet.h"
28 #include "llvm/ADT/SmallVector.h"
29 #include "llvm/ADT/StringExtras.h"
34 /// makeVTList - Return an instance of the SDVTList struct initialized with the
35 /// specified members.
36 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
37 SDVTList Res = {VTs, NumVTs};
41 //===----------------------------------------------------------------------===//
42 // ConstantFPSDNode Class
43 //===----------------------------------------------------------------------===//
45 /// isExactlyValue - We don't rely on operator== working on double values, as
46 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
47 /// As such, this method can be used to do an exact bit-for-bit comparison of
48 /// two floating point values.
49 bool ConstantFPSDNode::isExactlyValue(double V) const {
50 return DoubleToBits(V) == DoubleToBits(Value);
53 //===----------------------------------------------------------------------===//
55 //===----------------------------------------------------------------------===//
57 /// isBuildVectorAllOnes - Return true if the specified node is a
58 /// BUILD_VECTOR where all of the elements are ~0 or undef.
59 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
60 // Look through a bit convert.
61 if (N->getOpcode() == ISD::BIT_CONVERT)
62 N = N->getOperand(0).Val;
64 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
66 unsigned i = 0, e = N->getNumOperands();
68 // Skip over all of the undef values.
69 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
72 // Do not accept an all-undef vector.
73 if (i == e) return false;
75 // Do not accept build_vectors that aren't all constants or which have non-~0
77 SDOperand NotZero = N->getOperand(i);
78 if (isa<ConstantSDNode>(NotZero)) {
79 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
81 } else if (isa<ConstantFPSDNode>(NotZero)) {
82 MVT::ValueType VT = NotZero.getValueType();
84 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
88 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
95 // Okay, we have at least one ~0 value, check to see if the rest match or are
97 for (++i; i != e; ++i)
98 if (N->getOperand(i) != NotZero &&
99 N->getOperand(i).getOpcode() != ISD::UNDEF)
105 /// isBuildVectorAllZeros - Return true if the specified node is a
106 /// BUILD_VECTOR where all of the elements are 0 or undef.
107 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
108 // Look through a bit convert.
109 if (N->getOpcode() == ISD::BIT_CONVERT)
110 N = N->getOperand(0).Val;
112 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
114 unsigned i = 0, e = N->getNumOperands();
116 // Skip over all of the undef values.
117 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
120 // Do not accept an all-undef vector.
121 if (i == e) return false;
123 // Do not accept build_vectors that aren't all constants or which have non-~0
125 SDOperand Zero = N->getOperand(i);
126 if (isa<ConstantSDNode>(Zero)) {
127 if (!cast<ConstantSDNode>(Zero)->isNullValue())
129 } else if (isa<ConstantFPSDNode>(Zero)) {
130 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0))
135 // Okay, we have at least one ~0 value, check to see if the rest match or are
137 for (++i; i != e; ++i)
138 if (N->getOperand(i) != Zero &&
139 N->getOperand(i).getOpcode() != ISD::UNDEF)
144 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
145 /// when given the operation for (X op Y).
146 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
147 // To perform this operation, we just need to swap the L and G bits of the
149 unsigned OldL = (Operation >> 2) & 1;
150 unsigned OldG = (Operation >> 1) & 1;
151 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
152 (OldL << 1) | // New G bit
153 (OldG << 2)); // New L bit.
156 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
157 /// 'op' is a valid SetCC operation.
158 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
159 unsigned Operation = Op;
161 Operation ^= 7; // Flip L, G, E bits, but not U.
163 Operation ^= 15; // Flip all of the condition bits.
164 if (Operation > ISD::SETTRUE2)
165 Operation &= ~8; // Don't let N and U bits get set.
166 return ISD::CondCode(Operation);
170 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
171 /// signed operation and 2 if the result is an unsigned comparison. Return zero
172 /// if the operation does not depend on the sign of the input (setne and seteq).
173 static int isSignedOp(ISD::CondCode Opcode) {
175 default: assert(0 && "Illegal integer setcc operation!");
177 case ISD::SETNE: return 0;
181 case ISD::SETGE: return 1;
185 case ISD::SETUGE: return 2;
189 /// getSetCCOrOperation - Return the result of a logical OR between different
190 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
191 /// returns SETCC_INVALID if it is not possible to represent the resultant
193 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
195 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
196 // Cannot fold a signed integer setcc with an unsigned integer setcc.
197 return ISD::SETCC_INVALID;
199 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
201 // If the N and U bits get set then the resultant comparison DOES suddenly
202 // care about orderedness, and is true when ordered.
203 if (Op > ISD::SETTRUE2)
204 Op &= ~16; // Clear the U bit if the N bit is set.
206 // Canonicalize illegal integer setcc's.
207 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
210 return ISD::CondCode(Op);
213 /// getSetCCAndOperation - Return the result of a logical AND between different
214 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
215 /// function returns zero if it is not possible to represent the resultant
217 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
219 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
220 // Cannot fold a signed setcc with an unsigned setcc.
221 return ISD::SETCC_INVALID;
223 // Combine all of the condition bits.
224 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
226 // Canonicalize illegal integer setcc's.
230 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
231 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
232 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
233 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
240 const TargetMachine &SelectionDAG::getTarget() const {
241 return TLI.getTargetMachine();
244 //===----------------------------------------------------------------------===//
245 // SDNode Profile Support
246 //===----------------------------------------------------------------------===//
248 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
250 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
254 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
255 /// solely with their pointer.
256 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
257 ID.AddPointer(VTList.VTs);
260 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
262 static void AddNodeIDOperands(FoldingSetNodeID &ID,
263 const SDOperand *Ops, unsigned NumOps) {
264 for (; NumOps; --NumOps, ++Ops) {
265 ID.AddPointer(Ops->Val);
266 ID.AddInteger(Ops->ResNo);
270 static void AddNodeIDNode(FoldingSetNodeID &ID,
271 unsigned short OpC, SDVTList VTList,
272 const SDOperand *OpList, unsigned N) {
273 AddNodeIDOpcode(ID, OpC);
274 AddNodeIDValueTypes(ID, VTList);
275 AddNodeIDOperands(ID, OpList, N);
278 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
280 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
281 AddNodeIDOpcode(ID, N->getOpcode());
282 // Add the return value info.
283 AddNodeIDValueTypes(ID, N->getVTList());
284 // Add the operand info.
285 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
287 // Handle SDNode leafs with special info.
288 if (N->getNumOperands() == 0) {
289 switch (N->getOpcode()) {
290 default: break; // Normal nodes don't need extra info.
291 case ISD::TargetConstant:
293 ID.AddInteger(cast<ConstantSDNode>(N)->getValue());
295 case ISD::TargetConstantFP:
296 case ISD::ConstantFP:
297 ID.AddDouble(cast<ConstantFPSDNode>(N)->getValue());
299 case ISD::TargetGlobalAddress:
300 case ISD::GlobalAddress: {
301 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
302 ID.AddPointer(GA->getGlobal());
303 ID.AddInteger(GA->getOffset());
306 case ISD::BasicBlock:
307 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
310 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
312 case ISD::SRCVALUE: {
313 SrcValueSDNode *SV = cast<SrcValueSDNode>(N);
314 ID.AddPointer(SV->getValue());
315 ID.AddInteger(SV->getOffset());
318 case ISD::FrameIndex:
319 case ISD::TargetFrameIndex:
320 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
323 case ISD::TargetJumpTable:
324 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
326 case ISD::ConstantPool:
327 case ISD::TargetConstantPool: {
328 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
329 ID.AddInteger(CP->getAlignment());
330 ID.AddInteger(CP->getOffset());
331 if (CP->isMachineConstantPoolEntry())
332 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
334 ID.AddPointer(CP->getConstVal());
338 LoadSDNode *LD = cast<LoadSDNode>(N);
339 ID.AddInteger(LD->getAddressingMode());
340 ID.AddInteger(LD->getExtensionType());
341 ID.AddInteger(LD->getLoadedVT());
342 ID.AddPointer(LD->getSrcValue());
343 ID.AddInteger(LD->getSrcValueOffset());
344 ID.AddInteger(LD->getAlignment());
345 ID.AddInteger(LD->isVolatile());
349 StoreSDNode *ST = cast<StoreSDNode>(N);
350 ID.AddInteger(ST->getAddressingMode());
351 ID.AddInteger(ST->isTruncatingStore());
352 ID.AddInteger(ST->getStoredVT());
353 ID.AddPointer(ST->getSrcValue());
354 ID.AddInteger(ST->getSrcValueOffset());
355 ID.AddInteger(ST->getAlignment());
356 ID.AddInteger(ST->isVolatile());
363 //===----------------------------------------------------------------------===//
364 // SelectionDAG Class
365 //===----------------------------------------------------------------------===//
367 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
369 void SelectionDAG::RemoveDeadNodes() {
370 // Create a dummy node (which is not added to allnodes), that adds a reference
371 // to the root node, preventing it from being deleted.
372 HandleSDNode Dummy(getRoot());
374 SmallVector<SDNode*, 128> DeadNodes;
376 // Add all obviously-dead nodes to the DeadNodes worklist.
377 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
379 DeadNodes.push_back(I);
381 // Process the worklist, deleting the nodes and adding their uses to the
383 while (!DeadNodes.empty()) {
384 SDNode *N = DeadNodes.back();
385 DeadNodes.pop_back();
387 // Take the node out of the appropriate CSE map.
388 RemoveNodeFromCSEMaps(N);
390 // Next, brutally remove the operand list. This is safe to do, as there are
391 // no cycles in the graph.
392 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
393 SDNode *Operand = I->Val;
394 Operand->removeUser(N);
396 // Now that we removed this operand, see if there are no uses of it left.
397 if (Operand->use_empty())
398 DeadNodes.push_back(Operand);
400 if (N->OperandsNeedDelete)
401 delete[] N->OperandList;
405 // Finally, remove N itself.
409 // If the root changed (e.g. it was a dead load, update the root).
410 setRoot(Dummy.getValue());
413 void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) {
414 SmallVector<SDNode*, 16> DeadNodes;
415 DeadNodes.push_back(N);
417 // Process the worklist, deleting the nodes and adding their uses to the
419 while (!DeadNodes.empty()) {
420 SDNode *N = DeadNodes.back();
421 DeadNodes.pop_back();
423 // Take the node out of the appropriate CSE map.
424 RemoveNodeFromCSEMaps(N);
426 // Next, brutally remove the operand list. This is safe to do, as there are
427 // no cycles in the graph.
428 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
429 SDNode *Operand = I->Val;
430 Operand->removeUser(N);
432 // Now that we removed this operand, see if there are no uses of it left.
433 if (Operand->use_empty())
434 DeadNodes.push_back(Operand);
436 if (N->OperandsNeedDelete)
437 delete[] N->OperandList;
441 // Finally, remove N itself.
442 Deleted.push_back(N);
447 void SelectionDAG::DeleteNode(SDNode *N) {
448 assert(N->use_empty() && "Cannot delete a node that is not dead!");
450 // First take this out of the appropriate CSE map.
451 RemoveNodeFromCSEMaps(N);
453 // Finally, remove uses due to operands of this node, remove from the
454 // AllNodes list, and delete the node.
455 DeleteNodeNotInCSEMaps(N);
458 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
460 // Remove it from the AllNodes list.
463 // Drop all of the operands and decrement used nodes use counts.
464 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
465 I->Val->removeUser(N);
466 if (N->OperandsNeedDelete)
467 delete[] N->OperandList;
474 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
475 /// correspond to it. This is useful when we're about to delete or repurpose
476 /// the node. We don't want future request for structurally identical nodes
477 /// to return N anymore.
478 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
480 switch (N->getOpcode()) {
481 case ISD::HANDLENODE: return; // noop.
483 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
486 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
487 "Cond code doesn't exist!");
488 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
489 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
491 case ISD::ExternalSymbol:
492 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
494 case ISD::TargetExternalSymbol:
496 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
499 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
500 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
503 // Remove it from the CSE Map.
504 Erased = CSEMap.RemoveNode(N);
508 // Verify that the node was actually in one of the CSE maps, unless it has a
509 // flag result (which cannot be CSE'd) or is one of the special cases that are
510 // not subject to CSE.
511 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
512 !N->isTargetOpcode()) {
515 assert(0 && "Node is not in map!");
520 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
521 /// has been taken out and modified in some way. If the specified node already
522 /// exists in the CSE maps, do not modify the maps, but return the existing node
523 /// instead. If it doesn't exist, add it and return null.
525 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
526 assert(N->getNumOperands() && "This is a leaf node!");
527 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
528 return 0; // Never add these nodes.
530 // Check that remaining values produced are not flags.
531 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
532 if (N->getValueType(i) == MVT::Flag)
533 return 0; // Never CSE anything that produces a flag.
535 SDNode *New = CSEMap.GetOrInsertNode(N);
536 if (New != N) return New; // Node already existed.
540 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
541 /// were replaced with those specified. If this node is never memoized,
542 /// return null, otherwise return a pointer to the slot it would take. If a
543 /// node already exists with these operands, the slot will be non-null.
544 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
546 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
547 return 0; // Never add these nodes.
549 // Check that remaining values produced are not flags.
550 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
551 if (N->getValueType(i) == MVT::Flag)
552 return 0; // Never CSE anything that produces a flag.
554 SDOperand Ops[] = { Op };
556 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
557 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
560 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
561 /// were replaced with those specified. If this node is never memoized,
562 /// return null, otherwise return a pointer to the slot it would take. If a
563 /// node already exists with these operands, the slot will be non-null.
564 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
565 SDOperand Op1, SDOperand Op2,
567 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
568 return 0; // Never add these nodes.
570 // Check that remaining values produced are not flags.
571 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
572 if (N->getValueType(i) == MVT::Flag)
573 return 0; // Never CSE anything that produces a flag.
575 SDOperand Ops[] = { Op1, Op2 };
577 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
578 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
582 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
583 /// were replaced with those specified. If this node is never memoized,
584 /// return null, otherwise return a pointer to the slot it would take. If a
585 /// node already exists with these operands, the slot will be non-null.
586 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
587 const SDOperand *Ops,unsigned NumOps,
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.
598 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), 0, 0);
600 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
601 ID.AddInteger(LD->getAddressingMode());
602 ID.AddInteger(LD->getExtensionType());
603 ID.AddInteger(LD->getLoadedVT());
604 ID.AddPointer(LD->getSrcValue());
605 ID.AddInteger(LD->getSrcValueOffset());
606 ID.AddInteger(LD->getAlignment());
607 ID.AddInteger(LD->isVolatile());
608 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
609 ID.AddInteger(ST->getAddressingMode());
610 ID.AddInteger(ST->isTruncatingStore());
611 ID.AddInteger(ST->getStoredVT());
612 ID.AddPointer(ST->getSrcValue());
613 ID.AddInteger(ST->getSrcValueOffset());
614 ID.AddInteger(ST->getAlignment());
615 ID.AddInteger(ST->isVolatile());
618 AddNodeIDOperands(ID, Ops, NumOps);
619 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
623 SelectionDAG::~SelectionDAG() {
624 while (!AllNodes.empty()) {
625 SDNode *N = AllNodes.begin();
626 N->SetNextInBucket(0);
627 if (N->OperandsNeedDelete)
628 delete [] N->OperandList;
631 AllNodes.pop_front();
635 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
636 if (Op.getValueType() == VT) return Op;
637 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
638 return getNode(ISD::AND, Op.getValueType(), Op,
639 getConstant(Imm, Op.getValueType()));
642 SDOperand SelectionDAG::getString(const std::string &Val) {
643 StringSDNode *&N = StringNodes[Val];
645 N = new StringSDNode(Val);
646 AllNodes.push_back(N);
648 return SDOperand(N, 0);
651 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
652 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
653 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
655 // Mask out any bits that are not valid for this constant.
656 Val &= MVT::getIntVTBitMask(VT);
658 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
660 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
663 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
664 return SDOperand(E, 0);
665 SDNode *N = new ConstantSDNode(isT, Val, VT);
666 CSEMap.InsertNode(N, IP);
667 AllNodes.push_back(N);
668 return SDOperand(N, 0);
672 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
674 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
676 Val = (float)Val; // Mask out extra precision.
678 // Do the map lookup using the actual bit pattern for the floating point
679 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
680 // we don't have issues with SNANs.
681 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
683 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
686 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
687 return SDOperand(E, 0);
688 SDNode *N = new ConstantFPSDNode(isTarget, Val, VT);
689 CSEMap.InsertNode(N, IP);
690 AllNodes.push_back(N);
691 return SDOperand(N, 0);
694 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
695 MVT::ValueType VT, int Offset,
697 unsigned Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
699 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
701 ID.AddInteger(Offset);
703 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
704 return SDOperand(E, 0);
705 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
706 CSEMap.InsertNode(N, IP);
707 AllNodes.push_back(N);
708 return SDOperand(N, 0);
711 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
713 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
715 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
718 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
719 return SDOperand(E, 0);
720 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
721 CSEMap.InsertNode(N, IP);
722 AllNodes.push_back(N);
723 return SDOperand(N, 0);
726 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
727 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
729 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
732 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
733 return SDOperand(E, 0);
734 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
735 CSEMap.InsertNode(N, IP);
736 AllNodes.push_back(N);
737 return SDOperand(N, 0);
740 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
741 unsigned Alignment, int Offset,
743 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
745 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
746 ID.AddInteger(Alignment);
747 ID.AddInteger(Offset);
750 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
751 return SDOperand(E, 0);
752 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
753 CSEMap.InsertNode(N, IP);
754 AllNodes.push_back(N);
755 return SDOperand(N, 0);
759 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
761 unsigned Alignment, int Offset,
763 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
765 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
766 ID.AddInteger(Alignment);
767 ID.AddInteger(Offset);
768 C->AddSelectionDAGCSEId(ID);
770 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
771 return SDOperand(E, 0);
772 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
773 CSEMap.InsertNode(N, IP);
774 AllNodes.push_back(N);
775 return SDOperand(N, 0);
779 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
781 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
784 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
785 return SDOperand(E, 0);
786 SDNode *N = new BasicBlockSDNode(MBB);
787 CSEMap.InsertNode(N, IP);
788 AllNodes.push_back(N);
789 return SDOperand(N, 0);
792 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
793 if ((unsigned)VT >= ValueTypeNodes.size())
794 ValueTypeNodes.resize(VT+1);
795 if (ValueTypeNodes[VT] == 0) {
796 ValueTypeNodes[VT] = new VTSDNode(VT);
797 AllNodes.push_back(ValueTypeNodes[VT]);
800 return SDOperand(ValueTypeNodes[VT], 0);
803 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
804 SDNode *&N = ExternalSymbols[Sym];
805 if (N) return SDOperand(N, 0);
806 N = new ExternalSymbolSDNode(false, Sym, VT);
807 AllNodes.push_back(N);
808 return SDOperand(N, 0);
811 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
813 SDNode *&N = TargetExternalSymbols[Sym];
814 if (N) return SDOperand(N, 0);
815 N = new ExternalSymbolSDNode(true, Sym, VT);
816 AllNodes.push_back(N);
817 return SDOperand(N, 0);
820 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
821 if ((unsigned)Cond >= CondCodeNodes.size())
822 CondCodeNodes.resize(Cond+1);
824 if (CondCodeNodes[Cond] == 0) {
825 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
826 AllNodes.push_back(CondCodeNodes[Cond]);
828 return SDOperand(CondCodeNodes[Cond], 0);
831 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
833 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
834 ID.AddInteger(RegNo);
836 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
837 return SDOperand(E, 0);
838 SDNode *N = new RegisterSDNode(RegNo, VT);
839 CSEMap.InsertNode(N, IP);
840 AllNodes.push_back(N);
841 return SDOperand(N, 0);
844 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
845 assert((!V || isa<PointerType>(V->getType())) &&
846 "SrcValue is not a pointer?");
849 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
851 ID.AddInteger(Offset);
853 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
854 return SDOperand(E, 0);
855 SDNode *N = new SrcValueSDNode(V, Offset);
856 CSEMap.InsertNode(N, IP);
857 AllNodes.push_back(N);
858 return SDOperand(N, 0);
861 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
862 SDOperand N2, ISD::CondCode Cond) {
863 // These setcc operations always fold.
867 case ISD::SETFALSE2: return getConstant(0, VT);
869 case ISD::SETTRUE2: return getConstant(1, VT);
881 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
885 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
886 uint64_t C2 = N2C->getValue();
887 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
888 uint64_t C1 = N1C->getValue();
890 // Sign extend the operands if required
891 if (ISD::isSignedIntSetCC(Cond)) {
892 C1 = N1C->getSignExtended();
893 C2 = N2C->getSignExtended();
897 default: assert(0 && "Unknown integer setcc!");
898 case ISD::SETEQ: return getConstant(C1 == C2, VT);
899 case ISD::SETNE: return getConstant(C1 != C2, VT);
900 case ISD::SETULT: return getConstant(C1 < C2, VT);
901 case ISD::SETUGT: return getConstant(C1 > C2, VT);
902 case ISD::SETULE: return getConstant(C1 <= C2, VT);
903 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
904 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
905 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
906 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
907 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
911 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
912 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
913 double C1 = N1C->getValue(), C2 = N2C->getValue();
916 default: break; // FIXME: Implement the rest of these!
917 case ISD::SETEQ: return getConstant(C1 == C2, VT);
918 case ISD::SETNE: return getConstant(C1 != C2, VT);
919 case ISD::SETLT: return getConstant(C1 < C2, VT);
920 case ISD::SETGT: return getConstant(C1 > C2, VT);
921 case ISD::SETLE: return getConstant(C1 <= C2, VT);
922 case ISD::SETGE: return getConstant(C1 >= C2, VT);
925 // Ensure that the constant occurs on the RHS.
926 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
929 // Could not fold it.
934 /// getNode - Gets or creates the specified node.
936 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
938 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
940 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
941 return SDOperand(E, 0);
942 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
943 CSEMap.InsertNode(N, IP);
945 AllNodes.push_back(N);
946 return SDOperand(N, 0);
949 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
952 // Constant fold unary operations with an integer constant operand.
953 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
954 uint64_t Val = C->getValue();
957 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
958 case ISD::ANY_EXTEND:
959 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
960 case ISD::TRUNCATE: return getConstant(Val, VT);
961 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
962 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
963 case ISD::BIT_CONVERT:
964 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
965 return getConstantFP(BitsToFloat(Val), VT);
966 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
967 return getConstantFP(BitsToDouble(Val), VT);
971 default: assert(0 && "Invalid bswap!"); break;
972 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
973 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
974 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
979 default: assert(0 && "Invalid ctpop!"); break;
980 case MVT::i1: return getConstant(Val != 0, VT);
982 Tmp1 = (unsigned)Val & 0xFF;
983 return getConstant(CountPopulation_32(Tmp1), VT);
985 Tmp1 = (unsigned)Val & 0xFFFF;
986 return getConstant(CountPopulation_32(Tmp1), VT);
988 return getConstant(CountPopulation_32((unsigned)Val), VT);
990 return getConstant(CountPopulation_64(Val), VT);
994 default: assert(0 && "Invalid ctlz!"); break;
995 case MVT::i1: return getConstant(Val == 0, VT);
997 Tmp1 = (unsigned)Val & 0xFF;
998 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1000 Tmp1 = (unsigned)Val & 0xFFFF;
1001 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1003 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1005 return getConstant(CountLeadingZeros_64(Val), VT);
1009 default: assert(0 && "Invalid cttz!"); break;
1010 case MVT::i1: return getConstant(Val == 0, VT);
1012 Tmp1 = (unsigned)Val | 0x100;
1013 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1015 Tmp1 = (unsigned)Val | 0x10000;
1016 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1018 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1020 return getConstant(CountTrailingZeros_64(Val), VT);
1025 // Constant fold unary operations with an floating point constant operand.
1026 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1029 return getConstantFP(-C->getValue(), VT);
1031 return getConstantFP(fabs(C->getValue()), VT);
1033 case ISD::FP_EXTEND:
1034 return getConstantFP(C->getValue(), VT);
1035 case ISD::FP_TO_SINT:
1036 return getConstant((int64_t)C->getValue(), VT);
1037 case ISD::FP_TO_UINT:
1038 return getConstant((uint64_t)C->getValue(), VT);
1039 case ISD::BIT_CONVERT:
1040 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1041 return getConstant(FloatToBits(C->getValue()), VT);
1042 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1043 return getConstant(DoubleToBits(C->getValue()), VT);
1047 unsigned OpOpcode = Operand.Val->getOpcode();
1049 case ISD::TokenFactor:
1050 return Operand; // Factor of one node? No factor.
1051 case ISD::SIGN_EXTEND:
1052 if (Operand.getValueType() == VT) return Operand; // noop extension
1053 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1054 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1055 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1057 case ISD::ZERO_EXTEND:
1058 if (Operand.getValueType() == VT) return Operand; // noop extension
1059 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1060 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1061 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1063 case ISD::ANY_EXTEND:
1064 if (Operand.getValueType() == VT) return Operand; // noop extension
1065 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1066 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1067 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1068 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1071 if (Operand.getValueType() == VT) return Operand; // noop truncate
1072 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1073 if (OpOpcode == ISD::TRUNCATE)
1074 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1075 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1076 OpOpcode == ISD::ANY_EXTEND) {
1077 // If the source is smaller than the dest, we still need an extend.
1078 if (Operand.Val->getOperand(0).getValueType() < VT)
1079 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1080 else if (Operand.Val->getOperand(0).getValueType() > VT)
1081 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1083 return Operand.Val->getOperand(0);
1086 case ISD::BIT_CONVERT:
1087 // Basic sanity checking.
1088 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1089 && "Cannot BIT_CONVERT between types of different sizes!");
1090 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1091 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1092 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1093 if (OpOpcode == ISD::UNDEF)
1094 return getNode(ISD::UNDEF, VT);
1096 case ISD::SCALAR_TO_VECTOR:
1097 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1098 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1099 "Illegal SCALAR_TO_VECTOR node!");
1102 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1103 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1104 Operand.Val->getOperand(0));
1105 if (OpOpcode == ISD::FNEG) // --X -> X
1106 return Operand.Val->getOperand(0);
1109 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1110 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1115 SDVTList VTs = getVTList(VT);
1116 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1117 FoldingSetNodeID ID;
1118 SDOperand Ops[1] = { Operand };
1119 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1121 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1122 return SDOperand(E, 0);
1123 N = new UnarySDNode(Opcode, VTs, Operand);
1124 CSEMap.InsertNode(N, IP);
1126 N = new UnarySDNode(Opcode, VTs, Operand);
1128 AllNodes.push_back(N);
1129 return SDOperand(N, 0);
1134 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1135 SDOperand N1, SDOperand N2) {
1138 case ISD::TokenFactor:
1139 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1140 N2.getValueType() == MVT::Other && "Invalid token factor!");
1149 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1156 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1163 assert(N1.getValueType() == N2.getValueType() &&
1164 N1.getValueType() == VT && "Binary operator types must match!");
1166 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1167 assert(N1.getValueType() == VT &&
1168 MVT::isFloatingPoint(N1.getValueType()) &&
1169 MVT::isFloatingPoint(N2.getValueType()) &&
1170 "Invalid FCOPYSIGN!");
1177 assert(VT == N1.getValueType() &&
1178 "Shift operators return type must be the same as their first arg");
1179 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1180 VT != MVT::i1 && "Shifts only work on integers");
1182 case ISD::FP_ROUND_INREG: {
1183 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1184 assert(VT == N1.getValueType() && "Not an inreg round!");
1185 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1186 "Cannot FP_ROUND_INREG integer types");
1187 assert(EVT <= VT && "Not rounding down!");
1190 case ISD::AssertSext:
1191 case ISD::AssertZext:
1192 case ISD::SIGN_EXTEND_INREG: {
1193 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1194 assert(VT == N1.getValueType() && "Not an inreg extend!");
1195 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1196 "Cannot *_EXTEND_INREG FP types");
1197 assert(EVT <= VT && "Not extending!");
1204 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1205 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1207 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1208 int64_t Val = N1C->getValue();
1209 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1210 Val <<= 64-FromBits;
1211 Val >>= 64-FromBits;
1212 return getConstant(Val, VT);
1216 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1218 case ISD::ADD: return getConstant(C1 + C2, VT);
1219 case ISD::SUB: return getConstant(C1 - C2, VT);
1220 case ISD::MUL: return getConstant(C1 * C2, VT);
1222 if (C2) return getConstant(C1 / C2, VT);
1225 if (C2) return getConstant(C1 % C2, VT);
1228 if (C2) return getConstant(N1C->getSignExtended() /
1229 N2C->getSignExtended(), VT);
1232 if (C2) return getConstant(N1C->getSignExtended() %
1233 N2C->getSignExtended(), VT);
1235 case ISD::AND : return getConstant(C1 & C2, VT);
1236 case ISD::OR : return getConstant(C1 | C2, VT);
1237 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1238 case ISD::SHL : return getConstant(C1 << C2, VT);
1239 case ISD::SRL : return getConstant(C1 >> C2, VT);
1240 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1242 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1245 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1249 } else { // Cannonicalize constant to RHS if commutative
1250 if (isCommutativeBinOp(Opcode)) {
1251 std::swap(N1C, N2C);
1257 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1258 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1261 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1263 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1264 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1265 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1267 if (C2) return getConstantFP(C1 / C2, VT);
1270 if (C2) return getConstantFP(fmod(C1, C2), VT);
1272 case ISD::FCOPYSIGN: {
1283 if (u2.I < 0) // Sign bit of RHS set?
1284 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1286 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1287 return getConstantFP(u1.F, VT);
1291 } else { // Cannonicalize constant to RHS if commutative
1292 if (isCommutativeBinOp(Opcode)) {
1293 std::swap(N1CFP, N2CFP);
1299 // Canonicalize an UNDEF to the RHS, even over a constant.
1300 if (N1.getOpcode() == ISD::UNDEF) {
1301 if (isCommutativeBinOp(Opcode)) {
1305 case ISD::FP_ROUND_INREG:
1306 case ISD::SIGN_EXTEND_INREG:
1312 return N1; // fold op(undef, arg2) -> undef
1319 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1324 // Fold a bunch of operators when the RHS is undef.
1325 if (N2.getOpcode() == ISD::UNDEF) {
1339 return N2; // fold op(arg1, undef) -> undef
1344 return getConstant(0, VT); // fold op(arg1, undef) -> 0
1346 return getConstant(MVT::getIntVTBitMask(VT), VT);
1354 case ISD::TokenFactor:
1355 // Fold trivial token factors.
1356 if (N1.getOpcode() == ISD::EntryToken) return N2;
1357 if (N2.getOpcode() == ISD::EntryToken) return N1;
1361 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
1362 // worth handling here.
1363 if (N2C && N2C->getValue() == 0)
1368 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
1369 // worth handling here.
1370 if (N2C && N2C->getValue() == 0)
1373 case ISD::FP_ROUND_INREG:
1374 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1376 case ISD::SIGN_EXTEND_INREG: {
1377 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1378 if (EVT == VT) return N1; // Not actually extending
1381 case ISD::EXTRACT_ELEMENT:
1382 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
1384 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
1385 // 64-bit integers into 32-bit parts. Instead of building the extract of
1386 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
1387 if (N1.getOpcode() == ISD::BUILD_PAIR)
1388 return N1.getOperand(N2C->getValue());
1390 // EXTRACT_ELEMENT of a constant int is also very common.
1391 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
1392 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
1393 return getConstant(C->getValue() >> Shift, VT);
1397 // FIXME: figure out how to safely handle things like
1398 // int foo(int x) { return 1 << (x & 255); }
1399 // int bar() { return foo(256); }
1404 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1405 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1406 return getNode(Opcode, VT, N1, N2.getOperand(0));
1407 else if (N2.getOpcode() == ISD::AND)
1408 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1409 // If the and is only masking out bits that cannot effect the shift,
1410 // eliminate the and.
1411 unsigned NumBits = MVT::getSizeInBits(VT);
1412 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1413 return getNode(Opcode, VT, N1, N2.getOperand(0));
1419 // Memoize this node if possible.
1421 SDVTList VTs = getVTList(VT);
1422 if (VT != MVT::Flag) {
1423 SDOperand Ops[] = { N1, N2 };
1424 FoldingSetNodeID ID;
1425 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
1427 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1428 return SDOperand(E, 0);
1429 N = new BinarySDNode(Opcode, VTs, N1, N2);
1430 CSEMap.InsertNode(N, IP);
1432 N = new BinarySDNode(Opcode, VTs, N1, N2);
1435 AllNodes.push_back(N);
1436 return SDOperand(N, 0);
1439 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1440 SDOperand N1, SDOperand N2, SDOperand N3) {
1441 // Perform various simplifications.
1442 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1443 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1446 // Use FoldSetCC to simplify SETCC's.
1447 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1448 if (Simp.Val) return Simp;
1453 if (N1C->getValue())
1454 return N2; // select true, X, Y -> X
1456 return N3; // select false, X, Y -> Y
1458 if (N2 == N3) return N2; // select C, X, X -> X
1462 if (N2C->getValue()) // Unconditional branch
1463 return getNode(ISD::BR, MVT::Other, N1, N3);
1465 return N1; // Never-taken branch
1467 case ISD::VECTOR_SHUFFLE:
1468 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1469 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1470 N3.getOpcode() == ISD::BUILD_VECTOR &&
1471 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1472 "Illegal VECTOR_SHUFFLE node!");
1476 // Memoize node if it doesn't produce a flag.
1478 SDVTList VTs = getVTList(VT);
1479 if (VT != MVT::Flag) {
1480 SDOperand Ops[] = { N1, N2, N3 };
1481 FoldingSetNodeID ID;
1482 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
1484 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1485 return SDOperand(E, 0);
1486 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
1487 CSEMap.InsertNode(N, IP);
1489 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
1491 AllNodes.push_back(N);
1492 return SDOperand(N, 0);
1495 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1496 SDOperand N1, SDOperand N2, SDOperand N3,
1498 SDOperand Ops[] = { N1, N2, N3, N4 };
1499 return getNode(Opcode, VT, Ops, 4);
1502 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1503 SDOperand N1, SDOperand N2, SDOperand N3,
1504 SDOperand N4, SDOperand N5) {
1505 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
1506 return getNode(Opcode, VT, Ops, 5);
1509 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1510 SDOperand Chain, SDOperand Ptr,
1511 const Value *SV, int SVOffset,
1513 // FIXME: Alignment == 1 for now.
1514 unsigned Alignment = 1;
1515 SDVTList VTs = getVTList(VT, MVT::Other);
1516 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1517 SDOperand Ops[] = { Chain, Ptr, Undef };
1518 FoldingSetNodeID ID;
1519 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
1520 ID.AddInteger(ISD::UNINDEXED);
1521 ID.AddInteger(ISD::NON_EXTLOAD);
1524 ID.AddInteger(SVOffset);
1525 ID.AddInteger(Alignment);
1526 ID.AddInteger(isVolatile);
1528 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1529 return SDOperand(E, 0);
1530 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
1531 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
1533 CSEMap.InsertNode(N, IP);
1534 AllNodes.push_back(N);
1535 return SDOperand(N, 0);
1538 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
1539 SDOperand Chain, SDOperand Ptr,
1541 int SVOffset, MVT::ValueType EVT,
1543 // If they are asking for an extending load from/to the same thing, return a
1546 ExtType = ISD::NON_EXTLOAD;
1548 if (MVT::isVector(VT))
1549 assert(EVT == MVT::getVectorBaseType(VT) && "Invalid vector extload!");
1551 assert(EVT < VT && "Should only be an extending load, not truncating!");
1552 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
1553 "Cannot sign/zero extend a FP/Vector load!");
1554 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
1555 "Cannot convert from FP to Int or Int -> FP!");
1557 // FIXME: Alignment == 1 for now.
1558 unsigned Alignment = 1;
1559 SDVTList VTs = getVTList(VT, MVT::Other);
1560 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1561 SDOperand Ops[] = { Chain, Ptr, Undef };
1562 FoldingSetNodeID ID;
1563 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
1564 ID.AddInteger(ISD::UNINDEXED);
1565 ID.AddInteger(ExtType);
1568 ID.AddInteger(SVOffset);
1569 ID.AddInteger(Alignment);
1570 ID.AddInteger(isVolatile);
1572 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1573 return SDOperand(E, 0);
1574 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
1575 SV, SVOffset, Alignment, isVolatile);
1576 CSEMap.InsertNode(N, IP);
1577 AllNodes.push_back(N);
1578 return SDOperand(N, 0);
1582 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
1583 SDOperand Offset, ISD::MemIndexedMode AM) {
1584 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
1585 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
1586 "Load is already a indexed load!");
1587 MVT::ValueType VT = OrigLoad.getValueType();
1588 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
1589 SDOperand Ops[] = { LD->getChain(), Base, Offset };
1590 FoldingSetNodeID ID;
1591 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
1593 ID.AddInteger(LD->getExtensionType());
1594 ID.AddInteger(LD->getLoadedVT());
1595 ID.AddPointer(LD->getSrcValue());
1596 ID.AddInteger(LD->getSrcValueOffset());
1597 ID.AddInteger(LD->getAlignment());
1598 ID.AddInteger(LD->isVolatile());
1600 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1601 return SDOperand(E, 0);
1602 SDNode *N = new LoadSDNode(Ops, VTs, AM,
1603 LD->getExtensionType(), LD->getLoadedVT(),
1604 LD->getSrcValue(), LD->getSrcValueOffset(),
1605 LD->getAlignment(), LD->isVolatile());
1606 CSEMap.InsertNode(N, IP);
1607 AllNodes.push_back(N);
1608 return SDOperand(N, 0);
1611 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1612 SDOperand Chain, SDOperand Ptr,
1614 SDOperand Ops[] = { Chain, Ptr, SV, getConstant(Count, MVT::i32),
1615 getValueType(EVT) };
1616 return getNode(ISD::VLOAD, getVTList(MVT::Vector, MVT::Other), Ops, 5);
1619 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
1620 SDOperand Ptr, const Value *SV, int SVOffset,
1622 MVT::ValueType VT = Val.getValueType();
1624 // FIXME: Alignment == 1 for now.
1625 unsigned Alignment = 1;
1626 SDVTList VTs = getVTList(MVT::Other);
1627 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1628 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1629 FoldingSetNodeID ID;
1630 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1631 ID.AddInteger(ISD::UNINDEXED);
1632 ID.AddInteger(false);
1635 ID.AddInteger(SVOffset);
1636 ID.AddInteger(Alignment);
1637 ID.AddInteger(isVolatile);
1639 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1640 return SDOperand(E, 0);
1641 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
1642 VT, SV, SVOffset, Alignment, isVolatile);
1643 CSEMap.InsertNode(N, IP);
1644 AllNodes.push_back(N);
1645 return SDOperand(N, 0);
1648 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
1649 SDOperand Ptr, const Value *SV,
1650 int SVOffset, MVT::ValueType SVT,
1652 MVT::ValueType VT = Val.getValueType();
1653 bool isTrunc = VT != SVT;
1655 assert(VT > SVT && "Not a truncation?");
1656 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
1657 "Can't do FP-INT conversion!");
1659 // FIXME: Alignment == 1 for now.
1660 unsigned Alignment = 1;
1661 SDVTList VTs = getVTList(MVT::Other);
1662 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1663 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1664 FoldingSetNodeID ID;
1665 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1666 ID.AddInteger(ISD::UNINDEXED);
1667 ID.AddInteger(isTrunc);
1670 ID.AddInteger(SVOffset);
1671 ID.AddInteger(Alignment);
1672 ID.AddInteger(isVolatile);
1674 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1675 return SDOperand(E, 0);
1676 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, isTrunc,
1677 SVT, SV, SVOffset, Alignment, isVolatile);
1678 CSEMap.InsertNode(N, IP);
1679 AllNodes.push_back(N);
1680 return SDOperand(N, 0);
1684 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
1685 SDOperand Offset, ISD::MemIndexedMode AM) {
1686 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
1687 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
1688 "Store is already a indexed store!");
1689 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
1690 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
1691 FoldingSetNodeID ID;
1692 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1694 ID.AddInteger(ST->isTruncatingStore());
1695 ID.AddInteger(ST->getStoredVT());
1696 ID.AddPointer(ST->getSrcValue());
1697 ID.AddInteger(ST->getSrcValueOffset());
1698 ID.AddInteger(ST->getAlignment());
1699 ID.AddInteger(ST->isVolatile());
1701 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1702 return SDOperand(E, 0);
1703 SDNode *N = new StoreSDNode(Ops, VTs, AM,
1704 ST->isTruncatingStore(), ST->getStoredVT(),
1705 ST->getSrcValue(), ST->getSrcValueOffset(),
1706 ST->getAlignment(), ST->isVolatile());
1707 CSEMap.InsertNode(N, IP);
1708 AllNodes.push_back(N);
1709 return SDOperand(N, 0);
1712 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1713 SDOperand Chain, SDOperand Ptr,
1715 SDOperand Ops[] = { Chain, Ptr, SV };
1716 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
1719 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1720 const SDOperand *Ops, unsigned NumOps) {
1722 case 0: return getNode(Opcode, VT);
1723 case 1: return getNode(Opcode, VT, Ops[0]);
1724 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1725 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1731 case ISD::SELECT_CC: {
1732 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
1733 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1734 "LHS and RHS of condition must have same type!");
1735 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1736 "True and False arms of SelectCC must have same type!");
1737 assert(Ops[2].getValueType() == VT &&
1738 "select_cc node must be of same type as true and false value!");
1742 assert(NumOps == 5 && "BR_CC takes 5 operands!");
1743 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1744 "LHS/RHS of comparison should match types!");
1751 SDVTList VTs = getVTList(VT);
1752 if (VT != MVT::Flag) {
1753 FoldingSetNodeID ID;
1754 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
1756 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1757 return SDOperand(E, 0);
1758 N = new SDNode(Opcode, VTs, Ops, NumOps);
1759 CSEMap.InsertNode(N, IP);
1761 N = new SDNode(Opcode, VTs, Ops, NumOps);
1763 AllNodes.push_back(N);
1764 return SDOperand(N, 0);
1767 SDOperand SelectionDAG::getNode(unsigned Opcode,
1768 std::vector<MVT::ValueType> &ResultTys,
1769 const SDOperand *Ops, unsigned NumOps) {
1770 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
1774 SDOperand SelectionDAG::getNode(unsigned Opcode,
1775 const MVT::ValueType *VTs, unsigned NumVTs,
1776 const SDOperand *Ops, unsigned NumOps) {
1778 return getNode(Opcode, VTs[0], Ops, NumOps);
1779 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
1782 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
1783 const SDOperand *Ops, unsigned NumOps) {
1784 if (VTList.NumVTs == 1)
1785 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
1788 // FIXME: figure out how to safely handle things like
1789 // int foo(int x) { return 1 << (x & 255); }
1790 // int bar() { return foo(256); }
1792 case ISD::SRA_PARTS:
1793 case ISD::SRL_PARTS:
1794 case ISD::SHL_PARTS:
1795 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1796 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1797 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1798 else if (N3.getOpcode() == ISD::AND)
1799 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1800 // If the and is only masking out bits that cannot effect the shift,
1801 // eliminate the and.
1802 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1803 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1804 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1810 // Memoize the node unless it returns a flag.
1812 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
1813 FoldingSetNodeID ID;
1814 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
1816 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1817 return SDOperand(E, 0);
1819 N = new UnarySDNode(Opcode, VTList, Ops[0]);
1820 else if (NumOps == 2)
1821 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
1822 else if (NumOps == 3)
1823 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
1825 N = new SDNode(Opcode, VTList, Ops, NumOps);
1826 CSEMap.InsertNode(N, IP);
1829 N = new UnarySDNode(Opcode, VTList, Ops[0]);
1830 else if (NumOps == 2)
1831 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
1832 else if (NumOps == 3)
1833 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
1835 N = new SDNode(Opcode, VTList, Ops, NumOps);
1837 AllNodes.push_back(N);
1838 return SDOperand(N, 0);
1841 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
1842 return makeVTList(SDNode::getValueTypeList(VT), 1);
1845 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
1846 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1847 E = VTList.end(); I != E; ++I) {
1848 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
1849 return makeVTList(&(*I)[0], 2);
1851 std::vector<MVT::ValueType> V;
1854 VTList.push_front(V);
1855 return makeVTList(&(*VTList.begin())[0], 2);
1857 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
1858 MVT::ValueType VT3) {
1859 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1860 E = VTList.end(); I != E; ++I) {
1861 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
1863 return makeVTList(&(*I)[0], 3);
1865 std::vector<MVT::ValueType> V;
1869 VTList.push_front(V);
1870 return makeVTList(&(*VTList.begin())[0], 3);
1873 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
1875 case 0: assert(0 && "Cannot have nodes without results!");
1876 case 1: return makeVTList(SDNode::getValueTypeList(VTs[0]), 1);
1877 case 2: return getVTList(VTs[0], VTs[1]);
1878 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
1882 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1883 E = VTList.end(); I != E; ++I) {
1884 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
1886 bool NoMatch = false;
1887 for (unsigned i = 2; i != NumVTs; ++i)
1888 if (VTs[i] != (*I)[i]) {
1893 return makeVTList(&*I->begin(), NumVTs);
1896 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
1897 return makeVTList(&*VTList.begin()->begin(), NumVTs);
1901 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1902 /// specified operands. If the resultant node already exists in the DAG,
1903 /// this does not modify the specified node, instead it returns the node that
1904 /// already exists. If the resultant node does not exist in the DAG, the
1905 /// input node is returned. As a degenerate case, if you specify the same
1906 /// input operands as the node already has, the input node is returned.
1907 SDOperand SelectionDAG::
1908 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1909 SDNode *N = InN.Val;
1910 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1912 // Check to see if there is no change.
1913 if (Op == N->getOperand(0)) return InN;
1915 // See if the modified node already exists.
1916 void *InsertPos = 0;
1917 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
1918 return SDOperand(Existing, InN.ResNo);
1920 // Nope it doesn't. Remove the node from it's current place in the maps.
1922 RemoveNodeFromCSEMaps(N);
1924 // Now we update the operands.
1925 N->OperandList[0].Val->removeUser(N);
1927 N->OperandList[0] = Op;
1929 // If this gets put into a CSE map, add it.
1930 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
1934 SDOperand SelectionDAG::
1935 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1936 SDNode *N = InN.Val;
1937 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1939 // Check to see if there is no change.
1940 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1941 return InN; // No operands changed, just return the input node.
1943 // See if the modified node already exists.
1944 void *InsertPos = 0;
1945 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
1946 return SDOperand(Existing, InN.ResNo);
1948 // Nope it doesn't. Remove the node from it's current place in the maps.
1950 RemoveNodeFromCSEMaps(N);
1952 // Now we update the operands.
1953 if (N->OperandList[0] != Op1) {
1954 N->OperandList[0].Val->removeUser(N);
1955 Op1.Val->addUser(N);
1956 N->OperandList[0] = Op1;
1958 if (N->OperandList[1] != Op2) {
1959 N->OperandList[1].Val->removeUser(N);
1960 Op2.Val->addUser(N);
1961 N->OperandList[1] = Op2;
1964 // If this gets put into a CSE map, add it.
1965 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
1969 SDOperand SelectionDAG::
1970 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
1971 SDOperand Ops[] = { Op1, Op2, Op3 };
1972 return UpdateNodeOperands(N, Ops, 3);
1975 SDOperand SelectionDAG::
1976 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1977 SDOperand Op3, SDOperand Op4) {
1978 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
1979 return UpdateNodeOperands(N, Ops, 4);
1982 SDOperand SelectionDAG::
1983 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
1984 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
1985 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
1986 return UpdateNodeOperands(N, Ops, 5);
1990 SDOperand SelectionDAG::
1991 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
1992 SDNode *N = InN.Val;
1993 assert(N->getNumOperands() == NumOps &&
1994 "Update with wrong number of operands");
1996 // Check to see if there is no change.
1997 bool AnyChange = false;
1998 for (unsigned i = 0; i != NumOps; ++i) {
1999 if (Ops[i] != N->getOperand(i)) {
2005 // No operands changed, just return the input node.
2006 if (!AnyChange) return InN;
2008 // See if the modified node already exists.
2009 void *InsertPos = 0;
2010 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2011 return SDOperand(Existing, InN.ResNo);
2013 // Nope it doesn't. Remove the node from it's current place in the maps.
2015 RemoveNodeFromCSEMaps(N);
2017 // Now we update the operands.
2018 for (unsigned i = 0; i != NumOps; ++i) {
2019 if (N->OperandList[i] != Ops[i]) {
2020 N->OperandList[i].Val->removeUser(N);
2021 Ops[i].Val->addUser(N);
2022 N->OperandList[i] = Ops[i];
2026 // If this gets put into a CSE map, add it.
2027 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2032 /// MorphNodeTo - This frees the operands of the current node, resets the
2033 /// opcode, types, and operands to the specified value. This should only be
2034 /// used by the SelectionDAG class.
2035 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
2036 const SDOperand *Ops, unsigned NumOps) {
2039 NumValues = L.NumVTs;
2041 // Clear the operands list, updating used nodes to remove this from their
2043 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
2044 I->Val->removeUser(this);
2046 // If NumOps is larger than the # of operands we currently have, reallocate
2047 // the operand list.
2048 if (NumOps > NumOperands) {
2049 if (OperandsNeedDelete)
2050 delete [] OperandList;
2051 OperandList = new SDOperand[NumOps];
2052 OperandsNeedDelete = true;
2055 // Assign the new operands.
2056 NumOperands = NumOps;
2058 for (unsigned i = 0, e = NumOps; i != e; ++i) {
2059 OperandList[i] = Ops[i];
2060 SDNode *N = OperandList[i].Val;
2061 N->Uses.push_back(this);
2065 /// SelectNodeTo - These are used for target selectors to *mutate* the
2066 /// specified node to have the specified return type, Target opcode, and
2067 /// operands. Note that target opcodes are stored as
2068 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
2070 /// Note that SelectNodeTo returns the resultant node. If there is already a
2071 /// node of the specified opcode and operands, it returns that node instead of
2072 /// the current one.
2073 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2074 MVT::ValueType VT) {
2075 SDVTList VTs = getVTList(VT);
2076 FoldingSetNodeID ID;
2077 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2079 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2082 RemoveNodeFromCSEMaps(N);
2084 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2086 CSEMap.InsertNode(N, IP);
2090 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2091 MVT::ValueType VT, SDOperand Op1) {
2092 // If an identical node already exists, use it.
2093 SDVTList VTs = getVTList(VT);
2094 SDOperand Ops[] = { Op1 };
2096 FoldingSetNodeID ID;
2097 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2099 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2102 RemoveNodeFromCSEMaps(N);
2103 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2104 CSEMap.InsertNode(N, IP);
2108 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2109 MVT::ValueType VT, SDOperand Op1,
2111 // If an identical node already exists, use it.
2112 SDVTList VTs = getVTList(VT);
2113 SDOperand Ops[] = { Op1, Op2 };
2115 FoldingSetNodeID ID;
2116 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2118 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2121 RemoveNodeFromCSEMaps(N);
2123 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2125 CSEMap.InsertNode(N, IP); // Memoize the new node.
2129 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2130 MVT::ValueType VT, SDOperand Op1,
2131 SDOperand Op2, SDOperand Op3) {
2132 // If an identical node already exists, use it.
2133 SDVTList VTs = getVTList(VT);
2134 SDOperand Ops[] = { Op1, Op2, Op3 };
2135 FoldingSetNodeID ID;
2136 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2138 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2141 RemoveNodeFromCSEMaps(N);
2143 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2145 CSEMap.InsertNode(N, IP); // Memoize the new node.
2149 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2150 MVT::ValueType VT, const SDOperand *Ops,
2152 // If an identical node already exists, use it.
2153 SDVTList VTs = getVTList(VT);
2154 FoldingSetNodeID ID;
2155 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2157 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2160 RemoveNodeFromCSEMaps(N);
2161 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2163 CSEMap.InsertNode(N, IP); // Memoize the new node.
2167 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2168 MVT::ValueType VT1, MVT::ValueType VT2,
2169 SDOperand Op1, SDOperand Op2) {
2170 SDVTList VTs = getVTList(VT1, VT2);
2171 FoldingSetNodeID ID;
2172 SDOperand Ops[] = { Op1, Op2 };
2173 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2175 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2178 RemoveNodeFromCSEMaps(N);
2179 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2180 CSEMap.InsertNode(N, IP); // Memoize the new node.
2184 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2185 MVT::ValueType VT1, MVT::ValueType VT2,
2186 SDOperand Op1, SDOperand Op2,
2188 // If an identical node already exists, use it.
2189 SDVTList VTs = getVTList(VT1, VT2);
2190 SDOperand Ops[] = { Op1, Op2, Op3 };
2191 FoldingSetNodeID ID;
2192 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2194 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2197 RemoveNodeFromCSEMaps(N);
2199 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2200 CSEMap.InsertNode(N, IP); // Memoize the new node.
2205 /// getTargetNode - These are used for target selectors to create a new node
2206 /// with specified return type(s), target opcode, and operands.
2208 /// Note that getTargetNode returns the resultant node. If there is already a
2209 /// node of the specified opcode and operands, it returns that node instead of
2210 /// the current one.
2211 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2212 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2214 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2216 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2218 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2219 SDOperand Op1, SDOperand Op2) {
2220 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2222 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2223 SDOperand Op1, SDOperand Op2,
2225 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2227 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2228 const SDOperand *Ops, unsigned NumOps) {
2229 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
2231 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2232 MVT::ValueType VT2, SDOperand Op1) {
2233 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2234 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
2236 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2237 MVT::ValueType VT2, SDOperand Op1,
2239 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2240 SDOperand Ops[] = { Op1, Op2 };
2241 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
2243 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2244 MVT::ValueType VT2, SDOperand Op1,
2245 SDOperand Op2, SDOperand Op3) {
2246 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2247 SDOperand Ops[] = { Op1, Op2, Op3 };
2248 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
2250 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2252 const SDOperand *Ops, unsigned NumOps) {
2253 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2254 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
2256 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2257 MVT::ValueType VT2, MVT::ValueType VT3,
2258 SDOperand Op1, SDOperand Op2) {
2259 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2260 SDOperand Ops[] = { Op1, Op2 };
2261 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
2263 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2264 MVT::ValueType VT2, MVT::ValueType VT3,
2265 const SDOperand *Ops, unsigned NumOps) {
2266 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2267 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
2270 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2271 /// This can cause recursive merging of nodes in the DAG.
2273 /// This version assumes From/To have a single result value.
2275 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2276 std::vector<SDNode*> *Deleted) {
2277 SDNode *From = FromN.Val, *To = ToN.Val;
2278 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2279 "Cannot replace with this method!");
2280 assert(From != To && "Cannot replace uses of with self");
2282 while (!From->use_empty()) {
2283 // Process users until they are all gone.
2284 SDNode *U = *From->use_begin();
2286 // This node is about to morph, remove its old self from the CSE maps.
2287 RemoveNodeFromCSEMaps(U);
2289 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2291 if (I->Val == From) {
2292 From->removeUser(U);
2297 // Now that we have modified U, add it back to the CSE maps. If it already
2298 // exists there, recursively merge the results together.
2299 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2300 ReplaceAllUsesWith(U, Existing, Deleted);
2302 if (Deleted) Deleted->push_back(U);
2303 DeleteNodeNotInCSEMaps(U);
2308 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2309 /// This can cause recursive merging of nodes in the DAG.
2311 /// This version assumes From/To have matching types and numbers of result
2314 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2315 std::vector<SDNode*> *Deleted) {
2316 assert(From != To && "Cannot replace uses of with self");
2317 assert(From->getNumValues() == To->getNumValues() &&
2318 "Cannot use this version of ReplaceAllUsesWith!");
2319 if (From->getNumValues() == 1) { // If possible, use the faster version.
2320 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
2324 while (!From->use_empty()) {
2325 // Process users until they are all gone.
2326 SDNode *U = *From->use_begin();
2328 // This node is about to morph, remove its old self from the CSE maps.
2329 RemoveNodeFromCSEMaps(U);
2331 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2333 if (I->Val == From) {
2334 From->removeUser(U);
2339 // Now that we have modified U, add it back to the CSE maps. If it already
2340 // exists there, recursively merge the results together.
2341 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2342 ReplaceAllUsesWith(U, Existing, Deleted);
2344 if (Deleted) Deleted->push_back(U);
2345 DeleteNodeNotInCSEMaps(U);
2350 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2351 /// This can cause recursive merging of nodes in the DAG.
2353 /// This version can replace From with any result values. To must match the
2354 /// number and types of values returned by From.
2355 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2356 const SDOperand *To,
2357 std::vector<SDNode*> *Deleted) {
2358 if (From->getNumValues() == 1 && To[0].Val->getNumValues() == 1) {
2359 // Degenerate case handled above.
2360 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2364 while (!From->use_empty()) {
2365 // Process users until they are all gone.
2366 SDNode *U = *From->use_begin();
2368 // This node is about to morph, remove its old self from the CSE maps.
2369 RemoveNodeFromCSEMaps(U);
2371 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2373 if (I->Val == From) {
2374 const SDOperand &ToOp = To[I->ResNo];
2375 From->removeUser(U);
2377 ToOp.Val->addUser(U);
2380 // Now that we have modified U, add it back to the CSE maps. If it already
2381 // exists there, recursively merge the results together.
2382 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2383 ReplaceAllUsesWith(U, Existing, Deleted);
2385 if (Deleted) Deleted->push_back(U);
2386 DeleteNodeNotInCSEMaps(U);
2391 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2392 /// uses of other values produced by From.Val alone. The Deleted vector is
2393 /// handled the same was as for ReplaceAllUsesWith.
2394 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2395 std::vector<SDNode*> &Deleted) {
2396 assert(From != To && "Cannot replace a value with itself");
2397 // Handle the simple, trivial, case efficiently.
2398 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2399 ReplaceAllUsesWith(From, To, &Deleted);
2403 // Get all of the users of From.Val. We want these in a nice,
2404 // deterministically ordered and uniqued set, so we use a SmallSetVector.
2405 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
2407 while (!Users.empty()) {
2408 // We know that this user uses some value of From. If it is the right
2409 // value, update it.
2410 SDNode *User = Users.back();
2413 for (SDOperand *Op = User->OperandList,
2414 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2416 // Okay, we know this user needs to be updated. Remove its old self
2417 // from the CSE maps.
2418 RemoveNodeFromCSEMaps(User);
2420 // Update all operands that match "From".
2421 for (; Op != E; ++Op) {
2423 From.Val->removeUser(User);
2425 To.Val->addUser(User);
2429 // Now that we have modified User, add it back to the CSE maps. If it
2430 // already exists there, recursively merge the results together.
2431 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2432 unsigned NumDeleted = Deleted.size();
2433 ReplaceAllUsesWith(User, Existing, &Deleted);
2435 // User is now dead.
2436 Deleted.push_back(User);
2437 DeleteNodeNotInCSEMaps(User);
2439 // We have to be careful here, because ReplaceAllUsesWith could have
2440 // deleted a user of From, which means there may be dangling pointers
2441 // in the "Users" setvector. Scan over the deleted node pointers and
2442 // remove them from the setvector.
2443 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2444 Users.remove(Deleted[i]);
2446 break; // Exit the operand scanning loop.
2453 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
2454 /// their allnodes order. It returns the maximum id.
2455 unsigned SelectionDAG::AssignNodeIds() {
2457 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
2464 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
2465 /// based on their topological order. It returns the maximum id and a vector
2466 /// of the SDNodes* in assigned order by reference.
2467 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
2468 unsigned DAGSize = AllNodes.size();
2469 std::vector<unsigned> InDegree(DAGSize);
2470 std::vector<SDNode*> Sources;
2472 // Use a two pass approach to avoid using a std::map which is slow.
2474 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
2477 unsigned Degree = N->use_size();
2478 InDegree[N->getNodeId()] = Degree;
2480 Sources.push_back(N);
2484 while (!Sources.empty()) {
2485 SDNode *N = Sources.back();
2487 TopOrder.push_back(N);
2488 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
2490 unsigned Degree = --InDegree[P->getNodeId()];
2492 Sources.push_back(P);
2496 // Second pass, assign the actual topological order as node ids.
2498 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
2500 (*TI)->setNodeId(Id++);
2507 //===----------------------------------------------------------------------===//
2509 //===----------------------------------------------------------------------===//
2511 // Out-of-line virtual method to give class a home.
2512 void SDNode::ANCHOR() {}
2513 void UnarySDNode::ANCHOR() {}
2514 void BinarySDNode::ANCHOR() {}
2515 void TernarySDNode::ANCHOR() {}
2516 void HandleSDNode::ANCHOR() {}
2517 void StringSDNode::ANCHOR() {}
2518 void ConstantSDNode::ANCHOR() {}
2519 void ConstantFPSDNode::ANCHOR() {}
2520 void GlobalAddressSDNode::ANCHOR() {}
2521 void FrameIndexSDNode::ANCHOR() {}
2522 void JumpTableSDNode::ANCHOR() {}
2523 void ConstantPoolSDNode::ANCHOR() {}
2524 void BasicBlockSDNode::ANCHOR() {}
2525 void SrcValueSDNode::ANCHOR() {}
2526 void RegisterSDNode::ANCHOR() {}
2527 void ExternalSymbolSDNode::ANCHOR() {}
2528 void CondCodeSDNode::ANCHOR() {}
2529 void VTSDNode::ANCHOR() {}
2530 void LoadSDNode::ANCHOR() {}
2531 void StoreSDNode::ANCHOR() {}
2533 HandleSDNode::~HandleSDNode() {
2534 SDVTList VTs = { 0, 0 };
2535 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
2539 /// Profile - Gather unique data for the node.
2541 void SDNode::Profile(FoldingSetNodeID &ID) {
2542 AddNodeIDNode(ID, this);
2545 /// getValueTypeList - Return a pointer to the specified value type.
2547 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2548 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2553 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2554 /// indicated value. This method ignores uses of other values defined by this
2556 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2557 assert(Value < getNumValues() && "Bad value!");
2559 // If there is only one value, this is easy.
2560 if (getNumValues() == 1)
2561 return use_size() == NUses;
2562 if (Uses.size() < NUses) return false;
2564 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2566 SmallPtrSet<SDNode*, 32> UsersHandled;
2568 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
2570 if (User->getNumOperands() == 1 ||
2571 UsersHandled.insert(User)) // First time we've seen this?
2572 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2573 if (User->getOperand(i) == TheValue) {
2575 return false; // too many uses
2580 // Found exactly the right number of uses?
2585 /// isOnlyUse - Return true if this node is the only use of N.
2587 bool SDNode::isOnlyUse(SDNode *N) const {
2589 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2600 /// isOperand - Return true if this node is an operand of N.
2602 bool SDOperand::isOperand(SDNode *N) const {
2603 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2604 if (*this == N->getOperand(i))
2609 bool SDNode::isOperand(SDNode *N) const {
2610 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2611 if (this == N->OperandList[i].Val)
2616 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
2617 SmallPtrSet<SDNode *, 32> &Visited) {
2618 if (found || !Visited.insert(N))
2621 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
2622 SDNode *Op = N->getOperand(i).Val;
2627 findPredecessor(Op, P, found, Visited);
2631 /// isPredecessor - Return true if this node is a predecessor of N. This node
2632 /// is either an operand of N or it can be reached by recursively traversing
2633 /// up the operands.
2634 /// NOTE: this is an expensive method. Use it carefully.
2635 bool SDNode::isPredecessor(SDNode *N) const {
2636 SmallPtrSet<SDNode *, 32> Visited;
2638 findPredecessor(N, this, found, Visited);
2642 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
2643 assert(Num < NumOperands && "Invalid child # of SDNode!");
2644 return cast<ConstantSDNode>(OperandList[Num])->getValue();
2647 const char *SDNode::getOperationName(const SelectionDAG *G) const {
2648 switch (getOpcode()) {
2650 if (getOpcode() < ISD::BUILTIN_OP_END)
2651 return "<<Unknown DAG Node>>";
2654 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2655 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2656 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2658 TargetLowering &TLI = G->getTargetLoweringInfo();
2660 TLI.getTargetNodeName(getOpcode());
2661 if (Name) return Name;
2664 return "<<Unknown Target Node>>";
2667 case ISD::PCMARKER: return "PCMarker";
2668 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2669 case ISD::SRCVALUE: return "SrcValue";
2670 case ISD::EntryToken: return "EntryToken";
2671 case ISD::TokenFactor: return "TokenFactor";
2672 case ISD::AssertSext: return "AssertSext";
2673 case ISD::AssertZext: return "AssertZext";
2675 case ISD::STRING: return "String";
2676 case ISD::BasicBlock: return "BasicBlock";
2677 case ISD::VALUETYPE: return "ValueType";
2678 case ISD::Register: return "Register";
2680 case ISD::Constant: return "Constant";
2681 case ISD::ConstantFP: return "ConstantFP";
2682 case ISD::GlobalAddress: return "GlobalAddress";
2683 case ISD::FrameIndex: return "FrameIndex";
2684 case ISD::JumpTable: return "JumpTable";
2685 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
2686 case ISD::RETURNADDR: return "RETURNADDR";
2687 case ISD::FRAMEADDR: return "FRAMEADDR";
2688 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
2689 case ISD::EHSELECTION: return "EHSELECTION";
2690 case ISD::ConstantPool: return "ConstantPool";
2691 case ISD::ExternalSymbol: return "ExternalSymbol";
2692 case ISD::INTRINSIC_WO_CHAIN: {
2693 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2694 return Intrinsic::getName((Intrinsic::ID)IID);
2696 case ISD::INTRINSIC_VOID:
2697 case ISD::INTRINSIC_W_CHAIN: {
2698 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2699 return Intrinsic::getName((Intrinsic::ID)IID);
2702 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2703 case ISD::TargetConstant: return "TargetConstant";
2704 case ISD::TargetConstantFP:return "TargetConstantFP";
2705 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2706 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2707 case ISD::TargetJumpTable: return "TargetJumpTable";
2708 case ISD::TargetConstantPool: return "TargetConstantPool";
2709 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2711 case ISD::CopyToReg: return "CopyToReg";
2712 case ISD::CopyFromReg: return "CopyFromReg";
2713 case ISD::UNDEF: return "undef";
2714 case ISD::MERGE_VALUES: return "mergevalues";
2715 case ISD::INLINEASM: return "inlineasm";
2716 case ISD::LABEL: return "label";
2717 case ISD::HANDLENODE: return "handlenode";
2718 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
2719 case ISD::CALL: return "call";
2722 case ISD::FABS: return "fabs";
2723 case ISD::FNEG: return "fneg";
2724 case ISD::FSQRT: return "fsqrt";
2725 case ISD::FSIN: return "fsin";
2726 case ISD::FCOS: return "fcos";
2727 case ISD::FPOWI: return "fpowi";
2730 case ISD::ADD: return "add";
2731 case ISD::SUB: return "sub";
2732 case ISD::MUL: return "mul";
2733 case ISD::MULHU: return "mulhu";
2734 case ISD::MULHS: return "mulhs";
2735 case ISD::SDIV: return "sdiv";
2736 case ISD::UDIV: return "udiv";
2737 case ISD::SREM: return "srem";
2738 case ISD::UREM: return "urem";
2739 case ISD::AND: return "and";
2740 case ISD::OR: return "or";
2741 case ISD::XOR: return "xor";
2742 case ISD::SHL: return "shl";
2743 case ISD::SRA: return "sra";
2744 case ISD::SRL: return "srl";
2745 case ISD::ROTL: return "rotl";
2746 case ISD::ROTR: return "rotr";
2747 case ISD::FADD: return "fadd";
2748 case ISD::FSUB: return "fsub";
2749 case ISD::FMUL: return "fmul";
2750 case ISD::FDIV: return "fdiv";
2751 case ISD::FREM: return "frem";
2752 case ISD::FCOPYSIGN: return "fcopysign";
2753 case ISD::VADD: return "vadd";
2754 case ISD::VSUB: return "vsub";
2755 case ISD::VMUL: return "vmul";
2756 case ISD::VSDIV: return "vsdiv";
2757 case ISD::VUDIV: return "vudiv";
2758 case ISD::VAND: return "vand";
2759 case ISD::VOR: return "vor";
2760 case ISD::VXOR: return "vxor";
2762 case ISD::SETCC: return "setcc";
2763 case ISD::SELECT: return "select";
2764 case ISD::SELECT_CC: return "select_cc";
2765 case ISD::VSELECT: return "vselect";
2766 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2767 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2768 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2769 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2770 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2771 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2772 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2773 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2774 case ISD::VBIT_CONVERT: return "vbit_convert";
2775 case ISD::ADDC: return "addc";
2776 case ISD::ADDE: return "adde";
2777 case ISD::SUBC: return "subc";
2778 case ISD::SUBE: return "sube";
2779 case ISD::SHL_PARTS: return "shl_parts";
2780 case ISD::SRA_PARTS: return "sra_parts";
2781 case ISD::SRL_PARTS: return "srl_parts";
2783 // Conversion operators.
2784 case ISD::SIGN_EXTEND: return "sign_extend";
2785 case ISD::ZERO_EXTEND: return "zero_extend";
2786 case ISD::ANY_EXTEND: return "any_extend";
2787 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2788 case ISD::TRUNCATE: return "truncate";
2789 case ISD::FP_ROUND: return "fp_round";
2790 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2791 case ISD::FP_EXTEND: return "fp_extend";
2793 case ISD::SINT_TO_FP: return "sint_to_fp";
2794 case ISD::UINT_TO_FP: return "uint_to_fp";
2795 case ISD::FP_TO_SINT: return "fp_to_sint";
2796 case ISD::FP_TO_UINT: return "fp_to_uint";
2797 case ISD::BIT_CONVERT: return "bit_convert";
2799 // Control flow instructions
2800 case ISD::BR: return "br";
2801 case ISD::BRIND: return "brind";
2802 case ISD::BR_JT: return "br_jt";
2803 case ISD::BRCOND: return "brcond";
2804 case ISD::BR_CC: return "br_cc";
2805 case ISD::RET: return "ret";
2806 case ISD::CALLSEQ_START: return "callseq_start";
2807 case ISD::CALLSEQ_END: return "callseq_end";
2810 case ISD::LOAD: return "load";
2811 case ISD::STORE: return "store";
2812 case ISD::VLOAD: return "vload";
2813 case ISD::VAARG: return "vaarg";
2814 case ISD::VACOPY: return "vacopy";
2815 case ISD::VAEND: return "vaend";
2816 case ISD::VASTART: return "vastart";
2817 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2818 case ISD::EXTRACT_ELEMENT: return "extract_element";
2819 case ISD::BUILD_PAIR: return "build_pair";
2820 case ISD::STACKSAVE: return "stacksave";
2821 case ISD::STACKRESTORE: return "stackrestore";
2823 // Block memory operations.
2824 case ISD::MEMSET: return "memset";
2825 case ISD::MEMCPY: return "memcpy";
2826 case ISD::MEMMOVE: return "memmove";
2829 case ISD::BSWAP: return "bswap";
2830 case ISD::CTPOP: return "ctpop";
2831 case ISD::CTTZ: return "cttz";
2832 case ISD::CTLZ: return "ctlz";
2835 case ISD::LOCATION: return "location";
2836 case ISD::DEBUG_LOC: return "debug_loc";
2839 switch (cast<CondCodeSDNode>(this)->get()) {
2840 default: assert(0 && "Unknown setcc condition!");
2841 case ISD::SETOEQ: return "setoeq";
2842 case ISD::SETOGT: return "setogt";
2843 case ISD::SETOGE: return "setoge";
2844 case ISD::SETOLT: return "setolt";
2845 case ISD::SETOLE: return "setole";
2846 case ISD::SETONE: return "setone";
2848 case ISD::SETO: return "seto";
2849 case ISD::SETUO: return "setuo";
2850 case ISD::SETUEQ: return "setue";
2851 case ISD::SETUGT: return "setugt";
2852 case ISD::SETUGE: return "setuge";
2853 case ISD::SETULT: return "setult";
2854 case ISD::SETULE: return "setule";
2855 case ISD::SETUNE: return "setune";
2857 case ISD::SETEQ: return "seteq";
2858 case ISD::SETGT: return "setgt";
2859 case ISD::SETGE: return "setge";
2860 case ISD::SETLT: return "setlt";
2861 case ISD::SETLE: return "setle";
2862 case ISD::SETNE: return "setne";
2867 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
2876 return "<post-inc>";
2878 return "<post-dec>";
2882 void SDNode::dump() const { dump(0); }
2883 void SDNode::dump(const SelectionDAG *G) const {
2884 cerr << (void*)this << ": ";
2886 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
2888 if (getValueType(i) == MVT::Other)
2891 cerr << MVT::getValueTypeString(getValueType(i));
2893 cerr << " = " << getOperationName(G);
2896 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2897 if (i) cerr << ", ";
2898 cerr << (void*)getOperand(i).Val;
2899 if (unsigned RN = getOperand(i).ResNo)
2903 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
2904 cerr << "<" << CSDN->getValue() << ">";
2905 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
2906 cerr << "<" << CSDN->getValue() << ">";
2907 } else if (const GlobalAddressSDNode *GADN =
2908 dyn_cast<GlobalAddressSDNode>(this)) {
2909 int offset = GADN->getOffset();
2911 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
2913 cerr << " + " << offset;
2915 cerr << " " << offset;
2916 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
2917 cerr << "<" << FIDN->getIndex() << ">";
2918 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
2919 cerr << "<" << JTDN->getIndex() << ">";
2920 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
2921 int offset = CP->getOffset();
2922 if (CP->isMachineConstantPoolEntry())
2923 cerr << "<" << *CP->getMachineCPVal() << ">";
2925 cerr << "<" << *CP->getConstVal() << ">";
2927 cerr << " + " << offset;
2929 cerr << " " << offset;
2930 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
2932 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
2934 cerr << LBB->getName() << " ";
2935 cerr << (const void*)BBDN->getBasicBlock() << ">";
2936 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
2937 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
2938 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
2940 cerr << " #" << R->getReg();
2942 } else if (const ExternalSymbolSDNode *ES =
2943 dyn_cast<ExternalSymbolSDNode>(this)) {
2944 cerr << "'" << ES->getSymbol() << "'";
2945 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
2947 cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
2949 cerr << "<null:" << M->getOffset() << ">";
2950 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
2951 cerr << ":" << getValueTypeString(N->getVT());
2952 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
2954 switch (LD->getExtensionType()) {
2955 default: doExt = false; break;
2957 cerr << " <anyext ";
2967 cerr << MVT::getValueTypeString(LD->getLoadedVT()) << ">";
2969 const char *AM = getIndexedModeName(LD->getAddressingMode());
2972 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
2973 if (ST->isTruncatingStore())
2975 << MVT::getValueTypeString(ST->getStoredVT()) << ">";
2977 const char *AM = getIndexedModeName(ST->getAddressingMode());
2983 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
2984 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2985 if (N->getOperand(i).Val->hasOneUse())
2986 DumpNodes(N->getOperand(i).Val, indent+2, G);
2988 cerr << "\n" << std::string(indent+2, ' ')
2989 << (void*)N->getOperand(i).Val << ": <multiple use>";
2992 cerr << "\n" << std::string(indent, ' ');
2996 void SelectionDAG::dump() const {
2997 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
2998 std::vector<const SDNode*> Nodes;
2999 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
3003 std::sort(Nodes.begin(), Nodes.end());
3005 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
3006 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
3007 DumpNodes(Nodes[i], 2, this);
3010 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
3015 const Type *ConstantPoolSDNode::getType() const {
3016 if (isMachineConstantPoolEntry())
3017 return Val.MachineCPVal->getType();
3018 return Val.ConstVal->getType();