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/SmallVector.h"
28 #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 /// AddNodeIDOperand - Add an operands data to the NodeID data.
262 static void AddNodeIDOperand(FoldingSetNodeID &ID, SDOperand Op) {
263 ID.AddPointer(Op.Val);
264 ID.AddInteger(Op.ResNo);
267 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
269 static void AddNodeIDOperands(FoldingSetNodeID &ID) {
271 static void AddNodeIDOperands(FoldingSetNodeID &ID, SDOperand Op) {
272 AddNodeIDOperand(ID, Op);
274 static void AddNodeIDOperands(FoldingSetNodeID &ID,
275 SDOperand Op1, SDOperand Op2) {
276 AddNodeIDOperand(ID, Op1);
277 AddNodeIDOperand(ID, Op2);
279 static void AddNodeIDOperands(FoldingSetNodeID &ID,
280 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
281 AddNodeIDOperand(ID, Op1);
282 AddNodeIDOperand(ID, Op2);
283 AddNodeIDOperand(ID, Op3);
285 static void AddNodeIDOperands(FoldingSetNodeID &ID,
286 const SDOperand *Ops, unsigned NumOps) {
287 for (; NumOps; --NumOps, ++Ops)
288 AddNodeIDOperand(ID, *Ops);
291 /// AddNodeIDOperands - Various routines for adding node info to the NodeID
293 static void AddNodeIDNode(FoldingSetNodeID &ID,
294 unsigned short OpC, SDVTList VTList) {
295 AddNodeIDOpcode(ID, OpC);
296 AddNodeIDValueTypes(ID, VTList);
297 AddNodeIDOperands(ID);
299 static void AddNodeIDNode(FoldingSetNodeID &ID,
300 unsigned short OpC, SDVTList VTList,
302 AddNodeIDOpcode(ID, OpC);
303 AddNodeIDValueTypes(ID, VTList);
304 AddNodeIDOperands(ID, Op);
306 static void AddNodeIDNode(FoldingSetNodeID &ID,
307 unsigned short OpC, SDVTList VTList,
308 SDOperand Op1, SDOperand Op2) {
309 AddNodeIDOpcode(ID, OpC);
310 AddNodeIDValueTypes(ID, VTList);
311 AddNodeIDOperands(ID, Op1, Op2);
313 static void AddNodeIDNode(FoldingSetNodeID &ID,
314 unsigned short OpC, SDVTList VTList,
315 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
316 AddNodeIDOpcode(ID, OpC);
317 AddNodeIDValueTypes(ID, VTList);
318 AddNodeIDOperands(ID, Op1, Op2, Op3);
320 static void AddNodeIDNode(FoldingSetNodeID &ID,
321 unsigned short OpC, SDVTList VTList,
322 const SDOperand *OpList, unsigned N) {
323 AddNodeIDOpcode(ID, OpC);
324 AddNodeIDValueTypes(ID, VTList);
325 AddNodeIDOperands(ID, OpList, N);
328 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
330 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
331 AddNodeIDOpcode(ID, N->getOpcode());
332 // Add the return value info.
333 AddNodeIDValueTypes(ID, N->getVTList());
334 // Add the operand info.
335 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
337 // Handle SDNode leafs with special info.
338 if (N->getNumOperands() == 0) {
339 switch (N->getOpcode()) {
340 default: break; // Normal nodes don't need extra info.
341 case ISD::TargetConstant:
343 ID.AddInteger(cast<ConstantSDNode>(N)->getValue());
345 case ISD::TargetConstantFP:
346 case ISD::ConstantFP:
347 ID.AddDouble(cast<ConstantFPSDNode>(N)->getValue());
349 case ISD::TargetGlobalAddress:
350 case ISD::GlobalAddress: {
351 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
352 ID.AddPointer(GA->getGlobal());
353 ID.AddInteger(GA->getOffset());
356 case ISD::BasicBlock:
357 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
360 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
362 case ISD::SRCVALUE: {
363 SrcValueSDNode *SV = cast<SrcValueSDNode>(N);
364 ID.AddPointer(SV->getValue());
365 ID.AddInteger(SV->getOffset());
368 case ISD::FrameIndex:
369 case ISD::TargetFrameIndex:
370 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
373 case ISD::TargetJumpTable:
374 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
376 case ISD::ConstantPool:
377 case ISD::TargetConstantPool: {
378 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
379 ID.AddInteger(CP->getAlignment());
380 ID.AddInteger(CP->getOffset());
381 if (CP->isMachineConstantPoolEntry())
382 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
384 ID.AddPointer(CP->getConstVal());
388 LoadSDNode *LD = cast<LoadSDNode>(N);
389 ID.AddInteger(LD->getAddressingMode());
390 ID.AddInteger(LD->getExtensionType());
391 ID.AddInteger(LD->getLoadedVT());
392 ID.AddPointer(LD->getSrcValue());
393 ID.AddInteger(LD->getSrcValueOffset());
394 ID.AddInteger(LD->getAlignment());
395 ID.AddInteger(LD->isVolatile());
399 StoreSDNode *ST = cast<StoreSDNode>(N);
400 ID.AddInteger(ST->getAddressingMode());
401 ID.AddInteger(ST->isTruncatingStore());
402 ID.AddInteger(ST->getStoredVT());
403 ID.AddPointer(ST->getSrcValue());
404 ID.AddInteger(ST->getSrcValueOffset());
405 ID.AddInteger(ST->getAlignment());
406 ID.AddInteger(ST->isVolatile());
413 //===----------------------------------------------------------------------===//
414 // SelectionDAG Class
415 //===----------------------------------------------------------------------===//
417 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
419 void SelectionDAG::RemoveDeadNodes() {
420 // Create a dummy node (which is not added to allnodes), that adds a reference
421 // to the root node, preventing it from being deleted.
422 HandleSDNode Dummy(getRoot());
424 SmallVector<SDNode*, 128> DeadNodes;
426 // Add all obviously-dead nodes to the DeadNodes worklist.
427 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
429 DeadNodes.push_back(I);
431 // Process the worklist, deleting the nodes and adding their uses to the
433 while (!DeadNodes.empty()) {
434 SDNode *N = DeadNodes.back();
435 DeadNodes.pop_back();
437 // Take the node out of the appropriate CSE map.
438 RemoveNodeFromCSEMaps(N);
440 // Next, brutally remove the operand list. This is safe to do, as there are
441 // no cycles in the graph.
442 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
443 SDNode *Operand = I->Val;
444 Operand->removeUser(N);
446 // Now that we removed this operand, see if there are no uses of it left.
447 if (Operand->use_empty())
448 DeadNodes.push_back(Operand);
450 delete[] N->OperandList;
454 // Finally, remove N itself.
458 // If the root changed (e.g. it was a dead load, update the root).
459 setRoot(Dummy.getValue());
462 void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) {
463 SmallVector<SDNode*, 16> DeadNodes;
464 DeadNodes.push_back(N);
466 // Process the worklist, deleting the nodes and adding their uses to the
468 while (!DeadNodes.empty()) {
469 SDNode *N = DeadNodes.back();
470 DeadNodes.pop_back();
472 // Take the node out of the appropriate CSE map.
473 RemoveNodeFromCSEMaps(N);
475 // Next, brutally remove the operand list. This is safe to do, as there are
476 // no cycles in the graph.
477 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
478 SDNode *Operand = I->Val;
479 Operand->removeUser(N);
481 // Now that we removed this operand, see if there are no uses of it left.
482 if (Operand->use_empty())
483 DeadNodes.push_back(Operand);
485 delete[] N->OperandList;
489 // Finally, remove N itself.
490 Deleted.push_back(N);
495 void SelectionDAG::DeleteNode(SDNode *N) {
496 assert(N->use_empty() && "Cannot delete a node that is not dead!");
498 // First take this out of the appropriate CSE map.
499 RemoveNodeFromCSEMaps(N);
501 // Finally, remove uses due to operands of this node, remove from the
502 // AllNodes list, and delete the node.
503 DeleteNodeNotInCSEMaps(N);
506 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
508 // Remove it from the AllNodes list.
511 // Drop all of the operands and decrement used nodes use counts.
512 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
513 I->Val->removeUser(N);
514 delete[] N->OperandList;
521 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
522 /// correspond to it. This is useful when we're about to delete or repurpose
523 /// the node. We don't want future request for structurally identical nodes
524 /// to return N anymore.
525 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
527 switch (N->getOpcode()) {
528 case ISD::HANDLENODE: return; // noop.
530 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
533 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
534 "Cond code doesn't exist!");
535 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
536 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
538 case ISD::ExternalSymbol:
539 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
541 case ISD::TargetExternalSymbol:
543 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
546 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
547 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
550 // Remove it from the CSE Map.
551 Erased = CSEMap.RemoveNode(N);
555 // Verify that the node was actually in one of the CSE maps, unless it has a
556 // flag result (which cannot be CSE'd) or is one of the special cases that are
557 // not subject to CSE.
558 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
559 !N->isTargetOpcode()) {
562 assert(0 && "Node is not in map!");
567 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
568 /// has been taken out and modified in some way. If the specified node already
569 /// exists in the CSE maps, do not modify the maps, but return the existing node
570 /// instead. If it doesn't exist, add it and return null.
572 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
573 assert(N->getNumOperands() && "This is a leaf node!");
574 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
575 return 0; // Never add these nodes.
577 // Check that remaining values produced are not flags.
578 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
579 if (N->getValueType(i) == MVT::Flag)
580 return 0; // Never CSE anything that produces a flag.
582 SDNode *New = CSEMap.GetOrInsertNode(N);
583 if (New != N) return New; // Node already existed.
587 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
588 /// were replaced with those specified. If this node is never memoized,
589 /// return null, otherwise return a pointer to the slot it would take. If a
590 /// node already exists with these operands, the slot will be non-null.
591 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
593 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
594 return 0; // Never add these nodes.
596 // Check that remaining values produced are not flags.
597 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
598 if (N->getValueType(i) == MVT::Flag)
599 return 0; // Never CSE anything that produces a flag.
602 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Op);
603 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
606 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
607 /// were replaced with those specified. If this node is never memoized,
608 /// return null, otherwise return a pointer to the slot it would take. If a
609 /// node already exists with these operands, the slot will be non-null.
610 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
611 SDOperand Op1, SDOperand Op2,
613 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
614 return 0; // Never add these nodes.
616 // Check that remaining values produced are not flags.
617 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
618 if (N->getValueType(i) == MVT::Flag)
619 return 0; // Never CSE anything that produces a flag.
622 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Op1, Op2);
623 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
627 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
628 /// were replaced with those specified. If this node is never memoized,
629 /// return null, otherwise return a pointer to the slot it would take. If a
630 /// node already exists with these operands, the slot will be non-null.
631 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
632 const SDOperand *Ops,unsigned NumOps,
634 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
635 return 0; // Never add these nodes.
637 // Check that remaining values produced are not flags.
638 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
639 if (N->getValueType(i) == MVT::Flag)
640 return 0; // Never CSE anything that produces a flag.
643 AddNodeIDNode(ID, N->getOpcode(), N->getVTList());
645 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
646 ID.AddInteger(LD->getAddressingMode());
647 ID.AddInteger(LD->getExtensionType());
648 ID.AddInteger(LD->getLoadedVT());
649 ID.AddPointer(LD->getSrcValue());
650 ID.AddInteger(LD->getSrcValueOffset());
651 ID.AddInteger(LD->getAlignment());
652 ID.AddInteger(LD->isVolatile());
653 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
654 ID.AddInteger(ST->getAddressingMode());
655 ID.AddInteger(ST->isTruncatingStore());
656 ID.AddInteger(ST->getStoredVT());
657 ID.AddPointer(ST->getSrcValue());
658 ID.AddInteger(ST->getSrcValueOffset());
659 ID.AddInteger(ST->getAlignment());
660 ID.AddInteger(ST->isVolatile());
663 AddNodeIDOperands(ID, Ops, NumOps);
664 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
668 SelectionDAG::~SelectionDAG() {
669 while (!AllNodes.empty()) {
670 SDNode *N = AllNodes.begin();
671 N->SetNextInBucket(0);
672 delete [] N->OperandList;
675 AllNodes.pop_front();
679 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
680 if (Op.getValueType() == VT) return Op;
681 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
682 return getNode(ISD::AND, Op.getValueType(), Op,
683 getConstant(Imm, Op.getValueType()));
686 SDOperand SelectionDAG::getString(const std::string &Val) {
687 StringSDNode *&N = StringNodes[Val];
689 N = new StringSDNode(Val);
690 AllNodes.push_back(N);
692 return SDOperand(N, 0);
695 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
696 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
697 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
699 // Mask out any bits that are not valid for this constant.
700 Val &= MVT::getIntVTBitMask(VT);
702 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
704 AddNodeIDNode(ID, Opc, getVTList(VT));
707 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
708 return SDOperand(E, 0);
709 SDNode *N = new ConstantSDNode(isT, Val, VT);
710 CSEMap.InsertNode(N, IP);
711 AllNodes.push_back(N);
712 return SDOperand(N, 0);
716 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
718 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
720 Val = (float)Val; // Mask out extra precision.
722 // Do the map lookup using the actual bit pattern for the floating point
723 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
724 // we don't have issues with SNANs.
725 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
727 AddNodeIDNode(ID, Opc, getVTList(VT));
730 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
731 return SDOperand(E, 0);
732 SDNode *N = new ConstantFPSDNode(isTarget, Val, VT);
733 CSEMap.InsertNode(N, IP);
734 AllNodes.push_back(N);
735 return SDOperand(N, 0);
738 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
739 MVT::ValueType VT, int Offset,
741 unsigned Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
743 AddNodeIDNode(ID, Opc, getVTList(VT));
745 ID.AddInteger(Offset);
747 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
748 return SDOperand(E, 0);
749 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
750 CSEMap.InsertNode(N, IP);
751 AllNodes.push_back(N);
752 return SDOperand(N, 0);
755 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
757 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
759 AddNodeIDNode(ID, Opc, getVTList(VT));
762 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
763 return SDOperand(E, 0);
764 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
765 CSEMap.InsertNode(N, IP);
766 AllNodes.push_back(N);
767 return SDOperand(N, 0);
770 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
771 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
773 AddNodeIDNode(ID, Opc, getVTList(VT));
776 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
777 return SDOperand(E, 0);
778 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
779 CSEMap.InsertNode(N, IP);
780 AllNodes.push_back(N);
781 return SDOperand(N, 0);
784 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
785 unsigned Alignment, int Offset,
787 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
789 AddNodeIDNode(ID, Opc, getVTList(VT));
790 ID.AddInteger(Alignment);
791 ID.AddInteger(Offset);
794 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
795 return SDOperand(E, 0);
796 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
797 CSEMap.InsertNode(N, IP);
798 AllNodes.push_back(N);
799 return SDOperand(N, 0);
803 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
805 unsigned Alignment, int Offset,
807 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
809 AddNodeIDNode(ID, Opc, getVTList(VT));
810 ID.AddInteger(Alignment);
811 ID.AddInteger(Offset);
812 C->AddSelectionDAGCSEId(ID);
814 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
815 return SDOperand(E, 0);
816 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
817 CSEMap.InsertNode(N, IP);
818 AllNodes.push_back(N);
819 return SDOperand(N, 0);
823 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
825 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other));
828 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
829 return SDOperand(E, 0);
830 SDNode *N = new BasicBlockSDNode(MBB);
831 CSEMap.InsertNode(N, IP);
832 AllNodes.push_back(N);
833 return SDOperand(N, 0);
836 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
837 if ((unsigned)VT >= ValueTypeNodes.size())
838 ValueTypeNodes.resize(VT+1);
839 if (ValueTypeNodes[VT] == 0) {
840 ValueTypeNodes[VT] = new VTSDNode(VT);
841 AllNodes.push_back(ValueTypeNodes[VT]);
844 return SDOperand(ValueTypeNodes[VT], 0);
847 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
848 SDNode *&N = ExternalSymbols[Sym];
849 if (N) return SDOperand(N, 0);
850 N = new ExternalSymbolSDNode(false, Sym, VT);
851 AllNodes.push_back(N);
852 return SDOperand(N, 0);
855 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
857 SDNode *&N = TargetExternalSymbols[Sym];
858 if (N) return SDOperand(N, 0);
859 N = new ExternalSymbolSDNode(true, Sym, VT);
860 AllNodes.push_back(N);
861 return SDOperand(N, 0);
864 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
865 if ((unsigned)Cond >= CondCodeNodes.size())
866 CondCodeNodes.resize(Cond+1);
868 if (CondCodeNodes[Cond] == 0) {
869 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
870 AllNodes.push_back(CondCodeNodes[Cond]);
872 return SDOperand(CondCodeNodes[Cond], 0);
875 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
877 AddNodeIDNode(ID, ISD::Register, getVTList(VT));
878 ID.AddInteger(RegNo);
880 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
881 return SDOperand(E, 0);
882 SDNode *N = new RegisterSDNode(RegNo, VT);
883 CSEMap.InsertNode(N, IP);
884 AllNodes.push_back(N);
885 return SDOperand(N, 0);
888 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
889 assert((!V || isa<PointerType>(V->getType())) &&
890 "SrcValue is not a pointer?");
893 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other));
895 ID.AddInteger(Offset);
897 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
898 return SDOperand(E, 0);
899 SDNode *N = new SrcValueSDNode(V, Offset);
900 CSEMap.InsertNode(N, IP);
901 AllNodes.push_back(N);
902 return SDOperand(N, 0);
905 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
906 SDOperand N2, ISD::CondCode Cond) {
907 // These setcc operations always fold.
911 case ISD::SETFALSE2: return getConstant(0, VT);
913 case ISD::SETTRUE2: return getConstant(1, VT);
925 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
929 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
930 uint64_t C2 = N2C->getValue();
931 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
932 uint64_t C1 = N1C->getValue();
934 // Sign extend the operands if required
935 if (ISD::isSignedIntSetCC(Cond)) {
936 C1 = N1C->getSignExtended();
937 C2 = N2C->getSignExtended();
941 default: assert(0 && "Unknown integer setcc!");
942 case ISD::SETEQ: return getConstant(C1 == C2, VT);
943 case ISD::SETNE: return getConstant(C1 != C2, VT);
944 case ISD::SETULT: return getConstant(C1 < C2, VT);
945 case ISD::SETUGT: return getConstant(C1 > C2, VT);
946 case ISD::SETULE: return getConstant(C1 <= C2, VT);
947 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
948 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
949 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
950 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
951 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
955 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
956 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
957 double C1 = N1C->getValue(), C2 = N2C->getValue();
960 default: break; // FIXME: Implement the rest of these!
961 case ISD::SETEQ: return getConstant(C1 == C2, VT);
962 case ISD::SETNE: return getConstant(C1 != C2, VT);
963 case ISD::SETLT: return getConstant(C1 < C2, VT);
964 case ISD::SETGT: return getConstant(C1 > C2, VT);
965 case ISD::SETLE: return getConstant(C1 <= C2, VT);
966 case ISD::SETGE: return getConstant(C1 >= C2, VT);
969 // Ensure that the constant occurs on the RHS.
970 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
973 // Could not fold it.
978 /// getNode - Gets or creates the specified node.
980 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
982 AddNodeIDNode(ID, Opcode, getVTList(VT));
984 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
985 return SDOperand(E, 0);
986 SDNode *N = new SDNode(Opcode, VT);
987 CSEMap.InsertNode(N, IP);
989 AllNodes.push_back(N);
990 return SDOperand(N, 0);
993 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
996 // Constant fold unary operations with an integer constant operand.
997 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
998 uint64_t Val = C->getValue();
1001 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1002 case ISD::ANY_EXTEND:
1003 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1004 case ISD::TRUNCATE: return getConstant(Val, VT);
1005 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
1006 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
1007 case ISD::BIT_CONVERT:
1008 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1009 return getConstantFP(BitsToFloat(Val), VT);
1010 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1011 return getConstantFP(BitsToDouble(Val), VT);
1015 default: assert(0 && "Invalid bswap!"); break;
1016 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1017 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1018 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1023 default: assert(0 && "Invalid ctpop!"); break;
1024 case MVT::i1: return getConstant(Val != 0, VT);
1026 Tmp1 = (unsigned)Val & 0xFF;
1027 return getConstant(CountPopulation_32(Tmp1), VT);
1029 Tmp1 = (unsigned)Val & 0xFFFF;
1030 return getConstant(CountPopulation_32(Tmp1), VT);
1032 return getConstant(CountPopulation_32((unsigned)Val), VT);
1034 return getConstant(CountPopulation_64(Val), VT);
1038 default: assert(0 && "Invalid ctlz!"); break;
1039 case MVT::i1: return getConstant(Val == 0, VT);
1041 Tmp1 = (unsigned)Val & 0xFF;
1042 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1044 Tmp1 = (unsigned)Val & 0xFFFF;
1045 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1047 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1049 return getConstant(CountLeadingZeros_64(Val), VT);
1053 default: assert(0 && "Invalid cttz!"); break;
1054 case MVT::i1: return getConstant(Val == 0, VT);
1056 Tmp1 = (unsigned)Val | 0x100;
1057 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1059 Tmp1 = (unsigned)Val | 0x10000;
1060 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1062 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1064 return getConstant(CountTrailingZeros_64(Val), VT);
1069 // Constant fold unary operations with an floating point constant operand.
1070 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1073 return getConstantFP(-C->getValue(), VT);
1075 return getConstantFP(fabs(C->getValue()), VT);
1077 case ISD::FP_EXTEND:
1078 return getConstantFP(C->getValue(), VT);
1079 case ISD::FP_TO_SINT:
1080 return getConstant((int64_t)C->getValue(), VT);
1081 case ISD::FP_TO_UINT:
1082 return getConstant((uint64_t)C->getValue(), VT);
1083 case ISD::BIT_CONVERT:
1084 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1085 return getConstant(FloatToBits(C->getValue()), VT);
1086 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1087 return getConstant(DoubleToBits(C->getValue()), VT);
1091 unsigned OpOpcode = Operand.Val->getOpcode();
1093 case ISD::TokenFactor:
1094 return Operand; // Factor of one node? No factor.
1095 case ISD::SIGN_EXTEND:
1096 if (Operand.getValueType() == VT) return Operand; // noop extension
1097 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1098 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1099 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1101 case ISD::ZERO_EXTEND:
1102 if (Operand.getValueType() == VT) return Operand; // noop extension
1103 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1104 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1105 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1107 case ISD::ANY_EXTEND:
1108 if (Operand.getValueType() == VT) return Operand; // noop extension
1109 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1110 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1111 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1112 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1115 if (Operand.getValueType() == VT) return Operand; // noop truncate
1116 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1117 if (OpOpcode == ISD::TRUNCATE)
1118 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1119 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1120 OpOpcode == ISD::ANY_EXTEND) {
1121 // If the source is smaller than the dest, we still need an extend.
1122 if (Operand.Val->getOperand(0).getValueType() < VT)
1123 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1124 else if (Operand.Val->getOperand(0).getValueType() > VT)
1125 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1127 return Operand.Val->getOperand(0);
1130 case ISD::BIT_CONVERT:
1131 // Basic sanity checking.
1132 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1133 && "Cannot BIT_CONVERT between types of different sizes!");
1134 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1135 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1136 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1137 if (OpOpcode == ISD::UNDEF)
1138 return getNode(ISD::UNDEF, VT);
1140 case ISD::SCALAR_TO_VECTOR:
1141 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1142 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1143 "Illegal SCALAR_TO_VECTOR node!");
1146 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1147 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1148 Operand.Val->getOperand(0));
1149 if (OpOpcode == ISD::FNEG) // --X -> X
1150 return Operand.Val->getOperand(0);
1153 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1154 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1159 SDVTList VTs = getVTList(VT);
1160 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1161 FoldingSetNodeID ID;
1162 AddNodeIDNode(ID, Opcode, VTs, Operand);
1164 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1165 return SDOperand(E, 0);
1166 N = new SDNode(Opcode, Operand);
1167 N->setValueTypes(VTs);
1168 CSEMap.InsertNode(N, IP);
1170 N = new SDNode(Opcode, Operand);
1171 N->setValueTypes(VTs);
1173 AllNodes.push_back(N);
1174 return SDOperand(N, 0);
1179 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1180 SDOperand N1, SDOperand N2) {
1183 case ISD::TokenFactor:
1184 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1185 N2.getValueType() == MVT::Other && "Invalid token factor!");
1194 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1201 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1208 assert(N1.getValueType() == N2.getValueType() &&
1209 N1.getValueType() == VT && "Binary operator types must match!");
1211 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1212 assert(N1.getValueType() == VT &&
1213 MVT::isFloatingPoint(N1.getValueType()) &&
1214 MVT::isFloatingPoint(N2.getValueType()) &&
1215 "Invalid FCOPYSIGN!");
1222 assert(VT == N1.getValueType() &&
1223 "Shift operators return type must be the same as their first arg");
1224 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1225 VT != MVT::i1 && "Shifts only work on integers");
1227 case ISD::FP_ROUND_INREG: {
1228 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1229 assert(VT == N1.getValueType() && "Not an inreg round!");
1230 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1231 "Cannot FP_ROUND_INREG integer types");
1232 assert(EVT <= VT && "Not rounding down!");
1235 case ISD::AssertSext:
1236 case ISD::AssertZext:
1237 case ISD::SIGN_EXTEND_INREG: {
1238 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1239 assert(VT == N1.getValueType() && "Not an inreg extend!");
1240 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1241 "Cannot *_EXTEND_INREG FP types");
1242 assert(EVT <= VT && "Not extending!");
1249 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1250 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1252 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1253 int64_t Val = N1C->getValue();
1254 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1255 Val <<= 64-FromBits;
1256 Val >>= 64-FromBits;
1257 return getConstant(Val, VT);
1261 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1263 case ISD::ADD: return getConstant(C1 + C2, VT);
1264 case ISD::SUB: return getConstant(C1 - C2, VT);
1265 case ISD::MUL: return getConstant(C1 * C2, VT);
1267 if (C2) return getConstant(C1 / C2, VT);
1270 if (C2) return getConstant(C1 % C2, VT);
1273 if (C2) return getConstant(N1C->getSignExtended() /
1274 N2C->getSignExtended(), VT);
1277 if (C2) return getConstant(N1C->getSignExtended() %
1278 N2C->getSignExtended(), VT);
1280 case ISD::AND : return getConstant(C1 & C2, VT);
1281 case ISD::OR : return getConstant(C1 | C2, VT);
1282 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1283 case ISD::SHL : return getConstant(C1 << C2, VT);
1284 case ISD::SRL : return getConstant(C1 >> C2, VT);
1285 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1287 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1290 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1294 } else { // Cannonicalize constant to RHS if commutative
1295 if (isCommutativeBinOp(Opcode)) {
1296 std::swap(N1C, N2C);
1302 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1303 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1306 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1308 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1309 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1310 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1312 if (C2) return getConstantFP(C1 / C2, VT);
1315 if (C2) return getConstantFP(fmod(C1, C2), VT);
1317 case ISD::FCOPYSIGN: {
1328 if (u2.I < 0) // Sign bit of RHS set?
1329 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1331 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1332 return getConstantFP(u1.F, VT);
1336 } else { // Cannonicalize constant to RHS if commutative
1337 if (isCommutativeBinOp(Opcode)) {
1338 std::swap(N1CFP, N2CFP);
1344 // Canonicalize an UNDEF to the RHS, even over a constant.
1345 if (N1.getOpcode() == ISD::UNDEF) {
1346 if (isCommutativeBinOp(Opcode)) {
1350 case ISD::FP_ROUND_INREG:
1351 case ISD::SIGN_EXTEND_INREG:
1357 return N1; // fold op(undef, arg2) -> undef
1364 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1369 // Fold a bunch of operators when the RHS is undef.
1370 if (N2.getOpcode() == ISD::UNDEF) {
1384 return N2; // fold op(arg1, undef) -> undef
1389 return getConstant(0, VT); // fold op(arg1, undef) -> 0
1391 return getConstant(MVT::getIntVTBitMask(VT), VT);
1400 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
1401 // worth handling here.
1402 if (N2C && N2C->getValue() == 0)
1407 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
1408 // worth handling here.
1409 if (N2C && N2C->getValue() == 0)
1412 case ISD::FP_ROUND_INREG:
1413 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1415 case ISD::SIGN_EXTEND_INREG: {
1416 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1417 if (EVT == VT) return N1; // Not actually extending
1420 case ISD::EXTRACT_ELEMENT:
1421 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
1423 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
1424 // 64-bit integers into 32-bit parts. Instead of building the extract of
1425 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
1426 if (N1.getOpcode() == ISD::BUILD_PAIR)
1427 return N1.getOperand(N2C->getValue());
1429 // EXTRACT_ELEMENT of a constant int is also very common.
1430 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
1431 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
1432 return getConstant(C->getValue() >> Shift, VT);
1436 // FIXME: figure out how to safely handle things like
1437 // int foo(int x) { return 1 << (x & 255); }
1438 // int bar() { return foo(256); }
1443 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1444 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1445 return getNode(Opcode, VT, N1, N2.getOperand(0));
1446 else if (N2.getOpcode() == ISD::AND)
1447 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1448 // If the and is only masking out bits that cannot effect the shift,
1449 // eliminate the and.
1450 unsigned NumBits = MVT::getSizeInBits(VT);
1451 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1452 return getNode(Opcode, VT, N1, N2.getOperand(0));
1458 // Memoize this node if possible.
1460 SDVTList VTs = getVTList(VT);
1461 if (VT != MVT::Flag) {
1462 FoldingSetNodeID ID;
1463 AddNodeIDNode(ID, Opcode, VTs, N1, N2);
1465 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1466 return SDOperand(E, 0);
1467 N = new SDNode(Opcode, N1, N2);
1468 N->setValueTypes(VTs);
1469 CSEMap.InsertNode(N, IP);
1471 N = new SDNode(Opcode, N1, N2);
1472 N->setValueTypes(VTs);
1475 AllNodes.push_back(N);
1476 return SDOperand(N, 0);
1479 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1480 SDOperand N1, SDOperand N2, SDOperand N3) {
1481 // Perform various simplifications.
1482 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1483 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1486 // Use FoldSetCC to simplify SETCC's.
1487 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1488 if (Simp.Val) return Simp;
1493 if (N1C->getValue())
1494 return N2; // select true, X, Y -> X
1496 return N3; // select false, X, Y -> Y
1498 if (N2 == N3) return N2; // select C, X, X -> X
1502 if (N2C->getValue()) // Unconditional branch
1503 return getNode(ISD::BR, MVT::Other, N1, N3);
1505 return N1; // Never-taken branch
1507 case ISD::VECTOR_SHUFFLE:
1508 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1509 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1510 N3.getOpcode() == ISD::BUILD_VECTOR &&
1511 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1512 "Illegal VECTOR_SHUFFLE node!");
1516 // Memoize node if it doesn't produce a flag.
1518 SDVTList VTs = getVTList(VT);
1519 if (VT != MVT::Flag) {
1520 FoldingSetNodeID ID;
1521 AddNodeIDNode(ID, Opcode, VTs, N1, N2, N3);
1523 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1524 return SDOperand(E, 0);
1525 N = new SDNode(Opcode, N1, N2, N3);
1526 N->setValueTypes(VTs);
1527 CSEMap.InsertNode(N, IP);
1529 N = new SDNode(Opcode, N1, N2, N3);
1530 N->setValueTypes(VTs);
1532 AllNodes.push_back(N);
1533 return SDOperand(N, 0);
1536 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1537 SDOperand N1, SDOperand N2, SDOperand N3,
1539 SDOperand Ops[] = { N1, N2, N3, N4 };
1540 return getNode(Opcode, VT, Ops, 4);
1543 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1544 SDOperand N1, SDOperand N2, SDOperand N3,
1545 SDOperand N4, SDOperand N5) {
1546 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
1547 return getNode(Opcode, VT, Ops, 5);
1550 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1551 SDOperand Chain, SDOperand Ptr,
1552 const Value *SV, int SVOffset,
1554 // FIXME: Alignment == 1 for now.
1555 unsigned Alignment = 1;
1556 SDVTList VTs = getVTList(VT, MVT::Other);
1557 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1558 FoldingSetNodeID ID;
1559 AddNodeIDNode(ID, ISD::LOAD, VTs, Chain, Ptr, Undef);
1560 ID.AddInteger(ISD::UNINDEXED);
1561 ID.AddInteger(ISD::NON_EXTLOAD);
1564 ID.AddInteger(SVOffset);
1565 ID.AddInteger(Alignment);
1566 ID.AddInteger(isVolatile);
1568 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1569 return SDOperand(E, 0);
1570 SDNode *N = new LoadSDNode(Chain, Ptr, Undef, ISD::UNINDEXED,
1571 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
1573 N->setValueTypes(VTs);
1574 CSEMap.InsertNode(N, IP);
1575 AllNodes.push_back(N);
1576 return SDOperand(N, 0);
1579 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
1580 SDOperand Chain, SDOperand Ptr, const Value *SV,
1581 int SVOffset, MVT::ValueType EVT,
1583 // If they are asking for an extending load from/to the same thing, return a
1586 ExtType = ISD::NON_EXTLOAD;
1588 if (MVT::isVector(VT))
1589 assert(EVT == MVT::getVectorBaseType(VT) && "Invalid vector extload!");
1591 assert(EVT < VT && "Should only be an extending load, not truncating!");
1592 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
1593 "Cannot sign/zero extend a FP/Vector load!");
1594 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
1595 "Cannot convert from FP to Int or Int -> FP!");
1597 // FIXME: Alignment == 1 for now.
1598 unsigned Alignment = 1;
1599 SDVTList VTs = getVTList(VT, MVT::Other);
1600 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1601 FoldingSetNodeID ID;
1602 AddNodeIDNode(ID, ISD::LOAD, VTs, Chain, Ptr, Undef);
1603 ID.AddInteger(ISD::UNINDEXED);
1604 ID.AddInteger(ExtType);
1607 ID.AddInteger(SVOffset);
1608 ID.AddInteger(Alignment);
1609 ID.AddInteger(isVolatile);
1611 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1612 return SDOperand(E, 0);
1613 SDNode *N = new LoadSDNode(Chain, Ptr, Undef, ISD::UNINDEXED, ExtType, EVT,
1614 SV, SVOffset, Alignment, isVolatile);
1615 N->setValueTypes(VTs);
1616 CSEMap.InsertNode(N, IP);
1617 AllNodes.push_back(N);
1618 return SDOperand(N, 0);
1622 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
1623 SDOperand Offset, ISD::MemIndexedMode AM) {
1624 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
1625 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
1626 "Load is already a indexed load!");
1627 MVT::ValueType VT = OrigLoad.getValueType();
1628 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
1629 FoldingSetNodeID ID;
1630 AddNodeIDNode(ID, ISD::LOAD, VTs, LD->getChain(), Base, Offset);
1632 ID.AddInteger(LD->getExtensionType());
1633 ID.AddInteger(LD->getLoadedVT());
1634 ID.AddPointer(LD->getSrcValue());
1635 ID.AddInteger(LD->getSrcValueOffset());
1636 ID.AddInteger(LD->getAlignment());
1637 ID.AddInteger(LD->isVolatile());
1639 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1640 return SDOperand(E, 0);
1641 SDNode *N = new LoadSDNode(LD->getChain(), Base, Offset, AM,
1642 LD->getExtensionType(), LD->getLoadedVT(),
1643 LD->getSrcValue(), LD->getSrcValueOffset(),
1644 LD->getAlignment(), LD->isVolatile());
1645 N->setValueTypes(VTs);
1646 CSEMap.InsertNode(N, IP);
1647 AllNodes.push_back(N);
1648 return SDOperand(N, 0);
1651 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1652 SDOperand Chain, SDOperand Ptr,
1654 SDOperand Ops[] = { Chain, Ptr, SV, getConstant(Count, MVT::i32),
1655 getValueType(EVT) };
1656 return getNode(ISD::VLOAD, getVTList(MVT::Vector, MVT::Other), Ops, 5);
1659 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
1660 SDOperand Ptr, const Value *SV, int SVOffset,
1662 MVT::ValueType VT = Val.getValueType();
1664 // FIXME: Alignment == 1 for now.
1665 unsigned Alignment = 1;
1666 SDVTList VTs = getVTList(MVT::Other);
1667 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1668 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1669 FoldingSetNodeID ID;
1670 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1671 ID.AddInteger(ISD::UNINDEXED);
1672 ID.AddInteger(false);
1675 ID.AddInteger(SVOffset);
1676 ID.AddInteger(Alignment);
1677 ID.AddInteger(isVolatile);
1679 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1680 return SDOperand(E, 0);
1681 SDNode *N = new StoreSDNode(Chain, Val, Ptr, Undef, ISD::UNINDEXED, false,
1682 VT, SV, SVOffset, Alignment, isVolatile);
1683 N->setValueTypes(VTs);
1684 CSEMap.InsertNode(N, IP);
1685 AllNodes.push_back(N);
1686 return SDOperand(N, 0);
1689 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
1690 SDOperand Ptr, const Value *SV,
1691 int SVOffset, MVT::ValueType SVT,
1693 MVT::ValueType VT = Val.getValueType();
1694 bool isTrunc = VT != SVT;
1696 assert(VT > SVT && "Not a truncation?");
1697 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
1698 "Can't do FP-INT conversion!");
1700 // FIXME: Alignment == 1 for now.
1701 unsigned Alignment = 1;
1702 SDVTList VTs = getVTList(MVT::Other);
1703 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1704 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1705 FoldingSetNodeID ID;
1706 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1707 ID.AddInteger(ISD::UNINDEXED);
1708 ID.AddInteger(isTrunc);
1711 ID.AddInteger(SVOffset);
1712 ID.AddInteger(Alignment);
1713 ID.AddInteger(isVolatile);
1715 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1716 return SDOperand(E, 0);
1717 SDNode *N = new StoreSDNode(Chain, Val, Ptr, Undef, ISD::UNINDEXED, isTrunc,
1718 SVT, SV, SVOffset, Alignment, isVolatile);
1719 N->setValueTypes(VTs);
1720 CSEMap.InsertNode(N, IP);
1721 AllNodes.push_back(N);
1722 return SDOperand(N, 0);
1726 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
1727 SDOperand Offset, ISD::MemIndexedMode AM) {
1728 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
1729 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
1730 "Store is already a indexed store!");
1731 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
1732 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
1733 FoldingSetNodeID ID;
1734 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1736 ID.AddInteger(ST->isTruncatingStore());
1737 ID.AddInteger(ST->getStoredVT());
1738 ID.AddPointer(ST->getSrcValue());
1739 ID.AddInteger(ST->getSrcValueOffset());
1740 ID.AddInteger(ST->getAlignment());
1741 ID.AddInteger(ST->isVolatile());
1743 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1744 return SDOperand(E, 0);
1745 SDNode *N = new StoreSDNode(ST->getChain(), ST->getValue(),
1747 ST->isTruncatingStore(), ST->getStoredVT(),
1748 ST->getSrcValue(), ST->getSrcValueOffset(),
1749 ST->getAlignment(), ST->isVolatile());
1750 N->setValueTypes(VTs);
1751 CSEMap.InsertNode(N, IP);
1752 AllNodes.push_back(N);
1753 return SDOperand(N, 0);
1756 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1757 SDOperand Chain, SDOperand Ptr,
1759 SDOperand Ops[] = { Chain, Ptr, SV };
1760 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
1763 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1764 const SDOperand *Ops, unsigned NumOps) {
1766 case 0: return getNode(Opcode, VT);
1767 case 1: return getNode(Opcode, VT, Ops[0]);
1768 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1769 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1775 case ISD::SELECT_CC: {
1776 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
1777 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1778 "LHS and RHS of condition must have same type!");
1779 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1780 "True and False arms of SelectCC must have same type!");
1781 assert(Ops[2].getValueType() == VT &&
1782 "select_cc node must be of same type as true and false value!");
1786 assert(NumOps == 5 && "BR_CC takes 5 operands!");
1787 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1788 "LHS/RHS of comparison should match types!");
1795 SDVTList VTs = getVTList(VT);
1796 if (VT != MVT::Flag) {
1797 FoldingSetNodeID ID;
1798 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
1800 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1801 return SDOperand(E, 0);
1802 N = new SDNode(Opcode, Ops, NumOps);
1803 N->setValueTypes(VTs);
1804 CSEMap.InsertNode(N, IP);
1806 N = new SDNode(Opcode, Ops, NumOps);
1807 N->setValueTypes(VTs);
1809 AllNodes.push_back(N);
1810 return SDOperand(N, 0);
1813 SDOperand SelectionDAG::getNode(unsigned Opcode,
1814 std::vector<MVT::ValueType> &ResultTys,
1815 const SDOperand *Ops, unsigned NumOps) {
1816 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
1820 SDOperand SelectionDAG::getNode(unsigned Opcode,
1821 const MVT::ValueType *VTs, unsigned NumVTs,
1822 const SDOperand *Ops, unsigned NumOps) {
1824 return getNode(Opcode, VTs[0], Ops, NumOps);
1825 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
1828 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
1829 const SDOperand *Ops, unsigned NumOps) {
1830 if (VTList.NumVTs == 1)
1831 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
1834 // FIXME: figure out how to safely handle things like
1835 // int foo(int x) { return 1 << (x & 255); }
1836 // int bar() { return foo(256); }
1838 case ISD::SRA_PARTS:
1839 case ISD::SRL_PARTS:
1840 case ISD::SHL_PARTS:
1841 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1842 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1843 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1844 else if (N3.getOpcode() == ISD::AND)
1845 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1846 // If the and is only masking out bits that cannot effect the shift,
1847 // eliminate the and.
1848 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1849 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1850 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1856 // Memoize the node unless it returns a flag.
1858 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
1859 FoldingSetNodeID ID;
1860 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
1862 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1863 return SDOperand(E, 0);
1864 N = new SDNode(Opcode, Ops, NumOps);
1865 N->setValueTypes(VTList);
1866 CSEMap.InsertNode(N, IP);
1868 N = new SDNode(Opcode, Ops, NumOps);
1869 N->setValueTypes(VTList);
1871 AllNodes.push_back(N);
1872 return SDOperand(N, 0);
1875 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
1876 return makeVTList(SDNode::getValueTypeList(VT), 1);
1879 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
1880 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1881 E = VTList.end(); I != E; ++I) {
1882 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
1883 return makeVTList(&(*I)[0], 2);
1885 std::vector<MVT::ValueType> V;
1888 VTList.push_front(V);
1889 return makeVTList(&(*VTList.begin())[0], 2);
1891 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
1892 MVT::ValueType VT3) {
1893 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1894 E = VTList.end(); I != E; ++I) {
1895 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
1897 return makeVTList(&(*I)[0], 3);
1899 std::vector<MVT::ValueType> V;
1903 VTList.push_front(V);
1904 return makeVTList(&(*VTList.begin())[0], 3);
1907 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
1909 case 0: assert(0 && "Cannot have nodes without results!");
1910 case 1: return makeVTList(SDNode::getValueTypeList(VTs[0]), 1);
1911 case 2: return getVTList(VTs[0], VTs[1]);
1912 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
1916 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1917 E = VTList.end(); I != E; ++I) {
1918 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
1920 bool NoMatch = false;
1921 for (unsigned i = 2; i != NumVTs; ++i)
1922 if (VTs[i] != (*I)[i]) {
1927 return makeVTList(&*I->begin(), NumVTs);
1930 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
1931 return makeVTList(&*VTList.begin()->begin(), NumVTs);
1935 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1936 /// specified operands. If the resultant node already exists in the DAG,
1937 /// this does not modify the specified node, instead it returns the node that
1938 /// already exists. If the resultant node does not exist in the DAG, the
1939 /// input node is returned. As a degenerate case, if you specify the same
1940 /// input operands as the node already has, the input node is returned.
1941 SDOperand SelectionDAG::
1942 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1943 SDNode *N = InN.Val;
1944 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1946 // Check to see if there is no change.
1947 if (Op == N->getOperand(0)) return InN;
1949 // See if the modified node already exists.
1950 void *InsertPos = 0;
1951 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
1952 return SDOperand(Existing, InN.ResNo);
1954 // Nope it doesn't. Remove the node from it's current place in the maps.
1956 RemoveNodeFromCSEMaps(N);
1958 // Now we update the operands.
1959 N->OperandList[0].Val->removeUser(N);
1961 N->OperandList[0] = Op;
1963 // If this gets put into a CSE map, add it.
1964 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
1968 SDOperand SelectionDAG::
1969 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1970 SDNode *N = InN.Val;
1971 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1973 // Check to see if there is no change.
1974 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1975 return InN; // No operands changed, just return the input node.
1977 // See if the modified node already exists.
1978 void *InsertPos = 0;
1979 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
1980 return SDOperand(Existing, InN.ResNo);
1982 // Nope it doesn't. Remove the node from it's current place in the maps.
1984 RemoveNodeFromCSEMaps(N);
1986 // Now we update the operands.
1987 if (N->OperandList[0] != Op1) {
1988 N->OperandList[0].Val->removeUser(N);
1989 Op1.Val->addUser(N);
1990 N->OperandList[0] = Op1;
1992 if (N->OperandList[1] != Op2) {
1993 N->OperandList[1].Val->removeUser(N);
1994 Op2.Val->addUser(N);
1995 N->OperandList[1] = Op2;
1998 // If this gets put into a CSE map, add it.
1999 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2003 SDOperand SelectionDAG::
2004 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2005 SDOperand Ops[] = { Op1, Op2, Op3 };
2006 return UpdateNodeOperands(N, Ops, 3);
2009 SDOperand SelectionDAG::
2010 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2011 SDOperand Op3, SDOperand Op4) {
2012 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
2013 return UpdateNodeOperands(N, Ops, 4);
2016 SDOperand SelectionDAG::
2017 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2018 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2019 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
2020 return UpdateNodeOperands(N, Ops, 5);
2024 SDOperand SelectionDAG::
2025 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
2026 SDNode *N = InN.Val;
2027 assert(N->getNumOperands() == NumOps &&
2028 "Update with wrong number of operands");
2030 // Check to see if there is no change.
2031 bool AnyChange = false;
2032 for (unsigned i = 0; i != NumOps; ++i) {
2033 if (Ops[i] != N->getOperand(i)) {
2039 // No operands changed, just return the input node.
2040 if (!AnyChange) return InN;
2042 // See if the modified node already exists.
2043 void *InsertPos = 0;
2044 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2045 return SDOperand(Existing, InN.ResNo);
2047 // Nope it doesn't. Remove the node from it's current place in the maps.
2049 RemoveNodeFromCSEMaps(N);
2051 // Now we update the operands.
2052 for (unsigned i = 0; i != NumOps; ++i) {
2053 if (N->OperandList[i] != Ops[i]) {
2054 N->OperandList[i].Val->removeUser(N);
2055 Ops[i].Val->addUser(N);
2056 N->OperandList[i] = Ops[i];
2060 // If this gets put into a CSE map, add it.
2061 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2068 /// SelectNodeTo - These are used for target selectors to *mutate* the
2069 /// specified node to have the specified return type, Target opcode, and
2070 /// operands. Note that target opcodes are stored as
2071 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
2073 /// Note that SelectNodeTo returns the resultant node. If there is already a
2074 /// node of the specified opcode and operands, it returns that node instead of
2075 /// the current one.
2076 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2077 MVT::ValueType VT) {
2078 SDVTList VTs = getVTList(VT);
2079 FoldingSetNodeID ID;
2080 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs);
2082 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2085 RemoveNodeFromCSEMaps(N);
2087 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2088 N->setValueTypes(VTs);
2090 CSEMap.InsertNode(N, IP);
2094 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2095 MVT::ValueType VT, SDOperand Op1) {
2096 // If an identical node already exists, use it.
2097 SDVTList VTs = getVTList(VT);
2098 FoldingSetNodeID ID;
2099 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1);
2101 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2104 RemoveNodeFromCSEMaps(N);
2105 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2106 N->setValueTypes(VTs);
2107 N->setOperands(Op1);
2108 CSEMap.InsertNode(N, IP);
2112 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2113 MVT::ValueType VT, SDOperand Op1,
2115 // If an identical node already exists, use it.
2116 SDVTList VTs = getVTList(VT);
2117 FoldingSetNodeID ID;
2118 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1, Op2);
2120 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2123 RemoveNodeFromCSEMaps(N);
2124 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2125 N->setValueTypes(VTs);
2126 N->setOperands(Op1, Op2);
2128 CSEMap.InsertNode(N, IP); // Memoize the new node.
2132 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2133 MVT::ValueType VT, SDOperand Op1,
2134 SDOperand Op2, SDOperand Op3) {
2135 // If an identical node already exists, use it.
2136 SDVTList VTs = getVTList(VT);
2137 FoldingSetNodeID ID;
2138 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1, Op2, Op3);
2140 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2143 RemoveNodeFromCSEMaps(N);
2144 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2145 N->setValueTypes(VTs);
2146 N->setOperands(Op1, Op2, Op3);
2148 CSEMap.InsertNode(N, IP); // Memoize the new node.
2152 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2153 MVT::ValueType VT, const SDOperand *Ops,
2155 // If an identical node already exists, use it.
2156 SDVTList VTs = getVTList(VT);
2157 FoldingSetNodeID ID;
2158 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2160 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2163 RemoveNodeFromCSEMaps(N);
2164 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2165 N->setValueTypes(VTs);
2166 N->setOperands(Ops, NumOps);
2168 CSEMap.InsertNode(N, IP); // Memoize the new node.
2172 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2173 MVT::ValueType VT1, MVT::ValueType VT2,
2174 SDOperand Op1, SDOperand Op2) {
2175 SDVTList VTs = getVTList(VT1, VT2);
2176 FoldingSetNodeID ID;
2177 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1, Op2);
2179 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2182 RemoveNodeFromCSEMaps(N);
2183 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2184 N->setValueTypes(VTs);
2185 N->setOperands(Op1, Op2);
2187 CSEMap.InsertNode(N, IP); // Memoize the new node.
2191 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2192 MVT::ValueType VT1, MVT::ValueType VT2,
2193 SDOperand Op1, SDOperand Op2,
2195 // If an identical node already exists, use it.
2196 SDVTList VTs = getVTList(VT1, VT2);
2197 FoldingSetNodeID ID;
2198 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Op1, Op2, Op3);
2200 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2203 RemoveNodeFromCSEMaps(N);
2204 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc);
2205 N->setValueTypes(VTs);
2206 N->setOperands(Op1, Op2, Op3);
2208 CSEMap.InsertNode(N, IP); // Memoize the new node.
2213 /// getTargetNode - These are used for target selectors to create a new node
2214 /// with specified return type(s), target opcode, and operands.
2216 /// Note that getTargetNode returns the resultant node. If there is already a
2217 /// node of the specified opcode and operands, it returns that node instead of
2218 /// the current one.
2219 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2220 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2222 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2224 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2226 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2227 SDOperand Op1, SDOperand Op2) {
2228 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2230 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2231 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2232 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2234 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2235 const SDOperand *Ops, unsigned NumOps) {
2236 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
2238 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2239 MVT::ValueType VT2, SDOperand Op1) {
2240 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2241 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
2243 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2244 MVT::ValueType VT2, SDOperand Op1,
2246 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2247 SDOperand Ops[] = { Op1, Op2 };
2248 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
2250 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2251 MVT::ValueType VT2, SDOperand Op1,
2252 SDOperand Op2, SDOperand Op3) {
2253 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2254 SDOperand Ops[] = { Op1, Op2, Op3 };
2255 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
2257 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2259 const SDOperand *Ops, unsigned NumOps) {
2260 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2261 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
2263 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2264 MVT::ValueType VT2, MVT::ValueType VT3,
2265 SDOperand Op1, SDOperand Op2) {
2266 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2267 SDOperand Ops[] = { Op1, Op2 };
2268 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
2270 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2271 MVT::ValueType VT2, MVT::ValueType VT3,
2272 const SDOperand *Ops, unsigned NumOps) {
2273 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2274 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
2277 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2278 /// This can cause recursive merging of nodes in the DAG.
2280 /// This version assumes From/To have a single result value.
2282 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2283 std::vector<SDNode*> *Deleted) {
2284 SDNode *From = FromN.Val, *To = ToN.Val;
2285 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2286 "Cannot replace with this method!");
2287 assert(From != To && "Cannot replace uses of with self");
2289 while (!From->use_empty()) {
2290 // Process users until they are all gone.
2291 SDNode *U = *From->use_begin();
2293 // This node is about to morph, remove its old self from the CSE maps.
2294 RemoveNodeFromCSEMaps(U);
2296 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2298 if (I->Val == From) {
2299 From->removeUser(U);
2304 // Now that we have modified U, add it back to the CSE maps. If it already
2305 // exists there, recursively merge the results together.
2306 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2307 ReplaceAllUsesWith(U, Existing, Deleted);
2309 if (Deleted) Deleted->push_back(U);
2310 DeleteNodeNotInCSEMaps(U);
2315 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2316 /// This can cause recursive merging of nodes in the DAG.
2318 /// This version assumes From/To have matching types and numbers of result
2321 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2322 std::vector<SDNode*> *Deleted) {
2323 assert(From != To && "Cannot replace uses of with self");
2324 assert(From->getNumValues() == To->getNumValues() &&
2325 "Cannot use this version of ReplaceAllUsesWith!");
2326 if (From->getNumValues() == 1) { // If possible, use the faster version.
2327 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
2331 while (!From->use_empty()) {
2332 // Process users until they are all gone.
2333 SDNode *U = *From->use_begin();
2335 // This node is about to morph, remove its old self from the CSE maps.
2336 RemoveNodeFromCSEMaps(U);
2338 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2340 if (I->Val == From) {
2341 From->removeUser(U);
2346 // Now that we have modified U, add it back to the CSE maps. If it already
2347 // exists there, recursively merge the results together.
2348 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2349 ReplaceAllUsesWith(U, Existing, Deleted);
2351 if (Deleted) Deleted->push_back(U);
2352 DeleteNodeNotInCSEMaps(U);
2357 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2358 /// This can cause recursive merging of nodes in the DAG.
2360 /// This version can replace From with any result values. To must match the
2361 /// number and types of values returned by From.
2362 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2363 const SDOperand *To,
2364 std::vector<SDNode*> *Deleted) {
2365 if (From->getNumValues() == 1 && To[0].Val->getNumValues() == 1) {
2366 // Degenerate case handled above.
2367 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2371 while (!From->use_empty()) {
2372 // Process users until they are all gone.
2373 SDNode *U = *From->use_begin();
2375 // This node is about to morph, remove its old self from the CSE maps.
2376 RemoveNodeFromCSEMaps(U);
2378 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2380 if (I->Val == From) {
2381 const SDOperand &ToOp = To[I->ResNo];
2382 From->removeUser(U);
2384 ToOp.Val->addUser(U);
2387 // Now that we have modified U, add it back to the CSE maps. If it already
2388 // exists there, recursively merge the results together.
2389 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2390 ReplaceAllUsesWith(U, Existing, Deleted);
2392 if (Deleted) Deleted->push_back(U);
2393 DeleteNodeNotInCSEMaps(U);
2398 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2399 /// uses of other values produced by From.Val alone. The Deleted vector is
2400 /// handled the same was as for ReplaceAllUsesWith.
2401 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2402 std::vector<SDNode*> &Deleted) {
2403 assert(From != To && "Cannot replace a value with itself");
2404 // Handle the simple, trivial, case efficiently.
2405 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2406 ReplaceAllUsesWith(From, To, &Deleted);
2410 // Get all of the users in a nice, deterministically ordered, uniqued set.
2411 SetVector<SDNode*> Users(From.Val->use_begin(), From.Val->use_end());
2413 while (!Users.empty()) {
2414 // We know that this user uses some value of From. If it is the right
2415 // value, update it.
2416 SDNode *User = Users.back();
2419 for (SDOperand *Op = User->OperandList,
2420 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2422 // Okay, we know this user needs to be updated. Remove its old self
2423 // from the CSE maps.
2424 RemoveNodeFromCSEMaps(User);
2426 // Update all operands that match "From".
2427 for (; Op != E; ++Op) {
2429 From.Val->removeUser(User);
2431 To.Val->addUser(User);
2435 // Now that we have modified User, add it back to the CSE maps. If it
2436 // already exists there, recursively merge the results together.
2437 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2438 unsigned NumDeleted = Deleted.size();
2439 ReplaceAllUsesWith(User, Existing, &Deleted);
2441 // User is now dead.
2442 Deleted.push_back(User);
2443 DeleteNodeNotInCSEMaps(User);
2445 // We have to be careful here, because ReplaceAllUsesWith could have
2446 // deleted a user of From, which means there may be dangling pointers
2447 // in the "Users" setvector. Scan over the deleted node pointers and
2448 // remove them from the setvector.
2449 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2450 Users.remove(Deleted[i]);
2452 break; // Exit the operand scanning loop.
2459 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
2460 /// their allnodes order. It returns the maximum id.
2461 unsigned SelectionDAG::AssignNodeIds() {
2463 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
2470 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
2471 /// based on their topological order. It returns the maximum id and a vector
2472 /// of the SDNodes* in assigned order by reference.
2473 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
2474 unsigned DAGSize = AllNodes.size();
2475 std::vector<unsigned> InDegree(DAGSize);
2476 std::vector<SDNode*> Sources;
2478 // Use a two pass approach to avoid using a std::map which is slow.
2480 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
2483 unsigned Degree = N->use_size();
2484 InDegree[N->getNodeId()] = Degree;
2486 Sources.push_back(N);
2490 while (!Sources.empty()) {
2491 SDNode *N = Sources.back();
2493 TopOrder.push_back(N);
2494 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
2496 unsigned Degree = --InDegree[P->getNodeId()];
2498 Sources.push_back(P);
2502 // Second pass, assign the actual topological order as node ids.
2504 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
2506 (*TI)->setNodeId(Id++);
2513 //===----------------------------------------------------------------------===//
2515 //===----------------------------------------------------------------------===//
2517 // Out-of-line virtual method to give class a home.
2518 void SDNode::ANCHOR() {
2521 /// Profile - Gather unique data for the node.
2523 void SDNode::Profile(FoldingSetNodeID &ID) {
2524 AddNodeIDNode(ID, this);
2527 /// getValueTypeList - Return a pointer to the specified value type.
2529 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2530 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2535 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2536 /// indicated value. This method ignores uses of other values defined by this
2538 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2539 assert(Value < getNumValues() && "Bad value!");
2541 // If there is only one value, this is easy.
2542 if (getNumValues() == 1)
2543 return use_size() == NUses;
2544 if (Uses.size() < NUses) return false;
2546 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2548 std::set<SDNode*> UsersHandled;
2550 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
2552 if (User->getNumOperands() == 1 ||
2553 UsersHandled.insert(User).second) // First time we've seen this?
2554 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2555 if (User->getOperand(i) == TheValue) {
2557 return false; // too many uses
2562 // Found exactly the right number of uses?
2567 /// isOnlyUse - Return true if this node is the only use of N.
2569 bool SDNode::isOnlyUse(SDNode *N) const {
2571 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2582 /// isOperand - Return true if this node is an operand of N.
2584 bool SDOperand::isOperand(SDNode *N) const {
2585 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2586 if (*this == N->getOperand(i))
2591 bool SDNode::isOperand(SDNode *N) const {
2592 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2593 if (this == N->OperandList[i].Val)
2598 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
2599 std::set<SDNode *> &Visited) {
2600 if (found || !Visited.insert(N).second)
2603 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
2604 SDNode *Op = N->getOperand(i).Val;
2609 findPredecessor(Op, P, found, Visited);
2613 /// isPredecessor - Return true if this node is a predecessor of N. This node
2614 /// is either an operand of N or it can be reached by recursively traversing
2615 /// up the operands.
2616 /// NOTE: this is an expensive method. Use it carefully.
2617 bool SDNode::isPredecessor(SDNode *N) const {
2618 std::set<SDNode *> Visited;
2620 findPredecessor(N, this, found, Visited);
2624 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
2625 assert(Num < NumOperands && "Invalid child # of SDNode!");
2626 return cast<ConstantSDNode>(OperandList[Num])->getValue();
2629 const char *SDNode::getOperationName(const SelectionDAG *G) const {
2630 switch (getOpcode()) {
2632 if (getOpcode() < ISD::BUILTIN_OP_END)
2633 return "<<Unknown DAG Node>>";
2636 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2637 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2638 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2640 TargetLowering &TLI = G->getTargetLoweringInfo();
2642 TLI.getTargetNodeName(getOpcode());
2643 if (Name) return Name;
2646 return "<<Unknown Target Node>>";
2649 case ISD::PCMARKER: return "PCMarker";
2650 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2651 case ISD::SRCVALUE: return "SrcValue";
2652 case ISD::EntryToken: return "EntryToken";
2653 case ISD::TokenFactor: return "TokenFactor";
2654 case ISD::AssertSext: return "AssertSext";
2655 case ISD::AssertZext: return "AssertZext";
2657 case ISD::STRING: return "String";
2658 case ISD::BasicBlock: return "BasicBlock";
2659 case ISD::VALUETYPE: return "ValueType";
2660 case ISD::Register: return "Register";
2662 case ISD::Constant: return "Constant";
2663 case ISD::ConstantFP: return "ConstantFP";
2664 case ISD::GlobalAddress: return "GlobalAddress";
2665 case ISD::FrameIndex: return "FrameIndex";
2666 case ISD::JumpTable: return "JumpTable";
2667 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
2668 case ISD::ConstantPool: return "ConstantPool";
2669 case ISD::ExternalSymbol: return "ExternalSymbol";
2670 case ISD::INTRINSIC_WO_CHAIN: {
2671 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2672 return Intrinsic::getName((Intrinsic::ID)IID);
2674 case ISD::INTRINSIC_VOID:
2675 case ISD::INTRINSIC_W_CHAIN: {
2676 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2677 return Intrinsic::getName((Intrinsic::ID)IID);
2680 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2681 case ISD::TargetConstant: return "TargetConstant";
2682 case ISD::TargetConstantFP:return "TargetConstantFP";
2683 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2684 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2685 case ISD::TargetJumpTable: return "TargetJumpTable";
2686 case ISD::TargetConstantPool: return "TargetConstantPool";
2687 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2689 case ISD::CopyToReg: return "CopyToReg";
2690 case ISD::CopyFromReg: return "CopyFromReg";
2691 case ISD::UNDEF: return "undef";
2692 case ISD::MERGE_VALUES: return "mergevalues";
2693 case ISD::INLINEASM: return "inlineasm";
2694 case ISD::HANDLENODE: return "handlenode";
2695 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
2696 case ISD::CALL: return "call";
2699 case ISD::FABS: return "fabs";
2700 case ISD::FNEG: return "fneg";
2701 case ISD::FSQRT: return "fsqrt";
2702 case ISD::FSIN: return "fsin";
2703 case ISD::FCOS: return "fcos";
2704 case ISD::FPOWI: return "fpowi";
2707 case ISD::ADD: return "add";
2708 case ISD::SUB: return "sub";
2709 case ISD::MUL: return "mul";
2710 case ISD::MULHU: return "mulhu";
2711 case ISD::MULHS: return "mulhs";
2712 case ISD::SDIV: return "sdiv";
2713 case ISD::UDIV: return "udiv";
2714 case ISD::SREM: return "srem";
2715 case ISD::UREM: return "urem";
2716 case ISD::AND: return "and";
2717 case ISD::OR: return "or";
2718 case ISD::XOR: return "xor";
2719 case ISD::SHL: return "shl";
2720 case ISD::SRA: return "sra";
2721 case ISD::SRL: return "srl";
2722 case ISD::ROTL: return "rotl";
2723 case ISD::ROTR: return "rotr";
2724 case ISD::FADD: return "fadd";
2725 case ISD::FSUB: return "fsub";
2726 case ISD::FMUL: return "fmul";
2727 case ISD::FDIV: return "fdiv";
2728 case ISD::FREM: return "frem";
2729 case ISD::FCOPYSIGN: return "fcopysign";
2730 case ISD::VADD: return "vadd";
2731 case ISD::VSUB: return "vsub";
2732 case ISD::VMUL: return "vmul";
2733 case ISD::VSDIV: return "vsdiv";
2734 case ISD::VUDIV: return "vudiv";
2735 case ISD::VAND: return "vand";
2736 case ISD::VOR: return "vor";
2737 case ISD::VXOR: return "vxor";
2739 case ISD::SETCC: return "setcc";
2740 case ISD::SELECT: return "select";
2741 case ISD::SELECT_CC: return "select_cc";
2742 case ISD::VSELECT: return "vselect";
2743 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2744 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2745 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2746 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2747 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2748 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2749 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2750 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2751 case ISD::VBIT_CONVERT: return "vbit_convert";
2752 case ISD::ADDC: return "addc";
2753 case ISD::ADDE: return "adde";
2754 case ISD::SUBC: return "subc";
2755 case ISD::SUBE: return "sube";
2756 case ISD::SHL_PARTS: return "shl_parts";
2757 case ISD::SRA_PARTS: return "sra_parts";
2758 case ISD::SRL_PARTS: return "srl_parts";
2760 // Conversion operators.
2761 case ISD::SIGN_EXTEND: return "sign_extend";
2762 case ISD::ZERO_EXTEND: return "zero_extend";
2763 case ISD::ANY_EXTEND: return "any_extend";
2764 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2765 case ISD::TRUNCATE: return "truncate";
2766 case ISD::FP_ROUND: return "fp_round";
2767 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2768 case ISD::FP_EXTEND: return "fp_extend";
2770 case ISD::SINT_TO_FP: return "sint_to_fp";
2771 case ISD::UINT_TO_FP: return "uint_to_fp";
2772 case ISD::FP_TO_SINT: return "fp_to_sint";
2773 case ISD::FP_TO_UINT: return "fp_to_uint";
2774 case ISD::BIT_CONVERT: return "bit_convert";
2776 // Control flow instructions
2777 case ISD::BR: return "br";
2778 case ISD::BRIND: return "brind";
2779 case ISD::BR_JT: return "br_jt";
2780 case ISD::BRCOND: return "brcond";
2781 case ISD::BR_CC: return "br_cc";
2782 case ISD::RET: return "ret";
2783 case ISD::CALLSEQ_START: return "callseq_start";
2784 case ISD::CALLSEQ_END: return "callseq_end";
2787 case ISD::LOAD: return "load";
2788 case ISD::STORE: return "store";
2789 case ISD::VLOAD: return "vload";
2790 case ISD::VAARG: return "vaarg";
2791 case ISD::VACOPY: return "vacopy";
2792 case ISD::VAEND: return "vaend";
2793 case ISD::VASTART: return "vastart";
2794 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2795 case ISD::EXTRACT_ELEMENT: return "extract_element";
2796 case ISD::BUILD_PAIR: return "build_pair";
2797 case ISD::STACKSAVE: return "stacksave";
2798 case ISD::STACKRESTORE: return "stackrestore";
2800 // Block memory operations.
2801 case ISD::MEMSET: return "memset";
2802 case ISD::MEMCPY: return "memcpy";
2803 case ISD::MEMMOVE: return "memmove";
2806 case ISD::BSWAP: return "bswap";
2807 case ISD::CTPOP: return "ctpop";
2808 case ISD::CTTZ: return "cttz";
2809 case ISD::CTLZ: return "ctlz";
2812 case ISD::LOCATION: return "location";
2813 case ISD::DEBUG_LOC: return "debug_loc";
2814 case ISD::DEBUG_LABEL: return "debug_label";
2817 switch (cast<CondCodeSDNode>(this)->get()) {
2818 default: assert(0 && "Unknown setcc condition!");
2819 case ISD::SETOEQ: return "setoeq";
2820 case ISD::SETOGT: return "setogt";
2821 case ISD::SETOGE: return "setoge";
2822 case ISD::SETOLT: return "setolt";
2823 case ISD::SETOLE: return "setole";
2824 case ISD::SETONE: return "setone";
2826 case ISD::SETO: return "seto";
2827 case ISD::SETUO: return "setuo";
2828 case ISD::SETUEQ: return "setue";
2829 case ISD::SETUGT: return "setugt";
2830 case ISD::SETUGE: return "setuge";
2831 case ISD::SETULT: return "setult";
2832 case ISD::SETULE: return "setule";
2833 case ISD::SETUNE: return "setune";
2835 case ISD::SETEQ: return "seteq";
2836 case ISD::SETGT: return "setgt";
2837 case ISD::SETGE: return "setge";
2838 case ISD::SETLT: return "setlt";
2839 case ISD::SETLE: return "setle";
2840 case ISD::SETNE: return "setne";
2845 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
2854 return "<post-inc>";
2856 return "<post-dec>";
2860 void SDNode::dump() const { dump(0); }
2861 void SDNode::dump(const SelectionDAG *G) const {
2862 std::cerr << (void*)this << ": ";
2864 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
2865 if (i) std::cerr << ",";
2866 if (getValueType(i) == MVT::Other)
2869 std::cerr << MVT::getValueTypeString(getValueType(i));
2871 std::cerr << " = " << getOperationName(G);
2874 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2875 if (i) std::cerr << ", ";
2876 std::cerr << (void*)getOperand(i).Val;
2877 if (unsigned RN = getOperand(i).ResNo)
2878 std::cerr << ":" << RN;
2881 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
2882 std::cerr << "<" << CSDN->getValue() << ">";
2883 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
2884 std::cerr << "<" << CSDN->getValue() << ">";
2885 } else if (const GlobalAddressSDNode *GADN =
2886 dyn_cast<GlobalAddressSDNode>(this)) {
2887 int offset = GADN->getOffset();
2889 WriteAsOperand(std::cerr, GADN->getGlobal()) << ">";
2891 std::cerr << " + " << offset;
2893 std::cerr << " " << offset;
2894 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
2895 std::cerr << "<" << FIDN->getIndex() << ">";
2896 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
2897 std::cerr << "<" << JTDN->getIndex() << ">";
2898 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
2899 int offset = CP->getOffset();
2900 if (CP->isMachineConstantPoolEntry())
2901 std::cerr << "<" << *CP->getMachineCPVal() << ">";
2903 std::cerr << "<" << *CP->getConstVal() << ">";
2905 std::cerr << " + " << offset;
2907 std::cerr << " " << offset;
2908 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
2910 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
2912 std::cerr << LBB->getName() << " ";
2913 std::cerr << (const void*)BBDN->getBasicBlock() << ">";
2914 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
2915 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
2916 std::cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
2918 std::cerr << " #" << R->getReg();
2920 } else if (const ExternalSymbolSDNode *ES =
2921 dyn_cast<ExternalSymbolSDNode>(this)) {
2922 std::cerr << "'" << ES->getSymbol() << "'";
2923 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
2925 std::cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
2927 std::cerr << "<null:" << M->getOffset() << ">";
2928 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
2929 std::cerr << ":" << getValueTypeString(N->getVT());
2930 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
2932 switch (LD->getExtensionType()) {
2933 default: doExt = false; break;
2935 std::cerr << " <anyext ";
2938 std::cerr << " <sext ";
2941 std::cerr << " <zext ";
2945 std::cerr << MVT::getValueTypeString(LD->getLoadedVT()) << ">";
2947 const char *AM = getIndexedModeName(LD->getAddressingMode());
2949 std::cerr << " " << AM;
2950 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
2951 if (ST->isTruncatingStore())
2952 std::cerr << " <trunc "
2953 << MVT::getValueTypeString(ST->getStoredVT()) << ">";
2955 const char *AM = getIndexedModeName(ST->getAddressingMode());
2957 std::cerr << " " << AM;
2961 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
2962 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2963 if (N->getOperand(i).Val->hasOneUse())
2964 DumpNodes(N->getOperand(i).Val, indent+2, G);
2966 std::cerr << "\n" << std::string(indent+2, ' ')
2967 << (void*)N->getOperand(i).Val << ": <multiple use>";
2970 std::cerr << "\n" << std::string(indent, ' ');
2974 void SelectionDAG::dump() const {
2975 std::cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
2976 std::vector<const SDNode*> Nodes;
2977 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
2981 std::sort(Nodes.begin(), Nodes.end());
2983 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
2984 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
2985 DumpNodes(Nodes[i], 2, this);
2988 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
2990 std::cerr << "\n\n";
2993 const Type *ConstantPoolSDNode::getType() const {
2994 if (isMachineConstantPoolEntry())
2995 return Val.MachineCPVal->getType();
2996 return Val.ConstVal->getType();