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 MVT::ValueType VT = NotZero.getValueType();
118 if (((cast<ConstantFPSDNode>(NotZero)->getValueAPF().
119 convertToAPInt().getZExtValue())) != (uint64_t)-1)
122 if ((uint32_t)cast<ConstantFPSDNode>(NotZero)->
123 getValueAPF().convertToAPInt().getZExtValue() !=
130 // Okay, we have at least one ~0 value, check to see if the rest match or are
132 for (++i; i != e; ++i)
133 if (N->getOperand(i) != NotZero &&
134 N->getOperand(i).getOpcode() != ISD::UNDEF)
140 /// isBuildVectorAllZeros - Return true if the specified node is a
141 /// BUILD_VECTOR where all of the elements are 0 or undef.
142 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
143 // Look through a bit convert.
144 if (N->getOpcode() == ISD::BIT_CONVERT)
145 N = N->getOperand(0).Val;
147 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
149 unsigned i = 0, e = N->getNumOperands();
151 // Skip over all of the undef values.
152 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
155 // Do not accept an all-undef vector.
156 if (i == e) return false;
158 // Do not accept build_vectors that aren't all constants or which have non-~0
160 SDOperand Zero = N->getOperand(i);
161 if (isa<ConstantSDNode>(Zero)) {
162 if (!cast<ConstantSDNode>(Zero)->isNullValue())
164 } else if (isa<ConstantFPSDNode>(Zero)) {
165 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
170 // Okay, we have at least one ~0 value, check to see if the rest match or are
172 for (++i; i != e; ++i)
173 if (N->getOperand(i) != Zero &&
174 N->getOperand(i).getOpcode() != ISD::UNDEF)
179 /// isScalarToVector - Return true if the specified node is a
180 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
181 /// element is not an undef.
182 bool ISD::isScalarToVector(const SDNode *N) {
183 if (N->getOpcode() == ISD::SCALAR_TO_VECTOR)
186 if (N->getOpcode() != ISD::BUILD_VECTOR)
188 if (N->getOperand(0).getOpcode() == ISD::UNDEF)
190 unsigned NumElems = N->getNumOperands();
191 for (unsigned i = 1; i < NumElems; ++i) {
192 SDOperand V = N->getOperand(i);
193 if (V.getOpcode() != ISD::UNDEF)
200 /// isDebugLabel - Return true if the specified node represents a debug
201 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
203 bool ISD::isDebugLabel(const SDNode *N) {
205 if (N->getOpcode() == ISD::LABEL)
206 Zero = N->getOperand(2);
207 else if (N->isTargetOpcode() &&
208 N->getTargetOpcode() == TargetInstrInfo::LABEL)
209 // Chain moved to last operand.
210 Zero = N->getOperand(1);
213 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue();
216 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
217 /// when given the operation for (X op Y).
218 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
219 // To perform this operation, we just need to swap the L and G bits of the
221 unsigned OldL = (Operation >> 2) & 1;
222 unsigned OldG = (Operation >> 1) & 1;
223 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
224 (OldL << 1) | // New G bit
225 (OldG << 2)); // New L bit.
228 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
229 /// 'op' is a valid SetCC operation.
230 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
231 unsigned Operation = Op;
233 Operation ^= 7; // Flip L, G, E bits, but not U.
235 Operation ^= 15; // Flip all of the condition bits.
236 if (Operation > ISD::SETTRUE2)
237 Operation &= ~8; // Don't let N and U bits get set.
238 return ISD::CondCode(Operation);
242 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
243 /// signed operation and 2 if the result is an unsigned comparison. Return zero
244 /// if the operation does not depend on the sign of the input (setne and seteq).
245 static int isSignedOp(ISD::CondCode Opcode) {
247 default: assert(0 && "Illegal integer setcc operation!");
249 case ISD::SETNE: return 0;
253 case ISD::SETGE: return 1;
257 case ISD::SETUGE: return 2;
261 /// getSetCCOrOperation - Return the result of a logical OR between different
262 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
263 /// returns SETCC_INVALID if it is not possible to represent the resultant
265 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
267 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
268 // Cannot fold a signed integer setcc with an unsigned integer setcc.
269 return ISD::SETCC_INVALID;
271 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
273 // If the N and U bits get set then the resultant comparison DOES suddenly
274 // care about orderedness, and is true when ordered.
275 if (Op > ISD::SETTRUE2)
276 Op &= ~16; // Clear the U bit if the N bit is set.
278 // Canonicalize illegal integer setcc's.
279 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
282 return ISD::CondCode(Op);
285 /// getSetCCAndOperation - Return the result of a logical AND between different
286 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
287 /// function returns zero if it is not possible to represent the resultant
289 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
291 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
292 // Cannot fold a signed setcc with an unsigned setcc.
293 return ISD::SETCC_INVALID;
295 // Combine all of the condition bits.
296 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
298 // Canonicalize illegal integer setcc's.
302 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
303 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
304 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
305 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
312 const TargetMachine &SelectionDAG::getTarget() const {
313 return TLI.getTargetMachine();
316 //===----------------------------------------------------------------------===//
317 // SDNode Profile Support
318 //===----------------------------------------------------------------------===//
320 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
322 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
326 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
327 /// solely with their pointer.
328 void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
329 ID.AddPointer(VTList.VTs);
332 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
334 static void AddNodeIDOperands(FoldingSetNodeID &ID,
335 const SDOperand *Ops, unsigned NumOps) {
336 for (; NumOps; --NumOps, ++Ops) {
337 ID.AddPointer(Ops->Val);
338 ID.AddInteger(Ops->ResNo);
342 static void AddNodeIDNode(FoldingSetNodeID &ID,
343 unsigned short OpC, SDVTList VTList,
344 const SDOperand *OpList, unsigned N) {
345 AddNodeIDOpcode(ID, OpC);
346 AddNodeIDValueTypes(ID, VTList);
347 AddNodeIDOperands(ID, OpList, N);
350 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
352 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
353 AddNodeIDOpcode(ID, N->getOpcode());
354 // Add the return value info.
355 AddNodeIDValueTypes(ID, N->getVTList());
356 // Add the operand info.
357 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
359 // Handle SDNode leafs with special info.
360 switch (N->getOpcode()) {
361 default: break; // Normal nodes don't need extra info.
362 case ISD::TargetConstant:
364 ID.Add(cast<ConstantSDNode>(N)->getAPIntValue());
366 case ISD::TargetConstantFP:
367 case ISD::ConstantFP: {
368 ID.Add(cast<ConstantFPSDNode>(N)->getValueAPF());
371 case ISD::TargetGlobalAddress:
372 case ISD::GlobalAddress:
373 case ISD::TargetGlobalTLSAddress:
374 case ISD::GlobalTLSAddress: {
375 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
376 ID.AddPointer(GA->getGlobal());
377 ID.AddInteger(GA->getOffset());
380 case ISD::BasicBlock:
381 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
384 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
387 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue());
389 case ISD::MEMOPERAND: {
390 const MemOperand &MO = cast<MemOperandSDNode>(N)->MO;
391 ID.AddPointer(MO.getValue());
392 ID.AddInteger(MO.getFlags());
393 ID.AddInteger(MO.getOffset());
394 ID.AddInteger(MO.getSize());
395 ID.AddInteger(MO.getAlignment());
398 case ISD::FrameIndex:
399 case ISD::TargetFrameIndex:
400 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
403 case ISD::TargetJumpTable:
404 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
406 case ISD::ConstantPool:
407 case ISD::TargetConstantPool: {
408 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
409 ID.AddInteger(CP->getAlignment());
410 ID.AddInteger(CP->getOffset());
411 if (CP->isMachineConstantPoolEntry())
412 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
414 ID.AddPointer(CP->getConstVal());
418 LoadSDNode *LD = cast<LoadSDNode>(N);
419 ID.AddInteger(LD->getAddressingMode());
420 ID.AddInteger(LD->getExtensionType());
421 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
422 ID.AddInteger(LD->getAlignment());
423 ID.AddInteger(LD->isVolatile());
427 StoreSDNode *ST = cast<StoreSDNode>(N);
428 ID.AddInteger(ST->getAddressingMode());
429 ID.AddInteger(ST->isTruncatingStore());
430 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
431 ID.AddInteger(ST->getAlignment());
432 ID.AddInteger(ST->isVolatile());
438 //===----------------------------------------------------------------------===//
439 // SelectionDAG Class
440 //===----------------------------------------------------------------------===//
442 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
444 void SelectionDAG::RemoveDeadNodes() {
445 // Create a dummy node (which is not added to allnodes), that adds a reference
446 // to the root node, preventing it from being deleted.
447 HandleSDNode Dummy(getRoot());
449 SmallVector<SDNode*, 128> DeadNodes;
451 // Add all obviously-dead nodes to the DeadNodes worklist.
452 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
454 DeadNodes.push_back(I);
456 // Process the worklist, deleting the nodes and adding their uses to the
458 while (!DeadNodes.empty()) {
459 SDNode *N = DeadNodes.back();
460 DeadNodes.pop_back();
462 // Take the node out of the appropriate CSE map.
463 RemoveNodeFromCSEMaps(N);
465 // Next, brutally remove the operand list. This is safe to do, as there are
466 // no cycles in the graph.
467 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
468 SDNode *Operand = I->Val;
469 Operand->removeUser(N);
471 // Now that we removed this operand, see if there are no uses of it left.
472 if (Operand->use_empty())
473 DeadNodes.push_back(Operand);
475 if (N->OperandsNeedDelete)
476 delete[] N->OperandList;
480 // Finally, remove N itself.
484 // If the root changed (e.g. it was a dead load, update the root).
485 setRoot(Dummy.getValue());
488 void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
489 SmallVector<SDNode*, 16> DeadNodes;
490 DeadNodes.push_back(N);
492 // Process the worklist, deleting the nodes and adding their uses to the
494 while (!DeadNodes.empty()) {
495 SDNode *N = DeadNodes.back();
496 DeadNodes.pop_back();
499 UpdateListener->NodeDeleted(N);
501 // Take the node out of the appropriate CSE map.
502 RemoveNodeFromCSEMaps(N);
504 // Next, brutally remove the operand list. This is safe to do, as there are
505 // no cycles in the graph.
506 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
507 SDNode *Operand = I->Val;
508 Operand->removeUser(N);
510 // Now that we removed this operand, see if there are no uses of it left.
511 if (Operand->use_empty())
512 DeadNodes.push_back(Operand);
514 if (N->OperandsNeedDelete)
515 delete[] N->OperandList;
519 // Finally, remove N itself.
524 void SelectionDAG::DeleteNode(SDNode *N) {
525 assert(N->use_empty() && "Cannot delete a node that is not dead!");
527 // First take this out of the appropriate CSE map.
528 RemoveNodeFromCSEMaps(N);
530 // Finally, remove uses due to operands of this node, remove from the
531 // AllNodes list, and delete the node.
532 DeleteNodeNotInCSEMaps(N);
535 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
537 // Remove it from the AllNodes list.
540 // Drop all of the operands and decrement used nodes use counts.
541 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
542 I->Val->removeUser(N);
543 if (N->OperandsNeedDelete)
544 delete[] N->OperandList;
551 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
552 /// correspond to it. This is useful when we're about to delete or repurpose
553 /// the node. We don't want future request for structurally identical nodes
554 /// to return N anymore.
555 void SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
557 switch (N->getOpcode()) {
558 case ISD::HANDLENODE: return; // noop.
560 Erased = StringNodes.erase(cast<StringSDNode>(N)->getValue());
563 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
564 "Cond code doesn't exist!");
565 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
566 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
568 case ISD::ExternalSymbol:
569 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
571 case ISD::TargetExternalSymbol:
573 TargetExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
575 case ISD::VALUETYPE: {
576 MVT::ValueType VT = cast<VTSDNode>(N)->getVT();
577 if (MVT::isExtendedVT(VT)) {
578 Erased = ExtendedValueTypeNodes.erase(VT);
580 Erased = ValueTypeNodes[VT] != 0;
581 ValueTypeNodes[VT] = 0;
586 // Remove it from the CSE Map.
587 Erased = CSEMap.RemoveNode(N);
591 // Verify that the node was actually in one of the CSE maps, unless it has a
592 // flag result (which cannot be CSE'd) or is one of the special cases that are
593 // not subject to CSE.
594 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
595 !N->isTargetOpcode()) {
598 assert(0 && "Node is not in map!");
603 /// AddNonLeafNodeToCSEMaps - Add the specified node back to the CSE maps. It
604 /// has been taken out and modified in some way. If the specified node already
605 /// exists in the CSE maps, do not modify the maps, but return the existing node
606 /// instead. If it doesn't exist, add it and return null.
608 SDNode *SelectionDAG::AddNonLeafNodeToCSEMaps(SDNode *N) {
609 assert(N->getNumOperands() && "This is a leaf node!");
610 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
611 return 0; // Never add these nodes.
613 // Check that remaining values produced are not flags.
614 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
615 if (N->getValueType(i) == MVT::Flag)
616 return 0; // Never CSE anything that produces a flag.
618 SDNode *New = CSEMap.GetOrInsertNode(N);
619 if (New != N) return New; // Node already existed.
623 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
624 /// were replaced with those specified. If this node is never memoized,
625 /// return null, otherwise return a pointer to the slot it would take. If a
626 /// node already exists with these operands, the slot will be non-null.
627 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDOperand Op,
629 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
630 return 0; // Never add these nodes.
632 // Check that remaining values produced are not flags.
633 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
634 if (N->getValueType(i) == MVT::Flag)
635 return 0; // Never CSE anything that produces a flag.
637 SDOperand Ops[] = { Op };
639 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
640 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
643 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
644 /// were replaced with those specified. If this node is never memoized,
645 /// return null, otherwise return a pointer to the slot it would take. If a
646 /// node already exists with these operands, the slot will be non-null.
647 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
648 SDOperand Op1, SDOperand Op2,
650 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
651 return 0; // Never add these nodes.
653 // Check that remaining values produced are not flags.
654 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
655 if (N->getValueType(i) == MVT::Flag)
656 return 0; // Never CSE anything that produces a flag.
658 SDOperand Ops[] = { Op1, Op2 };
660 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
661 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
665 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
666 /// were replaced with those specified. If this node is never memoized,
667 /// return null, otherwise return a pointer to the slot it would take. If a
668 /// node already exists with these operands, the slot will be non-null.
669 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
670 const SDOperand *Ops,unsigned NumOps,
672 if (N->getOpcode() == ISD::HANDLENODE || N->getValueType(0) == MVT::Flag)
673 return 0; // Never add these nodes.
675 // Check that remaining values produced are not flags.
676 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
677 if (N->getValueType(i) == MVT::Flag)
678 return 0; // Never CSE anything that produces a flag.
681 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
683 if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(N)) {
684 ID.AddInteger(LD->getAddressingMode());
685 ID.AddInteger(LD->getExtensionType());
686 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
687 ID.AddInteger(LD->getAlignment());
688 ID.AddInteger(LD->isVolatile());
689 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(N)) {
690 ID.AddInteger(ST->getAddressingMode());
691 ID.AddInteger(ST->isTruncatingStore());
692 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
693 ID.AddInteger(ST->getAlignment());
694 ID.AddInteger(ST->isVolatile());
697 return CSEMap.FindNodeOrInsertPos(ID, InsertPos);
701 SelectionDAG::~SelectionDAG() {
702 while (!AllNodes.empty()) {
703 SDNode *N = AllNodes.begin();
704 N->SetNextInBucket(0);
705 if (N->OperandsNeedDelete)
706 delete [] N->OperandList;
709 AllNodes.pop_front();
713 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
714 if (Op.getValueType() == VT) return Op;
715 int64_t Imm = ~0ULL >> (64-MVT::getSizeInBits(VT));
716 return getNode(ISD::AND, Op.getValueType(), Op,
717 getConstant(Imm, Op.getValueType()));
720 SDOperand SelectionDAG::getString(const std::string &Val) {
721 StringSDNode *&N = StringNodes[Val];
723 N = new StringSDNode(Val);
724 AllNodes.push_back(N);
726 return SDOperand(N, 0);
729 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
730 MVT::ValueType EltVT =
731 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
733 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT);
736 SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) {
737 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
739 MVT::ValueType EltVT =
740 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
742 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) &&
743 "APInt size does not match type size!");
745 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
747 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
751 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
752 if (!MVT::isVector(VT))
753 return SDOperand(N, 0);
755 N = new ConstantSDNode(isT, Val, EltVT);
756 CSEMap.InsertNode(N, IP);
757 AllNodes.push_back(N);
760 SDOperand Result(N, 0);
761 if (MVT::isVector(VT)) {
762 SmallVector<SDOperand, 8> Ops;
763 Ops.assign(MVT::getVectorNumElements(VT), Result);
764 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
769 SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) {
770 return getConstant(Val, TLI.getPointerTy(), isTarget);
774 SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
776 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
778 MVT::ValueType EltVT =
779 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
781 // Do the map lookup using the actual bit pattern for the floating point
782 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
783 // we don't have issues with SNANs.
784 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
786 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
790 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
791 if (!MVT::isVector(VT))
792 return SDOperand(N, 0);
794 N = new ConstantFPSDNode(isTarget, V, EltVT);
795 CSEMap.InsertNode(N, IP);
796 AllNodes.push_back(N);
799 SDOperand Result(N, 0);
800 if (MVT::isVector(VT)) {
801 SmallVector<SDOperand, 8> Ops;
802 Ops.assign(MVT::getVectorNumElements(VT), Result);
803 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
808 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
810 MVT::ValueType EltVT =
811 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
813 return getConstantFP(APFloat((float)Val), VT, isTarget);
815 return getConstantFP(APFloat(Val), VT, isTarget);
818 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
819 MVT::ValueType VT, int Offset,
821 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
823 if (GVar && GVar->isThreadLocal())
824 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
826 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
828 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
830 ID.AddInteger(Offset);
832 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
833 return SDOperand(E, 0);
834 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
835 CSEMap.InsertNode(N, IP);
836 AllNodes.push_back(N);
837 return SDOperand(N, 0);
840 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
842 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
844 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
847 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
848 return SDOperand(E, 0);
849 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
850 CSEMap.InsertNode(N, IP);
851 AllNodes.push_back(N);
852 return SDOperand(N, 0);
855 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
856 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
858 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
861 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
862 return SDOperand(E, 0);
863 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
864 CSEMap.InsertNode(N, IP);
865 AllNodes.push_back(N);
866 return SDOperand(N, 0);
869 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
870 unsigned Alignment, int Offset,
872 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
874 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
875 ID.AddInteger(Alignment);
876 ID.AddInteger(Offset);
879 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
880 return SDOperand(E, 0);
881 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
882 CSEMap.InsertNode(N, IP);
883 AllNodes.push_back(N);
884 return SDOperand(N, 0);
888 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
890 unsigned Alignment, int Offset,
892 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
894 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
895 ID.AddInteger(Alignment);
896 ID.AddInteger(Offset);
897 C->AddSelectionDAGCSEId(ID);
899 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
900 return SDOperand(E, 0);
901 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
902 CSEMap.InsertNode(N, IP);
903 AllNodes.push_back(N);
904 return SDOperand(N, 0);
908 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
910 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
913 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
914 return SDOperand(E, 0);
915 SDNode *N = new BasicBlockSDNode(MBB);
916 CSEMap.InsertNode(N, IP);
917 AllNodes.push_back(N);
918 return SDOperand(N, 0);
921 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
922 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size())
923 ValueTypeNodes.resize(VT+1);
925 SDNode *&N = MVT::isExtendedVT(VT) ?
926 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT];
928 if (N) return SDOperand(N, 0);
929 N = new VTSDNode(VT);
930 AllNodes.push_back(N);
931 return SDOperand(N, 0);
934 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
935 SDNode *&N = ExternalSymbols[Sym];
936 if (N) return SDOperand(N, 0);
937 N = new ExternalSymbolSDNode(false, Sym, VT);
938 AllNodes.push_back(N);
939 return SDOperand(N, 0);
942 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
944 SDNode *&N = TargetExternalSymbols[Sym];
945 if (N) return SDOperand(N, 0);
946 N = new ExternalSymbolSDNode(true, Sym, VT);
947 AllNodes.push_back(N);
948 return SDOperand(N, 0);
951 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
952 if ((unsigned)Cond >= CondCodeNodes.size())
953 CondCodeNodes.resize(Cond+1);
955 if (CondCodeNodes[Cond] == 0) {
956 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
957 AllNodes.push_back(CondCodeNodes[Cond]);
959 return SDOperand(CondCodeNodes[Cond], 0);
962 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
964 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
965 ID.AddInteger(RegNo);
967 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
968 return SDOperand(E, 0);
969 SDNode *N = new RegisterSDNode(RegNo, VT);
970 CSEMap.InsertNode(N, IP);
971 AllNodes.push_back(N);
972 return SDOperand(N, 0);
975 SDOperand SelectionDAG::getSrcValue(const Value *V) {
976 assert((!V || isa<PointerType>(V->getType())) &&
977 "SrcValue is not a pointer?");
980 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
984 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
985 return SDOperand(E, 0);
987 SDNode *N = new SrcValueSDNode(V);
988 CSEMap.InsertNode(N, IP);
989 AllNodes.push_back(N);
990 return SDOperand(N, 0);
993 SDOperand SelectionDAG::getMemOperand(const MemOperand &MO) {
994 const Value *v = MO.getValue();
995 assert((!v || isa<PointerType>(v->getType())) &&
996 "SrcValue is not a pointer?");
999 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), 0, 0);
1001 ID.AddInteger(MO.getFlags());
1002 ID.AddInteger(MO.getOffset());
1003 ID.AddInteger(MO.getSize());
1004 ID.AddInteger(MO.getAlignment());
1007 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1008 return SDOperand(E, 0);
1010 SDNode *N = new MemOperandSDNode(MO);
1011 CSEMap.InsertNode(N, IP);
1012 AllNodes.push_back(N);
1013 return SDOperand(N, 0);
1016 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
1017 /// specified value type.
1018 SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) {
1019 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
1020 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
1021 const Type *Ty = MVT::getTypeForValueType(VT);
1022 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty);
1023 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign);
1024 return getFrameIndex(FrameIdx, TLI.getPointerTy());
1028 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
1029 SDOperand N2, ISD::CondCode Cond) {
1030 // These setcc operations always fold.
1034 case ISD::SETFALSE2: return getConstant(0, VT);
1036 case ISD::SETTRUE2: return getConstant(1, VT);
1048 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
1052 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
1053 uint64_t C2 = N2C->getValue();
1054 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
1055 uint64_t C1 = N1C->getValue();
1057 // Sign extend the operands if required
1058 if (ISD::isSignedIntSetCC(Cond)) {
1059 C1 = N1C->getSignExtended();
1060 C2 = N2C->getSignExtended();
1064 default: assert(0 && "Unknown integer setcc!");
1065 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1066 case ISD::SETNE: return getConstant(C1 != C2, VT);
1067 case ISD::SETULT: return getConstant(C1 < C2, VT);
1068 case ISD::SETUGT: return getConstant(C1 > C2, VT);
1069 case ISD::SETULE: return getConstant(C1 <= C2, VT);
1070 case ISD::SETUGE: return getConstant(C1 >= C2, VT);
1071 case ISD::SETLT: return getConstant((int64_t)C1 < (int64_t)C2, VT);
1072 case ISD::SETGT: return getConstant((int64_t)C1 > (int64_t)C2, VT);
1073 case ISD::SETLE: return getConstant((int64_t)C1 <= (int64_t)C2, VT);
1074 case ISD::SETGE: return getConstant((int64_t)C1 >= (int64_t)C2, VT);
1078 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) {
1079 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
1080 // No compile time operations on this type yet.
1081 if (N1C->getValueType(0) == MVT::ppcf128)
1084 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
1087 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
1088 return getNode(ISD::UNDEF, VT);
1090 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
1091 case ISD::SETNE: if (R==APFloat::cmpUnordered)
1092 return getNode(ISD::UNDEF, VT);
1094 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
1095 R==APFloat::cmpLessThan, VT);
1096 case ISD::SETLT: if (R==APFloat::cmpUnordered)
1097 return getNode(ISD::UNDEF, VT);
1099 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1100 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1101 return getNode(ISD::UNDEF, VT);
1103 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1104 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1105 return getNode(ISD::UNDEF, VT);
1107 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
1108 R==APFloat::cmpEqual, VT);
1109 case ISD::SETGE: if (R==APFloat::cmpUnordered)
1110 return getNode(ISD::UNDEF, VT);
1112 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
1113 R==APFloat::cmpEqual, VT);
1114 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1115 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1116 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1117 R==APFloat::cmpEqual, VT);
1118 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1119 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1120 R==APFloat::cmpLessThan, VT);
1121 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1122 R==APFloat::cmpUnordered, VT);
1123 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1124 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
1127 // Ensure that the constant occurs on the RHS.
1128 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1132 // Could not fold it.
1136 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
1137 /// use this predicate to simplify operations downstream.
1138 bool SelectionDAG::SignBitIsZero(SDOperand Op, unsigned Depth) const {
1139 unsigned BitWidth = Op.getValueSizeInBits();
1140 return MaskedValueIsZero(Op, APInt::getSignBit(BitWidth), Depth);
1143 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1144 /// this predicate to simplify operations downstream. Mask is known to be zero
1145 /// for bits that V cannot have.
1146 bool SelectionDAG::MaskedValueIsZero(SDOperand Op, const APInt &Mask,
1147 unsigned Depth) const {
1148 APInt KnownZero, KnownOne;
1149 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1150 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1151 return (KnownZero & Mask) == Mask;
1154 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
1155 /// known to be either zero or one and return them in the KnownZero/KnownOne
1156 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1158 void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask,
1159 APInt &KnownZero, APInt &KnownOne,
1160 unsigned Depth) const {
1161 unsigned BitWidth = Mask.getBitWidth();
1162 assert(BitWidth == MVT::getSizeInBits(Op.getValueType()) &&
1163 "Mask size mismatches value type size!");
1165 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
1166 if (Depth == 6 || Mask == 0)
1167 return; // Limit search depth.
1169 APInt KnownZero2, KnownOne2;
1171 switch (Op.getOpcode()) {
1173 // We know all of the bits for a constant!
1174 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask;
1175 KnownZero = ~KnownOne & Mask;
1178 // If either the LHS or the RHS are Zero, the result is zero.
1179 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1180 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero,
1181 KnownZero2, KnownOne2, Depth+1);
1182 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1183 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1185 // Output known-1 bits are only known if set in both the LHS & RHS.
1186 KnownOne &= KnownOne2;
1187 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1188 KnownZero |= KnownZero2;
1191 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1192 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne,
1193 KnownZero2, KnownOne2, Depth+1);
1194 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1195 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1197 // Output known-0 bits are only known if clear in both the LHS & RHS.
1198 KnownZero &= KnownZero2;
1199 // Output known-1 are known to be set if set in either the LHS | RHS.
1200 KnownOne |= KnownOne2;
1203 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1204 ComputeMaskedBits(Op.getOperand(0), 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 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1209 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1210 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1211 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1212 KnownZero = KnownZeroOut;
1216 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1217 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1218 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1219 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1221 // Only known if known in both the LHS and RHS.
1222 KnownOne &= KnownOne2;
1223 KnownZero &= KnownZero2;
1225 case ISD::SELECT_CC:
1226 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1227 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1228 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1229 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1231 // Only known if known in both the LHS and RHS.
1232 KnownOne &= KnownOne2;
1233 KnownZero &= KnownZero2;
1236 // If we know the result of a setcc has the top bits zero, use this info.
1237 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult &&
1239 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1242 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1243 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1244 unsigned ShAmt = SA->getValue();
1246 // If the shift count is an invalid immediate, don't do anything.
1247 if (ShAmt >= BitWidth)
1250 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(ShAmt),
1251 KnownZero, KnownOne, Depth+1);
1252 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1253 KnownZero <<= ShAmt;
1255 // low bits known zero.
1256 KnownZero |= APInt::getLowBitsSet(BitWidth, ShAmt);
1260 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1261 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1262 unsigned ShAmt = SA->getValue();
1264 // If the shift count is an invalid immediate, don't do anything.
1265 if (ShAmt >= BitWidth)
1268 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt),
1269 KnownZero, KnownOne, Depth+1);
1270 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1271 KnownZero = KnownZero.lshr(ShAmt);
1272 KnownOne = KnownOne.lshr(ShAmt);
1274 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1275 KnownZero |= HighBits; // High bits known zero.
1279 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1280 unsigned ShAmt = SA->getValue();
1282 // If the shift count is an invalid immediate, don't do anything.
1283 if (ShAmt >= BitWidth)
1286 APInt InDemandedMask = (Mask << ShAmt);
1287 // If any of the demanded bits are produced by the sign extension, we also
1288 // demand the input sign bit.
1289 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1290 if (HighBits.getBoolValue())
1291 InDemandedMask |= APInt::getSignBit(BitWidth);
1293 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1295 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1296 KnownZero = KnownZero.lshr(ShAmt);
1297 KnownOne = KnownOne.lshr(ShAmt);
1299 // Handle the sign bits.
1300 APInt SignBit = APInt::getSignBit(BitWidth);
1301 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask.
1303 if (KnownZero.intersects(SignBit)) {
1304 KnownZero |= HighBits; // New bits are known zero.
1305 } else if (KnownOne.intersects(SignBit)) {
1306 KnownOne |= HighBits; // New bits are known one.
1310 case ISD::SIGN_EXTEND_INREG: {
1311 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1312 unsigned EBits = MVT::getSizeInBits(EVT);
1314 // Sign extension. Compute the demanded bits in the result that are not
1315 // present in the input.
1316 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask;
1318 APInt InSignBit = APInt::getSignBit(EBits);
1319 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits);
1321 // If the sign extended bits are demanded, we know that the sign
1323 InSignBit.zext(BitWidth);
1324 if (NewBits.getBoolValue())
1325 InputDemandedBits |= InSignBit;
1327 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1328 KnownZero, KnownOne, Depth+1);
1329 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1331 // If the sign bit of the input is known set or clear, then we know the
1332 // top bits of the result.
1333 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear
1334 KnownZero |= NewBits;
1335 KnownOne &= ~NewBits;
1336 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
1337 KnownOne |= NewBits;
1338 KnownZero &= ~NewBits;
1339 } else { // Input sign bit unknown
1340 KnownZero &= ~NewBits;
1341 KnownOne &= ~NewBits;
1348 unsigned LowBits = Log2_32(BitWidth)+1;
1349 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits);
1350 KnownOne = APInt(BitWidth, 0);
1354 if (ISD::isZEXTLoad(Op.Val)) {
1355 LoadSDNode *LD = cast<LoadSDNode>(Op);
1356 MVT::ValueType VT = LD->getMemoryVT();
1357 unsigned MemBits = MVT::getSizeInBits(VT);
1358 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask;
1362 case ISD::ZERO_EXTEND: {
1363 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1364 unsigned InBits = MVT::getSizeInBits(InVT);
1365 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1366 APInt InMask = Mask;
1367 InMask.trunc(InBits);
1368 KnownZero.trunc(InBits);
1369 KnownOne.trunc(InBits);
1370 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1371 KnownZero.zext(BitWidth);
1372 KnownOne.zext(BitWidth);
1373 KnownZero |= NewBits;
1376 case ISD::SIGN_EXTEND: {
1377 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1378 unsigned InBits = MVT::getSizeInBits(InVT);
1379 APInt InSignBit = APInt::getSignBit(InBits);
1380 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1381 APInt InMask = Mask;
1382 InMask.trunc(InBits);
1384 // If any of the sign extended bits are demanded, we know that the sign
1385 // bit is demanded. Temporarily set this bit in the mask for our callee.
1386 if (NewBits.getBoolValue())
1387 InMask |= InSignBit;
1389 KnownZero.trunc(InBits);
1390 KnownOne.trunc(InBits);
1391 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1393 // Note if the sign bit is known to be zero or one.
1394 bool SignBitKnownZero = KnownZero.isNegative();
1395 bool SignBitKnownOne = KnownOne.isNegative();
1396 assert(!(SignBitKnownZero && SignBitKnownOne) &&
1397 "Sign bit can't be known to be both zero and one!");
1399 // If the sign bit wasn't actually demanded by our caller, we don't
1400 // want it set in the KnownZero and KnownOne result values. Reset the
1401 // mask and reapply it to the result values.
1403 InMask.trunc(InBits);
1404 KnownZero &= InMask;
1407 KnownZero.zext(BitWidth);
1408 KnownOne.zext(BitWidth);
1410 // If the sign bit is known zero or one, the top bits match.
1411 if (SignBitKnownZero)
1412 KnownZero |= NewBits;
1413 else if (SignBitKnownOne)
1414 KnownOne |= NewBits;
1417 case ISD::ANY_EXTEND: {
1418 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1419 unsigned InBits = MVT::getSizeInBits(InVT);
1420 APInt InMask = Mask;
1421 InMask.trunc(InBits);
1422 KnownZero.trunc(InBits);
1423 KnownOne.trunc(InBits);
1424 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1425 KnownZero.zext(BitWidth);
1426 KnownOne.zext(BitWidth);
1429 case ISD::TRUNCATE: {
1430 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1431 unsigned InBits = MVT::getSizeInBits(InVT);
1432 APInt InMask = Mask;
1433 InMask.zext(InBits);
1434 KnownZero.zext(InBits);
1435 KnownOne.zext(InBits);
1436 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1437 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1438 KnownZero.trunc(BitWidth);
1439 KnownOne.trunc(BitWidth);
1442 case ISD::AssertZext: {
1443 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1444 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT));
1445 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1447 KnownZero |= (~InMask) & Mask;
1451 // All bits are zero except the low bit.
1452 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1456 // If either the LHS or the RHS are Zero, the result is zero.
1457 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1458 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1459 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1460 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1462 // Output known-0 bits are known if clear or set in both the low clear bits
1463 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1464 // low 3 bits clear.
1465 unsigned KnownZeroOut = std::min(KnownZero.countTrailingOnes(),
1466 KnownZero2.countTrailingOnes());
1468 KnownZero = APInt::getLowBitsSet(BitWidth, KnownZeroOut);
1469 KnownOne = APInt(BitWidth, 0);
1473 ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0));
1476 // We know that the top bits of C-X are clear if X contains less bits
1477 // than C (i.e. no wrap-around can happen). For example, 20-X is
1478 // positive if we can prove that X is >= 0 and < 16.
1479 if (CLHS->getAPIntValue().isNonNegative()) {
1480 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros();
1481 // NLZ can't be BitWidth with no sign bit
1482 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1);
1483 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero, KnownOne, Depth+1);
1485 // If all of the MaskV bits are known to be zero, then we know the output
1486 // top bits are zero, because we now know that the output is from [0-C].
1487 if ((KnownZero & MaskV) == MaskV) {
1488 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros();
1489 // Top bits known zero.
1490 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask;
1491 KnownOne = APInt(BitWidth, 0); // No one bits known.
1493 KnownZero = KnownOne = APInt(BitWidth, 0); // Otherwise, nothing known.
1499 // Allow the target to implement this method for its nodes.
1500 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1501 case ISD::INTRINSIC_WO_CHAIN:
1502 case ISD::INTRINSIC_W_CHAIN:
1503 case ISD::INTRINSIC_VOID:
1504 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1510 /// ComputeMaskedBits - This is a wrapper around the APInt-using
1511 /// form of ComputeMaskedBits for use by clients that haven't been converted
1513 void SelectionDAG::ComputeMaskedBits(SDOperand Op, uint64_t Mask,
1514 uint64_t &KnownZero, uint64_t &KnownOne,
1515 unsigned Depth) const {
1516 // The masks are not wide enough to represent this type! Should use APInt.
1517 if (Op.getValueType() == MVT::i128)
1520 unsigned NumBits = MVT::getSizeInBits(Op.getValueType());
1521 APInt APIntMask(NumBits, Mask);
1522 APInt APIntKnownZero(NumBits, 0);
1523 APInt APIntKnownOne(NumBits, 0);
1524 ComputeMaskedBits(Op, APIntMask, APIntKnownZero, APIntKnownOne, Depth);
1525 KnownZero = APIntKnownZero.getZExtValue();
1526 KnownOne = APIntKnownOne.getZExtValue();
1529 /// ComputeNumSignBits - Return the number of times the sign bit of the
1530 /// register is replicated into the other bits. We know that at least 1 bit
1531 /// is always equal to the sign bit (itself), but other cases can give us
1532 /// information. For example, immediately after an "SRA X, 2", we know that
1533 /// the top 3 bits are all equal to each other, so we return 3.
1534 unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1535 MVT::ValueType VT = Op.getValueType();
1536 assert(MVT::isInteger(VT) && "Invalid VT!");
1537 unsigned VTBits = MVT::getSizeInBits(VT);
1541 return 1; // Limit search depth.
1543 switch (Op.getOpcode()) {
1545 case ISD::AssertSext:
1546 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1547 return VTBits-Tmp+1;
1548 case ISD::AssertZext:
1549 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1552 case ISD::Constant: {
1553 uint64_t Val = cast<ConstantSDNode>(Op)->getValue();
1554 // If negative, invert the bits, then look at it.
1555 if (Val & MVT::getIntVTSignBit(VT))
1558 // Shift the bits so they are the leading bits in the int64_t.
1561 // Return # leading zeros. We use 'min' here in case Val was zero before
1562 // shifting. We don't want to return '64' as for an i32 "0".
1563 return std::min(VTBits, CountLeadingZeros_64(Val));
1566 case ISD::SIGN_EXTEND:
1567 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1568 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1570 case ISD::SIGN_EXTEND_INREG:
1571 // Max of the input and what this extends.
1572 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1575 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1576 return std::max(Tmp, Tmp2);
1579 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1580 // SRA X, C -> adds C sign bits.
1581 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1582 Tmp += C->getValue();
1583 if (Tmp > VTBits) Tmp = VTBits;
1587 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1588 // shl destroys sign bits.
1589 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1590 if (C->getValue() >= VTBits || // Bad shift.
1591 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1592 return Tmp - C->getValue();
1597 case ISD::XOR: // NOT is handled here.
1598 // Logical binary ops preserve the number of sign bits.
1599 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1600 if (Tmp == 1) return 1; // Early out.
1601 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1602 return std::min(Tmp, Tmp2);
1605 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1606 if (Tmp == 1) return 1; // Early out.
1607 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1608 return std::min(Tmp, Tmp2);
1611 // If setcc returns 0/-1, all bits are sign bits.
1612 if (TLI.getSetCCResultContents() ==
1613 TargetLowering::ZeroOrNegativeOneSetCCResult)
1618 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1619 unsigned RotAmt = C->getValue() & (VTBits-1);
1621 // Handle rotate right by N like a rotate left by 32-N.
1622 if (Op.getOpcode() == ISD::ROTR)
1623 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1625 // If we aren't rotating out all of the known-in sign bits, return the
1626 // number that are left. This handles rotl(sext(x), 1) for example.
1627 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1628 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1632 // Add can have at most one carry bit. Thus we know that the output
1633 // is, at worst, one more bit than the inputs.
1634 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1635 if (Tmp == 1) return 1; // Early out.
1637 // Special case decrementing a value (ADD X, -1):
1638 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1639 if (CRHS->isAllOnesValue()) {
1640 uint64_t KnownZero, KnownOne;
1641 uint64_t Mask = MVT::getIntVTBitMask(VT);
1642 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1644 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1646 if ((KnownZero|1) == Mask)
1649 // If we are subtracting one from a positive number, there is no carry
1650 // out of the result.
1651 if (KnownZero & MVT::getIntVTSignBit(VT))
1655 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1656 if (Tmp2 == 1) return 1;
1657 return std::min(Tmp, Tmp2)-1;
1661 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1662 if (Tmp2 == 1) return 1;
1665 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1666 if (CLHS->getValue() == 0) {
1667 uint64_t KnownZero, KnownOne;
1668 uint64_t Mask = MVT::getIntVTBitMask(VT);
1669 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1670 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1672 if ((KnownZero|1) == Mask)
1675 // If the input is known to be positive (the sign bit is known clear),
1676 // the output of the NEG has the same number of sign bits as the input.
1677 if (KnownZero & MVT::getIntVTSignBit(VT))
1680 // Otherwise, we treat this like a SUB.
1683 // Sub can have at most one carry bit. Thus we know that the output
1684 // is, at worst, one more bit than the inputs.
1685 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1686 if (Tmp == 1) return 1; // Early out.
1687 return std::min(Tmp, Tmp2)-1;
1690 // FIXME: it's tricky to do anything useful for this, but it is an important
1691 // case for targets like X86.
1695 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1696 if (Op.getOpcode() == ISD::LOAD) {
1697 LoadSDNode *LD = cast<LoadSDNode>(Op);
1698 unsigned ExtType = LD->getExtensionType();
1701 case ISD::SEXTLOAD: // '17' bits known
1702 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1703 return VTBits-Tmp+1;
1704 case ISD::ZEXTLOAD: // '16' bits known
1705 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1710 // Allow the target to implement this method for its nodes.
1711 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1712 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1713 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1714 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1715 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1716 if (NumBits > 1) return NumBits;
1719 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1720 // use this information.
1721 uint64_t KnownZero, KnownOne;
1722 uint64_t Mask = MVT::getIntVTBitMask(VT);
1723 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1725 uint64_t SignBit = MVT::getIntVTSignBit(VT);
1726 if (KnownZero & SignBit) { // SignBit is 0
1728 } else if (KnownOne & SignBit) { // SignBit is 1;
1735 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1736 // the number of identical bits in the top of the input value.
1739 // Return # leading zeros. We use 'min' here in case Val was zero before
1740 // shifting. We don't want to return '64' as for an i32 "0".
1741 return std::min(VTBits, CountLeadingZeros_64(Mask));
1745 bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const {
1746 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
1747 if (!GA) return false;
1748 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal());
1749 if (!GV) return false;
1750 MachineModuleInfo *MMI = getMachineModuleInfo();
1751 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV);
1755 /// getNode - Gets or creates the specified node.
1757 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1758 FoldingSetNodeID ID;
1759 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
1761 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1762 return SDOperand(E, 0);
1763 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
1764 CSEMap.InsertNode(N, IP);
1766 AllNodes.push_back(N);
1767 return SDOperand(N, 0);
1770 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1771 SDOperand Operand) {
1773 // Constant fold unary operations with an integer constant operand.
1774 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1775 uint64_t Val = C->getValue();
1778 case ISD::SIGN_EXTEND: return getConstant(C->getSignExtended(), VT);
1779 case ISD::ANY_EXTEND:
1780 case ISD::ZERO_EXTEND: return getConstant(Val, VT);
1781 case ISD::TRUNCATE: return getConstant(Val, VT);
1782 case ISD::UINT_TO_FP:
1783 case ISD::SINT_TO_FP: {
1784 const uint64_t zero[] = {0, 0};
1785 // No compile time operations on this type.
1786 if (VT==MVT::ppcf128)
1788 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero));
1789 (void)apf.convertFromZeroExtendedInteger(&Val,
1790 MVT::getSizeInBits(Operand.getValueType()),
1791 Opcode==ISD::SINT_TO_FP,
1792 APFloat::rmNearestTiesToEven);
1793 return getConstantFP(apf, VT);
1795 case ISD::BIT_CONVERT:
1796 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1797 return getConstantFP(BitsToFloat(Val), VT);
1798 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1799 return getConstantFP(BitsToDouble(Val), VT);
1803 default: assert(0 && "Invalid bswap!"); break;
1804 case MVT::i16: return getConstant(ByteSwap_16((unsigned short)Val), VT);
1805 case MVT::i32: return getConstant(ByteSwap_32((unsigned)Val), VT);
1806 case MVT::i64: return getConstant(ByteSwap_64(Val), VT);
1811 default: assert(0 && "Invalid ctpop!"); break;
1812 case MVT::i1: return getConstant(Val != 0, VT);
1814 Tmp1 = (unsigned)Val & 0xFF;
1815 return getConstant(CountPopulation_32(Tmp1), VT);
1817 Tmp1 = (unsigned)Val & 0xFFFF;
1818 return getConstant(CountPopulation_32(Tmp1), VT);
1820 return getConstant(CountPopulation_32((unsigned)Val), VT);
1822 return getConstant(CountPopulation_64(Val), VT);
1826 default: assert(0 && "Invalid ctlz!"); break;
1827 case MVT::i1: return getConstant(Val == 0, VT);
1829 Tmp1 = (unsigned)Val & 0xFF;
1830 return getConstant(CountLeadingZeros_32(Tmp1)-24, VT);
1832 Tmp1 = (unsigned)Val & 0xFFFF;
1833 return getConstant(CountLeadingZeros_32(Tmp1)-16, VT);
1835 return getConstant(CountLeadingZeros_32((unsigned)Val), VT);
1837 return getConstant(CountLeadingZeros_64(Val), VT);
1841 default: assert(0 && "Invalid cttz!"); break;
1842 case MVT::i1: return getConstant(Val == 0, VT);
1844 Tmp1 = (unsigned)Val | 0x100;
1845 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1847 Tmp1 = (unsigned)Val | 0x10000;
1848 return getConstant(CountTrailingZeros_32(Tmp1), VT);
1850 return getConstant(CountTrailingZeros_32((unsigned)Val), VT);
1852 return getConstant(CountTrailingZeros_64(Val), VT);
1857 // Constant fold unary operations with a floating point constant operand.
1858 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1859 APFloat V = C->getValueAPF(); // make copy
1860 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) {
1864 return getConstantFP(V, VT);
1867 return getConstantFP(V, VT);
1869 case ISD::FP_EXTEND:
1870 // This can return overflow, underflow, or inexact; we don't care.
1871 // FIXME need to be more flexible about rounding mode.
1872 (void) V.convert(VT==MVT::f32 ? APFloat::IEEEsingle :
1873 VT==MVT::f64 ? APFloat::IEEEdouble :
1874 VT==MVT::f80 ? APFloat::x87DoubleExtended :
1875 VT==MVT::f128 ? APFloat::IEEEquad :
1877 APFloat::rmNearestTiesToEven);
1878 return getConstantFP(V, VT);
1879 case ISD::FP_TO_SINT:
1880 case ISD::FP_TO_UINT: {
1882 assert(integerPartWidth >= 64);
1883 // FIXME need to be more flexible about rounding mode.
1884 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1885 Opcode==ISD::FP_TO_SINT,
1886 APFloat::rmTowardZero);
1887 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1889 return getConstant(x, VT);
1891 case ISD::BIT_CONVERT:
1892 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1893 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1894 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1895 return getConstant(V.convertToAPInt().getZExtValue(), VT);
1901 unsigned OpOpcode = Operand.Val->getOpcode();
1903 case ISD::TokenFactor:
1904 return Operand; // Factor of one node? No factor.
1905 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node");
1906 case ISD::FP_EXTEND:
1907 assert(MVT::isFloatingPoint(VT) &&
1908 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1909 if (Operand.getValueType() == VT) return Operand; // noop conversion.
1911 case ISD::SIGN_EXTEND:
1912 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1913 "Invalid SIGN_EXTEND!");
1914 if (Operand.getValueType() == VT) return Operand; // noop extension
1915 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1916 && "Invalid sext node, dst < src!");
1917 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1918 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1920 case ISD::ZERO_EXTEND:
1921 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1922 "Invalid ZERO_EXTEND!");
1923 if (Operand.getValueType() == VT) return Operand; // noop extension
1924 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1925 && "Invalid zext node, dst < src!");
1926 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1927 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1929 case ISD::ANY_EXTEND:
1930 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1931 "Invalid ANY_EXTEND!");
1932 if (Operand.getValueType() == VT) return Operand; // noop extension
1933 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1934 && "Invalid anyext node, dst < src!");
1935 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1936 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
1937 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1940 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1941 "Invalid TRUNCATE!");
1942 if (Operand.getValueType() == VT) return Operand; // noop truncate
1943 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT)
1944 && "Invalid truncate node, src < dst!");
1945 if (OpOpcode == ISD::TRUNCATE)
1946 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1947 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
1948 OpOpcode == ISD::ANY_EXTEND) {
1949 // If the source is smaller than the dest, we still need an extend.
1950 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1951 < MVT::getSizeInBits(VT))
1952 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1953 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
1954 > MVT::getSizeInBits(VT))
1955 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
1957 return Operand.Val->getOperand(0);
1960 case ISD::BIT_CONVERT:
1961 // Basic sanity checking.
1962 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
1963 && "Cannot BIT_CONVERT between types of different sizes!");
1964 if (VT == Operand.getValueType()) return Operand; // noop conversion.
1965 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
1966 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
1967 if (OpOpcode == ISD::UNDEF)
1968 return getNode(ISD::UNDEF, VT);
1970 case ISD::SCALAR_TO_VECTOR:
1971 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
1972 MVT::getVectorElementType(VT) == Operand.getValueType() &&
1973 "Illegal SCALAR_TO_VECTOR node!");
1976 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
1977 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
1978 Operand.Val->getOperand(0));
1979 if (OpOpcode == ISD::FNEG) // --X -> X
1980 return Operand.Val->getOperand(0);
1983 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
1984 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
1989 SDVTList VTs = getVTList(VT);
1990 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
1991 FoldingSetNodeID ID;
1992 SDOperand Ops[1] = { Operand };
1993 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
1995 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1996 return SDOperand(E, 0);
1997 N = new UnarySDNode(Opcode, VTs, Operand);
1998 CSEMap.InsertNode(N, IP);
2000 N = new UnarySDNode(Opcode, VTs, Operand);
2002 AllNodes.push_back(N);
2003 return SDOperand(N, 0);
2008 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2009 SDOperand N1, SDOperand N2) {
2010 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2011 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2014 case ISD::TokenFactor:
2015 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
2016 N2.getValueType() == MVT::Other && "Invalid token factor!");
2017 // Fold trivial token factors.
2018 if (N1.getOpcode() == ISD::EntryToken) return N2;
2019 if (N2.getOpcode() == ISD::EntryToken) return N1;
2022 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
2023 N1.getValueType() == VT && "Binary operator types must match!");
2024 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
2025 // worth handling here.
2026 if (N2C && N2C->getValue() == 0)
2028 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X
2033 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
2034 N1.getValueType() == VT && "Binary operator types must match!");
2035 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
2036 // worth handling here.
2037 if (N2C && N2C->getValue() == 0)
2044 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
2056 assert(N1.getValueType() == N2.getValueType() &&
2057 N1.getValueType() == VT && "Binary operator types must match!");
2059 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
2060 assert(N1.getValueType() == VT &&
2061 MVT::isFloatingPoint(N1.getValueType()) &&
2062 MVT::isFloatingPoint(N2.getValueType()) &&
2063 "Invalid FCOPYSIGN!");
2070 assert(VT == N1.getValueType() &&
2071 "Shift operators return type must be the same as their first arg");
2072 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
2073 VT != MVT::i1 && "Shifts only work on integers");
2075 case ISD::FP_ROUND_INREG: {
2076 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2077 assert(VT == N1.getValueType() && "Not an inreg round!");
2078 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
2079 "Cannot FP_ROUND_INREG integer types");
2080 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2081 "Not rounding down!");
2082 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2086 assert(MVT::isFloatingPoint(VT) &&
2087 MVT::isFloatingPoint(N1.getValueType()) &&
2088 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) &&
2089 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!");
2090 if (N1.getValueType() == VT) return N1; // noop conversion.
2092 case ISD::AssertSext:
2093 case ISD::AssertZext: {
2094 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2095 assert(VT == N1.getValueType() && "Not an inreg extend!");
2096 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2097 "Cannot *_EXTEND_INREG FP types");
2098 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2100 if (VT == EVT) return N1; // noop assertion.
2103 case ISD::SIGN_EXTEND_INREG: {
2104 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2105 assert(VT == N1.getValueType() && "Not an inreg extend!");
2106 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2107 "Cannot *_EXTEND_INREG FP types");
2108 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2110 if (EVT == VT) return N1; // Not actually extending
2113 int64_t Val = N1C->getValue();
2114 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
2115 Val <<= 64-FromBits;
2116 Val >>= 64-FromBits;
2117 return getConstant(Val, VT);
2121 case ISD::EXTRACT_VECTOR_ELT:
2122 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2124 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2125 // expanding copies of large vectors from registers.
2126 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2127 N1.getNumOperands() > 0) {
2129 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2130 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2131 N1.getOperand(N2C->getValue() / Factor),
2132 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2135 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2136 // expanding large vector constants.
2137 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2138 return N1.getOperand(N2C->getValue());
2140 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2141 // operations are lowered to scalars.
2142 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2143 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2145 return N1.getOperand(1);
2147 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2150 case ISD::EXTRACT_ELEMENT:
2151 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
2153 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2154 // 64-bit integers into 32-bit parts. Instead of building the extract of
2155 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2156 if (N1.getOpcode() == ISD::BUILD_PAIR)
2157 return N1.getOperand(N2C->getValue());
2159 // EXTRACT_ELEMENT of a constant int is also very common.
2160 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2161 unsigned Shift = MVT::getSizeInBits(VT) * N2C->getValue();
2162 return getConstant(C->getValue() >> Shift, VT);
2165 case ISD::EXTRACT_SUBVECTOR:
2166 if (N1.getValueType() == VT) // Trivial extraction.
2173 uint64_t C1 = N1C->getValue(), C2 = N2C->getValue();
2175 case ISD::ADD: return getConstant(C1 + C2, VT);
2176 case ISD::SUB: return getConstant(C1 - C2, VT);
2177 case ISD::MUL: return getConstant(C1 * C2, VT);
2179 if (C2) return getConstant(C1 / C2, VT);
2182 if (C2) return getConstant(C1 % C2, VT);
2185 if (C2) return getConstant(N1C->getSignExtended() /
2186 N2C->getSignExtended(), VT);
2189 if (C2) return getConstant(N1C->getSignExtended() %
2190 N2C->getSignExtended(), VT);
2192 case ISD::AND : return getConstant(C1 & C2, VT);
2193 case ISD::OR : return getConstant(C1 | C2, VT);
2194 case ISD::XOR : return getConstant(C1 ^ C2, VT);
2195 case ISD::SHL : return getConstant(C1 << C2, VT);
2196 case ISD::SRL : return getConstant(C1 >> C2, VT);
2197 case ISD::SRA : return getConstant(N1C->getSignExtended() >>(int)C2, VT);
2199 return getConstant((C1 << C2) | (C1 >> (MVT::getSizeInBits(VT) - C2)),
2202 return getConstant((C1 >> C2) | (C1 << (MVT::getSizeInBits(VT) - C2)),
2206 } else { // Cannonicalize constant to RHS if commutative
2207 if (isCommutativeBinOp(Opcode)) {
2208 std::swap(N1C, N2C);
2214 // Constant fold FP operations.
2215 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
2216 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
2218 if (!N2CFP && isCommutativeBinOp(Opcode)) {
2219 // Cannonicalize constant to RHS if commutative
2220 std::swap(N1CFP, N2CFP);
2222 } else if (N2CFP && VT != MVT::ppcf128) {
2223 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
2224 APFloat::opStatus s;
2227 s = V1.add(V2, APFloat::rmNearestTiesToEven);
2228 if (s != APFloat::opInvalidOp)
2229 return getConstantFP(V1, VT);
2232 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
2233 if (s!=APFloat::opInvalidOp)
2234 return getConstantFP(V1, VT);
2237 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
2238 if (s!=APFloat::opInvalidOp)
2239 return getConstantFP(V1, VT);
2242 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
2243 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2244 return getConstantFP(V1, VT);
2247 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
2248 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2249 return getConstantFP(V1, VT);
2251 case ISD::FCOPYSIGN:
2253 return getConstantFP(V1, VT);
2259 // Canonicalize an UNDEF to the RHS, even over a constant.
2260 if (N1.getOpcode() == ISD::UNDEF) {
2261 if (isCommutativeBinOp(Opcode)) {
2265 case ISD::FP_ROUND_INREG:
2266 case ISD::SIGN_EXTEND_INREG:
2272 return N1; // fold op(undef, arg2) -> undef
2279 if (!MVT::isVector(VT))
2280 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2281 // For vectors, we can't easily build an all zero vector, just return
2288 // Fold a bunch of operators when the RHS is undef.
2289 if (N2.getOpcode() == ISD::UNDEF) {
2305 return N2; // fold op(arg1, undef) -> undef
2310 if (!MVT::isVector(VT))
2311 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2312 // For vectors, we can't easily build an all zero vector, just return
2316 if (!MVT::isVector(VT))
2317 return getConstant(MVT::getIntVTBitMask(VT), VT);
2318 // For vectors, we can't easily build an all one vector, just return
2326 // Memoize this node if possible.
2328 SDVTList VTs = getVTList(VT);
2329 if (VT != MVT::Flag) {
2330 SDOperand Ops[] = { N1, N2 };
2331 FoldingSetNodeID ID;
2332 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2334 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2335 return SDOperand(E, 0);
2336 N = new BinarySDNode(Opcode, VTs, N1, N2);
2337 CSEMap.InsertNode(N, IP);
2339 N = new BinarySDNode(Opcode, VTs, N1, N2);
2342 AllNodes.push_back(N);
2343 return SDOperand(N, 0);
2346 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2347 SDOperand N1, SDOperand N2, SDOperand N3) {
2348 // Perform various simplifications.
2349 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2350 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2353 // Use FoldSetCC to simplify SETCC's.
2354 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
2355 if (Simp.Val) return Simp;
2360 if (N1C->getValue())
2361 return N2; // select true, X, Y -> X
2363 return N3; // select false, X, Y -> Y
2366 if (N2 == N3) return N2; // select C, X, X -> X
2370 if (N2C->getValue()) // Unconditional branch
2371 return getNode(ISD::BR, MVT::Other, N1, N3);
2373 return N1; // Never-taken branch
2376 case ISD::VECTOR_SHUFFLE:
2377 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2378 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2379 N3.getOpcode() == ISD::BUILD_VECTOR &&
2380 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2381 "Illegal VECTOR_SHUFFLE node!");
2383 case ISD::BIT_CONVERT:
2384 // Fold bit_convert nodes from a type to themselves.
2385 if (N1.getValueType() == VT)
2390 // Memoize node if it doesn't produce a flag.
2392 SDVTList VTs = getVTList(VT);
2393 if (VT != MVT::Flag) {
2394 SDOperand Ops[] = { N1, N2, N3 };
2395 FoldingSetNodeID ID;
2396 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2398 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2399 return SDOperand(E, 0);
2400 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2401 CSEMap.InsertNode(N, IP);
2403 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2405 AllNodes.push_back(N);
2406 return SDOperand(N, 0);
2409 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2410 SDOperand N1, SDOperand N2, SDOperand N3,
2412 SDOperand Ops[] = { N1, N2, N3, N4 };
2413 return getNode(Opcode, VT, Ops, 4);
2416 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2417 SDOperand N1, SDOperand N2, SDOperand N3,
2418 SDOperand N4, SDOperand N5) {
2419 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2420 return getNode(Opcode, VT, Ops, 5);
2423 SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dest,
2424 SDOperand Src, SDOperand Size,
2426 SDOperand AlwaysInline) {
2427 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2428 return getNode(ISD::MEMCPY, MVT::Other, Ops, 6);
2431 SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dest,
2432 SDOperand Src, SDOperand Size,
2434 SDOperand AlwaysInline) {
2435 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2436 return getNode(ISD::MEMMOVE, MVT::Other, Ops, 6);
2439 SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dest,
2440 SDOperand Src, SDOperand Size,
2442 SDOperand AlwaysInline) {
2443 SDOperand Ops[] = { Chain, Dest, Src, Size, Align, AlwaysInline };
2444 return getNode(ISD::MEMSET, MVT::Other, Ops, 6);
2447 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2448 SDOperand Ptr, SDOperand Cmp,
2449 SDOperand Swp, MVT::ValueType VT) {
2450 assert(Opcode == ISD::ATOMIC_LCS && "Invalid Atomic Op");
2451 assert(Cmp.getValueType() == Swp.getValueType() && "Invalid Atomic Op Types");
2452 SDVTList VTs = getVTList(Cmp.getValueType(), MVT::Other);
2453 FoldingSetNodeID ID;
2454 SDOperand Ops[] = {Chain, Ptr, Cmp, Swp};
2455 AddNodeIDNode(ID, Opcode, VTs, Ops, 4);
2456 ID.AddInteger((unsigned int)VT);
2458 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2459 return SDOperand(E, 0);
2460 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Cmp, Swp, VT);
2461 CSEMap.InsertNode(N, IP);
2462 AllNodes.push_back(N);
2463 return SDOperand(N, 0);
2466 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2467 SDOperand Ptr, SDOperand Val,
2468 MVT::ValueType VT) {
2469 assert((Opcode == ISD::ATOMIC_LAS || Opcode == ISD::ATOMIC_SWAP)
2470 && "Invalid Atomic Op");
2471 SDVTList VTs = getVTList(Val.getValueType(), MVT::Other);
2472 FoldingSetNodeID ID;
2473 SDOperand Ops[] = {Chain, Ptr, Val};
2474 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2475 ID.AddInteger((unsigned int)VT);
2477 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2478 return SDOperand(E, 0);
2479 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Val, VT);
2480 CSEMap.InsertNode(N, IP);
2481 AllNodes.push_back(N);
2482 return SDOperand(N, 0);
2485 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2486 SDOperand Chain, SDOperand Ptr,
2487 const Value *SV, int SVOffset,
2488 bool isVolatile, unsigned Alignment) {
2489 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2491 if (VT != MVT::iPTR) {
2492 Ty = MVT::getTypeForValueType(VT);
2494 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2495 assert(PT && "Value for load must be a pointer");
2496 Ty = PT->getElementType();
2498 assert(Ty && "Could not get type information for load");
2499 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2501 SDVTList VTs = getVTList(VT, MVT::Other);
2502 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2503 SDOperand Ops[] = { Chain, Ptr, Undef };
2504 FoldingSetNodeID ID;
2505 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2506 ID.AddInteger(ISD::UNINDEXED);
2507 ID.AddInteger(ISD::NON_EXTLOAD);
2508 ID.AddInteger((unsigned int)VT);
2509 ID.AddInteger(Alignment);
2510 ID.AddInteger(isVolatile);
2512 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2513 return SDOperand(E, 0);
2514 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED,
2515 ISD::NON_EXTLOAD, VT, SV, SVOffset, Alignment,
2517 CSEMap.InsertNode(N, IP);
2518 AllNodes.push_back(N);
2519 return SDOperand(N, 0);
2522 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
2523 SDOperand Chain, SDOperand Ptr,
2525 int SVOffset, MVT::ValueType EVT,
2526 bool isVolatile, unsigned Alignment) {
2527 // If they are asking for an extending load from/to the same thing, return a
2530 return getLoad(VT, Chain, Ptr, SV, SVOffset, isVolatile, Alignment);
2532 if (MVT::isVector(VT))
2533 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
2535 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) &&
2536 "Should only be an extending load, not truncating!");
2537 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2538 "Cannot sign/zero extend a FP/Vector load!");
2539 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2540 "Cannot convert from FP to Int or Int -> FP!");
2542 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2544 if (VT != MVT::iPTR) {
2545 Ty = MVT::getTypeForValueType(VT);
2547 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2548 assert(PT && "Value for load must be a pointer");
2549 Ty = PT->getElementType();
2551 assert(Ty && "Could not get type information for load");
2552 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2554 SDVTList VTs = getVTList(VT, MVT::Other);
2555 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2556 SDOperand Ops[] = { Chain, Ptr, Undef };
2557 FoldingSetNodeID ID;
2558 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2559 ID.AddInteger(ISD::UNINDEXED);
2560 ID.AddInteger(ExtType);
2561 ID.AddInteger((unsigned int)EVT);
2562 ID.AddInteger(Alignment);
2563 ID.AddInteger(isVolatile);
2565 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2566 return SDOperand(E, 0);
2567 SDNode *N = new LoadSDNode(Ops, VTs, ISD::UNINDEXED, ExtType, EVT,
2568 SV, SVOffset, Alignment, isVolatile);
2569 CSEMap.InsertNode(N, IP);
2570 AllNodes.push_back(N);
2571 return SDOperand(N, 0);
2575 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2576 SDOperand Offset, ISD::MemIndexedMode AM) {
2577 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
2578 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2579 "Load is already a indexed load!");
2580 MVT::ValueType VT = OrigLoad.getValueType();
2581 SDVTList VTs = getVTList(VT, Base.getValueType(), MVT::Other);
2582 SDOperand Ops[] = { LD->getChain(), Base, Offset };
2583 FoldingSetNodeID ID;
2584 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2586 ID.AddInteger(LD->getExtensionType());
2587 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
2588 ID.AddInteger(LD->getAlignment());
2589 ID.AddInteger(LD->isVolatile());
2591 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2592 return SDOperand(E, 0);
2593 SDNode *N = new LoadSDNode(Ops, VTs, AM,
2594 LD->getExtensionType(), LD->getMemoryVT(),
2595 LD->getSrcValue(), LD->getSrcValueOffset(),
2596 LD->getAlignment(), LD->isVolatile());
2597 CSEMap.InsertNode(N, IP);
2598 AllNodes.push_back(N);
2599 return SDOperand(N, 0);
2602 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
2603 SDOperand Ptr, const Value *SV, int SVOffset,
2604 bool isVolatile, unsigned Alignment) {
2605 MVT::ValueType VT = Val.getValueType();
2607 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2609 if (VT != MVT::iPTR) {
2610 Ty = MVT::getTypeForValueType(VT);
2612 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2613 assert(PT && "Value for store must be a pointer");
2614 Ty = PT->getElementType();
2616 assert(Ty && "Could not get type information for store");
2617 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2619 SDVTList VTs = getVTList(MVT::Other);
2620 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2621 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2622 FoldingSetNodeID ID;
2623 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2624 ID.AddInteger(ISD::UNINDEXED);
2625 ID.AddInteger(false);
2626 ID.AddInteger((unsigned int)VT);
2627 ID.AddInteger(Alignment);
2628 ID.AddInteger(isVolatile);
2630 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2631 return SDOperand(E, 0);
2632 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
2633 VT, SV, SVOffset, Alignment, isVolatile);
2634 CSEMap.InsertNode(N, IP);
2635 AllNodes.push_back(N);
2636 return SDOperand(N, 0);
2639 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
2640 SDOperand Ptr, const Value *SV,
2641 int SVOffset, MVT::ValueType SVT,
2642 bool isVolatile, unsigned Alignment) {
2643 MVT::ValueType VT = Val.getValueType();
2646 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment);
2648 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) &&
2649 "Not a truncation?");
2650 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
2651 "Can't do FP-INT conversion!");
2653 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2655 if (VT != MVT::iPTR) {
2656 Ty = MVT::getTypeForValueType(VT);
2658 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2659 assert(PT && "Value for store must be a pointer");
2660 Ty = PT->getElementType();
2662 assert(Ty && "Could not get type information for store");
2663 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2665 SDVTList VTs = getVTList(MVT::Other);
2666 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2667 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
2668 FoldingSetNodeID ID;
2669 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2670 ID.AddInteger(ISD::UNINDEXED);
2672 ID.AddInteger((unsigned int)SVT);
2673 ID.AddInteger(Alignment);
2674 ID.AddInteger(isVolatile);
2676 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2677 return SDOperand(E, 0);
2678 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true,
2679 SVT, SV, SVOffset, Alignment, isVolatile);
2680 CSEMap.InsertNode(N, IP);
2681 AllNodes.push_back(N);
2682 return SDOperand(N, 0);
2686 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
2687 SDOperand Offset, ISD::MemIndexedMode AM) {
2688 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
2689 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
2690 "Store is already a indexed store!");
2691 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
2692 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
2693 FoldingSetNodeID ID;
2694 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
2696 ID.AddInteger(ST->isTruncatingStore());
2697 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
2698 ID.AddInteger(ST->getAlignment());
2699 ID.AddInteger(ST->isVolatile());
2701 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2702 return SDOperand(E, 0);
2703 SDNode *N = new StoreSDNode(Ops, VTs, AM,
2704 ST->isTruncatingStore(), ST->getMemoryVT(),
2705 ST->getSrcValue(), ST->getSrcValueOffset(),
2706 ST->getAlignment(), ST->isVolatile());
2707 CSEMap.InsertNode(N, IP);
2708 AllNodes.push_back(N);
2709 return SDOperand(N, 0);
2712 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
2713 SDOperand Chain, SDOperand Ptr,
2715 SDOperand Ops[] = { Chain, Ptr, SV };
2716 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
2719 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2720 const SDOperand *Ops, unsigned NumOps) {
2722 case 0: return getNode(Opcode, VT);
2723 case 1: return getNode(Opcode, VT, Ops[0]);
2724 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
2725 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
2731 case ISD::SELECT_CC: {
2732 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
2733 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
2734 "LHS and RHS of condition must have same type!");
2735 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2736 "True and False arms of SelectCC must have same type!");
2737 assert(Ops[2].getValueType() == VT &&
2738 "select_cc node must be of same type as true and false value!");
2742 assert(NumOps == 5 && "BR_CC takes 5 operands!");
2743 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
2744 "LHS/RHS of comparison should match types!");
2751 SDVTList VTs = getVTList(VT);
2752 if (VT != MVT::Flag) {
2753 FoldingSetNodeID ID;
2754 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
2756 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2757 return SDOperand(E, 0);
2758 N = new SDNode(Opcode, VTs, Ops, NumOps);
2759 CSEMap.InsertNode(N, IP);
2761 N = new SDNode(Opcode, VTs, Ops, NumOps);
2763 AllNodes.push_back(N);
2764 return SDOperand(N, 0);
2767 SDOperand SelectionDAG::getNode(unsigned Opcode,
2768 std::vector<MVT::ValueType> &ResultTys,
2769 const SDOperand *Ops, unsigned NumOps) {
2770 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
2774 SDOperand SelectionDAG::getNode(unsigned Opcode,
2775 const MVT::ValueType *VTs, unsigned NumVTs,
2776 const SDOperand *Ops, unsigned NumOps) {
2778 return getNode(Opcode, VTs[0], Ops, NumOps);
2779 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
2782 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2783 const SDOperand *Ops, unsigned NumOps) {
2784 if (VTList.NumVTs == 1)
2785 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
2788 // FIXME: figure out how to safely handle things like
2789 // int foo(int x) { return 1 << (x & 255); }
2790 // int bar() { return foo(256); }
2792 case ISD::SRA_PARTS:
2793 case ISD::SRL_PARTS:
2794 case ISD::SHL_PARTS:
2795 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
2796 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
2797 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2798 else if (N3.getOpcode() == ISD::AND)
2799 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
2800 // If the and is only masking out bits that cannot effect the shift,
2801 // eliminate the and.
2802 unsigned NumBits = MVT::getSizeInBits(VT)*2;
2803 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
2804 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
2810 // Memoize the node unless it returns a flag.
2812 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
2813 FoldingSetNodeID ID;
2814 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
2816 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2817 return SDOperand(E, 0);
2819 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2820 else if (NumOps == 2)
2821 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2822 else if (NumOps == 3)
2823 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2825 N = new SDNode(Opcode, VTList, Ops, NumOps);
2826 CSEMap.InsertNode(N, IP);
2829 N = new UnarySDNode(Opcode, VTList, Ops[0]);
2830 else if (NumOps == 2)
2831 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
2832 else if (NumOps == 3)
2833 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
2835 N = new SDNode(Opcode, VTList, Ops, NumOps);
2837 AllNodes.push_back(N);
2838 return SDOperand(N, 0);
2841 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) {
2842 return getNode(Opcode, VTList, 0, 0);
2845 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2847 SDOperand Ops[] = { N1 };
2848 return getNode(Opcode, VTList, Ops, 1);
2851 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2852 SDOperand N1, SDOperand N2) {
2853 SDOperand Ops[] = { N1, N2 };
2854 return getNode(Opcode, VTList, Ops, 2);
2857 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2858 SDOperand N1, SDOperand N2, SDOperand N3) {
2859 SDOperand Ops[] = { N1, N2, N3 };
2860 return getNode(Opcode, VTList, Ops, 3);
2863 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2864 SDOperand N1, SDOperand N2, SDOperand N3,
2866 SDOperand Ops[] = { N1, N2, N3, N4 };
2867 return getNode(Opcode, VTList, Ops, 4);
2870 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
2871 SDOperand N1, SDOperand N2, SDOperand N3,
2872 SDOperand N4, SDOperand N5) {
2873 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2874 return getNode(Opcode, VTList, Ops, 5);
2877 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
2878 return makeVTList(SDNode::getValueTypeList(VT), 1);
2881 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
2882 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2883 E = VTList.end(); I != E; ++I) {
2884 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
2885 return makeVTList(&(*I)[0], 2);
2887 std::vector<MVT::ValueType> V;
2890 VTList.push_front(V);
2891 return makeVTList(&(*VTList.begin())[0], 2);
2893 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
2894 MVT::ValueType VT3) {
2895 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2896 E = VTList.end(); I != E; ++I) {
2897 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
2899 return makeVTList(&(*I)[0], 3);
2901 std::vector<MVT::ValueType> V;
2905 VTList.push_front(V);
2906 return makeVTList(&(*VTList.begin())[0], 3);
2909 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
2911 case 0: assert(0 && "Cannot have nodes without results!");
2912 case 1: return getVTList(VTs[0]);
2913 case 2: return getVTList(VTs[0], VTs[1]);
2914 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
2918 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
2919 E = VTList.end(); I != E; ++I) {
2920 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
2922 bool NoMatch = false;
2923 for (unsigned i = 2; i != NumVTs; ++i)
2924 if (VTs[i] != (*I)[i]) {
2929 return makeVTList(&*I->begin(), NumVTs);
2932 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
2933 return makeVTList(&*VTList.begin()->begin(), NumVTs);
2937 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
2938 /// specified operands. If the resultant node already exists in the DAG,
2939 /// this does not modify the specified node, instead it returns the node that
2940 /// already exists. If the resultant node does not exist in the DAG, the
2941 /// input node is returned. As a degenerate case, if you specify the same
2942 /// input operands as the node already has, the input node is returned.
2943 SDOperand SelectionDAG::
2944 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
2945 SDNode *N = InN.Val;
2946 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
2948 // Check to see if there is no change.
2949 if (Op == N->getOperand(0)) return InN;
2951 // See if the modified node already exists.
2952 void *InsertPos = 0;
2953 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
2954 return SDOperand(Existing, InN.ResNo);
2956 // Nope it doesn't. Remove the node from it's current place in the maps.
2958 RemoveNodeFromCSEMaps(N);
2960 // Now we update the operands.
2961 N->OperandList[0].Val->removeUser(N);
2963 N->OperandList[0] = Op;
2965 // If this gets put into a CSE map, add it.
2966 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
2970 SDOperand SelectionDAG::
2971 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
2972 SDNode *N = InN.Val;
2973 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
2975 // Check to see if there is no change.
2976 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
2977 return InN; // No operands changed, just return the input node.
2979 // See if the modified node already exists.
2980 void *InsertPos = 0;
2981 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
2982 return SDOperand(Existing, InN.ResNo);
2984 // Nope it doesn't. Remove the node from it's current place in the maps.
2986 RemoveNodeFromCSEMaps(N);
2988 // Now we update the operands.
2989 if (N->OperandList[0] != Op1) {
2990 N->OperandList[0].Val->removeUser(N);
2991 Op1.Val->addUser(N);
2992 N->OperandList[0] = Op1;
2994 if (N->OperandList[1] != Op2) {
2995 N->OperandList[1].Val->removeUser(N);
2996 Op2.Val->addUser(N);
2997 N->OperandList[1] = Op2;
3000 // If this gets put into a CSE map, add it.
3001 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
3005 SDOperand SelectionDAG::
3006 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
3007 SDOperand Ops[] = { Op1, Op2, Op3 };
3008 return UpdateNodeOperands(N, Ops, 3);
3011 SDOperand SelectionDAG::
3012 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
3013 SDOperand Op3, SDOperand Op4) {
3014 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
3015 return UpdateNodeOperands(N, Ops, 4);
3018 SDOperand SelectionDAG::
3019 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
3020 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
3021 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
3022 return UpdateNodeOperands(N, Ops, 5);
3026 SDOperand SelectionDAG::
3027 UpdateNodeOperands(SDOperand InN, SDOperand *Ops, unsigned NumOps) {
3028 SDNode *N = InN.Val;
3029 assert(N->getNumOperands() == NumOps &&
3030 "Update with wrong number of operands");
3032 // Check to see if there is no change.
3033 bool AnyChange = false;
3034 for (unsigned i = 0; i != NumOps; ++i) {
3035 if (Ops[i] != N->getOperand(i)) {
3041 // No operands changed, just return the input node.
3042 if (!AnyChange) return InN;
3044 // See if the modified node already exists.
3045 void *InsertPos = 0;
3046 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
3047 return SDOperand(Existing, InN.ResNo);
3049 // Nope it doesn't. Remove the node from it's current place in the maps.
3051 RemoveNodeFromCSEMaps(N);
3053 // Now we update the operands.
3054 for (unsigned i = 0; i != NumOps; ++i) {
3055 if (N->OperandList[i] != Ops[i]) {
3056 N->OperandList[i].Val->removeUser(N);
3057 Ops[i].Val->addUser(N);
3058 N->OperandList[i] = Ops[i];
3062 // If this gets put into a CSE map, add it.
3063 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
3068 /// MorphNodeTo - This frees the operands of the current node, resets the
3069 /// opcode, types, and operands to the specified value. This should only be
3070 /// used by the SelectionDAG class.
3071 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
3072 const SDOperand *Ops, unsigned NumOps) {
3075 NumValues = L.NumVTs;
3077 // Clear the operands list, updating used nodes to remove this from their
3079 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
3080 I->Val->removeUser(this);
3082 // If NumOps is larger than the # of operands we currently have, reallocate
3083 // the operand list.
3084 if (NumOps > NumOperands) {
3085 if (OperandsNeedDelete)
3086 delete [] OperandList;
3087 OperandList = new SDOperand[NumOps];
3088 OperandsNeedDelete = true;
3091 // Assign the new operands.
3092 NumOperands = NumOps;
3094 for (unsigned i = 0, e = NumOps; i != e; ++i) {
3095 OperandList[i] = Ops[i];
3096 SDNode *N = OperandList[i].Val;
3097 N->Uses.push_back(this);
3101 /// SelectNodeTo - These are used for target selectors to *mutate* the
3102 /// specified node to have the specified return type, Target opcode, and
3103 /// operands. Note that target opcodes are stored as
3104 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
3106 /// Note that SelectNodeTo returns the resultant node. If there is already a
3107 /// node of the specified opcode and operands, it returns that node instead of
3108 /// the current one.
3109 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3110 MVT::ValueType VT) {
3111 SDVTList VTs = getVTList(VT);
3112 FoldingSetNodeID ID;
3113 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3115 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3118 RemoveNodeFromCSEMaps(N);
3120 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, 0, 0);
3122 CSEMap.InsertNode(N, IP);
3126 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3127 MVT::ValueType VT, SDOperand Op1) {
3128 // If an identical node already exists, use it.
3129 SDVTList VTs = getVTList(VT);
3130 SDOperand Ops[] = { Op1 };
3132 FoldingSetNodeID ID;
3133 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3135 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3138 RemoveNodeFromCSEMaps(N);
3139 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3140 CSEMap.InsertNode(N, IP);
3144 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3145 MVT::ValueType VT, SDOperand Op1,
3147 // If an identical node already exists, use it.
3148 SDVTList VTs = getVTList(VT);
3149 SDOperand Ops[] = { Op1, Op2 };
3151 FoldingSetNodeID ID;
3152 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3154 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3157 RemoveNodeFromCSEMaps(N);
3159 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3161 CSEMap.InsertNode(N, IP); // Memoize the new node.
3165 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3166 MVT::ValueType VT, SDOperand Op1,
3167 SDOperand Op2, SDOperand Op3) {
3168 // If an identical node already exists, use it.
3169 SDVTList VTs = getVTList(VT);
3170 SDOperand Ops[] = { Op1, Op2, Op3 };
3171 FoldingSetNodeID ID;
3172 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3174 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3177 RemoveNodeFromCSEMaps(N);
3179 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3181 CSEMap.InsertNode(N, IP); // Memoize the new node.
3185 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3186 MVT::ValueType VT, const SDOperand *Ops,
3188 // If an identical node already exists, use it.
3189 SDVTList VTs = getVTList(VT);
3190 FoldingSetNodeID ID;
3191 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3193 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3196 RemoveNodeFromCSEMaps(N);
3197 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3199 CSEMap.InsertNode(N, IP); // Memoize the new node.
3203 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3204 MVT::ValueType VT1, MVT::ValueType VT2,
3205 SDOperand Op1, SDOperand Op2) {
3206 SDVTList VTs = getVTList(VT1, VT2);
3207 FoldingSetNodeID ID;
3208 SDOperand Ops[] = { Op1, Op2 };
3209 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3211 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3214 RemoveNodeFromCSEMaps(N);
3215 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3216 CSEMap.InsertNode(N, IP); // Memoize the new node.
3220 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3221 MVT::ValueType VT1, MVT::ValueType VT2,
3222 SDOperand Op1, SDOperand Op2,
3224 // If an identical node already exists, use it.
3225 SDVTList VTs = getVTList(VT1, VT2);
3226 SDOperand Ops[] = { Op1, Op2, Op3 };
3227 FoldingSetNodeID ID;
3228 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3230 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3233 RemoveNodeFromCSEMaps(N);
3235 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3236 CSEMap.InsertNode(N, IP); // Memoize the new node.
3241 /// getTargetNode - These are used for target selectors to create a new node
3242 /// with specified return type(s), target opcode, and operands.
3244 /// Note that getTargetNode returns the resultant node. If there is already a
3245 /// node of the specified opcode and operands, it returns that node instead of
3246 /// the current one.
3247 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
3248 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
3250 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3252 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
3254 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3255 SDOperand Op1, SDOperand Op2) {
3256 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
3258 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3259 SDOperand Op1, SDOperand Op2,
3261 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
3263 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3264 const SDOperand *Ops, unsigned NumOps) {
3265 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
3267 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3268 MVT::ValueType VT2) {
3269 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3271 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val;
3273 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3274 MVT::ValueType VT2, SDOperand Op1) {
3275 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3276 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
3278 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3279 MVT::ValueType VT2, SDOperand Op1,
3281 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3282 SDOperand Ops[] = { Op1, Op2 };
3283 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
3285 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3286 MVT::ValueType VT2, SDOperand Op1,
3287 SDOperand Op2, SDOperand Op3) {
3288 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3289 SDOperand Ops[] = { Op1, Op2, Op3 };
3290 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
3292 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3294 const SDOperand *Ops, unsigned NumOps) {
3295 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3296 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
3298 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3299 MVT::ValueType VT2, MVT::ValueType VT3,
3300 SDOperand Op1, SDOperand Op2) {
3301 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3302 SDOperand Ops[] = { Op1, Op2 };
3303 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
3305 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3306 MVT::ValueType VT2, MVT::ValueType VT3,
3307 SDOperand Op1, SDOperand Op2,
3309 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3310 SDOperand Ops[] = { Op1, Op2, Op3 };
3311 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3313 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3314 MVT::ValueType VT2, MVT::ValueType VT3,
3315 const SDOperand *Ops, unsigned NumOps) {
3316 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3317 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
3319 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3320 MVT::ValueType VT2, MVT::ValueType VT3,
3322 const SDOperand *Ops, unsigned NumOps) {
3323 std::vector<MVT::ValueType> VTList;
3324 VTList.push_back(VT1);
3325 VTList.push_back(VT2);
3326 VTList.push_back(VT3);
3327 VTList.push_back(VT4);
3328 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3329 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3331 SDNode *SelectionDAG::getTargetNode(unsigned Opcode,
3332 std::vector<MVT::ValueType> &ResultTys,
3333 const SDOperand *Ops, unsigned NumOps) {
3334 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys);
3335 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(),
3340 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3341 /// This can cause recursive merging of nodes in the DAG.
3343 /// This version assumes From has a single result value.
3345 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To,
3346 DAGUpdateListener *UpdateListener) {
3347 SDNode *From = FromN.Val;
3348 assert(From->getNumValues() == 1 && FromN.ResNo == 0 &&
3349 "Cannot replace with this method!");
3350 assert(From != To.Val && "Cannot replace uses of with self");
3352 while (!From->use_empty()) {
3353 // Process users until they are all gone.
3354 SDNode *U = *From->use_begin();
3356 // This node is about to morph, remove its old self from the CSE maps.
3357 RemoveNodeFromCSEMaps(U);
3359 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3361 if (I->Val == From) {
3362 From->removeUser(U);
3367 // Now that we have modified U, add it back to the CSE maps. If it already
3368 // exists there, recursively merge the results together.
3369 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3370 ReplaceAllUsesWith(U, Existing, UpdateListener);
3371 // U is now dead. Inform the listener if it exists and delete it.
3373 UpdateListener->NodeDeleted(U);
3374 DeleteNodeNotInCSEMaps(U);
3376 // If the node doesn't already exist, we updated it. Inform a listener if
3379 UpdateListener->NodeUpdated(U);
3384 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3385 /// This can cause recursive merging of nodes in the DAG.
3387 /// This version assumes From/To have matching types and numbers of result
3390 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
3391 DAGUpdateListener *UpdateListener) {
3392 assert(From != To && "Cannot replace uses of with self");
3393 assert(From->getNumValues() == To->getNumValues() &&
3394 "Cannot use this version of ReplaceAllUsesWith!");
3395 if (From->getNumValues() == 1) // If possible, use the faster version.
3396 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0),
3399 while (!From->use_empty()) {
3400 // Process users until they are all gone.
3401 SDNode *U = *From->use_begin();
3403 // This node is about to morph, remove its old self from the CSE maps.
3404 RemoveNodeFromCSEMaps(U);
3406 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3408 if (I->Val == From) {
3409 From->removeUser(U);
3414 // Now that we have modified U, add it back to the CSE maps. If it already
3415 // exists there, recursively merge the results together.
3416 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3417 ReplaceAllUsesWith(U, Existing, UpdateListener);
3418 // U is now dead. Inform the listener if it exists and delete it.
3420 UpdateListener->NodeDeleted(U);
3421 DeleteNodeNotInCSEMaps(U);
3423 // If the node doesn't already exist, we updated it. Inform a listener if
3426 UpdateListener->NodeUpdated(U);
3431 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3432 /// This can cause recursive merging of nodes in the DAG.
3434 /// This version can replace From with any result values. To must match the
3435 /// number and types of values returned by From.
3436 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
3437 const SDOperand *To,
3438 DAGUpdateListener *UpdateListener) {
3439 if (From->getNumValues() == 1) // Handle the simple case efficiently.
3440 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener);
3442 while (!From->use_empty()) {
3443 // Process users until they are all gone.
3444 SDNode *U = *From->use_begin();
3446 // This node is about to morph, remove its old self from the CSE maps.
3447 RemoveNodeFromCSEMaps(U);
3449 for (SDOperand *I = U->OperandList, *E = U->OperandList+U->NumOperands;
3451 if (I->Val == From) {
3452 const SDOperand &ToOp = To[I->ResNo];
3453 From->removeUser(U);
3455 ToOp.Val->addUser(U);
3458 // Now that we have modified U, add it back to the CSE maps. If it already
3459 // exists there, recursively merge the results together.
3460 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3461 ReplaceAllUsesWith(U, Existing, UpdateListener);
3462 // U is now dead. Inform the listener if it exists and delete it.
3464 UpdateListener->NodeDeleted(U);
3465 DeleteNodeNotInCSEMaps(U);
3467 // If the node doesn't already exist, we updated it. Inform a listener if
3470 UpdateListener->NodeUpdated(U);
3476 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes
3477 /// any deleted nodes from the set passed into its constructor and recursively
3478 /// notifies another update listener if specified.
3479 class ChainedSetUpdaterListener :
3480 public SelectionDAG::DAGUpdateListener {
3481 SmallSetVector<SDNode*, 16> &Set;
3482 SelectionDAG::DAGUpdateListener *Chain;
3484 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set,
3485 SelectionDAG::DAGUpdateListener *chain)
3486 : Set(set), Chain(chain) {}
3488 virtual void NodeDeleted(SDNode *N) {
3490 if (Chain) Chain->NodeDeleted(N);
3492 virtual void NodeUpdated(SDNode *N) {
3493 if (Chain) Chain->NodeUpdated(N);
3498 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3499 /// uses of other values produced by From.Val alone. The Deleted vector is
3500 /// handled the same way as for ReplaceAllUsesWith.
3501 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
3502 DAGUpdateListener *UpdateListener){
3503 assert(From != To && "Cannot replace a value with itself");
3505 // Handle the simple, trivial, case efficiently.
3506 if (From.Val->getNumValues() == 1) {
3507 ReplaceAllUsesWith(From, To, UpdateListener);
3511 if (From.use_empty()) return;
3513 // Get all of the users of From.Val. We want these in a nice,
3514 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3515 SmallSetVector<SDNode*, 16> Users(From.Val->use_begin(), From.Val->use_end());
3517 // When one of the recursive merges deletes nodes from the graph, we need to
3518 // make sure that UpdateListener is notified *and* that the node is removed
3519 // from Users if present. CSUL does this.
3520 ChainedSetUpdaterListener CSUL(Users, UpdateListener);
3522 while (!Users.empty()) {
3523 // We know that this user uses some value of From. If it is the right
3524 // value, update it.
3525 SDNode *User = Users.back();
3528 // Scan for an operand that matches From.
3529 SDOperand *Op = User->OperandList, *E = User->OperandList+User->NumOperands;
3530 for (; Op != E; ++Op)
3531 if (*Op == From) break;
3533 // If there are no matches, the user must use some other result of From.
3534 if (Op == E) continue;
3536 // Okay, we know this user needs to be updated. Remove its old self
3537 // from the CSE maps.
3538 RemoveNodeFromCSEMaps(User);
3540 // Update all operands that match "From" in case there are multiple uses.
3541 for (; Op != E; ++Op) {
3543 From.Val->removeUser(User);
3545 To.Val->addUser(User);
3549 // Now that we have modified User, add it back to the CSE maps. If it
3550 // already exists there, recursively merge the results together.
3551 SDNode *Existing = AddNonLeafNodeToCSEMaps(User);
3553 if (UpdateListener) UpdateListener->NodeUpdated(User);
3554 continue; // Continue on to next user.
3557 // If there was already an existing matching node, use ReplaceAllUsesWith
3558 // to replace the dead one with the existing one. This can cause
3559 // recursive merging of other unrelated nodes down the line. The merging
3560 // can cause deletion of nodes that used the old value. To handle this, we
3561 // use CSUL to remove them from the Users set.
3562 ReplaceAllUsesWith(User, Existing, &CSUL);
3564 // User is now dead. Notify a listener if present.
3565 if (UpdateListener) UpdateListener->NodeDeleted(User);
3566 DeleteNodeNotInCSEMaps(User);
3571 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3572 /// their allnodes order. It returns the maximum id.
3573 unsigned SelectionDAG::AssignNodeIds() {
3575 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3582 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
3583 /// based on their topological order. It returns the maximum id and a vector
3584 /// of the SDNodes* in assigned order by reference.
3585 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
3586 unsigned DAGSize = AllNodes.size();
3587 std::vector<unsigned> InDegree(DAGSize);
3588 std::vector<SDNode*> Sources;
3590 // Use a two pass approach to avoid using a std::map which is slow.
3592 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
3595 unsigned Degree = N->use_size();
3596 InDegree[N->getNodeId()] = Degree;
3598 Sources.push_back(N);
3602 while (!Sources.empty()) {
3603 SDNode *N = Sources.back();
3605 TopOrder.push_back(N);
3606 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
3608 unsigned Degree = --InDegree[P->getNodeId()];
3610 Sources.push_back(P);
3614 // Second pass, assign the actual topological order as node ids.
3616 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
3618 (*TI)->setNodeId(Id++);
3625 //===----------------------------------------------------------------------===//
3627 //===----------------------------------------------------------------------===//
3629 // Out-of-line virtual method to give class a home.
3630 void SDNode::ANCHOR() {}
3631 void UnarySDNode::ANCHOR() {}
3632 void BinarySDNode::ANCHOR() {}
3633 void TernarySDNode::ANCHOR() {}
3634 void HandleSDNode::ANCHOR() {}
3635 void StringSDNode::ANCHOR() {}
3636 void ConstantSDNode::ANCHOR() {}
3637 void ConstantFPSDNode::ANCHOR() {}
3638 void GlobalAddressSDNode::ANCHOR() {}
3639 void FrameIndexSDNode::ANCHOR() {}
3640 void JumpTableSDNode::ANCHOR() {}
3641 void ConstantPoolSDNode::ANCHOR() {}
3642 void BasicBlockSDNode::ANCHOR() {}
3643 void SrcValueSDNode::ANCHOR() {}
3644 void MemOperandSDNode::ANCHOR() {}
3645 void RegisterSDNode::ANCHOR() {}
3646 void ExternalSymbolSDNode::ANCHOR() {}
3647 void CondCodeSDNode::ANCHOR() {}
3648 void VTSDNode::ANCHOR() {}
3649 void LoadSDNode::ANCHOR() {}
3650 void StoreSDNode::ANCHOR() {}
3651 void AtomicSDNode::ANCHOR() {}
3653 HandleSDNode::~HandleSDNode() {
3654 SDVTList VTs = { 0, 0 };
3655 MorphNodeTo(ISD::HANDLENODE, VTs, 0, 0); // Drops operand uses.
3658 GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
3659 MVT::ValueType VT, int o)
3660 : SDNode(isa<GlobalVariable>(GA) &&
3661 cast<GlobalVariable>(GA)->isThreadLocal() ?
3663 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
3665 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
3666 getSDVTList(VT)), Offset(o) {
3667 TheGlobal = const_cast<GlobalValue*>(GA);
3670 /// getMemOperand - Return a MemOperand object describing the memory
3671 /// reference performed by this load or store.
3672 MemOperand LSBaseSDNode::getMemOperand() const {
3673 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3;
3675 getOpcode() == ISD::LOAD ? MemOperand::MOLoad : MemOperand::MOStore;
3676 if (IsVolatile) Flags |= MemOperand::MOVolatile;
3678 // Check if the load references a frame index, and does not have
3680 const FrameIndexSDNode *FI =
3681 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val);
3682 if (!getSrcValue() && FI)
3683 return MemOperand(PseudoSourceValue::getFixedStack(), Flags,
3684 FI->getIndex(), Size, Alignment);
3686 return MemOperand(getSrcValue(), Flags,
3687 getSrcValueOffset(), Size, Alignment);
3690 /// Profile - Gather unique data for the node.
3692 void SDNode::Profile(FoldingSetNodeID &ID) {
3693 AddNodeIDNode(ID, this);
3696 /// getValueTypeList - Return a pointer to the specified value type.
3698 const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
3699 if (MVT::isExtendedVT(VT)) {
3700 static std::set<MVT::ValueType> EVTs;
3701 return &(*EVTs.insert(VT).first);
3703 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
3709 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
3710 /// indicated value. This method ignores uses of other values defined by this
3712 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
3713 assert(Value < getNumValues() && "Bad value!");
3715 // If there is only one value, this is easy.
3716 if (getNumValues() == 1)
3717 return use_size() == NUses;
3718 if (use_size() < NUses) return false;
3720 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3722 SmallPtrSet<SDNode*, 32> UsersHandled;
3724 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3726 if (User->getNumOperands() == 1 ||
3727 UsersHandled.insert(User)) // First time we've seen this?
3728 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3729 if (User->getOperand(i) == TheValue) {
3731 return false; // too many uses
3736 // Found exactly the right number of uses?
3741 /// hasAnyUseOfValue - Return true if there are any use of the indicated
3742 /// value. This method ignores uses of other values defined by this operation.
3743 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
3744 assert(Value < getNumValues() && "Bad value!");
3746 if (use_empty()) return false;
3748 SDOperand TheValue(const_cast<SDNode *>(this), Value);
3750 SmallPtrSet<SDNode*, 32> UsersHandled;
3752 for (SDNode::use_iterator UI = Uses.begin(), E = Uses.end(); UI != E; ++UI) {
3754 if (User->getNumOperands() == 1 ||
3755 UsersHandled.insert(User)) // First time we've seen this?
3756 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
3757 if (User->getOperand(i) == TheValue) {
3766 /// isOnlyUse - Return true if this node is the only use of N.
3768 bool SDNode::isOnlyUse(SDNode *N) const {
3770 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
3781 /// isOperand - Return true if this node is an operand of N.
3783 bool SDOperand::isOperand(SDNode *N) const {
3784 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
3785 if (*this == N->getOperand(i))
3790 bool SDNode::isOperand(SDNode *N) const {
3791 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
3792 if (this == N->OperandList[i].Val)
3797 /// reachesChainWithoutSideEffects - Return true if this operand (which must
3798 /// be a chain) reaches the specified operand without crossing any
3799 /// side-effecting instructions. In practice, this looks through token
3800 /// factors and non-volatile loads. In order to remain efficient, this only
3801 /// looks a couple of nodes in, it does not do an exhaustive search.
3802 bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest,
3803 unsigned Depth) const {
3804 if (*this == Dest) return true;
3806 // Don't search too deeply, we just want to be able to see through
3807 // TokenFactor's etc.
3808 if (Depth == 0) return false;
3810 // If this is a token factor, all inputs to the TF happen in parallel. If any
3811 // of the operands of the TF reach dest, then we can do the xform.
3812 if (getOpcode() == ISD::TokenFactor) {
3813 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
3814 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1))
3819 // Loads don't have side effects, look through them.
3820 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) {
3821 if (!Ld->isVolatile())
3822 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1);
3828 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
3829 SmallPtrSet<SDNode *, 32> &Visited) {
3830 if (found || !Visited.insert(N))
3833 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
3834 SDNode *Op = N->getOperand(i).Val;
3839 findPredecessor(Op, P, found, Visited);
3843 /// isPredecessor - Return true if this node is a predecessor of N. This node
3844 /// is either an operand of N or it can be reached by recursively traversing
3845 /// up the operands.
3846 /// NOTE: this is an expensive method. Use it carefully.
3847 bool SDNode::isPredecessor(SDNode *N) const {
3848 SmallPtrSet<SDNode *, 32> Visited;
3850 findPredecessor(N, this, found, Visited);
3854 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
3855 assert(Num < NumOperands && "Invalid child # of SDNode!");
3856 return cast<ConstantSDNode>(OperandList[Num])->getValue();
3859 std::string SDNode::getOperationName(const SelectionDAG *G) const {
3860 switch (getOpcode()) {
3862 if (getOpcode() < ISD::BUILTIN_OP_END)
3863 return "<<Unknown DAG Node>>";
3866 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
3867 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
3868 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName();
3870 TargetLowering &TLI = G->getTargetLoweringInfo();
3872 TLI.getTargetNodeName(getOpcode());
3873 if (Name) return Name;
3876 return "<<Unknown Target Node>>";
3879 case ISD::MEMBARRIER: return "MemBarrier";
3880 case ISD::ATOMIC_LCS: return "AtomicLCS";
3881 case ISD::ATOMIC_LAS: return "AtomicLAS";
3882 case ISD::ATOMIC_SWAP: return "AtomicSWAP";
3883 case ISD::PCMARKER: return "PCMarker";
3884 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
3885 case ISD::SRCVALUE: return "SrcValue";
3886 case ISD::MEMOPERAND: return "MemOperand";
3887 case ISD::EntryToken: return "EntryToken";
3888 case ISD::TokenFactor: return "TokenFactor";
3889 case ISD::AssertSext: return "AssertSext";
3890 case ISD::AssertZext: return "AssertZext";
3892 case ISD::STRING: return "String";
3893 case ISD::BasicBlock: return "BasicBlock";
3894 case ISD::VALUETYPE: return "ValueType";
3895 case ISD::Register: return "Register";
3897 case ISD::Constant: return "Constant";
3898 case ISD::ConstantFP: return "ConstantFP";
3899 case ISD::GlobalAddress: return "GlobalAddress";
3900 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
3901 case ISD::FrameIndex: return "FrameIndex";
3902 case ISD::JumpTable: return "JumpTable";
3903 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
3904 case ISD::RETURNADDR: return "RETURNADDR";
3905 case ISD::FRAMEADDR: return "FRAMEADDR";
3906 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
3907 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
3908 case ISD::EHSELECTION: return "EHSELECTION";
3909 case ISD::EH_RETURN: return "EH_RETURN";
3910 case ISD::ConstantPool: return "ConstantPool";
3911 case ISD::ExternalSymbol: return "ExternalSymbol";
3912 case ISD::INTRINSIC_WO_CHAIN: {
3913 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
3914 return Intrinsic::getName((Intrinsic::ID)IID);
3916 case ISD::INTRINSIC_VOID:
3917 case ISD::INTRINSIC_W_CHAIN: {
3918 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
3919 return Intrinsic::getName((Intrinsic::ID)IID);
3922 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
3923 case ISD::TargetConstant: return "TargetConstant";
3924 case ISD::TargetConstantFP:return "TargetConstantFP";
3925 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
3926 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
3927 case ISD::TargetFrameIndex: return "TargetFrameIndex";
3928 case ISD::TargetJumpTable: return "TargetJumpTable";
3929 case ISD::TargetConstantPool: return "TargetConstantPool";
3930 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
3932 case ISD::CopyToReg: return "CopyToReg";
3933 case ISD::CopyFromReg: return "CopyFromReg";
3934 case ISD::UNDEF: return "undef";
3935 case ISD::MERGE_VALUES: return "merge_values";
3936 case ISD::INLINEASM: return "inlineasm";
3937 case ISD::LABEL: return "label";
3938 case ISD::DECLARE: return "declare";
3939 case ISD::HANDLENODE: return "handlenode";
3940 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
3941 case ISD::CALL: return "call";
3944 case ISD::FABS: return "fabs";
3945 case ISD::FNEG: return "fneg";
3946 case ISD::FSQRT: return "fsqrt";
3947 case ISD::FSIN: return "fsin";
3948 case ISD::FCOS: return "fcos";
3949 case ISD::FPOWI: return "fpowi";
3950 case ISD::FPOW: return "fpow";
3953 case ISD::ADD: return "add";
3954 case ISD::SUB: return "sub";
3955 case ISD::MUL: return "mul";
3956 case ISD::MULHU: return "mulhu";
3957 case ISD::MULHS: return "mulhs";
3958 case ISD::SDIV: return "sdiv";
3959 case ISD::UDIV: return "udiv";
3960 case ISD::SREM: return "srem";
3961 case ISD::UREM: return "urem";
3962 case ISD::SMUL_LOHI: return "smul_lohi";
3963 case ISD::UMUL_LOHI: return "umul_lohi";
3964 case ISD::SDIVREM: return "sdivrem";
3965 case ISD::UDIVREM: return "divrem";
3966 case ISD::AND: return "and";
3967 case ISD::OR: return "or";
3968 case ISD::XOR: return "xor";
3969 case ISD::SHL: return "shl";
3970 case ISD::SRA: return "sra";
3971 case ISD::SRL: return "srl";
3972 case ISD::ROTL: return "rotl";
3973 case ISD::ROTR: return "rotr";
3974 case ISD::FADD: return "fadd";
3975 case ISD::FSUB: return "fsub";
3976 case ISD::FMUL: return "fmul";
3977 case ISD::FDIV: return "fdiv";
3978 case ISD::FREM: return "frem";
3979 case ISD::FCOPYSIGN: return "fcopysign";
3980 case ISD::FGETSIGN: return "fgetsign";
3982 case ISD::SETCC: return "setcc";
3983 case ISD::SELECT: return "select";
3984 case ISD::SELECT_CC: return "select_cc";
3985 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
3986 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
3987 case ISD::CONCAT_VECTORS: return "concat_vectors";
3988 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
3989 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
3990 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
3991 case ISD::CARRY_FALSE: return "carry_false";
3992 case ISD::ADDC: return "addc";
3993 case ISD::ADDE: return "adde";
3994 case ISD::SUBC: return "subc";
3995 case ISD::SUBE: return "sube";
3996 case ISD::SHL_PARTS: return "shl_parts";
3997 case ISD::SRA_PARTS: return "sra_parts";
3998 case ISD::SRL_PARTS: return "srl_parts";
4000 case ISD::EXTRACT_SUBREG: return "extract_subreg";
4001 case ISD::INSERT_SUBREG: return "insert_subreg";
4003 // Conversion operators.
4004 case ISD::SIGN_EXTEND: return "sign_extend";
4005 case ISD::ZERO_EXTEND: return "zero_extend";
4006 case ISD::ANY_EXTEND: return "any_extend";
4007 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
4008 case ISD::TRUNCATE: return "truncate";
4009 case ISD::FP_ROUND: return "fp_round";
4010 case ISD::FLT_ROUNDS_: return "flt_rounds";
4011 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
4012 case ISD::FP_EXTEND: return "fp_extend";
4014 case ISD::SINT_TO_FP: return "sint_to_fp";
4015 case ISD::UINT_TO_FP: return "uint_to_fp";
4016 case ISD::FP_TO_SINT: return "fp_to_sint";
4017 case ISD::FP_TO_UINT: return "fp_to_uint";
4018 case ISD::BIT_CONVERT: return "bit_convert";
4020 // Control flow instructions
4021 case ISD::BR: return "br";
4022 case ISD::BRIND: return "brind";
4023 case ISD::BR_JT: return "br_jt";
4024 case ISD::BRCOND: return "brcond";
4025 case ISD::BR_CC: return "br_cc";
4026 case ISD::RET: return "ret";
4027 case ISD::CALLSEQ_START: return "callseq_start";
4028 case ISD::CALLSEQ_END: return "callseq_end";
4031 case ISD::LOAD: return "load";
4032 case ISD::STORE: return "store";
4033 case ISD::VAARG: return "vaarg";
4034 case ISD::VACOPY: return "vacopy";
4035 case ISD::VAEND: return "vaend";
4036 case ISD::VASTART: return "vastart";
4037 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
4038 case ISD::EXTRACT_ELEMENT: return "extract_element";
4039 case ISD::BUILD_PAIR: return "build_pair";
4040 case ISD::STACKSAVE: return "stacksave";
4041 case ISD::STACKRESTORE: return "stackrestore";
4042 case ISD::TRAP: return "trap";
4044 // Block memory operations.
4045 case ISD::MEMSET: return "memset";
4046 case ISD::MEMCPY: return "memcpy";
4047 case ISD::MEMMOVE: return "memmove";
4050 case ISD::BSWAP: return "bswap";
4051 case ISD::CTPOP: return "ctpop";
4052 case ISD::CTTZ: return "cttz";
4053 case ISD::CTLZ: return "ctlz";
4056 case ISD::LOCATION: return "location";
4057 case ISD::DEBUG_LOC: return "debug_loc";
4060 case ISD::TRAMPOLINE: return "trampoline";
4063 switch (cast<CondCodeSDNode>(this)->get()) {
4064 default: assert(0 && "Unknown setcc condition!");
4065 case ISD::SETOEQ: return "setoeq";
4066 case ISD::SETOGT: return "setogt";
4067 case ISD::SETOGE: return "setoge";
4068 case ISD::SETOLT: return "setolt";
4069 case ISD::SETOLE: return "setole";
4070 case ISD::SETONE: return "setone";
4072 case ISD::SETO: return "seto";
4073 case ISD::SETUO: return "setuo";
4074 case ISD::SETUEQ: return "setue";
4075 case ISD::SETUGT: return "setugt";
4076 case ISD::SETUGE: return "setuge";
4077 case ISD::SETULT: return "setult";
4078 case ISD::SETULE: return "setule";
4079 case ISD::SETUNE: return "setune";
4081 case ISD::SETEQ: return "seteq";
4082 case ISD::SETGT: return "setgt";
4083 case ISD::SETGE: return "setge";
4084 case ISD::SETLT: return "setlt";
4085 case ISD::SETLE: return "setle";
4086 case ISD::SETNE: return "setne";
4091 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
4100 return "<post-inc>";
4102 return "<post-dec>";
4106 void SDNode::dump() const { dump(0); }
4107 void SDNode::dump(const SelectionDAG *G) const {
4108 cerr << (void*)this << ": ";
4110 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
4112 if (getValueType(i) == MVT::Other)
4115 cerr << MVT::getValueTypeString(getValueType(i));
4117 cerr << " = " << getOperationName(G);
4120 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
4121 if (i) cerr << ", ";
4122 cerr << (void*)getOperand(i).Val;
4123 if (unsigned RN = getOperand(i).ResNo)
4127 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) {
4128 SDNode *Mask = getOperand(2).Val;
4130 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) {
4132 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF)
4135 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue();
4140 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
4141 cerr << "<" << CSDN->getValue() << ">";
4142 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
4143 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
4144 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
4145 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
4146 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
4148 cerr << "<APFloat(";
4149 CSDN->getValueAPF().convertToAPInt().dump();
4152 } else if (const GlobalAddressSDNode *GADN =
4153 dyn_cast<GlobalAddressSDNode>(this)) {
4154 int offset = GADN->getOffset();
4156 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
4158 cerr << " + " << offset;
4160 cerr << " " << offset;
4161 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
4162 cerr << "<" << FIDN->getIndex() << ">";
4163 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
4164 cerr << "<" << JTDN->getIndex() << ">";
4165 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
4166 int offset = CP->getOffset();
4167 if (CP->isMachineConstantPoolEntry())
4168 cerr << "<" << *CP->getMachineCPVal() << ">";
4170 cerr << "<" << *CP->getConstVal() << ">";
4172 cerr << " + " << offset;
4174 cerr << " " << offset;
4175 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
4177 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
4179 cerr << LBB->getName() << " ";
4180 cerr << (const void*)BBDN->getBasicBlock() << ">";
4181 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
4182 if (G && R->getReg() &&
4183 TargetRegisterInfo::isPhysicalRegister(R->getReg())) {
4185 << G->getTarget().getRegisterInfo()->getPrintableName(R->getReg());
4187 cerr << " #" << R->getReg();
4189 } else if (const ExternalSymbolSDNode *ES =
4190 dyn_cast<ExternalSymbolSDNode>(this)) {
4191 cerr << "'" << ES->getSymbol() << "'";
4192 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
4194 cerr << "<" << M->getValue() << ">";
4197 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) {
4198 if (M->MO.getValue())
4199 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">";
4201 cerr << "<null:" << M->MO.getOffset() << ">";
4202 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
4203 cerr << ":" << MVT::getValueTypeString(N->getVT());
4204 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
4205 const Value *SrcValue = LD->getSrcValue();
4206 int SrcOffset = LD->getSrcValueOffset();
4212 cerr << ":" << SrcOffset << ">";
4215 switch (LD->getExtensionType()) {
4216 default: doExt = false; break;
4218 cerr << " <anyext ";
4228 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">";
4230 const char *AM = getIndexedModeName(LD->getAddressingMode());
4233 if (LD->isVolatile())
4234 cerr << " <volatile>";
4235 cerr << " alignment=" << LD->getAlignment();
4236 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
4237 const Value *SrcValue = ST->getSrcValue();
4238 int SrcOffset = ST->getSrcValueOffset();
4244 cerr << ":" << SrcOffset << ">";
4246 if (ST->isTruncatingStore())
4248 << MVT::getValueTypeString(ST->getMemoryVT()) << ">";
4250 const char *AM = getIndexedModeName(ST->getAddressingMode());
4253 if (ST->isVolatile())
4254 cerr << " <volatile>";
4255 cerr << " alignment=" << ST->getAlignment();
4259 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
4260 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4261 if (N->getOperand(i).Val->hasOneUse())
4262 DumpNodes(N->getOperand(i).Val, indent+2, G);
4264 cerr << "\n" << std::string(indent+2, ' ')
4265 << (void*)N->getOperand(i).Val << ": <multiple use>";
4268 cerr << "\n" << std::string(indent, ' ');
4272 void SelectionDAG::dump() const {
4273 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
4274 std::vector<const SDNode*> Nodes;
4275 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
4279 std::sort(Nodes.begin(), Nodes.end());
4281 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
4282 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
4283 DumpNodes(Nodes[i], 2, this);
4286 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
4291 const Type *ConstantPoolSDNode::getType() const {
4292 if (isMachineConstantPoolEntry())
4293 return Val.MachineCPVal->getType();
4294 return Val.ConstVal->getType();