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/CodeGen/MachineFrameInfo.h"
23 #include "llvm/Support/MathExtras.h"
24 #include "llvm/Target/MRegisterInfo.h"
25 #include "llvm/Target/TargetData.h"
26 #include "llvm/Target/TargetLowering.h"
27 #include "llvm/Target/TargetInstrInfo.h"
28 #include "llvm/Target/TargetMachine.h"
29 #include "llvm/ADT/SetVector.h"
30 #include "llvm/ADT/SmallPtrSet.h"
31 #include "llvm/ADT/SmallSet.h"
32 #include "llvm/ADT/SmallVector.h"
33 #include "llvm/ADT/StringExtras.h"
38 /// makeVTList - Return an instance of the SDVTList struct initialized with the
39 /// specified members.
40 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
41 SDVTList Res = {VTs, NumVTs};
45 //===----------------------------------------------------------------------===//
46 // ConstantFPSDNode Class
47 //===----------------------------------------------------------------------===//
49 /// isExactlyValue - We don't rely on operator== working on double values, as
50 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
51 /// As such, this method can be used to do an exact bit-for-bit comparison of
52 /// two floating point values.
53 bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const {
54 return Value.bitwiseIsEqual(V);
57 bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT,
59 // convert modifies in place, so make a copy.
60 APFloat Val2 = APFloat(Val);
63 return false; // These can't be represented as floating point!
65 // FIXME rounding mode needs to be more flexible
67 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
68 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
71 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
72 &Val2.getSemantics() == &APFloat::IEEEdouble ||
73 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
75 // TODO: Figure out how to test if we can use a shorter type instead!
83 //===----------------------------------------------------------------------===//
85 //===----------------------------------------------------------------------===//
87 /// isBuildVectorAllOnes - Return true if the specified node is a
88 /// BUILD_VECTOR where all of the elements are ~0 or undef.
89 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
90 // Look through a bit convert.
91 if (N->getOpcode() == ISD::BIT_CONVERT)
92 N = N->getOperand(0).Val;
94 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
96 unsigned i = 0, e = N->getNumOperands();
98 // Skip over all of the undef values.
99 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
102 // Do not accept an all-undef vector.
103 if (i == e) return false;
105 // Do not accept build_vectors that aren't all constants or which have non-~0
107 SDOperand NotZero = N->getOperand(i);
108 if (isa<ConstantSDNode>(NotZero)) {
109 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
111 } else if (isa<ConstantFPSDNode>(NotZero)) {
112 MVT::ValueType VT = NotZero.getValueType();
114 if (((cast<ConstantFPSDNode>(NotZero)->getValueAPF().
115 convertToAPInt().getZExtValue())) != (uint64_t)-1)
118 if ((uint32_t)cast<ConstantFPSDNode>(NotZero)->
119 getValueAPF().convertToAPInt().getZExtValue() !=
126 // Okay, we have at least one ~0 value, check to see if the rest match or are
128 for (++i; i != e; ++i)
129 if (N->getOperand(i) != NotZero &&
130 N->getOperand(i).getOpcode() != ISD::UNDEF)
136 /// isBuildVectorAllZeros - Return true if the specified node is a
137 /// BUILD_VECTOR where all of the elements are 0 or undef.
138 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
139 // Look through a bit convert.
140 if (N->getOpcode() == ISD::BIT_CONVERT)
141 N = N->getOperand(0).Val;
143 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
145 unsigned i = 0, e = N->getNumOperands();
147 // Skip over all of the undef values.
148 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
151 // Do not accept an all-undef vector.
152 if (i == e) return false;
154 // Do not accept build_vectors that aren't all constants or which have non-~0
156 SDOperand Zero = N->getOperand(i);
157 if (isa<ConstantSDNode>(Zero)) {
158 if (!cast<ConstantSDNode>(Zero)->isNullValue())
160 } else if (isa<ConstantFPSDNode>(Zero)) {
161 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
166 // Okay, we have at least one ~0 value, check to see if the rest match or are
168 for (++i; i != e; ++i)
169 if (N->getOperand(i) != Zero &&
170 N->getOperand(i).getOpcode() != ISD::UNDEF)
175 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
176 /// when given the operation for (X op Y).
177 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
178 // To perform this operation, we just need to swap the L and G bits of the
180 unsigned OldL = (Operation >> 2) & 1;
181 unsigned OldG = (Operation >> 1) & 1;
182 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
183 (OldL << 1) | // New G bit
184 (OldG << 2)); // New L bit.
187 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
188 /// 'op' is a valid SetCC operation.
189 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
190 unsigned Operation = Op;
192 Operation ^= 7; // Flip L, G, E bits, but not U.
194 Operation ^= 15; // Flip all of the condition bits.
195 if (Operation > ISD::SETTRUE2)
196 Operation &= ~8; // Don't let N and U bits get set.
197 return ISD::CondCode(Operation);
201 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
202 /// signed operation and 2 if the result is an unsigned comparison. Return zero
203 /// if the operation does not depend on the sign of the input (setne and seteq).
204 static int isSignedOp(ISD::CondCode Opcode) {
206 default: assert(0 && "Illegal integer setcc operation!");
208 case ISD::SETNE: return 0;
212 case ISD::SETGE: return 1;
216 case ISD::SETUGE: return 2;
220 /// getSetCCOrOperation - Return the result of a logical OR between different
221 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
222 /// returns SETCC_INVALID if it is not possible to represent the resultant
224 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
226 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
227 // Cannot fold a signed integer setcc with an unsigned integer setcc.
228 return ISD::SETCC_INVALID;
230 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
232 // If the N and U bits get set then the resultant comparison DOES suddenly
233 // care about orderedness, and is true when ordered.
234 if (Op > ISD::SETTRUE2)
235 Op &= ~16; // Clear the U bit if the N bit is set.
237 // Canonicalize illegal integer setcc's.
238 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
241 return ISD::CondCode(Op);
244 /// getSetCCAndOperation - Return the result of a logical AND between different
245 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
246 /// function returns zero if it is not possible to represent the resultant
248 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
250 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
251 // Cannot fold a signed setcc with an unsigned setcc.
252 return ISD::SETCC_INVALID;
254 // Combine all of the condition bits.
255 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
257 // Canonicalize illegal integer setcc's.
261 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
262 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
263 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
264 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
271 const TargetMachine &SelectionDAG::getTarget() const {
272 return TLI.getTargetMachine();
275 //===----------------------------------------------------------------------===//
276 // SDNode Profile Support
277 //===----------------------------------------------------------------------===//
279 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
281 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
285 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
286 /// solely with their pointer.
287 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
288 ID.AddPointer(VTList.VTs);
291 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
293 static void AddNodeIDOperands(FoldingSetNodeID &ID,
294 const SDOperand *Ops, unsigned NumOps) {
295 for (; NumOps; --NumOps, ++Ops) {
296 ID.AddPointer(Ops->Val);
297 ID.AddInteger(Ops->ResNo);
301 static void AddNodeIDNode(FoldingSetNodeID &ID,
302 unsigned short OpC, SDVTList VTList,
303 const SDOperand *OpList, unsigned N) {
304 AddNodeIDOpcode(ID, OpC);
305 AddNodeIDValueTypes(ID, VTList);
306 AddNodeIDOperands(ID, OpList, N);
309 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
311 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
312 AddNodeIDOpcode(ID, N->getOpcode());
313 // Add the return value info.
314 AddNodeIDValueTypes(ID, N->getVTList());
315 // Add the operand info.
316 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
318 // Handle SDNode leafs with special info.
319 switch (N->getOpcode()) {
320 default: break; // Normal nodes don't need extra info.
321 case ISD::TargetConstant:
323 ID.AddInteger(cast<ConstantSDNode>(N)->getValue());
325 case ISD::TargetConstantFP:
326 case ISD::ConstantFP: {
327 ID.AddAPFloat(cast<ConstantFPSDNode>(N)->getValueAPF());
330 case ISD::TargetGlobalAddress:
331 case ISD::GlobalAddress:
332 case ISD::TargetGlobalTLSAddress:
333 case ISD::GlobalTLSAddress: {
334 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
335 ID.AddPointer(GA->getGlobal());
336 ID.AddInteger(GA->getOffset());
339 case ISD::BasicBlock:
340 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
343 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
345 case ISD::SRCVALUE: {
346 SrcValueSDNode *SV = cast<SrcValueSDNode>(N);
347 ID.AddPointer(SV->getValue());
348 ID.AddInteger(SV->getOffset());
351 case ISD::FrameIndex:
352 case ISD::TargetFrameIndex:
353 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
356 case ISD::TargetJumpTable:
357 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
359 case ISD::ConstantPool:
360 case ISD::TargetConstantPool: {
361 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
362 ID.AddInteger(CP->getAlignment());
363 ID.AddInteger(CP->getOffset());
364 if (CP->isMachineConstantPoolEntry())
365 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
367 ID.AddPointer(CP->getConstVal());
371 LoadSDNode *LD = cast<LoadSDNode>(N);
372 ID.AddInteger(LD->getAddressingMode());
373 ID.AddInteger(LD->getExtensionType());
374 ID.AddInteger((unsigned int)(LD->getLoadedVT()));
375 ID.AddPointer(LD->getSrcValue());
376 ID.AddInteger(LD->getSrcValueOffset());
377 ID.AddInteger(LD->getAlignment());
378 ID.AddInteger(LD->isVolatile());
382 StoreSDNode *ST = cast<StoreSDNode>(N);
383 ID.AddInteger(ST->getAddressingMode());
384 ID.AddInteger(ST->isTruncatingStore());
385 ID.AddInteger((unsigned int)(ST->getStoredVT()));
386 ID.AddPointer(ST->getSrcValue());
387 ID.AddInteger(ST->getSrcValueOffset());
388 ID.AddInteger(ST->getAlignment());
389 ID.AddInteger(ST->isVolatile());
395 //===----------------------------------------------------------------------===//
396 // SelectionDAG Class
397 //===----------------------------------------------------------------------===//
399 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
401 void SelectionDAG::RemoveDeadNodes() {
402 // Create a dummy node (which is not added to allnodes), that adds a reference
403 // to the root node, preventing it from being deleted.
404 HandleSDNode Dummy(getRoot());
406 SmallVector<SDNode*, 128> DeadNodes;
408 // Add all obviously-dead nodes to the DeadNodes worklist.
409 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
411 DeadNodes.push_back(I);
413 // Process the worklist, deleting the nodes and adding their uses to the
415 while (!DeadNodes.empty()) {
416 SDNode *N = DeadNodes.back();
417 DeadNodes.pop_back();
419 // Take the node out of the appropriate CSE map.
420 RemoveNodeFromCSEMaps(N);
422 // Next, brutally remove the operand list. This is safe to do, as there are
423 // no cycles in the graph.
424 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
425 SDNode *Operand = I->Val;
426 Operand->removeUser(N);
428 // Now that we removed this operand, see if there are no uses of it left.
429 if (Operand->use_empty())
430 DeadNodes.push_back(Operand);
432 if (N->OperandsNeedDelete)
433 delete[] N->OperandList;
437 // Finally, remove N itself.
441 // If the root changed (e.g. it was a dead load, update the root).
442 setRoot(Dummy.getValue());
445 void SelectionDAG::RemoveDeadNode(SDNode *N, std::vector<SDNode*> &Deleted) {
446 SmallVector<SDNode*, 16> DeadNodes;
447 DeadNodes.push_back(N);
449 // Process the worklist, deleting the nodes and adding their uses to the
451 while (!DeadNodes.empty()) {
452 SDNode *N = DeadNodes.back();
453 DeadNodes.pop_back();
455 // Take the node out of the appropriate CSE map.
456 RemoveNodeFromCSEMaps(N);
458 // Next, brutally remove the operand list. This is safe to do, as there are
459 // no cycles in the graph.
460 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
461 SDNode *Operand = I->Val;
462 Operand->removeUser(N);
464 // Now that we removed this operand, see if there are no uses of it left.
465 if (Operand->use_empty())
466 DeadNodes.push_back(Operand);
468 if (N->OperandsNeedDelete)
469 delete[] N->OperandList;
473 // Finally, remove N itself.
474 Deleted.push_back(N);
479 void SelectionDAG::DeleteNode(SDNode *N) {
480 assert(N->use_empty() && "Cannot delete a node that is not dead!");
482 // First take this out of the appropriate CSE map.
483 RemoveNodeFromCSEMaps(N);
485 // Finally, remove uses due to operands of this node, remove from the
486 // AllNodes list, and delete the node.
487 DeleteNodeNotInCSEMaps(N);
490 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
492 // Remove it from the AllNodes list.
495 // Drop all of the operands and decrement used nodes use counts.
496 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
497 I->Val->removeUser(N);
498 if (N->OperandsNeedDelete)
499 delete[] N->OperandList;
506 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
507 /// correspond to it. This is useful when we're about to delete or repurpose
508 /// the node. We don't want future request for structurally identical nodes
509 /// to return N anymore.
510 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
512 switch (N->getOpcode()) {
513 case ISD::HANDLENODE: return; // noop.
515 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
518 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
519 "Cond code doesn't exist!");
520 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
521 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
523 case ISD::ExternalSymbol:
524 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
526 case ISD::TargetExternalSymbol:
528 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
531 Erased = ValueTypeNodes[cast<VTSDNode>(N)->getVT()] != 0;
532 ValueTypeNodes[cast<VTSDNode>(N)->getVT()] = 0;
535 // Remove it from the CSE Map.
536 Erased = CSEMap.RemoveNode(N);
540 // Verify that the node was actually in one of the CSE maps, unless it has a
541 // flag result (which cannot be CSE'd) or is one of the special cases that are
542 // not subject to CSE.
543 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
544 !N->isTargetOpcode()) {
547 assert(0 && "Node is not in map!");
552 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
553 /// has been taken out and modified in some way. If the specified node already
554 /// exists in the CSE maps, do not modify the maps, but return the existing node
555 /// instead. If it doesn't exist, add it and return null.
557 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
558 assert(N->getNumOperands() && "This is a leaf node!");
559 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
560 return 0; // Never add these nodes.
562 // Check that remaining values produced are not flags.
563 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
564 if (N->getValueType(i) == MVT::Flag)
565 return 0; // Never CSE anything that produces a flag.
567 SDNode *New = CSEMap.GetOrInsertNode(N);
568 if (New != N) return New; // Node already existed.
572 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
573 /// were replaced with those specified. If this node is never memoized,
574 /// return null, otherwise return a pointer to the slot it would take. If a
575 /// node already exists with these operands, the slot will be non-null.
576 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
578 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
579 return 0; // Never add these nodes.
581 // Check that remaining values produced are not flags.
582 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
583 if (N->getValueType(i) == MVT::Flag)
584 return 0; // Never CSE anything that produces a flag.
586 SDOperand Ops[] = { Op };
588 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
589 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
592 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
593 /// were replaced with those specified. If this node is never memoized,
594 /// return null, otherwise return a pointer to the slot it would take. If a
595 /// node already exists with these operands, the slot will be non-null.
596 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
597 SDOperand Op1, SDOperand Op2,
599 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
600 return 0; // Never add these nodes.
602 // Check that remaining values produced are not flags.
603 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
604 if (N->getValueType(i) == MVT::Flag)
605 return 0; // Never CSE anything that produces a flag.
607 SDOperand Ops[] = { Op1, Op2 };
609 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
610 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
614 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
615 /// were replaced with those specified. If this node is never memoized,
616 /// return null, otherwise return a pointer to the slot it would take. If a
617 /// node already exists with these operands, the slot will be non-null.
618 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
619 const SDOperand *Ops,unsigned NumOps,
621 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
622 return 0; // Never add these nodes.
624 // Check that remaining values produced are not flags.
625 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
626 if (N->getValueType(i) == MVT::Flag)
627 return 0; // Never CSE anything that produces a flag.
630 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
632 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
633 ID.AddInteger(LD->getAddressingMode());
634 ID.AddInteger(LD->getExtensionType());
635 ID.AddInteger((unsigned int)(LD->getLoadedVT()));
636 ID.AddPointer(LD->getSrcValue());
637 ID.AddInteger(LD->getSrcValueOffset());
638 ID.AddInteger(LD->getAlignment());
639 ID.AddInteger(LD->isVolatile());
640 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
641 ID.AddInteger(ST->getAddressingMode());
642 ID.AddInteger(ST->isTruncatingStore());
643 ID.AddInteger((unsigned int)(ST->getStoredVT()));
644 ID.AddPointer(ST->getSrcValue());
645 ID.AddInteger(ST->getSrcValueOffset());
646 ID.AddInteger(ST->getAlignment());
647 ID.AddInteger(ST->isVolatile());
650 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
654 SelectionDAG::~SelectionDAG() {
655 while (!AllNodes.empty()) {
656 SDNode *N = AllNodes.begin();
657 N->SetNextInBucket(0);
658 if (N->OperandsNeedDelete)
659 delete [] N->OperandList;
662 AllNodes.pop_front();
666 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
667 if (Op.getValueType() == VT) return Op;
668 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
669 return getNode(ISD::AND, Op.getValueType(), Op,
670 getConstant(Imm, Op.getValueType()));
673 SDOperand SelectionDAG::getString(const std::string &Val) {
674 StringSDNode *&N = StringNodes[Val];
676 N = new StringSDNode(Val);
677 AllNodes.push_back(N);
679 return SDOperand(N, 0);
682 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
683 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
684 assert(!MVT::isVector(VT) && "Cannot create Vector ConstantSDNodes!");
686 // Mask out any bits that are not valid for this constant.
687 Val &= MVT::getIntVTBitMask(VT);
689 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
691 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
694 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
695 return SDOperand(E, 0);
696 SDNode *N = new ConstantSDNode(isT, Val, VT);
697 CSEMap.InsertNode(N, IP);
698 AllNodes.push_back(N);
699 return SDOperand(N, 0);
702 SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
704 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
706 MVT::ValueType EltVT =
707 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
709 // Do the map lookup using the actual bit pattern for the floating point
710 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
711 // we don't have issues with SNANs.
712 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
714 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
718 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
719 if (!MVT::isVector(VT))
720 return SDOperand(N, 0);
722 N = new ConstantFPSDNode(isTarget, V, EltVT);
723 CSEMap.InsertNode(N, IP);
724 AllNodes.push_back(N);
727 SDOperand Result(N, 0);
728 if (MVT::isVector(VT)) {
729 SmallVector<SDOperand, 8> Ops;
730 Ops.assign(MVT::getVectorNumElements(VT), Result);
731 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
736 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
738 MVT::ValueType EltVT =
739 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
741 return getConstantFP(APFloat((float)Val), VT, isTarget);
743 return getConstantFP(APFloat(Val), VT, isTarget);
746 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
747 MVT::ValueType VT, int Offset,
749 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
751 if (GVar && GVar->isThreadLocal())
752 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
754 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
756 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
758 ID.AddInteger(Offset);
760 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
761 return SDOperand(E, 0);
762 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
763 CSEMap.InsertNode(N, IP);
764 AllNodes.push_back(N);
765 return SDOperand(N, 0);
768 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
770 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
772 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
775 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
776 return SDOperand(E, 0);
777 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
778 CSEMap.InsertNode(N, IP);
779 AllNodes.push_back(N);
780 return SDOperand(N, 0);
783 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
784 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
786 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
789 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
790 return SDOperand(E, 0);
791 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
792 CSEMap.InsertNode(N, IP);
793 AllNodes.push_back(N);
794 return SDOperand(N, 0);
797 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
798 unsigned Alignment, int Offset,
800 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
802 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
803 ID.AddInteger(Alignment);
804 ID.AddInteger(Offset);
807 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
808 return SDOperand(E, 0);
809 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
810 CSEMap.InsertNode(N, IP);
811 AllNodes.push_back(N);
812 return SDOperand(N, 0);
816 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
818 unsigned Alignment, int Offset,
820 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
822 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
823 ID.AddInteger(Alignment);
824 ID.AddInteger(Offset);
825 C->AddSelectionDAGCSEId(ID);
827 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
828 return SDOperand(E, 0);
829 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
830 CSEMap.InsertNode(N, IP);
831 AllNodes.push_back(N);
832 return SDOperand(N, 0);
836 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
838 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
841 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
842 return SDOperand(E, 0);
843 SDNode *N = new BasicBlockSDNode(MBB);
844 CSEMap.InsertNode(N, IP);
845 AllNodes.push_back(N);
846 return SDOperand(N, 0);
849 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
850 assert(!MVT::isExtendedVT(VT) && "Expecting a simple value type!");
851 if ((unsigned)VT >= ValueTypeNodes.size())
852 ValueTypeNodes.resize(VT+1);
853 if (ValueTypeNodes[VT] == 0) {
854 ValueTypeNodes[VT] = new VTSDNode(VT);
855 AllNodes.push_back(ValueTypeNodes[VT]);
858 return SDOperand(ValueTypeNodes[VT], 0);
861 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
862 SDNode *&N = ExternalSymbols[Sym];
863 if (N) return SDOperand(N, 0);
864 N = new ExternalSymbolSDNode(false, Sym, VT);
865 AllNodes.push_back(N);
866 return SDOperand(N, 0);
869 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
871 SDNode *&N = TargetExternalSymbols[Sym];
872 if (N) return SDOperand(N, 0);
873 N = new ExternalSymbolSDNode(true, Sym, VT);
874 AllNodes.push_back(N);
875 return SDOperand(N, 0);
878 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
879 if ((unsigned)Cond >= CondCodeNodes.size())
880 CondCodeNodes.resize(Cond+1);
882 if (CondCodeNodes[Cond] == 0) {
883 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
884 AllNodes.push_back(CondCodeNodes[Cond]);
886 return SDOperand(CondCodeNodes[Cond], 0);
889 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
891 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
892 ID.AddInteger(RegNo);
894 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
895 return SDOperand(E, 0);
896 SDNode *N = new RegisterSDNode(RegNo, VT);
897 CSEMap.InsertNode(N, IP);
898 AllNodes.push_back(N);
899 return SDOperand(N, 0);
902 SDOperand SelectionDAG::getSrcValue(const Value *V, int Offset) {
903 assert((!V || isa<PointerType>(V->getType())) &&
904 "SrcValue is not a pointer?");
907 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
909 ID.AddInteger(Offset);
911 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
912 return SDOperand(E, 0);
913 SDNode *N = new SrcValueSDNode(V, Offset);
914 CSEMap.InsertNode(N, IP);
915 AllNodes.push_back(N);
916 return SDOperand(N, 0);
919 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
920 /// specified value type.
921 SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) {
922 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
923 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
924 const Type *Ty = MVT::getTypeForValueType(VT);
925 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty);
926 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign);
927 return getFrameIndex(FrameIdx, TLI.getPointerTy());
931 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
932 SDOperand N2, ISD::CondCode Cond) {
933 // These setcc operations always fold.
937 case ISD::SETFALSE2: return getConstant(0, VT);
939 case ISD::SETTRUE2: return getConstant(1, VT);
951 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
955 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
956 uint64_t C2 = N2C->getValue();
957 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
958 uint64_t C1 = N1C->getValue();
960 // Sign extend the operands if required
961 if (ISD::isSignedIntSetCC(Cond)) {
962 C1 = N1C->getSignExtended();
963 C2 = N2C->getSignExtended();
967 default: assert(0 && "Unknown integer setcc!");
968 case ISD::SETEQ: return getConstant(C1 == C2, VT);
969 case ISD::SETNE: return getConstant(C1 != C2, VT);
970 case ISD::SETULT: return getConstant(C1 < C2, VT);
971 case ISD::SETUGT: return getConstant(C1 > C2, VT);
972 case ISD::SETULE: return getConstant(C1 <= C2, VT);
973 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
974 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
975 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
976 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
977 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
981 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val))
982 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
983 // No compile time operations on this type yet.
984 if (N1C->getValueType(0) == MVT::ppcf128)
987 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
990 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
991 return getNode(ISD::UNDEF, VT);
993 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
994 case ISD::SETNE: if (R==APFloat::cmpUnordered)
995 return getNode(ISD::UNDEF, VT);
997 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
998 R==APFloat::cmpLessThan, VT);
999 case ISD::SETLT: if (R==APFloat::cmpUnordered)
1000 return getNode(ISD::UNDEF, VT);
1002 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1003 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1004 return getNode(ISD::UNDEF, VT);
1006 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1007 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1008 return getNode(ISD::UNDEF, VT);
1010 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
1011 R==APFloat::cmpEqual, VT);
1012 case ISD::SETGE: if (R==APFloat::cmpUnordered)
1013 return getNode(ISD::UNDEF, VT);
1015 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
1016 R==APFloat::cmpEqual, VT);
1017 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1018 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1019 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1020 R==APFloat::cmpEqual, VT);
1021 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1022 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1023 R==APFloat::cmpLessThan, VT);
1024 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1025 R==APFloat::cmpUnordered, VT);
1026 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1027 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
1030 // Ensure that the constant occurs on the RHS.
1031 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1034 // Could not fold it.
1038 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1039 /// this predicate to simplify operations downstream. Mask is known to be zero
1040 /// for bits that V cannot have.
1041 bool SelectionDAG::MaskedValueIsZero(SDOperand Op, uint64_t Mask,
1042 unsigned Depth) const {
1043 // The masks are not wide enough to represent this type! Should use APInt.
1044 if (Op.getValueType() == MVT::i128)
1047 uint64_t KnownZero, KnownOne;
1048 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1049 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1050 return (KnownZero & Mask) == Mask;
1053 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
1054 /// known to be either zero or one and return them in the KnownZero/KnownOne
1055 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1057 void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask,
1058 uint64_t &KnownZero, uint64_t &KnownOne,
1059 unsigned Depth) const {
1060 KnownZero = KnownOne = 0; // Don't know anything.
1061 if (Depth == 6 || Mask == 0)
1062 return; // Limit search depth.
1064 // The masks are not wide enough to represent this type! Should use APInt.
1065 if (Op.getValueType() == MVT::i128)
1068 uint64_t KnownZero2, KnownOne2;
1070 switch (Op.getOpcode()) {
1072 // We know all of the bits for a constant!
1073 KnownOne = cast<ConstantSDNode>(Op)->getValue() & Mask;
1074 KnownZero = ~KnownOne & Mask;
1077 // If either the LHS or the RHS are Zero, the result is zero.
1078 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1080 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1081 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1082 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1084 // Output known-1 bits are only known if set in both the LHS & RHS.
1085 KnownOne &= KnownOne2;
1086 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1087 KnownZero |= KnownZero2;
1090 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1092 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1093 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1094 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1096 // Output known-0 bits are only known if clear in both the LHS & RHS.
1097 KnownZero &= KnownZero2;
1098 // Output known-1 are known to be set if set in either the LHS | RHS.
1099 KnownOne |= KnownOne2;
1102 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1103 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1104 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1105 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1107 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1108 uint64_t KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1109 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1110 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1111 KnownZero = KnownZeroOut;
1115 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1116 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1117 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1118 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1120 // Only known if known in both the LHS and RHS.
1121 KnownOne &= KnownOne2;
1122 KnownZero &= KnownZero2;
1124 case ISD::SELECT_CC:
1125 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1126 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1127 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1128 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1130 // Only known if known in both the LHS and RHS.
1131 KnownOne &= KnownOne2;
1132 KnownZero &= KnownZero2;
1135 // If we know the result of a setcc has the top bits zero, use this info.
1136 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult)
1137 KnownZero |= (MVT::getIntVTBitMask(Op.getValueType()) ^ 1ULL);
1140 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1141 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1142 ComputeMaskedBits(Op.getOperand(0), Mask >> SA->getValue(),
1143 KnownZero, KnownOne, Depth+1);
1144 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1145 KnownZero <<= SA->getValue();
1146 KnownOne <<= SA->getValue();
1147 KnownZero |= (1ULL << SA->getValue())-1; // low bits known zero.
1151 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1152 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1153 MVT::ValueType VT = Op.getValueType();
1154 unsigned ShAmt = SA->getValue();
1156 uint64_t TypeMask = MVT::getIntVTBitMask(VT);
1157 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt) & TypeMask,
1158 KnownZero, KnownOne, Depth+1);
1159 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1160 KnownZero &= TypeMask;
1161 KnownOne &= TypeMask;
1162 KnownZero >>= ShAmt;
1165 uint64_t HighBits = (1ULL << ShAmt)-1;
1166 HighBits <<= MVT::getSizeInBits(VT)-ShAmt;
1167 KnownZero |= HighBits; // High bits known zero.
1171 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1172 MVT::ValueType VT = Op.getValueType();
1173 unsigned ShAmt = SA->getValue();
1175 // Compute the new bits that are at the top now.
1176 uint64_t TypeMask = MVT::getIntVTBitMask(VT);
1178 uint64_t InDemandedMask = (Mask << ShAmt) & TypeMask;
1179 // If any of the demanded bits are produced by the sign extension, we also
1180 // demand the input sign bit.
1181 uint64_t HighBits = (1ULL << ShAmt)-1;
1182 HighBits <<= MVT::getSizeInBits(VT) - ShAmt;
1183 if (HighBits & Mask)
1184 InDemandedMask |= MVT::getIntVTSignBit(VT);
1186 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1188 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1189 KnownZero &= TypeMask;
1190 KnownOne &= TypeMask;
1191 KnownZero >>= ShAmt;
1194 // Handle the sign bits.
1195 uint64_t SignBit = MVT::getIntVTSignBit(VT);
1196 SignBit >>= ShAmt; // Adjust to where it is now in the mask.
1198 if (KnownZero & SignBit) {
1199 KnownZero |= HighBits; // New bits are known zero.
1200 } else if (KnownOne & SignBit) {
1201 KnownOne |= HighBits; // New bits are known one.
1205 case ISD::SIGN_EXTEND_INREG: {
1206 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1208 // Sign extension. Compute the demanded bits in the result that are not
1209 // present in the input.
1210 uint64_t NewBits = ~MVT::getIntVTBitMask(EVT) & Mask;
1212 uint64_t InSignBit = MVT::getIntVTSignBit(EVT);
1213 int64_t InputDemandedBits = Mask & MVT::getIntVTBitMask(EVT);
1215 // If the sign extended bits are demanded, we know that the sign
1218 InputDemandedBits |= InSignBit;
1220 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1221 KnownZero, KnownOne, Depth+1);
1222 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1224 // If the sign bit of the input is known set or clear, then we know the
1225 // top bits of the result.
1226 if (KnownZero & InSignBit) { // Input sign bit known clear
1227 KnownZero |= NewBits;
1228 KnownOne &= ~NewBits;
1229 } else if (KnownOne & InSignBit) { // Input sign bit known set
1230 KnownOne |= NewBits;
1231 KnownZero &= ~NewBits;
1232 } else { // Input sign bit unknown
1233 KnownZero &= ~NewBits;
1234 KnownOne &= ~NewBits;
1241 MVT::ValueType VT = Op.getValueType();
1242 unsigned LowBits = Log2_32(MVT::getSizeInBits(VT))+1;
1243 KnownZero = ~((1ULL << LowBits)-1) & MVT::getIntVTBitMask(VT);
1248 if (ISD::isZEXTLoad(Op.Val)) {
1249 LoadSDNode *LD = cast<LoadSDNode>(Op);
1250 MVT::ValueType VT = LD->getLoadedVT();
1251 KnownZero |= ~MVT::getIntVTBitMask(VT) & Mask;
1255 case ISD::ZERO_EXTEND: {
1256 uint64_t InMask = MVT::getIntVTBitMask(Op.getOperand(0).getValueType());
1257 uint64_t NewBits = (~InMask) & Mask;
1258 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1260 KnownZero |= NewBits & Mask;
1261 KnownOne &= ~NewBits;
1264 case ISD::SIGN_EXTEND: {
1265 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1266 unsigned InBits = MVT::getSizeInBits(InVT);
1267 uint64_t InMask = MVT::getIntVTBitMask(InVT);
1268 uint64_t InSignBit = 1ULL << (InBits-1);
1269 uint64_t NewBits = (~InMask) & Mask;
1270 uint64_t InDemandedBits = Mask & InMask;
1272 // If any of the sign extended bits are demanded, we know that the sign
1275 InDemandedBits |= InSignBit;
1277 ComputeMaskedBits(Op.getOperand(0), InDemandedBits, KnownZero,
1279 // If the sign bit is known zero or one, the top bits match.
1280 if (KnownZero & InSignBit) {
1281 KnownZero |= NewBits;
1282 KnownOne &= ~NewBits;
1283 } else if (KnownOne & InSignBit) {
1284 KnownOne |= NewBits;
1285 KnownZero &= ~NewBits;
1286 } else { // Otherwise, top bits aren't known.
1287 KnownOne &= ~NewBits;
1288 KnownZero &= ~NewBits;
1292 case ISD::ANY_EXTEND: {
1293 MVT::ValueType VT = Op.getOperand(0).getValueType();
1294 ComputeMaskedBits(Op.getOperand(0), Mask & MVT::getIntVTBitMask(VT),
1295 KnownZero, KnownOne, Depth+1);
1298 case ISD::TRUNCATE: {
1299 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1300 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1301 uint64_t OutMask = MVT::getIntVTBitMask(Op.getValueType());
1302 KnownZero &= OutMask;
1303 KnownOne &= OutMask;
1306 case ISD::AssertZext: {
1307 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1308 uint64_t InMask = MVT::getIntVTBitMask(VT);
1309 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1311 KnownZero |= (~InMask) & Mask;
1315 // If either the LHS or the RHS are Zero, the result is zero.
1316 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1317 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1318 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1319 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1321 // Output known-0 bits are known if clear or set in both the low clear bits
1322 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1323 // low 3 bits clear.
1324 uint64_t KnownZeroOut = std::min(CountTrailingZeros_64(~KnownZero),
1325 CountTrailingZeros_64(~KnownZero2));
1327 KnownZero = (1ULL << KnownZeroOut) - 1;
1332 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1335 // We know that the top bits of C-X are clear if X contains less bits
1336 // than C (i.e. no wrap-around can happen). For example, 20-X is
1337 // positive if we can prove that X is >= 0 and < 16.
1338 MVT::ValueType VT = CLHS->getValueType(0);
1339 if ((CLHS->getValue() & MVT::getIntVTSignBit(VT)) == 0) { // sign bit clear
1340 unsigned NLZ = CountLeadingZeros_64(CLHS->getValue()+1);
1341 uint64_t MaskV = (1ULL << (63-NLZ))-1; // NLZ can't be 64 with no sign bit
1342 MaskV = ~MaskV & MVT::getIntVTBitMask(VT);
1343 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1);
1345 // If all of the MaskV bits are known to be zero, then we know the output
1346 // top bits are zero, because we now know that the output is from [0-C].
1347 if ((KnownZero & MaskV) == MaskV) {
1348 unsigned NLZ2 = CountLeadingZeros_64(CLHS->getValue());
1349 KnownZero = ~((1ULL << (64-NLZ2))-1) & Mask; // Top bits known zero.
1350 KnownOne = 0; // No one bits known.
1352 KnownZero = KnownOne = 0; // Otherwise, nothing known.
1358 // Allow the target to implement this method for its nodes.
1359 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1360 case ISD::INTRINSIC_WO_CHAIN:
1361 case ISD::INTRINSIC_W_CHAIN:
1362 case ISD::INTRINSIC_VOID:
1363 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1369 /// ComputeNumSignBits - Return the number of times the sign bit of the
1370 /// register is replicated into the other bits. We know that at least 1 bit
1371 /// is always equal to the sign bit (itself), but other cases can give us
1372 /// information. For example, immediately after an "SRA X, 2", we know that
1373 /// the top 3 bits are all equal to each other, so we return 3.
1374 unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1375 MVT::ValueType VT = Op.getValueType();
1376 assert(MVT::isInteger(VT) && "Invalid VT!");
1377 unsigned VTBits = MVT::getSizeInBits(VT);
1381 return 1; // Limit search depth.
1383 switch (Op.getOpcode()) {
1385 case ISD::AssertSext:
1386 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1387 return VTBits-Tmp+1;
1388 case ISD::AssertZext:
1389 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1392 case ISD::Constant: {
1393 uint64_t Val = cast<ConstantSDNode>(Op)->getValue();
1394 // If negative, invert the bits, then look at it.
1395 if (Val & MVT::getIntVTSignBit(VT))
1398 // Shift the bits so they are the leading bits in the int64_t.
1401 // Return # leading zeros. We use 'min' here in case Val was zero before
1402 // shifting. We don't want to return '64' as for an i32 "0".
1403 return std::min(VTBits, CountLeadingZeros_64(Val));
1406 case ISD::SIGN_EXTEND:
1407 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1408 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1410 case ISD::SIGN_EXTEND_INREG:
1411 // Max of the input and what this extends.
1412 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1415 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1416 return std::max(Tmp, Tmp2);
1419 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1420 // SRA X, C -> adds C sign bits.
1421 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1422 Tmp += C->getValue();
1423 if (Tmp > VTBits) Tmp = VTBits;
1427 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1428 // shl destroys sign bits.
1429 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1430 if (C->getValue() >= VTBits || // Bad shift.
1431 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1432 return Tmp - C->getValue();
1437 case ISD::XOR: // NOT is handled here.
1438 // Logical binary ops preserve the number of sign bits.
1439 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1440 if (Tmp == 1) return 1; // Early out.
1441 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1442 return std::min(Tmp, Tmp2);
1445 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1446 if (Tmp == 1) return 1; // Early out.
1447 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1448 return std::min(Tmp, Tmp2);
1451 // If setcc returns 0/-1, all bits are sign bits.
1452 if (TLI.getSetCCResultContents() ==
1453 TargetLowering::ZeroOrNegativeOneSetCCResult)
1458 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1459 unsigned RotAmt = C->getValue() & (VTBits-1);
1461 // Handle rotate right by N like a rotate left by 32-N.
1462 if (Op.getOpcode() == ISD::ROTR)
1463 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1465 // If we aren't rotating out all of the known-in sign bits, return the
1466 // number that are left. This handles rotl(sext(x), 1) for example.
1467 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1468 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1472 // Add can have at most one carry bit. Thus we know that the output
1473 // is, at worst, one more bit than the inputs.
1474 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1475 if (Tmp == 1) return 1; // Early out.
1477 // Special case decrementing a value (ADD X, -1):
1478 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1479 if (CRHS->isAllOnesValue()) {
1480 uint64_t KnownZero, KnownOne;
1481 uint64_t Mask = MVT::getIntVTBitMask(VT);
1482 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1484 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1486 if ((KnownZero|1) == Mask)
1489 // If we are subtracting one from a positive number, there is no carry
1490 // out of the result.
1491 if (KnownZero & MVT::getIntVTSignBit(VT))
1495 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1496 if (Tmp2 == 1) return 1;
1497 return std::min(Tmp, Tmp2)-1;
1501 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1502 if (Tmp2 == 1) return 1;
1505 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1506 if (CLHS->getValue() == 0) {
1507 uint64_t KnownZero, KnownOne;
1508 uint64_t Mask = MVT::getIntVTBitMask(VT);
1509 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1510 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1512 if ((KnownZero|1) == Mask)
1515 // If the input is known to be positive (the sign bit is known clear),
1516 // the output of the NEG has the same number of sign bits as the input.
1517 if (KnownZero & MVT::getIntVTSignBit(VT))
1520 // Otherwise, we treat this like a SUB.
1523 // Sub can have at most one carry bit. Thus we know that the output
1524 // is, at worst, one more bit than the inputs.
1525 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1526 if (Tmp == 1) return 1; // Early out.
1527 return std::min(Tmp, Tmp2)-1;
1530 // FIXME: it's tricky to do anything useful for this, but it is an important
1531 // case for targets like X86.
1535 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1536 if (Op.getOpcode() == ISD::LOAD) {
1537 LoadSDNode *LD = cast<LoadSDNode>(Op);
1538 unsigned ExtType = LD->getExtensionType();
1541 case ISD::SEXTLOAD: // '17' bits known
1542 Tmp = MVT::getSizeInBits(LD->getLoadedVT());
1543 return VTBits-Tmp+1;
1544 case ISD::ZEXTLOAD: // '16' bits known
1545 Tmp = MVT::getSizeInBits(LD->getLoadedVT());
1550 // Allow the target to implement this method for its nodes.
1551 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1552 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1553 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1554 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1555 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1556 if (NumBits > 1) return NumBits;
1559 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1560 // use this information.
1561 uint64_t KnownZero, KnownOne;
1562 uint64_t Mask = MVT::getIntVTBitMask(VT);
1563 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1565 uint64_t SignBit = MVT::getIntVTSignBit(VT);
1566 if (KnownZero & SignBit) { // SignBit is 0
1568 } else if (KnownOne & SignBit) { // SignBit is 1;
1575 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1576 // the number of identical bits in the top of the input value.
1579 // Return # leading zeros. We use 'min' here in case Val was zero before
1580 // shifting. We don't want to return '64' as for an i32 "0".
1581 return std::min(VTBits, CountLeadingZeros_64(Mask));
1585 /// getNode - Gets or creates the specified node.
1587 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1588 FoldingSetNodeID ID;
1589 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
1591 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1592 return SDOperand(E, 0);
1593 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
1594 CSEMap.InsertNode(N, IP);
1596 AllNodes.push_back(N);
1597 return SDOperand(N, 0);
1600 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1601 SDOperand Operand) {
1603 // Constant fold unary operations with an integer constant operand.
1604 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1605 uint64_t Val = C->getValue();
1608 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1609 case ISD::ANY_EXTEND:
1610 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1611 case ISD::TRUNCATE: return getConstant(Val, VT);
1612 case ISD::UINT_TO_FP:
1613 case ISD::SINT_TO_FP: {
1614 const uint64_t zero[] = {0, 0};
1615 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero));
1616 (void)apf.convertFromZeroExtendedInteger(&Val,
1617 MVT::getSizeInBits(Operand.getValueType()),
1618 Opcode==ISD::SINT_TO_FP,
1619 APFloat::rmNearestTiesToEven);
1620 return getConstantFP(apf, VT);
1622 case ISD::BIT_CONVERT:
1623 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1624 return getConstantFP(BitsToFloat(Val), VT);
1625 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1626 return getConstantFP(BitsToDouble(Val), VT);
1630 default: assert(0 && "Invalid bswap!"); break;
1631 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1632 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1633 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1638 default: assert(0 && "Invalid ctpop!"); break;
1639 case MVT::i1: return getConstant(Val != 0, VT);
1641 Tmp1 = (unsigned)Val & 0xFF;
1642 return getConstant(CountPopulation_32(Tmp1), VT);
1644 Tmp1 = (unsigned)Val & 0xFFFF;
1645 return getConstant(CountPopulation_32(Tmp1), VT);
1647 return getConstant(CountPopulation_32((unsigned)Val), VT);
1649 return getConstant(CountPopulation_64(Val), VT);
1653 default: assert(0 && "Invalid ctlz!"); break;
1654 case MVT::i1: return getConstant(Val == 0, VT);
1656 Tmp1 = (unsigned)Val & 0xFF;
1657 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1659 Tmp1 = (unsigned)Val & 0xFFFF;
1660 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1662 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1664 return getConstant(CountLeadingZeros_64(Val), VT);
1668 default: assert(0 && "Invalid cttz!"); break;
1669 case MVT::i1: return getConstant(Val == 0, VT);
1671 Tmp1 = (unsigned)Val | 0x100;
1672 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1674 Tmp1 = (unsigned)Val | 0x10000;
1675 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1677 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1679 return getConstant(CountTrailingZeros_64(Val), VT);
1684 // Constant fold unary operations with a floating point constant operand.
1685 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1686 APFloat V = C->getValueAPF(); // make copy
1690 return getConstantFP(V, VT);
1693 return getConstantFP(V, VT);
1695 case ISD::FP_EXTEND:
1696 // This can return overflow, underflow, or inexact; we don't care.
1697 // FIXME need to be more flexible about rounding mode.
1698 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle :
1699 VT==MVT::f64 ? APFloat::IEEEdouble :
1700 VT==MVT::f80 ? APFloat::x87DoubleExtended :
1701 VT==MVT::f128 ? APFloat::IEEEquad :
1703 APFloat::rmNearestTiesToEven);
1704 return getConstantFP(V, VT);
1705 case ISD::FP_TO_SINT:
1706 case ISD::FP_TO_UINT: {
1708 assert(integerPartWidth >= 64);
1709 // FIXME need to be more flexible about rounding mode.
1710 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1711 Opcode==ISD::FP_TO_SINT,
1712 APFloat::rmTowardZero);
1713 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1715 return getConstant(x, VT);
1717 case ISD::BIT_CONVERT:
1718 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1719 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1720 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1721 return getConstant(V.convertToAPInt().getZExtValue(), VT);
1726 unsigned OpOpcode = Operand.Val->getOpcode();
1728 case ISD::TokenFactor:
1729 return Operand; // Factor of one node? No factor.
1731 case ISD::FP_EXTEND:
1732 assert(MVT::isFloatingPoint(VT) &&
1733 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1735 case ISD::SIGN_EXTEND:
1736 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1737 "Invalid SIGN_EXTEND!");
1738 if (Operand.getValueType() == VT) return Operand; // noop extension
1739 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1740 && "Invalid sext node, dst < src!");
1741 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1742 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1744 case ISD::ZERO_EXTEND:
1745 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1746 "Invalid ZERO_EXTEND!");
1747 if (Operand.getValueType() == VT) return Operand; // noop extension
1748 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1749 && "Invalid zext node, dst < src!");
1750 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1751 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1753 case ISD::ANY_EXTEND:
1754 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1755 "Invalid ANY_EXTEND!");
1756 if (Operand.getValueType() == VT) return Operand; // noop extension
1757 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1758 && "Invalid anyext node, dst < src!");
1759 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1760 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1761 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1764 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1765 "Invalid TRUNCATE!");
1766 if (Operand.getValueType() == VT) return Operand; // noop truncate
1767 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT)
1768 && "Invalid truncate node, src < dst!");
1769 if (OpOpcode == ISD::TRUNCATE)
1770 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1771 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1772 OpOpcode == ISD::ANY_EXTEND) {
1773 // If the source is smaller than the dest, we still need an extend.
1774 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1775 < MVT::getSizeInBits(VT))
1776 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1777 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1778 > MVT::getSizeInBits(VT))
1779 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1781 return Operand.Val->getOperand(0);
1784 case ISD::BIT_CONVERT:
1785 // Basic sanity checking.
1786 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1787 && "Cannot BIT_CONVERT between types of different sizes!");
1788 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1789 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1790 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1791 if (OpOpcode == ISD::UNDEF)
1792 return getNode(ISD::UNDEF, VT);
1794 case ISD::SCALAR_TO_VECTOR:
1795 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1796 MVT::getVectorElementType(VT) == Operand.getValueType() &&
1797 "Illegal SCALAR_TO_VECTOR node!");
1800 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1801 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1802 Operand.Val->getOperand(0));
1803 if (OpOpcode == ISD::FNEG) // --X -> X
1804 return Operand.Val->getOperand(0);
1807 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1808 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1813 SDVTList VTs = getVTList(VT);
1814 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1815 FoldingSetNodeID ID;
1816 SDOperand Ops[1] = { Operand };
1817 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1819 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1820 return SDOperand(E, 0);
1821 N = new UnarySDNode(Opcode, VTs, Operand);
1822 CSEMap.InsertNode(N, IP);
1824 N = new UnarySDNode(Opcode, VTs, Operand);
1826 AllNodes.push_back(N);
1827 return SDOperand(N, 0);
1832 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1833 SDOperand N1, SDOperand N2) {
1836 case ISD::TokenFactor:
1837 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1838 N2.getValueType() == MVT::Other && "Invalid token factor!");
1847 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1854 assert(MVT::isInteger(N1.getValueType()) && "Should use F* for FP ops");
1861 assert(N1.getValueType() == N2.getValueType() &&
1862 N1.getValueType() == VT && "Binary operator types must match!");
1864 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1865 assert(N1.getValueType() == VT &&
1866 MVT::isFloatingPoint(N1.getValueType()) &&
1867 MVT::isFloatingPoint(N2.getValueType()) &&
1868 "Invalid FCOPYSIGN!");
1875 assert(VT == N1.getValueType() &&
1876 "Shift operators return type must be the same as their first arg");
1877 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1878 VT != MVT::i1 && "Shifts only work on integers");
1880 case ISD::FP_ROUND_INREG: {
1881 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1882 assert(VT == N1.getValueType() && "Not an inreg round!");
1883 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
1884 "Cannot FP_ROUND_INREG integer types");
1885 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
1886 "Not rounding down!");
1889 case ISD::AssertSext:
1890 case ISD::AssertZext:
1891 case ISD::SIGN_EXTEND_INREG: {
1892 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1893 assert(VT == N1.getValueType() && "Not an inreg extend!");
1894 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
1895 "Cannot *_EXTEND_INREG FP types");
1896 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
1904 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1905 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1907 if (Opcode == ISD::SIGN_EXTEND_INREG) {
1908 int64_t Val = N1C->getValue();
1909 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
1910 Val <<= 64-FromBits;
1911 Val >>= 64-FromBits;
1912 return getConstant(Val, VT);
1916 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
1918 case ISD::ADD: return getConstant(C1 + C2, VT);
1919 case ISD::SUB: return getConstant(C1 - C2, VT);
1920 case ISD::MUL: return getConstant(C1 * C2, VT);
1922 if (C2) return getConstant(C1 / C2, VT);
1925 if (C2) return getConstant(C1 % C2, VT);
1928 if (C2) return getConstant(N1C->getSignExtended() /
1929 N2C->getSignExtended(), VT);
1932 if (C2) return getConstant(N1C->getSignExtended() %
1933 N2C->getSignExtended(), VT);
1935 case ISD::AND : return getConstant(C1 & C2, VT);
1936 case ISD::OR : return getConstant(C1 | C2, VT);
1937 case ISD::XOR : return getConstant(C1 ^ C2, VT);
1938 case ISD::SHL : return getConstant(C1 << C2, VT);
1939 case ISD::SRL : return getConstant(C1 >> C2, VT);
1940 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
1942 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
1945 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
1949 } else { // Cannonicalize constant to RHS if commutative
1950 if (isCommutativeBinOp(Opcode)) {
1951 std::swap(N1C, N2C);
1957 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
1958 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
1961 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
1962 APFloat::opStatus s;
1965 s = V1.add(V2, APFloat::rmNearestTiesToEven);
1966 if (s!=APFloat::opInvalidOp)
1967 return getConstantFP(V1, VT);
1970 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
1971 if (s!=APFloat::opInvalidOp)
1972 return getConstantFP(V1, VT);
1975 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
1976 if (s!=APFloat::opInvalidOp)
1977 return getConstantFP(V1, VT);
1980 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
1981 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
1982 return getConstantFP(V1, VT);
1985 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
1986 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
1987 return getConstantFP(V1, VT);
1989 case ISD::FCOPYSIGN:
1991 return getConstantFP(V1, VT);
1994 } else { // Cannonicalize constant to RHS if commutative
1995 if (isCommutativeBinOp(Opcode)) {
1996 std::swap(N1CFP, N2CFP);
2002 // Canonicalize an UNDEF to the RHS, even over a constant.
2003 if (N1.getOpcode() == ISD::UNDEF) {
2004 if (isCommutativeBinOp(Opcode)) {
2008 case ISD::FP_ROUND_INREG:
2009 case ISD::SIGN_EXTEND_INREG:
2015 return N1; // fold op(undef, arg2) -> undef
2022 if (!MVT::isVector(VT))
2023 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2024 // For vectors, we can't easily build an all zero vector, just return
2031 // Fold a bunch of operators when the RHS is undef.
2032 if (N2.getOpcode() == ISD::UNDEF) {
2048 return N2; // fold op(arg1, undef) -> undef
2053 if (!MVT::isVector(VT))
2054 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2055 // For vectors, we can't easily build an all zero vector, just return
2059 if (!MVT::isVector(VT))
2060 return getConstant(MVT::getIntVTBitMask(VT), VT);
2061 // For vectors, we can't easily build an all one vector, just return
2071 case ISD::TokenFactor:
2072 // Fold trivial token factors.
2073 if (N1.getOpcode() == ISD::EntryToken) return N2;
2074 if (N2.getOpcode() == ISD::EntryToken) return N1;
2078 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
2079 // worth handling here.
2080 if (N2C && N2C->getValue() == 0)
2085 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
2086 // worth handling here.
2087 if (N2C && N2C->getValue() == 0)
2090 case ISD::FP_ROUND_INREG:
2091 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2093 case ISD::SIGN_EXTEND_INREG: {
2094 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2095 if (EVT == VT) return N1; // Not actually extending
2098 case ISD::EXTRACT_VECTOR_ELT:
2099 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2101 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2102 // expanding copies of large vectors from registers.
2103 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2104 N1.getNumOperands() > 0) {
2106 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2107 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2108 N1.getOperand(N2C->getValue() / Factor),
2109 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2112 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2113 // expanding large vector constants.
2114 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2115 return N1.getOperand(N2C->getValue());
2117 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2118 // operations are lowered to scalars.
2119 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2120 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2122 return N1.getOperand(1);
2124 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2127 case ISD::EXTRACT_ELEMENT:
2128 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
2130 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2131 // 64-bit integers into 32-bit parts. Instead of building the extract of
2132 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2133 if (N1.getOpcode() == ISD::BUILD_PAIR)
2134 return N1.getOperand(N2C->getValue());
2136 // EXTRACT_ELEMENT of a constant int is also very common.
2137 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2138 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
2139 return getConstant(C->getValue() >> Shift, VT);
2143 // FIXME: figure out how to safely handle things like
2144 // int foo(int x) { return 1 << (x & 255); }
2145 // int bar() { return foo(256); }
2150 if (N2.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2151 cast<VTSDNode>(N2.getOperand(1))->getVT() != MVT::i1)
2152 return getNode(Opcode, VT, N1, N2.getOperand(0));
2153 else if (N2.getOpcode() == ISD::AND)
2154 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N2.getOperand(1))) {
2155 // If the and is only masking out bits that cannot effect the shift,
2156 // eliminate the and.
2157 unsigned NumBits = MVT::getSizeInBits(VT);
2158 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2159 return getNode(Opcode, VT, N1, N2.getOperand(0));
2165 // Memoize this node if possible.
2167 SDVTList VTs = getVTList(VT);
2168 if (VT != MVT::Flag) {
2169 SDOperand Ops[] = { N1, N2 };
2170 FoldingSetNodeID ID;
2171 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2173 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2174 return SDOperand(E, 0);
2175 N = new BinarySDNode(Opcode, VTs, N1, N2);
2176 CSEMap.InsertNode(N, IP);
2178 N = new BinarySDNode(Opcode, VTs, N1, N2);
2181 AllNodes.push_back(N);
2182 return SDOperand(N, 0);
2185 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2186 SDOperand N1, SDOperand N2, SDOperand N3) {
2187 // Perform various simplifications.
2188 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2189 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2192 // Use FoldSetCC to simplify SETCC's.
2193 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
2194 if (Simp.Val) return Simp;
2199 if (N1C->getValue())
2200 return N2; // select true, X, Y -> X
2202 return N3; // select false, X, Y -> Y
2204 if (N2 == N3) return N2; // select C, X, X -> X
2208 if (N2C->getValue()) // Unconditional branch
2209 return getNode(ISD::BR, MVT::Other, N1, N3);
2211 return N1; // Never-taken branch
2213 case ISD::VECTOR_SHUFFLE:
2214 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2215 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2216 N3.getOpcode() == ISD::BUILD_VECTOR &&
2217 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2218 "Illegal VECTOR_SHUFFLE node!");
2220 case ISD::BIT_CONVERT:
2221 // Fold bit_convert nodes from a type to themselves.
2222 if (N1.getValueType() == VT)
2227 // Memoize node if it doesn't produce a flag.
2229 SDVTList VTs = getVTList(VT);
2230 if (VT != MVT::Flag) {
2231 SDOperand Ops[] = { N1, N2, N3 };
2232 FoldingSetNodeID ID;
2233 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2235 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2236 return SDOperand(E, 0);
2237 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2238 CSEMap.InsertNode(N, IP);
2240 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2242 AllNodes.push_back(N);
2243 return SDOperand(N, 0);
2246 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2247 SDOperand N1, SDOperand N2, SDOperand N3,
2249 SDOperand Ops[] = { N1, N2, N3, N4 };
2250 return getNode(Opcode, VT, Ops, 4);
2253 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2254 SDOperand N1, SDOperand N2, SDOperand N3,
2255 SDOperand N4, SDOperand N5) {
2256 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2257 return getNode(Opcode, VT, Ops, 5);
2260 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2261 SDOperand Chain, SDOperand Ptr,
2262 const Value *SV, int SVOffset,
2263 bool isVolatile, unsigned Alignment) {
2264 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2266 if (VT != MVT::iPTR) {
2267 Ty = MVT::getTypeForValueType(VT);
2269 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2270 assert(PT && "Value for load must be a pointer");
2271 Ty = PT->getElementType();
2273 assert(Ty && "Could not get type information for load");
2274 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2276 SDVTList VTs = getVTList(VT, MVT::Other);
2277 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2278 SDOperand Ops[] = { Chain, Ptr, Undef };
2279 FoldingSetNodeID ID;
2280 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2281 ID.AddInteger(ISD::UNINDEXED);
2282 ID.AddInteger(ISD::NON_EXTLOAD);
2283 ID.AddInteger((unsigned int)VT);
2285 ID.AddInteger(SVOffset);
2286 ID.AddInteger(Alignment);
2287 ID.AddInteger(isVolatile);
2289 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2290 return SDOperand(E, 0);
2291 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
2292 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
2294 CSEMap.InsertNode(N, IP);
2295 AllNodes.push_back(N);
2296 return SDOperand(N, 0);
2299 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
2300 SDOperand Chain, SDOperand Ptr,
2302 int SVOffset, MVT::ValueType EVT,
2303 bool isVolatile, unsigned Alignment) {
2304 // If they are asking for an extending load from/to the same thing, return a
2307 ExtType = ISD::NON_EXTLOAD;
2309 if (MVT::isVector(VT))
2310 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
2312 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) &&
2313 "Should only be an extending load, not truncating!");
2314 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2315 "Cannot sign/zero extend a FP/Vector load!");
2316 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2317 "Cannot convert from FP to Int or Int -> FP!");
2319 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2321 if (VT != MVT::iPTR) {
2322 Ty = MVT::getTypeForValueType(VT);
2324 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2325 assert(PT && "Value for load must be a pointer");
2326 Ty = PT->getElementType();
2328 assert(Ty && "Could not get type information for load");
2329 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2331 SDVTList VTs = getVTList(VT, MVT::Other);
2332 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2333 SDOperand Ops[] = { Chain, Ptr, Undef };
2334 FoldingSetNodeID ID;
2335 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2336 ID.AddInteger(ISD::UNINDEXED);
2337 ID.AddInteger(ExtType);
2338 ID.AddInteger((unsigned int)EVT);
2340 ID.AddInteger(SVOffset);
2341 ID.AddInteger(Alignment);
2342 ID.AddInteger(isVolatile);
2344 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2345 return SDOperand(E, 0);
2346 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
2347 SV, SVOffset, Alignment, isVolatile);
2348 CSEMap.InsertNode(N, IP);
2349 AllNodes.push_back(N);
2350 return SDOperand(N, 0);
2354 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2355 SDOperand Offset, ISD::MemIndexedMode AM) {
2356 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
2357 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2358 "Load is already a indexed load!");
2359 MVT::ValueType VT = OrigLoad.getValueType();
2360 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
2361 SDOperand Ops[] = { LD->getChain(), Base, Offset };
2362 FoldingSetNodeID ID;
2363 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2365 ID.AddInteger(LD->getExtensionType());
2366 ID.AddInteger((unsigned int)(LD->getLoadedVT()));
2367 ID.AddPointer(LD->getSrcValue());
2368 ID.AddInteger(LD->getSrcValueOffset());
2369 ID.AddInteger(LD->getAlignment());
2370 ID.AddInteger(LD->isVolatile());
2372 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2373 return SDOperand(E, 0);
2374 SDNode *N = new LoadSDNode(Ops, VTs, AM,
2375 LD->getExtensionType(), LD->getLoadedVT(),
2376 LD->getSrcValue(), LD->getSrcValueOffset(),
2377 LD->getAlignment(), LD->isVolatile());
2378 CSEMap.InsertNode(N, IP);
2379 AllNodes.push_back(N);
2380 return SDOperand(N, 0);
2383 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
2384 SDOperand Ptr, const Value *SV, int SVOffset,
2385 bool isVolatile, unsigned Alignment) {
2386 MVT::ValueType VT = Val.getValueType();
2388 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2390 if (VT != MVT::iPTR) {
2391 Ty = MVT::getTypeForValueType(VT);
2393 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2394 assert(PT && "Value for store must be a pointer");
2395 Ty = PT->getElementType();
2397 assert(Ty && "Could not get type information for store");
2398 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2400 SDVTList VTs = getVTList(MVT::Other);
2401 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2402 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2403 FoldingSetNodeID ID;
2404 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2405 ID.AddInteger(ISD::UNINDEXED);
2406 ID.AddInteger(false);
2407 ID.AddInteger((unsigned int)VT);
2409 ID.AddInteger(SVOffset);
2410 ID.AddInteger(Alignment);
2411 ID.AddInteger(isVolatile);
2413 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2414 return SDOperand(E, 0);
2415 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
2416 VT, SV, SVOffset, Alignment, isVolatile);
2417 CSEMap.InsertNode(N, IP);
2418 AllNodes.push_back(N);
2419 return SDOperand(N, 0);
2422 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
2423 SDOperand Ptr, const Value *SV,
2424 int SVOffset, MVT::ValueType SVT,
2425 bool isVolatile, unsigned Alignment) {
2426 MVT::ValueType VT = Val.getValueType();
2427 bool isTrunc = VT != SVT;
2429 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) &&
2430 "Not a truncation?");
2431 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
2432 "Can't do FP-INT conversion!");
2434 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2436 if (VT != MVT::iPTR) {
2437 Ty = MVT::getTypeForValueType(VT);
2439 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2440 assert(PT && "Value for store must be a pointer");
2441 Ty = PT->getElementType();
2443 assert(Ty && "Could not get type information for store");
2444 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2446 SDVTList VTs = getVTList(MVT::Other);
2447 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2448 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2449 FoldingSetNodeID ID;
2450 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2451 ID.AddInteger(ISD::UNINDEXED);
2452 ID.AddInteger(isTrunc);
2453 ID.AddInteger((unsigned int)SVT);
2455 ID.AddInteger(SVOffset);
2456 ID.AddInteger(Alignment);
2457 ID.AddInteger(isVolatile);
2459 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2460 return SDOperand(E, 0);
2461 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, isTrunc,
2462 SVT, SV, SVOffset, Alignment, isVolatile);
2463 CSEMap.InsertNode(N, IP);
2464 AllNodes.push_back(N);
2465 return SDOperand(N, 0);
2469 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
2470 SDOperand Offset, ISD::MemIndexedMode AM) {
2471 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
2472 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
2473 "Store is already a indexed store!");
2474 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
2475 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
2476 FoldingSetNodeID ID;
2477 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2479 ID.AddInteger(ST->isTruncatingStore());
2480 ID.AddInteger((unsigned int)(ST->getStoredVT()));
2481 ID.AddPointer(ST->getSrcValue());
2482 ID.AddInteger(ST->getSrcValueOffset());
2483 ID.AddInteger(ST->getAlignment());
2484 ID.AddInteger(ST->isVolatile());
2486 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2487 return SDOperand(E, 0);
2488 SDNode *N = new StoreSDNode(Ops, VTs, AM,
2489 ST->isTruncatingStore(), ST->getStoredVT(),
2490 ST->getSrcValue(), ST->getSrcValueOffset(),
2491 ST->getAlignment(), ST->isVolatile());
2492 CSEMap.InsertNode(N, IP);
2493 AllNodes.push_back(N);
2494 return SDOperand(N, 0);
2497 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
2498 SDOperand Chain, SDOperand Ptr,
2500 SDOperand Ops[] = { Chain, Ptr, SV };
2501 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
2504 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2505 const SDOperand *Ops, unsigned NumOps) {
2507 case 0: return getNode(Opcode, VT);
2508 case 1: return getNode(Opcode, VT, Ops[0]);
2509 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
2510 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
2516 case ISD::SELECT_CC: {
2517 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
2518 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
2519 "LHS and RHS of condition must have same type!");
2520 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2521 "True and False arms of SelectCC must have same type!");
2522 assert(Ops[2].getValueType() == VT &&
2523 "select_cc node must be of same type as true and false value!");
2527 assert(NumOps == 5 && "BR_CC takes 5 operands!");
2528 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2529 "LHS/RHS of comparison should match types!");
2536 SDVTList VTs = getVTList(VT);
2537 if (VT != MVT::Flag) {
2538 FoldingSetNodeID ID;
2539 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
2541 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2542 return SDOperand(E, 0);
2543 N = new SDNode(Opcode, VTs, Ops, NumOps);
2544 CSEMap.InsertNode(N, IP);
2546 N = new SDNode(Opcode, VTs, Ops, NumOps);
2548 AllNodes.push_back(N);
2549 return SDOperand(N, 0);
2552 SDOperand SelectionDAG::getNode(unsigned Opcode,
2553 std::vector<MVT::ValueType> &ResultTys,
2554 const SDOperand *Ops, unsigned NumOps) {
2555 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
2559 SDOperand SelectionDAG::getNode(unsigned Opcode,
2560 const MVT::ValueType *VTs, unsigned NumVTs,
2561 const SDOperand *Ops, unsigned NumOps) {
2563 return getNode(Opcode, VTs[0], Ops, NumOps);
2564 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
2567 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2568 const SDOperand *Ops, unsigned NumOps) {
2569 if (VTList.NumVTs == 1)
2570 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
2573 // FIXME: figure out how to safely handle things like
2574 // int foo(int x) { return 1 << (x & 255); }
2575 // int bar() { return foo(256); }
2577 case ISD::SRA_PARTS:
2578 case ISD::SRL_PARTS:
2579 case ISD::SHL_PARTS:
2580 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2581 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
2582 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2583 else if (N3.getOpcode() == ISD::AND)
2584 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
2585 // If the and is only masking out bits that cannot effect the shift,
2586 // eliminate the and.
2587 unsigned NumBits = MVT::getSizeInBits(VT)*2;
2588 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2589 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2595 // Memoize the node unless it returns a flag.
2597 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
2598 FoldingSetNodeID ID;
2599 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
2601 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2602 return SDOperand(E, 0);
2604 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2605 else if (NumOps == 2)
2606 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2607 else if (NumOps == 3)
2608 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2610 N = new SDNode(Opcode, VTList, Ops, NumOps);
2611 CSEMap.InsertNode(N, IP);
2614 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2615 else if (NumOps == 2)
2616 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2617 else if (NumOps == 3)
2618 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2620 N = new SDNode(Opcode, VTList, Ops, NumOps);
2622 AllNodes.push_back(N);
2623 return SDOperand(N, 0);
2626 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) {
2627 return getNode(Opcode, VTList, 0, 0);
2630 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2632 SDOperand Ops[] = { N1 };
2633 return getNode(Opcode, VTList, Ops, 1);
2636 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2637 SDOperand N1, SDOperand N2) {
2638 SDOperand Ops[] = { N1, N2 };
2639 return getNode(Opcode, VTList, Ops, 2);
2642 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2643 SDOperand N1, SDOperand N2, SDOperand N3) {
2644 SDOperand Ops[] = { N1, N2, N3 };
2645 return getNode(Opcode, VTList, Ops, 3);
2648 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2649 SDOperand N1, SDOperand N2, SDOperand N3,
2651 SDOperand Ops[] = { N1, N2, N3, N4 };
2652 return getNode(Opcode, VTList, Ops, 4);
2655 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2656 SDOperand N1, SDOperand N2, SDOperand N3,
2657 SDOperand N4, SDOperand N5) {
2658 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2659 return getNode(Opcode, VTList, Ops, 5);
2662 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
2663 return makeVTList(SDNode::getValueTypeList(VT), 1);
2666 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
2667 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2668 E = VTList.end(); I != E; ++I) {
2669 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
2670 return makeVTList(&(*I)[0], 2);
2672 std::vector<MVT::ValueType> V;
2675 VTList.push_front(V);
2676 return makeVTList(&(*VTList.begin())[0], 2);
2678 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
2679 MVT::ValueType VT3) {
2680 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2681 E = VTList.end(); I != E; ++I) {
2682 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
2684 return makeVTList(&(*I)[0], 3);
2686 std::vector<MVT::ValueType> V;
2690 VTList.push_front(V);
2691 return makeVTList(&(*VTList.begin())[0], 3);
2694 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
2696 case 0: assert(0 && "Cannot have nodes without results!");
2697 case 1: return getVTList(VTs[0]);
2698 case 2: return getVTList(VTs[0], VTs[1]);
2699 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
2703 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2704 E = VTList.end(); I != E; ++I) {
2705 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
2707 bool NoMatch = false;
2708 for (unsigned i = 2; i != NumVTs; ++i)
2709 if (VTs[i] != (*I)[i]) {
2714 return makeVTList(&*I->begin(), NumVTs);
2717 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
2718 return makeVTList(&*VTList.begin()->begin(), NumVTs);
2722 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
2723 /// specified operands. If the resultant node already exists in the DAG,
2724 /// this does not modify the specified node, instead it returns the node that
2725 /// already exists. If the resultant node does not exist in the DAG, the
2726 /// input node is returned. As a degenerate case, if you specify the same
2727 /// input operands as the node already has, the input node is returned.
2728 SDOperand SelectionDAG::
2729 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
2730 SDNode *N = InN.Val;
2731 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
2733 // Check to see if there is no change.
2734 if (Op == N->getOperand(0)) return InN;
2736 // See if the modified node already exists.
2737 void *InsertPos = 0;
2738 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
2739 return SDOperand(Existing, InN.ResNo);
2741 // Nope it doesn't. Remove the node from it's current place in the maps.
2743 RemoveNodeFromCSEMaps(N);
2745 // Now we update the operands.
2746 N->OperandList[0].Val->removeUser(N);
2748 N->OperandList[0] = Op;
2750 // If this gets put into a CSE map, add it.
2751 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2755 SDOperand SelectionDAG::
2756 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
2757 SDNode *N = InN.Val;
2758 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
2760 // Check to see if there is no change.
2761 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
2762 return InN; // No operands changed, just return the input node.
2764 // See if the modified node already exists.
2765 void *InsertPos = 0;
2766 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
2767 return SDOperand(Existing, InN.ResNo);
2769 // Nope it doesn't. Remove the node from it's current place in the maps.
2771 RemoveNodeFromCSEMaps(N);
2773 // Now we update the operands.
2774 if (N->OperandList[0] != Op1) {
2775 N->OperandList[0].Val->removeUser(N);
2776 Op1.Val->addUser(N);
2777 N->OperandList[0] = Op1;
2779 if (N->OperandList[1] != Op2) {
2780 N->OperandList[1].Val->removeUser(N);
2781 Op2.Val->addUser(N);
2782 N->OperandList[1] = Op2;
2785 // If this gets put into a CSE map, add it.
2786 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2790 SDOperand SelectionDAG::
2791 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2792 SDOperand Ops[] = { Op1, Op2, Op3 };
2793 return UpdateNodeOperands(N, Ops, 3);
2796 SDOperand SelectionDAG::
2797 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2798 SDOperand Op3, SDOperand Op4) {
2799 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
2800 return UpdateNodeOperands(N, Ops, 4);
2803 SDOperand SelectionDAG::
2804 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2805 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2806 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
2807 return UpdateNodeOperands(N, Ops, 5);
2811 SDOperand SelectionDAG::
2812 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
2813 SDNode *N = InN.Val;
2814 assert(N->getNumOperands() == NumOps &&
2815 "Update with wrong number of operands");
2817 // Check to see if there is no change.
2818 bool AnyChange = false;
2819 for (unsigned i = 0; i != NumOps; ++i) {
2820 if (Ops[i] != N->getOperand(i)) {
2826 // No operands changed, just return the input node.
2827 if (!AnyChange) return InN;
2829 // See if the modified node already exists.
2830 void *InsertPos = 0;
2831 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2832 return SDOperand(Existing, InN.ResNo);
2834 // Nope it doesn't. Remove the node from it's current place in the maps.
2836 RemoveNodeFromCSEMaps(N);
2838 // Now we update the operands.
2839 for (unsigned i = 0; i != NumOps; ++i) {
2840 if (N->OperandList[i] != Ops[i]) {
2841 N->OperandList[i].Val->removeUser(N);
2842 Ops[i].Val->addUser(N);
2843 N->OperandList[i] = Ops[i];
2847 // If this gets put into a CSE map, add it.
2848 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2853 /// MorphNodeTo - This frees the operands of the current node, resets the
2854 /// opcode, types, and operands to the specified value. This should only be
2855 /// used by the SelectionDAG class.
2856 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
2857 const SDOperand *Ops, unsigned NumOps) {
2860 NumValues = L.NumVTs;
2862 // Clear the operands list, updating used nodes to remove this from their
2864 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
2865 I->Val->removeUser(this);
2867 // If NumOps is larger than the # of operands we currently have, reallocate
2868 // the operand list.
2869 if (NumOps > NumOperands) {
2870 if (OperandsNeedDelete)
2871 delete [] OperandList;
2872 OperandList = new SDOperand[NumOps];
2873 OperandsNeedDelete = true;
2876 // Assign the new operands.
2877 NumOperands = NumOps;
2879 for (unsigned i = 0, e = NumOps; i != e; ++i) {
2880 OperandList[i] = Ops[i];
2881 SDNode *N = OperandList[i].Val;
2882 N->Uses.push_back(this);
2886 /// SelectNodeTo - These are used for target selectors to *mutate* the
2887 /// specified node to have the specified return type, Target opcode, and
2888 /// operands. Note that target opcodes are stored as
2889 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
2891 /// Note that SelectNodeTo returns the resultant node. If there is already a
2892 /// node of the specified opcode and operands, it returns that node instead of
2893 /// the current one.
2894 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2895 MVT::ValueType VT) {
2896 SDVTList VTs = getVTList(VT);
2897 FoldingSetNodeID ID;
2898 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2900 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2903 RemoveNodeFromCSEMaps(N);
2905 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
2907 CSEMap.InsertNode(N, IP);
2911 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2912 MVT::ValueType VT, SDOperand Op1) {
2913 // If an identical node already exists, use it.
2914 SDVTList VTs = getVTList(VT);
2915 SDOperand Ops[] = { Op1 };
2917 FoldingSetNodeID ID;
2918 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2920 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2923 RemoveNodeFromCSEMaps(N);
2924 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
2925 CSEMap.InsertNode(N, IP);
2929 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2930 MVT::ValueType VT, SDOperand Op1,
2932 // If an identical node already exists, use it.
2933 SDVTList VTs = getVTList(VT);
2934 SDOperand Ops[] = { Op1, Op2 };
2936 FoldingSetNodeID ID;
2937 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2939 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2942 RemoveNodeFromCSEMaps(N);
2944 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2946 CSEMap.InsertNode(N, IP); // Memoize the new node.
2950 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2951 MVT::ValueType VT, SDOperand Op1,
2952 SDOperand Op2, SDOperand Op3) {
2953 // If an identical node already exists, use it.
2954 SDVTList VTs = getVTList(VT);
2955 SDOperand Ops[] = { Op1, Op2, Op3 };
2956 FoldingSetNodeID ID;
2957 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2959 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2962 RemoveNodeFromCSEMaps(N);
2964 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
2966 CSEMap.InsertNode(N, IP); // Memoize the new node.
2970 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2971 MVT::ValueType VT, const SDOperand *Ops,
2973 // If an identical node already exists, use it.
2974 SDVTList VTs = getVTList(VT);
2975 FoldingSetNodeID ID;
2976 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2978 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2981 RemoveNodeFromCSEMaps(N);
2982 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
2984 CSEMap.InsertNode(N, IP); // Memoize the new node.
2988 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
2989 MVT::ValueType VT1, MVT::ValueType VT2,
2990 SDOperand Op1, SDOperand Op2) {
2991 SDVTList VTs = getVTList(VT1, VT2);
2992 FoldingSetNodeID ID;
2993 SDOperand Ops[] = { Op1, Op2 };
2994 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
2996 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
2999 RemoveNodeFromCSEMaps(N);
3000 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3001 CSEMap.InsertNode(N, IP); // Memoize the new node.
3005 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3006 MVT::ValueType VT1, MVT::ValueType VT2,
3007 SDOperand Op1, SDOperand Op2,
3009 // If an identical node already exists, use it.
3010 SDVTList VTs = getVTList(VT1, VT2);
3011 SDOperand Ops[] = { Op1, Op2, Op3 };
3012 FoldingSetNodeID ID;
3013 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3015 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3018 RemoveNodeFromCSEMaps(N);
3020 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3021 CSEMap.InsertNode(N, IP); // Memoize the new node.
3026 /// getTargetNode - These are used for target selectors to create a new node
3027 /// with specified return type(s), target opcode, and operands.
3029 /// Note that getTargetNode returns the resultant node. If there is already a
3030 /// node of the specified opcode and operands, it returns that node instead of
3031 /// the current one.
3032 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
3033 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
3035 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3037 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
3039 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3040 SDOperand Op1, SDOperand Op2) {
3041 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
3043 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3044 SDOperand Op1, SDOperand Op2,
3046 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
3048 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3049 const SDOperand *Ops, unsigned NumOps) {
3050 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
3052 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3053 MVT::ValueType VT2) {
3054 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3056 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val;
3058 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3059 MVT::ValueType VT2, SDOperand Op1) {
3060 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3061 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
3063 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3064 MVT::ValueType VT2, SDOperand Op1,
3066 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3067 SDOperand Ops[] = { Op1, Op2 };
3068 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
3070 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3071 MVT::ValueType VT2, SDOperand Op1,
3072 SDOperand Op2, SDOperand Op3) {
3073 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3074 SDOperand Ops[] = { Op1, Op2, Op3 };
3075 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
3077 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3079 const SDOperand *Ops, unsigned NumOps) {
3080 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3081 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
3083 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3084 MVT::ValueType VT2, MVT::ValueType VT3,
3085 SDOperand Op1, SDOperand Op2) {
3086 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3087 SDOperand Ops[] = { Op1, Op2 };
3088 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
3090 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3091 MVT::ValueType VT2, MVT::ValueType VT3,
3092 SDOperand Op1, SDOperand Op2,
3094 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3095 SDOperand Ops[] = { Op1, Op2, Op3 };
3096 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3098 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3099 MVT::ValueType VT2, MVT::ValueType VT3,
3100 const SDOperand *Ops, unsigned NumOps) {
3101 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3102 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
3104 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3105 MVT::ValueType VT2, MVT::ValueType VT3,
3107 const SDOperand *Ops, unsigned NumOps) {
3108 std::vector<MVT::ValueType> VTList;
3109 VTList.push_back(VT1);
3110 VTList.push_back(VT2);
3111 VTList.push_back(VT3);
3112 VTList.push_back(VT4);
3113 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3114 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3116 SDNode *SelectionDAG::getTargetNode(unsigned Opcode,
3117 std::vector<MVT::ValueType> &ResultTys,
3118 const SDOperand *Ops, unsigned NumOps) {
3119 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys);
3120 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(),
3124 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3125 /// This can cause recursive merging of nodes in the DAG.
3127 /// This version assumes From/To have a single result value.
3129 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand ToN,
3130 std::vector<SDNode*> *Deleted) {
3131 SDNode *From = FromN.Val, *To = ToN.Val;
3132 assert(From->getNumValues() == 1 && To->getNumValues() == 1 &&
3133 "Cannot replace with this method!");
3134 assert(From != To && "Cannot replace uses of with self");
3136 while (!From->use_empty()) {
3137 // Process users until they are all gone.
3138 SDNode *U = *From->use_begin();
3140 // This node is about to morph, remove its old self from the CSE maps.
3141 RemoveNodeFromCSEMaps(U);
3143 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3145 if (I->Val == From) {
3146 From->removeUser(U);
3151 // Now that we have modified U, add it back to the CSE maps. If it already
3152 // exists there, recursively merge the results together.
3153 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3154 ReplaceAllUsesWith(U, Existing, Deleted);
3156 if (Deleted) Deleted->push_back(U);
3157 DeleteNodeNotInCSEMaps(U);
3162 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3163 /// This can cause recursive merging of nodes in the DAG.
3165 /// This version assumes From/To have matching types and numbers of result
3168 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
3169 std::vector<SDNode*> *Deleted) {
3170 assert(From != To && "Cannot replace uses of with self");
3171 assert(From->getNumValues() == To->getNumValues() &&
3172 "Cannot use this version of ReplaceAllUsesWith!");
3173 if (From->getNumValues() == 1) { // If possible, use the faster version.
3174 ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0), Deleted);
3178 while (!From->use_empty()) {
3179 // Process users until they are all gone.
3180 SDNode *U = *From->use_begin();
3182 // This node is about to morph, remove its old self from the CSE maps.
3183 RemoveNodeFromCSEMaps(U);
3185 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3187 if (I->Val == From) {
3188 From->removeUser(U);
3193 // Now that we have modified U, add it back to the CSE maps. If it already
3194 // exists there, recursively merge the results together.
3195 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3196 ReplaceAllUsesWith(U, Existing, Deleted);
3198 if (Deleted) Deleted->push_back(U);
3199 DeleteNodeNotInCSEMaps(U);
3204 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3205 /// This can cause recursive merging of nodes in the DAG.
3207 /// This version can replace From with any result values. To must match the
3208 /// number and types of values returned by From.
3209 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
3210 const SDOperand *To,
3211 std::vector<SDNode*> *Deleted) {
3212 if (From->getNumValues() == 1 && To[0].Val->getNumValues() == 1) {
3213 // Degenerate case handled above.
3214 ReplaceAllUsesWith(SDOperand(From, 0), To[0], Deleted);
3218 while (!From->use_empty()) {
3219 // Process users until they are all gone.
3220 SDNode *U = *From->use_begin();
3222 // This node is about to morph, remove its old self from the CSE maps.
3223 RemoveNodeFromCSEMaps(U);
3225 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3227 if (I->Val == From) {
3228 const SDOperand &ToOp = To[I->ResNo];
3229 From->removeUser(U);
3231 ToOp.Val->addUser(U);
3234 // Now that we have modified U, add it back to the CSE maps. If it already
3235 // exists there, recursively merge the results together.
3236 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3237 ReplaceAllUsesWith(U, Existing, Deleted);
3239 if (Deleted) Deleted->push_back(U);
3240 DeleteNodeNotInCSEMaps(U);
3245 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3246 /// uses of other values produced by From.Val alone. The Deleted vector is
3247 /// handled the same was as for ReplaceAllUsesWith.
3248 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
3249 std::vector<SDNode*> *Deleted) {
3250 assert(From != To && "Cannot replace a value with itself");
3251 // Handle the simple, trivial, case efficiently.
3252 if (From.Val->getNumValues() == 1 && To.Val->getNumValues() == 1) {
3253 ReplaceAllUsesWith(From, To, Deleted);
3257 // Get all of the users of From.Val. We want these in a nice,
3258 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3259 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
3261 std::vector<SDNode*> LocalDeletionVector;
3263 // Pick a deletion vector to use. If the user specified one, use theirs,
3264 // otherwise use a local one.
3265 std::vector<SDNode*> *DeleteVector = Deleted ? Deleted : &LocalDeletionVector;
3266 while (!Users.empty()) {
3267 // We know that this user uses some value of From. If it is the right
3268 // value, update it.
3269 SDNode *User = Users.back();
3272 // Scan for an operand that matches From.
3273 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands;
3274 for (; Op != E; ++Op)
3275 if (*Op == From) break;
3277 // If there are no matches, the user must use some other result of From.
3278 if (Op == E) continue;
3280 // Okay, we know this user needs to be updated. Remove its old self
3281 // from the CSE maps.
3282 RemoveNodeFromCSEMaps(User);
3284 // Update all operands that match "From".
3285 for (; Op != E; ++Op) {
3287 From.Val->removeUser(User);
3289 To.Val->addUser(User);
3293 // Now that we have modified User, add it back to the CSE maps. If it
3294 // already exists there, recursively merge the results together.
3295 SDNode *Existing = AddNonLeafNodeToCSEMaps(User);
3296 if (!Existing) continue; // Continue on to next user.
3298 // If there was already an existing matching node, use ReplaceAllUsesWith
3299 // to replace the dead one with the existing one. However, this can cause
3300 // recursive merging of other unrelated nodes down the line. The merging
3301 // can cause deletion of nodes that used the old value. In this case,
3302 // we have to be certain to remove them from the Users set.
3303 unsigned NumDeleted = DeleteVector->size();
3304 ReplaceAllUsesWith(User, Existing, DeleteVector);
3306 // User is now dead.
3307 DeleteVector->push_back(User);
3308 DeleteNodeNotInCSEMaps(User);
3310 // We have to be careful here, because ReplaceAllUsesWith could have
3311 // deleted a user of From, which means there may be dangling pointers
3312 // in the "Users" setvector. Scan over the deleted node pointers and
3313 // remove them from the setvector.
3314 for (unsigned i = NumDeleted, e = DeleteVector->size(); i != e; ++i)
3315 Users.remove((*DeleteVector)[i]);
3317 // If the user doesn't need the set of deleted elements, don't retain them
3318 // to the next loop iteration.
3320 LocalDeletionVector.clear();
3325 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3326 /// their allnodes order. It returns the maximum id.
3327 unsigned SelectionDAG::AssignNodeIds() {
3329 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3336 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
3337 /// based on their topological order. It returns the maximum id and a vector
3338 /// of the SDNodes* in assigned order by reference.
3339 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
3340 unsigned DAGSize = AllNodes.size();
3341 std::vector<unsigned> InDegree(DAGSize);
3342 std::vector<SDNode*> Sources;
3344 // Use a two pass approach to avoid using a std::map which is slow.
3346 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
3349 unsigned Degree = N->use_size();
3350 InDegree[N->getNodeId()] = Degree;
3352 Sources.push_back(N);
3356 while (!Sources.empty()) {
3357 SDNode *N = Sources.back();
3359 TopOrder.push_back(N);
3360 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
3362 unsigned Degree = --InDegree[P->getNodeId()];
3364 Sources.push_back(P);
3368 // Second pass, assign the actual topological order as node ids.
3370 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
3372 (*TI)->setNodeId(Id++);
3379 //===----------------------------------------------------------------------===//
3381 //===----------------------------------------------------------------------===//
3383 // Out-of-line virtual method to give class a home.
3384 void SDNode::ANCHOR() {}
3385 void UnarySDNode::ANCHOR() {}
3386 void BinarySDNode::ANCHOR() {}
3387 void TernarySDNode::ANCHOR() {}
3388 void HandleSDNode::ANCHOR() {}
3389 void StringSDNode::ANCHOR() {}
3390 void ConstantSDNode::ANCHOR() {}
3391 void ConstantFPSDNode::ANCHOR() {}
3392 void GlobalAddressSDNode::ANCHOR() {}
3393 void FrameIndexSDNode::ANCHOR() {}
3394 void JumpTableSDNode::ANCHOR() {}
3395 void ConstantPoolSDNode::ANCHOR() {}
3396 void BasicBlockSDNode::ANCHOR() {}
3397 void SrcValueSDNode::ANCHOR() {}
3398 void RegisterSDNode::ANCHOR() {}
3399 void ExternalSymbolSDNode::ANCHOR() {}
3400 void CondCodeSDNode::ANCHOR() {}
3401 void VTSDNode::ANCHOR() {}
3402 void LoadSDNode::ANCHOR() {}
3403 void StoreSDNode::ANCHOR() {}
3405 HandleSDNode::~HandleSDNode() {
3406 SDVTList VTs = { 0, 0 };
3407 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
3410 GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
3411 MVT::ValueType VT, int o)
3412 : SDNode(isa<GlobalVariable>(GA) &&
3413 cast<GlobalVariable>(GA)->isThreadLocal() ?
3415 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
3417 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
3418 getSDVTList(VT)), Offset(o) {
3419 TheGlobal = const_cast<GlobalValue*>(GA);
3422 /// Profile - Gather unique data for the node.
3424 void SDNode::Profile(FoldingSetNodeID &ID) {
3425 AddNodeIDNode(ID, this);
3428 /// getValueTypeList - Return a pointer to the specified value type.
3430 MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
3431 if (MVT::isExtendedVT(VT)) {
3432 static std::set<MVT::ValueType> EVTs;
3433 return (MVT::ValueType *)&(*EVTs.insert(VT).first);
3435 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
3441 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
3442 /// indicated value. This method ignores uses of other values defined by this
3444 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
3445 assert(Value < getNumValues() && "Bad value!");
3447 // If there is only one value, this is easy.
3448 if (getNumValues() == 1)
3449 return use_size() == NUses;
3450 if (use_size() < NUses) return false;
3452 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3454 SmallPtrSet<SDNode*, 32> UsersHandled;
3456 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3458 if (User->getNumOperands() == 1 ||
3459 UsersHandled.insert(User)) // First time we've seen this?
3460 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3461 if (User->getOperand(i) == TheValue) {
3463 return false; // too many uses
3468 // Found exactly the right number of uses?
3473 /// hasAnyUseOfValue - Return true if there are any use of the indicated
3474 /// value. This method ignores uses of other values defined by this operation.
3475 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
3476 assert(Value < getNumValues() && "Bad value!");
3478 if (use_size() == 0) return false;
3480 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3482 SmallPtrSet<SDNode*, 32> UsersHandled;
3484 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3486 if (User->getNumOperands() == 1 ||
3487 UsersHandled.insert(User)) // First time we've seen this?
3488 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3489 if (User->getOperand(i) == TheValue) {
3498 /// isOnlyUse - Return true if this node is the only use of N.
3500 bool SDNode::isOnlyUse(SDNode *N) const {
3502 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
3513 /// isOperand - Return true if this node is an operand of N.
3515 bool SDOperand::isOperand(SDNode *N) const {
3516 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3517 if (*this == N->getOperand(i))
3522 bool SDNode::isOperand(SDNode *N) const {
3523 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
3524 if (this == N->OperandList[i].Val)
3529 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
3530 SmallPtrSet<SDNode *, 32> &Visited) {
3531 if (found || !Visited.insert(N))
3534 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
3535 SDNode *Op = N->getOperand(i).Val;
3540 findPredecessor(Op, P, found, Visited);
3544 /// isPredecessor - Return true if this node is a predecessor of N. This node
3545 /// is either an operand of N or it can be reached by recursively traversing
3546 /// up the operands.
3547 /// NOTE: this is an expensive method. Use it carefully.
3548 bool SDNode::isPredecessor(SDNode *N) const {
3549 SmallPtrSet<SDNode *, 32> Visited;
3551 findPredecessor(N, this, found, Visited);
3555 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
3556 assert(Num < NumOperands && "Invalid child # of SDNode!");
3557 return cast<ConstantSDNode>(OperandList[Num])->getValue();
3560 std::string SDNode::getOperationName(const SelectionDAG *G) const {
3561 switch (getOpcode()) {
3563 if (getOpcode() < ISD::BUILTIN_OP_END)
3564 return "<<Unknown DAG Node>>";
3567 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
3568 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
3569 return TII->getName(getOpcode()-ISD::BUILTIN_OP_END);
3571 TargetLowering &TLI = G->getTargetLoweringInfo();
3573 TLI.getTargetNodeName(getOpcode());
3574 if (Name) return Name;
3577 return "<<Unknown Target Node>>";
3580 case ISD::PCMARKER: return "PCMarker";
3581 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
3582 case ISD::SRCVALUE: return "SrcValue";
3583 case ISD::EntryToken: return "EntryToken";
3584 case ISD::TokenFactor: return "TokenFactor";
3585 case ISD::AssertSext: return "AssertSext";
3586 case ISD::AssertZext: return "AssertZext";
3588 case ISD::STRING: return "String";
3589 case ISD::BasicBlock: return "BasicBlock";
3590 case ISD::VALUETYPE: return "ValueType";
3591 case ISD::Register: return "Register";
3593 case ISD::Constant: return "Constant";
3594 case ISD::ConstantFP: return "ConstantFP";
3595 case ISD::GlobalAddress: return "GlobalAddress";
3596 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
3597 case ISD::FrameIndex: return "FrameIndex";
3598 case ISD::JumpTable: return "JumpTable";
3599 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
3600 case ISD::RETURNADDR: return "RETURNADDR";
3601 case ISD::FRAMEADDR: return "FRAMEADDR";
3602 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
3603 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
3604 case ISD::EHSELECTION: return "EHSELECTION";
3605 case ISD::EH_RETURN: return "EH_RETURN";
3606 case ISD::ConstantPool: return "ConstantPool";
3607 case ISD::ExternalSymbol: return "ExternalSymbol";
3608 case ISD::INTRINSIC_WO_CHAIN: {
3609 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
3610 return Intrinsic::getName((Intrinsic::ID)IID);
3612 case ISD::INTRINSIC_VOID:
3613 case ISD::INTRINSIC_W_CHAIN: {
3614 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
3615 return Intrinsic::getName((Intrinsic::ID)IID);
3618 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
3619 case ISD::TargetConstant: return "TargetConstant";
3620 case ISD::TargetConstantFP:return "TargetConstantFP";
3621 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
3622 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
3623 case ISD::TargetFrameIndex: return "TargetFrameIndex";
3624 case ISD::TargetJumpTable: return "TargetJumpTable";
3625 case ISD::TargetConstantPool: return "TargetConstantPool";
3626 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
3628 case ISD::CopyToReg: return "CopyToReg";
3629 case ISD::CopyFromReg: return "CopyFromReg";
3630 case ISD::UNDEF: return "undef";
3631 case ISD::MERGE_VALUES: return "merge_values";
3632 case ISD::INLINEASM: return "inlineasm";
3633 case ISD::LABEL: return "label";
3634 case ISD::HANDLENODE: return "handlenode";
3635 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
3636 case ISD::CALL: return "call";
3639 case ISD::FABS: return "fabs";
3640 case ISD::FNEG: return "fneg";
3641 case ISD::FSQRT: return "fsqrt";
3642 case ISD::FSIN: return "fsin";
3643 case ISD::FCOS: return "fcos";
3644 case ISD::FPOWI: return "fpowi";
3645 case ISD::FPOW: return "fpow";
3648 case ISD::ADD: return "add";
3649 case ISD::SUB: return "sub";
3650 case ISD::MUL: return "mul";
3651 case ISD::MULHU: return "mulhu";
3652 case ISD::MULHS: return "mulhs";
3653 case ISD::SDIV: return "sdiv";
3654 case ISD::UDIV: return "udiv";
3655 case ISD::SREM: return "srem";
3656 case ISD::UREM: return "urem";
3657 case ISD::SMUL_LOHI: return "smul_lohi";
3658 case ISD::UMUL_LOHI: return "umul_lohi";
3659 case ISD::SDIVREM: return "sdivrem";
3660 case ISD::UDIVREM: return "divrem";
3661 case ISD::AND: return "and";
3662 case ISD::OR: return "or";
3663 case ISD::XOR: return "xor";
3664 case ISD::SHL: return "shl";
3665 case ISD::SRA: return "sra";
3666 case ISD::SRL: return "srl";
3667 case ISD::ROTL: return "rotl";
3668 case ISD::ROTR: return "rotr";
3669 case ISD::FADD: return "fadd";
3670 case ISD::FSUB: return "fsub";
3671 case ISD::FMUL: return "fmul";
3672 case ISD::FDIV: return "fdiv";
3673 case ISD::FREM: return "frem";
3674 case ISD::FCOPYSIGN: return "fcopysign";
3676 case ISD::SETCC: return "setcc";
3677 case ISD::SELECT: return "select";
3678 case ISD::SELECT_CC: return "select_cc";
3679 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
3680 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
3681 case ISD::CONCAT_VECTORS: return "concat_vectors";
3682 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
3683 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
3684 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
3685 case ISD::CARRY_FALSE: return "carry_false";
3686 case ISD::ADDC: return "addc";
3687 case ISD::ADDE: return "adde";
3688 case ISD::SUBC: return "subc";
3689 case ISD::SUBE: return "sube";
3690 case ISD::SHL_PARTS: return "shl_parts";
3691 case ISD::SRA_PARTS: return "sra_parts";
3692 case ISD::SRL_PARTS: return "srl_parts";
3694 case ISD::EXTRACT_SUBREG: return "extract_subreg";
3695 case ISD::INSERT_SUBREG: return "insert_subreg";
3697 // Conversion operators.
3698 case ISD::SIGN_EXTEND: return "sign_extend";
3699 case ISD::ZERO_EXTEND: return "zero_extend";
3700 case ISD::ANY_EXTEND: return "any_extend";
3701 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
3702 case ISD::TRUNCATE: return "truncate";
3703 case ISD::FP_ROUND: return "fp_round";
3704 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
3705 case ISD::FP_EXTEND: return "fp_extend";
3707 case ISD::SINT_TO_FP: return "sint_to_fp";
3708 case ISD::UINT_TO_FP: return "uint_to_fp";
3709 case ISD::FP_TO_SINT: return "fp_to_sint";
3710 case ISD::FP_TO_UINT: return "fp_to_uint";
3711 case ISD::BIT_CONVERT: return "bit_convert";
3713 // Control flow instructions
3714 case ISD::BR: return "br";
3715 case ISD::BRIND: return "brind";
3716 case ISD::BR_JT: return "br_jt";
3717 case ISD::BRCOND: return "brcond";
3718 case ISD::BR_CC: return "br_cc";
3719 case ISD::RET: return "ret";
3720 case ISD::CALLSEQ_START: return "callseq_start";
3721 case ISD::CALLSEQ_END: return "callseq_end";
3724 case ISD::LOAD: return "load";
3725 case ISD::STORE: return "store";
3726 case ISD::VAARG: return "vaarg";
3727 case ISD::VACOPY: return "vacopy";
3728 case ISD::VAEND: return "vaend";
3729 case ISD::VASTART: return "vastart";
3730 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
3731 case ISD::EXTRACT_ELEMENT: return "extract_element";
3732 case ISD::BUILD_PAIR: return "build_pair";
3733 case ISD::STACKSAVE: return "stacksave";
3734 case ISD::STACKRESTORE: return "stackrestore";
3736 // Block memory operations.
3737 case ISD::MEMSET: return "memset";
3738 case ISD::MEMCPY: return "memcpy";
3739 case ISD::MEMMOVE: return "memmove";
3742 case ISD::BSWAP: return "bswap";
3743 case ISD::CTPOP: return "ctpop";
3744 case ISD::CTTZ: return "cttz";
3745 case ISD::CTLZ: return "ctlz";
3748 case ISD::LOCATION: return "location";
3749 case ISD::DEBUG_LOC: return "debug_loc";
3752 case ISD::TRAMPOLINE: return "trampoline";
3755 switch (cast<CondCodeSDNode>(this)->get()) {
3756 default: assert(0 && "Unknown setcc condition!");
3757 case ISD::SETOEQ: return "setoeq";
3758 case ISD::SETOGT: return "setogt";
3759 case ISD::SETOGE: return "setoge";
3760 case ISD::SETOLT: return "setolt";
3761 case ISD::SETOLE: return "setole";
3762 case ISD::SETONE: return "setone";
3764 case ISD::SETO: return "seto";
3765 case ISD::SETUO: return "setuo";
3766 case ISD::SETUEQ: return "setue";
3767 case ISD::SETUGT: return "setugt";
3768 case ISD::SETUGE: return "setuge";
3769 case ISD::SETULT: return "setult";
3770 case ISD::SETULE: return "setule";
3771 case ISD::SETUNE: return "setune";
3773 case ISD::SETEQ: return "seteq";
3774 case ISD::SETGT: return "setgt";
3775 case ISD::SETGE: return "setge";
3776 case ISD::SETLT: return "setlt";
3777 case ISD::SETLE: return "setle";
3778 case ISD::SETNE: return "setne";
3783 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
3792 return "<post-inc>";
3794 return "<post-dec>";
3798 void SDNode::dump() const { dump(0); }
3799 void SDNode::dump(const SelectionDAG *G) const {
3800 cerr << (void*)this << ": ";
3802 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
3804 if (getValueType(i) == MVT::Other)
3807 cerr << MVT::getValueTypeString(getValueType(i));
3809 cerr << " = " << getOperationName(G);
3812 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
3813 if (i) cerr << ", ";
3814 cerr << (void*)getOperand(i).Val;
3815 if (unsigned RN = getOperand(i).ResNo)
3819 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
3820 cerr << "<" << CSDN->getValue() << ">";
3821 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
3822 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
3823 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
3824 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
3825 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
3827 cerr << "<APFloat(";
3828 CSDN->getValueAPF().convertToAPInt().dump();
3831 } else if (const GlobalAddressSDNode *GADN =
3832 dyn_cast<GlobalAddressSDNode>(this)) {
3833 int offset = GADN->getOffset();
3835 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
3837 cerr << " + " << offset;
3839 cerr << " " << offset;
3840 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
3841 cerr << "<" << FIDN->getIndex() << ">";
3842 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
3843 cerr << "<" << JTDN->getIndex() << ">";
3844 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
3845 int offset = CP->getOffset();
3846 if (CP->isMachineConstantPoolEntry())
3847 cerr << "<" << *CP->getMachineCPVal() << ">";
3849 cerr << "<" << *CP->getConstVal() << ">";
3851 cerr << " + " << offset;
3853 cerr << " " << offset;
3854 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
3856 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
3858 cerr << LBB->getName() << " ";
3859 cerr << (const void*)BBDN->getBasicBlock() << ">";
3860 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
3861 if (G && R->getReg() && MRegisterInfo::isPhysicalRegister(R->getReg())) {
3862 cerr << " " <<G->getTarget().getRegisterInfo()->getName(R->getReg());
3864 cerr << " #" << R->getReg();
3866 } else if (const ExternalSymbolSDNode *ES =
3867 dyn_cast<ExternalSymbolSDNode>(this)) {
3868 cerr << "'" << ES->getSymbol() << "'";
3869 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
3871 cerr << "<" << M->getValue() << ":" << M->getOffset() << ">";
3873 cerr << "<null:" << M->getOffset() << ">";
3874 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
3875 cerr << ":" << MVT::getValueTypeString(N->getVT());
3876 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
3878 switch (LD->getExtensionType()) {
3879 default: doExt = false; break;
3881 cerr << " <anyext ";
3891 cerr << MVT::getValueTypeString(LD->getLoadedVT()) << ">";
3893 const char *AM = getIndexedModeName(LD->getAddressingMode());
3896 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
3897 if (ST->isTruncatingStore())
3899 << MVT::getValueTypeString(ST->getStoredVT()) << ">";
3901 const char *AM = getIndexedModeName(ST->getAddressingMode());
3907 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
3908 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3909 if (N->getOperand(i).Val->hasOneUse())
3910 DumpNodes(N->getOperand(i).Val, indent+2, G);
3912 cerr << "\n" << std::string(indent+2, ' ')
3913 << (void*)N->getOperand(i).Val << ": <multiple use>";
3916 cerr << "\n" << std::string(indent, ' ');
3920 void SelectionDAG::dump() const {
3921 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
3922 std::vector<const SDNode*> Nodes;
3923 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
3927 std::sort(Nodes.begin(), Nodes.end());
3929 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
3930 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
3931 DumpNodes(Nodes[i], 2, this);
3934 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
3939 const Type *ConstantPoolSDNode::getType() const {
3940 if (isMachineConstantPoolEntry())
3941 return Val.MachineCPVal->getType();
3942 return Val.ConstVal->getType();