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/GlobalVariable.h"
18 #include "llvm/Intrinsics.h"
19 #include "llvm/Assembly/Writer.h"
20 #include "llvm/CodeGen/MachineBasicBlock.h"
21 #include "llvm/CodeGen/MachineConstantPool.h"
22 #include "llvm/Support/MathExtras.h"
23 #include "llvm/Target/TargetData.h"
24 #include "llvm/Target/MRegisterInfo.h"
25 #include "llvm/Target/TargetLowering.h"
26 #include "llvm/Target/TargetInstrInfo.h"
27 #include "llvm/Target/TargetMachine.h"
28 #include "llvm/ADT/SetVector.h"
29 #include "llvm/ADT/SmallPtrSet.h"
30 #include "llvm/ADT/SmallVector.h"
31 #include "llvm/ADT/StringExtras.h"
36 /// makeVTList - Return an instance of the SDVTList struct initialized with the
37 /// specified members.
38 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
39 SDVTList Res = {VTs, NumVTs};
43 //===----------------------------------------------------------------------===//
44 // ConstantFPSDNode Class
45 //===----------------------------------------------------------------------===//
47 /// isExactlyValue - We don't rely on operator== working on double values, as
48 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
49 /// As such, this method can be used to do an exact bit-for-bit comparison of
50 /// two floating point values.
51 bool ConstantFPSDNode::isExactlyValue(double V) const {
52 return DoubleToBits(V) == DoubleToBits(Value);
55 //===----------------------------------------------------------------------===//
57 //===----------------------------------------------------------------------===//
59 /// isBuildVectorAllOnes - Return true if the specified node is a
60 /// BUILD_VECTOR where all of the elements are ~0 or undef.
61 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
62 // Look through a bit convert.
63 if (N->getOpcode() == ISD::BIT_CONVERT)
64 N = N->getOperand(0).Val;
66 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
68 unsigned i = 0, e = N->getNumOperands();
70 // Skip over all of the undef values.
71 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
74 // Do not accept an all-undef vector.
75 if (i == e) return false;
77 // Do not accept build_vectors that aren't all constants or which have non-~0
79 SDOperand NotZero = N->getOperand(i);
80 if (isa<ConstantSDNode>(NotZero)) {
81 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
83 } else if (isa<ConstantFPSDNode>(NotZero)) {
84 MVT::ValueType VT = NotZero.getValueType();
86 if (DoubleToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
90 if (FloatToBits(cast<ConstantFPSDNode>(NotZero)->getValue()) !=
97 // Okay, we have at least one ~0 value, check to see if the rest match or are
99 for (++i; i != e; ++i)
100 if (N->getOperand(i) != NotZero &&
101 N->getOperand(i).getOpcode() != ISD::UNDEF)
107 /// isBuildVectorAllZeros - Return true if the specified node is a
108 /// BUILD_VECTOR where all of the elements are 0 or undef.
109 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
110 // Look through a bit convert.
111 if (N->getOpcode() == ISD::BIT_CONVERT)
112 N = N->getOperand(0).Val;
114 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
116 unsigned i = 0, e = N->getNumOperands();
118 // Skip over all of the undef values.
119 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
122 // Do not accept an all-undef vector.
123 if (i == e) return false;
125 // Do not accept build_vectors that aren't all constants or which have non-~0
127 SDOperand Zero = N->getOperand(i);
128 if (isa<ConstantSDNode>(Zero)) {
129 if (!cast<ConstantSDNode>(Zero)->isNullValue())
131 } else if (isa<ConstantFPSDNode>(Zero)) {
132 if (!cast<ConstantFPSDNode>(Zero)->isExactlyValue(0.0))
137 // Okay, we have at least one ~0 value, check to see if the rest match or are
139 for (++i; i != e; ++i)
140 if (N->getOperand(i) != Zero &&
141 N->getOperand(i).getOpcode() != ISD::UNDEF)
146 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
147 /// when given the operation for (X op Y).
148 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
149 // To perform this operation, we just need to swap the L and G bits of the
151 unsigned OldL = (Operation >> 2) & 1;
152 unsigned OldG = (Operation >> 1) & 1;
153 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
154 (OldL << 1) | // New G bit
155 (OldG << 2)); // New L bit.
158 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
159 /// 'op' is a valid SetCC operation.
160 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
161 unsigned Operation = Op;
163 Operation ^= 7; // Flip L, G, E bits, but not U.
165 Operation ^= 15; // Flip all of the condition bits.
166 if (Operation > ISD::SETTRUE2)
167 Operation &= ~8; // Don't let N and U bits get set.
168 return ISD::CondCode(Operation);
172 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
173 /// signed operation and 2 if the result is an unsigned comparison. Return zero
174 /// if the operation does not depend on the sign of the input (setne and seteq).
175 static int isSignedOp(ISD::CondCode Opcode) {
177 default: assert(0 && "Illegal integer setcc operation!");
179 case ISD::SETNE: return 0;
183 case ISD::SETGE: return 1;
187 case ISD::SETUGE: return 2;
191 /// getSetCCOrOperation - Return the result of a logical OR between different
192 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
193 /// returns SETCC_INVALID if it is not possible to represent the resultant
195 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
197 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
198 // Cannot fold a signed integer setcc with an unsigned integer setcc.
199 return ISD::SETCC_INVALID;
201 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
203 // If the N and U bits get set then the resultant comparison DOES suddenly
204 // care about orderedness, and is true when ordered.
205 if (Op > ISD::SETTRUE2)
206 Op &= ~16; // Clear the U bit if the N bit is set.
208 // Canonicalize illegal integer setcc's.
209 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
212 return ISD::CondCode(Op);
215 /// getSetCCAndOperation - Return the result of a logical AND between different
216 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
217 /// function returns zero if it is not possible to represent the resultant
219 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
221 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
222 // Cannot fold a signed setcc with an unsigned setcc.
223 return ISD::SETCC_INVALID;
225 // Combine all of the condition bits.
226 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
228 // Canonicalize illegal integer setcc's.
232 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
233 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
234 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
235 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
242 const TargetMachine &SelectionDAG::getTarget() const {
243 return TLI.getTargetMachine();
246 //===----------------------------------------------------------------------===//
247 // SDNode Profile Support
248 //===----------------------------------------------------------------------===//
250 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
252 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
256 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
257 /// solely with their pointer.
258 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
259 ID.AddPointer(VTList.VTs);
262 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
264 static void AddNodeIDOperands(FoldingSetNodeID &ID,
265 const SDOperand *Ops, unsigned NumOps) {
266 for (; NumOps; --NumOps, ++Ops) {
267 ID.AddPointer(Ops->Val);
268 ID.AddInteger(Ops->ResNo);
272 static void AddNodeIDNode(FoldingSetNodeID &ID,
273 unsigned short OpC, SDVTList VTList,
274 const SDOperand *OpList, unsigned N) {
275 AddNodeIDOpcode(ID, OpC);
276 AddNodeIDValueTypes(ID, VTList);
277 AddNodeIDOperands(ID, OpList, N);
280 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
282 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
283 AddNodeIDOpcode(ID, N->getOpcode());
284 // Add the return value info.
285 AddNodeIDValueTypes(ID, N->getVTList());
286 // Add the operand info.
287 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
289 // Handle SDNode leafs with special info.
290 switch (N->getOpcode()) {
291 default: break; // Normal nodes don't need extra info.
292 case ISD::TargetConstant:
294 ID.AddInteger(cast<ConstantSDNode>(N)->getValue());
296 case ISD::TargetConstantFP:
297 case ISD::ConstantFP:
298 ID.AddDouble(cast<ConstantFPSDNode>(N)->getValue());
300 case ISD::TargetGlobalAddress:
301 case ISD::GlobalAddress:
302 case ISD::TargetGlobalTLSAddress:
303 case ISD::GlobalTLSAddress: {
304 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
305 ID.AddPointer(GA->getGlobal());
306 ID.AddInteger(GA->getOffset());
309 case ISD::BasicBlock:
310 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
313 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
315 case ISD::SRCVALUE: {
316 SrcValueSDNode *SV = cast<SrcValueSDNode>(N);
317 ID.AddPointer(SV->getValue());
318 ID.AddInteger(SV->getOffset());
321 case ISD::FrameIndex:
322 case ISD::TargetFrameIndex:
323 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
326 case ISD::TargetJumpTable:
327 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
329 case ISD::ConstantPool:
330 case ISD::TargetConstantPool: {
331 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
332 ID.AddInteger(CP->getAlignment());
333 ID.AddInteger(CP->getOffset());
334 if (CP->isMachineConstantPoolEntry())
335 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
337 ID.AddPointer(CP->getConstVal());
341 LoadSDNode *LD = cast<LoadSDNode>(N);
342 ID.AddInteger(LD->getAddressingMode());
343 ID.AddInteger(LD->getExtensionType());
344 ID.AddInteger(LD->getLoadedVT());
345 ID.AddPointer(LD->getSrcValue());
346 ID.AddInteger(LD->getSrcValueOffset());
347 ID.AddInteger(LD->getAlignment());
348 ID.AddInteger(LD->isVolatile());
352 StoreSDNode *ST = cast<StoreSDNode>(N);
353 ID.AddInteger(ST->getAddressingMode());
354 ID.AddInteger(ST->isTruncatingStore());
355 ID.AddInteger(ST->getStoredVT());
356 ID.AddPointer(ST->getSrcValue());
357 ID.AddInteger(ST->getSrcValueOffset());
358 ID.AddInteger(ST->getAlignment());
359 ID.AddInteger(ST->isVolatile());
365 //===----------------------------------------------------------------------===//
366 // SelectionDAG Class
367 //===----------------------------------------------------------------------===//
369 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
371 void SelectionDAG::RemoveDeadNodes() {
372 // Create a dummy node (which is not added to allnodes), that adds a reference
373 // to the root node, preventing it from being deleted.
374 HandleSDNode Dummy(getRoot());
376 SmallVector<SDNode*, 128> DeadNodes;
378 // Add all obviously-dead nodes to the DeadNodes worklist.
379 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
381 DeadNodes.push_back(I);
383 // Process the worklist, deleting the nodes and adding their uses to the
385 while (!DeadNodes.empty()) {
386 SDNode *N = DeadNodes.back();
387 DeadNodes.pop_back();
389 // Take the node out of the appropriate CSE map.
390 RemoveNodeFromCSEMaps(N);
392 // Next, brutally remove the operand list. This is safe to do, as there are
393 // no cycles in the graph.
394 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
395 SDNode *Operand = I->Val;
396 Operand->removeUser(N);
398 // Now that we removed this operand, see if there are no uses of it left.
399 if (Operand->use_empty())
400 DeadNodes.push_back(Operand);
402 if (N->OperandsNeedDelete)
403 delete[] N->OperandList;
407 // Finally, remove N itself.
411 // If the root changed (e.g. it was a dead load, update the root).
412 setRoot(Dummy.getValue());
415 void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) {
416 SmallVector<SDNode*, 16> DeadNodes;
417 DeadNodes.push_back(N);
419 // Process the worklist, deleting the nodes and adding their uses to the
421 while (!DeadNodes.empty()) {
422 SDNode *N = DeadNodes.back();
423 DeadNodes.pop_back();
425 // Take the node out of the appropriate CSE map.
426 RemoveNodeFromCSEMaps(N);
428 // Next, brutally remove the operand list. This is safe to do, as there are
429 // no cycles in the graph.
430 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
431 SDNode *Operand = I->Val;
432 Operand->removeUser(N);
434 // Now that we removed this operand, see if there are no uses of it left.
435 if (Operand->use_empty())
436 DeadNodes.push_back(Operand);
438 if (N->OperandsNeedDelete)
439 delete[] N->OperandList;
443 // Finally, remove N itself.
444 Deleted.push_back(N);
449 void SelectionDAG::DeleteNode(SDNode *N) {
450 assert(N->use_empty() && "Cannot delete a node that is not dead!");
452 // First take this out of the appropriate CSE map.
453 RemoveNodeFromCSEMaps(N);
455 // Finally, remove uses due to operands of this node, remove from the
456 // AllNodes list, and delete the node.
457 DeleteNodeNotInCSEMaps(N);
460 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
462 // Remove it from the AllNodes list.
465 // Drop all of the operands and decrement used nodes use counts.
466 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
467 I->Val->removeUser(N);
468 if (N->OperandsNeedDelete)
469 delete[] N->OperandList;
476 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
477 /// correspond to it. This is useful when we're about to delete or repurpose
478 /// the node. We don't want future request for structurally identical nodes
479 /// to return N anymore.
480 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
482 switch (N->getOpcode()) {
483 case ISD::HANDLENODE: return; // noop.
485 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
488 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
489 "Cond code doesn't exist!");
490 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
491 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
493 case ISD::ExternalSymbol:
494 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
496 case ISD::TargetExternalSymbol:
498 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
501 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
502 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
505 // Remove it from the CSE Map.
506 Erased = CSEMap.RemoveNode(N);
510 // Verify that the node was actually in one of the CSE maps, unless it has a
511 // flag result (which cannot be CSE'd) or is one of the special cases that are
512 // not subject to CSE.
513 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
514 !N->isTargetOpcode()) {
517 assert(0 && "Node is not in map!");
522 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
523 /// has been taken out and modified in some way. If the specified node already
524 /// exists in the CSE maps, do not modify the maps, but return the existing node
525 /// instead. If it doesn't exist, add it and return null.
527 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
528 assert(N->getNumOperands() && "This is a leaf node!");
529 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
530 return 0; // Never add these nodes.
532 // Check that remaining values produced are not flags.
533 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
534 if (N->getValueType(i) == MVT::Flag)
535 return 0; // Never CSE anything that produces a flag.
537 SDNode *New = CSEMap.GetOrInsertNode(N);
538 if (New != N) return New; // Node already existed.
542 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
543 /// were replaced with those specified. If this node is never memoized,
544 /// return null, otherwise return a pointer to the slot it would take. If a
545 /// node already exists with these operands, the slot will be non-null.
546 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
548 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
549 return 0; // Never add these nodes.
551 // Check that remaining values produced are not flags.
552 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
553 if (N->getValueType(i) == MVT::Flag)
554 return 0; // Never CSE anything that produces a flag.
556 SDOperand Ops[] = { Op };
558 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
559 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
562 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
563 /// were replaced with those specified. If this node is never memoized,
564 /// return null, otherwise return a pointer to the slot it would take. If a
565 /// node already exists with these operands, the slot will be non-null.
566 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
567 SDOperand Op1, SDOperand Op2,
569 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
570 return 0; // Never add these nodes.
572 // Check that remaining values produced are not flags.
573 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
574 if (N->getValueType(i) == MVT::Flag)
575 return 0; // Never CSE anything that produces a flag.
577 SDOperand Ops[] = { Op1, Op2 };
579 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
580 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
584 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
585 /// were replaced with those specified. If this node is never memoized,
586 /// return null, otherwise return a pointer to the slot it would take. If a
587 /// node already exists with these operands, the slot will be non-null.
588 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
589 const SDOperand *Ops,unsigned NumOps,
591 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
592 return 0; // Never add these nodes.
594 // Check that remaining values produced are not flags.
595 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
596 if (N->getValueType(i) == MVT::Flag)
597 return 0; // Never CSE anything that produces a flag.
600 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), 0, 0);
602 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
603 ID.AddInteger(LD->getAddressingMode());
604 ID.AddInteger(LD->getExtensionType());
605 ID.AddInteger(LD->getLoadedVT());
606 ID.AddPointer(LD->getSrcValue());
607 ID.AddInteger(LD->getSrcValueOffset());
608 ID.AddInteger(LD->getAlignment());
609 ID.AddInteger(LD->isVolatile());
610 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
611 ID.AddInteger(ST->getAddressingMode());
612 ID.AddInteger(ST->isTruncatingStore());
613 ID.AddInteger(ST->getStoredVT());
614 ID.AddPointer(ST->getSrcValue());
615 ID.AddInteger(ST->getSrcValueOffset());
616 ID.AddInteger(ST->getAlignment());
617 ID.AddInteger(ST->isVolatile());
620 AddNodeIDOperands(ID, Ops, NumOps);
621 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
625 SelectionDAG::~SelectionDAG() {
626 while (!AllNodes.empty()) {
627 SDNode *N = AllNodes.begin();
628 N->SetNextInBucket(0);
629 if (N->OperandsNeedDelete)
630 delete [] N->OperandList;
633 AllNodes.pop_front();
637 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
638 if (Op.getValueType() == VT) return Op;
639 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
640 return getNode(ISD::AND, Op.getValueType(), Op,
641 getConstant(Imm, Op.getValueType()));
644 SDOperand SelectionDAG::getString(const std::string &Val) {
645 StringSDNode *&N = StringNodes[Val];
647 N = new StringSDNode(Val);
648 AllNodes.push_back(N);
650 return SDOperand(N, 0);
653 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
654 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
655 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
657 // Mask out any bits that are not valid for this constant.
658 Val &= MVT::getIntVTBitMask(VT);
660 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
662 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
665 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
666 return SDOperand(E, 0);
667 SDNode *N = new ConstantSDNode(isT, Val, VT);
668 CSEMap.InsertNode(N, IP);
669 AllNodes.push_back(N);
670 return SDOperand(N, 0);
674 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
676 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
678 Val = (float)Val; // Mask out extra precision.
680 // Do the map lookup using the actual bit pattern for the floating point
681 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
682 // we don't have issues with SNANs.
683 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
685 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
688 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
689 return SDOperand(E, 0);
690 SDNode *N = new ConstantFPSDNode(isTarget, Val, VT);
691 CSEMap.InsertNode(N, IP);
692 AllNodes.push_back(N);
693 return SDOperand(N, 0);
696 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
697 MVT::ValueType VT, int Offset,
699 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
701 if (GVar && GVar->isThreadLocal())
702 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
704 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
706 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
708 ID.AddInteger(Offset);
710 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
711 return SDOperand(E, 0);
712 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
713 CSEMap.InsertNode(N, IP);
714 AllNodes.push_back(N);
715 return SDOperand(N, 0);
718 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
720 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
722 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
725 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
726 return SDOperand(E, 0);
727 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
728 CSEMap.InsertNode(N, IP);
729 AllNodes.push_back(N);
730 return SDOperand(N, 0);
733 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
734 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
736 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
739 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
740 return SDOperand(E, 0);
741 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
742 CSEMap.InsertNode(N, IP);
743 AllNodes.push_back(N);
744 return SDOperand(N, 0);
747 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
748 unsigned Alignment, int Offset,
750 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
752 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
753 ID.AddInteger(Alignment);
754 ID.AddInteger(Offset);
757 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
758 return SDOperand(E, 0);
759 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
760 CSEMap.InsertNode(N, IP);
761 AllNodes.push_back(N);
762 return SDOperand(N, 0);
766 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
768 unsigned Alignment, int Offset,
770 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
772 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
773 ID.AddInteger(Alignment);
774 ID.AddInteger(Offset);
775 C->AddSelectionDAGCSEId(ID);
777 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
778 return SDOperand(E, 0);
779 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
780 CSEMap.InsertNode(N, IP);
781 AllNodes.push_back(N);
782 return SDOperand(N, 0);
786 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
788 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
791 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
792 return SDOperand(E, 0);
793 SDNode *N = new BasicBlockSDNode(MBB);
794 CSEMap.InsertNode(N, IP);
795 AllNodes.push_back(N);
796 return SDOperand(N, 0);
799 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
800 if ((unsigned)VT >= ValueTypeNodes.size())
801 ValueTypeNodes.resize(VT+1);
802 if (ValueTypeNodes[VT] == 0) {
803 ValueTypeNodes[VT] = new VTSDNode(VT);
804 AllNodes.push_back(ValueTypeNodes[VT]);
807 return SDOperand(ValueTypeNodes[VT], 0);
810 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
811 SDNode *&N = ExternalSymbols[Sym];
812 if (N) return SDOperand(N, 0);
813 N = new ExternalSymbolSDNode(false, Sym, VT);
814 AllNodes.push_back(N);
815 return SDOperand(N, 0);
818 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
820 SDNode *&N = TargetExternalSymbols[Sym];
821 if (N) return SDOperand(N, 0);
822 N = new ExternalSymbolSDNode(true, Sym, VT);
823 AllNodes.push_back(N);
824 return SDOperand(N, 0);
827 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
828 if ((unsigned)Cond >= CondCodeNodes.size())
829 CondCodeNodes.resize(Cond+1);
831 if (CondCodeNodes[Cond] == 0) {
832 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
833 AllNodes.push_back(CondCodeNodes[Cond]);
835 return SDOperand(CondCodeNodes[Cond], 0);
838 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
840 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
841 ID.AddInteger(RegNo);
843 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
844 return SDOperand(E, 0);
845 SDNode *N = new RegisterSDNode(RegNo, VT);
846 CSEMap.InsertNode(N, IP);
847 AllNodes.push_back(N);
848 return SDOperand(N, 0);
851 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
852 assert((!V || isa<PointerType>(V->getType())) &&
853 "SrcValue is not a pointer?");
856 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
858 ID.AddInteger(Offset);
860 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
861 return SDOperand(E, 0);
862 SDNode *N = new SrcValueSDNode(V, Offset);
863 CSEMap.InsertNode(N, IP);
864 AllNodes.push_back(N);
865 return SDOperand(N, 0);
868 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
869 SDOperand N2, ISD::CondCode Cond) {
870 // These setcc operations always fold.
874 case ISD::SETFALSE2: return getConstant(0, VT);
876 case ISD::SETTRUE2: return getConstant(1, VT);
888 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
892 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
893 uint64_t C2 = N2C->getValue();
894 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
895 uint64_t C1 = N1C->getValue();
897 // Sign extend the operands if required
898 if (ISD::isSignedIntSetCC(Cond)) {
899 C1 = N1C->getSignExtended();
900 C2 = N2C->getSignExtended();
904 default: assert(0 && "Unknown integer setcc!");
905 case ISD::SETEQ: return getConstant(C1 == C2, VT);
906 case ISD::SETNE: return getConstant(C1 != C2, VT);
907 case ISD::SETULT: return getConstant(C1 < C2, VT);
908 case ISD::SETUGT: return getConstant(C1 > C2, VT);
909 case ISD::SETULE: return getConstant(C1 <= C2, VT);
910 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
911 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
912 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
913 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
914 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
918 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
919 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
920 double C1 = N1C->getValue(), C2 = N2C->getValue();
923 default: break; // FIXME: Implement the rest of these!
924 case ISD::SETEQ: return getConstant(C1 == C2, VT);
925 case ISD::SETNE: return getConstant(C1 != C2, VT);
926 case ISD::SETLT: return getConstant(C1 < C2, VT);
927 case ISD::SETGT: return getConstant(C1 > C2, VT);
928 case ISD::SETLE: return getConstant(C1 <= C2, VT);
929 case ISD::SETGE: return getConstant(C1 >= C2, VT);
932 // Ensure that the constant occurs on the RHS.
933 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
936 // Could not fold it.
941 /// getNode - Gets or creates the specified node.
943 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
945 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
947 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
948 return SDOperand(E, 0);
949 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
950 CSEMap.InsertNode(N, IP);
952 AllNodes.push_back(N);
953 return SDOperand(N, 0);
956 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
959 // Constant fold unary operations with an integer constant operand.
960 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
961 uint64_t Val = C->getValue();
964 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
965 case ISD::ANY_EXTEND:
966 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
967 case ISD::TRUNCATE: return getConstant(Val, VT);
968 case ISD::SINT_TO_FP: return getConstantFP(C->getSignExtended(), VT);
969 case ISD::UINT_TO_FP: return getConstantFP(C->getValue(), VT);
970 case ISD::BIT_CONVERT:
971 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
972 return getConstantFP(BitsToFloat(Val), VT);
973 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
974 return getConstantFP(BitsToDouble(Val), VT);
978 default: assert(0 && "Invalid bswap!"); break;
979 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
980 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
981 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
986 default: assert(0 && "Invalid ctpop!"); break;
987 case MVT::i1: return getConstant(Val != 0, VT);
989 Tmp1 = (unsigned)Val & 0xFF;
990 return getConstant(CountPopulation_32(Tmp1), VT);
992 Tmp1 = (unsigned)Val & 0xFFFF;
993 return getConstant(CountPopulation_32(Tmp1), VT);
995 return getConstant(CountPopulation_32((unsigned)Val), VT);
997 return getConstant(CountPopulation_64(Val), VT);
1001 default: assert(0 && "Invalid ctlz!"); break;
1002 case MVT::i1: return getConstant(Val == 0, VT);
1004 Tmp1 = (unsigned)Val & 0xFF;
1005 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1007 Tmp1 = (unsigned)Val & 0xFFFF;
1008 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1010 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1012 return getConstant(CountLeadingZeros_64(Val), VT);
1016 default: assert(0 && "Invalid cttz!"); break;
1017 case MVT::i1: return getConstant(Val == 0, VT);
1019 Tmp1 = (unsigned)Val | 0x100;
1020 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1022 Tmp1 = (unsigned)Val | 0x10000;
1023 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1025 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1027 return getConstant(CountTrailingZeros_64(Val), VT);
1032 // Constant fold unary operations with an floating point constant operand.
1033 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val))
1036 return getConstantFP(-C->getValue(), VT);
1038 return getConstantFP(fabs(C->getValue()), VT);
1040 case ISD::FP_EXTEND:
1041 return getConstantFP(C->getValue(), VT);
1042 case ISD::FP_TO_SINT:
1043 return getConstant((int64_t)C->getValue(), VT);
1044 case ISD::FP_TO_UINT:
1045 return getConstant((uint64_t)C->getValue(), VT);
1046 case ISD::BIT_CONVERT:
1047 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1048 return getConstant(FloatToBits(C->getValue()), VT);
1049 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1050 return getConstant(DoubleToBits(C->getValue()), VT);
1054 unsigned OpOpcode = Operand.Val->getOpcode();
1056 case ISD::TokenFactor:
1057 return Operand; // Factor of one node? No factor.
1059 case ISD::FP_EXTEND:
1060 assert(MVT::isFloatingPoint(VT) &&
1061 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1063 case ISD::SIGN_EXTEND:
1064 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1065 "Invalid SIGN_EXTEND!");
1066 if (Operand.getValueType() == VT) return Operand; // noop extension
1067 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1068 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1069 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1071 case ISD::ZERO_EXTEND:
1072 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1073 "Invalid ZERO_EXTEND!");
1074 if (Operand.getValueType() == VT) return Operand; // noop extension
1075 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1076 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1077 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1079 case ISD::ANY_EXTEND:
1080 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1081 "Invalid ANY_EXTEND!");
1082 if (Operand.getValueType() == VT) return Operand; // noop extension
1083 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1084 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1085 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1086 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1089 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1090 "Invalid TRUNCATE!");
1091 if (Operand.getValueType() == VT) return Operand; // noop truncate
1092 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1093 if (OpOpcode == ISD::TRUNCATE)
1094 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1095 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1096 OpOpcode == ISD::ANY_EXTEND) {
1097 // If the source is smaller than the dest, we still need an extend.
1098 if (Operand.Val->getOperand(0).getValueType() < VT)
1099 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1100 else if (Operand.Val->getOperand(0).getValueType() > VT)
1101 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1103 return Operand.Val->getOperand(0);
1106 case ISD::BIT_CONVERT:
1107 // Basic sanity checking.
1108 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1109 && "Cannot BIT_CONVERT between types of different sizes!");
1110 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1111 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1112 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1113 if (OpOpcode == ISD::UNDEF)
1114 return getNode(ISD::UNDEF, VT);
1116 case ISD::SCALAR_TO_VECTOR:
1117 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1118 MVT::getVectorBaseType(VT) == Operand.getValueType() &&
1119 "Illegal SCALAR_TO_VECTOR node!");
1122 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1123 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1124 Operand.Val->getOperand(0));
1125 if (OpOpcode == ISD::FNEG) // --X -> X
1126 return Operand.Val->getOperand(0);
1129 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1130 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1135 SDVTList VTs = getVTList(VT);
1136 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1137 FoldingSetNodeID ID;
1138 SDOperand Ops[1] = { Operand };
1139 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1141 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1142 return SDOperand(E, 0);
1143 N = new UnarySDNode(Opcode, VTs, Operand);
1144 CSEMap.InsertNode(N, IP);
1146 N = new UnarySDNode(Opcode, VTs, Operand);
1148 AllNodes.push_back(N);
1149 return SDOperand(N, 0);
1154 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1155 SDOperand N1, SDOperand N2) {
1158 case ISD::TokenFactor:
1159 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1160 N2.getValueType() == MVT::Other && "Invalid token factor!");
1169 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1176 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1183 assert(N1.getValueType() == N2.getValueType() &&
1184 N1.getValueType() == VT && "Binary operator types must match!");
1186 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1187 assert(N1.getValueType() == VT &&
1188 MVT::isFloatingPoint(N1.getValueType()) &&
1189 MVT::isFloatingPoint(N2.getValueType()) &&
1190 "Invalid FCOPYSIGN!");
1197 assert(VT == N1.getValueType() &&
1198 "Shift operators return type must be the same as their first arg");
1199 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1200 VT != MVT::i1 && "Shifts only work on integers");
1202 case ISD::FP_ROUND_INREG: {
1203 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1204 assert(VT == N1.getValueType() && "Not an inreg round!");
1205 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1206 "Cannot FP_ROUND_INREG integer types");
1207 assert(EVT <= VT && "Not rounding down!");
1210 case ISD::AssertSext:
1211 case ISD::AssertZext:
1212 case ISD::SIGN_EXTEND_INREG: {
1213 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1214 assert(VT == N1.getValueType() && "Not an inreg extend!");
1215 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1216 "Cannot *_EXTEND_INREG FP types");
1217 assert(EVT <= VT && "Not extending!");
1224 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1225 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1227 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1228 int64_t Val = N1C->getValue();
1229 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1230 Val <<= 64-FromBits;
1231 Val >>= 64-FromBits;
1232 return getConstant(Val, VT);
1236 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1238 case ISD::ADD: return getConstant(C1 + C2, VT);
1239 case ISD::SUB: return getConstant(C1 - C2, VT);
1240 case ISD::MUL: return getConstant(C1 * C2, VT);
1242 if (C2) return getConstant(C1 / C2, VT);
1245 if (C2) return getConstant(C1 % C2, VT);
1248 if (C2) return getConstant(N1C->getSignExtended() /
1249 N2C->getSignExtended(), VT);
1252 if (C2) return getConstant(N1C->getSignExtended() %
1253 N2C->getSignExtended(), VT);
1255 case ISD::AND : return getConstant(C1 & C2, VT);
1256 case ISD::OR : return getConstant(C1 | C2, VT);
1257 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1258 case ISD::SHL : return getConstant(C1 << C2, VT);
1259 case ISD::SRL : return getConstant(C1 >> C2, VT);
1260 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1262 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1265 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1269 } else { // Cannonicalize constant to RHS if commutative
1270 if (isCommutativeBinOp(Opcode)) {
1271 std::swap(N1C, N2C);
1277 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1278 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1281 double C1 = N1CFP->getValue(), C2 = N2CFP->getValue();
1283 case ISD::FADD: return getConstantFP(C1 + C2, VT);
1284 case ISD::FSUB: return getConstantFP(C1 - C2, VT);
1285 case ISD::FMUL: return getConstantFP(C1 * C2, VT);
1287 if (C2) return getConstantFP(C1 / C2, VT);
1290 if (C2) return getConstantFP(fmod(C1, C2), VT);
1292 case ISD::FCOPYSIGN: {
1303 if (u2.I < 0) // Sign bit of RHS set?
1304 u1.I |= 1ULL << 63; // Set the sign bit of the LHS.
1306 u1.I &= (1ULL << 63)-1; // Clear the sign bit of the LHS.
1307 return getConstantFP(u1.F, VT);
1311 } else { // Cannonicalize constant to RHS if commutative
1312 if (isCommutativeBinOp(Opcode)) {
1313 std::swap(N1CFP, N2CFP);
1319 // Canonicalize an UNDEF to the RHS, even over a constant.
1320 if (N1.getOpcode() == ISD::UNDEF) {
1321 if (isCommutativeBinOp(Opcode)) {
1325 case ISD::FP_ROUND_INREG:
1326 case ISD::SIGN_EXTEND_INREG:
1332 return N1; // fold op(undef, arg2) -> undef
1339 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1344 // Fold a bunch of operators when the RHS is undef.
1345 if (N2.getOpcode() == ISD::UNDEF) {
1361 return N2; // fold op(arg1, undef) -> undef
1366 return getConstant(0, VT); // fold op(arg1, undef) -> 0
1368 return getConstant(MVT::getIntVTBitMask(VT), VT);
1376 case ISD::TokenFactor:
1377 // Fold trivial token factors.
1378 if (N1.getOpcode() == ISD::EntryToken) return N2;
1379 if (N2.getOpcode() == ISD::EntryToken) return N1;
1383 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
1384 // worth handling here.
1385 if (N2C && N2C->getValue() == 0)
1390 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
1391 // worth handling here.
1392 if (N2C && N2C->getValue() == 0)
1395 case ISD::FP_ROUND_INREG:
1396 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
1398 case ISD::SIGN_EXTEND_INREG: {
1399 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1400 if (EVT == VT) return N1; // Not actually extending
1403 case ISD::EXTRACT_ELEMENT:
1404 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
1406 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
1407 // 64-bit integers into 32-bit parts. Instead of building the extract of
1408 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
1409 if (N1.getOpcode() == ISD::BUILD_PAIR)
1410 return N1.getOperand(N2C->getValue());
1412 // EXTRACT_ELEMENT of a constant int is also very common.
1413 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
1414 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
1415 return getConstant(C->getValue() >> Shift, VT);
1419 // FIXME: figure out how to safely handle things like
1420 // int foo(int x) { return 1 << (x & 255); }
1421 // int bar() { return foo(256); }
1426 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1427 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
1428 return getNode(Opcode, VT, N1, N2.getOperand(0));
1429 else if (N2.getOpcode() == ISD::AND)
1430 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
1431 // If the and is only masking out bits that cannot effect the shift,
1432 // eliminate the and.
1433 unsigned NumBits = MVT::getSizeInBits(VT);
1434 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1435 return getNode(Opcode, VT, N1, N2.getOperand(0));
1441 // Memoize this node if possible.
1443 SDVTList VTs = getVTList(VT);
1444 if (VT != MVT::Flag) {
1445 SDOperand Ops[] = { N1, N2 };
1446 FoldingSetNodeID ID;
1447 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
1449 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1450 return SDOperand(E, 0);
1451 N = new BinarySDNode(Opcode, VTs, N1, N2);
1452 CSEMap.InsertNode(N, IP);
1454 N = new BinarySDNode(Opcode, VTs, N1, N2);
1457 AllNodes.push_back(N);
1458 return SDOperand(N, 0);
1461 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1462 SDOperand N1, SDOperand N2, SDOperand N3) {
1463 // Perform various simplifications.
1464 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1465 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1468 // Use FoldSetCC to simplify SETCC's.
1469 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
1470 if (Simp.Val) return Simp;
1475 if (N1C->getValue())
1476 return N2; // select true, X, Y -> X
1478 return N3; // select false, X, Y -> Y
1480 if (N2 == N3) return N2; // select C, X, X -> X
1484 if (N2C->getValue()) // Unconditional branch
1485 return getNode(ISD::BR, MVT::Other, N1, N3);
1487 return N1; // Never-taken branch
1489 case ISD::VECTOR_SHUFFLE:
1490 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
1491 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
1492 N3.getOpcode() == ISD::BUILD_VECTOR &&
1493 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
1494 "Illegal VECTOR_SHUFFLE node!");
1496 case ISD::VBIT_CONVERT:
1497 // Fold vbit_convert nodes from a type to themselves.
1498 if (N1.getValueType() == MVT::Vector) {
1499 assert(isa<ConstantSDNode>(*(N1.Val->op_end()-2)) &&
1500 isa<VTSDNode>(*(N1.Val->op_end()-1)) && "Malformed vector input!");
1501 if (*(N1.Val->op_end()-2) == N2 && *(N1.Val->op_end()-1) == N3)
1507 // Memoize node if it doesn't produce a flag.
1509 SDVTList VTs = getVTList(VT);
1510 if (VT != MVT::Flag) {
1511 SDOperand Ops[] = { N1, N2, N3 };
1512 FoldingSetNodeID ID;
1513 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
1515 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1516 return SDOperand(E, 0);
1517 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
1518 CSEMap.InsertNode(N, IP);
1520 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
1522 AllNodes.push_back(N);
1523 return SDOperand(N, 0);
1526 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1527 SDOperand N1, SDOperand N2, SDOperand N3,
1529 SDOperand Ops[] = { N1, N2, N3, N4 };
1530 return getNode(Opcode, VT, Ops, 4);
1533 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1534 SDOperand N1, SDOperand N2, SDOperand N3,
1535 SDOperand N4, SDOperand N5) {
1536 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
1537 return getNode(Opcode, VT, Ops, 5);
1540 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
1541 SDOperand Chain, SDOperand Ptr,
1542 const Value *SV, int SVOffset,
1543 bool isVolatile, unsigned Alignment) {
1544 SDVTList VTs = getVTList(VT, MVT::Other);
1545 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1546 SDOperand Ops[] = { Chain, Ptr, Undef };
1547 FoldingSetNodeID ID;
1548 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
1549 ID.AddInteger(ISD::UNINDEXED);
1550 ID.AddInteger(ISD::NON_EXTLOAD);
1553 ID.AddInteger(SVOffset);
1554 ID.AddInteger(Alignment);
1555 ID.AddInteger(isVolatile);
1557 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1558 return SDOperand(E, 0);
1559 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
1560 const Type *Ty = MVT::getTypeForValueType(VT);
1561 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1563 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
1564 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
1566 CSEMap.InsertNode(N, IP);
1567 AllNodes.push_back(N);
1568 return SDOperand(N, 0);
1571 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
1572 SDOperand Chain, SDOperand Ptr,
1574 int SVOffset, MVT::ValueType EVT,
1575 bool isVolatile, unsigned Alignment) {
1576 // If they are asking for an extending load from/to the same thing, return a
1579 ExtType = ISD::NON_EXTLOAD;
1581 if (MVT::isVector(VT))
1582 assert(EVT == MVT::getVectorBaseType(VT) && "Invalid vector extload!");
1584 assert(EVT < VT && "Should only be an extending load, not truncating!");
1585 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
1586 "Cannot sign/zero extend a FP/Vector load!");
1587 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
1588 "Cannot convert from FP to Int or Int -> FP!");
1590 SDVTList VTs = getVTList(VT, MVT::Other);
1591 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1592 SDOperand Ops[] = { Chain, Ptr, Undef };
1593 FoldingSetNodeID ID;
1594 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
1595 ID.AddInteger(ISD::UNINDEXED);
1596 ID.AddInteger(ExtType);
1599 ID.AddInteger(SVOffset);
1600 ID.AddInteger(Alignment);
1601 ID.AddInteger(isVolatile);
1603 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1604 return SDOperand(E, 0);
1605 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
1606 const Type *Ty = MVT::getTypeForValueType(VT);
1607 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1609 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
1610 SV, SVOffset, Alignment, isVolatile);
1611 CSEMap.InsertNode(N, IP);
1612 AllNodes.push_back(N);
1613 return SDOperand(N, 0);
1617 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
1618 SDOperand Offset, ISD::MemIndexedMode AM) {
1619 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
1620 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
1621 "Load is already a indexed load!");
1622 MVT::ValueType VT = OrigLoad.getValueType();
1623 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
1624 SDOperand Ops[] = { LD->getChain(), Base, Offset };
1625 FoldingSetNodeID ID;
1626 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
1628 ID.AddInteger(LD->getExtensionType());
1629 ID.AddInteger(LD->getLoadedVT());
1630 ID.AddPointer(LD->getSrcValue());
1631 ID.AddInteger(LD->getSrcValueOffset());
1632 ID.AddInteger(LD->getAlignment());
1633 ID.AddInteger(LD->isVolatile());
1635 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1636 return SDOperand(E, 0);
1637 SDNode *N = new LoadSDNode(Ops, VTs, AM,
1638 LD->getExtensionType(), LD->getLoadedVT(),
1639 LD->getSrcValue(), LD->getSrcValueOffset(),
1640 LD->getAlignment(), LD->isVolatile());
1641 CSEMap.InsertNode(N, IP);
1642 AllNodes.push_back(N);
1643 return SDOperand(N, 0);
1646 SDOperand SelectionDAG::getVecLoad(unsigned Count, MVT::ValueType EVT,
1647 SDOperand Chain, SDOperand Ptr,
1649 SDOperand Ops[] = { Chain, Ptr, SV, getConstant(Count, MVT::i32),
1650 getValueType(EVT) };
1651 return getNode(ISD::VLOAD, getVTList(MVT::Vector, MVT::Other), Ops, 5);
1654 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
1655 SDOperand Ptr, const Value *SV, int SVOffset,
1656 bool isVolatile, unsigned Alignment) {
1657 MVT::ValueType VT = Val.getValueType();
1659 SDVTList VTs = getVTList(MVT::Other);
1660 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1661 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1662 FoldingSetNodeID ID;
1663 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1664 ID.AddInteger(ISD::UNINDEXED);
1665 ID.AddInteger(false);
1668 ID.AddInteger(SVOffset);
1669 ID.AddInteger(Alignment);
1670 ID.AddInteger(isVolatile);
1672 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1673 return SDOperand(E, 0);
1674 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
1675 const Type *Ty = MVT::getTypeForValueType(VT);
1676 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1678 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
1679 VT, SV, SVOffset, Alignment, isVolatile);
1680 CSEMap.InsertNode(N, IP);
1681 AllNodes.push_back(N);
1682 return SDOperand(N, 0);
1685 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
1686 SDOperand Ptr, const Value *SV,
1687 int SVOffset, MVT::ValueType SVT,
1688 bool isVolatile, unsigned Alignment) {
1689 MVT::ValueType VT = Val.getValueType();
1690 bool isTrunc = VT != SVT;
1692 assert(VT > SVT && "Not a truncation?");
1693 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
1694 "Can't do FP-INT conversion!");
1696 SDVTList VTs = getVTList(MVT::Other);
1697 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
1698 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
1699 FoldingSetNodeID ID;
1700 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1701 ID.AddInteger(ISD::UNINDEXED);
1702 ID.AddInteger(isTrunc);
1705 ID.AddInteger(SVOffset);
1706 ID.AddInteger(Alignment);
1707 ID.AddInteger(isVolatile);
1709 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1710 return SDOperand(E, 0);
1711 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
1712 const Type *Ty = MVT::getTypeForValueType(VT);
1713 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1715 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, isTrunc,
1716 SVT, SV, SVOffset, Alignment, isVolatile);
1717 CSEMap.InsertNode(N, IP);
1718 AllNodes.push_back(N);
1719 return SDOperand(N, 0);
1723 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
1724 SDOperand Offset, ISD::MemIndexedMode AM) {
1725 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
1726 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
1727 "Store is already a indexed store!");
1728 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
1729 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
1730 FoldingSetNodeID ID;
1731 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
1733 ID.AddInteger(ST->isTruncatingStore());
1734 ID.AddInteger(ST->getStoredVT());
1735 ID.AddPointer(ST->getSrcValue());
1736 ID.AddInteger(ST->getSrcValueOffset());
1737 ID.AddInteger(ST->getAlignment());
1738 ID.AddInteger(ST->isVolatile());
1740 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1741 return SDOperand(E, 0);
1742 SDNode *N = new StoreSDNode(Ops, VTs, AM,
1743 ST->isTruncatingStore(), ST->getStoredVT(),
1744 ST->getSrcValue(), ST->getSrcValueOffset(),
1745 ST->getAlignment(), ST->isVolatile());
1746 CSEMap.InsertNode(N, IP);
1747 AllNodes.push_back(N);
1748 return SDOperand(N, 0);
1751 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
1752 SDOperand Chain, SDOperand Ptr,
1754 SDOperand Ops[] = { Chain, Ptr, SV };
1755 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
1758 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1759 const SDOperand *Ops, unsigned NumOps) {
1761 case 0: return getNode(Opcode, VT);
1762 case 1: return getNode(Opcode, VT, Ops[0]);
1763 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
1764 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
1770 case ISD::SELECT_CC: {
1771 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
1772 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
1773 "LHS and RHS of condition must have same type!");
1774 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1775 "True and False arms of SelectCC must have same type!");
1776 assert(Ops[2].getValueType() == VT &&
1777 "select_cc node must be of same type as true and false value!");
1781 assert(NumOps == 5 && "BR_CC takes 5 operands!");
1782 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
1783 "LHS/RHS of comparison should match types!");
1790 SDVTList VTs = getVTList(VT);
1791 if (VT != MVT::Flag) {
1792 FoldingSetNodeID ID;
1793 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
1795 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1796 return SDOperand(E, 0);
1797 N = new SDNode(Opcode, VTs, Ops, NumOps);
1798 CSEMap.InsertNode(N, IP);
1800 N = new SDNode(Opcode, VTs, Ops, NumOps);
1802 AllNodes.push_back(N);
1803 return SDOperand(N, 0);
1806 SDOperand SelectionDAG::getNode(unsigned Opcode,
1807 std::vector<MVT::ValueType> &ResultTys,
1808 const SDOperand *Ops, unsigned NumOps) {
1809 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
1813 SDOperand SelectionDAG::getNode(unsigned Opcode,
1814 const MVT::ValueType *VTs, unsigned NumVTs,
1815 const SDOperand *Ops, unsigned NumOps) {
1817 return getNode(Opcode, VTs[0], Ops, NumOps);
1818 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
1821 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
1822 const SDOperand *Ops, unsigned NumOps) {
1823 if (VTList.NumVTs == 1)
1824 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
1827 // FIXME: figure out how to safely handle things like
1828 // int foo(int x) { return 1 << (x & 255); }
1829 // int bar() { return foo(256); }
1831 case ISD::SRA_PARTS:
1832 case ISD::SRL_PARTS:
1833 case ISD::SHL_PARTS:
1834 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
1835 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
1836 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1837 else if (N3.getOpcode() == ISD::AND)
1838 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
1839 // If the and is only masking out bits that cannot effect the shift,
1840 // eliminate the and.
1841 unsigned NumBits = MVT::getSizeInBits(VT)*2;
1842 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
1843 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
1849 // Memoize the node unless it returns a flag.
1851 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
1852 FoldingSetNodeID ID;
1853 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
1855 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1856 return SDOperand(E, 0);
1858 N = new UnarySDNode(Opcode, VTList, Ops[0]);
1859 else if (NumOps == 2)
1860 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
1861 else if (NumOps == 3)
1862 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
1864 N = new SDNode(Opcode, VTList, Ops, NumOps);
1865 CSEMap.InsertNode(N, IP);
1868 N = new UnarySDNode(Opcode, VTList, Ops[0]);
1869 else if (NumOps == 2)
1870 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
1871 else if (NumOps == 3)
1872 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
1874 N = new SDNode(Opcode, VTList, Ops, NumOps);
1876 AllNodes.push_back(N);
1877 return SDOperand(N, 0);
1880 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
1881 return makeVTList(SDNode::getValueTypeList(VT), 1);
1884 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
1885 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1886 E = VTList.end(); I != E; ++I) {
1887 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
1888 return makeVTList(&(*I)[0], 2);
1890 std::vector<MVT::ValueType> V;
1893 VTList.push_front(V);
1894 return makeVTList(&(*VTList.begin())[0], 2);
1896 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
1897 MVT::ValueType VT3) {
1898 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1899 E = VTList.end(); I != E; ++I) {
1900 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
1902 return makeVTList(&(*I)[0], 3);
1904 std::vector<MVT::ValueType> V;
1908 VTList.push_front(V);
1909 return makeVTList(&(*VTList.begin())[0], 3);
1912 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
1914 case 0: assert(0 && "Cannot have nodes without results!");
1915 case 1: return makeVTList(SDNode::getValueTypeList(VTs[0]), 1);
1916 case 2: return getVTList(VTs[0], VTs[1]);
1917 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
1921 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
1922 E = VTList.end(); I != E; ++I) {
1923 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
1925 bool NoMatch = false;
1926 for (unsigned i = 2; i != NumVTs; ++i)
1927 if (VTs[i] != (*I)[i]) {
1932 return makeVTList(&*I->begin(), NumVTs);
1935 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
1936 return makeVTList(&*VTList.begin()->begin(), NumVTs);
1940 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
1941 /// specified operands. If the resultant node already exists in the DAG,
1942 /// this does not modify the specified node, instead it returns the node that
1943 /// already exists. If the resultant node does not exist in the DAG, the
1944 /// input node is returned. As a degenerate case, if you specify the same
1945 /// input operands as the node already has, the input node is returned.
1946 SDOperand SelectionDAG::
1947 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
1948 SDNode *N = InN.Val;
1949 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
1951 // Check to see if there is no change.
1952 if (Op == N->getOperand(0)) return InN;
1954 // See if the modified node already exists.
1955 void *InsertPos = 0;
1956 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
1957 return SDOperand(Existing, InN.ResNo);
1959 // Nope it doesn't. Remove the node from it's current place in the maps.
1961 RemoveNodeFromCSEMaps(N);
1963 // Now we update the operands.
1964 N->OperandList[0].Val->removeUser(N);
1966 N->OperandList[0] = Op;
1968 // If this gets put into a CSE map, add it.
1969 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
1973 SDOperand SelectionDAG::
1974 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
1975 SDNode *N = InN.Val;
1976 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
1978 // Check to see if there is no change.
1979 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
1980 return InN; // No operands changed, just return the input node.
1982 // See if the modified node already exists.
1983 void *InsertPos = 0;
1984 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
1985 return SDOperand(Existing, InN.ResNo);
1987 // Nope it doesn't. Remove the node from it's current place in the maps.
1989 RemoveNodeFromCSEMaps(N);
1991 // Now we update the operands.
1992 if (N->OperandList[0] != Op1) {
1993 N->OperandList[0].Val->removeUser(N);
1994 Op1.Val->addUser(N);
1995 N->OperandList[0] = Op1;
1997 if (N->OperandList[1] != Op2) {
1998 N->OperandList[1].Val->removeUser(N);
1999 Op2.Val->addUser(N);
2000 N->OperandList[1] = Op2;
2003 // If this gets put into a CSE map, add it.
2004 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2008 SDOperand SelectionDAG::
2009 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2010 SDOperand Ops[] = { Op1, Op2, Op3 };
2011 return UpdateNodeOperands(N, Ops, 3);
2014 SDOperand SelectionDAG::
2015 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2016 SDOperand Op3, SDOperand Op4) {
2017 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
2018 return UpdateNodeOperands(N, Ops, 4);
2021 SDOperand SelectionDAG::
2022 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2023 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2024 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
2025 return UpdateNodeOperands(N, Ops, 5);
2029 SDOperand SelectionDAG::
2030 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
2031 SDNode *N = InN.Val;
2032 assert(N->getNumOperands() == NumOps &&
2033 "Update with wrong number of operands");
2035 // Check to see if there is no change.
2036 bool AnyChange = false;
2037 for (unsigned i = 0; i != NumOps; ++i) {
2038 if (Ops[i] != N->getOperand(i)) {
2044 // No operands changed, just return the input node.
2045 if (!AnyChange) return InN;
2047 // See if the modified node already exists.
2048 void *InsertPos = 0;
2049 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2050 return SDOperand(Existing, InN.ResNo);
2052 // Nope it doesn't. Remove the node from it's current place in the maps.
2054 RemoveNodeFromCSEMaps(N);
2056 // Now we update the operands.
2057 for (unsigned i = 0; i != NumOps; ++i) {
2058 if (N->OperandList[i] != Ops[i]) {
2059 N->OperandList[i].Val->removeUser(N);
2060 Ops[i].Val->addUser(N);
2061 N->OperandList[i] = Ops[i];
2065 // If this gets put into a CSE map, add it.
2066 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2071 /// MorphNodeTo - This frees the operands of the current node, resets the
2072 /// opcode, types, and operands to the specified value. This should only be
2073 /// used by the SelectionDAG class.
2074 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
2075 const SDOperand *Ops, unsigned NumOps) {
2078 NumValues = L.NumVTs;
2080 // Clear the operands list, updating used nodes to remove this from their
2082 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
2083 I->Val->removeUser(this);
2085 // If NumOps is larger than the # of operands we currently have, reallocate
2086 // the operand list.
2087 if (NumOps > NumOperands) {
2088 if (OperandsNeedDelete)
2089 delete [] OperandList;
2090 OperandList = new SDOperand[NumOps];
2091 OperandsNeedDelete = true;
2094 // Assign the new operands.
2095 NumOperands = NumOps;
2097 for (unsigned i = 0, e = NumOps; i != e; ++i) {
2098 OperandList[i] = Ops[i];
2099 SDNode *N = OperandList[i].Val;
2100 N->Uses.push_back(this);
2104 /// SelectNodeTo - These are used for target selectors to *mutate* the
2105 /// specified node to have the specified return type, Target opcode, and
2106 /// operands. Note that target opcodes are stored as
2107 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
2109 /// Note that SelectNodeTo returns the resultant node. If there is already a
2110 /// node of the specified opcode and operands, it returns that node instead of
2111 /// the current one.
2112 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2113 MVT::ValueType VT) {
2114 SDVTList VTs = getVTList(VT);
2115 FoldingSetNodeID ID;
2116 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2118 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2121 RemoveNodeFromCSEMaps(N);
2123 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2125 CSEMap.InsertNode(N, IP);
2129 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2130 MVT::ValueType VT, SDOperand Op1) {
2131 // If an identical node already exists, use it.
2132 SDVTList VTs = getVTList(VT);
2133 SDOperand Ops[] = { Op1 };
2135 FoldingSetNodeID ID;
2136 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2138 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2141 RemoveNodeFromCSEMaps(N);
2142 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2143 CSEMap.InsertNode(N, IP);
2147 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2148 MVT::ValueType VT, SDOperand Op1,
2150 // If an identical node already exists, use it.
2151 SDVTList VTs = getVTList(VT);
2152 SDOperand Ops[] = { Op1, Op2 };
2154 FoldingSetNodeID ID;
2155 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2157 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2160 RemoveNodeFromCSEMaps(N);
2162 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2164 CSEMap.InsertNode(N, IP); // Memoize the new node.
2168 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2169 MVT::ValueType VT, SDOperand Op1,
2170 SDOperand Op2, SDOperand Op3) {
2171 // If an identical node already exists, use it.
2172 SDVTList VTs = getVTList(VT);
2173 SDOperand Ops[] = { Op1, Op2, Op3 };
2174 FoldingSetNodeID ID;
2175 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2177 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2180 RemoveNodeFromCSEMaps(N);
2182 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2184 CSEMap.InsertNode(N, IP); // Memoize the new node.
2188 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2189 MVT::ValueType VT, const SDOperand *Ops,
2191 // If an identical node already exists, use it.
2192 SDVTList VTs = getVTList(VT);
2193 FoldingSetNodeID ID;
2194 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2196 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2199 RemoveNodeFromCSEMaps(N);
2200 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2202 CSEMap.InsertNode(N, IP); // Memoize the new node.
2206 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2207 MVT::ValueType VT1, MVT::ValueType VT2,
2208 SDOperand Op1, SDOperand Op2) {
2209 SDVTList VTs = getVTList(VT1, VT2);
2210 FoldingSetNodeID ID;
2211 SDOperand Ops[] = { Op1, Op2 };
2212 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2214 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2217 RemoveNodeFromCSEMaps(N);
2218 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2219 CSEMap.InsertNode(N, IP); // Memoize the new node.
2223 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2224 MVT::ValueType VT1, MVT::ValueType VT2,
2225 SDOperand Op1, SDOperand Op2,
2227 // If an identical node already exists, use it.
2228 SDVTList VTs = getVTList(VT1, VT2);
2229 SDOperand Ops[] = { Op1, Op2, Op3 };
2230 FoldingSetNodeID ID;
2231 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2233 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2236 RemoveNodeFromCSEMaps(N);
2238 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2239 CSEMap.InsertNode(N, IP); // Memoize the new node.
2244 /// getTargetNode - These are used for target selectors to create a new node
2245 /// with specified return type(s), target opcode, and operands.
2247 /// Note that getTargetNode returns the resultant node. If there is already a
2248 /// node of the specified opcode and operands, it returns that node instead of
2249 /// the current one.
2250 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2251 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2253 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2255 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2257 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2258 SDOperand Op1, SDOperand Op2) {
2259 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2261 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2262 SDOperand Op1, SDOperand Op2,
2264 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2266 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2267 const SDOperand *Ops, unsigned NumOps) {
2268 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
2270 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2271 MVT::ValueType VT2, SDOperand Op1) {
2272 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2273 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
2275 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2276 MVT::ValueType VT2, SDOperand Op1,
2278 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2279 SDOperand Ops[] = { Op1, Op2 };
2280 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
2282 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2283 MVT::ValueType VT2, SDOperand Op1,
2284 SDOperand Op2, SDOperand Op3) {
2285 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2286 SDOperand Ops[] = { Op1, Op2, Op3 };
2287 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
2289 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2291 const SDOperand *Ops, unsigned NumOps) {
2292 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
2293 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
2295 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2296 MVT::ValueType VT2, MVT::ValueType VT3,
2297 SDOperand Op1, SDOperand Op2) {
2298 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2299 SDOperand Ops[] = { Op1, Op2 };
2300 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
2302 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2303 MVT::ValueType VT2, MVT::ValueType VT3,
2304 SDOperand Op1, SDOperand Op2,
2306 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2307 SDOperand Ops[] = { Op1, Op2, Op3 };
2308 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
2310 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
2311 MVT::ValueType VT2, MVT::ValueType VT3,
2312 const SDOperand *Ops, unsigned NumOps) {
2313 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
2314 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
2317 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2318 /// This can cause recursive merging of nodes in the DAG.
2320 /// This version assumes From/To have a single result value.
2322 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
2323 std::vector<SDNode*> *Deleted) {
2324 SDNode *From = FromN.Val, *To = ToN.Val;
2325 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
2326 "Cannot replace with this method!");
2327 assert(From != To && "Cannot replace uses of with self");
2329 while (!From->use_empty()) {
2330 // Process users until they are all gone.
2331 SDNode *U = *From->use_begin();
2333 // This node is about to morph, remove its old self from the CSE maps.
2334 RemoveNodeFromCSEMaps(U);
2336 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2338 if (I->Val == From) {
2339 From->removeUser(U);
2344 // Now that we have modified U, add it back to the CSE maps. If it already
2345 // exists there, recursively merge the results together.
2346 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2347 ReplaceAllUsesWith(U, Existing, Deleted);
2349 if (Deleted) Deleted->push_back(U);
2350 DeleteNodeNotInCSEMaps(U);
2355 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2356 /// This can cause recursive merging of nodes in the DAG.
2358 /// This version assumes From/To have matching types and numbers of result
2361 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
2362 std::vector<SDNode*> *Deleted) {
2363 assert(From != To && "Cannot replace uses of with self");
2364 assert(From->getNumValues() == To->getNumValues() &&
2365 "Cannot use this version of ReplaceAllUsesWith!");
2366 if (From->getNumValues() == 1) { // If possible, use the faster version.
2367 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(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 From->removeUser(U);
2386 // Now that we have modified U, add it back to the CSE maps. If it already
2387 // exists there, recursively merge the results together.
2388 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2389 ReplaceAllUsesWith(U, Existing, Deleted);
2391 if (Deleted) Deleted->push_back(U);
2392 DeleteNodeNotInCSEMaps(U);
2397 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
2398 /// This can cause recursive merging of nodes in the DAG.
2400 /// This version can replace From with any result values. To must match the
2401 /// number and types of values returned by From.
2402 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
2403 const SDOperand *To,
2404 std::vector<SDNode*> *Deleted) {
2405 if (From->getNumValues() == 1 && To[0].Val->getNumValues() == 1) {
2406 // Degenerate case handled above.
2407 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
2411 while (!From->use_empty()) {
2412 // Process users until they are all gone.
2413 SDNode *U = *From->use_begin();
2415 // This node is about to morph, remove its old self from the CSE maps.
2416 RemoveNodeFromCSEMaps(U);
2418 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
2420 if (I->Val == From) {
2421 const SDOperand &ToOp = To[I->ResNo];
2422 From->removeUser(U);
2424 ToOp.Val->addUser(U);
2427 // Now that we have modified U, add it back to the CSE maps. If it already
2428 // exists there, recursively merge the results together.
2429 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
2430 ReplaceAllUsesWith(U, Existing, Deleted);
2432 if (Deleted) Deleted->push_back(U);
2433 DeleteNodeNotInCSEMaps(U);
2438 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
2439 /// uses of other values produced by From.Val alone. The Deleted vector is
2440 /// handled the same was as for ReplaceAllUsesWith.
2441 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
2442 std::vector<SDNode*> &Deleted) {
2443 assert(From != To && "Cannot replace a value with itself");
2444 // Handle the simple, trivial, case efficiently.
2445 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
2446 ReplaceAllUsesWith(From, To, &Deleted);
2450 // Get all of the users of From.Val. We want these in a nice,
2451 // deterministically ordered and uniqued set, so we use a SmallSetVector.
2452 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
2454 while (!Users.empty()) {
2455 // We know that this user uses some value of From. If it is the right
2456 // value, update it.
2457 SDNode *User = Users.back();
2460 for (SDOperand *Op = User->OperandList,
2461 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
2463 // Okay, we know this user needs to be updated. Remove its old self
2464 // from the CSE maps.
2465 RemoveNodeFromCSEMaps(User);
2467 // Update all operands that match "From".
2468 for (; Op != E; ++Op) {
2470 From.Val->removeUser(User);
2472 To.Val->addUser(User);
2476 // Now that we have modified User, add it back to the CSE maps. If it
2477 // already exists there, recursively merge the results together.
2478 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
2479 unsigned NumDeleted = Deleted.size();
2480 ReplaceAllUsesWith(User, Existing, &Deleted);
2482 // User is now dead.
2483 Deleted.push_back(User);
2484 DeleteNodeNotInCSEMaps(User);
2486 // We have to be careful here, because ReplaceAllUsesWith could have
2487 // deleted a user of From, which means there may be dangling pointers
2488 // in the "Users" setvector. Scan over the deleted node pointers and
2489 // remove them from the setvector.
2490 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
2491 Users.remove(Deleted[i]);
2493 break; // Exit the operand scanning loop.
2500 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
2501 /// their allnodes order. It returns the maximum id.
2502 unsigned SelectionDAG::AssignNodeIds() {
2504 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
2511 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
2512 /// based on their topological order. It returns the maximum id and a vector
2513 /// of the SDNodes* in assigned order by reference.
2514 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
2515 unsigned DAGSize = AllNodes.size();
2516 std::vector<unsigned> InDegree(DAGSize);
2517 std::vector<SDNode*> Sources;
2519 // Use a two pass approach to avoid using a std::map which is slow.
2521 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
2524 unsigned Degree = N->use_size();
2525 InDegree[N->getNodeId()] = Degree;
2527 Sources.push_back(N);
2531 while (!Sources.empty()) {
2532 SDNode *N = Sources.back();
2534 TopOrder.push_back(N);
2535 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
2537 unsigned Degree = --InDegree[P->getNodeId()];
2539 Sources.push_back(P);
2543 // Second pass, assign the actual topological order as node ids.
2545 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
2547 (*TI)->setNodeId(Id++);
2554 //===----------------------------------------------------------------------===//
2556 //===----------------------------------------------------------------------===//
2558 // Out-of-line virtual method to give class a home.
2559 void SDNode::ANCHOR() {}
2560 void UnarySDNode::ANCHOR() {}
2561 void BinarySDNode::ANCHOR() {}
2562 void TernarySDNode::ANCHOR() {}
2563 void HandleSDNode::ANCHOR() {}
2564 void StringSDNode::ANCHOR() {}
2565 void ConstantSDNode::ANCHOR() {}
2566 void ConstantFPSDNode::ANCHOR() {}
2567 void GlobalAddressSDNode::ANCHOR() {}
2568 void FrameIndexSDNode::ANCHOR() {}
2569 void JumpTableSDNode::ANCHOR() {}
2570 void ConstantPoolSDNode::ANCHOR() {}
2571 void BasicBlockSDNode::ANCHOR() {}
2572 void SrcValueSDNode::ANCHOR() {}
2573 void RegisterSDNode::ANCHOR() {}
2574 void ExternalSymbolSDNode::ANCHOR() {}
2575 void CondCodeSDNode::ANCHOR() {}
2576 void VTSDNode::ANCHOR() {}
2577 void LoadSDNode::ANCHOR() {}
2578 void StoreSDNode::ANCHOR() {}
2580 HandleSDNode::~HandleSDNode() {
2581 SDVTList VTs = { 0, 0 };
2582 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
2586 /// Profile - Gather unique data for the node.
2588 void SDNode::Profile(FoldingSetNodeID &ID) {
2589 AddNodeIDNode(ID, this);
2592 /// getValueTypeList - Return a pointer to the specified value type.
2594 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
2595 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
2600 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
2601 /// indicated value. This method ignores uses of other values defined by this
2603 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
2604 assert(Value < getNumValues() && "Bad value!");
2606 // If there is only one value, this is easy.
2607 if (getNumValues() == 1)
2608 return use_size() == NUses;
2609 if (Uses.size() < NUses) return false;
2611 SDOperand TheValue(const_cast<SDNode *>(this), Value);
2613 SmallPtrSet<SDNode*, 32> UsersHandled;
2615 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
2617 if (User->getNumOperands() == 1 ||
2618 UsersHandled.insert(User)) // First time we've seen this?
2619 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
2620 if (User->getOperand(i) == TheValue) {
2622 return false; // too many uses
2627 // Found exactly the right number of uses?
2632 /// isOnlyUse - Return true if this node is the only use of N.
2634 bool SDNode::isOnlyUse(SDNode *N) const {
2636 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
2647 /// isOperand - Return true if this node is an operand of N.
2649 bool SDOperand::isOperand(SDNode *N) const {
2650 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
2651 if (*this == N->getOperand(i))
2656 bool SDNode::isOperand(SDNode *N) const {
2657 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
2658 if (this == N->OperandList[i].Val)
2663 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
2664 SmallPtrSet<SDNode *, 32> &Visited) {
2665 if (found || !Visited.insert(N))
2668 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
2669 SDNode *Op = N->getOperand(i).Val;
2674 findPredecessor(Op, P, found, Visited);
2678 /// isPredecessor - Return true if this node is a predecessor of N. This node
2679 /// is either an operand of N or it can be reached by recursively traversing
2680 /// up the operands.
2681 /// NOTE: this is an expensive method. Use it carefully.
2682 bool SDNode::isPredecessor(SDNode *N) const {
2683 SmallPtrSet<SDNode *, 32> Visited;
2685 findPredecessor(N, this, found, Visited);
2689 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
2690 assert(Num < NumOperands && "Invalid child # of SDNode!");
2691 return cast<ConstantSDNode>(OperandList[Num])->getValue();
2694 std::string SDNode::getOperationName(const SelectionDAG *G) const {
2695 switch (getOpcode()) {
2697 if (getOpcode() < ISD::BUILTIN_OP_END)
2698 return "<<Unknown DAG Node>>";
2701 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
2702 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
2703 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
2705 TargetLowering &TLI = G->getTargetLoweringInfo();
2707 TLI.getTargetNodeName(getOpcode());
2708 if (Name) return Name;
2711 return "<<Unknown Target Node>>";
2714 case ISD::PCMARKER: return "PCMarker";
2715 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
2716 case ISD::SRCVALUE: return "SrcValue";
2717 case ISD::EntryToken: return "EntryToken";
2718 case ISD::TokenFactor: return "TokenFactor";
2719 case ISD::AssertSext: return "AssertSext";
2720 case ISD::AssertZext: return "AssertZext";
2722 case ISD::STRING: return "String";
2723 case ISD::BasicBlock: return "BasicBlock";
2724 case ISD::VALUETYPE: return "ValueType";
2725 case ISD::Register: return "Register";
2727 case ISD::Constant: return "Constant";
2728 case ISD::ConstantFP: return "ConstantFP";
2729 case ISD::GlobalAddress: return "GlobalAddress";
2730 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
2731 case ISD::FrameIndex: return "FrameIndex";
2732 case ISD::JumpTable: return "JumpTable";
2733 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
2734 case ISD::RETURNADDR: return "RETURNADDR";
2735 case ISD::FRAMEADDR: return "FRAMEADDR";
2736 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
2737 case ISD::EHSELECTION: return "EHSELECTION";
2738 case ISD::ConstantPool: return "ConstantPool";
2739 case ISD::ExternalSymbol: return "ExternalSymbol";
2740 case ISD::INTRINSIC_WO_CHAIN: {
2741 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
2742 return Intrinsic::getName((Intrinsic::ID)IID);
2744 case ISD::INTRINSIC_VOID:
2745 case ISD::INTRINSIC_W_CHAIN: {
2746 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
2747 return Intrinsic::getName((Intrinsic::ID)IID);
2750 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
2751 case ISD::TargetConstant: return "TargetConstant";
2752 case ISD::TargetConstantFP:return "TargetConstantFP";
2753 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
2754 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
2755 case ISD::TargetFrameIndex: return "TargetFrameIndex";
2756 case ISD::TargetJumpTable: return "TargetJumpTable";
2757 case ISD::TargetConstantPool: return "TargetConstantPool";
2758 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
2760 case ISD::CopyToReg: return "CopyToReg";
2761 case ISD::CopyFromReg: return "CopyFromReg";
2762 case ISD::UNDEF: return "undef";
2763 case ISD::MERGE_VALUES: return "mergevalues";
2764 case ISD::INLINEASM: return "inlineasm";
2765 case ISD::LABEL: return "label";
2766 case ISD::HANDLENODE: return "handlenode";
2767 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
2768 case ISD::CALL: return "call";
2771 case ISD::FABS: return "fabs";
2772 case ISD::FNEG: return "fneg";
2773 case ISD::FSQRT: return "fsqrt";
2774 case ISD::FSIN: return "fsin";
2775 case ISD::FCOS: return "fcos";
2776 case ISD::FPOWI: return "fpowi";
2779 case ISD::ADD: return "add";
2780 case ISD::SUB: return "sub";
2781 case ISD::MUL: return "mul";
2782 case ISD::MULHU: return "mulhu";
2783 case ISD::MULHS: return "mulhs";
2784 case ISD::SDIV: return "sdiv";
2785 case ISD::UDIV: return "udiv";
2786 case ISD::SREM: return "srem";
2787 case ISD::UREM: return "urem";
2788 case ISD::AND: return "and";
2789 case ISD::OR: return "or";
2790 case ISD::XOR: return "xor";
2791 case ISD::SHL: return "shl";
2792 case ISD::SRA: return "sra";
2793 case ISD::SRL: return "srl";
2794 case ISD::ROTL: return "rotl";
2795 case ISD::ROTR: return "rotr";
2796 case ISD::FADD: return "fadd";
2797 case ISD::FSUB: return "fsub";
2798 case ISD::FMUL: return "fmul";
2799 case ISD::FDIV: return "fdiv";
2800 case ISD::FREM: return "frem";
2801 case ISD::FCOPYSIGN: return "fcopysign";
2802 case ISD::VADD: return "vadd";
2803 case ISD::VSUB: return "vsub";
2804 case ISD::VMUL: return "vmul";
2805 case ISD::VSDIV: return "vsdiv";
2806 case ISD::VUDIV: return "vudiv";
2807 case ISD::VAND: return "vand";
2808 case ISD::VOR: return "vor";
2809 case ISD::VXOR: return "vxor";
2811 case ISD::SETCC: return "setcc";
2812 case ISD::SELECT: return "select";
2813 case ISD::SELECT_CC: return "select_cc";
2814 case ISD::VSELECT: return "vselect";
2815 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
2816 case ISD::VINSERT_VECTOR_ELT: return "vinsert_vector_elt";
2817 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
2818 case ISD::VEXTRACT_VECTOR_ELT: return "vextract_vector_elt";
2819 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
2820 case ISD::VBUILD_VECTOR: return "vbuild_vector";
2821 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
2822 case ISD::VVECTOR_SHUFFLE: return "vvector_shuffle";
2823 case ISD::VBIT_CONVERT: return "vbit_convert";
2824 case ISD::CARRY_FALSE: return "carry_false";
2825 case ISD::ADDC: return "addc";
2826 case ISD::ADDE: return "adde";
2827 case ISD::SUBC: return "subc";
2828 case ISD::SUBE: return "sube";
2829 case ISD::SHL_PARTS: return "shl_parts";
2830 case ISD::SRA_PARTS: return "sra_parts";
2831 case ISD::SRL_PARTS: return "srl_parts";
2833 // Conversion operators.
2834 case ISD::SIGN_EXTEND: return "sign_extend";
2835 case ISD::ZERO_EXTEND: return "zero_extend";
2836 case ISD::ANY_EXTEND: return "any_extend";
2837 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
2838 case ISD::TRUNCATE: return "truncate";
2839 case ISD::FP_ROUND: return "fp_round";
2840 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
2841 case ISD::FP_EXTEND: return "fp_extend";
2843 case ISD::SINT_TO_FP: return "sint_to_fp";
2844 case ISD::UINT_TO_FP: return "uint_to_fp";
2845 case ISD::FP_TO_SINT: return "fp_to_sint";
2846 case ISD::FP_TO_UINT: return "fp_to_uint";
2847 case ISD::BIT_CONVERT: return "bit_convert";
2849 // Control flow instructions
2850 case ISD::BR: return "br";
2851 case ISD::BRIND: return "brind";
2852 case ISD::BR_JT: return "br_jt";
2853 case ISD::BRCOND: return "brcond";
2854 case ISD::BR_CC: return "br_cc";
2855 case ISD::RET: return "ret";
2856 case ISD::CALLSEQ_START: return "callseq_start";
2857 case ISD::CALLSEQ_END: return "callseq_end";
2860 case ISD::LOAD: return "load";
2861 case ISD::STORE: return "store";
2862 case ISD::VLOAD: return "vload";
2863 case ISD::VAARG: return "vaarg";
2864 case ISD::VACOPY: return "vacopy";
2865 case ISD::VAEND: return "vaend";
2866 case ISD::VASTART: return "vastart";
2867 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
2868 case ISD::EXTRACT_ELEMENT: return "extract_element";
2869 case ISD::BUILD_PAIR: return "build_pair";
2870 case ISD::STACKSAVE: return "stacksave";
2871 case ISD::STACKRESTORE: return "stackrestore";
2873 // Block memory operations.
2874 case ISD::MEMSET: return "memset";
2875 case ISD::MEMCPY: return "memcpy";
2876 case ISD::MEMMOVE: return "memmove";
2879 case ISD::BSWAP: return "bswap";
2880 case ISD::CTPOP: return "ctpop";
2881 case ISD::CTTZ: return "cttz";
2882 case ISD::CTLZ: return "ctlz";
2885 case ISD::LOCATION: return "location";
2886 case ISD::DEBUG_LOC: return "debug_loc";
2889 switch (cast<CondCodeSDNode>(this)->get()) {
2890 default: assert(0 && "Unknown setcc condition!");
2891 case ISD::SETOEQ: return "setoeq";
2892 case ISD::SETOGT: return "setogt";
2893 case ISD::SETOGE: return "setoge";
2894 case ISD::SETOLT: return "setolt";
2895 case ISD::SETOLE: return "setole";
2896 case ISD::SETONE: return "setone";
2898 case ISD::SETO: return "seto";
2899 case ISD::SETUO: return "setuo";
2900 case ISD::SETUEQ: return "setue";
2901 case ISD::SETUGT: return "setugt";
2902 case ISD::SETUGE: return "setuge";
2903 case ISD::SETULT: return "setult";
2904 case ISD::SETULE: return "setule";
2905 case ISD::SETUNE: return "setune";
2907 case ISD::SETEQ: return "seteq";
2908 case ISD::SETGT: return "setgt";
2909 case ISD::SETGE: return "setge";
2910 case ISD::SETLT: return "setlt";
2911 case ISD::SETLE: return "setle";
2912 case ISD::SETNE: return "setne";
2917 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
2926 return "<post-inc>";
2928 return "<post-dec>";
2932 void SDNode::dump() const { dump(0); }
2933 void SDNode::dump(const SelectionDAG *G) const {
2934 cerr << (void*)this << ": ";
2936 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
2938 if (getValueType(i) == MVT::Other)
2941 cerr << MVT::getValueTypeString(getValueType(i));
2943 cerr << " = " << getOperationName(G);
2946 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
2947 if (i) cerr << ", ";
2948 cerr << (void*)getOperand(i).Val;
2949 if (unsigned RN = getOperand(i).ResNo)
2953 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
2954 cerr << "<" << CSDN->getValue() << ">";
2955 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
2956 cerr << "<" << CSDN->getValue() << ">";
2957 } else if (const GlobalAddressSDNode *GADN =
2958 dyn_cast<GlobalAddressSDNode>(this)) {
2959 int offset = GADN->getOffset();
2961 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
2963 cerr << " + " << offset;
2965 cerr << " " << offset;
2966 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
2967 cerr << "<" << FIDN->getIndex() << ">";
2968 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
2969 cerr << "<" << JTDN->getIndex() << ">";
2970 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
2971 int offset = CP->getOffset();
2972 if (CP->isMachineConstantPoolEntry())
2973 cerr << "<" << *CP->getMachineCPVal() << ">";
2975 cerr << "<" << *CP->getConstVal() << ">";
2977 cerr << " + " << offset;
2979 cerr << " " << offset;
2980 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
2982 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
2984 cerr << LBB->getName() << " ";
2985 cerr << (const void*)BBDN->getBasicBlock() << ">";
2986 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
2987 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
2988 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
2990 cerr << " #" << R->getReg();
2992 } else if (const ExternalSymbolSDNode *ES =
2993 dyn_cast<ExternalSymbolSDNode>(this)) {
2994 cerr << "'" << ES->getSymbol() << "'";
2995 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
2997 cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
2999 cerr << "<null:" << M->getOffset() << ">";
3000 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
3001 cerr << ":" << getValueTypeString(N->getVT());
3002 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
3004 switch (LD->getExtensionType()) {
3005 default: doExt = false; break;
3007 cerr << " <anyext ";
3017 cerr << MVT::getValueTypeString(LD->getLoadedVT()) << ">";
3019 const char *AM = getIndexedModeName(LD->getAddressingMode());
3022 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
3023 if (ST->isTruncatingStore())
3025 << MVT::getValueTypeString(ST->getStoredVT()) << ">";
3027 const char *AM = getIndexedModeName(ST->getAddressingMode());
3033 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
3034 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3035 if (N->getOperand(i).Val->hasOneUse())
3036 DumpNodes(N->getOperand(i).Val, indent+2, G);
3038 cerr << "\n" << std::string(indent+2, ' ')
3039 << (void*)N->getOperand(i).Val << ": <multiple use>";
3042 cerr << "\n" << std::string(indent, ' ');
3046 void SelectionDAG::dump() const {
3047 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
3048 std::vector<const SDNode*> Nodes;
3049 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
3053 std::sort(Nodes.begin(), Nodes.end());
3055 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
3056 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
3057 DumpNodes(Nodes[i], 2, this);
3060 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
3065 const Type *ConstantPoolSDNode::getType() const {
3066 if (isMachineConstantPoolEntry())
3067 return Val.MachineCPVal->getType();
3068 return Val.ConstVal->getType();