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/GlobalVariable.h"
17 #include "llvm/Intrinsics.h"
18 #include "llvm/DerivedTypes.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/MRegisterInfo.h"
24 #include "llvm/Target/TargetData.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(const APFloat& V) const {
52 return Value.bitwiseIsEqual(V);
55 bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT,
57 // convert modifies in place, so make a copy.
58 APFloat Val2 = APFloat(Val);
61 return false; // These can't be represented as floating point!
63 // FIXME rounding mode needs to be more flexible
65 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
66 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
69 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
70 &Val2.getSemantics() == &APFloat::IEEEdouble ||
71 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
73 // TODO: Figure out how to test if we can use a shorter type instead!
81 //===----------------------------------------------------------------------===//
83 //===----------------------------------------------------------------------===//
85 /// isBuildVectorAllOnes - Return true if the specified node is a
86 /// BUILD_VECTOR where all of the elements are ~0 or undef.
87 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
88 // Look through a bit convert.
89 if (N->getOpcode() == ISD::BIT_CONVERT)
90 N = N->getOperand(0).Val;
92 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
94 unsigned i = 0, e = N->getNumOperands();
96 // Skip over all of the undef values.
97 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
100 // Do not accept an all-undef vector.
101 if (i == e) return false;
103 // Do not accept build_vectors that aren't all constants or which have non-~0
105 SDOperand NotZero = N->getOperand(i);
106 if (isa<ConstantSDNode>(NotZero)) {
107 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
109 } else if (isa<ConstantFPSDNode>(NotZero)) {
110 MVT::ValueType VT = NotZero.getValueType();
112 if (((cast<ConstantFPSDNode>(NotZero)->getValueAPF().
113 convertToAPInt().getZExtValue())) != (uint64_t)-1)
116 if ((uint32_t)cast<ConstantFPSDNode>(NotZero)->
117 getValueAPF().convertToAPInt().getZExtValue() !=
124 // Okay, we have at least one ~0 value, check to see if the rest match or are
126 for (++i; i != e; ++i)
127 if (N->getOperand(i) != NotZero &&
128 N->getOperand(i).getOpcode() != ISD::UNDEF)
134 /// isBuildVectorAllZeros - Return true if the specified node is a
135 /// BUILD_VECTOR where all of the elements are 0 or undef.
136 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
137 // Look through a bit convert.
138 if (N->getOpcode() == ISD::BIT_CONVERT)
139 N = N->getOperand(0).Val;
141 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
143 unsigned i = 0, e = N->getNumOperands();
145 // Skip over all of the undef values.
146 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
149 // Do not accept an all-undef vector.
150 if (i == e) return false;
152 // Do not accept build_vectors that aren't all constants or which have non-~0
154 SDOperand Zero = N->getOperand(i);
155 if (isa<ConstantSDNode>(Zero)) {
156 if (!cast<ConstantSDNode>(Zero)->isNullValue())
158 } else if (isa<ConstantFPSDNode>(Zero)) {
159 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
164 // Okay, we have at least one ~0 value, check to see if the rest match or are
166 for (++i; i != e; ++i)
167 if (N->getOperand(i) != Zero &&
168 N->getOperand(i).getOpcode() != ISD::UNDEF)
173 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
174 /// when given the operation for (X op Y).
175 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
176 // To perform this operation, we just need to swap the L and G bits of the
178 unsigned OldL = (Operation >> 2) & 1;
179 unsigned OldG = (Operation >> 1) & 1;
180 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
181 (OldL << 1) | // New G bit
182 (OldG << 2)); // New L bit.
185 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
186 /// 'op' is a valid SetCC operation.
187 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
188 unsigned Operation = Op;
190 Operation ^= 7; // Flip L, G, E bits, but not U.
192 Operation ^= 15; // Flip all of the condition bits.
193 if (Operation > ISD::SETTRUE2)
194 Operation &= ~8; // Don't let N and U bits get set.
195 return ISD::CondCode(Operation);
199 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
200 /// signed operation and 2 if the result is an unsigned comparison. Return zero
201 /// if the operation does not depend on the sign of the input (setne and seteq).
202 static int isSignedOp(ISD::CondCode Opcode) {
204 default: assert(0 && "Illegal integer setcc operation!");
206 case ISD::SETNE: return 0;
210 case ISD::SETGE: return 1;
214 case ISD::SETUGE: return 2;
218 /// getSetCCOrOperation - Return the result of a logical OR between different
219 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
220 /// returns SETCC_INVALID if it is not possible to represent the resultant
222 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
224 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
225 // Cannot fold a signed integer setcc with an unsigned integer setcc.
226 return ISD::SETCC_INVALID;
228 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
230 // If the N and U bits get set then the resultant comparison DOES suddenly
231 // care about orderedness, and is true when ordered.
232 if (Op > ISD::SETTRUE2)
233 Op &= ~16; // Clear the U bit if the N bit is set.
235 // Canonicalize illegal integer setcc's.
236 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
239 return ISD::CondCode(Op);
242 /// getSetCCAndOperation - Return the result of a logical AND between different
243 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
244 /// function returns zero if it is not possible to represent the resultant
246 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
248 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
249 // Cannot fold a signed setcc with an unsigned setcc.
250 return ISD::SETCC_INVALID;
252 // Combine all of the condition bits.
253 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
255 // Canonicalize illegal integer setcc's.
259 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
260 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
261 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
262 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
269 const TargetMachine &SelectionDAG::getTarget() const {
270 return TLI.getTargetMachine();
273 //===----------------------------------------------------------------------===//
274 // SDNode Profile Support
275 //===----------------------------------------------------------------------===//
277 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
279 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
283 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
284 /// solely with their pointer.
285 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
286 ID.AddPointer(VTList.VTs);
289 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
291 static void AddNodeIDOperands(FoldingSetNodeID &ID,
292 const SDOperand *Ops, unsigned NumOps) {
293 for (; NumOps; --NumOps, ++Ops) {
294 ID.AddPointer(Ops->Val);
295 ID.AddInteger(Ops->ResNo);
299 static void AddNodeIDNode(FoldingSetNodeID &ID,
300 unsigned short OpC, SDVTList VTList,
301 const SDOperand *OpList, unsigned N) {
302 AddNodeIDOpcode(ID, OpC);
303 AddNodeIDValueTypes(ID, VTList);
304 AddNodeIDOperands(ID, OpList, N);
307 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
309 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
310 AddNodeIDOpcode(ID, N->getOpcode());
311 // Add the return value info.
312 AddNodeIDValueTypes(ID, N->getVTList());
313 // Add the operand info.
314 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
316 // Handle SDNode leafs with special info.
317 switch (N->getOpcode()) {
318 default: break; // Normal nodes don't need extra info.
319 case ISD::TargetConstant:
321 ID.AddInteger(cast<ConstantSDNode>(N)->getValue());
323 case ISD::TargetConstantFP:
324 case ISD::ConstantFP: {
325 ID.AddAPFloat(cast<ConstantFPSDNode>(N)->getValueAPF());
328 case ISD::TargetGlobalAddress:
329 case ISD::GlobalAddress:
330 case ISD::TargetGlobalTLSAddress:
331 case ISD::GlobalTLSAddress: {
332 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
333 ID.AddPointer(GA->getGlobal());
334 ID.AddInteger(GA->getOffset());
337 case ISD::BasicBlock:
338 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
341 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
343 case ISD::SRCVALUE: {
344 SrcValueSDNode *SV = cast<SrcValueSDNode>(N);
345 ID.AddPointer(SV->getValue());
346 ID.AddInteger(SV->getOffset());
349 case ISD::FrameIndex:
350 case ISD::TargetFrameIndex:
351 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
354 case ISD::TargetJumpTable:
355 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
357 case ISD::ConstantPool:
358 case ISD::TargetConstantPool: {
359 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
360 ID.AddInteger(CP->getAlignment());
361 ID.AddInteger(CP->getOffset());
362 if (CP->isMachineConstantPoolEntry())
363 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
365 ID.AddPointer(CP->getConstVal());
369 LoadSDNode *LD = cast<LoadSDNode>(N);
370 ID.AddInteger(LD->getAddressingMode());
371 ID.AddInteger(LD->getExtensionType());
372 ID.AddInteger((unsigned int)(LD->getLoadedVT()));
373 ID.AddPointer(LD->getSrcValue());
374 ID.AddInteger(LD->getSrcValueOffset());
375 ID.AddInteger(LD->getAlignment());
376 ID.AddInteger(LD->isVolatile());
380 StoreSDNode *ST = cast<StoreSDNode>(N);
381 ID.AddInteger(ST->getAddressingMode());
382 ID.AddInteger(ST->isTruncatingStore());
383 ID.AddInteger((unsigned int)(ST->getStoredVT()));
384 ID.AddPointer(ST->getSrcValue());
385 ID.AddInteger(ST->getSrcValueOffset());
386 ID.AddInteger(ST->getAlignment());
387 ID.AddInteger(ST->isVolatile());
393 //===----------------------------------------------------------------------===//
394 // SelectionDAG Class
395 //===----------------------------------------------------------------------===//
397 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
399 void SelectionDAG::RemoveDeadNodes() {
400 // Create a dummy node (which is not added to allnodes), that adds a reference
401 // to the root node, preventing it from being deleted.
402 HandleSDNode Dummy(getRoot());
404 SmallVector<SDNode*, 128> DeadNodes;
406 // Add all obviously-dead nodes to the DeadNodes worklist.
407 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
409 DeadNodes.push_back(I);
411 // Process the worklist, deleting the nodes and adding their uses to the
413 while (!DeadNodes.empty()) {
414 SDNode *N = DeadNodes.back();
415 DeadNodes.pop_back();
417 // Take the node out of the appropriate CSE map.
418 RemoveNodeFromCSEMaps(N);
420 // Next, brutally remove the operand list. This is safe to do, as there are
421 // no cycles in the graph.
422 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
423 SDNode *Operand = I->Val;
424 Operand->removeUser(N);
426 // Now that we removed this operand, see if there are no uses of it left.
427 if (Operand->use_empty())
428 DeadNodes.push_back(Operand);
430 if (N->OperandsNeedDelete)
431 delete[] N->OperandList;
435 // Finally, remove N itself.
439 // If the root changed (e.g. it was a dead load, update the root).
440 setRoot(Dummy.getValue());
443 void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) {
444 SmallVector<SDNode*, 16> DeadNodes;
445 DeadNodes.push_back(N);
447 // Process the worklist, deleting the nodes and adding their uses to the
449 while (!DeadNodes.empty()) {
450 SDNode *N = DeadNodes.back();
451 DeadNodes.pop_back();
453 // Take the node out of the appropriate CSE map.
454 RemoveNodeFromCSEMaps(N);
456 // Next, brutally remove the operand list. This is safe to do, as there are
457 // no cycles in the graph.
458 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
459 SDNode *Operand = I->Val;
460 Operand->removeUser(N);
462 // Now that we removed this operand, see if there are no uses of it left.
463 if (Operand->use_empty())
464 DeadNodes.push_back(Operand);
466 if (N->OperandsNeedDelete)
467 delete[] N->OperandList;
471 // Finally, remove N itself.
472 Deleted.push_back(N);
477 void SelectionDAG::DeleteNode(SDNode *N) {
478 assert(N->use_empty() && "Cannot delete a node that is not dead!");
480 // First take this out of the appropriate CSE map.
481 RemoveNodeFromCSEMaps(N);
483 // Finally, remove uses due to operands of this node, remove from the
484 // AllNodes list, and delete the node.
485 DeleteNodeNotInCSEMaps(N);
488 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
490 // Remove it from the AllNodes list.
493 // Drop all of the operands and decrement used nodes use counts.
494 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
495 I->Val->removeUser(N);
496 if (N->OperandsNeedDelete)
497 delete[] N->OperandList;
504 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
505 /// correspond to it. This is useful when we're about to delete or repurpose
506 /// the node. We don't want future request for structurally identical nodes
507 /// to return N anymore.
508 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
510 switch (N->getOpcode()) {
511 case ISD::HANDLENODE: return; // noop.
513 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
516 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
517 "Cond code doesn't exist!");
518 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
519 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
521 case ISD::ExternalSymbol:
522 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
524 case ISD::TargetExternalSymbol:
526 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
529 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
530 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
533 // Remove it from the CSE Map.
534 Erased = CSEMap.RemoveNode(N);
538 // Verify that the node was actually in one of the CSE maps, unless it has a
539 // flag result (which cannot be CSE'd) or is one of the special cases that are
540 // not subject to CSE.
541 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
542 !N->isTargetOpcode()) {
545 assert(0 && "Node is not in map!");
550 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
551 /// has been taken out and modified in some way. If the specified node already
552 /// exists in the CSE maps, do not modify the maps, but return the existing node
553 /// instead. If it doesn't exist, add it and return null.
555 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
556 assert(N->getNumOperands() && "This is a leaf node!");
557 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
558 return 0; // Never add these nodes.
560 // Check that remaining values produced are not flags.
561 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
562 if (N->getValueType(i) == MVT::Flag)
563 return 0; // Never CSE anything that produces a flag.
565 SDNode *New = CSEMap.GetOrInsertNode(N);
566 if (New != N) return New; // Node already existed.
570 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
571 /// were replaced with those specified. If this node is never memoized,
572 /// return null, otherwise return a pointer to the slot it would take. If a
573 /// node already exists with these operands, the slot will be non-null.
574 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
576 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
577 return 0; // Never add these nodes.
579 // Check that remaining values produced are not flags.
580 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
581 if (N->getValueType(i) == MVT::Flag)
582 return 0; // Never CSE anything that produces a flag.
584 SDOperand Ops[] = { Op };
586 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
587 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
590 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
591 /// were replaced with those specified. If this node is never memoized,
592 /// return null, otherwise return a pointer to the slot it would take. If a
593 /// node already exists with these operands, the slot will be non-null.
594 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
595 SDOperand Op1, SDOperand Op2,
597 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
598 return 0; // Never add these nodes.
600 // Check that remaining values produced are not flags.
601 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
602 if (N->getValueType(i) == MVT::Flag)
603 return 0; // Never CSE anything that produces a flag.
605 SDOperand Ops[] = { Op1, Op2 };
607 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
608 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
612 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
613 /// were replaced with those specified. If this node is never memoized,
614 /// return null, otherwise return a pointer to the slot it would take. If a
615 /// node already exists with these operands, the slot will be non-null.
616 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
617 const SDOperand *Ops,unsigned NumOps,
619 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
620 return 0; // Never add these nodes.
622 // Check that remaining values produced are not flags.
623 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
624 if (N->getValueType(i) == MVT::Flag)
625 return 0; // Never CSE anything that produces a flag.
628 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
630 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
631 ID.AddInteger(LD->getAddressingMode());
632 ID.AddInteger(LD->getExtensionType());
633 ID.AddInteger((unsigned int)(LD->getLoadedVT()));
634 ID.AddPointer(LD->getSrcValue());
635 ID.AddInteger(LD->getSrcValueOffset());
636 ID.AddInteger(LD->getAlignment());
637 ID.AddInteger(LD->isVolatile());
638 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
639 ID.AddInteger(ST->getAddressingMode());
640 ID.AddInteger(ST->isTruncatingStore());
641 ID.AddInteger((unsigned int)(ST->getStoredVT()));
642 ID.AddPointer(ST->getSrcValue());
643 ID.AddInteger(ST->getSrcValueOffset());
644 ID.AddInteger(ST->getAlignment());
645 ID.AddInteger(ST->isVolatile());
648 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
652 SelectionDAG::~SelectionDAG() {
653 while (!AllNodes.empty()) {
654 SDNode *N = AllNodes.begin();
655 N->SetNextInBucket(0);
656 if (N->OperandsNeedDelete)
657 delete [] N->OperandList;
660 AllNodes.pop_front();
664 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
665 if (Op.getValueType() == VT) return Op;
666 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
667 return getNode(ISD::AND, Op.getValueType(), Op,
668 getConstant(Imm, Op.getValueType()));
671 SDOperand SelectionDAG::getString(const std::string &Val) {
672 StringSDNode *&N = StringNodes[Val];
674 N = new StringSDNode(Val);
675 AllNodes.push_back(N);
677 return SDOperand(N, 0);
680 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
681 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
682 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
684 // Mask out any bits that are not valid for this constant.
685 Val &= MVT::getIntVTBitMask(VT);
687 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
689 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
692 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
693 return SDOperand(E, 0);
694 SDNode *N = new ConstantSDNode(isT, Val, VT);
695 CSEMap.InsertNode(N, IP);
696 AllNodes.push_back(N);
697 return SDOperand(N, 0);
700 SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
702 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
704 MVT::ValueType EltVT =
705 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
707 // Do the map lookup using the actual bit pattern for the floating point
708 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
709 // we don't have issues with SNANs.
710 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
712 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
716 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
717 if (!MVT::isVector(VT))
718 return SDOperand(N, 0);
720 N = new ConstantFPSDNode(isTarget, V, EltVT);
721 CSEMap.InsertNode(N, IP);
722 AllNodes.push_back(N);
725 SDOperand Result(N, 0);
726 if (MVT::isVector(VT)) {
727 SmallVector<SDOperand, 8> Ops;
728 Ops.assign(MVT::getVectorNumElements(VT), Result);
729 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
734 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
736 MVT::ValueType EltVT =
737 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
739 return getConstantFP(APFloat((float)Val), VT, isTarget);
741 return getConstantFP(APFloat(Val), VT, isTarget);
744 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
745 MVT::ValueType VT, int Offset,
747 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
749 if (GVar && GVar->isThreadLocal())
750 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
752 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
754 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
756 ID.AddInteger(Offset);
758 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
759 return SDOperand(E, 0);
760 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
761 CSEMap.InsertNode(N, IP);
762 AllNodes.push_back(N);
763 return SDOperand(N, 0);
766 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
768 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
770 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
773 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
774 return SDOperand(E, 0);
775 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
776 CSEMap.InsertNode(N, IP);
777 AllNodes.push_back(N);
778 return SDOperand(N, 0);
781 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
782 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
784 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
787 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
788 return SDOperand(E, 0);
789 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
790 CSEMap.InsertNode(N, IP);
791 AllNodes.push_back(N);
792 return SDOperand(N, 0);
795 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
796 unsigned Alignment, int Offset,
798 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
800 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
801 ID.AddInteger(Alignment);
802 ID.AddInteger(Offset);
805 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
806 return SDOperand(E, 0);
807 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
808 CSEMap.InsertNode(N, IP);
809 AllNodes.push_back(N);
810 return SDOperand(N, 0);
814 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
816 unsigned Alignment, int Offset,
818 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
820 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
821 ID.AddInteger(Alignment);
822 ID.AddInteger(Offset);
823 C->AddSelectionDAGCSEId(ID);
825 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
826 return SDOperand(E, 0);
827 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
828 CSEMap.InsertNode(N, IP);
829 AllNodes.push_back(N);
830 return SDOperand(N, 0);
834 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
836 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
839 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
840 return SDOperand(E, 0);
841 SDNode *N = new BasicBlockSDNode(MBB);
842 CSEMap.InsertNode(N, IP);
843 AllNodes.push_back(N);
844 return SDOperand(N, 0);
847 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
848 if ((unsigned)VT >= ValueTypeNodes.size())
849 ValueTypeNodes.resize(VT+1);
850 if (ValueTypeNodes[VT] == 0) {
851 ValueTypeNodes[VT] = new VTSDNode(VT);
852 AllNodes.push_back(ValueTypeNodes[VT]);
855 return SDOperand(ValueTypeNodes[VT], 0);
858 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
859 SDNode *&N = ExternalSymbols[Sym];
860 if (N) return SDOperand(N, 0);
861 N = new ExternalSymbolSDNode(false, Sym, VT);
862 AllNodes.push_back(N);
863 return SDOperand(N, 0);
866 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
868 SDNode *&N = TargetExternalSymbols[Sym];
869 if (N) return SDOperand(N, 0);
870 N = new ExternalSymbolSDNode(true, Sym, VT);
871 AllNodes.push_back(N);
872 return SDOperand(N, 0);
875 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
876 if ((unsigned)Cond >= CondCodeNodes.size())
877 CondCodeNodes.resize(Cond+1);
879 if (CondCodeNodes[Cond] == 0) {
880 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
881 AllNodes.push_back(CondCodeNodes[Cond]);
883 return SDOperand(CondCodeNodes[Cond], 0);
886 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
888 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
889 ID.AddInteger(RegNo);
891 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
892 return SDOperand(E, 0);
893 SDNode *N = new RegisterSDNode(RegNo, VT);
894 CSEMap.InsertNode(N, IP);
895 AllNodes.push_back(N);
896 return SDOperand(N, 0);
899 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
900 assert((!V || isa<PointerType>(V->getType())) &&
901 "SrcValue is not a pointer?");
904 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
906 ID.AddInteger(Offset);
908 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
909 return SDOperand(E, 0);
910 SDNode *N = new SrcValueSDNode(V, Offset);
911 CSEMap.InsertNode(N, IP);
912 AllNodes.push_back(N);
913 return SDOperand(N, 0);
916 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
917 SDOperand N2, ISD::CondCode Cond) {
918 // These setcc operations always fold.
922 case ISD::SETFALSE2: return getConstant(0, VT);
924 case ISD::SETTRUE2: return getConstant(1, VT);
936 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
940 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
941 uint64_t C2 = N2C->getValue();
942 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
943 uint64_t C1 = N1C->getValue();
945 // Sign extend the operands if required
946 if (ISD::isSignedIntSetCC(Cond)) {
947 C1 = N1C->getSignExtended();
948 C2 = N2C->getSignExtended();
952 default: assert(0 && "Unknown integer setcc!");
953 case ISD::SETEQ: return getConstant(C1 == C2, VT);
954 case ISD::SETNE: return getConstant(C1 != C2, VT);
955 case ISD::SETULT: return getConstant(C1 < C2, VT);
956 case ISD::SETUGT: return getConstant(C1 > C2, VT);
957 case ISD::SETULE: return getConstant(C1 <= C2, VT);
958 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
959 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
960 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
961 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
962 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
966 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
967 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
969 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
972 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
973 return getNode(ISD::UNDEF, VT);
975 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
976 case ISD::SETNE: if (R==APFloat::cmpUnordered)
977 return getNode(ISD::UNDEF, VT);
979 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
980 R==APFloat::cmpLessThan, VT);
981 case ISD::SETLT: if (R==APFloat::cmpUnordered)
982 return getNode(ISD::UNDEF, VT);
984 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
985 case ISD::SETGT: if (R==APFloat::cmpUnordered)
986 return getNode(ISD::UNDEF, VT);
988 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
989 case ISD::SETLE: if (R==APFloat::cmpUnordered)
990 return getNode(ISD::UNDEF, VT);
992 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
993 R==APFloat::cmpEqual, VT);
994 case ISD::SETGE: if (R==APFloat::cmpUnordered)
995 return getNode(ISD::UNDEF, VT);
997 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
998 R==APFloat::cmpEqual, VT);
999 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1000 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1001 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1002 R==APFloat::cmpEqual, VT);
1003 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1004 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1005 R==APFloat::cmpLessThan, VT);
1006 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1007 R==APFloat::cmpUnordered, VT);
1008 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1009 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
1012 // Ensure that the constant occurs on the RHS.
1013 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1016 // Could not fold it.
1020 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1021 /// this predicate to simplify operations downstream. Mask is known to be zero
1022 /// for bits that V cannot have.
1023 bool SelectionDAG::MaskedValueIsZero(SDOperand Op, uint64_t Mask,
1024 unsigned Depth) const {
1025 // The masks are not wide enough to represent this type! Should use APInt.
1026 if (Op.getValueType() == MVT::i128)
1029 uint64_t KnownZero, KnownOne;
1030 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1031 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1032 return (KnownZero & Mask) == Mask;
1035 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
1036 /// known to be either zero or one and return them in the KnownZero/KnownOne
1037 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1039 void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask,
1040 uint64_t &KnownZero, uint64_t &KnownOne,
1041 unsigned Depth) const {
1042 KnownZero = KnownOne = 0; // Don't know anything.
1043 if (Depth == 6 || Mask == 0)
1044 return; // Limit search depth.
1046 // The masks are not wide enough to represent this type! Should use APInt.
1047 if (Op.getValueType() == MVT::i128)
1050 uint64_t KnownZero2, KnownOne2;
1052 switch (Op.getOpcode()) {
1054 // We know all of the bits for a constant!
1055 KnownOne = cast<ConstantSDNode>(Op)->getValue() & Mask;
1056 KnownZero = ~KnownOne & Mask;
1059 // If either the LHS or the RHS are Zero, the result is zero.
1060 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1062 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1063 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1064 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1066 // Output known-1 bits are only known if set in both the LHS & RHS.
1067 KnownOne &= KnownOne2;
1068 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1069 KnownZero |= KnownZero2;
1072 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1074 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1075 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1076 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1078 // Output known-0 bits are only known if clear in both the LHS & RHS.
1079 KnownZero &= KnownZero2;
1080 // Output known-1 are known to be set if set in either the LHS | RHS.
1081 KnownOne |= KnownOne2;
1084 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1085 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1086 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1087 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1089 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1090 uint64_t KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1091 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1092 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1093 KnownZero = KnownZeroOut;
1097 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1098 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1099 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1100 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1102 // Only known if known in both the LHS and RHS.
1103 KnownOne &= KnownOne2;
1104 KnownZero &= KnownZero2;
1106 case ISD::SELECT_CC:
1107 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1108 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1109 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1110 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1112 // Only known if known in both the LHS and RHS.
1113 KnownOne &= KnownOne2;
1114 KnownZero &= KnownZero2;
1117 // If we know the result of a setcc has the top bits zero, use this info.
1118 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult)
1119 KnownZero |= (MVT::getIntVTBitMask(Op.getValueType()) ^ 1ULL);
1122 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1123 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1124 ComputeMaskedBits(Op.getOperand(0), Mask >> SA->getValue(),
1125 KnownZero, KnownOne, Depth+1);
1126 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1127 KnownZero <<= SA->getValue();
1128 KnownOne <<= SA->getValue();
1129 KnownZero |= (1ULL << SA->getValue())-1; // low bits known zero.
1133 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1134 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1135 MVT::ValueType VT = Op.getValueType();
1136 unsigned ShAmt = SA->getValue();
1138 uint64_t TypeMask = MVT::getIntVTBitMask(VT);
1139 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt) & TypeMask,
1140 KnownZero, KnownOne, Depth+1);
1141 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1142 KnownZero &= TypeMask;
1143 KnownOne &= TypeMask;
1144 KnownZero >>= ShAmt;
1147 uint64_t HighBits = (1ULL << ShAmt)-1;
1148 HighBits <<= MVT::getSizeInBits(VT)-ShAmt;
1149 KnownZero |= HighBits; // High bits known zero.
1153 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1154 MVT::ValueType VT = Op.getValueType();
1155 unsigned ShAmt = SA->getValue();
1157 // Compute the new bits that are at the top now.
1158 uint64_t TypeMask = MVT::getIntVTBitMask(VT);
1160 uint64_t InDemandedMask = (Mask << ShAmt) & TypeMask;
1161 // If any of the demanded bits are produced by the sign extension, we also
1162 // demand the input sign bit.
1163 uint64_t HighBits = (1ULL << ShAmt)-1;
1164 HighBits <<= MVT::getSizeInBits(VT) - ShAmt;
1165 if (HighBits & Mask)
1166 InDemandedMask |= MVT::getIntVTSignBit(VT);
1168 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1170 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1171 KnownZero &= TypeMask;
1172 KnownOne &= TypeMask;
1173 KnownZero >>= ShAmt;
1176 // Handle the sign bits.
1177 uint64_t SignBit = MVT::getIntVTSignBit(VT);
1178 SignBit >>= ShAmt; // Adjust to where it is now in the mask.
1180 if (KnownZero & SignBit) {
1181 KnownZero |= HighBits; // New bits are known zero.
1182 } else if (KnownOne & SignBit) {
1183 KnownOne |= HighBits; // New bits are known one.
1187 case ISD::SIGN_EXTEND_INREG: {
1188 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1190 // Sign extension. Compute the demanded bits in the result that are not
1191 // present in the input.
1192 uint64_t NewBits = ~MVT::getIntVTBitMask(EVT) & Mask;
1194 uint64_t InSignBit = MVT::getIntVTSignBit(EVT);
1195 int64_t InputDemandedBits = Mask & MVT::getIntVTBitMask(EVT);
1197 // If the sign extended bits are demanded, we know that the sign
1200 InputDemandedBits |= InSignBit;
1202 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1203 KnownZero, KnownOne, Depth+1);
1204 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1206 // If the sign bit of the input is known set or clear, then we know the
1207 // top bits of the result.
1208 if (KnownZero & InSignBit) { // Input sign bit known clear
1209 KnownZero |= NewBits;
1210 KnownOne &= ~NewBits;
1211 } else if (KnownOne & InSignBit) { // Input sign bit known set
1212 KnownOne |= NewBits;
1213 KnownZero &= ~NewBits;
1214 } else { // Input sign bit unknown
1215 KnownZero &= ~NewBits;
1216 KnownOne &= ~NewBits;
1223 MVT::ValueType VT = Op.getValueType();
1224 unsigned LowBits = Log2_32(MVT::getSizeInBits(VT))+1;
1225 KnownZero = ~((1ULL << LowBits)-1) & MVT::getIntVTBitMask(VT);
1230 if (ISD::isZEXTLoad(Op.Val)) {
1231 LoadSDNode *LD = cast<LoadSDNode>(Op);
1232 MVT::ValueType VT = LD->getLoadedVT();
1233 KnownZero |= ~MVT::getIntVTBitMask(VT) & Mask;
1237 case ISD::ZERO_EXTEND: {
1238 uint64_t InMask = MVT::getIntVTBitMask(Op.getOperand(0).getValueType());
1239 uint64_t NewBits = (~InMask) & Mask;
1240 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1242 KnownZero |= NewBits & Mask;
1243 KnownOne &= ~NewBits;
1246 case ISD::SIGN_EXTEND: {
1247 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1248 unsigned InBits = MVT::getSizeInBits(InVT);
1249 uint64_t InMask = MVT::getIntVTBitMask(InVT);
1250 uint64_t InSignBit = 1ULL << (InBits-1);
1251 uint64_t NewBits = (~InMask) & Mask;
1252 uint64_t InDemandedBits = Mask & InMask;
1254 // If any of the sign extended bits are demanded, we know that the sign
1257 InDemandedBits |= InSignBit;
1259 ComputeMaskedBits(Op.getOperand(0), InDemandedBits, KnownZero,
1261 // If the sign bit is known zero or one, the top bits match.
1262 if (KnownZero & InSignBit) {
1263 KnownZero |= NewBits;
1264 KnownOne &= ~NewBits;
1265 } else if (KnownOne & InSignBit) {
1266 KnownOne |= NewBits;
1267 KnownZero &= ~NewBits;
1268 } else { // Otherwise, top bits aren't known.
1269 KnownOne &= ~NewBits;
1270 KnownZero &= ~NewBits;
1274 case ISD::ANY_EXTEND: {
1275 MVT::ValueType VT = Op.getOperand(0).getValueType();
1276 ComputeMaskedBits(Op.getOperand(0), Mask & MVT::getIntVTBitMask(VT),
1277 KnownZero, KnownOne, Depth+1);
1280 case ISD::TRUNCATE: {
1281 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1282 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1283 uint64_t OutMask = MVT::getIntVTBitMask(Op.getValueType());
1284 KnownZero &= OutMask;
1285 KnownOne &= OutMask;
1288 case ISD::AssertZext: {
1289 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1290 uint64_t InMask = MVT::getIntVTBitMask(VT);
1291 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1293 KnownZero |= (~InMask) & Mask;
1297 // If either the LHS or the RHS are Zero, the result is zero.
1298 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1299 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1300 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1301 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1303 // Output known-0 bits are known if clear or set in both the low clear bits
1304 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1305 // low 3 bits clear.
1306 uint64_t KnownZeroOut = std::min(CountTrailingZeros_64(~KnownZero),
1307 CountTrailingZeros_64(~KnownZero2));
1309 KnownZero = (1ULL << KnownZeroOut) - 1;
1314 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1317 // We know that the top bits of C-X are clear if X contains less bits
1318 // than C (i.e. no wrap-around can happen). For example, 20-X is
1319 // positive if we can prove that X is >= 0 and < 16.
1320 MVT::ValueType VT = CLHS->getValueType(0);
1321 if ((CLHS->getValue() & MVT::getIntVTSignBit(VT)) == 0) { // sign bit clear
1322 unsigned NLZ = CountLeadingZeros_64(CLHS->getValue()+1);
1323 uint64_t MaskV = (1ULL << (63-NLZ))-1; // NLZ can't be 64 with no sign bit
1324 MaskV = ~MaskV & MVT::getIntVTBitMask(VT);
1325 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1);
1327 // If all of the MaskV bits are known to be zero, then we know the output
1328 // top bits are zero, because we now know that the output is from [0-C].
1329 if ((KnownZero & MaskV) == MaskV) {
1330 unsigned NLZ2 = CountLeadingZeros_64(CLHS->getValue());
1331 KnownZero = ~((1ULL << (64-NLZ2))-1) & Mask; // Top bits known zero.
1332 KnownOne = 0; // No one bits known.
1334 KnownZero = KnownOne = 0; // Otherwise, nothing known.
1340 // Allow the target to implement this method for its nodes.
1341 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1342 case ISD::INTRINSIC_WO_CHAIN:
1343 case ISD::INTRINSIC_W_CHAIN:
1344 case ISD::INTRINSIC_VOID:
1345 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1351 /// ComputeNumSignBits - Return the number of times the sign bit of the
1352 /// register is replicated into the other bits. We know that at least 1 bit
1353 /// is always equal to the sign bit (itself), but other cases can give us
1354 /// information. For example, immediately after an "SRA X, 2", we know that
1355 /// the top 3 bits are all equal to each other, so we return 3.
1356 unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1357 MVT::ValueType VT = Op.getValueType();
1358 assert(MVT::isInteger(VT) && "Invalid VT!");
1359 unsigned VTBits = MVT::getSizeInBits(VT);
1363 return 1; // Limit search depth.
1365 switch (Op.getOpcode()) {
1367 case ISD::AssertSext:
1368 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1369 return VTBits-Tmp+1;
1370 case ISD::AssertZext:
1371 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1374 case ISD::Constant: {
1375 uint64_t Val = cast<ConstantSDNode>(Op)->getValue();
1376 // If negative, invert the bits, then look at it.
1377 if (Val & MVT::getIntVTSignBit(VT))
1380 // Shift the bits so they are the leading bits in the int64_t.
1383 // Return # leading zeros. We use 'min' here in case Val was zero before
1384 // shifting. We don't want to return '64' as for an i32 "0".
1385 return std::min(VTBits, CountLeadingZeros_64(Val));
1388 case ISD::SIGN_EXTEND:
1389 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1390 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1392 case ISD::SIGN_EXTEND_INREG:
1393 // Max of the input and what this extends.
1394 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1397 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1398 return std::max(Tmp, Tmp2);
1401 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1402 // SRA X, C -> adds C sign bits.
1403 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1404 Tmp += C->getValue();
1405 if (Tmp > VTBits) Tmp = VTBits;
1409 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1410 // shl destroys sign bits.
1411 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1412 if (C->getValue() >= VTBits || // Bad shift.
1413 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1414 return Tmp - C->getValue();
1419 case ISD::XOR: // NOT is handled here.
1420 // Logical binary ops preserve the number of sign bits.
1421 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1422 if (Tmp == 1) return 1; // Early out.
1423 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1424 return std::min(Tmp, Tmp2);
1427 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1428 if (Tmp == 1) return 1; // Early out.
1429 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1430 return std::min(Tmp, Tmp2);
1433 // If setcc returns 0/-1, all bits are sign bits.
1434 if (TLI.getSetCCResultContents() ==
1435 TargetLowering::ZeroOrNegativeOneSetCCResult)
1440 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1441 unsigned RotAmt = C->getValue() & (VTBits-1);
1443 // Handle rotate right by N like a rotate left by 32-N.
1444 if (Op.getOpcode() == ISD::ROTR)
1445 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1447 // If we aren't rotating out all of the known-in sign bits, return the
1448 // number that are left. This handles rotl(sext(x), 1) for example.
1449 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1450 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1454 // Add can have at most one carry bit. Thus we know that the output
1455 // is, at worst, one more bit than the inputs.
1456 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1457 if (Tmp == 1) return 1; // Early out.
1459 // Special case decrementing a value (ADD X, -1):
1460 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1461 if (CRHS->isAllOnesValue()) {
1462 uint64_t KnownZero, KnownOne;
1463 uint64_t Mask = MVT::getIntVTBitMask(VT);
1464 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1466 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1468 if ((KnownZero|1) == Mask)
1471 // If we are subtracting one from a positive number, there is no carry
1472 // out of the result.
1473 if (KnownZero & MVT::getIntVTSignBit(VT))
1477 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1478 if (Tmp2 == 1) return 1;
1479 return std::min(Tmp, Tmp2)-1;
1483 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1484 if (Tmp2 == 1) return 1;
1487 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1488 if (CLHS->getValue() == 0) {
1489 uint64_t KnownZero, KnownOne;
1490 uint64_t Mask = MVT::getIntVTBitMask(VT);
1491 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1492 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1494 if ((KnownZero|1) == Mask)
1497 // If the input is known to be positive (the sign bit is known clear),
1498 // the output of the NEG has the same number of sign bits as the input.
1499 if (KnownZero & MVT::getIntVTSignBit(VT))
1502 // Otherwise, we treat this like a SUB.
1505 // Sub can have at most one carry bit. Thus we know that the output
1506 // is, at worst, one more bit than the inputs.
1507 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1508 if (Tmp == 1) return 1; // Early out.
1509 return std::min(Tmp, Tmp2)-1;
1512 // FIXME: it's tricky to do anything useful for this, but it is an important
1513 // case for targets like X86.
1517 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1518 if (Op.getOpcode() == ISD::LOAD) {
1519 LoadSDNode *LD = cast<LoadSDNode>(Op);
1520 unsigned ExtType = LD->getExtensionType();
1523 case ISD::SEXTLOAD: // '17' bits known
1524 Tmp = MVT::getSizeInBits(LD->getLoadedVT());
1525 return VTBits-Tmp+1;
1526 case ISD::ZEXTLOAD: // '16' bits known
1527 Tmp = MVT::getSizeInBits(LD->getLoadedVT());
1532 // Allow the target to implement this method for its nodes.
1533 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1534 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1535 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1536 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1537 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1538 if (NumBits > 1) return NumBits;
1541 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1542 // use this information.
1543 uint64_t KnownZero, KnownOne;
1544 uint64_t Mask = MVT::getIntVTBitMask(VT);
1545 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1547 uint64_t SignBit = MVT::getIntVTSignBit(VT);
1548 if (KnownZero & SignBit) { // SignBit is 0
1550 } else if (KnownOne & SignBit) { // SignBit is 1;
1557 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1558 // the number of identical bits in the top of the input value.
1561 // Return # leading zeros. We use 'min' here in case Val was zero before
1562 // shifting. We don't want to return '64' as for an i32 "0".
1563 return std::min(VTBits, CountLeadingZeros_64(Mask));
1567 /// getNode - Gets or creates the specified node.
1569 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1570 FoldingSetNodeID ID;
1571 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
1573 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1574 return SDOperand(E, 0);
1575 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
1576 CSEMap.InsertNode(N, IP);
1578 AllNodes.push_back(N);
1579 return SDOperand(N, 0);
1582 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1583 SDOperand Operand) {
1585 // Constant fold unary operations with an integer constant operand.
1586 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1587 uint64_t Val = C->getValue();
1590 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1591 case ISD::ANY_EXTEND:
1592 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1593 case ISD::TRUNCATE: return getConstant(Val, VT);
1594 case ISD::UINT_TO_FP:
1595 case ISD::SINT_TO_FP: {
1596 const uint64_t zero[] = {0, 0};
1597 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero));
1598 (void)apf.convertFromInteger(&Val,
1599 MVT::getSizeInBits(Operand.getValueType()),
1600 Opcode==ISD::SINT_TO_FP,
1601 APFloat::rmNearestTiesToEven);
1602 return getConstantFP(apf, VT);
1604 case ISD::BIT_CONVERT:
1605 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1606 return getConstantFP(BitsToFloat(Val), VT);
1607 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1608 return getConstantFP(BitsToDouble(Val), VT);
1612 default: assert(0 && "Invalid bswap!"); break;
1613 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1614 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1615 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1620 default: assert(0 && "Invalid ctpop!"); break;
1621 case MVT::i1: return getConstant(Val != 0, VT);
1623 Tmp1 = (unsigned)Val & 0xFF;
1624 return getConstant(CountPopulation_32(Tmp1), VT);
1626 Tmp1 = (unsigned)Val & 0xFFFF;
1627 return getConstant(CountPopulation_32(Tmp1), VT);
1629 return getConstant(CountPopulation_32((unsigned)Val), VT);
1631 return getConstant(CountPopulation_64(Val), VT);
1635 default: assert(0 && "Invalid ctlz!"); break;
1636 case MVT::i1: return getConstant(Val == 0, VT);
1638 Tmp1 = (unsigned)Val & 0xFF;
1639 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1641 Tmp1 = (unsigned)Val & 0xFFFF;
1642 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1644 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1646 return getConstant(CountLeadingZeros_64(Val), VT);
1650 default: assert(0 && "Invalid cttz!"); break;
1651 case MVT::i1: return getConstant(Val == 0, VT);
1653 Tmp1 = (unsigned)Val | 0x100;
1654 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1656 Tmp1 = (unsigned)Val | 0x10000;
1657 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1659 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1661 return getConstant(CountTrailingZeros_64(Val), VT);
1666 // Constant fold unary operations with a floating point constant operand.
1667 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1668 APFloat V = C->getValueAPF(); // make copy
1672 return getConstantFP(V, VT);
1675 return getConstantFP(V, VT);
1677 case ISD::FP_EXTEND:
1678 // This can return overflow, underflow, or inexact; we don't care.
1679 // FIXME need to be more flexible about rounding mode.
1680 // FIXME need to be more flexible about rounding mode.
1681 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle :
1682 VT==MVT::f64 ? APFloat::IEEEdouble :
1683 VT==MVT::f80 ? APFloat::x87DoubleExtended :
1684 VT==MVT::f128 ? APFloat::IEEEquad :
1686 APFloat::rmNearestTiesToEven);
1687 return getConstantFP(V, VT);
1688 case ISD::FP_TO_SINT:
1689 case ISD::FP_TO_UINT: {
1691 assert(integerPartWidth >= 64);
1692 // FIXME need to be more flexible about rounding mode.
1693 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1694 Opcode==ISD::FP_TO_SINT,
1695 APFloat::rmTowardZero);
1696 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1698 return getConstant(x, VT);
1700 case ISD::BIT_CONVERT:
1701 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1702 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1703 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1704 return getConstant(V.convertToAPInt().getZExtValue(), VT);
1709 unsigned OpOpcode = Operand.Val->getOpcode();
1711 case ISD::TokenFactor:
1712 return Operand; // Factor of one node? No factor.
1714 case ISD::FP_EXTEND:
1715 assert(MVT::isFloatingPoint(VT) &&
1716 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1718 case ISD::SIGN_EXTEND:
1719 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1720 "Invalid SIGN_EXTEND!");
1721 if (Operand.getValueType() == VT) return Operand; // noop extension
1722 assert(Operand.getValueType() < VT && "Invalid sext node, dst < src!");
1723 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1724 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1726 case ISD::ZERO_EXTEND:
1727 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1728 "Invalid ZERO_EXTEND!");
1729 if (Operand.getValueType() == VT) return Operand; // noop extension
1730 assert(Operand.getValueType() < VT && "Invalid zext node, dst < src!");
1731 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1732 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1734 case ISD::ANY_EXTEND:
1735 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1736 "Invalid ANY_EXTEND!");
1737 if (Operand.getValueType() == VT) return Operand; // noop extension
1738 assert(Operand.getValueType() < VT && "Invalid anyext node, dst < src!");
1739 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1740 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1741 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1744 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1745 "Invalid TRUNCATE!");
1746 if (Operand.getValueType() == VT) return Operand; // noop truncate
1747 assert(Operand.getValueType() > VT && "Invalid truncate node, src < dst!");
1748 if (OpOpcode == ISD::TRUNCATE)
1749 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1750 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1751 OpOpcode == ISD::ANY_EXTEND) {
1752 // If the source is smaller than the dest, we still need an extend.
1753 if (Operand.Val->getOperand(0).getValueType() < VT)
1754 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1755 else if (Operand.Val->getOperand(0).getValueType() > VT)
1756 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1758 return Operand.Val->getOperand(0);
1761 case ISD::BIT_CONVERT:
1762 // Basic sanity checking.
1763 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1764 && "Cannot BIT_CONVERT between types of different sizes!");
1765 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1766 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1767 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1768 if (OpOpcode == ISD::UNDEF)
1769 return getNode(ISD::UNDEF, VT);
1771 case ISD::SCALAR_TO_VECTOR:
1772 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1773 MVT::getVectorElementType(VT) == Operand.getValueType() &&
1774 "Illegal SCALAR_TO_VECTOR node!");
1777 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1778 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1779 Operand.Val->getOperand(0));
1780 if (OpOpcode == ISD::FNEG) // --X -> X
1781 return Operand.Val->getOperand(0);
1784 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1785 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1790 SDVTList VTs = getVTList(VT);
1791 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1792 FoldingSetNodeID ID;
1793 SDOperand Ops[1] = { Operand };
1794 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1796 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1797 return SDOperand(E, 0);
1798 N = new UnarySDNode(Opcode, VTs, Operand);
1799 CSEMap.InsertNode(N, IP);
1801 N = new UnarySDNode(Opcode, VTs, Operand);
1803 AllNodes.push_back(N);
1804 return SDOperand(N, 0);
1809 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1810 SDOperand N1, SDOperand N2) {
1813 case ISD::TokenFactor:
1814 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1815 N2.getValueType() == MVT::Other && "Invalid token factor!");
1824 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1831 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1838 assert(N1.getValueType() == N2.getValueType() &&
1839 N1.getValueType() == VT && "Binary operator types must match!");
1841 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1842 assert(N1.getValueType() == VT &&
1843 MVT::isFloatingPoint(N1.getValueType()) &&
1844 MVT::isFloatingPoint(N2.getValueType()) &&
1845 "Invalid FCOPYSIGN!");
1852 assert(VT == N1.getValueType() &&
1853 "Shift operators return type must be the same as their first arg");
1854 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1855 VT != MVT::i1 && "Shifts only work on integers");
1857 case ISD::FP_ROUND_INREG: {
1858 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1859 assert(VT == N1.getValueType() && "Not an inreg round!");
1860 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1861 "Cannot FP_ROUND_INREG integer types");
1862 assert(EVT <= VT && "Not rounding down!");
1865 case ISD::AssertSext:
1866 case ISD::AssertZext:
1867 case ISD::SIGN_EXTEND_INREG: {
1868 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1869 assert(VT == N1.getValueType() && "Not an inreg extend!");
1870 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1871 "Cannot *_EXTEND_INREG FP types");
1872 assert(EVT <= VT && "Not extending!");
1879 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1880 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1882 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1883 int64_t Val = N1C->getValue();
1884 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1885 Val <<= 64-FromBits;
1886 Val >>= 64-FromBits;
1887 return getConstant(Val, VT);
1891 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1893 case ISD::ADD: return getConstant(C1 + C2, VT);
1894 case ISD::SUB: return getConstant(C1 - C2, VT);
1895 case ISD::MUL: return getConstant(C1 * C2, VT);
1897 if (C2) return getConstant(C1 / C2, VT);
1900 if (C2) return getConstant(C1 % C2, VT);
1903 if (C2) return getConstant(N1C->getSignExtended() /
1904 N2C->getSignExtended(), VT);
1907 if (C2) return getConstant(N1C->getSignExtended() %
1908 N2C->getSignExtended(), VT);
1910 case ISD::AND : return getConstant(C1 & C2, VT);
1911 case ISD::OR : return getConstant(C1 | C2, VT);
1912 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1913 case ISD::SHL : return getConstant(C1 << C2, VT);
1914 case ISD::SRL : return getConstant(C1 >> C2, VT);
1915 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1917 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1920 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1924 } else { // Cannonicalize constant to RHS if commutative
1925 if (isCommutativeBinOp(Opcode)) {
1926 std::swap(N1C, N2C);
1932 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1933 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1936 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
1937 APFloat::opStatus s;
1940 s = V1.add(V2, APFloat::rmNearestTiesToEven);
1941 if (s!=APFloat::opInvalidOp)
1942 return getConstantFP(V1, VT);
1945 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
1946 if (s!=APFloat::opInvalidOp)
1947 return getConstantFP(V1, VT);
1950 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
1951 if (s!=APFloat::opInvalidOp)
1952 return getConstantFP(V1, VT);
1955 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
1956 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
1957 return getConstantFP(V1, VT);
1960 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
1961 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
1962 return getConstantFP(V1, VT);
1964 case ISD::FCOPYSIGN:
1966 return getConstantFP(V1, VT);
1969 } else { // Cannonicalize constant to RHS if commutative
1970 if (isCommutativeBinOp(Opcode)) {
1971 std::swap(N1CFP, N2CFP);
1977 // Canonicalize an UNDEF to the RHS, even over a constant.
1978 if (N1.getOpcode() == ISD::UNDEF) {
1979 if (isCommutativeBinOp(Opcode)) {
1983 case ISD::FP_ROUND_INREG:
1984 case ISD::SIGN_EXTEND_INREG:
1990 return N1; // fold op(undef, arg2) -> undef
1997 if (!MVT::isVector(VT))
1998 return getConstant(0, VT); // fold op(undef, arg2) -> 0
1999 // For vectors, we can't easily build an all zero vector, just return
2006 // Fold a bunch of operators when the RHS is undef.
2007 if (N2.getOpcode() == ISD::UNDEF) {
2023 return N2; // fold op(arg1, undef) -> undef
2028 if (!MVT::isVector(VT))
2029 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2030 // For vectors, we can't easily build an all zero vector, just return
2034 if (!MVT::isVector(VT))
2035 return getConstant(MVT::getIntVTBitMask(VT), VT);
2036 // For vectors, we can't easily build an all one vector, just return
2046 case ISD::TokenFactor:
2047 // Fold trivial token factors.
2048 if (N1.getOpcode() == ISD::EntryToken) return N2;
2049 if (N2.getOpcode() == ISD::EntryToken) return N1;
2053 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
2054 // worth handling here.
2055 if (N2C && N2C->getValue() == 0)
2060 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
2061 // worth handling here.
2062 if (N2C && N2C->getValue() == 0)
2065 case ISD::FP_ROUND_INREG:
2066 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2068 case ISD::SIGN_EXTEND_INREG: {
2069 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2070 if (EVT == VT) return N1; // Not actually extending
2073 case ISD::EXTRACT_VECTOR_ELT:
2074 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2076 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2077 // expanding copies of large vectors from registers.
2078 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2079 N1.getNumOperands() > 0) {
2081 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2082 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2083 N1.getOperand(N2C->getValue() / Factor),
2084 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2087 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2088 // expanding large vector constants.
2089 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2090 return N1.getOperand(N2C->getValue());
2092 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2093 // operations are lowered to scalars.
2094 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2095 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2097 return N1.getOperand(1);
2099 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2102 case ISD::EXTRACT_ELEMENT:
2103 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
2105 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2106 // 64-bit integers into 32-bit parts. Instead of building the extract of
2107 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2108 if (N1.getOpcode() == ISD::BUILD_PAIR)
2109 return N1.getOperand(N2C->getValue());
2111 // EXTRACT_ELEMENT of a constant int is also very common.
2112 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2113 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
2114 return getConstant(C->getValue() >> Shift, VT);
2118 // FIXME: figure out how to safely handle things like
2119 // int foo(int x) { return 1 << (x & 255); }
2120 // int bar() { return foo(256); }
2125 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2126 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
2127 return getNode(Opcode, VT, N1, N2.getOperand(0));
2128 else if (N2.getOpcode() == ISD::AND)
2129 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
2130 // If the and is only masking out bits that cannot effect the shift,
2131 // eliminate the and.
2132 unsigned NumBits = MVT::getSizeInBits(VT);
2133 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2134 return getNode(Opcode, VT, N1, N2.getOperand(0));
2140 // Memoize this node if possible.
2142 SDVTList VTs = getVTList(VT);
2143 if (VT != MVT::Flag) {
2144 SDOperand Ops[] = { N1, N2 };
2145 FoldingSetNodeID ID;
2146 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2148 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2149 return SDOperand(E, 0);
2150 N = new BinarySDNode(Opcode, VTs, N1, N2);
2151 CSEMap.InsertNode(N, IP);
2153 N = new BinarySDNode(Opcode, VTs, N1, N2);
2156 AllNodes.push_back(N);
2157 return SDOperand(N, 0);
2160 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2161 SDOperand N1, SDOperand N2, SDOperand N3) {
2162 // Perform various simplifications.
2163 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2164 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2167 // Use FoldSetCC to simplify SETCC's.
2168 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
2169 if (Simp.Val) return Simp;
2174 if (N1C->getValue())
2175 return N2; // select true, X, Y -> X
2177 return N3; // select false, X, Y -> Y
2179 if (N2 == N3) return N2; // select C, X, X -> X
2183 if (N2C->getValue()) // Unconditional branch
2184 return getNode(ISD::BR, MVT::Other, N1, N3);
2186 return N1; // Never-taken branch
2188 case ISD::VECTOR_SHUFFLE:
2189 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2190 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2191 N3.getOpcode() == ISD::BUILD_VECTOR &&
2192 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2193 "Illegal VECTOR_SHUFFLE node!");
2195 case ISD::BIT_CONVERT:
2196 // Fold bit_convert nodes from a type to themselves.
2197 if (N1.getValueType() == VT)
2202 // Memoize node if it doesn't produce a flag.
2204 SDVTList VTs = getVTList(VT);
2205 if (VT != MVT::Flag) {
2206 SDOperand Ops[] = { N1, N2, N3 };
2207 FoldingSetNodeID ID;
2208 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2210 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2211 return SDOperand(E, 0);
2212 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2213 CSEMap.InsertNode(N, IP);
2215 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2217 AllNodes.push_back(N);
2218 return SDOperand(N, 0);
2221 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2222 SDOperand N1, SDOperand N2, SDOperand N3,
2224 SDOperand Ops[] = { N1, N2, N3, N4 };
2225 return getNode(Opcode, VT, Ops, 4);
2228 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2229 SDOperand N1, SDOperand N2, SDOperand N3,
2230 SDOperand N4, SDOperand N5) {
2231 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2232 return getNode(Opcode, VT, Ops, 5);
2235 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2236 SDOperand Chain, SDOperand Ptr,
2237 const Value *SV, int SVOffset,
2238 bool isVolatile, unsigned Alignment) {
2239 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2241 if (VT != MVT::iPTR) {
2242 Ty = MVT::getTypeForValueType(VT);
2244 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2245 assert(PT && "Value for load must be a pointer");
2246 Ty = PT->getElementType();
2248 assert(Ty && "Could not get type information for load");
2249 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2251 SDVTList VTs = getVTList(VT, MVT::Other);
2252 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2253 SDOperand Ops[] = { Chain, Ptr, Undef };
2254 FoldingSetNodeID ID;
2255 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2256 ID.AddInteger(ISD::UNINDEXED);
2257 ID.AddInteger(ISD::NON_EXTLOAD);
2258 ID.AddInteger((unsigned int)VT);
2260 ID.AddInteger(SVOffset);
2261 ID.AddInteger(Alignment);
2262 ID.AddInteger(isVolatile);
2264 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2265 return SDOperand(E, 0);
2266 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
2267 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
2269 CSEMap.InsertNode(N, IP);
2270 AllNodes.push_back(N);
2271 return SDOperand(N, 0);
2274 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
2275 SDOperand Chain, SDOperand Ptr,
2277 int SVOffset, MVT::ValueType EVT,
2278 bool isVolatile, unsigned Alignment) {
2279 // If they are asking for an extending load from/to the same thing, return a
2282 ExtType = ISD::NON_EXTLOAD;
2284 if (MVT::isVector(VT))
2285 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
2287 assert(EVT < VT && "Should only be an extending load, not truncating!");
2288 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2289 "Cannot sign/zero extend a FP/Vector load!");
2290 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2291 "Cannot convert from FP to Int or Int -> FP!");
2293 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2295 if (VT != MVT::iPTR) {
2296 Ty = MVT::getTypeForValueType(VT);
2298 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2299 assert(PT && "Value for load must be a pointer");
2300 Ty = PT->getElementType();
2302 assert(Ty && "Could not get type information for load");
2303 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2305 SDVTList VTs = getVTList(VT, MVT::Other);
2306 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2307 SDOperand Ops[] = { Chain, Ptr, Undef };
2308 FoldingSetNodeID ID;
2309 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2310 ID.AddInteger(ISD::UNINDEXED);
2311 ID.AddInteger(ExtType);
2312 ID.AddInteger((unsigned int)EVT);
2314 ID.AddInteger(SVOffset);
2315 ID.AddInteger(Alignment);
2316 ID.AddInteger(isVolatile);
2318 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2319 return SDOperand(E, 0);
2320 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
2321 SV, SVOffset, Alignment, isVolatile);
2322 CSEMap.InsertNode(N, IP);
2323 AllNodes.push_back(N);
2324 return SDOperand(N, 0);
2328 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2329 SDOperand Offset, ISD::MemIndexedMode AM) {
2330 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
2331 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2332 "Load is already a indexed load!");
2333 MVT::ValueType VT = OrigLoad.getValueType();
2334 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
2335 SDOperand Ops[] = { LD->getChain(), Base, Offset };
2336 FoldingSetNodeID ID;
2337 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2339 ID.AddInteger(LD->getExtensionType());
2340 ID.AddInteger((unsigned int)(LD->getLoadedVT()));
2341 ID.AddPointer(LD->getSrcValue());
2342 ID.AddInteger(LD->getSrcValueOffset());
2343 ID.AddInteger(LD->getAlignment());
2344 ID.AddInteger(LD->isVolatile());
2346 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2347 return SDOperand(E, 0);
2348 SDNode *N = new LoadSDNode(Ops, VTs, AM,
2349 LD->getExtensionType(), LD->getLoadedVT(),
2350 LD->getSrcValue(), LD->getSrcValueOffset(),
2351 LD->getAlignment(), LD->isVolatile());
2352 CSEMap.InsertNode(N, IP);
2353 AllNodes.push_back(N);
2354 return SDOperand(N, 0);
2357 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
2358 SDOperand Ptr, const Value *SV, int SVOffset,
2359 bool isVolatile, unsigned Alignment) {
2360 MVT::ValueType VT = Val.getValueType();
2362 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2364 if (VT != MVT::iPTR) {
2365 Ty = MVT::getTypeForValueType(VT);
2367 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2368 assert(PT && "Value for store must be a pointer");
2369 Ty = PT->getElementType();
2371 assert(Ty && "Could not get type information for store");
2372 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2374 SDVTList VTs = getVTList(MVT::Other);
2375 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2376 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2377 FoldingSetNodeID ID;
2378 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2379 ID.AddInteger(ISD::UNINDEXED);
2380 ID.AddInteger(false);
2381 ID.AddInteger((unsigned int)VT);
2383 ID.AddInteger(SVOffset);
2384 ID.AddInteger(Alignment);
2385 ID.AddInteger(isVolatile);
2387 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2388 return SDOperand(E, 0);
2389 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
2390 VT, SV, SVOffset, Alignment, isVolatile);
2391 CSEMap.InsertNode(N, IP);
2392 AllNodes.push_back(N);
2393 return SDOperand(N, 0);
2396 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
2397 SDOperand Ptr, const Value *SV,
2398 int SVOffset, MVT::ValueType SVT,
2399 bool isVolatile, unsigned Alignment) {
2400 MVT::ValueType VT = Val.getValueType();
2401 bool isTrunc = VT != SVT;
2403 assert(VT > SVT && "Not a truncation?");
2404 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
2405 "Can't do FP-INT conversion!");
2407 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2409 if (VT != MVT::iPTR) {
2410 Ty = MVT::getTypeForValueType(VT);
2412 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2413 assert(PT && "Value for store must be a pointer");
2414 Ty = PT->getElementType();
2416 assert(Ty && "Could not get type information for store");
2417 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2419 SDVTList VTs = getVTList(MVT::Other);
2420 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2421 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2422 FoldingSetNodeID ID;
2423 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2424 ID.AddInteger(ISD::UNINDEXED);
2425 ID.AddInteger(isTrunc);
2426 ID.AddInteger((unsigned int)SVT);
2428 ID.AddInteger(SVOffset);
2429 ID.AddInteger(Alignment);
2430 ID.AddInteger(isVolatile);
2432 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2433 return SDOperand(E, 0);
2434 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, isTrunc,
2435 SVT, SV, SVOffset, Alignment, isVolatile);
2436 CSEMap.InsertNode(N, IP);
2437 AllNodes.push_back(N);
2438 return SDOperand(N, 0);
2442 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
2443 SDOperand Offset, ISD::MemIndexedMode AM) {
2444 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
2445 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
2446 "Store is already a indexed store!");
2447 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
2448 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
2449 FoldingSetNodeID ID;
2450 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2452 ID.AddInteger(ST->isTruncatingStore());
2453 ID.AddInteger((unsigned int)(ST->getStoredVT()));
2454 ID.AddPointer(ST->getSrcValue());
2455 ID.AddInteger(ST->getSrcValueOffset());
2456 ID.AddInteger(ST->getAlignment());
2457 ID.AddInteger(ST->isVolatile());
2459 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2460 return SDOperand(E, 0);
2461 SDNode *N = new StoreSDNode(Ops, VTs, AM,
2462 ST->isTruncatingStore(), ST->getStoredVT(),
2463 ST->getSrcValue(), ST->getSrcValueOffset(),
2464 ST->getAlignment(), ST->isVolatile());
2465 CSEMap.InsertNode(N, IP);
2466 AllNodes.push_back(N);
2467 return SDOperand(N, 0);
2470 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
2471 SDOperand Chain, SDOperand Ptr,
2473 SDOperand Ops[] = { Chain, Ptr, SV };
2474 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
2477 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2478 const SDOperand *Ops, unsigned NumOps) {
2480 case 0: return getNode(Opcode, VT);
2481 case 1: return getNode(Opcode, VT, Ops[0]);
2482 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
2483 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
2489 case ISD::SELECT_CC: {
2490 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
2491 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
2492 "LHS and RHS of condition must have same type!");
2493 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2494 "True and False arms of SelectCC must have same type!");
2495 assert(Ops[2].getValueType() == VT &&
2496 "select_cc node must be of same type as true and false value!");
2500 assert(NumOps == 5 && "BR_CC takes 5 operands!");
2501 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2502 "LHS/RHS of comparison should match types!");
2509 SDVTList VTs = getVTList(VT);
2510 if (VT != MVT::Flag) {
2511 FoldingSetNodeID ID;
2512 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
2514 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2515 return SDOperand(E, 0);
2516 N = new SDNode(Opcode, VTs, Ops, NumOps);
2517 CSEMap.InsertNode(N, IP);
2519 N = new SDNode(Opcode, VTs, Ops, NumOps);
2521 AllNodes.push_back(N);
2522 return SDOperand(N, 0);
2525 SDOperand SelectionDAG::getNode(unsigned Opcode,
2526 std::vector<MVT::ValueType> &ResultTys,
2527 const SDOperand *Ops, unsigned NumOps) {
2528 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
2532 SDOperand SelectionDAG::getNode(unsigned Opcode,
2533 const MVT::ValueType *VTs, unsigned NumVTs,
2534 const SDOperand *Ops, unsigned NumOps) {
2536 return getNode(Opcode, VTs[0], Ops, NumOps);
2537 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
2540 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2541 const SDOperand *Ops, unsigned NumOps) {
2542 if (VTList.NumVTs == 1)
2543 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
2546 // FIXME: figure out how to safely handle things like
2547 // int foo(int x) { return 1 << (x & 255); }
2548 // int bar() { return foo(256); }
2550 case ISD::SRA_PARTS:
2551 case ISD::SRL_PARTS:
2552 case ISD::SHL_PARTS:
2553 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2554 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
2555 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2556 else if (N3.getOpcode() == ISD::AND)
2557 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
2558 // If the and is only masking out bits that cannot effect the shift,
2559 // eliminate the and.
2560 unsigned NumBits = MVT::getSizeInBits(VT)*2;
2561 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2562 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2568 // Memoize the node unless it returns a flag.
2570 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
2571 FoldingSetNodeID ID;
2572 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
2574 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2575 return SDOperand(E, 0);
2577 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2578 else if (NumOps == 2)
2579 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2580 else if (NumOps == 3)
2581 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2583 N = new SDNode(Opcode, VTList, Ops, NumOps);
2584 CSEMap.InsertNode(N, IP);
2587 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2588 else if (NumOps == 2)
2589 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2590 else if (NumOps == 3)
2591 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2593 N = new SDNode(Opcode, VTList, Ops, NumOps);
2595 AllNodes.push_back(N);
2596 return SDOperand(N, 0);
2599 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
2600 if (!MVT::isExtendedVT(VT))
2601 return makeVTList(SDNode::getValueTypeList(VT), 1);
2603 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2604 E = VTList.end(); I != E; ++I) {
2605 if (I->size() == 1 && (*I)[0] == VT)
2606 return makeVTList(&(*I)[0], 1);
2608 std::vector<MVT::ValueType> V;
2610 VTList.push_front(V);
2611 return makeVTList(&(*VTList.begin())[0], 1);
2614 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
2615 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2616 E = VTList.end(); I != E; ++I) {
2617 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
2618 return makeVTList(&(*I)[0], 2);
2620 std::vector<MVT::ValueType> V;
2623 VTList.push_front(V);
2624 return makeVTList(&(*VTList.begin())[0], 2);
2626 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
2627 MVT::ValueType VT3) {
2628 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2629 E = VTList.end(); I != E; ++I) {
2630 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
2632 return makeVTList(&(*I)[0], 3);
2634 std::vector<MVT::ValueType> V;
2638 VTList.push_front(V);
2639 return makeVTList(&(*VTList.begin())[0], 3);
2642 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
2644 case 0: assert(0 && "Cannot have nodes without results!");
2645 case 1: return getVTList(VTs[0]);
2646 case 2: return getVTList(VTs[0], VTs[1]);
2647 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
2651 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2652 E = VTList.end(); I != E; ++I) {
2653 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
2655 bool NoMatch = false;
2656 for (unsigned i = 2; i != NumVTs; ++i)
2657 if (VTs[i] != (*I)[i]) {
2662 return makeVTList(&*I->begin(), NumVTs);
2665 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
2666 return makeVTList(&*VTList.begin()->begin(), NumVTs);
2670 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
2671 /// specified operands. If the resultant node already exists in the DAG,
2672 /// this does not modify the specified node, instead it returns the node that
2673 /// already exists. If the resultant node does not exist in the DAG, the
2674 /// input node is returned. As a degenerate case, if you specify the same
2675 /// input operands as the node already has, the input node is returned.
2676 SDOperand SelectionDAG::
2677 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
2678 SDNode *N = InN.Val;
2679 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
2681 // Check to see if there is no change.
2682 if (Op == N->getOperand(0)) return InN;
2684 // See if the modified node already exists.
2685 void *InsertPos = 0;
2686 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
2687 return SDOperand(Existing, InN.ResNo);
2689 // Nope it doesn't. Remove the node from it's current place in the maps.
2691 RemoveNodeFromCSEMaps(N);
2693 // Now we update the operands.
2694 N->OperandList[0].Val->removeUser(N);
2696 N->OperandList[0] = Op;
2698 // If this gets put into a CSE map, add it.
2699 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2703 SDOperand SelectionDAG::
2704 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
2705 SDNode *N = InN.Val;
2706 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
2708 // Check to see if there is no change.
2709 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
2710 return InN; // No operands changed, just return the input node.
2712 // See if the modified node already exists.
2713 void *InsertPos = 0;
2714 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
2715 return SDOperand(Existing, InN.ResNo);
2717 // Nope it doesn't. Remove the node from it's current place in the maps.
2719 RemoveNodeFromCSEMaps(N);
2721 // Now we update the operands.
2722 if (N->OperandList[0] != Op1) {
2723 N->OperandList[0].Val->removeUser(N);
2724 Op1.Val->addUser(N);
2725 N->OperandList[0] = Op1;
2727 if (N->OperandList[1] != Op2) {
2728 N->OperandList[1].Val->removeUser(N);
2729 Op2.Val->addUser(N);
2730 N->OperandList[1] = Op2;
2733 // If this gets put into a CSE map, add it.
2734 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2738 SDOperand SelectionDAG::
2739 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2740 SDOperand Ops[] = { Op1, Op2, Op3 };
2741 return UpdateNodeOperands(N, Ops, 3);
2744 SDOperand SelectionDAG::
2745 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2746 SDOperand Op3, SDOperand Op4) {
2747 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
2748 return UpdateNodeOperands(N, Ops, 4);
2751 SDOperand SelectionDAG::
2752 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2753 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2754 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
2755 return UpdateNodeOperands(N, Ops, 5);
2759 SDOperand SelectionDAG::
2760 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
2761 SDNode *N = InN.Val;
2762 assert(N->getNumOperands() == NumOps &&
2763 "Update with wrong number of operands");
2765 // Check to see if there is no change.
2766 bool AnyChange = false;
2767 for (unsigned i = 0; i != NumOps; ++i) {
2768 if (Ops[i] != N->getOperand(i)) {
2774 // No operands changed, just return the input node.
2775 if (!AnyChange) return InN;
2777 // See if the modified node already exists.
2778 void *InsertPos = 0;
2779 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2780 return SDOperand(Existing, InN.ResNo);
2782 // Nope it doesn't. Remove the node from it's current place in the maps.
2784 RemoveNodeFromCSEMaps(N);
2786 // Now we update the operands.
2787 for (unsigned i = 0; i != NumOps; ++i) {
2788 if (N->OperandList[i] != Ops[i]) {
2789 N->OperandList[i].Val->removeUser(N);
2790 Ops[i].Val->addUser(N);
2791 N->OperandList[i] = Ops[i];
2795 // If this gets put into a CSE map, add it.
2796 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2801 /// MorphNodeTo - This frees the operands of the current node, resets the
2802 /// opcode, types, and operands to the specified value. This should only be
2803 /// used by the SelectionDAG class.
2804 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
2805 const SDOperand *Ops, unsigned NumOps) {
2808 NumValues = L.NumVTs;
2810 // Clear the operands list, updating used nodes to remove this from their
2812 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
2813 I->Val->removeUser(this);
2815 // If NumOps is larger than the # of operands we currently have, reallocate
2816 // the operand list.
2817 if (NumOps > NumOperands) {
2818 if (OperandsNeedDelete)
2819 delete [] OperandList;
2820 OperandList = new SDOperand[NumOps];
2821 OperandsNeedDelete = true;
2824 // Assign the new operands.
2825 NumOperands = NumOps;
2827 for (unsigned i = 0, e = NumOps; i != e; ++i) {
2828 OperandList[i] = Ops[i];
2829 SDNode *N = OperandList[i].Val;
2830 N->Uses.push_back(this);
2834 /// SelectNodeTo - These are used for target selectors to *mutate* the
2835 /// specified node to have the specified return type, Target opcode, and
2836 /// operands. Note that target opcodes are stored as
2837 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
2839 /// Note that SelectNodeTo returns the resultant node. If there is already a
2840 /// node of the specified opcode and operands, it returns that node instead of
2841 /// the current one.
2842 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2843 MVT::ValueType VT) {
2844 SDVTList VTs = getVTList(VT);
2845 FoldingSetNodeID ID;
2846 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2848 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2851 RemoveNodeFromCSEMaps(N);
2853 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2855 CSEMap.InsertNode(N, IP);
2859 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2860 MVT::ValueType VT, SDOperand Op1) {
2861 // If an identical node already exists, use it.
2862 SDVTList VTs = getVTList(VT);
2863 SDOperand Ops[] = { Op1 };
2865 FoldingSetNodeID ID;
2866 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2868 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2871 RemoveNodeFromCSEMaps(N);
2872 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2873 CSEMap.InsertNode(N, IP);
2877 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2878 MVT::ValueType VT, SDOperand Op1,
2880 // If an identical node already exists, use it.
2881 SDVTList VTs = getVTList(VT);
2882 SDOperand Ops[] = { Op1, Op2 };
2884 FoldingSetNodeID ID;
2885 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2887 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2890 RemoveNodeFromCSEMaps(N);
2892 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2894 CSEMap.InsertNode(N, IP); // Memoize the new node.
2898 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2899 MVT::ValueType VT, SDOperand Op1,
2900 SDOperand Op2, SDOperand Op3) {
2901 // If an identical node already exists, use it.
2902 SDVTList VTs = getVTList(VT);
2903 SDOperand Ops[] = { Op1, Op2, Op3 };
2904 FoldingSetNodeID ID;
2905 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2907 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2910 RemoveNodeFromCSEMaps(N);
2912 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2914 CSEMap.InsertNode(N, IP); // Memoize the new node.
2918 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2919 MVT::ValueType VT, const SDOperand *Ops,
2921 // If an identical node already exists, use it.
2922 SDVTList VTs = getVTList(VT);
2923 FoldingSetNodeID ID;
2924 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2926 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2929 RemoveNodeFromCSEMaps(N);
2930 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2932 CSEMap.InsertNode(N, IP); // Memoize the new node.
2936 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2937 MVT::ValueType VT1, MVT::ValueType VT2,
2938 SDOperand Op1, SDOperand Op2) {
2939 SDVTList VTs = getVTList(VT1, VT2);
2940 FoldingSetNodeID ID;
2941 SDOperand Ops[] = { Op1, Op2 };
2942 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2944 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2947 RemoveNodeFromCSEMaps(N);
2948 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2949 CSEMap.InsertNode(N, IP); // Memoize the new node.
2953 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2954 MVT::ValueType VT1, MVT::ValueType VT2,
2955 SDOperand Op1, SDOperand Op2,
2957 // If an identical node already exists, use it.
2958 SDVTList VTs = getVTList(VT1, VT2);
2959 SDOperand Ops[] = { Op1, Op2, Op3 };
2960 FoldingSetNodeID ID;
2961 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2963 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2966 RemoveNodeFromCSEMaps(N);
2968 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2969 CSEMap.InsertNode(N, IP); // Memoize the new node.
2974 /// getTargetNode - These are used for target selectors to create a new node
2975 /// with specified return type(s), target opcode, and operands.
2977 /// Note that getTargetNode returns the resultant node. If there is already a
2978 /// node of the specified opcode and operands, it returns that node instead of
2979 /// the current one.
2980 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
2981 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
2983 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2985 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
2987 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2988 SDOperand Op1, SDOperand Op2) {
2989 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
2991 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2992 SDOperand Op1, SDOperand Op2,
2994 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
2996 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
2997 const SDOperand *Ops, unsigned NumOps) {
2998 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
3000 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3001 MVT::ValueType VT2, SDOperand Op1) {
3002 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3003 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
3005 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3006 MVT::ValueType VT2, SDOperand Op1,
3008 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3009 SDOperand Ops[] = { Op1, Op2 };
3010 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
3012 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3013 MVT::ValueType VT2, SDOperand Op1,
3014 SDOperand Op2, SDOperand Op3) {
3015 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3016 SDOperand Ops[] = { Op1, Op2, Op3 };
3017 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
3019 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3021 const SDOperand *Ops, unsigned NumOps) {
3022 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3023 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
3025 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3026 MVT::ValueType VT2, MVT::ValueType VT3,
3027 SDOperand Op1, SDOperand Op2) {
3028 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3029 SDOperand Ops[] = { Op1, Op2 };
3030 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
3032 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3033 MVT::ValueType VT2, MVT::ValueType VT3,
3034 SDOperand Op1, SDOperand Op2,
3036 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3037 SDOperand Ops[] = { Op1, Op2, Op3 };
3038 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3040 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3041 MVT::ValueType VT2, MVT::ValueType VT3,
3042 const SDOperand *Ops, unsigned NumOps) {
3043 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3044 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
3046 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3047 MVT::ValueType VT2, MVT::ValueType VT3,
3049 const SDOperand *Ops, unsigned NumOps) {
3050 std::vector<MVT::ValueType> VTList;
3051 VTList.push_back(VT1);
3052 VTList.push_back(VT2);
3053 VTList.push_back(VT3);
3054 VTList.push_back(VT4);
3055 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3056 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3059 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3060 /// This can cause recursive merging of nodes in the DAG.
3062 /// This version assumes From/To have a single result value.
3064 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
3065 std::vector<SDNode*> *Deleted) {
3066 SDNode *From = FromN.Val, *To = ToN.Val;
3067 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
3068 "Cannot replace with this method!");
3069 assert(From != To && "Cannot replace uses of with self");
3071 while (!From->use_empty()) {
3072 // Process users until they are all gone.
3073 SDNode *U = *From->use_begin();
3075 // This node is about to morph, remove its old self from the CSE maps.
3076 RemoveNodeFromCSEMaps(U);
3078 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3080 if (I->Val == From) {
3081 From->removeUser(U);
3086 // Now that we have modified U, add it back to the CSE maps. If it already
3087 // exists there, recursively merge the results together.
3088 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3089 ReplaceAllUsesWith(U, Existing, Deleted);
3091 if (Deleted) Deleted->push_back(U);
3092 DeleteNodeNotInCSEMaps(U);
3097 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3098 /// This can cause recursive merging of nodes in the DAG.
3100 /// This version assumes From/To have matching types and numbers of result
3103 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
3104 std::vector<SDNode*> *Deleted) {
3105 assert(From != To && "Cannot replace uses of with self");
3106 assert(From->getNumValues() == To->getNumValues() &&
3107 "Cannot use this version of ReplaceAllUsesWith!");
3108 if (From->getNumValues() == 1) { // If possible, use the faster version.
3109 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
3113 while (!From->use_empty()) {
3114 // Process users until they are all gone.
3115 SDNode *U = *From->use_begin();
3117 // This node is about to morph, remove its old self from the CSE maps.
3118 RemoveNodeFromCSEMaps(U);
3120 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3122 if (I->Val == From) {
3123 From->removeUser(U);
3128 // Now that we have modified U, add it back to the CSE maps. If it already
3129 // exists there, recursively merge the results together.
3130 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3131 ReplaceAllUsesWith(U, Existing, Deleted);
3133 if (Deleted) Deleted->push_back(U);
3134 DeleteNodeNotInCSEMaps(U);
3139 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3140 /// This can cause recursive merging of nodes in the DAG.
3142 /// This version can replace From with any result values. To must match the
3143 /// number and types of values returned by From.
3144 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
3145 const SDOperand *To,
3146 std::vector<SDNode*> *Deleted) {
3147 if (From->getNumValues() == 1 && To[0].Val->getNumValues() == 1) {
3148 // Degenerate case handled above.
3149 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
3153 while (!From->use_empty()) {
3154 // Process users until they are all gone.
3155 SDNode *U = *From->use_begin();
3157 // This node is about to morph, remove its old self from the CSE maps.
3158 RemoveNodeFromCSEMaps(U);
3160 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3162 if (I->Val == From) {
3163 const SDOperand &ToOp = To[I->ResNo];
3164 From->removeUser(U);
3166 ToOp.Val->addUser(U);
3169 // Now that we have modified U, add it back to the CSE maps. If it already
3170 // exists there, recursively merge the results together.
3171 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3172 ReplaceAllUsesWith(U, Existing, Deleted);
3174 if (Deleted) Deleted->push_back(U);
3175 DeleteNodeNotInCSEMaps(U);
3180 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3181 /// uses of other values produced by From.Val alone. The Deleted vector is
3182 /// handled the same was as for ReplaceAllUsesWith.
3183 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
3184 std::vector<SDNode*> &Deleted) {
3185 assert(From != To && "Cannot replace a value with itself");
3186 // Handle the simple, trivial, case efficiently.
3187 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
3188 ReplaceAllUsesWith(From, To, &Deleted);
3192 // Get all of the users of From.Val. We want these in a nice,
3193 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3194 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
3196 while (!Users.empty()) {
3197 // We know that this user uses some value of From. If it is the right
3198 // value, update it.
3199 SDNode *User = Users.back();
3202 for (SDOperand *Op = User->OperandList,
3203 *E = User->OperandList+User->NumOperands; Op != E; ++Op) {
3205 // Okay, we know this user needs to be updated. Remove its old self
3206 // from the CSE maps.
3207 RemoveNodeFromCSEMaps(User);
3209 // Update all operands that match "From".
3210 for (; Op != E; ++Op) {
3212 From.Val->removeUser(User);
3214 To.Val->addUser(User);
3218 // Now that we have modified User, add it back to the CSE maps. If it
3219 // already exists there, recursively merge the results together.
3220 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(User)) {
3221 unsigned NumDeleted = Deleted.size();
3222 ReplaceAllUsesWith(User, Existing, &Deleted);
3224 // User is now dead.
3225 Deleted.push_back(User);
3226 DeleteNodeNotInCSEMaps(User);
3228 // We have to be careful here, because ReplaceAllUsesWith could have
3229 // deleted a user of From, which means there may be dangling pointers
3230 // in the "Users" setvector. Scan over the deleted node pointers and
3231 // remove them from the setvector.
3232 for (unsigned i = NumDeleted, e = Deleted.size(); i != e; ++i)
3233 Users.remove(Deleted[i]);
3235 break; // Exit the operand scanning loop.
3242 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3243 /// their allnodes order. It returns the maximum id.
3244 unsigned SelectionDAG::AssignNodeIds() {
3246 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3253 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
3254 /// based on their topological order. It returns the maximum id and a vector
3255 /// of the SDNodes* in assigned order by reference.
3256 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
3257 unsigned DAGSize = AllNodes.size();
3258 std::vector<unsigned> InDegree(DAGSize);
3259 std::vector<SDNode*> Sources;
3261 // Use a two pass approach to avoid using a std::map which is slow.
3263 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
3266 unsigned Degree = N->use_size();
3267 InDegree[N->getNodeId()] = Degree;
3269 Sources.push_back(N);
3273 while (!Sources.empty()) {
3274 SDNode *N = Sources.back();
3276 TopOrder.push_back(N);
3277 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
3279 unsigned Degree = --InDegree[P->getNodeId()];
3281 Sources.push_back(P);
3285 // Second pass, assign the actual topological order as node ids.
3287 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
3289 (*TI)->setNodeId(Id++);
3296 //===----------------------------------------------------------------------===//
3298 //===----------------------------------------------------------------------===//
3300 // Out-of-line virtual method to give class a home.
3301 void SDNode::ANCHOR() {}
3302 void UnarySDNode::ANCHOR() {}
3303 void BinarySDNode::ANCHOR() {}
3304 void TernarySDNode::ANCHOR() {}
3305 void HandleSDNode::ANCHOR() {}
3306 void StringSDNode::ANCHOR() {}
3307 void ConstantSDNode::ANCHOR() {}
3308 void ConstantFPSDNode::ANCHOR() {}
3309 void GlobalAddressSDNode::ANCHOR() {}
3310 void FrameIndexSDNode::ANCHOR() {}
3311 void JumpTableSDNode::ANCHOR() {}
3312 void ConstantPoolSDNode::ANCHOR() {}
3313 void BasicBlockSDNode::ANCHOR() {}
3314 void SrcValueSDNode::ANCHOR() {}
3315 void RegisterSDNode::ANCHOR() {}
3316 void ExternalSymbolSDNode::ANCHOR() {}
3317 void CondCodeSDNode::ANCHOR() {}
3318 void VTSDNode::ANCHOR() {}
3319 void LoadSDNode::ANCHOR() {}
3320 void StoreSDNode::ANCHOR() {}
3322 HandleSDNode::~HandleSDNode() {
3323 SDVTList VTs = { 0, 0 };
3324 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
3327 GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
3328 MVT::ValueType VT, int o)
3329 : SDNode(isa<GlobalVariable>(GA) &&
3330 cast<GlobalVariable>(GA)->isThreadLocal() ?
3332 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
3334 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
3335 getSDVTList(VT)), Offset(o) {
3336 TheGlobal = const_cast<GlobalValue*>(GA);
3339 /// Profile - Gather unique data for the node.
3341 void SDNode::Profile(FoldingSetNodeID &ID) {
3342 AddNodeIDNode(ID, this);
3345 /// getValueTypeList - Return a pointer to the specified value type.
3347 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
3348 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
3353 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
3354 /// indicated value. This method ignores uses of other values defined by this
3356 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
3357 assert(Value < getNumValues() && "Bad value!");
3359 // If there is only one value, this is easy.
3360 if (getNumValues() == 1)
3361 return use_size() == NUses;
3362 if (use_size() < NUses) return false;
3364 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3366 SmallPtrSet<SDNode*, 32> UsersHandled;
3368 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3370 if (User->getNumOperands() == 1 ||
3371 UsersHandled.insert(User)) // First time we've seen this?
3372 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3373 if (User->getOperand(i) == TheValue) {
3375 return false; // too many uses
3380 // Found exactly the right number of uses?
3385 /// hasAnyUseOfValue - Return true if there are any use of the indicated
3386 /// value. This method ignores uses of other values defined by this operation.
3387 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
3388 assert(Value < getNumValues() && "Bad value!");
3390 if (use_size() == 0) return false;
3392 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3394 SmallPtrSet<SDNode*, 32> UsersHandled;
3396 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3398 if (User->getNumOperands() == 1 ||
3399 UsersHandled.insert(User)) // First time we've seen this?
3400 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3401 if (User->getOperand(i) == TheValue) {
3410 /// isOnlyUse - Return true if this node is the only use of N.
3412 bool SDNode::isOnlyUse(SDNode *N) const {
3414 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
3425 /// isOperand - Return true if this node is an operand of N.
3427 bool SDOperand::isOperand(SDNode *N) const {
3428 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3429 if (*this == N->getOperand(i))
3434 bool SDNode::isOperand(SDNode *N) const {
3435 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
3436 if (this == N->OperandList[i].Val)
3441 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
3442 SmallPtrSet<SDNode *, 32> &Visited) {
3443 if (found || !Visited.insert(N))
3446 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
3447 SDNode *Op = N->getOperand(i).Val;
3452 findPredecessor(Op, P, found, Visited);
3456 /// isPredecessor - Return true if this node is a predecessor of N. This node
3457 /// is either an operand of N or it can be reached by recursively traversing
3458 /// up the operands.
3459 /// NOTE: this is an expensive method. Use it carefully.
3460 bool SDNode::isPredecessor(SDNode *N) const {
3461 SmallPtrSet<SDNode *, 32> Visited;
3463 findPredecessor(N, this, found, Visited);
3467 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
3468 assert(Num < NumOperands && "Invalid child # of SDNode!");
3469 return cast<ConstantSDNode>(OperandList[Num])->getValue();
3472 std::string SDNode::getOperationName(const SelectionDAG *G) const {
3473 switch (getOpcode()) {
3475 if (getOpcode() < ISD::BUILTIN_OP_END)
3476 return "<<Unknown DAG Node>>";
3479 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
3480 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
3481 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
3483 TargetLowering &TLI = G->getTargetLoweringInfo();
3485 TLI.getTargetNodeName(getOpcode());
3486 if (Name) return Name;
3489 return "<<Unknown Target Node>>";
3492 case ISD::PCMARKER: return "PCMarker";
3493 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
3494 case ISD::SRCVALUE: return "SrcValue";
3495 case ISD::EntryToken: return "EntryToken";
3496 case ISD::TokenFactor: return "TokenFactor";
3497 case ISD::AssertSext: return "AssertSext";
3498 case ISD::AssertZext: return "AssertZext";
3500 case ISD::STRING: return "String";
3501 case ISD::BasicBlock: return "BasicBlock";
3502 case ISD::VALUETYPE: return "ValueType";
3503 case ISD::Register: return "Register";
3505 case ISD::Constant: return "Constant";
3506 case ISD::ConstantFP: return "ConstantFP";
3507 case ISD::GlobalAddress: return "GlobalAddress";
3508 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
3509 case ISD::FrameIndex: return "FrameIndex";
3510 case ISD::JumpTable: return "JumpTable";
3511 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
3512 case ISD::RETURNADDR: return "RETURNADDR";
3513 case ISD::FRAMEADDR: return "FRAMEADDR";
3514 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
3515 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
3516 case ISD::EHSELECTION: return "EHSELECTION";
3517 case ISD::EH_RETURN: return "EH_RETURN";
3518 case ISD::ConstantPool: return "ConstantPool";
3519 case ISD::ExternalSymbol: return "ExternalSymbol";
3520 case ISD::INTRINSIC_WO_CHAIN: {
3521 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
3522 return Intrinsic::getName((Intrinsic::ID)IID);
3524 case ISD::INTRINSIC_VOID:
3525 case ISD::INTRINSIC_W_CHAIN: {
3526 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
3527 return Intrinsic::getName((Intrinsic::ID)IID);
3530 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
3531 case ISD::TargetConstant: return "TargetConstant";
3532 case ISD::TargetConstantFP:return "TargetConstantFP";
3533 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
3534 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
3535 case ISD::TargetFrameIndex: return "TargetFrameIndex";
3536 case ISD::TargetJumpTable: return "TargetJumpTable";
3537 case ISD::TargetConstantPool: return "TargetConstantPool";
3538 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
3540 case ISD::CopyToReg: return "CopyToReg";
3541 case ISD::CopyFromReg: return "CopyFromReg";
3542 case ISD::UNDEF: return "undef";
3543 case ISD::MERGE_VALUES: return "merge_values";
3544 case ISD::INLINEASM: return "inlineasm";
3545 case ISD::LABEL: return "label";
3546 case ISD::HANDLENODE: return "handlenode";
3547 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
3548 case ISD::CALL: return "call";
3551 case ISD::FABS: return "fabs";
3552 case ISD::FNEG: return "fneg";
3553 case ISD::FSQRT: return "fsqrt";
3554 case ISD::FSIN: return "fsin";
3555 case ISD::FCOS: return "fcos";
3556 case ISD::FPOWI: return "fpowi";
3559 case ISD::ADD: return "add";
3560 case ISD::SUB: return "sub";
3561 case ISD::MUL: return "mul";
3562 case ISD::MULHU: return "mulhu";
3563 case ISD::MULHS: return "mulhs";
3564 case ISD::SDIV: return "sdiv";
3565 case ISD::UDIV: return "udiv";
3566 case ISD::SREM: return "srem";
3567 case ISD::UREM: return "urem";
3568 case ISD::AND: return "and";
3569 case ISD::OR: return "or";
3570 case ISD::XOR: return "xor";
3571 case ISD::SHL: return "shl";
3572 case ISD::SRA: return "sra";
3573 case ISD::SRL: return "srl";
3574 case ISD::ROTL: return "rotl";
3575 case ISD::ROTR: return "rotr";
3576 case ISD::FADD: return "fadd";
3577 case ISD::FSUB: return "fsub";
3578 case ISD::FMUL: return "fmul";
3579 case ISD::FDIV: return "fdiv";
3580 case ISD::FREM: return "frem";
3581 case ISD::FCOPYSIGN: return "fcopysign";
3583 case ISD::SETCC: return "setcc";
3584 case ISD::SELECT: return "select";
3585 case ISD::SELECT_CC: return "select_cc";
3586 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
3587 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
3588 case ISD::CONCAT_VECTORS: return "concat_vectors";
3589 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
3590 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
3591 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
3592 case ISD::CARRY_FALSE: return "carry_false";
3593 case ISD::ADDC: return "addc";
3594 case ISD::ADDE: return "adde";
3595 case ISD::SUBC: return "subc";
3596 case ISD::SUBE: return "sube";
3597 case ISD::SHL_PARTS: return "shl_parts";
3598 case ISD::SRA_PARTS: return "sra_parts";
3599 case ISD::SRL_PARTS: return "srl_parts";
3601 case ISD::EXTRACT_SUBREG: return "extract_subreg";
3602 case ISD::INSERT_SUBREG: return "insert_subreg";
3604 // Conversion operators.
3605 case ISD::SIGN_EXTEND: return "sign_extend";
3606 case ISD::ZERO_EXTEND: return "zero_extend";
3607 case ISD::ANY_EXTEND: return "any_extend";
3608 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
3609 case ISD::TRUNCATE: return "truncate";
3610 case ISD::FP_ROUND: return "fp_round";
3611 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
3612 case ISD::FP_EXTEND: return "fp_extend";
3614 case ISD::SINT_TO_FP: return "sint_to_fp";
3615 case ISD::UINT_TO_FP: return "uint_to_fp";
3616 case ISD::FP_TO_SINT: return "fp_to_sint";
3617 case ISD::FP_TO_UINT: return "fp_to_uint";
3618 case ISD::BIT_CONVERT: return "bit_convert";
3620 // Control flow instructions
3621 case ISD::BR: return "br";
3622 case ISD::BRIND: return "brind";
3623 case ISD::BR_JT: return "br_jt";
3624 case ISD::BRCOND: return "brcond";
3625 case ISD::BR_CC: return "br_cc";
3626 case ISD::RET: return "ret";
3627 case ISD::CALLSEQ_START: return "callseq_start";
3628 case ISD::CALLSEQ_END: return "callseq_end";
3631 case ISD::LOAD: return "load";
3632 case ISD::STORE: return "store";
3633 case ISD::VAARG: return "vaarg";
3634 case ISD::VACOPY: return "vacopy";
3635 case ISD::VAEND: return "vaend";
3636 case ISD::VASTART: return "vastart";
3637 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
3638 case ISD::EXTRACT_ELEMENT: return "extract_element";
3639 case ISD::BUILD_PAIR: return "build_pair";
3640 case ISD::STACKSAVE: return "stacksave";
3641 case ISD::STACKRESTORE: return "stackrestore";
3643 // Block memory operations.
3644 case ISD::MEMSET: return "memset";
3645 case ISD::MEMCPY: return "memcpy";
3646 case ISD::MEMMOVE: return "memmove";
3649 case ISD::BSWAP: return "bswap";
3650 case ISD::CTPOP: return "ctpop";
3651 case ISD::CTTZ: return "cttz";
3652 case ISD::CTLZ: return "ctlz";
3655 case ISD::LOCATION: return "location";
3656 case ISD::DEBUG_LOC: return "debug_loc";
3659 case ISD::TRAMPOLINE: return "trampoline";
3662 switch (cast<CondCodeSDNode>(this)->get()) {
3663 default: assert(0 && "Unknown setcc condition!");
3664 case ISD::SETOEQ: return "setoeq";
3665 case ISD::SETOGT: return "setogt";
3666 case ISD::SETOGE: return "setoge";
3667 case ISD::SETOLT: return "setolt";
3668 case ISD::SETOLE: return "setole";
3669 case ISD::SETONE: return "setone";
3671 case ISD::SETO: return "seto";
3672 case ISD::SETUO: return "setuo";
3673 case ISD::SETUEQ: return "setue";
3674 case ISD::SETUGT: return "setugt";
3675 case ISD::SETUGE: return "setuge";
3676 case ISD::SETULT: return "setult";
3677 case ISD::SETULE: return "setule";
3678 case ISD::SETUNE: return "setune";
3680 case ISD::SETEQ: return "seteq";
3681 case ISD::SETGT: return "setgt";
3682 case ISD::SETGE: return "setge";
3683 case ISD::SETLT: return "setlt";
3684 case ISD::SETLE: return "setle";
3685 case ISD::SETNE: return "setne";
3690 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
3699 return "<post-inc>";
3701 return "<post-dec>";
3705 void SDNode::dump() const { dump(0); }
3706 void SDNode::dump(const SelectionDAG *G) const {
3707 cerr << (void*)this << ": ";
3709 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
3711 if (getValueType(i) == MVT::Other)
3714 cerr << MVT::getValueTypeString(getValueType(i));
3716 cerr << " = " << getOperationName(G);
3719 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
3720 if (i) cerr << ", ";
3721 cerr << (void*)getOperand(i).Val;
3722 if (unsigned RN = getOperand(i).ResNo)
3726 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
3727 cerr << "<" << CSDN->getValue() << ">";
3728 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
3729 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
3730 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
3731 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
3732 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
3734 cerr << "<APFloat(";
3735 CSDN->getValueAPF().convertToAPInt().dump();
3738 } else if (const GlobalAddressSDNode *GADN =
3739 dyn_cast<GlobalAddressSDNode>(this)) {
3740 int offset = GADN->getOffset();
3742 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
3744 cerr << " + " << offset;
3746 cerr << " " << offset;
3747 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
3748 cerr << "<" << FIDN->getIndex() << ">";
3749 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
3750 cerr << "<" << JTDN->getIndex() << ">";
3751 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
3752 int offset = CP->getOffset();
3753 if (CP->isMachineConstantPoolEntry())
3754 cerr << "<" << *CP->getMachineCPVal() << ">";
3756 cerr << "<" << *CP->getConstVal() << ">";
3758 cerr << " + " << offset;
3760 cerr << " " << offset;
3761 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
3763 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
3765 cerr << LBB->getName() << " ";
3766 cerr << (const void*)BBDN->getBasicBlock() << ">";
3767 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
3768 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
3769 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
3771 cerr << " #" << R->getReg();
3773 } else if (const ExternalSymbolSDNode *ES =
3774 dyn_cast<ExternalSymbolSDNode>(this)) {
3775 cerr << "'" << ES->getSymbol() << "'";
3776 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
3778 cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
3780 cerr << "<null:" << M->getOffset() << ">";
3781 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
3782 cerr << ":" << MVT::getValueTypeString(N->getVT());
3783 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
3785 switch (LD->getExtensionType()) {
3786 default: doExt = false; break;
3788 cerr << " <anyext ";
3798 cerr << MVT::getValueTypeString(LD->getLoadedVT()) << ">";
3800 const char *AM = getIndexedModeName(LD->getAddressingMode());
3803 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
3804 if (ST->isTruncatingStore())
3806 << MVT::getValueTypeString(ST->getStoredVT()) << ">";
3808 const char *AM = getIndexedModeName(ST->getAddressingMode());
3814 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
3815 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3816 if (N->getOperand(i).Val->hasOneUse())
3817 DumpNodes(N->getOperand(i).Val, indent+2, G);
3819 cerr << "\n" << std::string(indent+2, ' ')
3820 << (void*)N->getOperand(i).Val << ": <multiple use>";
3823 cerr << "\n" << std::string(indent, ' ');
3827 void SelectionDAG::dump() const {
3828 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
3829 std::vector<const SDNode*> Nodes;
3830 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
3834 std::sort(Nodes.begin(), Nodes.end());
3836 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
3837 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
3838 DumpNodes(Nodes[i], 2, this);
3841 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
3846 const Type *ConstantPoolSDNode::getType() const {
3847 if (isMachineConstantPoolEntry())
3848 return Val.MachineCPVal->getType();
3849 return Val.ConstVal->getType();