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"
35 /// makeVTList - Return an instance of the SDVTList struct initialized with the
36 /// specified members.
37 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
38 SDVTList Res = {VTs, NumVTs};
42 //===----------------------------------------------------------------------===//
43 // ConstantFPSDNode Class
44 //===----------------------------------------------------------------------===//
46 /// isExactlyValue - We don't rely on operator== working on double values, as
47 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
48 /// As such, this method can be used to do an exact bit-for-bit comparison of
49 /// two floating point values.
50 bool ConstantFPSDNode::isExactlyValue(double V) const {
51 return DoubleToBits(V) == DoubleToBits(Value);
54 //===----------------------------------------------------------------------===//
56 //===----------------------------------------------------------------------===//
58 /// isBuildVectorAllOnes - Return true if the specified node is a
59 /// BUILD_VECTOR where all of the elements are ~0 or undef.
60 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
61 // Look through a bit convert.
62 if (N->getOpcode() == ISD::BIT_CONVERT)
63 N = N->getOperand(0).Val;
65 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
67 unsigned i = 0, e = N->getNumOperands();
69 // Skip over all of the undef values.
70 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
73 // Do not accept an all-undef vector.
74 if (i == e) return false;
76 // Do not accept build_vectors that aren't all constants or which have non-~0
78 SDOperand NotZero = N->getOperand(i);
79 if (isa<ConstantSDNode>(NotZero)) {
80 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
82 } else if (isa<ConstantFPSDNode>(NotZero)) {
83 MVT::ValueType VT = NotZero.getValueType();
85 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
89 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
96 // Okay, we have at least one ~0 value, check to see if the rest match or are
98 for (++i; i != e; ++i)
99 if (N->getOperand(i) != NotZero &&
100 N->getOperand(i).getOpcode() != ISD::UNDEF)
106 /// isBuildVectorAllZeros - Return true if the specified node is a
107 /// BUILD_VECTOR where all of the elements are 0 or undef.
108 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
109 // Look through a bit convert.
110 if (N->getOpcode() == ISD::BIT_CONVERT)
111 N = N->getOperand(0).Val;
113 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
115 unsigned i = 0, e = N->getNumOperands();
117 // Skip over all of the undef values.
118 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
121 // Do not accept an all-undef vector.
122 if (i == e) return false;
124 // Do not accept build_vectors that aren't all constants or which have non-~0
126 SDOperand Zero = N->getOperand(i);
127 if (isa<ConstantSDNode>(Zero)) {
128 if (!cast<ConstantSDNode>(Zero)->isNullValue())
130 } else if (isa<ConstantFPSDNode>(Zero)) {
131 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0))
136 // Okay, we have at least one ~0 value, check to see if the rest match or are
138 for (++i; i != e; ++i)
139 if (N->getOperand(i) != Zero &&
140 N->getOperand(i).getOpcode() != ISD::UNDEF)
145 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
146 /// when given the operation for (X op Y).
147 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
148 // To perform this operation, we just need to swap the L and G bits of the
150 unsigned OldL = (Operation >> 2) & 1;
151 unsigned OldG = (Operation >> 1) & 1;
152 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
153 (OldL << 1) | // New G bit
154 (OldG << 2)); // New L bit.
157 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
158 /// 'op' is a valid SetCC operation.
159 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
160 unsigned Operation = Op;
162 Operation ^= 7; // Flip L, G, E bits, but not U.
164 Operation ^= 15; // Flip all of the condition bits.
165 if (Operation > ISD::SETTRUE2)
166 Operation &= ~8; // Don't let N and U bits get set.
167 return ISD::CondCode(Operation);
171 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
172 /// signed operation and 2 if the result is an unsigned comparison. Return zero
173 /// if the operation does not depend on the sign of the input (setne and seteq).
174 static int isSignedOp(ISD::CondCode Opcode) {
176 default: assert(0 && "Illegal integer setcc operation!");
178 case ISD::SETNE: return 0;
182 case ISD::SETGE: return 1;
186 case ISD::SETUGE: return 2;
190 /// getSetCCOrOperation - Return the result of a logical OR between different
191 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
192 /// returns SETCC_INVALID if it is not possible to represent the resultant
194 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
196 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
197 // Cannot fold a signed integer setcc with an unsigned integer setcc.
198 return ISD::SETCC_INVALID;
200 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
202 // If the N and U bits get set then the resultant comparison DOES suddenly
203 // care about orderedness, and is true when ordered.
204 if (Op > ISD::SETTRUE2)
205 Op &= ~16; // Clear the U bit if the N bit is set.
207 // Canonicalize illegal integer setcc's.
208 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
211 return ISD::CondCode(Op);
214 /// getSetCCAndOperation - Return the result of a logical AND between different
215 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
216 /// function returns zero if it is not possible to represent the resultant
218 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
220 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
221 // Cannot fold a signed setcc with an unsigned setcc.
222 return ISD::SETCC_INVALID;
224 // Combine all of the condition bits.
225 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
227 // Canonicalize illegal integer setcc's.
231 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
232 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
233 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
234 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
241 const TargetMachine &SelectionDAG::getTarget() const {
242 return TLI.getTargetMachine();
245 //===----------------------------------------------------------------------===//
246 // SDNode Profile Support
247 //===----------------------------------------------------------------------===//
249 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
251 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
255 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
256 /// solely with their pointer.
257 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
258 ID.AddPointer(VTList.VTs);
261 /// AddNodeIDOperand - Add an operands data to the NodeID data.
263 static void AddNodeIDOperand(FoldingSetNodeID &ID, SDOperand Op) {
264 ID.AddPointer(Op.Val);
265 ID.AddInteger(Op.ResNo);
268 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
270 static void AddNodeIDOperands(FoldingSetNodeID &ID) {
272 static void AddNodeIDOperands(FoldingSetNodeID &ID, SDOperand Op) {
273 AddNodeIDOperand(ID, Op);
275 static void AddNodeIDOperands(FoldingSetNodeID &ID,
276 SDOperand Op1, SDOperand Op2) {
277 AddNodeIDOperand(ID, Op1);
278 AddNodeIDOperand(ID, Op2);
280 static void AddNodeIDOperands(FoldingSetNodeID &ID,
281 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
282 AddNodeIDOperand(ID, Op1);
283 AddNodeIDOperand(ID, Op2);
284 AddNodeIDOperand(ID, Op3);
286 static void AddNodeIDOperands(FoldingSetNodeID &ID,
287 const SDOperand *Ops, unsigned NumOps) {
288 for (; NumOps; --NumOps, ++Ops)
289 AddNodeIDOperand(ID, *Ops);
292 /// AddNodeIDOperands - Various routines for adding node info to the NodeID
294 static void AddNodeIDNode(FoldingSetNodeID &ID,
295 unsigned short OpC, SDVTList VTList) {
296 AddNodeIDOpcode(ID, OpC);
297 AddNodeIDValueTypes(ID, VTList);
298 AddNodeIDOperands(ID);
300 static void AddNodeIDNode(FoldingSetNodeID &ID,
301 unsigned short OpC, SDVTList VTList,
303 AddNodeIDOpcode(ID, OpC);
304 AddNodeIDValueTypes(ID, VTList);
305 AddNodeIDOperands(ID, Op);
307 static void AddNodeIDNode(FoldingSetNodeID &ID,
308 unsigned short OpC, SDVTList VTList,
309 SDOperand Op1, SDOperand Op2) {
310 AddNodeIDOpcode(ID, OpC);
311 AddNodeIDValueTypes(ID, VTList);
312 AddNodeIDOperands(ID, Op1, Op2);
314 static void AddNodeIDNode(FoldingSetNodeID &ID,
315 unsigned short OpC, SDVTList VTList,
316 SDOperand Op1, SDOperand Op2, SDOperand Op3) {
317 AddNodeIDOpcode(ID, OpC);
318 AddNodeIDValueTypes(ID, VTList);
319 AddNodeIDOperands(ID, Op1, Op2, Op3);
321 static void AddNodeIDNode(FoldingSetNodeID &ID,
322 unsigned short OpC, SDVTList VTList,
323 const SDOperand *OpList, unsigned N) {
324 AddNodeIDOpcode(ID, OpC);
325 AddNodeIDValueTypes(ID, VTList);
326 AddNodeIDOperands(ID, OpList, N);
329 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
331 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
332 AddNodeIDOpcode(ID, N->getOpcode());
333 // Add the return value info.
334 AddNodeIDValueTypes(ID, N->getVTList());
335 // Add the operand info.
336 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
338 // Handle SDNode leafs with special info.
339 if (N->getNumOperands() == 0) {
340 switch (N->getOpcode()) {
341 default: break; // Normal nodes don't need extra info.
342 case ISD::TargetConstant:
344 ID.AddInteger(cast<ConstantSDNode>(N)->getValue());
346 case ISD::TargetConstantFP:
347 case ISD::ConstantFP:
348 ID.AddDouble(cast<ConstantFPSDNode>(N)->getValue());
350 case ISD::TargetGlobalAddress:
351 case ISD::GlobalAddress: {
352 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
353 ID.AddPointer(GA->getGlobal());
354 ID.AddInteger(GA->getOffset());
357 case ISD::BasicBlock:
358 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
361 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
363 case ISD::SRCVALUE: {
364 SrcValueSDNode *SV = cast<SrcValueSDNode>(N);
365 ID.AddPointer(SV->getValue());
366 ID.AddInteger(SV->getOffset());
369 case ISD::FrameIndex:
370 case ISD::TargetFrameIndex:
371 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
374 case ISD::TargetJumpTable:
375 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
377 case ISD::ConstantPool:
378 case ISD::TargetConstantPool: {
379 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
380 ID.AddInteger(CP->getAlignment());
381 ID.AddInteger(CP->getOffset());
382 if (CP->isMachineConstantPoolEntry())
383 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
385 ID.AddPointer(CP->getConstVal());
389 LoadSDNode *LD = cast<LoadSDNode>(N);
390 ID.AddInteger(LD->getAddressingMode());
391 ID.AddInteger(LD->getExtensionType());
392 ID.AddInteger(LD->getLoadedVT());
393 ID.AddPointer(LD->getSrcValue());
394 ID.AddInteger(LD->getSrcValueOffset());
395 ID.AddInteger(LD->getAlignment());
396 ID.AddInteger(LD->isVolatile());
400 StoreSDNode *ST = cast<StoreSDNode>(N);
401 ID.AddInteger(ST->getAddressingMode());
402 ID.AddInteger(ST->isTruncatingStore());
403 ID.AddInteger(ST->getStoredVT());
404 ID.AddPointer(ST->getSrcValue());
405 ID.AddInteger(ST->getSrcValueOffset());
406 ID.AddInteger(ST->getAlignment());
407 ID.AddInteger(ST->isVolatile());
414 //===----------------------------------------------------------------------===//
415 // SelectionDAG Class
416 //===----------------------------------------------------------------------===//
418 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
420 void SelectionDAG::RemoveDeadNodes() {
421 // Create a dummy node (which is not added to allnodes), that adds a reference
422 // to the root node, preventing it from being deleted.
423 HandleSDNode Dummy(getRoot());
425 SmallVector<SDNode*, 128> DeadNodes;
427 // Add all obviously-dead nodes to the DeadNodes worklist.
428 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
430 DeadNodes.push_back(I);
432 // Process the worklist, deleting the nodes and adding their uses to the
434 while (!DeadNodes.empty()) {
435 SDNode *N = DeadNodes.back();
436 DeadNodes.pop_back();
438 // Take the node out of the appropriate CSE map.
439 RemoveNodeFromCSEMaps(N);
441 // Next, brutally remove the operand list. This is safe to do, as there are
442 // no cycles in the graph.
443 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
444 SDNode *Operand = I->Val;
445 Operand->removeUser(N);
447 // Now that we removed this operand, see if there are no uses of it left.
448 if (Operand->use_empty())
449 DeadNodes.push_back(Operand);
451 delete[] N->OperandList;
455 // Finally, remove N itself.
459 // If the root changed (e.g. it was a dead load, update the root).
460 setRoot(Dummy.getValue());
463 void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) {
464 SmallVector<SDNode*, 16> DeadNodes;
465 DeadNodes.push_back(N);
467 // Process the worklist, deleting the nodes and adding their uses to the
469 while (!DeadNodes.empty()) {
470 SDNode *N = DeadNodes.back();
471 DeadNodes.pop_back();
473 // Take the node out of the appropriate CSE map.
474 RemoveNodeFromCSEMaps(N);
476 // Next, brutally remove the operand list. This is safe to do, as there are
477 // no cycles in the graph.
478 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
479 SDNode *Operand = I->Val;
480 Operand->removeUser(N);
482 // Now that we removed this operand, see if there are no uses of it left.
483 if (Operand->use_empty())
484 DeadNodes.push_back(Operand);
486 delete[] N->OperandList;
490 // Finally, remove N itself.
491 Deleted.push_back(N);
496 void SelectionDAG::DeleteNode(SDNode *N) {
497 assert(N->use_empty() && "Cannot delete a node that is not dead!");
499 // First take this out of the appropriate CSE map.
500 RemoveNodeFromCSEMaps(N);
502 // Finally, remove uses due to operands of this node, remove from the
503 // AllNodes list, and delete the node.
504 DeleteNodeNotInCSEMaps(N);
507 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
509 // Remove it from the AllNodes list.
512 // Drop all of the operands and decrement used nodes use counts.
513 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
514 I->Val->removeUser(N);
515 delete[] N->OperandList;
522 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
523 /// correspond to it. This is useful when we're about to delete or repurpose
524 /// the node. We don't want future request for structurally identical nodes
525 /// to return N anymore.
526 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
528 switch (N->getOpcode()) {
529 case ISD::HANDLENODE: return; // noop.
531 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
534 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
535 "Cond code doesn't exist!");
536 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
537 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
539 case ISD::ExternalSymbol:
540 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
542 case ISD::TargetExternalSymbol:
544 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
547 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
548 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
551 // Remove it from the CSE Map.
552 Erased = CSEMap.RemoveNode(N);
556 // Verify that the node was actually in one of the CSE maps, unless it has a
557 // flag result (which cannot be CSE'd) or is one of the special cases that are
558 // not subject to CSE.
559 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
560 !N->isTargetOpcode()) {
563 assert(0 && "Node is not in map!");
568 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
569 /// has been taken out and modified in some way. If the specified node already
570 /// exists in the CSE maps, do not modify the maps, but return the existing node
571 /// instead. If it doesn't exist, add it and return null.
573 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
574 assert(N->getNumOperands() && "This is a leaf node!");
575 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
576 return 0; // Never add these nodes.
578 // Check that remaining values produced are not flags.
579 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
580 if (N->getValueType(i) == MVT::Flag)
581 return 0; // Never CSE anything that produces a flag.
583 SDNode *New = CSEMap.GetOrInsertNode(N);
584 if (New != N) return New; // Node already existed.
588 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
589 /// were replaced with those specified. If this node is never memoized,
590 /// return null, otherwise return a pointer to the slot it would take. If a
591 /// node already exists with these operands, the slot will be non-null.
592 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
594 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
595 return 0; // Never add these nodes.
597 // Check that remaining values produced are not flags.
598 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
599 if (N->getValueType(i) == MVT::Flag)
600 return 0; // Never CSE anything that produces a flag.
603 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Op);
604 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
607 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
608 /// were replaced with those specified. If this node is never memoized,
609 /// return null, otherwise return a pointer to the slot it would take. If a
610 /// node already exists with these operands, the slot will be non-null.
611 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
612 SDOperand Op1, SDOperand Op2,
614 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
615 return 0; // Never add these nodes.
617 // Check that remaining values produced are not flags.
618 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
619 if (N->getValueType(i) == MVT::Flag)
620 return 0; // Never CSE anything that produces a flag.
623 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Op1, Op2);
624 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
628 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
629 /// were replaced with those specified. If this node is never memoized,
630 /// return null, otherwise return a pointer to the slot it would take. If a
631 /// node already exists with these operands, the slot will be non-null.
632 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
633 const SDOperand *Ops,unsigned NumOps,
635 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
636 return 0; // Never add these nodes.
638 // Check that remaining values produced are not flags.
639 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
640 if (N->getValueType(i) == MVT::Flag)
641 return 0; // Never CSE anything that produces a flag.
644 AddNodeIDNode(ID, N->getOpcode(), N->getVTList());
646 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
647 ID.AddInteger(LD->getAddressingMode());
648 ID.AddInteger(LD->getExtensionType());
649 ID.AddInteger(LD->getLoadedVT());
650 ID.AddPointer(LD->getSrcValue());
651 ID.AddInteger(LD->getSrcValueOffset());
652 ID.AddInteger(LD->getAlignment());
653 ID.AddInteger(LD->isVolatile());
654 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
655 ID.AddInteger(ST->getAddressingMode());
656 ID.AddInteger(ST->isTruncatingStore());
657 ID.AddInteger(ST->getStoredVT());
658 ID.AddPointer(ST->getSrcValue());
659 ID.AddInteger(ST->getSrcValueOffset());
660 ID.AddInteger(ST->getAlignment());
661 ID.AddInteger(ST->isVolatile());
664 AddNodeIDOperands(ID, Ops, NumOps);
665 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
669 SelectionDAG::~SelectionDAG() {
670 while (!AllNodes.empty()) {
671 SDNode *N = AllNodes.begin();
672 N->SetNextInBucket(0);
673 delete [] N->OperandList;
676 AllNodes.pop_front();
680 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
681 if (Op.getValueType() == VT) return Op;
682 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
683 return getNode(ISD::AND, Op.getValueType(), Op,
684 getConstant(Imm, Op.getValueType()));
687 SDOperand SelectionDAG::getString(const std::string &Val) {
688 StringSDNode *&N = StringNodes[Val];
690 N = new StringSDNode(Val);
691 AllNodes.push_back(N);
693 return SDOperand(N, 0);
696 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
697 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
698 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
700 // Mask out any bits that are not valid for this constant.
701 Val &= MVT::getIntVTBitMask(VT);
703 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
705 AddNodeIDNode(ID, Opc, getVTList(VT));
708 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
709 return SDOperand(E, 0);
710 SDNode *N = new ConstantSDNode(isT, Val, VT);
711 CSEMap.InsertNode(N, IP);
712 AllNodes.push_back(N);
713 return SDOperand(N, 0);
717 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
719 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
721 Val = (float)Val; // Mask out extra precision.
723 // Do the map lookup using the actual bit pattern for the floating point
724 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
725 // we don't have issues with SNANs.
726 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
728 AddNodeIDNode(ID, Opc, getVTList(VT));
731 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
732 return SDOperand(E, 0);
733 SDNode *N = new ConstantFPSDNode(isTarget, Val, VT);
734 CSEMap.InsertNode(N, IP);
735 AllNodes.push_back(N);
736 return SDOperand(N, 0);
739 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
740 MVT::ValueType VT, int Offset,
742 unsigned Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
744 AddNodeIDNode(ID, Opc, getVTList(VT));
746 ID.AddInteger(Offset);
748 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
749 return SDOperand(E, 0);
750 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
751 CSEMap.InsertNode(N, IP);
752 AllNodes.push_back(N);
753 return SDOperand(N, 0);
756 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
758 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
760 AddNodeIDNode(ID, Opc, getVTList(VT));
763 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
764 return SDOperand(E, 0);
765 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
766 CSEMap.InsertNode(N, IP);
767 AllNodes.push_back(N);
768 return SDOperand(N, 0);
771 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
772 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
774 AddNodeIDNode(ID, Opc, getVTList(VT));
777 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
778 return SDOperand(E, 0);
779 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
780 CSEMap.InsertNode(N, IP);
781 AllNodes.push_back(N);
782 return SDOperand(N, 0);
785 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
786 unsigned Alignment, int Offset,
788 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
790 AddNodeIDNode(ID, Opc, getVTList(VT));
791 ID.AddInteger(Alignment);
792 ID.AddInteger(Offset);
795 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
796 return SDOperand(E, 0);
797 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
798 CSEMap.InsertNode(N, IP);
799 AllNodes.push_back(N);
800 return SDOperand(N, 0);
804 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
806 unsigned Alignment, int Offset,
808 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
810 AddNodeIDNode(ID, Opc, getVTList(VT));
811 ID.AddInteger(Alignment);
812 ID.AddInteger(Offset);
813 C->AddSelectionDAGCSEId(ID);
815 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
816 return SDOperand(E, 0);
817 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
818 CSEMap.InsertNode(N, IP);
819 AllNodes.push_back(N);
820 return SDOperand(N, 0);
824 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
826 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other));
829 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
830 return SDOperand(E, 0);
831 SDNode *N = new BasicBlockSDNode(MBB);
832 CSEMap.InsertNode(N, IP);
833 AllNodes.push_back(N);
834 return SDOperand(N, 0);
837 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
838 if ((unsigned)VT >= ValueTypeNodes.size())
839 ValueTypeNodes.resize(VT+1);
840 if (ValueTypeNodes[VT] == 0) {
841 ValueTypeNodes[VT] = new VTSDNode(VT);
842 AllNodes.push_back(ValueTypeNodes[VT]);
845 return SDOperand(ValueTypeNodes[VT], 0);
848 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
849 SDNode *&N = ExternalSymbols[Sym];
850 if (N) return SDOperand(N, 0);
851 N = new ExternalSymbolSDNode(false, Sym, VT);
852 AllNodes.push_back(N);
853 return SDOperand(N, 0);
856 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
858 SDNode *&N = TargetExternalSymbols[Sym];
859 if (N) return SDOperand(N, 0);
860 N = new ExternalSymbolSDNode(true, Sym, VT);
861 AllNodes.push_back(N);
862 return SDOperand(N, 0);
865 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
866 if ((unsigned)Cond >= CondCodeNodes.size())
867 CondCodeNodes.resize(Cond+1);
869 if (CondCodeNodes[Cond] == 0) {
870 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
871 AllNodes.push_back(CondCodeNodes[Cond]);
873 return SDOperand(CondCodeNodes[Cond], 0);
876 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
878 AddNodeIDNode(ID, ISD::Register, getVTList(VT));
879 ID.AddInteger(RegNo);
881 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
882 return SDOperand(E, 0);
883 SDNode *N = new RegisterSDNode(RegNo, VT);
884 CSEMap.InsertNode(N, IP);
885 AllNodes.push_back(N);
886 return SDOperand(N, 0);
889 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
890 assert((!V || isa<PointerType>(V->getType())) &&
891 "SrcValue is not a pointer?");
894 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other));
896 ID.AddInteger(Offset);
898 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
899 return SDOperand(E, 0);
900 SDNode *N = new SrcValueSDNode(V, Offset);
901 CSEMap.InsertNode(N, IP);
902 AllNodes.push_back(N);
903 return SDOperand(N, 0);
906 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
907 SDOperand N2, ISD::CondCode Cond) {
908 // These setcc operations always fold.
912 case ISD::SETFALSE2: return getConstant(0, VT);
914 case ISD::SETTRUE2: return getConstant(1, VT);
926 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
930 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
931 uint64_t C2 = N2C->getValue();
932 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
933 uint64_t C1 = N1C->getValue();
935 // Sign extend the operands if required
936 if (ISD::isSignedIntSetCC(Cond)) {
937 C1 = N1C->getSignExtended();
938 C2 = N2C->getSignExtended();
942 default: assert(0 && "Unknown integer setcc!");
943 case ISD::SETEQ: return getConstant(C1 == C2, VT);
944 case ISD::SETNE: return getConstant(C1 != C2, VT);
945 case ISD::SETULT: return getConstant(C1 < C2, VT);
946 case ISD::SETUGT: return getConstant(C1 > C2, VT);
947 case ISD::SETULE: return getConstant(C1 <= C2, VT);
948 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
949 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
950 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
951 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
952 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
956 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
957 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
958 double C1 = N1C->getValue(), C2 = N2C->getValue();
961 default: break; // FIXME: Implement the rest of these!
962 case ISD::SETEQ: return getConstant(C1 == C2, VT);
963 case ISD::SETNE: return getConstant(C1 != C2, VT);
964 case ISD::SETLT: return getConstant(C1 < C2, VT);
965 case ISD::SETGT: return getConstant(C1 > C2, VT);
966 case ISD::SETLE: return getConstant(C1 <= C2, VT);
967 case ISD::SETGE: return getConstant(C1 >= C2, VT);
970 // Ensure that the constant occurs on the RHS.
971 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
974 // Could not fold it.
979 /// getNode - Gets or creates the specified node.
981 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
983 AddNodeIDNode(ID, Opcode, getVTList(VT));
985 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
986 return SDOperand(E, 0);
987 SDNode *N = new SDNode(Opcode, VT);
988 CSEMap.InsertNode(N, IP);
990 AllNodes.push_back(N);
991 return SDOperand(N, 0);
994 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
997 // Constant fold unary operations with an integer constant operand.
998 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
999 uint64_t Val = C->getValue();
1002 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1003 case ISD::ANY_EXTEND:
1004 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1005 case ISD::TRUNCATE: return getConstant(Val, VT);
1006 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
1007 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
1008 case ISD::BIT_CONVERT:
1009 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1010 return getConstantFP(BitsToFloat(Val), VT);
1011 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1012 return getConstantFP(BitsToDouble(Val), VT);
1016 default: assert(0 && "Invalid bswap!"); break;
1017 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1018 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1019 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1024 default: assert(0 && "Invalid ctpop!"); break;
1025 case MVT::i1: return getConstant(Val != 0, VT);
1027 Tmp1 = (unsigned)Val & 0xFF;
1028 return getConstant(CountPopulation_32(Tmp1), VT);
1030 Tmp1 = (unsigned)Val & 0xFFFF;
1031 return getConstant(CountPopulation_32(Tmp1), VT);
1033 return getConstant(CountPopulation_32((unsigned)Val), VT);
1035 return getConstant(CountPopulation_64(Val), VT);
1039 default: assert(0 && "Invalid ctlz!"); break;
1040 case MVT::i1: return getConstant(Val == 0, VT);
1042 Tmp1 = (unsigned)Val & 0xFF;
1043 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1045 Tmp1 = (unsigned)Val & 0xFFFF;
1046 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1048 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1050 return getConstant(CountLeadingZeros_64(Val), VT);
1054 default: assert(0 && "Invalid cttz!"); break;
1055 case MVT::i1: return getConstant(Val == 0, VT);
1057 Tmp1 = (unsigned)Val | 0x100;
1058 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1060 Tmp1 = (unsigned)Val | 0x10000;
1061 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1063 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1065 return getConstant(CountTrailingZeros_64(Val), VT);
1070 // Constant fold unary operations with an floating point constant operand.
1071 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1074 return getConstantFP(-C->getValue(), VT);
1076 return getConstantFP(fabs(C->getValue()), VT);
1078 case ISD::FP_EXTEND:
1079 return getConstantFP(C->getValue(), VT);
1080 case ISD::FP_TO_SINT:
1081 return getConstant((int64_t)C->getValue(), VT);
1082 case ISD::FP_TO_UINT:
1083 return getConstant((uint64_t)C->getValue(), VT);
1084 case ISD::BIT_CONVERT:
1085 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1086 return getConstant(FloatToBits(C->getValue()), VT);
1087 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1088 return getConstant(DoubleToBits(C->getValue()), VT);
1092 unsigned OpOpcode = Operand.Val->getOpcode();
1094 case ISD::TokenFactor:
1095 return Operand; // Factor of one node? No factor.
1096 case ISD::SIGN_EXTEND:
1097 if (Operand.getValueType() == VT) return Operand; // noop extension
1098 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1099 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1100 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1102 case ISD::ZERO_EXTEND:
1103 if (Operand.getValueType() == VT) return Operand; // noop extension
1104 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1105 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1106 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1108 case ISD::ANY_EXTEND:
1109 if (Operand.getValueType() == VT) return Operand; // noop extension
1110 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1111 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1112 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1113 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1116 if (Operand.getValueType() == VT) return Operand; // noop truncate
1117 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1118 if (OpOpcode == ISD::TRUNCATE)
1119 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1120 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1121 OpOpcode == ISD::ANY_EXTEND) {
1122 // If the source is smaller than the dest, we still need an extend.
1123 if (Operand.Val->getOperand(0).getValueType() < VT)
1124 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1125 else if (Operand.Val->getOperand(0).getValueType() > VT)
1126 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1128 return Operand.Val->getOperand(0);
1131 case ISD::BIT_CONVERT:
1132 // Basic sanity checking.
1133 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1134 && "Cannot BIT_CONVERT between two different types!");
1135 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1136 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1137 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1138 if (OpOpcode == ISD::UNDEF)
1139 return getNode(ISD::UNDEF, VT);
1141 case ISD::SCALAR_TO_VECTOR:
1142 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1143 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1144 "Illegal SCALAR_TO_VECTOR node!");
1147 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1148 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1149 Operand.Val->getOperand(0));
1150 if (OpOpcode == ISD::FNEG) // --X -> X
1151 return Operand.Val->getOperand(0);
1154 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1155 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1160 SDVTList VTs = getVTList(VT);
1161 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1162 FoldingSetNodeID ID;
1163 AddNodeIDNode(ID, Opcode, VTs, Operand);
1165 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1166 return SDOperand(E, 0);
1167 N = new SDNode(Opcode, Operand);
1168 N->setValueTypes(VTs);
1169 CSEMap.InsertNode(N, IP);
1171 N = new SDNode(Opcode, Operand);
1172 N->setValueTypes(VTs);
1174 AllNodes.push_back(N);
1175 return SDOperand(N, 0);
1180 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1181 SDOperand N1, SDOperand N2) {
1184 case ISD::TokenFactor:
1185 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1186 N2.getValueType() == MVT::Other && "Invalid token factor!");
1195 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1202 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1209 assert(N1.getValueType() == N2.getValueType() &&
1210 N1.getValueType() == VT && "Binary operator types must match!");
1212 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1213 assert(N1.getValueType() == VT &&
1214 MVT::isFloatingPoint(N1.getValueType()) &&
1215 MVT::isFloatingPoint(N2.getValueType()) &&
1216 "Invalid FCOPYSIGN!");
1223 assert(VT == N1.getValueType() &&
1224 "Shift operators return type must be the same as their first arg");
1225 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1226 VT != MVT::i1 && "Shifts only work on integers");
1228 case ISD::FP_ROUND_INREG: {
1229 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1230 assert(VT == N1.getValueType() && "Not an inreg round!");
1231 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1232 "Cannot FP_ROUND_INREG integer types");
1233 assert(EVT <= VT && "Not rounding down!");
1236 case ISD::AssertSext:
1237 case ISD::AssertZext:
1238 case ISD::SIGN_EXTEND_INREG: {
1239 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1240 assert(VT == N1.getValueType() && "Not an inreg extend!");
1241 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1242 "Cannot *_EXTEND_INREG FP types");
1243 assert(EVT <= VT && "Not extending!");
1250 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1251 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1253 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1254 int64_t Val = N1C->getValue();
1255 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1256 Val <<= 64-FromBits;
1257 Val >>= 64-FromBits;
1258 return getConstant(Val, VT);
1262 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1264 case ISD::ADD: return getConstant(C1 + C2, VT);
1265 case ISD::SUB: return getConstant(C1 - C2, VT);
1266 case ISD::MUL: return getConstant(C1 * C2, VT);
1268 if (C2) return getConstant(C1 / C2, VT);
1271 if (C2) return getConstant(C1 % C2, VT);
1274 if (C2) return getConstant(N1C->getSignExtended() /
1275 N2C->getSignExtended(), VT);
1278 if (C2) return getConstant(N1C->getSignExtended() %
1279 N2C->getSignExtended(), VT);
1281 case ISD::AND : return getConstant(C1 & C2, VT);
1282 case ISD::OR : return getConstant(C1 | C2, VT);
1283 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1284 case ISD::SHL : return getConstant(C1 << C2, VT);
1285 case ISD::SRL : return getConstant(C1 >> C2, VT);
1286 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1288 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1291 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1295 } else { // Cannonicalize constant to RHS if commutative
1296 if (isCommutativeBinOp(Opcode)) {
1297 std::swap(N1C, N2C);
1303 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1304 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1307 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1309 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1310 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1311 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1313 if (C2) return getConstantFP(C1 / C2, VT);
1316 if (C2) return getConstantFP(fmod(C1, C2), VT);
1318 case ISD::FCOPYSIGN: {
1329 if (u2.I < 0) // Sign bit of RHS set?
1330 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1332 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1333 return getConstantFP(u1.F, VT);
1337 } else { // Cannonicalize constant to RHS if commutative
1338 if (isCommutativeBinOp(Opcode)) {
1339 std::swap(N1CFP, N2CFP);
1345 // Canonicalize an UNDEF to the RHS, even over a constant.
1346 if (N1.getOpcode() == ISD::UNDEF) {
1347 if (isCommutativeBinOp(Opcode)) {
1351 case ISD::FP_ROUND_INREG:
1352 case ISD::SIGN_EXTEND_INREG:
1358 return N1; // fold op(undef, arg2) -> undef
1365 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1370 // Fold a bunch of operators when the RHS is undef.
1371 if (N2.getOpcode() == ISD::UNDEF) {
1385 return N2; // fold op(arg1, undef) -> undef
1390 return getConstant(0, VT); // fold op(arg1, undef) -> 0
1392 return getConstant(MVT::getIntVTBitMask(VT), VT);
1401 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
1402 // worth handling here.
1403 if (N2C && N2C->getValue() == 0)
1408 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
1409 // worth handling here.
1410 if (N2C && N2C->getValue() == 0)
1413 case ISD::FP_ROUND_INREG:
1414 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1416 case ISD::SIGN_EXTEND_INREG: {
1417 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1418 if (EVT == VT) return N1; // Not actually extending
1421 case ISD::EXTRACT_ELEMENT:
1422 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
1424 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
1425 // 64-bit integers into 32-bit parts. Instead of building the extract of
1426 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
1427 if (N1.getOpcode() == ISD::BUILD_PAIR)
1428 return N1.getOperand(N2C->getValue());
1430 // EXTRACT_ELEMENT of a constant int is also very common.
1431 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
1432 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
1433 return getConstant(C->getValue() >> Shift, VT);
1437 // FIXME: figure out how to safely handle things like
1438 // int foo(int x) { return 1 << (x & 255); }
1439 // int bar() { return foo(256); }
1444 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1445 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1446 return getNode(Opcode, VT, N1, N2.getOperand(0));
1447 else if (N2.getOpcode() == ISD::AND)
1448 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1449 // If the and is only masking out bits that cannot effect the shift,
1450 // eliminate the and.
1451 unsigned NumBits = MVT::getSizeInBits(VT);
1452 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1453 return getNode(Opcode, VT, N1, N2.getOperand(0));
1459 // Memoize this node if possible.
1461 SDVTList VTs = getVTList(VT);
1462 if (VT != MVT::Flag) {
1463 FoldingSetNodeID ID;
1464 AddNodeIDNode(ID, Opcode, VTs, N1, N2);
1466 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1467 return SDOperand(E, 0);
1468 N = new SDNode(Opcode, N1, N2);
1469 N->setValueTypes(VTs);
1470 CSEMap.InsertNode(N, IP);
1472 N = new SDNode(Opcode, N1, N2);
1473 N->setValueTypes(VTs);
1476 AllNodes.push_back(N);
1477 return SDOperand(N, 0);
1480 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1481 SDOperand N1, SDOperand N2, SDOperand N3) {
1482 // Perform various simplifications.
1483 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1484 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1485 //ConstantSDNode *N3C = dyn_cast<ConstantSDNode>(N3.Val);
1488 // Use FoldSetCC to simplify SETCC's.
1489 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1490 if (Simp.Val) return Simp;
1495 if (N1C->getValue())
1496 return N2; // select true, X, Y -> X
1498 return N3; // select false, X, Y -> Y
1500 if (N2 == N3) return N2; // select C, X, X -> X
1504 if (N2C->getValue()) // Unconditional branch
1505 return getNode(ISD::BR, MVT::Other, N1, N3);
1507 return N1; // Never-taken branch
1509 case ISD::VECTOR_SHUFFLE:
1510 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1511 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1512 N3.getOpcode() == ISD::BUILD_VECTOR &&
1513 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1514 "Illegal VECTOR_SHUFFLE node!");
1518 // Memoize node if it doesn't produce a flag.
1520 SDVTList VTs = getVTList(VT);
1521 if (VT != MVT::Flag) {
1522 FoldingSetNodeID ID;
1523 AddNodeIDNode(ID, Opcode, VTs, N1, N2, N3);
1525 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1526 return SDOperand(E, 0);
1527 N = new SDNode(Opcode, N1, N2, N3);
1528 N->setValueTypes(VTs);
1529 CSEMap.InsertNode(N, IP);
1531 N = new SDNode(Opcode, N1, N2, N3);
1532 N->setValueTypes(VTs);
1534 AllNodes.push_back(N);
1535 return SDOperand(N, 0);
1538 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1539 SDOperand N1, SDOperand N2, SDOperand N3,
1541 SDOperand Ops[] = { N1, N2, N3, N4 };
1542 return getNode(Opcode, VT, Ops, 4);
1545 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1546 SDOperand N1, SDOperand N2, SDOperand N3,
1547 SDOperand N4, SDOperand N5) {
1548 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
1549 return getNode(Opcode, VT, Ops, 5);
1552 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1553 SDOperand Chain, SDOperand Ptr,
1554 const Value *SV, int SVOffset,
1556 // FIXME: Alignment == 1 for now.
1557 unsigned Alignment = 1;
1558 SDVTList VTs = getVTList(VT, MVT::Other);
1559 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1560 FoldingSetNodeID ID;
1561 AddNodeIDNode(ID, ISD::LOAD, VTs, Chain, Ptr, Undef);
1562 ID.AddInteger(ISD::UNINDEXED);
1563 ID.AddInteger(ISD::NON_EXTLOAD);
1566 ID.AddInteger(SVOffset);
1567 ID.AddInteger(Alignment);
1568 ID.AddInteger(isVolatile);
1570 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1571 return SDOperand(E, 0);
1572 SDNode *N = new LoadSDNode(Chain, Ptr, Undef, ISD::UNINDEXED,
1573 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
1575 N->setValueTypes(VTs);
1576 CSEMap.InsertNode(N, IP);
1577 AllNodes.push_back(N);
1578 return SDOperand(N, 0);
1581 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
1582 SDOperand Chain, SDOperand Ptr, const Value *SV,
1583 int SVOffset, MVT::ValueType EVT,
1585 // If they are asking for an extending load from/to the same thing, return a
1588 ExtType = ISD::NON_EXTLOAD;
1590 if (MVT::isVector(VT))
1591 assert(EVT == MVT::getVectorBaseType(VT) && "Invalid vector extload!");
1593 assert(EVT < VT && "Should only be an extending load, not truncating!");
1594 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
1595 "Cannot sign/zero extend a FP/Vector load!");
1596 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
1597 "Cannot convert from FP to Int or Int -> FP!");
1599 // FIXME: Alignment == 1 for now.
1600 unsigned Alignment = 1;
1601 SDVTList VTs = getVTList(VT, MVT::Other);
1602 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1603 FoldingSetNodeID ID;
1604 AddNodeIDNode(ID, ISD::LOAD, VTs, Chain, Ptr, Undef);
1605 ID.AddInteger(ISD::UNINDEXED);
1606 ID.AddInteger(ExtType);
1609 ID.AddInteger(SVOffset);
1610 ID.AddInteger(Alignment);
1611 ID.AddInteger(isVolatile);
1613 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1614 return SDOperand(E, 0);
1615 SDNode *N = new LoadSDNode(Chain, Ptr, Undef, ISD::UNINDEXED, ExtType, EVT,
1616 SV, SVOffset, Alignment, isVolatile);
1617 N->setValueTypes(VTs);
1618 CSEMap.InsertNode(N, IP);
1619 AllNodes.push_back(N);
1620 return SDOperand(N, 0);
1623 SDOperand SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
1624 SDOperand Offset, ISD::MemOpAddrMode AM){
1625 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
1626 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
1627 "Load is already a indexed load!");
1628 MVT::ValueType VT = OrigLoad.getValueType();
1629 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
1630 FoldingSetNodeID ID;
1631 AddNodeIDNode(ID, ISD::LOAD, VTs, LD->getChain(), Base, Offset);
1633 ID.AddInteger(LD->getExtensionType());
1634 ID.AddInteger(LD->getLoadedVT());
1635 ID.AddPointer(LD->getSrcValue());
1636 ID.AddInteger(LD->getSrcValueOffset());
1637 ID.AddInteger(LD->getAlignment());
1638 ID.AddInteger(LD->isVolatile());
1640 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1641 return SDOperand(E, 0);
1642 SDNode *N = new LoadSDNode(LD->getChain(), Base, Offset, AM,
1643 LD->getExtensionType(), LD->getLoadedVT(),
1644 LD->getSrcValue(), LD->getSrcValueOffset(),
1645 LD->getAlignment(), LD->isVolatile());
1646 N->setValueTypes(VTs);
1647 CSEMap.InsertNode(N, IP);
1648 AllNodes.push_back(N);
1649 return SDOperand(N, 0);
1652 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1653 SDOperand Chain, SDOperand Ptr,
1655 SDOperand Ops[] = { Chain, Ptr, SV, getConstant(Count, MVT::i32),
1656 getValueType(EVT) };
1657 return getNode(ISD::VLOAD, getVTList(MVT::Vector, MVT::Other), Ops, 5);
1660 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
1661 SDOperand Ptr, const Value *SV, int SVOffset,
1663 MVT::ValueType VT = Val.getValueType();
1665 // FIXME: Alignment == 1 for now.
1666 unsigned Alignment = 1;
1667 SDVTList VTs = getVTList(MVT::Other);
1668 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1669 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1670 FoldingSetNodeID ID;
1671 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1672 ID.AddInteger(ISD::UNINDEXED);
1673 ID.AddInteger(false);
1676 ID.AddInteger(SVOffset);
1677 ID.AddInteger(Alignment);
1678 ID.AddInteger(isVolatile);
1680 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1681 return SDOperand(E, 0);
1682 SDNode *N = new StoreSDNode(Chain, Val, Ptr, Undef, ISD::UNINDEXED, false,
1683 VT, SV, SVOffset, Alignment, isVolatile);
1684 N->setValueTypes(VTs);
1685 CSEMap.InsertNode(N, IP);
1686 AllNodes.push_back(N);
1687 return SDOperand(N, 0);
1690 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
1691 SDOperand Ptr, const Value *SV,
1692 int SVOffset, MVT::ValueType SVT,
1694 MVT::ValueType VT = Val.getValueType();
1695 bool isTrunc = VT != SVT;
1697 assert(VT > SVT && "Not a truncation?");
1698 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
1699 "Can't do FP-INT conversion!");
1701 // FIXME: Alignment == 1 for now.
1702 unsigned Alignment = 1;
1703 SDVTList VTs = getVTList(MVT::Other);
1704 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1705 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1706 FoldingSetNodeID ID;
1707 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1708 ID.AddInteger(ISD::UNINDEXED);
1709 ID.AddInteger(isTrunc);
1712 ID.AddInteger(SVOffset);
1713 ID.AddInteger(Alignment);
1714 ID.AddInteger(isVolatile);
1716 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1717 return SDOperand(E, 0);
1718 SDNode *N = new StoreSDNode(Chain, Val, Ptr, Undef, ISD::UNINDEXED, isTrunc,
1719 SVT, SV, SVOffset, Alignment, isVolatile);
1720 N->setValueTypes(VTs);
1721 CSEMap.InsertNode(N, IP);
1722 AllNodes.push_back(N);
1723 return SDOperand(N, 0);
1726 SDOperand SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
1727 SDOperand Offset, ISD::MemOpAddrMode 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::getAddressingModeName(ISD::MemOpAddrMode 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 = getAddressingModeName(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 = getAddressingModeName(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();