1 //===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // 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/CodeGen/MachineModuleInfo.h"
24 #include "llvm/CodeGen/PseudoSourceValue.h"
25 #include "llvm/Support/MathExtras.h"
26 #include "llvm/Target/TargetRegisterInfo.h"
27 #include "llvm/Target/TargetData.h"
28 #include "llvm/Target/TargetLowering.h"
29 #include "llvm/Target/TargetInstrInfo.h"
30 #include "llvm/Target/TargetMachine.h"
31 #include "llvm/ADT/SetVector.h"
32 #include "llvm/ADT/SmallPtrSet.h"
33 #include "llvm/ADT/SmallSet.h"
34 #include "llvm/ADT/SmallVector.h"
35 #include "llvm/ADT/StringExtras.h"
40 /// makeVTList - Return an instance of the SDVTList struct initialized with the
41 /// specified members.
42 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
43 SDVTList Res = {VTs, NumVTs};
47 SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {}
49 //===----------------------------------------------------------------------===//
50 // ConstantFPSDNode Class
51 //===----------------------------------------------------------------------===//
53 /// isExactlyValue - We don't rely on operator== working on double values, as
54 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
55 /// As such, this method can be used to do an exact bit-for-bit comparison of
56 /// two floating point values.
57 bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const {
58 return Value.bitwiseIsEqual(V);
61 bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT,
63 // convert modifies in place, so make a copy.
64 APFloat Val2 = APFloat(Val);
67 return false; // These can't be represented as floating point!
69 // FIXME rounding mode needs to be more flexible
71 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
72 Val2.convert(APFloat::IEEEsingle, APFloat::rmNearestTiesToEven) ==
75 return &Val2.getSemantics() == &APFloat::IEEEsingle ||
76 &Val2.getSemantics() == &APFloat::IEEEdouble ||
77 Val2.convert(APFloat::IEEEdouble, APFloat::rmNearestTiesToEven) ==
79 // TODO: Figure out how to test if we can use a shorter type instead!
87 //===----------------------------------------------------------------------===//
89 //===----------------------------------------------------------------------===//
91 /// isBuildVectorAllOnes - Return true if the specified node is a
92 /// BUILD_VECTOR where all of the elements are ~0 or undef.
93 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
94 // Look through a bit convert.
95 if (N->getOpcode() == ISD::BIT_CONVERT)
96 N = N->getOperand(0).Val;
98 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
100 unsigned i = 0, e = N->getNumOperands();
102 // Skip over all of the undef values.
103 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
106 // Do not accept an all-undef vector.
107 if (i == e) return false;
109 // Do not accept build_vectors that aren't all constants or which have non-~0
111 SDOperand NotZero = N->getOperand(i);
112 if (isa<ConstantSDNode>(NotZero)) {
113 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
115 } else if (isa<ConstantFPSDNode>(NotZero)) {
116 if (!cast<ConstantFPSDNode>(NotZero)->getValueAPF().
117 convertToAPInt().isAllOnesValue())
122 // Okay, we have at least one ~0 value, check to see if the rest match or are
124 for (++i; i != e; ++i)
125 if (N->getOperand(i) != NotZero &&
126 N->getOperand(i).getOpcode() != ISD::UNDEF)
132 /// isBuildVectorAllZeros - Return true if the specified node is a
133 /// BUILD_VECTOR where all of the elements are 0 or undef.
134 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
135 // Look through a bit convert.
136 if (N->getOpcode() == ISD::BIT_CONVERT)
137 N = N->getOperand(0).Val;
139 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
141 unsigned i = 0, e = N->getNumOperands();
143 // Skip over all of the undef values.
144 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
147 // Do not accept an all-undef vector.
148 if (i == e) return false;
150 // Do not accept build_vectors that aren't all constants or which have non-~0
152 SDOperand Zero = N->getOperand(i);
153 if (isa<ConstantSDNode>(Zero)) {
154 if (!cast<ConstantSDNode>(Zero)->isNullValue())
156 } else if (isa<ConstantFPSDNode>(Zero)) {
157 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
162 // Okay, we have at least one ~0 value, check to see if the rest match or are
164 for (++i; i != e; ++i)
165 if (N->getOperand(i) != Zero &&
166 N->getOperand(i).getOpcode() != ISD::UNDEF)
171 /// isScalarToVector - Return true if the specified node is a
172 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
173 /// element is not an undef.
174 bool ISD::isScalarToVector(const SDNode *N) {
175 if (N->getOpcode() == ISD::SCALAR_TO_VECTOR)
178 if (N->getOpcode() != ISD::BUILD_VECTOR)
180 if (N->getOperand(0).getOpcode() == ISD::UNDEF)
182 unsigned NumElems = N->getNumOperands();
183 for (unsigned i = 1; i < NumElems; ++i) {
184 SDOperand V = N->getOperand(i);
185 if (V.getOpcode() != ISD::UNDEF)
192 /// isDebugLabel - Return true if the specified node represents a debug
193 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
195 bool ISD::isDebugLabel(const SDNode *N) {
197 if (N->getOpcode() == ISD::LABEL)
198 Zero = N->getOperand(2);
199 else if (N->isTargetOpcode() &&
200 N->getTargetOpcode() == TargetInstrInfo::LABEL)
201 // Chain moved to last operand.
202 Zero = N->getOperand(1);
205 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue();
208 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
209 /// when given the operation for (X op Y).
210 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
211 // To perform this operation, we just need to swap the L and G bits of the
213 unsigned OldL = (Operation >> 2) & 1;
214 unsigned OldG = (Operation >> 1) & 1;
215 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
216 (OldL << 1) | // New G bit
217 (OldG << 2)); // New L bit.
220 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
221 /// 'op' is a valid SetCC operation.
222 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
223 unsigned Operation = Op;
225 Operation ^= 7; // Flip L, G, E bits, but not U.
227 Operation ^= 15; // Flip all of the condition bits.
228 if (Operation > ISD::SETTRUE2)
229 Operation &= ~8; // Don't let N and U bits get set.
230 return ISD::CondCode(Operation);
234 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
235 /// signed operation and 2 if the result is an unsigned comparison. Return zero
236 /// if the operation does not depend on the sign of the input (setne and seteq).
237 static int isSignedOp(ISD::CondCode Opcode) {
239 default: assert(0 && "Illegal integer setcc operation!");
241 case ISD::SETNE: return 0;
245 case ISD::SETGE: return 1;
249 case ISD::SETUGE: return 2;
253 /// getSetCCOrOperation - Return the result of a logical OR between different
254 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
255 /// returns SETCC_INVALID if it is not possible to represent the resultant
257 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
259 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
260 // Cannot fold a signed integer setcc with an unsigned integer setcc.
261 return ISD::SETCC_INVALID;
263 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
265 // If the N and U bits get set then the resultant comparison DOES suddenly
266 // care about orderedness, and is true when ordered.
267 if (Op > ISD::SETTRUE2)
268 Op &= ~16; // Clear the U bit if the N bit is set.
270 // Canonicalize illegal integer setcc's.
271 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
274 return ISD::CondCode(Op);
277 /// getSetCCAndOperation - Return the result of a logical AND between different
278 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
279 /// function returns zero if it is not possible to represent the resultant
281 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
283 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
284 // Cannot fold a signed setcc with an unsigned setcc.
285 return ISD::SETCC_INVALID;
287 // Combine all of the condition bits.
288 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
290 // Canonicalize illegal integer setcc's.
294 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
295 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
296 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
297 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
304 const TargetMachine &SelectionDAG::getTarget() const {
305 return TLI.getTargetMachine();
308 //===----------------------------------------------------------------------===//
309 // SDNode Profile Support
310 //===----------------------------------------------------------------------===//
312 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
314 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
318 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
319 /// solely with their pointer.
320 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
321 ID.AddPointer(VTList.VTs);
324 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
326 static void AddNodeIDOperands(FoldingSetNodeID &ID,
327 const SDOperand *Ops, unsigned NumOps) {
328 for (; NumOps; --NumOps, ++Ops) {
329 ID.AddPointer(Ops->Val);
330 ID.AddInteger(Ops->ResNo);
334 static void AddNodeIDNode(FoldingSetNodeID &ID,
335 unsigned short OpC, SDVTList VTList,
336 const SDOperand *OpList, unsigned N) {
337 AddNodeIDOpcode(ID, OpC);
338 AddNodeIDValueTypes(ID, VTList);
339 AddNodeIDOperands(ID, OpList, N);
342 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
344 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
345 AddNodeIDOpcode(ID, N->getOpcode());
346 // Add the return value info.
347 AddNodeIDValueTypes(ID, N->getVTList());
348 // Add the operand info.
349 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
351 // Handle SDNode leafs with special info.
352 switch (N->getOpcode()) {
353 default: break; // Normal nodes don't need extra info.
354 case ISD::TargetConstant:
356 ID.Add(cast<ConstantSDNode>(N)->getAPIntValue());
358 case ISD::TargetConstantFP:
359 case ISD::ConstantFP: {
360 ID.Add(cast<ConstantFPSDNode>(N)->getValueAPF());
363 case ISD::TargetGlobalAddress:
364 case ISD::GlobalAddress:
365 case ISD::TargetGlobalTLSAddress:
366 case ISD::GlobalTLSAddress: {
367 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
368 ID.AddPointer(GA->getGlobal());
369 ID.AddInteger(GA->getOffset());
372 case ISD::BasicBlock:
373 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
376 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
379 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue());
381 case ISD::MEMOPERAND: {
382 const MemOperand &MO = cast<MemOperandSDNode>(N)->MO;
383 ID.AddPointer(MO.getValue());
384 ID.AddInteger(MO.getFlags());
385 ID.AddInteger(MO.getOffset());
386 ID.AddInteger(MO.getSize());
387 ID.AddInteger(MO.getAlignment());
390 case ISD::FrameIndex:
391 case ISD::TargetFrameIndex:
392 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
395 case ISD::TargetJumpTable:
396 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
398 case ISD::ConstantPool:
399 case ISD::TargetConstantPool: {
400 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
401 ID.AddInteger(CP->getAlignment());
402 ID.AddInteger(CP->getOffset());
403 if (CP->isMachineConstantPoolEntry())
404 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
406 ID.AddPointer(CP->getConstVal());
410 LoadSDNode *LD = cast<LoadSDNode>(N);
411 ID.AddInteger(LD->getAddressingMode());
412 ID.AddInteger(LD->getExtensionType());
413 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
414 ID.AddInteger(LD->getAlignment());
415 ID.AddInteger(LD->isVolatile());
419 StoreSDNode *ST = cast<StoreSDNode>(N);
420 ID.AddInteger(ST->getAddressingMode());
421 ID.AddInteger(ST->isTruncatingStore());
422 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
423 ID.AddInteger(ST->getAlignment());
424 ID.AddInteger(ST->isVolatile());
430 //===----------------------------------------------------------------------===//
431 // SelectionDAG Class
432 //===----------------------------------------------------------------------===//
434 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
436 void SelectionDAG::RemoveDeadNodes() {
437 // Create a dummy node (which is not added to allnodes), that adds a reference
438 // to the root node, preventing it from being deleted.
439 HandleSDNode Dummy(getRoot());
441 SmallVector<SDNode*, 128> DeadNodes;
443 // Add all obviously-dead nodes to the DeadNodes worklist.
444 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
446 DeadNodes.push_back(I);
448 // Process the worklist, deleting the nodes and adding their uses to the
450 while (!DeadNodes.empty()) {
451 SDNode *N = DeadNodes.back();
452 DeadNodes.pop_back();
454 // Take the node out of the appropriate CSE map.
455 RemoveNodeFromCSEMaps(N);
457 // Next, brutally remove the operand list. This is safe to do, as there are
458 // no cycles in the graph.
459 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
460 SDNode *Operand = I->Val;
461 Operand->removeUser(N);
463 // Now that we removed this operand, see if there are no uses of it left.
464 if (Operand->use_empty())
465 DeadNodes.push_back(Operand);
467 if (N->OperandsNeedDelete)
468 delete[] N->OperandList;
472 // Finally, remove N itself.
476 // If the root changed (e.g. it was a dead load, update the root).
477 setRoot(Dummy.getValue());
480 void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
481 SmallVector<SDNode*, 16> DeadNodes;
482 DeadNodes.push_back(N);
484 // Process the worklist, deleting the nodes and adding their uses to the
486 while (!DeadNodes.empty()) {
487 SDNode *N = DeadNodes.back();
488 DeadNodes.pop_back();
491 UpdateListener->NodeDeleted(N);
493 // Take the node out of the appropriate CSE map.
494 RemoveNodeFromCSEMaps(N);
496 // Next, brutally remove the operand list. This is safe to do, as there are
497 // no cycles in the graph.
498 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
499 SDNode *Operand = I->Val;
500 Operand->removeUser(N);
502 // Now that we removed this operand, see if there are no uses of it left.
503 if (Operand->use_empty())
504 DeadNodes.push_back(Operand);
506 if (N->OperandsNeedDelete)
507 delete[] N->OperandList;
511 // Finally, remove N itself.
516 void SelectionDAG::DeleteNode(SDNode *N) {
517 assert(N->use_empty() && "Cannot delete a node that is not dead!");
519 // First take this out of the appropriate CSE map.
520 RemoveNodeFromCSEMaps(N);
522 // Finally, remove uses due to operands of this node, remove from the
523 // AllNodes list, and delete the node.
524 DeleteNodeNotInCSEMaps(N);
527 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
529 // Remove it from the AllNodes list.
532 // Drop all of the operands and decrement used nodes use counts.
533 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
534 I->Val->removeUser(N);
535 if (N->OperandsNeedDelete)
536 delete[] N->OperandList;
543 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
544 /// correspond to it. This is useful when we're about to delete or repurpose
545 /// the node. We don't want future request for structurally identical nodes
546 /// to return N anymore.
547 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
549 switch (N->getOpcode()) {
550 case ISD::HANDLENODE: return; // noop.
552 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
555 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
556 "Cond code doesn't exist!");
557 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
558 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
560 case ISD::ExternalSymbol:
561 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
563 case ISD::TargetExternalSymbol:
565 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
567 case ISD::VALUETYPE: {
568 MVT::ValueType VT = cast<VTSDNode>(N)->getVT();
569 if (MVT::isExtendedVT(VT)) {
570 Erased = ExtendedValueTypeNodes.erase(VT);
572 Erased = ValueTypeNodes[VT] != 0;
573 ValueTypeNodes[VT] = 0;
578 // Remove it from the CSE Map.
579 Erased = CSEMap.RemoveNode(N);
583 // Verify that the node was actually in one of the CSE maps, unless it has a
584 // flag result (which cannot be CSE'd) or is one of the special cases that are
585 // not subject to CSE.
586 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
587 !N->isTargetOpcode()) {
590 assert(0 && "Node is not in map!");
595 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
596 /// has been taken out and modified in some way. If the specified node already
597 /// exists in the CSE maps, do not modify the maps, but return the existing node
598 /// instead. If it doesn't exist, add it and return null.
600 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
601 assert(N->getNumOperands() && "This is a leaf node!");
602 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
603 return 0; // Never add these nodes.
605 // Check that remaining values produced are not flags.
606 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
607 if (N->getValueType(i) == MVT::Flag)
608 return 0; // Never CSE anything that produces a flag.
610 SDNode *New = CSEMap.GetOrInsertNode(N);
611 if (New != N) return New; // Node already existed.
615 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
616 /// were replaced with those specified. If this node is never memoized,
617 /// return null, otherwise return a pointer to the slot it would take. If a
618 /// node already exists with these operands, the slot will be non-null.
619 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
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.
629 SDOperand Ops[] = { Op };
631 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
632 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
635 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
636 /// were replaced with those specified. If this node is never memoized,
637 /// return null, otherwise return a pointer to the slot it would take. If a
638 /// node already exists with these operands, the slot will be non-null.
639 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
640 SDOperand Op1, SDOperand Op2,
642 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
643 return 0; // Never add these nodes.
645 // Check that remaining values produced are not flags.
646 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
647 if (N->getValueType(i) == MVT::Flag)
648 return 0; // Never CSE anything that produces a flag.
650 SDOperand Ops[] = { Op1, Op2 };
652 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
653 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
657 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
658 /// were replaced with those specified. If this node is never memoized,
659 /// return null, otherwise return a pointer to the slot it would take. If a
660 /// node already exists with these operands, the slot will be non-null.
661 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
662 const SDOperand *Ops,unsigned NumOps,
664 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
665 return 0; // Never add these nodes.
667 // Check that remaining values produced are not flags.
668 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
669 if (N->getValueType(i) == MVT::Flag)
670 return 0; // Never CSE anything that produces a flag.
673 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
675 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
676 ID.AddInteger(LD->getAddressingMode());
677 ID.AddInteger(LD->getExtensionType());
678 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
679 ID.AddInteger(LD->getAlignment());
680 ID.AddInteger(LD->isVolatile());
681 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
682 ID.AddInteger(ST->getAddressingMode());
683 ID.AddInteger(ST->isTruncatingStore());
684 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
685 ID.AddInteger(ST->getAlignment());
686 ID.AddInteger(ST->isVolatile());
689 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
693 SelectionDAG::~SelectionDAG() {
694 while (!AllNodes.empty()) {
695 SDNode *N = AllNodes.begin();
696 N->SetNextInBucket(0);
697 if (N->OperandsNeedDelete)
698 delete [] N->OperandList;
701 AllNodes.pop_front();
705 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
706 if (Op.getValueType() == VT) return Op;
707 APInt Imm = APInt::getLowBitsSet(Op.getValueSizeInBits(),
708 MVT::getSizeInBits(VT));
709 return getNode(ISD::AND, Op.getValueType(), Op,
710 getConstant(Imm, Op.getValueType()));
713 SDOperand SelectionDAG::getString(const std::string &Val) {
714 StringSDNode *&N = StringNodes[Val];
716 N = new StringSDNode(Val);
717 AllNodes.push_back(N);
719 return SDOperand(N, 0);
722 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
723 MVT::ValueType EltVT =
724 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
726 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT);
729 SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) {
730 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
732 MVT::ValueType EltVT =
733 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
735 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) &&
736 "APInt size does not match type size!");
738 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
740 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
744 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
745 if (!MVT::isVector(VT))
746 return SDOperand(N, 0);
748 N = new ConstantSDNode(isT, Val, EltVT);
749 CSEMap.InsertNode(N, IP);
750 AllNodes.push_back(N);
753 SDOperand Result(N, 0);
754 if (MVT::isVector(VT)) {
755 SmallVector<SDOperand, 8> Ops;
756 Ops.assign(MVT::getVectorNumElements(VT), Result);
757 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
762 SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) {
763 return getConstant(Val, TLI.getPointerTy(), isTarget);
767 SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
769 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
771 MVT::ValueType EltVT =
772 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
774 // Do the map lookup using the actual bit pattern for the floating point
775 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
776 // we don't have issues with SNANs.
777 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
779 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
783 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
784 if (!MVT::isVector(VT))
785 return SDOperand(N, 0);
787 N = new ConstantFPSDNode(isTarget, V, EltVT);
788 CSEMap.InsertNode(N, IP);
789 AllNodes.push_back(N);
792 SDOperand Result(N, 0);
793 if (MVT::isVector(VT)) {
794 SmallVector<SDOperand, 8> Ops;
795 Ops.assign(MVT::getVectorNumElements(VT), Result);
796 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
801 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
803 MVT::ValueType EltVT =
804 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
806 return getConstantFP(APFloat((float)Val), VT, isTarget);
808 return getConstantFP(APFloat(Val), VT, isTarget);
811 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
812 MVT::ValueType VT, int Offset,
814 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
816 if (GVar && GVar->isThreadLocal())
817 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
819 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
821 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
823 ID.AddInteger(Offset);
825 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
826 return SDOperand(E, 0);
827 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
828 CSEMap.InsertNode(N, IP);
829 AllNodes.push_back(N);
830 return SDOperand(N, 0);
833 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
835 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
837 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
840 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
841 return SDOperand(E, 0);
842 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
843 CSEMap.InsertNode(N, IP);
844 AllNodes.push_back(N);
845 return SDOperand(N, 0);
848 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
849 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
851 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
854 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
855 return SDOperand(E, 0);
856 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
857 CSEMap.InsertNode(N, IP);
858 AllNodes.push_back(N);
859 return SDOperand(N, 0);
862 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
863 unsigned Alignment, int Offset,
865 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
867 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
868 ID.AddInteger(Alignment);
869 ID.AddInteger(Offset);
872 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
873 return SDOperand(E, 0);
874 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
875 CSEMap.InsertNode(N, IP);
876 AllNodes.push_back(N);
877 return SDOperand(N, 0);
881 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
883 unsigned Alignment, int Offset,
885 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
887 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
888 ID.AddInteger(Alignment);
889 ID.AddInteger(Offset);
890 C->AddSelectionDAGCSEId(ID);
892 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
893 return SDOperand(E, 0);
894 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
895 CSEMap.InsertNode(N, IP);
896 AllNodes.push_back(N);
897 return SDOperand(N, 0);
901 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
903 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
906 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
907 return SDOperand(E, 0);
908 SDNode *N = new BasicBlockSDNode(MBB);
909 CSEMap.InsertNode(N, IP);
910 AllNodes.push_back(N);
911 return SDOperand(N, 0);
914 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
915 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size())
916 ValueTypeNodes.resize(VT+1);
918 SDNode *&N = MVT::isExtendedVT(VT) ?
919 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT];
921 if (N) return SDOperand(N, 0);
922 N = new VTSDNode(VT);
923 AllNodes.push_back(N);
924 return SDOperand(N, 0);
927 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
928 SDNode *&N = ExternalSymbols[Sym];
929 if (N) return SDOperand(N, 0);
930 N = new ExternalSymbolSDNode(false, Sym, VT);
931 AllNodes.push_back(N);
932 return SDOperand(N, 0);
935 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
937 SDNode *&N = TargetExternalSymbols[Sym];
938 if (N) return SDOperand(N, 0);
939 N = new ExternalSymbolSDNode(true, Sym, VT);
940 AllNodes.push_back(N);
941 return SDOperand(N, 0);
944 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
945 if ((unsigned)Cond >= CondCodeNodes.size())
946 CondCodeNodes.resize(Cond+1);
948 if (CondCodeNodes[Cond] == 0) {
949 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
950 AllNodes.push_back(CondCodeNodes[Cond]);
952 return SDOperand(CondCodeNodes[Cond], 0);
955 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
957 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
958 ID.AddInteger(RegNo);
960 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
961 return SDOperand(E, 0);
962 SDNode *N = new RegisterSDNode(RegNo, VT);
963 CSEMap.InsertNode(N, IP);
964 AllNodes.push_back(N);
965 return SDOperand(N, 0);
968 SDOperand SelectionDAG::getSrcValue(const Value *V) {
969 assert((!V || isa<PointerType>(V->getType())) &&
970 "SrcValue is not a pointer?");
973 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
977 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
978 return SDOperand(E, 0);
980 SDNode *N = new SrcValueSDNode(V);
981 CSEMap.InsertNode(N, IP);
982 AllNodes.push_back(N);
983 return SDOperand(N, 0);
986 SDOperand SelectionDAG::getMemOperand(const MemOperand &MO) {
987 const Value *v = MO.getValue();
988 assert((!v || isa<PointerType>(v->getType())) &&
989 "SrcValue is not a pointer?");
992 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), 0, 0);
994 ID.AddInteger(MO.getFlags());
995 ID.AddInteger(MO.getOffset());
996 ID.AddInteger(MO.getSize());
997 ID.AddInteger(MO.getAlignment());
1000 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1001 return SDOperand(E, 0);
1003 SDNode *N = new MemOperandSDNode(MO);
1004 CSEMap.InsertNode(N, IP);
1005 AllNodes.push_back(N);
1006 return SDOperand(N, 0);
1009 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
1010 /// specified value type.
1011 SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) {
1012 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
1013 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
1014 const Type *Ty = MVT::getTypeForValueType(VT);
1015 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty);
1016 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign);
1017 return getFrameIndex(FrameIdx, TLI.getPointerTy());
1021 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
1022 SDOperand N2, ISD::CondCode Cond) {
1023 // These setcc operations always fold.
1027 case ISD::SETFALSE2: return getConstant(0, VT);
1029 case ISD::SETTRUE2: return getConstant(1, VT);
1041 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
1045 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
1046 const APInt &C2 = N2C->getAPIntValue();
1047 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
1048 const APInt &C1 = N1C->getAPIntValue();
1051 default: assert(0 && "Unknown integer setcc!");
1052 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1053 case ISD::SETNE: return getConstant(C1 != C2, VT);
1054 case ISD::SETULT: return getConstant(C1.ult(C2), VT);
1055 case ISD::SETUGT: return getConstant(C1.ugt(C2), VT);
1056 case ISD::SETULE: return getConstant(C1.ule(C2), VT);
1057 case ISD::SETUGE: return getConstant(C1.uge(C2), VT);
1058 case ISD::SETLT: return getConstant(C1.slt(C2), VT);
1059 case ISD::SETGT: return getConstant(C1.sgt(C2), VT);
1060 case ISD::SETLE: return getConstant(C1.sle(C2), VT);
1061 case ISD::SETGE: return getConstant(C1.sge(C2), VT);
1065 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) {
1066 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
1067 // No compile time operations on this type yet.
1068 if (N1C->getValueType(0) == MVT::ppcf128)
1071 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
1074 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
1075 return getNode(ISD::UNDEF, VT);
1077 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
1078 case ISD::SETNE: if (R==APFloat::cmpUnordered)
1079 return getNode(ISD::UNDEF, VT);
1081 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
1082 R==APFloat::cmpLessThan, VT);
1083 case ISD::SETLT: if (R==APFloat::cmpUnordered)
1084 return getNode(ISD::UNDEF, VT);
1086 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1087 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1088 return getNode(ISD::UNDEF, VT);
1090 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1091 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1092 return getNode(ISD::UNDEF, VT);
1094 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
1095 R==APFloat::cmpEqual, VT);
1096 case ISD::SETGE: if (R==APFloat::cmpUnordered)
1097 return getNode(ISD::UNDEF, VT);
1099 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
1100 R==APFloat::cmpEqual, VT);
1101 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1102 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1103 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1104 R==APFloat::cmpEqual, VT);
1105 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1106 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1107 R==APFloat::cmpLessThan, VT);
1108 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1109 R==APFloat::cmpUnordered, VT);
1110 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1111 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
1114 // Ensure that the constant occurs on the RHS.
1115 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1119 // Could not fold it.
1123 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
1124 /// use this predicate to simplify operations downstream.
1125 bool SelectionDAG::SignBitIsZero(SDOperand Op, unsigned Depth) const {
1126 unsigned BitWidth = Op.getValueSizeInBits();
1127 return MaskedValueIsZero(Op, APInt::getSignBit(BitWidth), Depth);
1130 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1131 /// this predicate to simplify operations downstream. Mask is known to be zero
1132 /// for bits that V cannot have.
1133 bool SelectionDAG::MaskedValueIsZero(SDOperand Op, const APInt &Mask,
1134 unsigned Depth) const {
1135 APInt KnownZero, KnownOne;
1136 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1137 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1138 return (KnownZero & Mask) == Mask;
1141 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
1142 /// known to be either zero or one and return them in the KnownZero/KnownOne
1143 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1145 void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask,
1146 APInt &KnownZero, APInt &KnownOne,
1147 unsigned Depth) const {
1148 unsigned BitWidth = Mask.getBitWidth();
1149 assert(BitWidth == MVT::getSizeInBits(Op.getValueType()) &&
1150 "Mask size mismatches value type size!");
1152 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
1153 if (Depth == 6 || Mask == 0)
1154 return; // Limit search depth.
1156 APInt KnownZero2, KnownOne2;
1158 switch (Op.getOpcode()) {
1160 // We know all of the bits for a constant!
1161 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask;
1162 KnownZero = ~KnownOne & Mask;
1165 // If either the LHS or the RHS are Zero, the result is zero.
1166 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1167 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero,
1168 KnownZero2, KnownOne2, Depth+1);
1169 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1170 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1172 // Output known-1 bits are only known if set in both the LHS & RHS.
1173 KnownOne &= KnownOne2;
1174 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1175 KnownZero |= KnownZero2;
1178 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1179 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne,
1180 KnownZero2, KnownOne2, Depth+1);
1181 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1182 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1184 // Output known-0 bits are only known if clear in both the LHS & RHS.
1185 KnownZero &= KnownZero2;
1186 // Output known-1 are known to be set if set in either the LHS | RHS.
1187 KnownOne |= KnownOne2;
1190 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1191 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1192 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1193 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1195 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1196 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1197 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1198 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1199 KnownZero = KnownZeroOut;
1203 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1204 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1205 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1206 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1208 // Only known if known in both the LHS and RHS.
1209 KnownOne &= KnownOne2;
1210 KnownZero &= KnownZero2;
1212 case ISD::SELECT_CC:
1213 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1214 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1215 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1216 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1218 // Only known if known in both the LHS and RHS.
1219 KnownOne &= KnownOne2;
1220 KnownZero &= KnownZero2;
1223 // If we know the result of a setcc has the top bits zero, use this info.
1224 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult &&
1226 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1229 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1230 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1231 unsigned ShAmt = SA->getValue();
1233 // If the shift count is an invalid immediate, don't do anything.
1234 if (ShAmt >= BitWidth)
1237 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(ShAmt),
1238 KnownZero, KnownOne, Depth+1);
1239 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1240 KnownZero <<= ShAmt;
1242 // low bits known zero.
1243 KnownZero |= APInt::getLowBitsSet(BitWidth, ShAmt);
1247 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1248 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1249 unsigned ShAmt = SA->getValue();
1251 // If the shift count is an invalid immediate, don't do anything.
1252 if (ShAmt >= BitWidth)
1255 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt),
1256 KnownZero, KnownOne, Depth+1);
1257 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1258 KnownZero = KnownZero.lshr(ShAmt);
1259 KnownOne = KnownOne.lshr(ShAmt);
1261 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1262 KnownZero |= HighBits; // High bits known zero.
1266 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1267 unsigned ShAmt = SA->getValue();
1269 // If the shift count is an invalid immediate, don't do anything.
1270 if (ShAmt >= BitWidth)
1273 APInt InDemandedMask = (Mask << ShAmt);
1274 // If any of the demanded bits are produced by the sign extension, we also
1275 // demand the input sign bit.
1276 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1277 if (HighBits.getBoolValue())
1278 InDemandedMask |= APInt::getSignBit(BitWidth);
1280 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1282 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1283 KnownZero = KnownZero.lshr(ShAmt);
1284 KnownOne = KnownOne.lshr(ShAmt);
1286 // Handle the sign bits.
1287 APInt SignBit = APInt::getSignBit(BitWidth);
1288 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask.
1290 if (KnownZero.intersects(SignBit)) {
1291 KnownZero |= HighBits; // New bits are known zero.
1292 } else if (KnownOne.intersects(SignBit)) {
1293 KnownOne |= HighBits; // New bits are known one.
1297 case ISD::SIGN_EXTEND_INREG: {
1298 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1299 unsigned EBits = MVT::getSizeInBits(EVT);
1301 // Sign extension. Compute the demanded bits in the result that are not
1302 // present in the input.
1303 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask;
1305 APInt InSignBit = APInt::getSignBit(EBits);
1306 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits);
1308 // If the sign extended bits are demanded, we know that the sign
1310 InSignBit.zext(BitWidth);
1311 if (NewBits.getBoolValue())
1312 InputDemandedBits |= InSignBit;
1314 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1315 KnownZero, KnownOne, Depth+1);
1316 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1318 // If the sign bit of the input is known set or clear, then we know the
1319 // top bits of the result.
1320 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear
1321 KnownZero |= NewBits;
1322 KnownOne &= ~NewBits;
1323 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
1324 KnownOne |= NewBits;
1325 KnownZero &= ~NewBits;
1326 } else { // Input sign bit unknown
1327 KnownZero &= ~NewBits;
1328 KnownOne &= ~NewBits;
1335 unsigned LowBits = Log2_32(BitWidth)+1;
1336 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits);
1337 KnownOne = APInt(BitWidth, 0);
1341 if (ISD::isZEXTLoad(Op.Val)) {
1342 LoadSDNode *LD = cast<LoadSDNode>(Op);
1343 MVT::ValueType VT = LD->getMemoryVT();
1344 unsigned MemBits = MVT::getSizeInBits(VT);
1345 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask;
1349 case ISD::ZERO_EXTEND: {
1350 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1351 unsigned InBits = MVT::getSizeInBits(InVT);
1352 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1353 APInt InMask = Mask;
1354 InMask.trunc(InBits);
1355 KnownZero.trunc(InBits);
1356 KnownOne.trunc(InBits);
1357 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1358 KnownZero.zext(BitWidth);
1359 KnownOne.zext(BitWidth);
1360 KnownZero |= NewBits;
1363 case ISD::SIGN_EXTEND: {
1364 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1365 unsigned InBits = MVT::getSizeInBits(InVT);
1366 APInt InSignBit = APInt::getSignBit(InBits);
1367 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1368 APInt InMask = Mask;
1369 InMask.trunc(InBits);
1371 // If any of the sign extended bits are demanded, we know that the sign
1372 // bit is demanded. Temporarily set this bit in the mask for our callee.
1373 if (NewBits.getBoolValue())
1374 InMask |= InSignBit;
1376 KnownZero.trunc(InBits);
1377 KnownOne.trunc(InBits);
1378 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1380 // Note if the sign bit is known to be zero or one.
1381 bool SignBitKnownZero = KnownZero.isNegative();
1382 bool SignBitKnownOne = KnownOne.isNegative();
1383 assert(!(SignBitKnownZero && SignBitKnownOne) &&
1384 "Sign bit can't be known to be both zero and one!");
1386 // If the sign bit wasn't actually demanded by our caller, we don't
1387 // want it set in the KnownZero and KnownOne result values. Reset the
1388 // mask and reapply it to the result values.
1390 InMask.trunc(InBits);
1391 KnownZero &= InMask;
1394 KnownZero.zext(BitWidth);
1395 KnownOne.zext(BitWidth);
1397 // If the sign bit is known zero or one, the top bits match.
1398 if (SignBitKnownZero)
1399 KnownZero |= NewBits;
1400 else if (SignBitKnownOne)
1401 KnownOne |= NewBits;
1404 case ISD::ANY_EXTEND: {
1405 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1406 unsigned InBits = MVT::getSizeInBits(InVT);
1407 APInt InMask = Mask;
1408 InMask.trunc(InBits);
1409 KnownZero.trunc(InBits);
1410 KnownOne.trunc(InBits);
1411 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1412 KnownZero.zext(BitWidth);
1413 KnownOne.zext(BitWidth);
1416 case ISD::TRUNCATE: {
1417 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1418 unsigned InBits = MVT::getSizeInBits(InVT);
1419 APInt InMask = Mask;
1420 InMask.zext(InBits);
1421 KnownZero.zext(InBits);
1422 KnownOne.zext(InBits);
1423 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1424 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1425 KnownZero.trunc(BitWidth);
1426 KnownOne.trunc(BitWidth);
1429 case ISD::AssertZext: {
1430 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1431 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT));
1432 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1434 KnownZero |= (~InMask) & Mask;
1438 // All bits are zero except the low bit.
1439 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1443 // If either the LHS or the RHS are Zero, the result is zero.
1444 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1445 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1446 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1447 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1449 // Output known-0 bits are known if clear or set in both the low clear bits
1450 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1451 // low 3 bits clear.
1452 unsigned KnownZeroOut = std::min(KnownZero.countTrailingOnes(),
1453 KnownZero2.countTrailingOnes());
1455 KnownZero = APInt::getLowBitsSet(BitWidth, KnownZeroOut);
1456 KnownOne = APInt(BitWidth, 0);
1460 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1463 // We know that the top bits of C-X are clear if X contains less bits
1464 // than C (i.e. no wrap-around can happen). For example, 20-X is
1465 // positive if we can prove that X is >= 0 and < 16.
1466 if (CLHS->getAPIntValue().isNonNegative()) {
1467 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros();
1468 // NLZ can't be BitWidth with no sign bit
1469 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1);
1470 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1);
1472 // If all of the MaskV bits are known to be zero, then we know the output
1473 // top bits are zero, because we now know that the output is from [0-C].
1474 if ((KnownZero & MaskV) == MaskV) {
1475 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros();
1476 // Top bits known zero.
1477 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask;
1478 KnownOne = APInt(BitWidth, 0); // No one bits known.
1480 KnownZero = KnownOne = APInt(BitWidth, 0); // Otherwise, nothing known.
1486 // Allow the target to implement this method for its nodes.
1487 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1488 case ISD::INTRINSIC_WO_CHAIN:
1489 case ISD::INTRINSIC_W_CHAIN:
1490 case ISD::INTRINSIC_VOID:
1491 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1497 /// ComputeNumSignBits - Return the number of times the sign bit of the
1498 /// register is replicated into the other bits. We know that at least 1 bit
1499 /// is always equal to the sign bit (itself), but other cases can give us
1500 /// information. For example, immediately after an "SRA X, 2", we know that
1501 /// the top 3 bits are all equal to each other, so we return 3.
1502 unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1503 MVT::ValueType VT = Op.getValueType();
1504 assert(MVT::isInteger(VT) && "Invalid VT!");
1505 unsigned VTBits = MVT::getSizeInBits(VT);
1509 return 1; // Limit search depth.
1511 switch (Op.getOpcode()) {
1513 case ISD::AssertSext:
1514 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1515 return VTBits-Tmp+1;
1516 case ISD::AssertZext:
1517 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1520 case ISD::Constant: {
1521 uint64_t Val = cast<ConstantSDNode>(Op)->getValue();
1522 // If negative, invert the bits, then look at it.
1523 if (Val & MVT::getIntVTSignBit(VT))
1526 // Shift the bits so they are the leading bits in the int64_t.
1529 // Return # leading zeros. We use 'min' here in case Val was zero before
1530 // shifting. We don't want to return '64' as for an i32 "0".
1531 return std::min(VTBits, CountLeadingZeros_64(Val));
1534 case ISD::SIGN_EXTEND:
1535 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1536 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1538 case ISD::SIGN_EXTEND_INREG:
1539 // Max of the input and what this extends.
1540 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1543 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1544 return std::max(Tmp, Tmp2);
1547 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1548 // SRA X, C -> adds C sign bits.
1549 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1550 Tmp += C->getValue();
1551 if (Tmp > VTBits) Tmp = VTBits;
1555 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1556 // shl destroys sign bits.
1557 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1558 if (C->getValue() >= VTBits || // Bad shift.
1559 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1560 return Tmp - C->getValue();
1565 case ISD::XOR: // NOT is handled here.
1566 // Logical binary ops preserve the number of sign bits.
1567 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1568 if (Tmp == 1) return 1; // Early out.
1569 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1570 return std::min(Tmp, Tmp2);
1573 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1574 if (Tmp == 1) return 1; // Early out.
1575 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1576 return std::min(Tmp, Tmp2);
1579 // If setcc returns 0/-1, all bits are sign bits.
1580 if (TLI.getSetCCResultContents() ==
1581 TargetLowering::ZeroOrNegativeOneSetCCResult)
1586 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1587 unsigned RotAmt = C->getValue() & (VTBits-1);
1589 // Handle rotate right by N like a rotate left by 32-N.
1590 if (Op.getOpcode() == ISD::ROTR)
1591 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1593 // If we aren't rotating out all of the known-in sign bits, return the
1594 // number that are left. This handles rotl(sext(x), 1) for example.
1595 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1596 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1600 // Add can have at most one carry bit. Thus we know that the output
1601 // is, at worst, one more bit than the inputs.
1602 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1603 if (Tmp == 1) return 1; // Early out.
1605 // Special case decrementing a value (ADD X, -1):
1606 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1607 if (CRHS->isAllOnesValue()) {
1608 APInt KnownZero, KnownOne;
1609 APInt Mask = APInt::getAllOnesValue(VTBits);
1610 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1612 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1614 if ((KnownZero | APInt(VTBits, 1)) == Mask)
1617 // If we are subtracting one from a positive number, there is no carry
1618 // out of the result.
1619 if (KnownZero.isNegative())
1623 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1624 if (Tmp2 == 1) return 1;
1625 return std::min(Tmp, Tmp2)-1;
1629 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1630 if (Tmp2 == 1) return 1;
1633 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1634 if (CLHS->getValue() == 0) {
1635 APInt KnownZero, KnownOne;
1636 APInt Mask = APInt::getAllOnesValue(VTBits);
1637 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1638 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1640 if ((KnownZero | APInt(VTBits, 1)) == Mask)
1643 // If the input is known to be positive (the sign bit is known clear),
1644 // the output of the NEG has the same number of sign bits as the input.
1645 if (KnownZero.isNegative())
1648 // Otherwise, we treat this like a SUB.
1651 // Sub can have at most one carry bit. Thus we know that the output
1652 // is, at worst, one more bit than the inputs.
1653 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1654 if (Tmp == 1) return 1; // Early out.
1655 return std::min(Tmp, Tmp2)-1;
1658 // FIXME: it's tricky to do anything useful for this, but it is an important
1659 // case for targets like X86.
1663 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1664 if (Op.getOpcode() == ISD::LOAD) {
1665 LoadSDNode *LD = cast<LoadSDNode>(Op);
1666 unsigned ExtType = LD->getExtensionType();
1669 case ISD::SEXTLOAD: // '17' bits known
1670 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1671 return VTBits-Tmp+1;
1672 case ISD::ZEXTLOAD: // '16' bits known
1673 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1678 // Allow the target to implement this method for its nodes.
1679 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1680 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1681 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1682 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1683 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1684 if (NumBits > 1) return NumBits;
1687 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1688 // use this information.
1689 APInt KnownZero, KnownOne;
1690 APInt Mask = APInt::getAllOnesValue(VTBits);
1691 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1693 if (KnownZero.isNegative()) { // sign bit is 0
1695 } else if (KnownOne.isNegative()) { // sign bit is 1;
1702 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1703 // the number of identical bits in the top of the input value.
1705 Mask <<= Mask.getBitWidth()-VTBits;
1706 // Return # leading zeros. We use 'min' here in case Val was zero before
1707 // shifting. We don't want to return '64' as for an i32 "0".
1708 return std::min(VTBits, Mask.countLeadingZeros());
1712 bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const {
1713 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
1714 if (!GA) return false;
1715 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal());
1716 if (!GV) return false;
1717 MachineModuleInfo *MMI = getMachineModuleInfo();
1718 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV);
1722 /// getNode - Gets or creates the specified node.
1724 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1725 FoldingSetNodeID ID;
1726 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
1728 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1729 return SDOperand(E, 0);
1730 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
1731 CSEMap.InsertNode(N, IP);
1733 AllNodes.push_back(N);
1734 return SDOperand(N, 0);
1737 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1738 SDOperand Operand) {
1739 // Constant fold unary operations with an integer constant operand.
1740 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1741 const APInt &Val = C->getAPIntValue();
1742 unsigned BitWidth = MVT::getSizeInBits(VT);
1745 case ISD::SIGN_EXTEND: return getConstant(APInt(Val).sextOrTrunc(BitWidth), VT);
1746 case ISD::ANY_EXTEND:
1747 case ISD::ZERO_EXTEND:
1748 case ISD::TRUNCATE: return getConstant(APInt(Val).zextOrTrunc(BitWidth), VT);
1749 case ISD::UINT_TO_FP:
1750 case ISD::SINT_TO_FP: {
1751 const uint64_t zero[] = {0, 0};
1752 // No compile time operations on this type.
1753 if (VT==MVT::ppcf128)
1755 APFloat apf = APFloat(APInt(BitWidth, 2, zero));
1756 (void)apf.convertFromAPInt(Val,
1757 Opcode==ISD::SINT_TO_FP,
1758 APFloat::rmNearestTiesToEven);
1759 return getConstantFP(apf, VT);
1761 case ISD::BIT_CONVERT:
1762 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1763 return getConstantFP(Val.bitsToFloat(), VT);
1764 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1765 return getConstantFP(Val.bitsToDouble(), VT);
1768 return getConstant(Val.byteSwap(), VT);
1770 return getConstant(Val.countPopulation(), VT);
1772 return getConstant(Val.countLeadingZeros(), VT);
1774 return getConstant(Val.countTrailingZeros(), VT);
1778 // Constant fold unary operations with a floating point constant operand.
1779 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1780 APFloat V = C->getValueAPF(); // make copy
1781 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) {
1785 return getConstantFP(V, VT);
1788 return getConstantFP(V, VT);
1790 case ISD::FP_EXTEND:
1791 // This can return overflow, underflow, or inexact; we don't care.
1792 // FIXME need to be more flexible about rounding mode.
1793 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle :
1794 VT==MVT::f64 ? APFloat::IEEEdouble :
1795 VT==MVT::f80 ? APFloat::x87DoubleExtended :
1796 VT==MVT::f128 ? APFloat::IEEEquad :
1798 APFloat::rmNearestTiesToEven);
1799 return getConstantFP(V, VT);
1800 case ISD::FP_TO_SINT:
1801 case ISD::FP_TO_UINT: {
1803 assert(integerPartWidth >= 64);
1804 // FIXME need to be more flexible about rounding mode.
1805 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1806 Opcode==ISD::FP_TO_SINT,
1807 APFloat::rmTowardZero);
1808 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1810 return getConstant(x, VT);
1812 case ISD::BIT_CONVERT:
1813 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1814 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1815 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1816 return getConstant(V.convertToAPInt().getZExtValue(), VT);
1822 unsigned OpOpcode = Operand.Val->getOpcode();
1824 case ISD::TokenFactor:
1825 return Operand; // Factor of one node? No factor.
1826 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node");
1827 case ISD::FP_EXTEND:
1828 assert(MVT::isFloatingPoint(VT) &&
1829 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1830 if (Operand.getValueType() == VT) return Operand; // noop conversion.
1832 case ISD::SIGN_EXTEND:
1833 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1834 "Invalid SIGN_EXTEND!");
1835 if (Operand.getValueType() == VT) return Operand; // noop extension
1836 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1837 && "Invalid sext node, dst < src!");
1838 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1839 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1841 case ISD::ZERO_EXTEND:
1842 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1843 "Invalid ZERO_EXTEND!");
1844 if (Operand.getValueType() == VT) return Operand; // noop extension
1845 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1846 && "Invalid zext node, dst < src!");
1847 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1848 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1850 case ISD::ANY_EXTEND:
1851 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1852 "Invalid ANY_EXTEND!");
1853 if (Operand.getValueType() == VT) return Operand; // noop extension
1854 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1855 && "Invalid anyext node, dst < src!");
1856 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1857 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1858 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1861 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1862 "Invalid TRUNCATE!");
1863 if (Operand.getValueType() == VT) return Operand; // noop truncate
1864 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT)
1865 && "Invalid truncate node, src < dst!");
1866 if (OpOpcode == ISD::TRUNCATE)
1867 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1868 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1869 OpOpcode == ISD::ANY_EXTEND) {
1870 // If the source is smaller than the dest, we still need an extend.
1871 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1872 < MVT::getSizeInBits(VT))
1873 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1874 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1875 > MVT::getSizeInBits(VT))
1876 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1878 return Operand.Val->getOperand(0);
1881 case ISD::BIT_CONVERT:
1882 // Basic sanity checking.
1883 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1884 && "Cannot BIT_CONVERT between types of different sizes!");
1885 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1886 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1887 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1888 if (OpOpcode == ISD::UNDEF)
1889 return getNode(ISD::UNDEF, VT);
1891 case ISD::SCALAR_TO_VECTOR:
1892 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1893 MVT::getVectorElementType(VT) == Operand.getValueType() &&
1894 "Illegal SCALAR_TO_VECTOR node!");
1897 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1898 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1899 Operand.Val->getOperand(0));
1900 if (OpOpcode == ISD::FNEG) // --X -> X
1901 return Operand.Val->getOperand(0);
1904 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1905 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1910 SDVTList VTs = getVTList(VT);
1911 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1912 FoldingSetNodeID ID;
1913 SDOperand Ops[1] = { Operand };
1914 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1916 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1917 return SDOperand(E, 0);
1918 N = new UnarySDNode(Opcode, VTs, Operand);
1919 CSEMap.InsertNode(N, IP);
1921 N = new UnarySDNode(Opcode, VTs, Operand);
1923 AllNodes.push_back(N);
1924 return SDOperand(N, 0);
1929 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1930 SDOperand N1, SDOperand N2) {
1931 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
1932 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
1935 case ISD::TokenFactor:
1936 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
1937 N2.getValueType() == MVT::Other && "Invalid token factor!");
1938 // Fold trivial token factors.
1939 if (N1.getOpcode() == ISD::EntryToken) return N2;
1940 if (N2.getOpcode() == ISD::EntryToken) return N1;
1943 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
1944 N1.getValueType() == VT && "Binary operator types must match!");
1945 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
1946 // worth handling here.
1947 if (N2C && N2C->getValue() == 0)
1949 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X
1954 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
1955 N1.getValueType() == VT && "Binary operator types must match!");
1956 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
1957 // worth handling here.
1958 if (N2C && N2C->getValue() == 0)
1965 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
1977 assert(N1.getValueType() == N2.getValueType() &&
1978 N1.getValueType() == VT && "Binary operator types must match!");
1980 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
1981 assert(N1.getValueType() == VT &&
1982 MVT::isFloatingPoint(N1.getValueType()) &&
1983 MVT::isFloatingPoint(N2.getValueType()) &&
1984 "Invalid FCOPYSIGN!");
1991 assert(VT == N1.getValueType() &&
1992 "Shift operators return type must be the same as their first arg");
1993 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
1994 VT != MVT::i1 && "Shifts only work on integers");
1996 case ISD::FP_ROUND_INREG: {
1997 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
1998 assert(VT == N1.getValueType() && "Not an inreg round!");
1999 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
2000 "Cannot FP_ROUND_INREG integer types");
2001 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2002 "Not rounding down!");
2003 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2007 assert(MVT::isFloatingPoint(VT) &&
2008 MVT::isFloatingPoint(N1.getValueType()) &&
2009 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) &&
2010 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!");
2011 if (N1.getValueType() == VT) return N1; // noop conversion.
2013 case ISD::AssertSext:
2014 case ISD::AssertZext: {
2015 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2016 assert(VT == N1.getValueType() && "Not an inreg extend!");
2017 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2018 "Cannot *_EXTEND_INREG FP types");
2019 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2021 if (VT == EVT) return N1; // noop assertion.
2024 case ISD::SIGN_EXTEND_INREG: {
2025 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2026 assert(VT == N1.getValueType() && "Not an inreg extend!");
2027 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2028 "Cannot *_EXTEND_INREG FP types");
2029 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2031 if (EVT == VT) return N1; // Not actually extending
2034 APInt Val = N1C->getAPIntValue();
2035 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
2036 Val <<= Val.getBitWidth()-FromBits;
2037 Val = Val.lshr(Val.getBitWidth()-FromBits);
2038 return getConstant(Val, VT);
2042 case ISD::EXTRACT_VECTOR_ELT:
2043 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2045 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2046 // expanding copies of large vectors from registers.
2047 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2048 N1.getNumOperands() > 0) {
2050 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2051 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2052 N1.getOperand(N2C->getValue() / Factor),
2053 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2056 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2057 // expanding large vector constants.
2058 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2059 return N1.getOperand(N2C->getValue());
2061 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2062 // operations are lowered to scalars.
2063 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2064 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2066 return N1.getOperand(1);
2068 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2071 case ISD::EXTRACT_ELEMENT:
2072 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
2074 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2075 // 64-bit integers into 32-bit parts. Instead of building the extract of
2076 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2077 if (N1.getOpcode() == ISD::BUILD_PAIR)
2078 return N1.getOperand(N2C->getValue());
2080 // EXTRACT_ELEMENT of a constant int is also very common.
2081 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2082 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
2083 return getConstant(C->getValue() >> Shift, VT);
2086 case ISD::EXTRACT_SUBVECTOR:
2087 if (N1.getValueType() == VT) // Trivial extraction.
2094 APInt C1 = N1C->getAPIntValue(), C2 = N2C->getAPIntValue();
2096 case ISD::ADD: return getConstant(C1 + C2, VT);
2097 case ISD::SUB: return getConstant(C1 - C2, VT);
2098 case ISD::MUL: return getConstant(C1 * C2, VT);
2100 if (C2.getBoolValue()) return getConstant(C1.udiv(C2), VT);
2103 if (C2.getBoolValue()) return getConstant(C1.urem(C2), VT);
2106 if (C2.getBoolValue()) return getConstant(C1.sdiv(C2), VT);
2109 if (C2.getBoolValue()) return getConstant(C1.srem(C2), VT);
2111 case ISD::AND : return getConstant(C1 & C2, VT);
2112 case ISD::OR : return getConstant(C1 | C2, VT);
2113 case ISD::XOR : return getConstant(C1 ^ C2, VT);
2114 case ISD::SHL : return getConstant(C1 << C2, VT);
2115 case ISD::SRL : return getConstant(C1.lshr(C2), VT);
2116 case ISD::SRA : return getConstant(C1.ashr(C2), VT);
2117 case ISD::ROTL : return getConstant(C1.rotl(C2), VT);
2118 case ISD::ROTR : return getConstant(C1.rotr(C2), VT);
2121 } else { // Cannonicalize constant to RHS if commutative
2122 if (isCommutativeBinOp(Opcode)) {
2123 std::swap(N1C, N2C);
2129 // Constant fold FP operations.
2130 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
2131 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
2133 if (!N2CFP && isCommutativeBinOp(Opcode)) {
2134 // Cannonicalize constant to RHS if commutative
2135 std::swap(N1CFP, N2CFP);
2137 } else if (N2CFP && VT != MVT::ppcf128) {
2138 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
2139 APFloat::opStatus s;
2142 s = V1.add(V2, APFloat::rmNearestTiesToEven);
2143 if (s != APFloat::opInvalidOp)
2144 return getConstantFP(V1, VT);
2147 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
2148 if (s!=APFloat::opInvalidOp)
2149 return getConstantFP(V1, VT);
2152 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
2153 if (s!=APFloat::opInvalidOp)
2154 return getConstantFP(V1, VT);
2157 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
2158 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2159 return getConstantFP(V1, VT);
2162 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
2163 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2164 return getConstantFP(V1, VT);
2166 case ISD::FCOPYSIGN:
2168 return getConstantFP(V1, VT);
2174 // Canonicalize an UNDEF to the RHS, even over a constant.
2175 if (N1.getOpcode() == ISD::UNDEF) {
2176 if (isCommutativeBinOp(Opcode)) {
2180 case ISD::FP_ROUND_INREG:
2181 case ISD::SIGN_EXTEND_INREG:
2187 return N1; // fold op(undef, arg2) -> undef
2194 if (!MVT::isVector(VT))
2195 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2196 // For vectors, we can't easily build an all zero vector, just return
2203 // Fold a bunch of operators when the RHS is undef.
2204 if (N2.getOpcode() == ISD::UNDEF) {
2220 return N2; // fold op(arg1, undef) -> undef
2225 if (!MVT::isVector(VT))
2226 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2227 // For vectors, we can't easily build an all zero vector, just return
2231 if (!MVT::isVector(VT))
2232 return getConstant(MVT::getIntVTBitMask(VT), VT);
2233 // For vectors, we can't easily build an all one vector, just return
2241 // Memoize this node if possible.
2243 SDVTList VTs = getVTList(VT);
2244 if (VT != MVT::Flag) {
2245 SDOperand Ops[] = { N1, N2 };
2246 FoldingSetNodeID ID;
2247 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2249 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2250 return SDOperand(E, 0);
2251 N = new BinarySDNode(Opcode, VTs, N1, N2);
2252 CSEMap.InsertNode(N, IP);
2254 N = new BinarySDNode(Opcode, VTs, N1, N2);
2257 AllNodes.push_back(N);
2258 return SDOperand(N, 0);
2261 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2262 SDOperand N1, SDOperand N2, SDOperand N3) {
2263 // Perform various simplifications.
2264 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2265 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2268 // Use FoldSetCC to simplify SETCC's.
2269 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
2270 if (Simp.Val) return Simp;
2275 if (N1C->getValue())
2276 return N2; // select true, X, Y -> X
2278 return N3; // select false, X, Y -> Y
2281 if (N2 == N3) return N2; // select C, X, X -> X
2285 if (N2C->getValue()) // Unconditional branch
2286 return getNode(ISD::BR, MVT::Other, N1, N3);
2288 return N1; // Never-taken branch
2291 case ISD::VECTOR_SHUFFLE:
2292 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2293 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2294 N3.getOpcode() == ISD::BUILD_VECTOR &&
2295 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2296 "Illegal VECTOR_SHUFFLE node!");
2298 case ISD::BIT_CONVERT:
2299 // Fold bit_convert nodes from a type to themselves.
2300 if (N1.getValueType() == VT)
2305 // Memoize node if it doesn't produce a flag.
2307 SDVTList VTs = getVTList(VT);
2308 if (VT != MVT::Flag) {
2309 SDOperand Ops[] = { N1, N2, N3 };
2310 FoldingSetNodeID ID;
2311 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2313 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2314 return SDOperand(E, 0);
2315 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2316 CSEMap.InsertNode(N, IP);
2318 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2320 AllNodes.push_back(N);
2321 return SDOperand(N, 0);
2324 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2325 SDOperand N1, SDOperand N2, SDOperand N3,
2327 SDOperand Ops[] = { N1, N2, N3, N4 };
2328 return getNode(Opcode, VT, Ops, 4);
2331 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2332 SDOperand N1, SDOperand N2, SDOperand N3,
2333 SDOperand N4, SDOperand N5) {
2334 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2335 return getNode(Opcode, VT, Ops, 5);
2338 SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest,
2339 SDOperand Src, SDOperand Size,
2341 SDOperand AlwaysInline) {
2342 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2343 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6);
2346 SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest,
2347 SDOperand Src, SDOperand Size,
2349 SDOperand AlwaysInline) {
2350 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2351 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6);
2354 SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest,
2355 SDOperand Src, SDOperand Size,
2357 SDOperand AlwaysInline) {
2358 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2359 return getNode(ISD::MEMSET, MVT::Other, Ops, 6);
2362 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2363 SDOperand Ptr, SDOperand Cmp,
2364 SDOperand Swp, MVT::ValueType VT) {
2365 assert(Opcode == ISD::ATOMIC_LCS && "Invalid Atomic Op");
2366 assert(Cmp.getValueType() == Swp.getValueType() && "Invalid Atomic Op Types");
2367 SDVTList VTs = getVTList(Cmp.getValueType(), MVT::Other);
2368 FoldingSetNodeID ID;
2369 SDOperand Ops[] = {Chain, Ptr, Cmp, Swp};
2370 AddNodeIDNode(ID, Opcode, VTs, Ops, 4);
2371 ID.AddInteger((unsigned int)VT);
2373 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2374 return SDOperand(E, 0);
2375 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Cmp, Swp, VT);
2376 CSEMap.InsertNode(N, IP);
2377 AllNodes.push_back(N);
2378 return SDOperand(N, 0);
2381 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2382 SDOperand Ptr, SDOperand Val,
2383 MVT::ValueType VT) {
2384 assert((Opcode == ISD::ATOMIC_LAS || Opcode == ISD::ATOMIC_SWAP)
2385 && "Invalid Atomic Op");
2386 SDVTList VTs = getVTList(Val.getValueType(), MVT::Other);
2387 FoldingSetNodeID ID;
2388 SDOperand Ops[] = {Chain, Ptr, Val};
2389 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2390 ID.AddInteger((unsigned int)VT);
2392 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2393 return SDOperand(E, 0);
2394 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Val, VT);
2395 CSEMap.InsertNode(N, IP);
2396 AllNodes.push_back(N);
2397 return SDOperand(N, 0);
2400 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2401 SDOperand Chain, SDOperand Ptr,
2402 const Value *SV, int SVOffset,
2403 bool isVolatile, unsigned Alignment) {
2404 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2406 if (VT != MVT::iPTR) {
2407 Ty = MVT::getTypeForValueType(VT);
2409 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2410 assert(PT && "Value for load must be a pointer");
2411 Ty = PT->getElementType();
2413 assert(Ty && "Could not get type information for load");
2414 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2416 SDVTList VTs = getVTList(VT, MVT::Other);
2417 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2418 SDOperand Ops[] = { Chain, Ptr, Undef };
2419 FoldingSetNodeID ID;
2420 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2421 ID.AddInteger(ISD::UNINDEXED);
2422 ID.AddInteger(ISD::NON_EXTLOAD);
2423 ID.AddInteger((unsigned int)VT);
2424 ID.AddInteger(Alignment);
2425 ID.AddInteger(isVolatile);
2427 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2428 return SDOperand(E, 0);
2429 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
2430 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
2432 CSEMap.InsertNode(N, IP);
2433 AllNodes.push_back(N);
2434 return SDOperand(N, 0);
2437 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
2438 SDOperand Chain, SDOperand Ptr,
2440 int SVOffset, MVT::ValueType EVT,
2441 bool isVolatile, unsigned Alignment) {
2442 // If they are asking for an extending load from/to the same thing, return a
2445 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment);
2447 if (MVT::isVector(VT))
2448 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
2450 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) &&
2451 "Should only be an extending load, not truncating!");
2452 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2453 "Cannot sign/zero extend a FP/Vector load!");
2454 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2455 "Cannot convert from FP to Int or Int -> FP!");
2457 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2459 if (VT != MVT::iPTR) {
2460 Ty = MVT::getTypeForValueType(VT);
2462 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2463 assert(PT && "Value for load must be a pointer");
2464 Ty = PT->getElementType();
2466 assert(Ty && "Could not get type information for load");
2467 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2469 SDVTList VTs = getVTList(VT, MVT::Other);
2470 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2471 SDOperand Ops[] = { Chain, Ptr, Undef };
2472 FoldingSetNodeID ID;
2473 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2474 ID.AddInteger(ISD::UNINDEXED);
2475 ID.AddInteger(ExtType);
2476 ID.AddInteger((unsigned int)EVT);
2477 ID.AddInteger(Alignment);
2478 ID.AddInteger(isVolatile);
2480 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2481 return SDOperand(E, 0);
2482 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
2483 SV, SVOffset, Alignment, isVolatile);
2484 CSEMap.InsertNode(N, IP);
2485 AllNodes.push_back(N);
2486 return SDOperand(N, 0);
2490 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2491 SDOperand Offset, ISD::MemIndexedMode AM) {
2492 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
2493 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2494 "Load is already a indexed load!");
2495 MVT::ValueType VT = OrigLoad.getValueType();
2496 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
2497 SDOperand Ops[] = { LD->getChain(), Base, Offset };
2498 FoldingSetNodeID ID;
2499 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2501 ID.AddInteger(LD->getExtensionType());
2502 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
2503 ID.AddInteger(LD->getAlignment());
2504 ID.AddInteger(LD->isVolatile());
2506 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2507 return SDOperand(E, 0);
2508 SDNode *N = new LoadSDNode(Ops, VTs, AM,
2509 LD->getExtensionType(), LD->getMemoryVT(),
2510 LD->getSrcValue(), LD->getSrcValueOffset(),
2511 LD->getAlignment(), LD->isVolatile());
2512 CSEMap.InsertNode(N, IP);
2513 AllNodes.push_back(N);
2514 return SDOperand(N, 0);
2517 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
2518 SDOperand Ptr, const Value *SV, int SVOffset,
2519 bool isVolatile, unsigned Alignment) {
2520 MVT::ValueType VT = Val.getValueType();
2522 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2524 if (VT != MVT::iPTR) {
2525 Ty = MVT::getTypeForValueType(VT);
2527 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2528 assert(PT && "Value for store must be a pointer");
2529 Ty = PT->getElementType();
2531 assert(Ty && "Could not get type information for store");
2532 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2534 SDVTList VTs = getVTList(MVT::Other);
2535 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2536 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2537 FoldingSetNodeID ID;
2538 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2539 ID.AddInteger(ISD::UNINDEXED);
2540 ID.AddInteger(false);
2541 ID.AddInteger((unsigned int)VT);
2542 ID.AddInteger(Alignment);
2543 ID.AddInteger(isVolatile);
2545 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2546 return SDOperand(E, 0);
2547 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
2548 VT, SV, SVOffset, Alignment, isVolatile);
2549 CSEMap.InsertNode(N, IP);
2550 AllNodes.push_back(N);
2551 return SDOperand(N, 0);
2554 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
2555 SDOperand Ptr, const Value *SV,
2556 int SVOffset, MVT::ValueType SVT,
2557 bool isVolatile, unsigned Alignment) {
2558 MVT::ValueType VT = Val.getValueType();
2561 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment);
2563 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) &&
2564 "Not a truncation?");
2565 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
2566 "Can't do FP-INT conversion!");
2568 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2570 if (VT != MVT::iPTR) {
2571 Ty = MVT::getTypeForValueType(VT);
2573 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2574 assert(PT && "Value for store must be a pointer");
2575 Ty = PT->getElementType();
2577 assert(Ty && "Could not get type information for store");
2578 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2580 SDVTList VTs = getVTList(MVT::Other);
2581 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2582 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2583 FoldingSetNodeID ID;
2584 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2585 ID.AddInteger(ISD::UNINDEXED);
2587 ID.AddInteger((unsigned int)SVT);
2588 ID.AddInteger(Alignment);
2589 ID.AddInteger(isVolatile);
2591 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2592 return SDOperand(E, 0);
2593 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true,
2594 SVT, SV, SVOffset, Alignment, isVolatile);
2595 CSEMap.InsertNode(N, IP);
2596 AllNodes.push_back(N);
2597 return SDOperand(N, 0);
2601 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
2602 SDOperand Offset, ISD::MemIndexedMode AM) {
2603 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
2604 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
2605 "Store is already a indexed store!");
2606 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
2607 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
2608 FoldingSetNodeID ID;
2609 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2611 ID.AddInteger(ST->isTruncatingStore());
2612 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
2613 ID.AddInteger(ST->getAlignment());
2614 ID.AddInteger(ST->isVolatile());
2616 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2617 return SDOperand(E, 0);
2618 SDNode *N = new StoreSDNode(Ops, VTs, AM,
2619 ST->isTruncatingStore(), ST->getMemoryVT(),
2620 ST->getSrcValue(), ST->getSrcValueOffset(),
2621 ST->getAlignment(), ST->isVolatile());
2622 CSEMap.InsertNode(N, IP);
2623 AllNodes.push_back(N);
2624 return SDOperand(N, 0);
2627 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
2628 SDOperand Chain, SDOperand Ptr,
2630 SDOperand Ops[] = { Chain, Ptr, SV };
2631 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
2634 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2635 const SDOperand *Ops, unsigned NumOps) {
2637 case 0: return getNode(Opcode, VT);
2638 case 1: return getNode(Opcode, VT, Ops[0]);
2639 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
2640 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
2646 case ISD::SELECT_CC: {
2647 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
2648 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
2649 "LHS and RHS of condition must have same type!");
2650 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2651 "True and False arms of SelectCC must have same type!");
2652 assert(Ops[2].getValueType() == VT &&
2653 "select_cc node must be of same type as true and false value!");
2657 assert(NumOps == 5 && "BR_CC takes 5 operands!");
2658 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2659 "LHS/RHS of comparison should match types!");
2666 SDVTList VTs = getVTList(VT);
2667 if (VT != MVT::Flag) {
2668 FoldingSetNodeID ID;
2669 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
2671 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2672 return SDOperand(E, 0);
2673 N = new SDNode(Opcode, VTs, Ops, NumOps);
2674 CSEMap.InsertNode(N, IP);
2676 N = new SDNode(Opcode, VTs, Ops, NumOps);
2678 AllNodes.push_back(N);
2679 return SDOperand(N, 0);
2682 SDOperand SelectionDAG::getNode(unsigned Opcode,
2683 std::vector<MVT::ValueType> &ResultTys,
2684 const SDOperand *Ops, unsigned NumOps) {
2685 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
2689 SDOperand SelectionDAG::getNode(unsigned Opcode,
2690 const MVT::ValueType *VTs, unsigned NumVTs,
2691 const SDOperand *Ops, unsigned NumOps) {
2693 return getNode(Opcode, VTs[0], Ops, NumOps);
2694 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
2697 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2698 const SDOperand *Ops, unsigned NumOps) {
2699 if (VTList.NumVTs == 1)
2700 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
2703 // FIXME: figure out how to safely handle things like
2704 // int foo(int x) { return 1 << (x & 255); }
2705 // int bar() { return foo(256); }
2707 case ISD::SRA_PARTS:
2708 case ISD::SRL_PARTS:
2709 case ISD::SHL_PARTS:
2710 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2711 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
2712 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2713 else if (N3.getOpcode() == ISD::AND)
2714 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
2715 // If the and is only masking out bits that cannot effect the shift,
2716 // eliminate the and.
2717 unsigned NumBits = MVT::getSizeInBits(VT)*2;
2718 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2719 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2725 // Memoize the node unless it returns a flag.
2727 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
2728 FoldingSetNodeID ID;
2729 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
2731 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2732 return SDOperand(E, 0);
2734 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2735 else if (NumOps == 2)
2736 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2737 else if (NumOps == 3)
2738 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2740 N = new SDNode(Opcode, VTList, Ops, NumOps);
2741 CSEMap.InsertNode(N, IP);
2744 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2745 else if (NumOps == 2)
2746 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2747 else if (NumOps == 3)
2748 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2750 N = new SDNode(Opcode, VTList, Ops, NumOps);
2752 AllNodes.push_back(N);
2753 return SDOperand(N, 0);
2756 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) {
2757 return getNode(Opcode, VTList, 0, 0);
2760 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2762 SDOperand Ops[] = { N1 };
2763 return getNode(Opcode, VTList, Ops, 1);
2766 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2767 SDOperand N1, SDOperand N2) {
2768 SDOperand Ops[] = { N1, N2 };
2769 return getNode(Opcode, VTList, Ops, 2);
2772 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2773 SDOperand N1, SDOperand N2, SDOperand N3) {
2774 SDOperand Ops[] = { N1, N2, N3 };
2775 return getNode(Opcode, VTList, Ops, 3);
2778 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2779 SDOperand N1, SDOperand N2, SDOperand N3,
2781 SDOperand Ops[] = { N1, N2, N3, N4 };
2782 return getNode(Opcode, VTList, Ops, 4);
2785 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2786 SDOperand N1, SDOperand N2, SDOperand N3,
2787 SDOperand N4, SDOperand N5) {
2788 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2789 return getNode(Opcode, VTList, Ops, 5);
2792 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
2793 return makeVTList(SDNode::getValueTypeList(VT), 1);
2796 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
2797 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2798 E = VTList.end(); I != E; ++I) {
2799 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
2800 return makeVTList(&(*I)[0], 2);
2802 std::vector<MVT::ValueType> V;
2805 VTList.push_front(V);
2806 return makeVTList(&(*VTList.begin())[0], 2);
2808 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
2809 MVT::ValueType VT3) {
2810 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2811 E = VTList.end(); I != E; ++I) {
2812 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
2814 return makeVTList(&(*I)[0], 3);
2816 std::vector<MVT::ValueType> V;
2820 VTList.push_front(V);
2821 return makeVTList(&(*VTList.begin())[0], 3);
2824 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
2826 case 0: assert(0 && "Cannot have nodes without results!");
2827 case 1: return getVTList(VTs[0]);
2828 case 2: return getVTList(VTs[0], VTs[1]);
2829 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
2833 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2834 E = VTList.end(); I != E; ++I) {
2835 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
2837 bool NoMatch = false;
2838 for (unsigned i = 2; i != NumVTs; ++i)
2839 if (VTs[i] != (*I)[i]) {
2844 return makeVTList(&*I->begin(), NumVTs);
2847 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
2848 return makeVTList(&*VTList.begin()->begin(), NumVTs);
2852 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
2853 /// specified operands. If the resultant node already exists in the DAG,
2854 /// this does not modify the specified node, instead it returns the node that
2855 /// already exists. If the resultant node does not exist in the DAG, the
2856 /// input node is returned. As a degenerate case, if you specify the same
2857 /// input operands as the node already has, the input node is returned.
2858 SDOperand SelectionDAG::
2859 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
2860 SDNode *N = InN.Val;
2861 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
2863 // Check to see if there is no change.
2864 if (Op == N->getOperand(0)) return InN;
2866 // See if the modified node already exists.
2867 void *InsertPos = 0;
2868 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
2869 return SDOperand(Existing, InN.ResNo);
2871 // Nope it doesn't. Remove the node from it's current place in the maps.
2873 RemoveNodeFromCSEMaps(N);
2875 // Now we update the operands.
2876 N->OperandList[0].Val->removeUser(N);
2878 N->OperandList[0] = Op;
2880 // If this gets put into a CSE map, add it.
2881 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2885 SDOperand SelectionDAG::
2886 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
2887 SDNode *N = InN.Val;
2888 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
2890 // Check to see if there is no change.
2891 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
2892 return InN; // No operands changed, just return the input node.
2894 // See if the modified node already exists.
2895 void *InsertPos = 0;
2896 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
2897 return SDOperand(Existing, InN.ResNo);
2899 // Nope it doesn't. Remove the node from it's current place in the maps.
2901 RemoveNodeFromCSEMaps(N);
2903 // Now we update the operands.
2904 if (N->OperandList[0] != Op1) {
2905 N->OperandList[0].Val->removeUser(N);
2906 Op1.Val->addUser(N);
2907 N->OperandList[0] = Op1;
2909 if (N->OperandList[1] != Op2) {
2910 N->OperandList[1].Val->removeUser(N);
2911 Op2.Val->addUser(N);
2912 N->OperandList[1] = Op2;
2915 // If this gets put into a CSE map, add it.
2916 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2920 SDOperand SelectionDAG::
2921 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
2922 SDOperand Ops[] = { Op1, Op2, Op3 };
2923 return UpdateNodeOperands(N, Ops, 3);
2926 SDOperand SelectionDAG::
2927 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2928 SDOperand Op3, SDOperand Op4) {
2929 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
2930 return UpdateNodeOperands(N, Ops, 4);
2933 SDOperand SelectionDAG::
2934 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
2935 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
2936 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
2937 return UpdateNodeOperands(N, Ops, 5);
2941 SDOperand SelectionDAG::
2942 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
2943 SDNode *N = InN.Val;
2944 assert(N->getNumOperands() == NumOps &&
2945 "Update with wrong number of operands");
2947 // Check to see if there is no change.
2948 bool AnyChange = false;
2949 for (unsigned i = 0; i != NumOps; ++i) {
2950 if (Ops[i] != N->getOperand(i)) {
2956 // No operands changed, just return the input node.
2957 if (!AnyChange) return InN;
2959 // See if the modified node already exists.
2960 void *InsertPos = 0;
2961 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
2962 return SDOperand(Existing, InN.ResNo);
2964 // Nope it doesn't. Remove the node from it's current place in the maps.
2966 RemoveNodeFromCSEMaps(N);
2968 // Now we update the operands.
2969 for (unsigned i = 0; i != NumOps; ++i) {
2970 if (N->OperandList[i] != Ops[i]) {
2971 N->OperandList[i].Val->removeUser(N);
2972 Ops[i].Val->addUser(N);
2973 N->OperandList[i] = Ops[i];
2977 // If this gets put into a CSE map, add it.
2978 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2983 /// MorphNodeTo - This frees the operands of the current node, resets the
2984 /// opcode, types, and operands to the specified value. This should only be
2985 /// used by the SelectionDAG class.
2986 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
2987 const SDOperand *Ops, unsigned NumOps) {
2990 NumValues = L.NumVTs;
2992 // Clear the operands list, updating used nodes to remove this from their
2994 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
2995 I->Val->removeUser(this);
2997 // If NumOps is larger than the # of operands we currently have, reallocate
2998 // the operand list.
2999 if (NumOps > NumOperands) {
3000 if (OperandsNeedDelete)
3001 delete [] OperandList;
3002 OperandList = new SDOperand[NumOps];
3003 OperandsNeedDelete = true;
3006 // Assign the new operands.
3007 NumOperands = NumOps;
3009 for (unsigned i = 0, e = NumOps; i != e; ++i) {
3010 OperandList[i] = Ops[i];
3011 SDNode *N = OperandList[i].Val;
3012 N->Uses.push_back(this);
3016 /// SelectNodeTo - These are used for target selectors to *mutate* the
3017 /// specified node to have the specified return type, Target opcode, and
3018 /// operands. Note that target opcodes are stored as
3019 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
3021 /// Note that SelectNodeTo returns the resultant node. If there is already a
3022 /// node of the specified opcode and operands, it returns that node instead of
3023 /// the current one.
3024 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3025 MVT::ValueType VT) {
3026 SDVTList VTs = getVTList(VT);
3027 FoldingSetNodeID ID;
3028 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3030 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3033 RemoveNodeFromCSEMaps(N);
3035 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3037 CSEMap.InsertNode(N, IP);
3041 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3042 MVT::ValueType VT, SDOperand Op1) {
3043 // If an identical node already exists, use it.
3044 SDVTList VTs = getVTList(VT);
3045 SDOperand Ops[] = { Op1 };
3047 FoldingSetNodeID ID;
3048 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3050 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3053 RemoveNodeFromCSEMaps(N);
3054 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3055 CSEMap.InsertNode(N, IP);
3059 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3060 MVT::ValueType VT, SDOperand Op1,
3062 // If an identical node already exists, use it.
3063 SDVTList VTs = getVTList(VT);
3064 SDOperand Ops[] = { Op1, Op2 };
3066 FoldingSetNodeID ID;
3067 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3069 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3072 RemoveNodeFromCSEMaps(N);
3074 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3076 CSEMap.InsertNode(N, IP); // Memoize the new node.
3080 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3081 MVT::ValueType VT, SDOperand Op1,
3082 SDOperand Op2, SDOperand Op3) {
3083 // If an identical node already exists, use it.
3084 SDVTList VTs = getVTList(VT);
3085 SDOperand Ops[] = { Op1, Op2, Op3 };
3086 FoldingSetNodeID ID;
3087 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3089 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3092 RemoveNodeFromCSEMaps(N);
3094 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3096 CSEMap.InsertNode(N, IP); // Memoize the new node.
3100 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3101 MVT::ValueType VT, const SDOperand *Ops,
3103 // If an identical node already exists, use it.
3104 SDVTList VTs = getVTList(VT);
3105 FoldingSetNodeID ID;
3106 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3108 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3111 RemoveNodeFromCSEMaps(N);
3112 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3114 CSEMap.InsertNode(N, IP); // Memoize the new node.
3118 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3119 MVT::ValueType VT1, MVT::ValueType VT2,
3120 SDOperand Op1, SDOperand Op2) {
3121 SDVTList VTs = getVTList(VT1, VT2);
3122 FoldingSetNodeID ID;
3123 SDOperand Ops[] = { Op1, Op2 };
3124 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3126 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3129 RemoveNodeFromCSEMaps(N);
3130 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3131 CSEMap.InsertNode(N, IP); // Memoize the new node.
3135 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3136 MVT::ValueType VT1, MVT::ValueType VT2,
3137 SDOperand Op1, SDOperand Op2,
3139 // If an identical node already exists, use it.
3140 SDVTList VTs = getVTList(VT1, VT2);
3141 SDOperand Ops[] = { Op1, Op2, Op3 };
3142 FoldingSetNodeID ID;
3143 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3145 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3148 RemoveNodeFromCSEMaps(N);
3150 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3151 CSEMap.InsertNode(N, IP); // Memoize the new node.
3156 /// getTargetNode - These are used for target selectors to create a new node
3157 /// with specified return type(s), target opcode, and operands.
3159 /// Note that getTargetNode returns the resultant node. If there is already a
3160 /// node of the specified opcode and operands, it returns that node instead of
3161 /// the current one.
3162 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
3163 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
3165 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3167 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
3169 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3170 SDOperand Op1, SDOperand Op2) {
3171 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
3173 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3174 SDOperand Op1, SDOperand Op2,
3176 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
3178 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3179 const SDOperand *Ops, unsigned NumOps) {
3180 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
3182 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3183 MVT::ValueType VT2) {
3184 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3186 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val;
3188 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3189 MVT::ValueType VT2, SDOperand Op1) {
3190 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3191 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
3193 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3194 MVT::ValueType VT2, SDOperand Op1,
3196 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3197 SDOperand Ops[] = { Op1, Op2 };
3198 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
3200 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3201 MVT::ValueType VT2, SDOperand Op1,
3202 SDOperand Op2, SDOperand Op3) {
3203 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3204 SDOperand Ops[] = { Op1, Op2, Op3 };
3205 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
3207 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3209 const SDOperand *Ops, unsigned NumOps) {
3210 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3211 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
3213 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3214 MVT::ValueType VT2, MVT::ValueType VT3,
3215 SDOperand Op1, SDOperand Op2) {
3216 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3217 SDOperand Ops[] = { Op1, Op2 };
3218 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
3220 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3221 MVT::ValueType VT2, MVT::ValueType VT3,
3222 SDOperand Op1, SDOperand Op2,
3224 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3225 SDOperand Ops[] = { Op1, Op2, Op3 };
3226 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3228 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3229 MVT::ValueType VT2, MVT::ValueType VT3,
3230 const SDOperand *Ops, unsigned NumOps) {
3231 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3232 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
3234 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3235 MVT::ValueType VT2, MVT::ValueType VT3,
3237 const SDOperand *Ops, unsigned NumOps) {
3238 std::vector<MVT::ValueType> VTList;
3239 VTList.push_back(VT1);
3240 VTList.push_back(VT2);
3241 VTList.push_back(VT3);
3242 VTList.push_back(VT4);
3243 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3244 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3246 SDNode *SelectionDAG::getTargetNode(unsigned Opcode,
3247 std::vector<MVT::ValueType> &ResultTys,
3248 const SDOperand *Ops, unsigned NumOps) {
3249 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys);
3250 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(),
3255 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3256 /// This can cause recursive merging of nodes in the DAG.
3258 /// This version assumes From has a single result value.
3260 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To,
3261 DAGUpdateListener *UpdateListener) {
3262 SDNode *From = FromN.Val;
3263 assert(From->getNumValues() == 1 && FromN.ResNo == 0 &&
3264 "Cannot replace with this method!");
3265 assert(From != To.Val && "Cannot replace uses of with self");
3267 while (!From->use_empty()) {
3268 // Process users until they are all gone.
3269 SDNode *U = *From->use_begin();
3271 // This node is about to morph, remove its old self from the CSE maps.
3272 RemoveNodeFromCSEMaps(U);
3274 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3276 if (I->Val == From) {
3277 From->removeUser(U);
3282 // Now that we have modified U, add it back to the CSE maps. If it already
3283 // exists there, recursively merge the results together.
3284 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3285 ReplaceAllUsesWith(U, Existing, UpdateListener);
3286 // U is now dead. Inform the listener if it exists and delete it.
3288 UpdateListener->NodeDeleted(U);
3289 DeleteNodeNotInCSEMaps(U);
3291 // If the node doesn't already exist, we updated it. Inform a listener if
3294 UpdateListener->NodeUpdated(U);
3299 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3300 /// This can cause recursive merging of nodes in the DAG.
3302 /// This version assumes From/To have matching types and numbers of result
3305 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
3306 DAGUpdateListener *UpdateListener) {
3307 assert(From != To && "Cannot replace uses of with self");
3308 assert(From->getNumValues() == To->getNumValues() &&
3309 "Cannot use this version of ReplaceAllUsesWith!");
3310 if (From->getNumValues() == 1) // If possible, use the faster version.
3311 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0),
3314 while (!From->use_empty()) {
3315 // Process users until they are all gone.
3316 SDNode *U = *From->use_begin();
3318 // This node is about to morph, remove its old self from the CSE maps.
3319 RemoveNodeFromCSEMaps(U);
3321 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3323 if (I->Val == From) {
3324 From->removeUser(U);
3329 // Now that we have modified U, add it back to the CSE maps. If it already
3330 // exists there, recursively merge the results together.
3331 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3332 ReplaceAllUsesWith(U, Existing, UpdateListener);
3333 // U is now dead. Inform the listener if it exists and delete it.
3335 UpdateListener->NodeDeleted(U);
3336 DeleteNodeNotInCSEMaps(U);
3338 // If the node doesn't already exist, we updated it. Inform a listener if
3341 UpdateListener->NodeUpdated(U);
3346 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3347 /// This can cause recursive merging of nodes in the DAG.
3349 /// This version can replace From with any result values. To must match the
3350 /// number and types of values returned by From.
3351 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
3352 const SDOperand *To,
3353 DAGUpdateListener *UpdateListener) {
3354 if (From->getNumValues() == 1) // Handle the simple case efficiently.
3355 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener);
3357 while (!From->use_empty()) {
3358 // Process users until they are all gone.
3359 SDNode *U = *From->use_begin();
3361 // This node is about to morph, remove its old self from the CSE maps.
3362 RemoveNodeFromCSEMaps(U);
3364 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3366 if (I->Val == From) {
3367 const SDOperand &ToOp = To[I->ResNo];
3368 From->removeUser(U);
3370 ToOp.Val->addUser(U);
3373 // Now that we have modified U, add it back to the CSE maps. If it already
3374 // exists there, recursively merge the results together.
3375 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3376 ReplaceAllUsesWith(U, Existing, UpdateListener);
3377 // U is now dead. Inform the listener if it exists and delete it.
3379 UpdateListener->NodeDeleted(U);
3380 DeleteNodeNotInCSEMaps(U);
3382 // If the node doesn't already exist, we updated it. Inform a listener if
3385 UpdateListener->NodeUpdated(U);
3391 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes
3392 /// any deleted nodes from the set passed into its constructor and recursively
3393 /// notifies another update listener if specified.
3394 class ChainedSetUpdaterListener :
3395 public SelectionDAG::DAGUpdateListener {
3396 SmallSetVector<SDNode*, 16> &Set;
3397 SelectionDAG::DAGUpdateListener *Chain;
3399 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set,
3400 SelectionDAG::DAGUpdateListener *chain)
3401 : Set(set), Chain(chain) {}
3403 virtual void NodeDeleted(SDNode *N) {
3405 if (Chain) Chain->NodeDeleted(N);
3407 virtual void NodeUpdated(SDNode *N) {
3408 if (Chain) Chain->NodeUpdated(N);
3413 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3414 /// uses of other values produced by From.Val alone. The Deleted vector is
3415 /// handled the same way as for ReplaceAllUsesWith.
3416 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
3417 DAGUpdateListener *UpdateListener){
3418 assert(From != To && "Cannot replace a value with itself");
3420 // Handle the simple, trivial, case efficiently.
3421 if (From.Val->getNumValues() == 1) {
3422 ReplaceAllUsesWith(From, To, UpdateListener);
3426 if (From.use_empty()) return;
3428 // Get all of the users of From.Val. We want these in a nice,
3429 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3430 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
3432 // When one of the recursive merges deletes nodes from the graph, we need to
3433 // make sure that UpdateListener is notified *and* that the node is removed
3434 // from Users if present. CSUL does this.
3435 ChainedSetUpdaterListener CSUL(Users, UpdateListener);
3437 while (!Users.empty()) {
3438 // We know that this user uses some value of From. If it is the right
3439 // value, update it.
3440 SDNode *User = Users.back();
3443 // Scan for an operand that matches From.
3444 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands;
3445 for (; Op != E; ++Op)
3446 if (*Op == From) break;
3448 // If there are no matches, the user must use some other result of From.
3449 if (Op == E) continue;
3451 // Okay, we know this user needs to be updated. Remove its old self
3452 // from the CSE maps.
3453 RemoveNodeFromCSEMaps(User);
3455 // Update all operands that match "From" in case there are multiple uses.
3456 for (; Op != E; ++Op) {
3458 From.Val->removeUser(User);
3460 To.Val->addUser(User);
3464 // Now that we have modified User, add it back to the CSE maps. If it
3465 // already exists there, recursively merge the results together.
3466 SDNode *Existing = AddNonLeafNodeToCSEMaps(User);
3468 if (UpdateListener) UpdateListener->NodeUpdated(User);
3469 continue; // Continue on to next user.
3472 // If there was already an existing matching node, use ReplaceAllUsesWith
3473 // to replace the dead one with the existing one. This can cause
3474 // recursive merging of other unrelated nodes down the line. The merging
3475 // can cause deletion of nodes that used the old value. To handle this, we
3476 // use CSUL to remove them from the Users set.
3477 ReplaceAllUsesWith(User, Existing, &CSUL);
3479 // User is now dead. Notify a listener if present.
3480 if (UpdateListener) UpdateListener->NodeDeleted(User);
3481 DeleteNodeNotInCSEMaps(User);
3486 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3487 /// their allnodes order. It returns the maximum id.
3488 unsigned SelectionDAG::AssignNodeIds() {
3490 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3497 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
3498 /// based on their topological order. It returns the maximum id and a vector
3499 /// of the SDNodes* in assigned order by reference.
3500 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
3501 unsigned DAGSize = AllNodes.size();
3502 std::vector<unsigned> InDegree(DAGSize);
3503 std::vector<SDNode*> Sources;
3505 // Use a two pass approach to avoid using a std::map which is slow.
3507 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
3510 unsigned Degree = N->use_size();
3511 InDegree[N->getNodeId()] = Degree;
3513 Sources.push_back(N);
3517 while (!Sources.empty()) {
3518 SDNode *N = Sources.back();
3520 TopOrder.push_back(N);
3521 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
3523 unsigned Degree = --InDegree[P->getNodeId()];
3525 Sources.push_back(P);
3529 // Second pass, assign the actual topological order as node ids.
3531 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
3533 (*TI)->setNodeId(Id++);
3540 //===----------------------------------------------------------------------===//
3542 //===----------------------------------------------------------------------===//
3544 // Out-of-line virtual method to give class a home.
3545 void SDNode::ANCHOR() {}
3546 void UnarySDNode::ANCHOR() {}
3547 void BinarySDNode::ANCHOR() {}
3548 void TernarySDNode::ANCHOR() {}
3549 void HandleSDNode::ANCHOR() {}
3550 void StringSDNode::ANCHOR() {}
3551 void ConstantSDNode::ANCHOR() {}
3552 void ConstantFPSDNode::ANCHOR() {}
3553 void GlobalAddressSDNode::ANCHOR() {}
3554 void FrameIndexSDNode::ANCHOR() {}
3555 void JumpTableSDNode::ANCHOR() {}
3556 void ConstantPoolSDNode::ANCHOR() {}
3557 void BasicBlockSDNode::ANCHOR() {}
3558 void SrcValueSDNode::ANCHOR() {}
3559 void MemOperandSDNode::ANCHOR() {}
3560 void RegisterSDNode::ANCHOR() {}
3561 void ExternalSymbolSDNode::ANCHOR() {}
3562 void CondCodeSDNode::ANCHOR() {}
3563 void VTSDNode::ANCHOR() {}
3564 void LoadSDNode::ANCHOR() {}
3565 void StoreSDNode::ANCHOR() {}
3566 void AtomicSDNode::ANCHOR() {}
3568 HandleSDNode::~HandleSDNode() {
3569 SDVTList VTs = { 0, 0 };
3570 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
3573 GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
3574 MVT::ValueType VT, int o)
3575 : SDNode(isa<GlobalVariable>(GA) &&
3576 cast<GlobalVariable>(GA)->isThreadLocal() ?
3578 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
3580 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
3581 getSDVTList(VT)), Offset(o) {
3582 TheGlobal = const_cast<GlobalValue*>(GA);
3585 /// getMemOperand - Return a MemOperand object describing the memory
3586 /// reference performed by this load or store.
3587 MemOperand LSBaseSDNode::getMemOperand() const {
3588 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3;
3590 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore;
3591 if (IsVolatile) Flags |= MemOperand::MOVolatile;
3593 // Check if the load references a frame index, and does not have
3595 const FrameIndexSDNode *FI =
3596 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val);
3597 if (!getSrcValue() && FI)
3598 return MemOperand(PseudoSourceValue::getFixedStack(), Flags,
3599 FI->getIndex(), Size, Alignment);
3601 return MemOperand(getSrcValue(), Flags,
3602 getSrcValueOffset(), Size, Alignment);
3605 /// Profile - Gather unique data for the node.
3607 void SDNode::Profile(FoldingSetNodeID &ID) {
3608 AddNodeIDNode(ID, this);
3611 /// getValueTypeList - Return a pointer to the specified value type.
3613 const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
3614 if (MVT::isExtendedVT(VT)) {
3615 static std::set<MVT::ValueType> EVTs;
3616 return &(*EVTs.insert(VT).first);
3618 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
3624 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
3625 /// indicated value. This method ignores uses of other values defined by this
3627 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
3628 assert(Value < getNumValues() && "Bad value!");
3630 // If there is only one value, this is easy.
3631 if (getNumValues() == 1)
3632 return use_size() == NUses;
3633 if (use_size() < NUses) return false;
3635 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3637 SmallPtrSet<SDNode*, 32> UsersHandled;
3639 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3641 if (User->getNumOperands() == 1 ||
3642 UsersHandled.insert(User)) // First time we've seen this?
3643 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3644 if (User->getOperand(i) == TheValue) {
3646 return false; // too many uses
3651 // Found exactly the right number of uses?
3656 /// hasAnyUseOfValue - Return true if there are any use of the indicated
3657 /// value. This method ignores uses of other values defined by this operation.
3658 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
3659 assert(Value < getNumValues() && "Bad value!");
3661 if (use_empty()) return false;
3663 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3665 SmallPtrSet<SDNode*, 32> UsersHandled;
3667 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3669 if (User->getNumOperands() == 1 ||
3670 UsersHandled.insert(User)) // First time we've seen this?
3671 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3672 if (User->getOperand(i) == TheValue) {
3681 /// isOnlyUse - Return true if this node is the only use of N.
3683 bool SDNode::isOnlyUse(SDNode *N) const {
3685 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
3696 /// isOperand - Return true if this node is an operand of N.
3698 bool SDOperand::isOperand(SDNode *N) const {
3699 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3700 if (*this == N->getOperand(i))
3705 bool SDNode::isOperand(SDNode *N) const {
3706 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
3707 if (this == N->OperandList[i].Val)
3712 /// reachesChainWithoutSideEffects - Return true if this operand (which must
3713 /// be a chain) reaches the specified operand without crossing any
3714 /// side-effecting instructions. In practice, this looks through token
3715 /// factors and non-volatile loads. In order to remain efficient, this only
3716 /// looks a couple of nodes in, it does not do an exhaustive search.
3717 bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest,
3718 unsigned Depth) const {
3719 if (*this == Dest) return true;
3721 // Don't search too deeply, we just want to be able to see through
3722 // TokenFactor's etc.
3723 if (Depth == 0) return false;
3725 // If this is a token factor, all inputs to the TF happen in parallel. If any
3726 // of the operands of the TF reach dest, then we can do the xform.
3727 if (getOpcode() == ISD::TokenFactor) {
3728 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
3729 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1))
3734 // Loads don't have side effects, look through them.
3735 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) {
3736 if (!Ld->isVolatile())
3737 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1);
3743 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
3744 SmallPtrSet<SDNode *, 32> &Visited) {
3745 if (found || !Visited.insert(N))
3748 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
3749 SDNode *Op = N->getOperand(i).Val;
3754 findPredecessor(Op, P, found, Visited);
3758 /// isPredecessor - Return true if this node is a predecessor of N. This node
3759 /// is either an operand of N or it can be reached by recursively traversing
3760 /// up the operands.
3761 /// NOTE: this is an expensive method. Use it carefully.
3762 bool SDNode::isPredecessor(SDNode *N) const {
3763 SmallPtrSet<SDNode *, 32> Visited;
3765 findPredecessor(N, this, found, Visited);
3769 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
3770 assert(Num < NumOperands && "Invalid child # of SDNode!");
3771 return cast<ConstantSDNode>(OperandList[Num])->getValue();
3774 std::string SDNode::getOperationName(const SelectionDAG *G) const {
3775 switch (getOpcode()) {
3777 if (getOpcode() < ISD::BUILTIN_OP_END)
3778 return "<<Unknown DAG Node>>";
3781 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
3782 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
3783 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName();
3785 TargetLowering &TLI = G->getTargetLoweringInfo();
3787 TLI.getTargetNodeName(getOpcode());
3788 if (Name) return Name;
3791 return "<<Unknown Target Node>>";
3794 case ISD::MEMBARRIER: return "MemBarrier";
3795 case ISD::ATOMIC_LCS: return "AtomicLCS";
3796 case ISD::ATOMIC_LAS: return "AtomicLAS";
3797 case ISD::ATOMIC_SWAP: return "AtomicSWAP";
3798 case ISD::PCMARKER: return "PCMarker";
3799 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
3800 case ISD::SRCVALUE: return "SrcValue";
3801 case ISD::MEMOPERAND: return "MemOperand";
3802 case ISD::EntryToken: return "EntryToken";
3803 case ISD::TokenFactor: return "TokenFactor";
3804 case ISD::AssertSext: return "AssertSext";
3805 case ISD::AssertZext: return "AssertZext";
3807 case ISD::STRING: return "String";
3808 case ISD::BasicBlock: return "BasicBlock";
3809 case ISD::VALUETYPE: return "ValueType";
3810 case ISD::Register: return "Register";
3812 case ISD::Constant: return "Constant";
3813 case ISD::ConstantFP: return "ConstantFP";
3814 case ISD::GlobalAddress: return "GlobalAddress";
3815 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
3816 case ISD::FrameIndex: return "FrameIndex";
3817 case ISD::JumpTable: return "JumpTable";
3818 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
3819 case ISD::RETURNADDR: return "RETURNADDR";
3820 case ISD::FRAMEADDR: return "FRAMEADDR";
3821 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
3822 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
3823 case ISD::EHSELECTION: return "EHSELECTION";
3824 case ISD::EH_RETURN: return "EH_RETURN";
3825 case ISD::ConstantPool: return "ConstantPool";
3826 case ISD::ExternalSymbol: return "ExternalSymbol";
3827 case ISD::INTRINSIC_WO_CHAIN: {
3828 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
3829 return Intrinsic::getName((Intrinsic::ID)IID);
3831 case ISD::INTRINSIC_VOID:
3832 case ISD::INTRINSIC_W_CHAIN: {
3833 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
3834 return Intrinsic::getName((Intrinsic::ID)IID);
3837 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
3838 case ISD::TargetConstant: return "TargetConstant";
3839 case ISD::TargetConstantFP:return "TargetConstantFP";
3840 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
3841 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
3842 case ISD::TargetFrameIndex: return "TargetFrameIndex";
3843 case ISD::TargetJumpTable: return "TargetJumpTable";
3844 case ISD::TargetConstantPool: return "TargetConstantPool";
3845 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
3847 case ISD::CopyToReg: return "CopyToReg";
3848 case ISD::CopyFromReg: return "CopyFromReg";
3849 case ISD::UNDEF: return "undef";
3850 case ISD::MERGE_VALUES: return "merge_values";
3851 case ISD::INLINEASM: return "inlineasm";
3852 case ISD::LABEL: return "label";
3853 case ISD::DECLARE: return "declare";
3854 case ISD::HANDLENODE: return "handlenode";
3855 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
3856 case ISD::CALL: return "call";
3859 case ISD::FABS: return "fabs";
3860 case ISD::FNEG: return "fneg";
3861 case ISD::FSQRT: return "fsqrt";
3862 case ISD::FSIN: return "fsin";
3863 case ISD::FCOS: return "fcos";
3864 case ISD::FPOWI: return "fpowi";
3865 case ISD::FPOW: return "fpow";
3868 case ISD::ADD: return "add";
3869 case ISD::SUB: return "sub";
3870 case ISD::MUL: return "mul";
3871 case ISD::MULHU: return "mulhu";
3872 case ISD::MULHS: return "mulhs";
3873 case ISD::SDIV: return "sdiv";
3874 case ISD::UDIV: return "udiv";
3875 case ISD::SREM: return "srem";
3876 case ISD::UREM: return "urem";
3877 case ISD::SMUL_LOHI: return "smul_lohi";
3878 case ISD::UMUL_LOHI: return "umul_lohi";
3879 case ISD::SDIVREM: return "sdivrem";
3880 case ISD::UDIVREM: return "divrem";
3881 case ISD::AND: return "and";
3882 case ISD::OR: return "or";
3883 case ISD::XOR: return "xor";
3884 case ISD::SHL: return "shl";
3885 case ISD::SRA: return "sra";
3886 case ISD::SRL: return "srl";
3887 case ISD::ROTL: return "rotl";
3888 case ISD::ROTR: return "rotr";
3889 case ISD::FADD: return "fadd";
3890 case ISD::FSUB: return "fsub";
3891 case ISD::FMUL: return "fmul";
3892 case ISD::FDIV: return "fdiv";
3893 case ISD::FREM: return "frem";
3894 case ISD::FCOPYSIGN: return "fcopysign";
3895 case ISD::FGETSIGN: return "fgetsign";
3897 case ISD::SETCC: return "setcc";
3898 case ISD::SELECT: return "select";
3899 case ISD::SELECT_CC: return "select_cc";
3900 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
3901 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
3902 case ISD::CONCAT_VECTORS: return "concat_vectors";
3903 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
3904 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
3905 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
3906 case ISD::CARRY_FALSE: return "carry_false";
3907 case ISD::ADDC: return "addc";
3908 case ISD::ADDE: return "adde";
3909 case ISD::SUBC: return "subc";
3910 case ISD::SUBE: return "sube";
3911 case ISD::SHL_PARTS: return "shl_parts";
3912 case ISD::SRA_PARTS: return "sra_parts";
3913 case ISD::SRL_PARTS: return "srl_parts";
3915 case ISD::EXTRACT_SUBREG: return "extract_subreg";
3916 case ISD::INSERT_SUBREG: return "insert_subreg";
3918 // Conversion operators.
3919 case ISD::SIGN_EXTEND: return "sign_extend";
3920 case ISD::ZERO_EXTEND: return "zero_extend";
3921 case ISD::ANY_EXTEND: return "any_extend";
3922 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
3923 case ISD::TRUNCATE: return "truncate";
3924 case ISD::FP_ROUND: return "fp_round";
3925 case ISD::FLT_ROUNDS_: return "flt_rounds";
3926 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
3927 case ISD::FP_EXTEND: return "fp_extend";
3929 case ISD::SINT_TO_FP: return "sint_to_fp";
3930 case ISD::UINT_TO_FP: return "uint_to_fp";
3931 case ISD::FP_TO_SINT: return "fp_to_sint";
3932 case ISD::FP_TO_UINT: return "fp_to_uint";
3933 case ISD::BIT_CONVERT: return "bit_convert";
3935 // Control flow instructions
3936 case ISD::BR: return "br";
3937 case ISD::BRIND: return "brind";
3938 case ISD::BR_JT: return "br_jt";
3939 case ISD::BRCOND: return "brcond";
3940 case ISD::BR_CC: return "br_cc";
3941 case ISD::RET: return "ret";
3942 case ISD::CALLSEQ_START: return "callseq_start";
3943 case ISD::CALLSEQ_END: return "callseq_end";
3946 case ISD::LOAD: return "load";
3947 case ISD::STORE: return "store";
3948 case ISD::VAARG: return "vaarg";
3949 case ISD::VACOPY: return "vacopy";
3950 case ISD::VAEND: return "vaend";
3951 case ISD::VASTART: return "vastart";
3952 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
3953 case ISD::EXTRACT_ELEMENT: return "extract_element";
3954 case ISD::BUILD_PAIR: return "build_pair";
3955 case ISD::STACKSAVE: return "stacksave";
3956 case ISD::STACKRESTORE: return "stackrestore";
3957 case ISD::TRAP: return "trap";
3959 // Block memory operations.
3960 case ISD::MEMSET: return "memset";
3961 case ISD::MEMCPY: return "memcpy";
3962 case ISD::MEMMOVE: return "memmove";
3965 case ISD::BSWAP: return "bswap";
3966 case ISD::CTPOP: return "ctpop";
3967 case ISD::CTTZ: return "cttz";
3968 case ISD::CTLZ: return "ctlz";
3971 case ISD::LOCATION: return "location";
3972 case ISD::DEBUG_LOC: return "debug_loc";
3975 case ISD::TRAMPOLINE: return "trampoline";
3978 switch (cast<CondCodeSDNode>(this)->get()) {
3979 default: assert(0 && "Unknown setcc condition!");
3980 case ISD::SETOEQ: return "setoeq";
3981 case ISD::SETOGT: return "setogt";
3982 case ISD::SETOGE: return "setoge";
3983 case ISD::SETOLT: return "setolt";
3984 case ISD::SETOLE: return "setole";
3985 case ISD::SETONE: return "setone";
3987 case ISD::SETO: return "seto";
3988 case ISD::SETUO: return "setuo";
3989 case ISD::SETUEQ: return "setue";
3990 case ISD::SETUGT: return "setugt";
3991 case ISD::SETUGE: return "setuge";
3992 case ISD::SETULT: return "setult";
3993 case ISD::SETULE: return "setule";
3994 case ISD::SETUNE: return "setune";
3996 case ISD::SETEQ: return "seteq";
3997 case ISD::SETGT: return "setgt";
3998 case ISD::SETGE: return "setge";
3999 case ISD::SETLT: return "setlt";
4000 case ISD::SETLE: return "setle";
4001 case ISD::SETNE: return "setne";
4006 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
4015 return "<post-inc>";
4017 return "<post-dec>";
4021 void SDNode::dump() const { dump(0); }
4022 void SDNode::dump(const SelectionDAG *G) const {
4023 cerr << (void*)this << ": ";
4025 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
4027 if (getValueType(i) == MVT::Other)
4030 cerr << MVT::getValueTypeString(getValueType(i));
4032 cerr << " = " << getOperationName(G);
4035 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
4036 if (i) cerr << ", ";
4037 cerr << (void*)getOperand(i).Val;
4038 if (unsigned RN = getOperand(i).ResNo)
4042 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) {
4043 SDNode *Mask = getOperand(2).Val;
4045 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) {
4047 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF)
4050 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue();
4055 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
4056 cerr << "<" << CSDN->getValue() << ">";
4057 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
4058 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
4059 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
4060 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
4061 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
4063 cerr << "<APFloat(";
4064 CSDN->getValueAPF().convertToAPInt().dump();
4067 } else if (const GlobalAddressSDNode *GADN =
4068 dyn_cast<GlobalAddressSDNode>(this)) {
4069 int offset = GADN->getOffset();
4071 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
4073 cerr << " + " << offset;
4075 cerr << " " << offset;
4076 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
4077 cerr << "<" << FIDN->getIndex() << ">";
4078 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
4079 cerr << "<" << JTDN->getIndex() << ">";
4080 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
4081 int offset = CP->getOffset();
4082 if (CP->isMachineConstantPoolEntry())
4083 cerr << "<" << *CP->getMachineCPVal() << ">";
4085 cerr << "<" << *CP->getConstVal() << ">";
4087 cerr << " + " << offset;
4089 cerr << " " << offset;
4090 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
4092 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
4094 cerr << LBB->getName() << " ";
4095 cerr << (const void*)BBDN->getBasicBlock() << ">";
4096 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
4097 if (G && R->getReg() &&
4098 TargetRegisterInfo::isPhysicalRegister(R->getReg())) {
4099 cerr << " " << G->getTarget().getRegisterInfo()->getName(R->getReg());
4101 cerr << " #" << R->getReg();
4103 } else if (const ExternalSymbolSDNode *ES =
4104 dyn_cast<ExternalSymbolSDNode>(this)) {
4105 cerr << "'" << ES->getSymbol() << "'";
4106 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
4108 cerr << "<" << M->getValue() << ">";
4111 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) {
4112 if (M->MO.getValue())
4113 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">";
4115 cerr << "<null:" << M->MO.getOffset() << ">";
4116 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
4117 cerr << ":" << MVT::getValueTypeString(N->getVT());
4118 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
4119 const Value *SrcValue = LD->getSrcValue();
4120 int SrcOffset = LD->getSrcValueOffset();
4126 cerr << ":" << SrcOffset << ">";
4129 switch (LD->getExtensionType()) {
4130 default: doExt = false; break;
4132 cerr << " <anyext ";
4142 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">";
4144 const char *AM = getIndexedModeName(LD->getAddressingMode());
4147 if (LD->isVolatile())
4148 cerr << " <volatile>";
4149 cerr << " alignment=" << LD->getAlignment();
4150 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
4151 const Value *SrcValue = ST->getSrcValue();
4152 int SrcOffset = ST->getSrcValueOffset();
4158 cerr << ":" << SrcOffset << ">";
4160 if (ST->isTruncatingStore())
4162 << MVT::getValueTypeString(ST->getMemoryVT()) << ">";
4164 const char *AM = getIndexedModeName(ST->getAddressingMode());
4167 if (ST->isVolatile())
4168 cerr << " <volatile>";
4169 cerr << " alignment=" << ST->getAlignment();
4173 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
4174 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4175 if (N->getOperand(i).Val->hasOneUse())
4176 DumpNodes(N->getOperand(i).Val, indent+2, G);
4178 cerr << "\n" << std::string(indent+2, ' ')
4179 << (void*)N->getOperand(i).Val << ": <multiple use>";
4182 cerr << "\n" << std::string(indent, ' ');
4186 void SelectionDAG::dump() const {
4187 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
4188 std::vector<const SDNode*> Nodes;
4189 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
4193 std::sort(Nodes.begin(), Nodes.end());
4195 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
4196 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
4197 DumpNodes(Nodes[i], 2, this);
4200 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
4205 const Type *ConstantPoolSDNode::getType() const {
4206 if (isMachineConstantPoolEntry())
4207 return Val.MachineCPVal->getType();
4208 return Val.ConstVal->getType();