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 //===----------------------------------------------------------------------===//
13 #include "llvm/CodeGen/SelectionDAG.h"
14 #include "llvm/Constants.h"
15 #include "llvm/GlobalAlias.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/CallingConv.h"
21 #include "llvm/CodeGen/MachineBasicBlock.h"
22 #include "llvm/CodeGen/MachineConstantPool.h"
23 #include "llvm/CodeGen/MachineFrameInfo.h"
24 #include "llvm/CodeGen/MachineModuleInfo.h"
25 #include "llvm/CodeGen/PseudoSourceValue.h"
26 #include "llvm/Support/MathExtras.h"
27 #include "llvm/Target/TargetRegisterInfo.h"
28 #include "llvm/Target/TargetData.h"
29 #include "llvm/Target/TargetLowering.h"
30 #include "llvm/Target/TargetInstrInfo.h"
31 #include "llvm/Target/TargetMachine.h"
32 #include "llvm/ADT/SetVector.h"
33 #include "llvm/ADT/SmallPtrSet.h"
34 #include "llvm/ADT/SmallSet.h"
35 #include "llvm/ADT/SmallVector.h"
36 #include "llvm/ADT/StringExtras.h"
41 /// makeVTList - Return an instance of the SDVTList struct initialized with the
42 /// specified members.
43 static SDVTList makeVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
44 SDVTList Res = {VTs, NumVTs};
48 static const fltSemantics *MVTToAPFloatSemantics(MVT::ValueType VT) {
50 default: assert(0 && "Unknown FP format");
51 case MVT::f32: return &APFloat::IEEEsingle;
52 case MVT::f64: return &APFloat::IEEEdouble;
53 case MVT::f80: return &APFloat::x87DoubleExtended;
54 case MVT::f128: return &APFloat::IEEEquad;
55 case MVT::ppcf128: return &APFloat::PPCDoubleDouble;
59 SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {}
61 //===----------------------------------------------------------------------===//
62 // ConstantFPSDNode Class
63 //===----------------------------------------------------------------------===//
65 /// isExactlyValue - We don't rely on operator== working on double values, as
66 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
67 /// As such, this method can be used to do an exact bit-for-bit comparison of
68 /// two floating point values.
69 bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const {
70 return Value.bitwiseIsEqual(V);
73 bool ConstantFPSDNode::isValueValidForType(MVT::ValueType VT,
75 assert(MVT::isFloatingPoint(VT) && "Can only convert between FP types");
77 // PPC long double cannot be converted to any other type.
78 if (VT == MVT::ppcf128 ||
79 &Val.getSemantics() == &APFloat::PPCDoubleDouble)
82 // convert modifies in place, so make a copy.
83 APFloat Val2 = APFloat(Val);
84 return Val2.convert(*MVTToAPFloatSemantics(VT),
85 APFloat::rmNearestTiesToEven) == APFloat::opOK;
88 //===----------------------------------------------------------------------===//
90 //===----------------------------------------------------------------------===//
92 /// isBuildVectorAllOnes - Return true if the specified node is a
93 /// BUILD_VECTOR where all of the elements are ~0 or undef.
94 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
95 // Look through a bit convert.
96 if (N->getOpcode() == ISD::BIT_CONVERT)
97 N = N->getOperand(0).Val;
99 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
101 unsigned i = 0, e = N->getNumOperands();
103 // Skip over all of the undef values.
104 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
107 // Do not accept an all-undef vector.
108 if (i == e) return false;
110 // Do not accept build_vectors that aren't all constants or which have non-~0
112 SDOperand NotZero = N->getOperand(i);
113 if (isa<ConstantSDNode>(NotZero)) {
114 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
116 } else if (isa<ConstantFPSDNode>(NotZero)) {
117 if (!cast<ConstantFPSDNode>(NotZero)->getValueAPF().
118 convertToAPInt().isAllOnesValue())
123 // Okay, we have at least one ~0 value, check to see if the rest match or are
125 for (++i; i != e; ++i)
126 if (N->getOperand(i) != NotZero &&
127 N->getOperand(i).getOpcode() != ISD::UNDEF)
133 /// isBuildVectorAllZeros - Return true if the specified node is a
134 /// BUILD_VECTOR where all of the elements are 0 or undef.
135 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
136 // Look through a bit convert.
137 if (N->getOpcode() == ISD::BIT_CONVERT)
138 N = N->getOperand(0).Val;
140 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
142 unsigned i = 0, e = N->getNumOperands();
144 // Skip over all of the undef values.
145 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
148 // Do not accept an all-undef vector.
149 if (i == e) return false;
151 // Do not accept build_vectors that aren't all constants or which have non-~0
153 SDOperand Zero = N->getOperand(i);
154 if (isa<ConstantSDNode>(Zero)) {
155 if (!cast<ConstantSDNode>(Zero)->isNullValue())
157 } else if (isa<ConstantFPSDNode>(Zero)) {
158 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
163 // Okay, we have at least one ~0 value, check to see if the rest match or are
165 for (++i; i != e; ++i)
166 if (N->getOperand(i) != Zero &&
167 N->getOperand(i).getOpcode() != ISD::UNDEF)
172 /// isScalarToVector - Return true if the specified node is a
173 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
174 /// element is not an undef.
175 bool ISD::isScalarToVector(const SDNode *N) {
176 if (N->getOpcode() == ISD::SCALAR_TO_VECTOR)
179 if (N->getOpcode() != ISD::BUILD_VECTOR)
181 if (N->getOperand(0).getOpcode() == ISD::UNDEF)
183 unsigned NumElems = N->getNumOperands();
184 for (unsigned i = 1; i < NumElems; ++i) {
185 SDOperand V = N->getOperand(i);
186 if (V.getOpcode() != ISD::UNDEF)
193 /// isDebugLabel - Return true if the specified node represents a debug
194 /// label (i.e. ISD::LABEL or TargetInstrInfo::LABEL node and third operand
196 bool ISD::isDebugLabel(const SDNode *N) {
198 if (N->getOpcode() == ISD::LABEL)
199 Zero = N->getOperand(2);
200 else if (N->isTargetOpcode() &&
201 N->getTargetOpcode() == TargetInstrInfo::LABEL)
202 // Chain moved to last operand.
203 Zero = N->getOperand(1);
206 return isa<ConstantSDNode>(Zero) && cast<ConstantSDNode>(Zero)->isNullValue();
209 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
210 /// when given the operation for (X op Y).
211 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
212 // To perform this operation, we just need to swap the L and G bits of the
214 unsigned OldL = (Operation >> 2) & 1;
215 unsigned OldG = (Operation >> 1) & 1;
216 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
217 (OldL << 1) | // New G bit
218 (OldG << 2)); // New L bit.
221 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
222 /// 'op' is a valid SetCC operation.
223 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
224 unsigned Operation = Op;
226 Operation ^= 7; // Flip L, G, E bits, but not U.
228 Operation ^= 15; // Flip all of the condition bits.
229 if (Operation > ISD::SETTRUE2)
230 Operation &= ~8; // Don't let N and U bits get set.
231 return ISD::CondCode(Operation);
235 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
236 /// signed operation and 2 if the result is an unsigned comparison. Return zero
237 /// if the operation does not depend on the sign of the input (setne and seteq).
238 static int isSignedOp(ISD::CondCode Opcode) {
240 default: assert(0 && "Illegal integer setcc operation!");
242 case ISD::SETNE: return 0;
246 case ISD::SETGE: return 1;
250 case ISD::SETUGE: return 2;
254 /// getSetCCOrOperation - Return the result of a logical OR between different
255 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
256 /// returns SETCC_INVALID if it is not possible to represent the resultant
258 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
260 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
261 // Cannot fold a signed integer setcc with an unsigned integer setcc.
262 return ISD::SETCC_INVALID;
264 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
266 // If the N and U bits get set then the resultant comparison DOES suddenly
267 // care about orderedness, and is true when ordered.
268 if (Op > ISD::SETTRUE2)
269 Op &= ~16; // Clear the U bit if the N bit is set.
271 // Canonicalize illegal integer setcc's.
272 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
275 return ISD::CondCode(Op);
278 /// getSetCCAndOperation - Return the result of a logical AND between different
279 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
280 /// function returns zero if it is not possible to represent the resultant
282 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
284 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
285 // Cannot fold a signed setcc with an unsigned setcc.
286 return ISD::SETCC_INVALID;
288 // Combine all of the condition bits.
289 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
291 // Canonicalize illegal integer setcc's.
295 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
296 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
297 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
298 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
305 const TargetMachine &SelectionDAG::getTarget() const {
306 return TLI.getTargetMachine();
309 //===----------------------------------------------------------------------===//
310 // SDNode Profile Support
311 //===----------------------------------------------------------------------===//
313 /// AddNodeIDOpcode - Add the node opcode to the NodeID data.
315 static void AddNodeIDOpcode(FoldingSetNodeID &ID, unsigned OpC) {
319 /// AddNodeIDValueTypes - Value type lists are intern'd so we can represent them
320 /// solely with their pointer.
321 static void AddNodeIDValueTypes(FoldingSetNodeID &ID, SDVTList VTList) {
322 ID.AddPointer(VTList.VTs);
325 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
327 static void AddNodeIDOperands(FoldingSetNodeID &ID,
328 SDOperandPtr Ops, unsigned NumOps) {
329 for (; NumOps; --NumOps, ++Ops) {
330 ID.AddPointer(Ops->Val);
331 ID.AddInteger(Ops->ResNo);
335 static void AddNodeIDNode(FoldingSetNodeID &ID,
336 unsigned short OpC, SDVTList VTList,
337 SDOperandPtr OpList, unsigned N) {
338 AddNodeIDOpcode(ID, OpC);
339 AddNodeIDValueTypes(ID, VTList);
340 AddNodeIDOperands(ID, OpList, N);
344 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
346 static void AddNodeIDNode(FoldingSetNodeID &ID, SDNode *N) {
347 AddNodeIDOpcode(ID, N->getOpcode());
348 // Add the return value info.
349 AddNodeIDValueTypes(ID, N->getVTList());
350 // Add the operand info.
351 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
353 // Handle SDNode leafs with special info.
354 switch (N->getOpcode()) {
355 default: break; // Normal nodes don't need extra info.
357 ID.AddInteger(cast<ARG_FLAGSSDNode>(N)->getArgFlags().getRawBits());
359 case ISD::TargetConstant:
361 ID.Add(cast<ConstantSDNode>(N)->getAPIntValue());
363 case ISD::TargetConstantFP:
364 case ISD::ConstantFP: {
365 ID.Add(cast<ConstantFPSDNode>(N)->getValueAPF());
368 case ISD::TargetGlobalAddress:
369 case ISD::GlobalAddress:
370 case ISD::TargetGlobalTLSAddress:
371 case ISD::GlobalTLSAddress: {
372 GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
373 ID.AddPointer(GA->getGlobal());
374 ID.AddInteger(GA->getOffset());
377 case ISD::BasicBlock:
378 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
381 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
384 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue());
386 case ISD::MEMOPERAND: {
387 const MachineMemOperand &MO = cast<MemOperandSDNode>(N)->MO;
388 ID.AddPointer(MO.getValue());
389 ID.AddInteger(MO.getFlags());
390 ID.AddInteger(MO.getOffset());
391 ID.AddInteger(MO.getSize());
392 ID.AddInteger(MO.getAlignment());
395 case ISD::FrameIndex:
396 case ISD::TargetFrameIndex:
397 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
400 case ISD::TargetJumpTable:
401 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
403 case ISD::ConstantPool:
404 case ISD::TargetConstantPool: {
405 ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
406 ID.AddInteger(CP->getAlignment());
407 ID.AddInteger(CP->getOffset());
408 if (CP->isMachineConstantPoolEntry())
409 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
411 ID.AddPointer(CP->getConstVal());
415 LoadSDNode *LD = cast<LoadSDNode>(N);
416 ID.AddInteger(LD->getAddressingMode());
417 ID.AddInteger(LD->getExtensionType());
418 ID.AddInteger((unsigned int)(LD->getMemoryVT()));
419 ID.AddInteger(LD->getAlignment());
420 ID.AddInteger(LD->isVolatile());
424 StoreSDNode *ST = cast<StoreSDNode>(N);
425 ID.AddInteger(ST->getAddressingMode());
426 ID.AddInteger(ST->isTruncatingStore());
427 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
428 ID.AddInteger(ST->getAlignment());
429 ID.AddInteger(ST->isVolatile());
435 //===----------------------------------------------------------------------===//
436 // SelectionDAG Class
437 //===----------------------------------------------------------------------===//
439 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
441 void SelectionDAG::RemoveDeadNodes() {
442 // Create a dummy node (which is not added to allnodes), that adds a reference
443 // to the root node, preventing it from being deleted.
444 HandleSDNode Dummy(getRoot());
446 SmallVector<SDNode*, 128> DeadNodes;
448 // Add all obviously-dead nodes to the DeadNodes worklist.
449 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
451 DeadNodes.push_back(I);
453 // Process the worklist, deleting the nodes and adding their uses to the
455 while (!DeadNodes.empty()) {
456 SDNode *N = DeadNodes.back();
457 DeadNodes.pop_back();
459 // Take the node out of the appropriate CSE map.
460 RemoveNodeFromCSEMaps(N);
462 // Next, brutally remove the operand list. This is safe to do, as there are
463 // no cycles in the graph.
464 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
465 SDNode *Operand = I->getVal();
466 Operand->removeUser(std::distance(N->op_begin(), I), N);
468 // Now that we removed this operand, see if there are no uses of it left.
469 if (Operand->use_empty())
470 DeadNodes.push_back(Operand);
472 if (N->OperandsNeedDelete) {
473 delete[] N->OperandList;
478 // Finally, remove N itself.
482 // If the root changed (e.g. it was a dead load, update the root).
483 setRoot(Dummy.getValue());
486 void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
487 SmallVector<SDNode*, 16> DeadNodes;
488 DeadNodes.push_back(N);
490 // Process the worklist, deleting the nodes and adding their uses to the
492 while (!DeadNodes.empty()) {
493 SDNode *N = DeadNodes.back();
494 DeadNodes.pop_back();
497 UpdateListener->NodeDeleted(N);
499 // Take the node out of the appropriate CSE map.
500 RemoveNodeFromCSEMaps(N);
502 // Next, brutally remove the operand list. This is safe to do, as there are
503 // no cycles in the graph.
504 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
505 SDNode *Operand = I->getVal();
506 Operand->removeUser(std::distance(N->op_begin(), I), N);
508 // Now that we removed this operand, see if there are no uses of it left.
509 if (Operand->use_empty())
510 DeadNodes.push_back(Operand);
512 if (N->OperandsNeedDelete) {
513 delete[] N->OperandList;
518 // Finally, remove N itself.
523 void SelectionDAG::DeleteNode(SDNode *N) {
524 assert(N->use_empty() && "Cannot delete a node that is not dead!");
526 // First take this out of the appropriate CSE map.
527 RemoveNodeFromCSEMaps(N);
529 // Finally, remove uses due to operands of this node, remove from the
530 // AllNodes list, and delete the node.
531 DeleteNodeNotInCSEMaps(N);
534 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
536 // Remove it from the AllNodes list.
539 // Drop all of the operands and decrement used nodes use counts.
540 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
541 I->getVal()->removeUser(std::distance(N->op_begin(), I), N);
542 if (N->OperandsNeedDelete) {
543 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 SDOperandPtr 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;
710 AllNodes.pop_front();
714 SDOperand SelectionDAG::getZeroExtendInReg(SDOperand Op, MVT::ValueType VT) {
715 if (Op.getValueType() == VT) return Op;
716 APInt Imm = APInt::getLowBitsSet(Op.getValueSizeInBits(),
717 MVT::getSizeInBits(VT));
718 return getNode(ISD::AND, Op.getValueType(), Op,
719 getConstant(Imm, Op.getValueType()));
722 SDOperand SelectionDAG::getString(const std::string &Val) {
723 StringSDNode *&N = StringNodes[Val];
725 N = new StringSDNode(Val);
726 AllNodes.push_back(N);
728 return SDOperand(N, 0);
731 SDOperand SelectionDAG::getConstant(uint64_t Val, MVT::ValueType VT, bool isT) {
732 MVT::ValueType EltVT =
733 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
735 return getConstant(APInt(MVT::getSizeInBits(EltVT), Val), VT, isT);
738 SDOperand SelectionDAG::getConstant(const APInt &Val, MVT::ValueType VT, bool isT) {
739 assert(MVT::isInteger(VT) && "Cannot create FP integer constant!");
741 MVT::ValueType EltVT =
742 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
744 assert(Val.getBitWidth() == MVT::getSizeInBits(EltVT) &&
745 "APInt size does not match type size!");
747 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
749 AddNodeIDNode(ID, Opc, getVTList(EltVT), (SDOperand*)0, 0);
753 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
754 if (!MVT::isVector(VT))
755 return SDOperand(N, 0);
757 N = new ConstantSDNode(isT, Val, EltVT);
758 CSEMap.InsertNode(N, IP);
759 AllNodes.push_back(N);
762 SDOperand Result(N, 0);
763 if (MVT::isVector(VT)) {
764 SmallVector<SDOperand, 8> Ops;
765 Ops.assign(MVT::getVectorNumElements(VT), Result);
766 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
771 SDOperand SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) {
772 return getConstant(Val, TLI.getPointerTy(), isTarget);
776 SDOperand SelectionDAG::getConstantFP(const APFloat& V, MVT::ValueType VT,
778 assert(MVT::isFloatingPoint(VT) && "Cannot create integer FP constant!");
780 MVT::ValueType EltVT =
781 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
783 // Do the map lookup using the actual bit pattern for the floating point
784 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
785 // we don't have issues with SNANs.
786 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
788 AddNodeIDNode(ID, Opc, getVTList(EltVT), (SDOperand*)0, 0);
792 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
793 if (!MVT::isVector(VT))
794 return SDOperand(N, 0);
796 N = new ConstantFPSDNode(isTarget, V, EltVT);
797 CSEMap.InsertNode(N, IP);
798 AllNodes.push_back(N);
801 SDOperand Result(N, 0);
802 if (MVT::isVector(VT)) {
803 SmallVector<SDOperand, 8> Ops;
804 Ops.assign(MVT::getVectorNumElements(VT), Result);
805 Result = getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
810 SDOperand SelectionDAG::getConstantFP(double Val, MVT::ValueType VT,
812 MVT::ValueType EltVT =
813 MVT::isVector(VT) ? MVT::getVectorElementType(VT) : VT;
815 return getConstantFP(APFloat((float)Val), VT, isTarget);
817 return getConstantFP(APFloat(Val), VT, isTarget);
820 SDOperand SelectionDAG::getGlobalAddress(const GlobalValue *GV,
821 MVT::ValueType VT, int Offset,
825 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
827 // If GV is an alias then use the aliasee for determining thread-localness.
828 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(GV))
829 GVar = dyn_cast_or_null<GlobalVariable>(GA->resolveAliasedGlobal());
832 if (GVar && GVar->isThreadLocal())
833 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
835 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
838 AddNodeIDNode(ID, Opc, getVTList(VT), (SDOperand*)0, 0);
840 ID.AddInteger(Offset);
842 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
843 return SDOperand(E, 0);
844 SDNode *N = new GlobalAddressSDNode(isTargetGA, GV, VT, Offset);
845 CSEMap.InsertNode(N, IP);
846 AllNodes.push_back(N);
847 return SDOperand(N, 0);
850 SDOperand SelectionDAG::getFrameIndex(int FI, MVT::ValueType VT,
852 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
854 AddNodeIDNode(ID, Opc, getVTList(VT), (SDOperand*)0, 0);
857 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
858 return SDOperand(E, 0);
859 SDNode *N = new FrameIndexSDNode(FI, VT, isTarget);
860 CSEMap.InsertNode(N, IP);
861 AllNodes.push_back(N);
862 return SDOperand(N, 0);
865 SDOperand SelectionDAG::getJumpTable(int JTI, MVT::ValueType VT, bool isTarget){
866 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
868 AddNodeIDNode(ID, Opc, getVTList(VT), (SDOperand*)0, 0);
871 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
872 return SDOperand(E, 0);
873 SDNode *N = new JumpTableSDNode(JTI, VT, isTarget);
874 CSEMap.InsertNode(N, IP);
875 AllNodes.push_back(N);
876 return SDOperand(N, 0);
879 SDOperand SelectionDAG::getConstantPool(Constant *C, MVT::ValueType VT,
880 unsigned Alignment, int Offset,
882 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
884 AddNodeIDNode(ID, Opc, getVTList(VT), (SDOperand*)0, 0);
885 ID.AddInteger(Alignment);
886 ID.AddInteger(Offset);
889 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
890 return SDOperand(E, 0);
891 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
892 CSEMap.InsertNode(N, IP);
893 AllNodes.push_back(N);
894 return SDOperand(N, 0);
898 SDOperand SelectionDAG::getConstantPool(MachineConstantPoolValue *C,
900 unsigned Alignment, int Offset,
902 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
904 AddNodeIDNode(ID, Opc, getVTList(VT), (SDOperand*)0, 0);
905 ID.AddInteger(Alignment);
906 ID.AddInteger(Offset);
907 C->AddSelectionDAGCSEId(ID);
909 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
910 return SDOperand(E, 0);
911 SDNode *N = new ConstantPoolSDNode(isTarget, C, VT, Offset, Alignment);
912 CSEMap.InsertNode(N, IP);
913 AllNodes.push_back(N);
914 return SDOperand(N, 0);
918 SDOperand SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
920 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), (SDOperand*)0, 0);
923 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
924 return SDOperand(E, 0);
925 SDNode *N = new BasicBlockSDNode(MBB);
926 CSEMap.InsertNode(N, IP);
927 AllNodes.push_back(N);
928 return SDOperand(N, 0);
931 SDOperand SelectionDAG::getArgFlags(ISD::ArgFlagsTy Flags) {
933 AddNodeIDNode(ID, ISD::ARG_FLAGS, getVTList(MVT::Other), (SDOperand*)0, 0);
934 ID.AddInteger(Flags.getRawBits());
936 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
937 return SDOperand(E, 0);
938 SDNode *N = new ARG_FLAGSSDNode(Flags);
939 CSEMap.InsertNode(N, IP);
940 AllNodes.push_back(N);
941 return SDOperand(N, 0);
944 SDOperand SelectionDAG::getValueType(MVT::ValueType VT) {
945 if (!MVT::isExtendedVT(VT) && (unsigned)VT >= ValueTypeNodes.size())
946 ValueTypeNodes.resize(VT+1);
948 SDNode *&N = MVT::isExtendedVT(VT) ?
949 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT];
951 if (N) return SDOperand(N, 0);
952 N = new VTSDNode(VT);
953 AllNodes.push_back(N);
954 return SDOperand(N, 0);
957 SDOperand SelectionDAG::getExternalSymbol(const char *Sym, MVT::ValueType VT) {
958 SDNode *&N = ExternalSymbols[Sym];
959 if (N) return SDOperand(N, 0);
960 N = new ExternalSymbolSDNode(false, Sym, VT);
961 AllNodes.push_back(N);
962 return SDOperand(N, 0);
965 SDOperand SelectionDAG::getTargetExternalSymbol(const char *Sym,
967 SDNode *&N = TargetExternalSymbols[Sym];
968 if (N) return SDOperand(N, 0);
969 N = new ExternalSymbolSDNode(true, Sym, VT);
970 AllNodes.push_back(N);
971 return SDOperand(N, 0);
974 SDOperand SelectionDAG::getCondCode(ISD::CondCode Cond) {
975 if ((unsigned)Cond >= CondCodeNodes.size())
976 CondCodeNodes.resize(Cond+1);
978 if (CondCodeNodes[Cond] == 0) {
979 CondCodeNodes[Cond] = new CondCodeSDNode(Cond);
980 AllNodes.push_back(CondCodeNodes[Cond]);
982 return SDOperand(CondCodeNodes[Cond], 0);
985 SDOperand SelectionDAG::getRegister(unsigned RegNo, MVT::ValueType VT) {
987 AddNodeIDNode(ID, ISD::Register, getVTList(VT), (SDOperand*)0, 0);
988 ID.AddInteger(RegNo);
990 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
991 return SDOperand(E, 0);
992 SDNode *N = new RegisterSDNode(RegNo, VT);
993 CSEMap.InsertNode(N, IP);
994 AllNodes.push_back(N);
995 return SDOperand(N, 0);
998 SDOperand SelectionDAG::getSrcValue(const Value *V) {
999 assert((!V || isa<PointerType>(V->getType())) &&
1000 "SrcValue is not a pointer?");
1002 FoldingSetNodeID ID;
1003 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), (SDOperand*)0, 0);
1007 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1008 return SDOperand(E, 0);
1010 SDNode *N = new SrcValueSDNode(V);
1011 CSEMap.InsertNode(N, IP);
1012 AllNodes.push_back(N);
1013 return SDOperand(N, 0);
1016 SDOperand SelectionDAG::getMemOperand(const MachineMemOperand &MO) {
1017 const Value *v = MO.getValue();
1018 assert((!v || isa<PointerType>(v->getType())) &&
1019 "SrcValue is not a pointer?");
1021 FoldingSetNodeID ID;
1022 AddNodeIDNode(ID, ISD::MEMOPERAND, getVTList(MVT::Other), (SDOperand*)0, 0);
1024 ID.AddInteger(MO.getFlags());
1025 ID.AddInteger(MO.getOffset());
1026 ID.AddInteger(MO.getSize());
1027 ID.AddInteger(MO.getAlignment());
1030 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1031 return SDOperand(E, 0);
1033 SDNode *N = new MemOperandSDNode(MO);
1034 CSEMap.InsertNode(N, IP);
1035 AllNodes.push_back(N);
1036 return SDOperand(N, 0);
1039 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
1040 /// specified value type.
1041 SDOperand SelectionDAG::CreateStackTemporary(MVT::ValueType VT) {
1042 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
1043 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
1044 const Type *Ty = MVT::getTypeForValueType(VT);
1045 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty);
1046 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign);
1047 return getFrameIndex(FrameIdx, TLI.getPointerTy());
1051 SDOperand SelectionDAG::FoldSetCC(MVT::ValueType VT, SDOperand N1,
1052 SDOperand N2, ISD::CondCode Cond) {
1053 // These setcc operations always fold.
1057 case ISD::SETFALSE2: return getConstant(0, VT);
1059 case ISD::SETTRUE2: return getConstant(1, VT);
1071 assert(!MVT::isInteger(N1.getValueType()) && "Illegal setcc for integer!");
1075 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val)) {
1076 const APInt &C2 = N2C->getAPIntValue();
1077 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val)) {
1078 const APInt &C1 = N1C->getAPIntValue();
1081 default: assert(0 && "Unknown integer setcc!");
1082 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1083 case ISD::SETNE: return getConstant(C1 != C2, VT);
1084 case ISD::SETULT: return getConstant(C1.ult(C2), VT);
1085 case ISD::SETUGT: return getConstant(C1.ugt(C2), VT);
1086 case ISD::SETULE: return getConstant(C1.ule(C2), VT);
1087 case ISD::SETUGE: return getConstant(C1.uge(C2), VT);
1088 case ISD::SETLT: return getConstant(C1.slt(C2), VT);
1089 case ISD::SETGT: return getConstant(C1.sgt(C2), VT);
1090 case ISD::SETLE: return getConstant(C1.sle(C2), VT);
1091 case ISD::SETGE: return getConstant(C1.sge(C2), VT);
1095 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.Val)) {
1096 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.Val)) {
1097 // No compile time operations on this type yet.
1098 if (N1C->getValueType(0) == MVT::ppcf128)
1101 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
1104 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
1105 return getNode(ISD::UNDEF, VT);
1107 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
1108 case ISD::SETNE: if (R==APFloat::cmpUnordered)
1109 return getNode(ISD::UNDEF, VT);
1111 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
1112 R==APFloat::cmpLessThan, VT);
1113 case ISD::SETLT: if (R==APFloat::cmpUnordered)
1114 return getNode(ISD::UNDEF, VT);
1116 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1117 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1118 return getNode(ISD::UNDEF, VT);
1120 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1121 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1122 return getNode(ISD::UNDEF, VT);
1124 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
1125 R==APFloat::cmpEqual, VT);
1126 case ISD::SETGE: if (R==APFloat::cmpUnordered)
1127 return getNode(ISD::UNDEF, VT);
1129 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
1130 R==APFloat::cmpEqual, VT);
1131 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1132 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1133 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1134 R==APFloat::cmpEqual, VT);
1135 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1136 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1137 R==APFloat::cmpLessThan, VT);
1138 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1139 R==APFloat::cmpUnordered, VT);
1140 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1141 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
1144 // Ensure that the constant occurs on the RHS.
1145 return getSetCC(VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1149 // Could not fold it.
1153 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
1154 /// use this predicate to simplify operations downstream.
1155 bool SelectionDAG::SignBitIsZero(SDOperand Op, unsigned Depth) const {
1156 unsigned BitWidth = Op.getValueSizeInBits();
1157 return MaskedValueIsZero(Op, APInt::getSignBit(BitWidth), Depth);
1160 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1161 /// this predicate to simplify operations downstream. Mask is known to be zero
1162 /// for bits that V cannot have.
1163 bool SelectionDAG::MaskedValueIsZero(SDOperand Op, const APInt &Mask,
1164 unsigned Depth) const {
1165 APInt KnownZero, KnownOne;
1166 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1167 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1168 return (KnownZero & Mask) == Mask;
1171 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
1172 /// known to be either zero or one and return them in the KnownZero/KnownOne
1173 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1175 void SelectionDAG::ComputeMaskedBits(SDOperand Op, const APInt &Mask,
1176 APInt &KnownZero, APInt &KnownOne,
1177 unsigned Depth) const {
1178 unsigned BitWidth = Mask.getBitWidth();
1179 assert(BitWidth == MVT::getSizeInBits(Op.getValueType()) &&
1180 "Mask size mismatches value type size!");
1182 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
1183 if (Depth == 6 || Mask == 0)
1184 return; // Limit search depth.
1186 APInt KnownZero2, KnownOne2;
1188 switch (Op.getOpcode()) {
1190 // We know all of the bits for a constant!
1191 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask;
1192 KnownZero = ~KnownOne & Mask;
1195 // If either the LHS or the RHS are Zero, the result is zero.
1196 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1197 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero,
1198 KnownZero2, KnownOne2, Depth+1);
1199 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1200 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1202 // Output known-1 bits are only known if set in both the LHS & RHS.
1203 KnownOne &= KnownOne2;
1204 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1205 KnownZero |= KnownZero2;
1208 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1209 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne,
1210 KnownZero2, KnownOne2, Depth+1);
1211 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1212 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1214 // Output known-0 bits are only known if clear in both the LHS & RHS.
1215 KnownZero &= KnownZero2;
1216 // Output known-1 are known to be set if set in either the LHS | RHS.
1217 KnownOne |= KnownOne2;
1220 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1221 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1222 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1223 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1225 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1226 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1227 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1228 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1229 KnownZero = KnownZeroOut;
1233 APInt Mask2 = APInt::getAllOnesValue(BitWidth);
1234 ComputeMaskedBits(Op.getOperand(1), Mask2, KnownZero, KnownOne, Depth+1);
1235 ComputeMaskedBits(Op.getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
1236 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1237 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1239 // If low bits are zero in either operand, output low known-0 bits.
1240 // Also compute a conserative estimate for high known-0 bits.
1241 // More trickiness is possible, but this is sufficient for the
1242 // interesting case of alignment computation.
1244 unsigned TrailZ = KnownZero.countTrailingOnes() +
1245 KnownZero2.countTrailingOnes();
1246 unsigned LeadZ = std::max(KnownZero.countLeadingOnes() +
1247 KnownZero2.countLeadingOnes(),
1248 BitWidth) - BitWidth;
1250 TrailZ = std::min(TrailZ, BitWidth);
1251 LeadZ = std::min(LeadZ, BitWidth);
1252 KnownZero = APInt::getLowBitsSet(BitWidth, TrailZ) |
1253 APInt::getHighBitsSet(BitWidth, LeadZ);
1258 // For the purposes of computing leading zeros we can conservatively
1259 // treat a udiv as a logical right shift by the power of 2 known to
1260 // be less than the denominator.
1261 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
1262 ComputeMaskedBits(Op.getOperand(0),
1263 AllOnes, KnownZero2, KnownOne2, Depth+1);
1264 unsigned LeadZ = KnownZero2.countLeadingOnes();
1268 ComputeMaskedBits(Op.getOperand(1),
1269 AllOnes, KnownZero2, KnownOne2, Depth+1);
1270 unsigned RHSUnknownLeadingOnes = KnownOne2.countLeadingZeros();
1271 if (RHSUnknownLeadingOnes != BitWidth)
1272 LeadZ = std::min(BitWidth,
1273 LeadZ + BitWidth - RHSUnknownLeadingOnes - 1);
1275 KnownZero = APInt::getHighBitsSet(BitWidth, LeadZ) & Mask;
1279 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1280 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1281 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1282 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1284 // Only known if known in both the LHS and RHS.
1285 KnownOne &= KnownOne2;
1286 KnownZero &= KnownZero2;
1288 case ISD::SELECT_CC:
1289 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1290 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1291 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1292 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1294 // Only known if known in both the LHS and RHS.
1295 KnownOne &= KnownOne2;
1296 KnownZero &= KnownZero2;
1299 // If we know the result of a setcc has the top bits zero, use this info.
1300 if (TLI.getSetCCResultContents() == TargetLowering::ZeroOrOneSetCCResult &&
1302 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1305 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1306 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1307 unsigned ShAmt = SA->getValue();
1309 // If the shift count is an invalid immediate, don't do anything.
1310 if (ShAmt >= BitWidth)
1313 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(ShAmt),
1314 KnownZero, KnownOne, Depth+1);
1315 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1316 KnownZero <<= ShAmt;
1318 // low bits known zero.
1319 KnownZero |= APInt::getLowBitsSet(BitWidth, ShAmt);
1323 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1324 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1325 unsigned ShAmt = SA->getValue();
1327 // If the shift count is an invalid immediate, don't do anything.
1328 if (ShAmt >= BitWidth)
1331 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt),
1332 KnownZero, KnownOne, Depth+1);
1333 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1334 KnownZero = KnownZero.lshr(ShAmt);
1335 KnownOne = KnownOne.lshr(ShAmt);
1337 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1338 KnownZero |= HighBits; // High bits known zero.
1342 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1343 unsigned ShAmt = SA->getValue();
1345 // If the shift count is an invalid immediate, don't do anything.
1346 if (ShAmt >= BitWidth)
1349 APInt InDemandedMask = (Mask << ShAmt);
1350 // If any of the demanded bits are produced by the sign extension, we also
1351 // demand the input sign bit.
1352 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1353 if (HighBits.getBoolValue())
1354 InDemandedMask |= APInt::getSignBit(BitWidth);
1356 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1358 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1359 KnownZero = KnownZero.lshr(ShAmt);
1360 KnownOne = KnownOne.lshr(ShAmt);
1362 // Handle the sign bits.
1363 APInt SignBit = APInt::getSignBit(BitWidth);
1364 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask.
1366 if (KnownZero.intersects(SignBit)) {
1367 KnownZero |= HighBits; // New bits are known zero.
1368 } else if (KnownOne.intersects(SignBit)) {
1369 KnownOne |= HighBits; // New bits are known one.
1373 case ISD::SIGN_EXTEND_INREG: {
1374 MVT::ValueType EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1375 unsigned EBits = MVT::getSizeInBits(EVT);
1377 // Sign extension. Compute the demanded bits in the result that are not
1378 // present in the input.
1379 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask;
1381 APInt InSignBit = APInt::getSignBit(EBits);
1382 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits);
1384 // If the sign extended bits are demanded, we know that the sign
1386 InSignBit.zext(BitWidth);
1387 if (NewBits.getBoolValue())
1388 InputDemandedBits |= InSignBit;
1390 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1391 KnownZero, KnownOne, Depth+1);
1392 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1394 // If the sign bit of the input is known set or clear, then we know the
1395 // top bits of the result.
1396 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear
1397 KnownZero |= NewBits;
1398 KnownOne &= ~NewBits;
1399 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
1400 KnownOne |= NewBits;
1401 KnownZero &= ~NewBits;
1402 } else { // Input sign bit unknown
1403 KnownZero &= ~NewBits;
1404 KnownOne &= ~NewBits;
1411 unsigned LowBits = Log2_32(BitWidth)+1;
1412 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits);
1413 KnownOne = APInt(BitWidth, 0);
1417 if (ISD::isZEXTLoad(Op.Val)) {
1418 LoadSDNode *LD = cast<LoadSDNode>(Op);
1419 MVT::ValueType VT = LD->getMemoryVT();
1420 unsigned MemBits = MVT::getSizeInBits(VT);
1421 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask;
1425 case ISD::ZERO_EXTEND: {
1426 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1427 unsigned InBits = MVT::getSizeInBits(InVT);
1428 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1429 APInt InMask = Mask;
1430 InMask.trunc(InBits);
1431 KnownZero.trunc(InBits);
1432 KnownOne.trunc(InBits);
1433 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1434 KnownZero.zext(BitWidth);
1435 KnownOne.zext(BitWidth);
1436 KnownZero |= NewBits;
1439 case ISD::SIGN_EXTEND: {
1440 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1441 unsigned InBits = MVT::getSizeInBits(InVT);
1442 APInt InSignBit = APInt::getSignBit(InBits);
1443 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1444 APInt InMask = Mask;
1445 InMask.trunc(InBits);
1447 // If any of the sign extended bits are demanded, we know that the sign
1448 // bit is demanded. Temporarily set this bit in the mask for our callee.
1449 if (NewBits.getBoolValue())
1450 InMask |= InSignBit;
1452 KnownZero.trunc(InBits);
1453 KnownOne.trunc(InBits);
1454 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1456 // Note if the sign bit is known to be zero or one.
1457 bool SignBitKnownZero = KnownZero.isNegative();
1458 bool SignBitKnownOne = KnownOne.isNegative();
1459 assert(!(SignBitKnownZero && SignBitKnownOne) &&
1460 "Sign bit can't be known to be both zero and one!");
1462 // If the sign bit wasn't actually demanded by our caller, we don't
1463 // want it set in the KnownZero and KnownOne result values. Reset the
1464 // mask and reapply it to the result values.
1466 InMask.trunc(InBits);
1467 KnownZero &= InMask;
1470 KnownZero.zext(BitWidth);
1471 KnownOne.zext(BitWidth);
1473 // If the sign bit is known zero or one, the top bits match.
1474 if (SignBitKnownZero)
1475 KnownZero |= NewBits;
1476 else if (SignBitKnownOne)
1477 KnownOne |= NewBits;
1480 case ISD::ANY_EXTEND: {
1481 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1482 unsigned InBits = MVT::getSizeInBits(InVT);
1483 APInt InMask = Mask;
1484 InMask.trunc(InBits);
1485 KnownZero.trunc(InBits);
1486 KnownOne.trunc(InBits);
1487 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1488 KnownZero.zext(BitWidth);
1489 KnownOne.zext(BitWidth);
1492 case ISD::TRUNCATE: {
1493 MVT::ValueType InVT = Op.getOperand(0).getValueType();
1494 unsigned InBits = MVT::getSizeInBits(InVT);
1495 APInt InMask = Mask;
1496 InMask.zext(InBits);
1497 KnownZero.zext(InBits);
1498 KnownOne.zext(InBits);
1499 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1500 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1501 KnownZero.trunc(BitWidth);
1502 KnownOne.trunc(BitWidth);
1505 case ISD::AssertZext: {
1506 MVT::ValueType VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1507 APInt InMask = APInt::getLowBitsSet(BitWidth, MVT::getSizeInBits(VT));
1508 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1510 KnownZero |= (~InMask) & Mask;
1514 // All bits are zero except the low bit.
1515 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1519 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) {
1520 // We know that the top bits of C-X are clear if X contains less bits
1521 // than C (i.e. no wrap-around can happen). For example, 20-X is
1522 // positive if we can prove that X is >= 0 and < 16.
1523 if (CLHS->getAPIntValue().isNonNegative()) {
1524 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros();
1525 // NLZ can't be BitWidth with no sign bit
1526 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1);
1527 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero2, KnownOne2,
1530 // If all of the MaskV bits are known to be zero, then we know the
1531 // output top bits are zero, because we now know that the output is
1533 if ((KnownZero2 & MaskV) == MaskV) {
1534 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros();
1535 // Top bits known zero.
1536 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask;
1543 // Output known-0 bits are known if clear or set in both the low clear bits
1544 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1545 // low 3 bits clear.
1546 APInt Mask2 = APInt::getLowBitsSet(BitWidth, Mask.countTrailingOnes());
1547 ComputeMaskedBits(Op.getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
1548 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1549 unsigned KnownZeroOut = KnownZero2.countTrailingOnes();
1551 ComputeMaskedBits(Op.getOperand(1), Mask2, KnownZero2, KnownOne2, Depth+1);
1552 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1553 KnownZeroOut = std::min(KnownZeroOut,
1554 KnownZero2.countTrailingOnes());
1556 KnownZero |= APInt::getLowBitsSet(BitWidth, KnownZeroOut);
1560 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1561 APInt RA = Rem->getAPIntValue();
1562 if (RA.isPowerOf2() || (-RA).isPowerOf2()) {
1563 APInt LowBits = RA.isStrictlyPositive() ? (RA - 1) : ~RA;
1564 APInt Mask2 = LowBits | APInt::getSignBit(BitWidth);
1565 ComputeMaskedBits(Op.getOperand(0), Mask2,KnownZero2,KnownOne2,Depth+1);
1567 // The sign of a remainder is equal to the sign of the first
1568 // operand (zero being positive).
1569 if (KnownZero2[BitWidth-1] || ((KnownZero2 & LowBits) == LowBits))
1570 KnownZero2 |= ~LowBits;
1571 else if (KnownOne2[BitWidth-1])
1572 KnownOne2 |= ~LowBits;
1574 KnownZero |= KnownZero2 & Mask;
1575 KnownOne |= KnownOne2 & Mask;
1577 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
1582 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1583 APInt RA = Rem->getAPIntValue();
1584 if (RA.isPowerOf2()) {
1585 APInt LowBits = (RA - 1);
1586 APInt Mask2 = LowBits & Mask;
1587 KnownZero |= ~LowBits & Mask;
1588 ComputeMaskedBits(Op.getOperand(0), Mask2, KnownZero, KnownOne,Depth+1);
1589 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
1594 // Since the result is less than or equal to either operand, any leading
1595 // zero bits in either operand must also exist in the result.
1596 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
1597 ComputeMaskedBits(Op.getOperand(0), AllOnes, KnownZero, KnownOne,
1599 ComputeMaskedBits(Op.getOperand(1), AllOnes, KnownZero2, KnownOne2,
1602 uint32_t Leaders = std::max(KnownZero.countLeadingOnes(),
1603 KnownZero2.countLeadingOnes());
1605 KnownZero = APInt::getHighBitsSet(BitWidth, Leaders) & Mask;
1609 // Allow the target to implement this method for its nodes.
1610 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
1611 case ISD::INTRINSIC_WO_CHAIN:
1612 case ISD::INTRINSIC_W_CHAIN:
1613 case ISD::INTRINSIC_VOID:
1614 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this);
1620 /// ComputeNumSignBits - Return the number of times the sign bit of the
1621 /// register is replicated into the other bits. We know that at least 1 bit
1622 /// is always equal to the sign bit (itself), but other cases can give us
1623 /// information. For example, immediately after an "SRA X, 2", we know that
1624 /// the top 3 bits are all equal to each other, so we return 3.
1625 unsigned SelectionDAG::ComputeNumSignBits(SDOperand Op, unsigned Depth) const{
1626 MVT::ValueType VT = Op.getValueType();
1627 assert(MVT::isInteger(VT) && "Invalid VT!");
1628 unsigned VTBits = MVT::getSizeInBits(VT);
1632 return 1; // Limit search depth.
1634 switch (Op.getOpcode()) {
1636 case ISD::AssertSext:
1637 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1638 return VTBits-Tmp+1;
1639 case ISD::AssertZext:
1640 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1643 case ISD::Constant: {
1644 const APInt &Val = cast<ConstantSDNode>(Op)->getAPIntValue();
1645 // If negative, return # leading ones.
1646 if (Val.isNegative())
1647 return Val.countLeadingOnes();
1649 // Return # leading zeros.
1650 return Val.countLeadingZeros();
1653 case ISD::SIGN_EXTEND:
1654 Tmp = VTBits-MVT::getSizeInBits(Op.getOperand(0).getValueType());
1655 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
1657 case ISD::SIGN_EXTEND_INREG:
1658 // Max of the input and what this extends.
1659 Tmp = MVT::getSizeInBits(cast<VTSDNode>(Op.getOperand(1))->getVT());
1662 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1663 return std::max(Tmp, Tmp2);
1666 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1667 // SRA X, C -> adds C sign bits.
1668 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1669 Tmp += C->getValue();
1670 if (Tmp > VTBits) Tmp = VTBits;
1674 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1675 // shl destroys sign bits.
1676 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1677 if (C->getValue() >= VTBits || // Bad shift.
1678 C->getValue() >= Tmp) break; // Shifted all sign bits out.
1679 return Tmp - C->getValue();
1684 case ISD::XOR: // NOT is handled here.
1685 // Logical binary ops preserve the number of sign bits.
1686 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1687 if (Tmp == 1) return 1; // Early out.
1688 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1689 return std::min(Tmp, Tmp2);
1692 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1693 if (Tmp == 1) return 1; // Early out.
1694 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1695 return std::min(Tmp, Tmp2);
1698 // If setcc returns 0/-1, all bits are sign bits.
1699 if (TLI.getSetCCResultContents() ==
1700 TargetLowering::ZeroOrNegativeOneSetCCResult)
1705 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1706 unsigned RotAmt = C->getValue() & (VTBits-1);
1708 // Handle rotate right by N like a rotate left by 32-N.
1709 if (Op.getOpcode() == ISD::ROTR)
1710 RotAmt = (VTBits-RotAmt) & (VTBits-1);
1712 // If we aren't rotating out all of the known-in sign bits, return the
1713 // number that are left. This handles rotl(sext(x), 1) for example.
1714 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1715 if (Tmp > RotAmt+1) return Tmp-RotAmt;
1719 // Add can have at most one carry bit. Thus we know that the output
1720 // is, at worst, one more bit than the inputs.
1721 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1722 if (Tmp == 1) return 1; // Early out.
1724 // Special case decrementing a value (ADD X, -1):
1725 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1726 if (CRHS->isAllOnesValue()) {
1727 APInt KnownZero, KnownOne;
1728 APInt Mask = APInt::getAllOnesValue(VTBits);
1729 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
1731 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1733 if ((KnownZero | APInt(VTBits, 1)) == Mask)
1736 // If we are subtracting one from a positive number, there is no carry
1737 // out of the result.
1738 if (KnownZero.isNegative())
1742 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1743 if (Tmp2 == 1) return 1;
1744 return std::min(Tmp, Tmp2)-1;
1748 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
1749 if (Tmp2 == 1) return 1;
1752 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
1753 if (CLHS->isNullValue()) {
1754 APInt KnownZero, KnownOne;
1755 APInt Mask = APInt::getAllOnesValue(VTBits);
1756 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1757 // If the input is known to be 0 or 1, the output is 0/-1, which is all
1759 if ((KnownZero | APInt(VTBits, 1)) == Mask)
1762 // If the input is known to be positive (the sign bit is known clear),
1763 // the output of the NEG has the same number of sign bits as the input.
1764 if (KnownZero.isNegative())
1767 // Otherwise, we treat this like a SUB.
1770 // Sub can have at most one carry bit. Thus we know that the output
1771 // is, at worst, one more bit than the inputs.
1772 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
1773 if (Tmp == 1) return 1; // Early out.
1774 return std::min(Tmp, Tmp2)-1;
1777 // FIXME: it's tricky to do anything useful for this, but it is an important
1778 // case for targets like X86.
1782 // Handle LOADX separately here. EXTLOAD case will fallthrough.
1783 if (Op.getOpcode() == ISD::LOAD) {
1784 LoadSDNode *LD = cast<LoadSDNode>(Op);
1785 unsigned ExtType = LD->getExtensionType();
1788 case ISD::SEXTLOAD: // '17' bits known
1789 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1790 return VTBits-Tmp+1;
1791 case ISD::ZEXTLOAD: // '16' bits known
1792 Tmp = MVT::getSizeInBits(LD->getMemoryVT());
1797 // Allow the target to implement this method for its nodes.
1798 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
1799 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
1800 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
1801 Op.getOpcode() == ISD::INTRINSIC_VOID) {
1802 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
1803 if (NumBits > 1) return NumBits;
1806 // Finally, if we can prove that the top bits of the result are 0's or 1's,
1807 // use this information.
1808 APInt KnownZero, KnownOne;
1809 APInt Mask = APInt::getAllOnesValue(VTBits);
1810 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1812 if (KnownZero.isNegative()) { // sign bit is 0
1814 } else if (KnownOne.isNegative()) { // sign bit is 1;
1821 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
1822 // the number of identical bits in the top of the input value.
1824 Mask <<= Mask.getBitWidth()-VTBits;
1825 // Return # leading zeros. We use 'min' here in case Val was zero before
1826 // shifting. We don't want to return '64' as for an i32 "0".
1827 return std::min(VTBits, Mask.countLeadingZeros());
1831 bool SelectionDAG::isVerifiedDebugInfoDesc(SDOperand Op) const {
1832 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
1833 if (!GA) return false;
1834 GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal());
1835 if (!GV) return false;
1836 MachineModuleInfo *MMI = getMachineModuleInfo();
1837 return MMI && MMI->hasDebugInfo() && MMI->isVerified(GV);
1841 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
1842 /// element of the result of the vector shuffle.
1843 SDOperand SelectionDAG::getShuffleScalarElt(const SDNode *N, unsigned Idx) {
1844 MVT::ValueType VT = N->getValueType(0);
1845 SDOperand PermMask = N->getOperand(2);
1846 unsigned NumElems = PermMask.getNumOperands();
1847 SDOperand V = (Idx < NumElems) ? N->getOperand(0) : N->getOperand(1);
1849 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR) {
1851 ? V.getOperand(0) : getNode(ISD::UNDEF, MVT::getVectorElementType(VT));
1853 if (V.getOpcode() == ISD::VECTOR_SHUFFLE) {
1854 SDOperand Elt = PermMask.getOperand(Idx);
1855 if (Elt.getOpcode() == ISD::UNDEF)
1856 return getNode(ISD::UNDEF, MVT::getVectorElementType(VT));
1857 return getShuffleScalarElt(V.Val,cast<ConstantSDNode>(Elt)->getValue());
1863 /// getNode - Gets or creates the specified node.
1865 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT) {
1866 FoldingSetNodeID ID;
1867 AddNodeIDNode(ID, Opcode, getVTList(VT), (SDOperand*)0, 0);
1869 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1870 return SDOperand(E, 0);
1871 SDNode *N = new SDNode(Opcode, SDNode::getSDVTList(VT));
1872 CSEMap.InsertNode(N, IP);
1874 AllNodes.push_back(N);
1875 return SDOperand(N, 0);
1878 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
1879 SDOperand Operand) {
1880 // Constant fold unary operations with an integer constant operand.
1881 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.Val)) {
1882 const APInt &Val = C->getAPIntValue();
1883 unsigned BitWidth = MVT::getSizeInBits(VT);
1886 case ISD::SIGN_EXTEND:
1887 return getConstant(APInt(Val).sextOrTrunc(BitWidth), VT);
1888 case ISD::ANY_EXTEND:
1889 case ISD::ZERO_EXTEND:
1891 return getConstant(APInt(Val).zextOrTrunc(BitWidth), VT);
1892 case ISD::UINT_TO_FP:
1893 case ISD::SINT_TO_FP: {
1894 const uint64_t zero[] = {0, 0};
1895 // No compile time operations on this type.
1896 if (VT==MVT::ppcf128)
1898 APFloat apf = APFloat(APInt(BitWidth, 2, zero));
1899 (void)apf.convertFromAPInt(Val,
1900 Opcode==ISD::SINT_TO_FP,
1901 APFloat::rmNearestTiesToEven);
1902 return getConstantFP(apf, VT);
1904 case ISD::BIT_CONVERT:
1905 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
1906 return getConstantFP(Val.bitsToFloat(), VT);
1907 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
1908 return getConstantFP(Val.bitsToDouble(), VT);
1911 return getConstant(Val.byteSwap(), VT);
1913 return getConstant(Val.countPopulation(), VT);
1915 return getConstant(Val.countLeadingZeros(), VT);
1917 return getConstant(Val.countTrailingZeros(), VT);
1921 // Constant fold unary operations with a floating point constant operand.
1922 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.Val)) {
1923 APFloat V = C->getValueAPF(); // make copy
1924 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) {
1928 return getConstantFP(V, VT);
1931 return getConstantFP(V, VT);
1933 case ISD::FP_EXTEND:
1934 // This can return overflow, underflow, or inexact; we don't care.
1935 // FIXME need to be more flexible about rounding mode.
1936 (void)V.convert(*MVTToAPFloatSemantics(VT),
1937 APFloat::rmNearestTiesToEven);
1938 return getConstantFP(V, VT);
1939 case ISD::FP_TO_SINT:
1940 case ISD::FP_TO_UINT: {
1942 assert(integerPartWidth >= 64);
1943 // FIXME need to be more flexible about rounding mode.
1944 APFloat::opStatus s = V.convertToInteger(&x, 64U,
1945 Opcode==ISD::FP_TO_SINT,
1946 APFloat::rmTowardZero);
1947 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
1949 return getConstant(x, VT);
1951 case ISD::BIT_CONVERT:
1952 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
1953 return getConstant((uint32_t)V.convertToAPInt().getZExtValue(), VT);
1954 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
1955 return getConstant(V.convertToAPInt().getZExtValue(), VT);
1961 unsigned OpOpcode = Operand.Val->getOpcode();
1963 case ISD::TokenFactor:
1964 case ISD::MERGE_VALUES:
1965 return Operand; // Factor or merge of one node? No need.
1966 case ISD::FP_ROUND: assert(0 && "Invalid method to make FP_ROUND node");
1967 case ISD::FP_EXTEND:
1968 assert(MVT::isFloatingPoint(VT) &&
1969 MVT::isFloatingPoint(Operand.getValueType()) && "Invalid FP cast!");
1970 if (Operand.getValueType() == VT) return Operand; // noop conversion.
1971 if (Operand.getOpcode() == ISD::UNDEF)
1972 return getNode(ISD::UNDEF, VT);
1974 case ISD::SIGN_EXTEND:
1975 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1976 "Invalid SIGN_EXTEND!");
1977 if (Operand.getValueType() == VT) return Operand; // noop extension
1978 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1979 && "Invalid sext node, dst < src!");
1980 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
1981 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
1983 case ISD::ZERO_EXTEND:
1984 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1985 "Invalid ZERO_EXTEND!");
1986 if (Operand.getValueType() == VT) return Operand; // noop extension
1987 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1988 && "Invalid zext node, dst < src!");
1989 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
1990 return getNode(ISD::ZERO_EXTEND, VT, Operand.Val->getOperand(0));
1992 case ISD::ANY_EXTEND:
1993 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
1994 "Invalid ANY_EXTEND!");
1995 if (Operand.getValueType() == VT) return Operand; // noop extension
1996 assert(MVT::getSizeInBits(Operand.getValueType()) < MVT::getSizeInBits(VT)
1997 && "Invalid anyext node, dst < src!");
1998 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND)
1999 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
2000 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
2003 assert(MVT::isInteger(VT) && MVT::isInteger(Operand.getValueType()) &&
2004 "Invalid TRUNCATE!");
2005 if (Operand.getValueType() == VT) return Operand; // noop truncate
2006 assert(MVT::getSizeInBits(Operand.getValueType()) > MVT::getSizeInBits(VT)
2007 && "Invalid truncate node, src < dst!");
2008 if (OpOpcode == ISD::TRUNCATE)
2009 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
2010 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
2011 OpOpcode == ISD::ANY_EXTEND) {
2012 // If the source is smaller than the dest, we still need an extend.
2013 if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
2014 < MVT::getSizeInBits(VT))
2015 return getNode(OpOpcode, VT, Operand.Val->getOperand(0));
2016 else if (MVT::getSizeInBits(Operand.Val->getOperand(0).getValueType())
2017 > MVT::getSizeInBits(VT))
2018 return getNode(ISD::TRUNCATE, VT, Operand.Val->getOperand(0));
2020 return Operand.Val->getOperand(0);
2023 case ISD::BIT_CONVERT:
2024 // Basic sanity checking.
2025 assert(MVT::getSizeInBits(VT) == MVT::getSizeInBits(Operand.getValueType())
2026 && "Cannot BIT_CONVERT between types of different sizes!");
2027 if (VT == Operand.getValueType()) return Operand; // noop conversion.
2028 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
2029 return getNode(ISD::BIT_CONVERT, VT, Operand.getOperand(0));
2030 if (OpOpcode == ISD::UNDEF)
2031 return getNode(ISD::UNDEF, VT);
2033 case ISD::SCALAR_TO_VECTOR:
2034 assert(MVT::isVector(VT) && !MVT::isVector(Operand.getValueType()) &&
2035 MVT::getVectorElementType(VT) == Operand.getValueType() &&
2036 "Illegal SCALAR_TO_VECTOR node!");
2037 if (OpOpcode == ISD::UNDEF)
2038 return getNode(ISD::UNDEF, VT);
2039 // scalar_to_vector(extract_vector_elt V, 0) -> V, top bits are undefined.
2040 if (OpOpcode == ISD::EXTRACT_VECTOR_ELT &&
2041 isa<ConstantSDNode>(Operand.getOperand(1)) &&
2042 Operand.getConstantOperandVal(1) == 0 &&
2043 Operand.getOperand(0).getValueType() == VT)
2044 return Operand.getOperand(0);
2047 if (OpOpcode == ISD::FSUB) // -(X-Y) -> (Y-X)
2048 return getNode(ISD::FSUB, VT, Operand.Val->getOperand(1),
2049 Operand.Val->getOperand(0));
2050 if (OpOpcode == ISD::FNEG) // --X -> X
2051 return Operand.Val->getOperand(0);
2054 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
2055 return getNode(ISD::FABS, VT, Operand.Val->getOperand(0));
2060 SDVTList VTs = getVTList(VT);
2061 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
2062 FoldingSetNodeID ID;
2063 SDOperand Ops[1] = { Operand };
2064 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
2066 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2067 return SDOperand(E, 0);
2068 N = new UnarySDNode(Opcode, VTs, Operand);
2069 CSEMap.InsertNode(N, IP);
2071 N = new UnarySDNode(Opcode, VTs, Operand);
2073 AllNodes.push_back(N);
2074 return SDOperand(N, 0);
2079 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2080 SDOperand N1, SDOperand N2) {
2081 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2082 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2085 case ISD::TokenFactor:
2086 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
2087 N2.getValueType() == MVT::Other && "Invalid token factor!");
2088 // Fold trivial token factors.
2089 if (N1.getOpcode() == ISD::EntryToken) return N2;
2090 if (N2.getOpcode() == ISD::EntryToken) return N1;
2093 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
2094 N1.getValueType() == VT && "Binary operator types must match!");
2095 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
2096 // worth handling here.
2097 if (N2C && N2C->isNullValue())
2099 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X
2104 assert(MVT::isInteger(VT) && N1.getValueType() == N2.getValueType() &&
2105 N1.getValueType() == VT && "Binary operator types must match!");
2106 // (X ^| 0) -> X. This commonly occurs when legalizing i64 values, so it's
2107 // worth handling here.
2108 if (N2C && N2C->isNullValue())
2115 assert(MVT::isInteger(VT) && "This operator does not apply to FP types!");
2127 assert(N1.getValueType() == N2.getValueType() &&
2128 N1.getValueType() == VT && "Binary operator types must match!");
2130 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
2131 assert(N1.getValueType() == VT &&
2132 MVT::isFloatingPoint(N1.getValueType()) &&
2133 MVT::isFloatingPoint(N2.getValueType()) &&
2134 "Invalid FCOPYSIGN!");
2141 assert(VT == N1.getValueType() &&
2142 "Shift operators return type must be the same as their first arg");
2143 assert(MVT::isInteger(VT) && MVT::isInteger(N2.getValueType()) &&
2144 VT != MVT::i1 && "Shifts only work on integers");
2146 case ISD::FP_ROUND_INREG: {
2147 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2148 assert(VT == N1.getValueType() && "Not an inreg round!");
2149 assert(MVT::isFloatingPoint(VT) && MVT::isFloatingPoint(EVT) &&
2150 "Cannot FP_ROUND_INREG integer types");
2151 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2152 "Not rounding down!");
2153 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2157 assert(MVT::isFloatingPoint(VT) &&
2158 MVT::isFloatingPoint(N1.getValueType()) &&
2159 MVT::getSizeInBits(VT) <= MVT::getSizeInBits(N1.getValueType()) &&
2160 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!");
2161 if (N1.getValueType() == VT) return N1; // noop conversion.
2163 case ISD::AssertSext:
2164 case ISD::AssertZext: {
2165 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2166 assert(VT == N1.getValueType() && "Not an inreg extend!");
2167 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2168 "Cannot *_EXTEND_INREG FP types");
2169 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2171 if (VT == EVT) return N1; // noop assertion.
2174 case ISD::SIGN_EXTEND_INREG: {
2175 MVT::ValueType EVT = cast<VTSDNode>(N2)->getVT();
2176 assert(VT == N1.getValueType() && "Not an inreg extend!");
2177 assert(MVT::isInteger(VT) && MVT::isInteger(EVT) &&
2178 "Cannot *_EXTEND_INREG FP types");
2179 assert(MVT::getSizeInBits(EVT) <= MVT::getSizeInBits(VT) &&
2181 if (EVT == VT) return N1; // Not actually extending
2184 APInt Val = N1C->getAPIntValue();
2185 unsigned FromBits = MVT::getSizeInBits(cast<VTSDNode>(N2)->getVT());
2186 Val <<= Val.getBitWidth()-FromBits;
2187 Val = Val.ashr(Val.getBitWidth()-FromBits);
2188 return getConstant(Val, VT);
2192 case ISD::EXTRACT_VECTOR_ELT:
2193 assert(N2C && "Bad EXTRACT_VECTOR_ELT!");
2195 // EXTRACT_VECTOR_ELT of an UNDEF is an UNDEF.
2196 if (N1.getOpcode() == ISD::UNDEF)
2197 return getNode(ISD::UNDEF, VT);
2199 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2200 // expanding copies of large vectors from registers.
2201 if (N1.getOpcode() == ISD::CONCAT_VECTORS &&
2202 N1.getNumOperands() > 0) {
2204 MVT::getVectorNumElements(N1.getOperand(0).getValueType());
2205 return getNode(ISD::EXTRACT_VECTOR_ELT, VT,
2206 N1.getOperand(N2C->getValue() / Factor),
2207 getConstant(N2C->getValue() % Factor, N2.getValueType()));
2210 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2211 // expanding large vector constants.
2212 if (N1.getOpcode() == ISD::BUILD_VECTOR)
2213 return N1.getOperand(N2C->getValue());
2215 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2216 // operations are lowered to scalars.
2217 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT)
2218 if (ConstantSDNode *IEC = dyn_cast<ConstantSDNode>(N1.getOperand(2))) {
2220 return N1.getOperand(1);
2222 return getNode(ISD::EXTRACT_VECTOR_ELT, VT, N1.getOperand(0), N2);
2225 case ISD::EXTRACT_ELEMENT:
2226 assert(N2C && (unsigned)N2C->getValue() < 2 && "Bad EXTRACT_ELEMENT!");
2227 assert(!MVT::isVector(N1.getValueType()) &&
2228 MVT::isInteger(N1.getValueType()) &&
2229 !MVT::isVector(VT) && MVT::isInteger(VT) &&
2230 "EXTRACT_ELEMENT only applies to integers!");
2232 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2233 // 64-bit integers into 32-bit parts. Instead of building the extract of
2234 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2235 if (N1.getOpcode() == ISD::BUILD_PAIR)
2236 return N1.getOperand(N2C->getValue());
2238 // EXTRACT_ELEMENT of a constant int is also very common.
2239 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2240 unsigned ElementSize = MVT::getSizeInBits(VT);
2241 unsigned Shift = ElementSize * N2C->getValue();
2242 APInt ShiftedVal = C->getAPIntValue().lshr(Shift);
2243 return getConstant(ShiftedVal.trunc(ElementSize), VT);
2246 case ISD::EXTRACT_SUBVECTOR:
2247 if (N1.getValueType() == VT) // Trivial extraction.
2254 APInt C1 = N1C->getAPIntValue(), C2 = N2C->getAPIntValue();
2256 case ISD::ADD: return getConstant(C1 + C2, VT);
2257 case ISD::SUB: return getConstant(C1 - C2, VT);
2258 case ISD::MUL: return getConstant(C1 * C2, VT);
2260 if (C2.getBoolValue()) return getConstant(C1.udiv(C2), VT);
2263 if (C2.getBoolValue()) return getConstant(C1.urem(C2), VT);
2266 if (C2.getBoolValue()) return getConstant(C1.sdiv(C2), VT);
2269 if (C2.getBoolValue()) return getConstant(C1.srem(C2), VT);
2271 case ISD::AND : return getConstant(C1 & C2, VT);
2272 case ISD::OR : return getConstant(C1 | C2, VT);
2273 case ISD::XOR : return getConstant(C1 ^ C2, VT);
2274 case ISD::SHL : return getConstant(C1 << C2, VT);
2275 case ISD::SRL : return getConstant(C1.lshr(C2), VT);
2276 case ISD::SRA : return getConstant(C1.ashr(C2), VT);
2277 case ISD::ROTL : return getConstant(C1.rotl(C2), VT);
2278 case ISD::ROTR : return getConstant(C1.rotr(C2), VT);
2281 } else { // Cannonicalize constant to RHS if commutative
2282 if (isCommutativeBinOp(Opcode)) {
2283 std::swap(N1C, N2C);
2289 // Constant fold FP operations.
2290 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.Val);
2291 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.Val);
2293 if (!N2CFP && isCommutativeBinOp(Opcode)) {
2294 // Cannonicalize constant to RHS if commutative
2295 std::swap(N1CFP, N2CFP);
2297 } else if (N2CFP && VT != MVT::ppcf128) {
2298 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
2299 APFloat::opStatus s;
2302 s = V1.add(V2, APFloat::rmNearestTiesToEven);
2303 if (s != APFloat::opInvalidOp)
2304 return getConstantFP(V1, VT);
2307 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
2308 if (s!=APFloat::opInvalidOp)
2309 return getConstantFP(V1, VT);
2312 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
2313 if (s!=APFloat::opInvalidOp)
2314 return getConstantFP(V1, VT);
2317 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
2318 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2319 return getConstantFP(V1, VT);
2322 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
2323 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2324 return getConstantFP(V1, VT);
2326 case ISD::FCOPYSIGN:
2328 return getConstantFP(V1, VT);
2334 // Canonicalize an UNDEF to the RHS, even over a constant.
2335 if (N1.getOpcode() == ISD::UNDEF) {
2336 if (isCommutativeBinOp(Opcode)) {
2340 case ISD::FP_ROUND_INREG:
2341 case ISD::SIGN_EXTEND_INREG:
2347 return N1; // fold op(undef, arg2) -> undef
2354 if (!MVT::isVector(VT))
2355 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2356 // For vectors, we can't easily build an all zero vector, just return
2363 // Fold a bunch of operators when the RHS is undef.
2364 if (N2.getOpcode() == ISD::UNDEF) {
2367 if (N1.getOpcode() == ISD::UNDEF)
2368 // Handle undef ^ undef -> 0 special case. This is a common
2370 return getConstant(0, VT);
2385 return N2; // fold op(arg1, undef) -> undef
2390 if (!MVT::isVector(VT))
2391 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2392 // For vectors, we can't easily build an all zero vector, just return
2396 if (!MVT::isVector(VT))
2397 return getConstant(MVT::getIntVTBitMask(VT), VT);
2398 // For vectors, we can't easily build an all one vector, just return
2406 // Memoize this node if possible.
2408 SDVTList VTs = getVTList(VT);
2409 if (VT != MVT::Flag) {
2410 SDOperand Ops[] = { N1, N2 };
2411 FoldingSetNodeID ID;
2412 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2414 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2415 return SDOperand(E, 0);
2416 N = new BinarySDNode(Opcode, VTs, N1, N2);
2417 CSEMap.InsertNode(N, IP);
2419 N = new BinarySDNode(Opcode, VTs, N1, N2);
2422 AllNodes.push_back(N);
2423 return SDOperand(N, 0);
2426 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2427 SDOperand N1, SDOperand N2, SDOperand N3) {
2428 // Perform various simplifications.
2429 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.Val);
2430 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.Val);
2433 // Use FoldSetCC to simplify SETCC's.
2434 SDOperand Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get());
2435 if (Simp.Val) return Simp;
2440 if (N1C->getValue())
2441 return N2; // select true, X, Y -> X
2443 return N3; // select false, X, Y -> Y
2446 if (N2 == N3) return N2; // select C, X, X -> X
2450 if (N2C->getValue()) // Unconditional branch
2451 return getNode(ISD::BR, MVT::Other, N1, N3);
2453 return N1; // Never-taken branch
2456 case ISD::VECTOR_SHUFFLE:
2457 assert(VT == N1.getValueType() && VT == N2.getValueType() &&
2458 MVT::isVector(VT) && MVT::isVector(N3.getValueType()) &&
2459 N3.getOpcode() == ISD::BUILD_VECTOR &&
2460 MVT::getVectorNumElements(VT) == N3.getNumOperands() &&
2461 "Illegal VECTOR_SHUFFLE node!");
2463 case ISD::BIT_CONVERT:
2464 // Fold bit_convert nodes from a type to themselves.
2465 if (N1.getValueType() == VT)
2470 // Memoize node if it doesn't produce a flag.
2472 SDVTList VTs = getVTList(VT);
2473 if (VT != MVT::Flag) {
2474 SDOperand Ops[] = { N1, N2, N3 };
2475 FoldingSetNodeID ID;
2476 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2478 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2479 return SDOperand(E, 0);
2480 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2481 CSEMap.InsertNode(N, IP);
2483 N = new TernarySDNode(Opcode, VTs, N1, N2, N3);
2485 AllNodes.push_back(N);
2486 return SDOperand(N, 0);
2489 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2490 SDOperand N1, SDOperand N2, SDOperand N3,
2492 SDOperand Ops[] = { N1, N2, N3, N4 };
2493 return getNode(Opcode, VT, Ops, 4);
2496 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
2497 SDOperand N1, SDOperand N2, SDOperand N3,
2498 SDOperand N4, SDOperand N5) {
2499 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
2500 return getNode(Opcode, VT, Ops, 5);
2503 /// getMemsetValue - Vectorized representation of the memset value
2505 static SDOperand getMemsetValue(SDOperand Value, MVT::ValueType VT,
2506 SelectionDAG &DAG) {
2507 MVT::ValueType CurVT = VT;
2508 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) {
2509 uint64_t Val = C->getValue() & 255;
2511 while (CurVT != MVT::i8) {
2512 Val = (Val << Shift) | Val;
2514 CurVT = (MVT::ValueType)((unsigned)CurVT - 1);
2516 return DAG.getConstant(Val, VT);
2518 Value = DAG.getNode(ISD::ZERO_EXTEND, VT, Value);
2520 while (CurVT != MVT::i8) {
2522 DAG.getNode(ISD::OR, VT,
2523 DAG.getNode(ISD::SHL, VT, Value,
2524 DAG.getConstant(Shift, MVT::i8)), Value);
2526 CurVT = (MVT::ValueType)((unsigned)CurVT - 1);
2533 /// getMemsetStringVal - Similar to getMemsetValue. Except this is only
2534 /// used when a memcpy is turned into a memset when the source is a constant
2536 static SDOperand getMemsetStringVal(MVT::ValueType VT,
2538 const TargetLowering &TLI,
2539 std::string &Str, unsigned Offset) {
2541 unsigned MSB = MVT::getSizeInBits(VT) / 8;
2542 if (TLI.isLittleEndian())
2543 Offset = Offset + MSB - 1;
2544 for (unsigned i = 0; i != MSB; ++i) {
2545 Val = (Val << 8) | (unsigned char)Str[Offset];
2546 Offset += TLI.isLittleEndian() ? -1 : 1;
2548 return DAG.getConstant(Val, VT);
2551 /// getMemBasePlusOffset - Returns base and offset node for the
2552 static SDOperand getMemBasePlusOffset(SDOperand Base, unsigned Offset,
2553 SelectionDAG &DAG) {
2554 MVT::ValueType VT = Base.getValueType();
2555 return DAG.getNode(ISD::ADD, VT, Base, DAG.getConstant(Offset, VT));
2558 /// MeetsMaxMemopRequirement - Determines if the number of memory ops required
2559 /// to replace the memset / memcpy is below the threshold. It also returns the
2560 /// types of the sequence of memory ops to perform memset / memcpy.
2561 static bool MeetsMaxMemopRequirement(std::vector<MVT::ValueType> &MemOps,
2562 unsigned Limit, uint64_t Size,
2564 const TargetLowering &TLI) {
2567 if (TLI.allowsUnalignedMemoryAccesses()) {
2570 switch (Align & 7) {
2586 MVT::ValueType LVT = MVT::i64;
2587 while (!TLI.isTypeLegal(LVT))
2588 LVT = (MVT::ValueType)((unsigned)LVT - 1);
2589 assert(MVT::isInteger(LVT));
2594 unsigned NumMemOps = 0;
2596 unsigned VTSize = MVT::getSizeInBits(VT) / 8;
2597 while (VTSize > Size) {
2598 VT = (MVT::ValueType)((unsigned)VT - 1);
2601 assert(MVT::isInteger(VT));
2603 if (++NumMemOps > Limit)
2605 MemOps.push_back(VT);
2612 static SDOperand getMemcpyLoadsAndStores(SelectionDAG &DAG,
2613 SDOperand Chain, SDOperand Dst,
2614 SDOperand Src, uint64_t Size,
2617 const Value *DstSV, uint64_t DstSVOff,
2618 const Value *SrcSV, uint64_t SrcSVOff){
2619 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
2621 // Expand memcpy to a series of store ops if the size operand falls below
2622 // a certain threshold.
2623 std::vector<MVT::ValueType> MemOps;
2624 uint64_t Limit = -1;
2626 Limit = TLI.getMaxStoresPerMemcpy();
2627 if (!MeetsMaxMemopRequirement(MemOps, Limit, Size, Align, TLI))
2630 SmallVector<SDOperand, 8> OutChains;
2632 unsigned NumMemOps = MemOps.size();
2633 unsigned SrcDelta = 0;
2634 GlobalAddressSDNode *G = NULL;
2636 bool CopyFromStr = false;
2637 uint64_t SrcOff = 0, DstOff = 0;
2639 if (Src.getOpcode() == ISD::GlobalAddress)
2640 G = cast<GlobalAddressSDNode>(Src);
2641 else if (Src.getOpcode() == ISD::ADD &&
2642 Src.getOperand(0).getOpcode() == ISD::GlobalAddress &&
2643 Src.getOperand(1).getOpcode() == ISD::Constant) {
2644 G = cast<GlobalAddressSDNode>(Src.getOperand(0));
2645 SrcDelta = cast<ConstantSDNode>(Src.getOperand(1))->getValue();
2648 GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal());
2649 if (GV && GV->isConstant()) {
2650 Str = GV->getStringValue(false);
2658 for (unsigned i = 0; i < NumMemOps; i++) {
2659 MVT::ValueType VT = MemOps[i];
2660 unsigned VTSize = MVT::getSizeInBits(VT) / 8;
2661 SDOperand Value, Store;
2664 Value = getMemsetStringVal(VT, DAG, TLI, Str, SrcOff);
2666 DAG.getStore(Chain, Value,
2667 getMemBasePlusOffset(Dst, DstOff, DAG),
2668 DstSV, DstSVOff + DstOff);
2670 Value = DAG.getLoad(VT, Chain,
2671 getMemBasePlusOffset(Src, SrcOff, DAG),
2672 SrcSV, SrcSVOff + SrcOff, false, Align);
2674 DAG.getStore(Chain, Value,
2675 getMemBasePlusOffset(Dst, DstOff, DAG),
2676 DstSV, DstSVOff + DstOff, false, Align);
2678 OutChains.push_back(Store);
2683 return DAG.getNode(ISD::TokenFactor, MVT::Other,
2684 &OutChains[0], OutChains.size());
2687 static SDOperand getMemsetStores(SelectionDAG &DAG,
2688 SDOperand Chain, SDOperand Dst,
2689 SDOperand Src, uint64_t Size,
2691 const Value *DstSV, uint64_t DstSVOff) {
2692 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
2694 // Expand memset to a series of load/store ops if the size operand
2695 // falls below a certain threshold.
2696 std::vector<MVT::ValueType> MemOps;
2697 if (!MeetsMaxMemopRequirement(MemOps, TLI.getMaxStoresPerMemset(),
2701 SmallVector<SDOperand, 8> OutChains;
2702 uint64_t DstOff = 0;
2704 unsigned NumMemOps = MemOps.size();
2705 for (unsigned i = 0; i < NumMemOps; i++) {
2706 MVT::ValueType VT = MemOps[i];
2707 unsigned VTSize = MVT::getSizeInBits(VT) / 8;
2708 SDOperand Value = getMemsetValue(Src, VT, DAG);
2709 SDOperand Store = DAG.getStore(Chain, Value,
2710 getMemBasePlusOffset(Dst, DstOff, DAG),
2711 DstSV, DstSVOff + DstOff);
2712 OutChains.push_back(Store);
2716 return DAG.getNode(ISD::TokenFactor, MVT::Other,
2717 &OutChains[0], OutChains.size());
2720 SDOperand SelectionDAG::getMemcpy(SDOperand Chain, SDOperand Dst,
2721 SDOperand Src, SDOperand Size,
2722 unsigned Align, bool AlwaysInline,
2723 const Value *DstSV, uint64_t DstSVOff,
2724 const Value *SrcSV, uint64_t SrcSVOff) {
2726 // Check to see if we should lower the memcpy to loads and stores first.
2727 // For cases within the target-specified limits, this is the best choice.
2728 ConstantSDNode *ConstantSize = dyn_cast<ConstantSDNode>(Size);
2730 // Memcpy with size zero? Just return the original chain.
2731 if (ConstantSize->isNullValue())
2735 getMemcpyLoadsAndStores(*this, Chain, Dst, Src, ConstantSize->getValue(),
2736 Align, false, DstSV, DstSVOff, SrcSV, SrcSVOff);
2741 // Then check to see if we should lower the memcpy with target-specific
2742 // code. If the target chooses to do this, this is the next best.
2744 TLI.EmitTargetCodeForMemcpy(*this, Chain, Dst, Src, Size, Align,
2746 DstSV, DstSVOff, SrcSV, SrcSVOff);
2750 // If we really need inline code and the target declined to provide it,
2751 // use a (potentially long) sequence of loads and stores.
2753 assert(ConstantSize && "AlwaysInline requires a constant size!");
2754 return getMemcpyLoadsAndStores(*this, Chain, Dst, Src,
2755 ConstantSize->getValue(), Align, true,
2756 DstSV, DstSVOff, SrcSV, SrcSVOff);
2759 // Emit a library call.
2760 TargetLowering::ArgListTy Args;
2761 TargetLowering::ArgListEntry Entry;
2762 Entry.Ty = TLI.getTargetData()->getIntPtrType();
2763 Entry.Node = Dst; Args.push_back(Entry);
2764 Entry.Node = Src; Args.push_back(Entry);
2765 Entry.Node = Size; Args.push_back(Entry);
2766 std::pair<SDOperand,SDOperand> CallResult =
2767 TLI.LowerCallTo(Chain, Type::VoidTy,
2768 false, false, false, CallingConv::C, false,
2769 getExternalSymbol("memcpy", TLI.getPointerTy()),
2771 return CallResult.second;
2774 SDOperand SelectionDAG::getMemmove(SDOperand Chain, SDOperand Dst,
2775 SDOperand Src, SDOperand Size,
2777 const Value *DstSV, uint64_t DstSVOff,
2778 const Value *SrcSV, uint64_t SrcSVOff) {
2780 // TODO: Optimize small memmove cases with simple loads and stores,
2781 // ensuring that all loads precede all stores. This can cause severe
2782 // register pressure, so targets should be careful with the size limit.
2784 // Then check to see if we should lower the memmove with target-specific
2785 // code. If the target chooses to do this, this is the next best.
2787 TLI.EmitTargetCodeForMemmove(*this, Chain, Dst, Src, Size, Align,
2788 DstSV, DstSVOff, SrcSV, SrcSVOff);
2792 // Emit a library call.
2793 TargetLowering::ArgListTy Args;
2794 TargetLowering::ArgListEntry Entry;
2795 Entry.Ty = TLI.getTargetData()->getIntPtrType();
2796 Entry.Node = Dst; Args.push_back(Entry);
2797 Entry.Node = Src; Args.push_back(Entry);
2798 Entry.Node = Size; Args.push_back(Entry);
2799 std::pair<SDOperand,SDOperand> CallResult =
2800 TLI.LowerCallTo(Chain, Type::VoidTy,
2801 false, false, false, CallingConv::C, false,
2802 getExternalSymbol("memmove", TLI.getPointerTy()),
2804 return CallResult.second;
2807 SDOperand SelectionDAG::getMemset(SDOperand Chain, SDOperand Dst,
2808 SDOperand Src, SDOperand Size,
2810 const Value *DstSV, uint64_t DstSVOff) {
2812 // Check to see if we should lower the memset to stores first.
2813 // For cases within the target-specified limits, this is the best choice.
2814 ConstantSDNode *ConstantSize = dyn_cast<ConstantSDNode>(Size);
2816 // Memset with size zero? Just return the original chain.
2817 if (ConstantSize->isNullValue())
2821 getMemsetStores(*this, Chain, Dst, Src, ConstantSize->getValue(), Align,
2827 // Then check to see if we should lower the memset with target-specific
2828 // code. If the target chooses to do this, this is the next best.
2830 TLI.EmitTargetCodeForMemset(*this, Chain, Dst, Src, Size, Align,
2835 // Emit a library call.
2836 const Type *IntPtrTy = TLI.getTargetData()->getIntPtrType();
2837 TargetLowering::ArgListTy Args;
2838 TargetLowering::ArgListEntry Entry;
2839 Entry.Node = Dst; Entry.Ty = IntPtrTy;
2840 Args.push_back(Entry);
2841 // Extend or truncate the argument to be an i32 value for the call.
2842 if (Src.getValueType() > MVT::i32)
2843 Src = getNode(ISD::TRUNCATE, MVT::i32, Src);
2845 Src = getNode(ISD::ZERO_EXTEND, MVT::i32, Src);
2846 Entry.Node = Src; Entry.Ty = Type::Int32Ty; Entry.isSExt = true;
2847 Args.push_back(Entry);
2848 Entry.Node = Size; Entry.Ty = IntPtrTy; Entry.isSExt = false;
2849 Args.push_back(Entry);
2850 std::pair<SDOperand,SDOperand> CallResult =
2851 TLI.LowerCallTo(Chain, Type::VoidTy,
2852 false, false, false, CallingConv::C, false,
2853 getExternalSymbol("memset", TLI.getPointerTy()),
2855 return CallResult.second;
2858 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2859 SDOperand Ptr, SDOperand Cmp,
2860 SDOperand Swp, MVT::ValueType VT) {
2861 assert(Opcode == ISD::ATOMIC_LCS && "Invalid Atomic Op");
2862 assert(Cmp.getValueType() == Swp.getValueType() && "Invalid Atomic Op Types");
2863 SDVTList VTs = getVTList(Cmp.getValueType(), MVT::Other);
2864 FoldingSetNodeID ID;
2865 SDOperand Ops[] = {Chain, Ptr, Cmp, Swp};
2866 AddNodeIDNode(ID, Opcode, VTs, Ops, 4);
2867 ID.AddInteger((unsigned int)VT);
2869 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2870 return SDOperand(E, 0);
2871 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Cmp, Swp, VT);
2872 CSEMap.InsertNode(N, IP);
2873 AllNodes.push_back(N);
2874 return SDOperand(N, 0);
2877 SDOperand SelectionDAG::getAtomic(unsigned Opcode, SDOperand Chain,
2878 SDOperand Ptr, SDOperand Val,
2879 MVT::ValueType VT) {
2880 assert(( Opcode == ISD::ATOMIC_LAS || Opcode == ISD::ATOMIC_LSS
2881 || Opcode == ISD::ATOMIC_SWAP || Opcode == ISD::ATOMIC_LOAD_AND
2882 || Opcode == ISD::ATOMIC_LOAD_OR || Opcode == ISD::ATOMIC_LOAD_XOR
2883 || Opcode == ISD::ATOMIC_LOAD_MIN || Opcode == ISD::ATOMIC_LOAD_MAX
2884 || Opcode == ISD::ATOMIC_LOAD_UMIN || Opcode == ISD::ATOMIC_LOAD_UMAX)
2885 && "Invalid Atomic Op");
2886 SDVTList VTs = getVTList(Val.getValueType(), MVT::Other);
2887 FoldingSetNodeID ID;
2888 SDOperand Ops[] = {Chain, Ptr, Val};
2889 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
2890 ID.AddInteger((unsigned int)VT);
2892 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2893 return SDOperand(E, 0);
2894 SDNode* N = new AtomicSDNode(Opcode, VTs, Chain, Ptr, Val, VT);
2895 CSEMap.InsertNode(N, IP);
2896 AllNodes.push_back(N);
2897 return SDOperand(N, 0);
2901 SelectionDAG::getLoad(ISD::MemIndexedMode AM, ISD::LoadExtType ExtType,
2902 MVT::ValueType VT, SDOperand Chain,
2903 SDOperand Ptr, SDOperand Offset,
2904 const Value *SV, int SVOffset, MVT::ValueType EVT,
2905 bool isVolatile, unsigned Alignment) {
2906 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2908 if (VT != MVT::iPTR) {
2909 Ty = MVT::getTypeForValueType(VT);
2911 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
2912 assert(PT && "Value for load must be a pointer");
2913 Ty = PT->getElementType();
2915 assert(Ty && "Could not get type information for load");
2916 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
2920 ExtType = ISD::NON_EXTLOAD;
2921 } else if (ExtType == ISD::NON_EXTLOAD) {
2922 assert(VT == EVT && "Non-extending load from different memory type!");
2925 if (MVT::isVector(VT))
2926 assert(EVT == MVT::getVectorElementType(VT) && "Invalid vector extload!");
2928 assert(MVT::getSizeInBits(EVT) < MVT::getSizeInBits(VT) &&
2929 "Should only be an extending load, not truncating!");
2930 assert((ExtType == ISD::EXTLOAD || MVT::isInteger(VT)) &&
2931 "Cannot sign/zero extend a FP/Vector load!");
2932 assert(MVT::isInteger(VT) == MVT::isInteger(EVT) &&
2933 "Cannot convert from FP to Int or Int -> FP!");
2936 bool Indexed = AM != ISD::UNINDEXED;
2937 assert(Indexed || Offset.getOpcode() == ISD::UNDEF &&
2938 "Unindexed load with an offset!");
2940 SDVTList VTs = Indexed ?
2941 getVTList(VT, Ptr.getValueType(), MVT::Other) : getVTList(VT, MVT::Other);
2942 SDOperand Ops[] = { Chain, Ptr, Offset };
2943 FoldingSetNodeID ID;
2944 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
2946 ID.AddInteger(ExtType);
2947 ID.AddInteger((unsigned int)EVT);
2948 ID.AddInteger(Alignment);
2949 ID.AddInteger(isVolatile);
2951 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2952 return SDOperand(E, 0);
2953 SDNode *N = new LoadSDNode(Ops, VTs, AM, ExtType, EVT, SV, SVOffset,
2954 Alignment, isVolatile);
2955 CSEMap.InsertNode(N, IP);
2956 AllNodes.push_back(N);
2957 return SDOperand(N, 0);
2960 SDOperand SelectionDAG::getLoad(MVT::ValueType VT,
2961 SDOperand Chain, SDOperand Ptr,
2962 const Value *SV, int SVOffset,
2963 bool isVolatile, unsigned Alignment) {
2964 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2965 return getLoad(ISD::UNINDEXED, ISD::NON_EXTLOAD, VT, Chain, Ptr, Undef,
2966 SV, SVOffset, VT, isVolatile, Alignment);
2969 SDOperand SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, MVT::ValueType VT,
2970 SDOperand Chain, SDOperand Ptr,
2972 int SVOffset, MVT::ValueType EVT,
2973 bool isVolatile, unsigned Alignment) {
2974 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
2975 return getLoad(ISD::UNINDEXED, ExtType, VT, Chain, Ptr, Undef,
2976 SV, SVOffset, EVT, isVolatile, Alignment);
2980 SelectionDAG::getIndexedLoad(SDOperand OrigLoad, SDOperand Base,
2981 SDOperand Offset, ISD::MemIndexedMode AM) {
2982 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
2983 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
2984 "Load is already a indexed load!");
2985 return getLoad(AM, LD->getExtensionType(), OrigLoad.getValueType(),
2986 LD->getChain(), Base, Offset, LD->getSrcValue(),
2987 LD->getSrcValueOffset(), LD->getMemoryVT(),
2988 LD->isVolatile(), LD->getAlignment());
2991 SDOperand SelectionDAG::getStore(SDOperand Chain, SDOperand Val,
2992 SDOperand Ptr, const Value *SV, int SVOffset,
2993 bool isVolatile, unsigned Alignment) {
2994 MVT::ValueType VT = Val.getValueType();
2996 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
2998 if (VT != MVT::iPTR) {
2999 Ty = MVT::getTypeForValueType(VT);
3001 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
3002 assert(PT && "Value for store must be a pointer");
3003 Ty = PT->getElementType();
3005 assert(Ty && "Could not get type information for store");
3006 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
3008 SDVTList VTs = getVTList(MVT::Other);
3009 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
3010 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
3011 FoldingSetNodeID ID;
3012 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
3013 ID.AddInteger(ISD::UNINDEXED);
3014 ID.AddInteger(false);
3015 ID.AddInteger((unsigned int)VT);
3016 ID.AddInteger(Alignment);
3017 ID.AddInteger(isVolatile);
3019 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
3020 return SDOperand(E, 0);
3021 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, false,
3022 VT, SV, SVOffset, Alignment, isVolatile);
3023 CSEMap.InsertNode(N, IP);
3024 AllNodes.push_back(N);
3025 return SDOperand(N, 0);
3028 SDOperand SelectionDAG::getTruncStore(SDOperand Chain, SDOperand Val,
3029 SDOperand Ptr, const Value *SV,
3030 int SVOffset, MVT::ValueType SVT,
3031 bool isVolatile, unsigned Alignment) {
3032 MVT::ValueType VT = Val.getValueType();
3035 return getStore(Chain, Val, Ptr, SV, SVOffset, isVolatile, Alignment);
3037 assert(MVT::getSizeInBits(VT) > MVT::getSizeInBits(SVT) &&
3038 "Not a truncation?");
3039 assert(MVT::isInteger(VT) == MVT::isInteger(SVT) &&
3040 "Can't do FP-INT conversion!");
3042 if (Alignment == 0) { // Ensure that codegen never sees alignment 0
3044 if (VT != MVT::iPTR) {
3045 Ty = MVT::getTypeForValueType(VT);
3047 const PointerType *PT = dyn_cast<PointerType>(SV->getType());
3048 assert(PT && "Value for store must be a pointer");
3049 Ty = PT->getElementType();
3051 assert(Ty && "Could not get type information for store");
3052 Alignment = TLI.getTargetData()->getABITypeAlignment(Ty);
3054 SDVTList VTs = getVTList(MVT::Other);
3055 SDOperand Undef = getNode(ISD::UNDEF, Ptr.getValueType());
3056 SDOperand Ops[] = { Chain, Val, Ptr, Undef };
3057 FoldingSetNodeID ID;
3058 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
3059 ID.AddInteger(ISD::UNINDEXED);
3061 ID.AddInteger((unsigned int)SVT);
3062 ID.AddInteger(Alignment);
3063 ID.AddInteger(isVolatile);
3065 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
3066 return SDOperand(E, 0);
3067 SDNode *N = new StoreSDNode(Ops, VTs, ISD::UNINDEXED, true,
3068 SVT, SV, SVOffset, Alignment, isVolatile);
3069 CSEMap.InsertNode(N, IP);
3070 AllNodes.push_back(N);
3071 return SDOperand(N, 0);
3075 SelectionDAG::getIndexedStore(SDOperand OrigStore, SDOperand Base,
3076 SDOperand Offset, ISD::MemIndexedMode AM) {
3077 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
3078 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
3079 "Store is already a indexed store!");
3080 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
3081 SDOperand Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
3082 FoldingSetNodeID ID;
3083 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
3085 ID.AddInteger(ST->isTruncatingStore());
3086 ID.AddInteger((unsigned int)(ST->getMemoryVT()));
3087 ID.AddInteger(ST->getAlignment());
3088 ID.AddInteger(ST->isVolatile());
3090 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
3091 return SDOperand(E, 0);
3092 SDNode *N = new StoreSDNode(Ops, VTs, AM,
3093 ST->isTruncatingStore(), ST->getMemoryVT(),
3094 ST->getSrcValue(), ST->getSrcValueOffset(),
3095 ST->getAlignment(), ST->isVolatile());
3096 CSEMap.InsertNode(N, IP);
3097 AllNodes.push_back(N);
3098 return SDOperand(N, 0);
3101 SDOperand SelectionDAG::getVAArg(MVT::ValueType VT,
3102 SDOperand Chain, SDOperand Ptr,
3104 SDOperand Ops[] = { Chain, Ptr, SV };
3105 return getNode(ISD::VAARG, getVTList(VT, MVT::Other), Ops, 3);
3108 SDOperand SelectionDAG::getNode(unsigned Opcode, MVT::ValueType VT,
3109 SDOperandPtr Ops, unsigned NumOps) {
3111 case 0: return getNode(Opcode, VT);
3112 case 1: return getNode(Opcode, VT, Ops[0]);
3113 case 2: return getNode(Opcode, VT, Ops[0], Ops[1]);
3114 case 3: return getNode(Opcode, VT, Ops[0], Ops[1], Ops[2]);
3120 case ISD::SELECT_CC: {
3121 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
3122 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
3123 "LHS and RHS of condition must have same type!");
3124 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
3125 "True and False arms of SelectCC must have same type!");
3126 assert(Ops[2].getValueType() == VT &&
3127 "select_cc node must be of same type as true and false value!");
3131 assert(NumOps == 5 && "BR_CC takes 5 operands!");
3132 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
3133 "LHS/RHS of comparison should match types!");
3140 SDVTList VTs = getVTList(VT);
3141 if (VT != MVT::Flag) {
3142 FoldingSetNodeID ID;
3143 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
3145 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
3146 return SDOperand(E, 0);
3147 N = new SDNode(Opcode, VTs, Ops, NumOps);
3148 CSEMap.InsertNode(N, IP);
3150 N = new SDNode(Opcode, VTs, Ops, NumOps);
3152 AllNodes.push_back(N);
3153 return SDOperand(N, 0);
3156 SDOperand SelectionDAG::getNode(unsigned Opcode,
3157 std::vector<MVT::ValueType> &ResultTys,
3158 SDOperandPtr Ops, unsigned NumOps) {
3159 return getNode(Opcode, getNodeValueTypes(ResultTys), ResultTys.size(),
3163 SDOperand SelectionDAG::getNode(unsigned Opcode,
3164 const MVT::ValueType *VTs, unsigned NumVTs,
3165 SDOperandPtr Ops, unsigned NumOps) {
3167 return getNode(Opcode, VTs[0], Ops, NumOps);
3168 return getNode(Opcode, makeVTList(VTs, NumVTs), Ops, NumOps);
3171 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
3172 SDOperandPtr Ops, unsigned NumOps) {
3173 if (VTList.NumVTs == 1)
3174 return getNode(Opcode, VTList.VTs[0], Ops, NumOps);
3177 // FIXME: figure out how to safely handle things like
3178 // int foo(int x) { return 1 << (x & 255); }
3179 // int bar() { return foo(256); }
3181 case ISD::SRA_PARTS:
3182 case ISD::SRL_PARTS:
3183 case ISD::SHL_PARTS:
3184 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
3185 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
3186 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
3187 else if (N3.getOpcode() == ISD::AND)
3188 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
3189 // If the and is only masking out bits that cannot effect the shift,
3190 // eliminate the and.
3191 unsigned NumBits = MVT::getSizeInBits(VT)*2;
3192 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
3193 return getNode(Opcode, VT, N1, N2, N3.getOperand(0));
3199 // Memoize the node unless it returns a flag.
3201 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
3202 FoldingSetNodeID ID;
3203 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
3205 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
3206 return SDOperand(E, 0);
3208 N = new UnarySDNode(Opcode, VTList, Ops[0]);
3209 else if (NumOps == 2)
3210 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
3211 else if (NumOps == 3)
3212 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
3214 N = new SDNode(Opcode, VTList, Ops, NumOps);
3215 CSEMap.InsertNode(N, IP);
3218 N = new UnarySDNode(Opcode, VTList, Ops[0]);
3219 else if (NumOps == 2)
3220 N = new BinarySDNode(Opcode, VTList, Ops[0], Ops[1]);
3221 else if (NumOps == 3)
3222 N = new TernarySDNode(Opcode, VTList, Ops[0], Ops[1], Ops[2]);
3224 N = new SDNode(Opcode, VTList, Ops, NumOps);
3226 AllNodes.push_back(N);
3227 return SDOperand(N, 0);
3230 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList) {
3231 return getNode(Opcode, VTList, (SDOperand*)0, 0);
3234 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
3236 SDOperand Ops[] = { N1 };
3237 return getNode(Opcode, VTList, Ops, 1);
3240 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
3241 SDOperand N1, SDOperand N2) {
3242 SDOperand Ops[] = { N1, N2 };
3243 return getNode(Opcode, VTList, Ops, 2);
3246 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
3247 SDOperand N1, SDOperand N2, SDOperand N3) {
3248 SDOperand Ops[] = { N1, N2, N3 };
3249 return getNode(Opcode, VTList, Ops, 3);
3252 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
3253 SDOperand N1, SDOperand N2, SDOperand N3,
3255 SDOperand Ops[] = { N1, N2, N3, N4 };
3256 return getNode(Opcode, VTList, Ops, 4);
3259 SDOperand SelectionDAG::getNode(unsigned Opcode, SDVTList VTList,
3260 SDOperand N1, SDOperand N2, SDOperand N3,
3261 SDOperand N4, SDOperand N5) {
3262 SDOperand Ops[] = { N1, N2, N3, N4, N5 };
3263 return getNode(Opcode, VTList, Ops, 5);
3266 SDVTList SelectionDAG::getVTList(MVT::ValueType VT) {
3267 return makeVTList(SDNode::getValueTypeList(VT), 1);
3270 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2) {
3271 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
3272 E = VTList.end(); I != E; ++I) {
3273 if (I->size() == 2 && (*I)[0] == VT1 && (*I)[1] == VT2)
3274 return makeVTList(&(*I)[0], 2);
3276 std::vector<MVT::ValueType> V;
3279 VTList.push_front(V);
3280 return makeVTList(&(*VTList.begin())[0], 2);
3282 SDVTList SelectionDAG::getVTList(MVT::ValueType VT1, MVT::ValueType VT2,
3283 MVT::ValueType VT3) {
3284 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
3285 E = VTList.end(); I != E; ++I) {
3286 if (I->size() == 3 && (*I)[0] == VT1 && (*I)[1] == VT2 &&
3288 return makeVTList(&(*I)[0], 3);
3290 std::vector<MVT::ValueType> V;
3294 VTList.push_front(V);
3295 return makeVTList(&(*VTList.begin())[0], 3);
3298 SDVTList SelectionDAG::getVTList(const MVT::ValueType *VTs, unsigned NumVTs) {
3300 case 0: assert(0 && "Cannot have nodes without results!");
3301 case 1: return getVTList(VTs[0]);
3302 case 2: return getVTList(VTs[0], VTs[1]);
3303 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
3307 for (std::list<std::vector<MVT::ValueType> >::iterator I = VTList.begin(),
3308 E = VTList.end(); I != E; ++I) {
3309 if (I->size() != NumVTs || VTs[0] != (*I)[0] || VTs[1] != (*I)[1]) continue;
3311 bool NoMatch = false;
3312 for (unsigned i = 2; i != NumVTs; ++i)
3313 if (VTs[i] != (*I)[i]) {
3318 return makeVTList(&*I->begin(), NumVTs);
3321 VTList.push_front(std::vector<MVT::ValueType>(VTs, VTs+NumVTs));
3322 return makeVTList(&*VTList.begin()->begin(), NumVTs);
3326 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
3327 /// specified operands. If the resultant node already exists in the DAG,
3328 /// this does not modify the specified node, instead it returns the node that
3329 /// already exists. If the resultant node does not exist in the DAG, the
3330 /// input node is returned. As a degenerate case, if you specify the same
3331 /// input operands as the node already has, the input node is returned.
3332 SDOperand SelectionDAG::
3333 UpdateNodeOperands(SDOperand InN, SDOperand Op) {
3334 SDNode *N = InN.Val;
3335 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
3337 // Check to see if there is no change.
3338 if (Op == N->getOperand(0)) return InN;
3340 // See if the modified node already exists.
3341 void *InsertPos = 0;
3342 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
3343 return SDOperand(Existing, InN.ResNo);
3345 // Nope it doesn't. Remove the node from it's current place in the maps.
3347 RemoveNodeFromCSEMaps(N);
3349 // Now we update the operands.
3350 N->OperandList[0].getVal()->removeUser(0, N);
3351 N->OperandList[0] = Op;
3352 N->OperandList[0].setUser(N);
3353 Op.Val->addUser(0, N);
3355 // If this gets put into a CSE map, add it.
3356 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
3360 SDOperand SelectionDAG::
3361 UpdateNodeOperands(SDOperand InN, SDOperand Op1, SDOperand Op2) {
3362 SDNode *N = InN.Val;
3363 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
3365 // Check to see if there is no change.
3366 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
3367 return InN; // No operands changed, just return the input node.
3369 // See if the modified node already exists.
3370 void *InsertPos = 0;
3371 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
3372 return SDOperand(Existing, InN.ResNo);
3374 // Nope it doesn't. Remove the node from it's current place in the maps.
3376 RemoveNodeFromCSEMaps(N);
3378 // Now we update the operands.
3379 if (N->OperandList[0] != Op1) {
3380 N->OperandList[0].getVal()->removeUser(0, N);
3381 N->OperandList[0] = Op1;
3382 N->OperandList[0].setUser(N);
3383 Op1.Val->addUser(0, N);
3385 if (N->OperandList[1] != Op2) {
3386 N->OperandList[1].getVal()->removeUser(1, N);
3387 N->OperandList[1] = Op2;
3388 N->OperandList[1].setUser(N);
3389 Op2.Val->addUser(1, N);
3392 // If this gets put into a CSE map, add it.
3393 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
3397 SDOperand SelectionDAG::
3398 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2, SDOperand Op3) {
3399 SDOperand Ops[] = { Op1, Op2, Op3 };
3400 return UpdateNodeOperands(N, Ops, 3);
3403 SDOperand SelectionDAG::
3404 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
3405 SDOperand Op3, SDOperand Op4) {
3406 SDOperand Ops[] = { Op1, Op2, Op3, Op4 };
3407 return UpdateNodeOperands(N, Ops, 4);
3410 SDOperand SelectionDAG::
3411 UpdateNodeOperands(SDOperand N, SDOperand Op1, SDOperand Op2,
3412 SDOperand Op3, SDOperand Op4, SDOperand Op5) {
3413 SDOperand Ops[] = { Op1, Op2, Op3, Op4, Op5 };
3414 return UpdateNodeOperands(N, Ops, 5);
3417 SDOperand SelectionDAG::
3418 UpdateNodeOperands(SDOperand InN, SDOperandPtr Ops, unsigned NumOps) {
3419 SDNode *N = InN.Val;
3420 assert(N->getNumOperands() == NumOps &&
3421 "Update with wrong number of operands");
3423 // Check to see if there is no change.
3424 bool AnyChange = false;
3425 for (unsigned i = 0; i != NumOps; ++i) {
3426 if (Ops[i] != N->getOperand(i)) {
3432 // No operands changed, just return the input node.
3433 if (!AnyChange) return InN;
3435 // See if the modified node already exists.
3436 void *InsertPos = 0;
3437 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
3438 return SDOperand(Existing, InN.ResNo);
3440 // Nope it doesn't. Remove the node from its current place in the maps.
3442 RemoveNodeFromCSEMaps(N);
3444 // Now we update the operands.
3445 for (unsigned i = 0; i != NumOps; ++i) {
3446 if (N->OperandList[i] != Ops[i]) {
3447 N->OperandList[i].getVal()->removeUser(i, N);
3448 N->OperandList[i] = Ops[i];
3449 N->OperandList[i].setUser(N);
3450 Ops[i].Val->addUser(i, N);
3454 // If this gets put into a CSE map, add it.
3455 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
3459 /// MorphNodeTo - This frees the operands of the current node, resets the
3460 /// opcode, types, and operands to the specified value. This should only be
3461 /// used by the SelectionDAG class.
3462 void SDNode::MorphNodeTo(unsigned Opc, SDVTList L,
3463 SDOperandPtr Ops, unsigned NumOps) {
3466 NumValues = L.NumVTs;
3468 // Clear the operands list, updating used nodes to remove this from their
3470 for (op_iterator I = op_begin(), E = op_end(); I != E; ++I)
3471 I->getVal()->removeUser(std::distance(op_begin(), I), this);
3473 // If NumOps is larger than the # of operands we currently have, reallocate
3474 // the operand list.
3475 if (NumOps > NumOperands) {
3476 if (OperandsNeedDelete) {
3477 delete [] OperandList;
3479 OperandList = new SDUse[NumOps];
3480 OperandsNeedDelete = true;
3483 // Assign the new operands.
3484 NumOperands = NumOps;
3486 for (unsigned i = 0, e = NumOps; i != e; ++i) {
3487 OperandList[i] = Ops[i];
3488 OperandList[i].setUser(this);
3489 SDNode *N = OperandList[i].getVal();
3490 N->addUser(i, this);
3495 /// SelectNodeTo - These are used for target selectors to *mutate* the
3496 /// specified node to have the specified return type, Target opcode, and
3497 /// operands. Note that target opcodes are stored as
3498 /// ISD::BUILTIN_OP_END+TargetOpcode in the node opcode field.
3500 /// Note that SelectNodeTo returns the resultant node. If there is already a
3501 /// node of the specified opcode and operands, it returns that node instead of
3502 /// the current one.
3503 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3504 MVT::ValueType VT) {
3505 SDVTList VTs = getVTList(VT);
3506 FoldingSetNodeID ID;
3507 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, (SDOperand*)0, 0);
3509 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3512 RemoveNodeFromCSEMaps(N);
3514 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, SDOperandPtr(), 0);
3516 CSEMap.InsertNode(N, IP);
3520 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3521 MVT::ValueType VT, SDOperand Op1) {
3522 // If an identical node already exists, use it.
3523 SDVTList VTs = getVTList(VT);
3524 SDOperand Ops[] = { Op1 };
3526 FoldingSetNodeID ID;
3527 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3529 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3532 RemoveNodeFromCSEMaps(N);
3533 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 1);
3534 CSEMap.InsertNode(N, IP);
3538 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3539 MVT::ValueType VT, SDOperand Op1,
3541 // If an identical node already exists, use it.
3542 SDVTList VTs = getVTList(VT);
3543 SDOperand Ops[] = { Op1, Op2 };
3545 FoldingSetNodeID ID;
3546 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3548 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3551 RemoveNodeFromCSEMaps(N);
3553 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3555 CSEMap.InsertNode(N, IP); // Memoize the new node.
3559 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3560 MVT::ValueType VT, SDOperand Op1,
3561 SDOperand Op2, SDOperand Op3) {
3562 // If an identical node already exists, use it.
3563 SDVTList VTs = getVTList(VT);
3564 SDOperand Ops[] = { Op1, Op2, Op3 };
3565 FoldingSetNodeID ID;
3566 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3568 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3571 RemoveNodeFromCSEMaps(N);
3573 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3575 CSEMap.InsertNode(N, IP); // Memoize the new node.
3579 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3580 MVT::ValueType VT, SDOperandPtr Ops,
3582 // If an identical node already exists, use it.
3583 SDVTList VTs = getVTList(VT);
3584 FoldingSetNodeID ID;
3585 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3587 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3590 RemoveNodeFromCSEMaps(N);
3591 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, NumOps);
3593 CSEMap.InsertNode(N, IP); // Memoize the new node.
3597 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3598 MVT::ValueType VT1, MVT::ValueType VT2,
3599 SDOperand Op1, SDOperand Op2) {
3600 SDVTList VTs = getVTList(VT1, VT2);
3601 FoldingSetNodeID ID;
3602 SDOperand Ops[] = { Op1, Op2 };
3603 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3605 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3608 RemoveNodeFromCSEMaps(N);
3609 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 2);
3610 CSEMap.InsertNode(N, IP); // Memoize the new node.
3614 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned TargetOpc,
3615 MVT::ValueType VT1, MVT::ValueType VT2,
3616 SDOperand Op1, SDOperand Op2,
3618 // If an identical node already exists, use it.
3619 SDVTList VTs = getVTList(VT1, VT2);
3620 SDOperand Ops[] = { Op1, Op2, Op3 };
3621 FoldingSetNodeID ID;
3622 AddNodeIDNode(ID, ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3624 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
3627 RemoveNodeFromCSEMaps(N);
3629 N->MorphNodeTo(ISD::BUILTIN_OP_END+TargetOpc, VTs, Ops, 3);
3630 CSEMap.InsertNode(N, IP); // Memoize the new node.
3635 /// getTargetNode - These are used for target selectors to create a new node
3636 /// with specified return type(s), target opcode, and operands.
3638 /// Note that getTargetNode returns the resultant node. If there is already a
3639 /// node of the specified opcode and operands, it returns that node instead of
3640 /// the current one.
3641 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT) {
3642 return getNode(ISD::BUILTIN_OP_END+Opcode, VT).Val;
3644 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3646 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1).Val;
3648 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3649 SDOperand Op1, SDOperand Op2) {
3650 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2).Val;
3652 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3653 SDOperand Op1, SDOperand Op2,
3655 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Op1, Op2, Op3).Val;
3657 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT,
3658 SDOperandPtr Ops, unsigned NumOps) {
3659 return getNode(ISD::BUILTIN_OP_END+Opcode, VT, Ops, NumOps).Val;
3661 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3662 MVT::ValueType VT2) {
3663 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3665 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op, 0).Val;
3667 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3668 MVT::ValueType VT2, SDOperand Op1) {
3669 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3670 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, &Op1, 1).Val;
3672 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3673 MVT::ValueType VT2, SDOperand Op1,
3675 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3676 SDOperand Ops[] = { Op1, Op2 };
3677 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 2).Val;
3679 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3680 MVT::ValueType VT2, SDOperand Op1,
3681 SDOperand Op2, SDOperand Op3) {
3682 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3683 SDOperand Ops[] = { Op1, Op2, Op3 };
3684 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, 3).Val;
3686 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3688 SDOperandPtr Ops, unsigned NumOps) {
3689 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2);
3690 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 2, Ops, NumOps).Val;
3692 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3693 MVT::ValueType VT2, MVT::ValueType VT3,
3694 SDOperand Op1, SDOperand Op2) {
3695 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3696 SDOperand Ops[] = { Op1, Op2 };
3697 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 2).Val;
3699 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3700 MVT::ValueType VT2, MVT::ValueType VT3,
3701 SDOperand Op1, SDOperand Op2,
3703 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3704 SDOperand Ops[] = { Op1, Op2, Op3 };
3705 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, 3).Val;
3707 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3708 MVT::ValueType VT2, MVT::ValueType VT3,
3709 SDOperandPtr Ops, unsigned NumOps) {
3710 const MVT::ValueType *VTs = getNodeValueTypes(VT1, VT2, VT3);
3711 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 3, Ops, NumOps).Val;
3713 SDNode *SelectionDAG::getTargetNode(unsigned Opcode, MVT::ValueType VT1,
3714 MVT::ValueType VT2, MVT::ValueType VT3,
3716 SDOperandPtr Ops, unsigned NumOps) {
3717 std::vector<MVT::ValueType> VTList;
3718 VTList.push_back(VT1);
3719 VTList.push_back(VT2);
3720 VTList.push_back(VT3);
3721 VTList.push_back(VT4);
3722 const MVT::ValueType *VTs = getNodeValueTypes(VTList);
3723 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, 4, Ops, NumOps).Val;
3725 SDNode *SelectionDAG::getTargetNode(unsigned Opcode,
3726 std::vector<MVT::ValueType> &ResultTys,
3727 SDOperandPtr Ops, unsigned NumOps) {
3728 const MVT::ValueType *VTs = getNodeValueTypes(ResultTys);
3729 return getNode(ISD::BUILTIN_OP_END+Opcode, VTs, ResultTys.size(),
3733 /// getNodeIfExists - Get the specified node if it's already available, or
3734 /// else return NULL.
3735 SDNode *SelectionDAG::getNodeIfExists(unsigned Opcode, SDVTList VTList,
3736 SDOperandPtr Ops, unsigned NumOps) {
3737 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
3738 FoldingSetNodeID ID;
3739 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
3741 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
3748 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3749 /// This can cause recursive merging of nodes in the DAG.
3751 /// This version assumes From has a single result value.
3753 void SelectionDAG::ReplaceAllUsesWith(SDOperand FromN, SDOperand To,
3754 DAGUpdateListener *UpdateListener) {
3755 SDNode *From = FromN.Val;
3756 assert(From->getNumValues() == 1 && FromN.ResNo == 0 &&
3757 "Cannot replace with this method!");
3758 assert(From != To.Val && "Cannot replace uses of with self");
3760 while (!From->use_empty()) {
3761 SDNode::use_iterator UI = From->use_begin();
3762 SDNode *U = UI->getUser();
3764 // This node is about to morph, remove its old self from the CSE maps.
3765 RemoveNodeFromCSEMaps(U);
3767 for (SDNode::op_iterator I = U->op_begin(), E = U->op_end();
3768 I != E; ++I, ++operandNum)
3769 if (I->getVal() == From) {
3770 From->removeUser(operandNum, U);
3773 To.Val->addUser(operandNum, U);
3776 // Now that we have modified U, add it back to the CSE maps. If it already
3777 // exists there, recursively merge the results together.
3778 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3779 ReplaceAllUsesWith(U, Existing, UpdateListener);
3780 // U is now dead. Inform the listener if it exists and delete it.
3782 UpdateListener->NodeDeleted(U);
3783 DeleteNodeNotInCSEMaps(U);
3785 // If the node doesn't already exist, we updated it. Inform a listener if
3788 UpdateListener->NodeUpdated(U);
3793 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3794 /// This can cause recursive merging of nodes in the DAG.
3796 /// This version assumes From/To have matching types and numbers of result
3799 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
3800 DAGUpdateListener *UpdateListener) {
3801 assert(From != To && "Cannot replace uses of with self");
3802 assert(From->getNumValues() == To->getNumValues() &&
3803 "Cannot use this version of ReplaceAllUsesWith!");
3804 if (From->getNumValues() == 1) // If possible, use the faster version.
3805 return ReplaceAllUsesWith(SDOperand(From, 0), SDOperand(To, 0),
3808 while (!From->use_empty()) {
3809 SDNode::use_iterator UI = From->use_begin();
3810 SDNode *U = UI->getUser();
3812 // This node is about to morph, remove its old self from the CSE maps.
3813 RemoveNodeFromCSEMaps(U);
3815 for (SDNode::op_iterator I = U->op_begin(), E = U->op_end();
3816 I != E; ++I, ++operandNum)
3817 if (I->getVal() == From) {
3818 From->removeUser(operandNum, U);
3820 To->addUser(operandNum, U);
3823 // Now that we have modified U, add it back to the CSE maps. If it already
3824 // exists there, recursively merge the results together.
3825 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3826 ReplaceAllUsesWith(U, Existing, UpdateListener);
3827 // U is now dead. Inform the listener if it exists and delete it.
3829 UpdateListener->NodeDeleted(U);
3830 DeleteNodeNotInCSEMaps(U);
3832 // If the node doesn't already exist, we updated it. Inform a listener if
3835 UpdateListener->NodeUpdated(U);
3840 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
3841 /// This can cause recursive merging of nodes in the DAG.
3843 /// This version can replace From with any result values. To must match the
3844 /// number and types of values returned by From.
3845 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
3847 DAGUpdateListener *UpdateListener) {
3848 if (From->getNumValues() == 1) // Handle the simple case efficiently.
3849 return ReplaceAllUsesWith(SDOperand(From, 0), To[0], UpdateListener);
3851 while (!From->use_empty()) {
3852 SDNode::use_iterator UI = From->use_begin();
3853 SDNode *U = UI->getUser();
3855 // This node is about to morph, remove its old self from the CSE maps.
3856 RemoveNodeFromCSEMaps(U);
3858 for (SDNode::op_iterator I = U->op_begin(), E = U->op_end();
3859 I != E; ++I, ++operandNum)
3860 if (I->getVal() == From) {
3861 const SDOperand &ToOp = To[I->getSDOperand().ResNo];
3862 From->removeUser(operandNum, U);
3865 ToOp.Val->addUser(operandNum, U);
3868 // Now that we have modified U, add it back to the CSE maps. If it already
3869 // exists there, recursively merge the results together.
3870 if (SDNode *Existing = AddNonLeafNodeToCSEMaps(U)) {
3871 ReplaceAllUsesWith(U, Existing, UpdateListener);
3872 // U is now dead. Inform the listener if it exists and delete it.
3874 UpdateListener->NodeDeleted(U);
3875 DeleteNodeNotInCSEMaps(U);
3877 // If the node doesn't already exist, we updated it. Inform a listener if
3880 UpdateListener->NodeUpdated(U);
3886 /// ChainedSetUpdaterListener - This class is a DAGUpdateListener that removes
3887 /// any deleted nodes from the set passed into its constructor and recursively
3888 /// notifies another update listener if specified.
3889 class ChainedSetUpdaterListener :
3890 public SelectionDAG::DAGUpdateListener {
3891 SmallSetVector<SDNode*, 16> &Set;
3892 SelectionDAG::DAGUpdateListener *Chain;
3894 ChainedSetUpdaterListener(SmallSetVector<SDNode*, 16> &set,
3895 SelectionDAG::DAGUpdateListener *chain)
3896 : Set(set), Chain(chain) {}
3898 virtual void NodeDeleted(SDNode *N) {
3900 if (Chain) Chain->NodeDeleted(N);
3902 virtual void NodeUpdated(SDNode *N) {
3903 if (Chain) Chain->NodeUpdated(N);
3908 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
3909 /// uses of other values produced by From.Val alone. The Deleted vector is
3910 /// handled the same way as for ReplaceAllUsesWith.
3911 void SelectionDAG::ReplaceAllUsesOfValueWith(SDOperand From, SDOperand To,
3912 DAGUpdateListener *UpdateListener){
3913 assert(From != To && "Cannot replace a value with itself");
3915 // Handle the simple, trivial, case efficiently.
3916 if (From.Val->getNumValues() == 1) {
3917 ReplaceAllUsesWith(From, To, UpdateListener);
3921 if (From.use_empty()) return;
3923 // Get all of the users of From.Val. We want these in a nice,
3924 // deterministically ordered and uniqued set, so we use a SmallSetVector.
3925 SmallSetVector<SDNode*, 16> Users;
3926 for (SDNode::use_iterator UI = From.Val->use_begin(),
3927 E = From.Val->use_end(); UI != E; ++UI) {
3928 SDNode *User = UI->getUser();
3929 if (!Users.count(User))
3933 // When one of the recursive merges deletes nodes from the graph, we need to
3934 // make sure that UpdateListener is notified *and* that the node is removed
3935 // from Users if present. CSUL does this.
3936 ChainedSetUpdaterListener CSUL(Users, UpdateListener);
3938 while (!Users.empty()) {
3939 // We know that this user uses some value of From. If it is the right
3940 // value, update it.
3941 SDNode *User = Users.back();
3944 // Scan for an operand that matches From.
3945 SDNode::op_iterator Op = User->op_begin(), E = User->op_end();
3946 for (; Op != E; ++Op)
3947 if (*Op == From) break;
3949 // If there are no matches, the user must use some other result of From.
3950 if (Op == E) continue;
3952 // Okay, we know this user needs to be updated. Remove its old self
3953 // from the CSE maps.
3954 RemoveNodeFromCSEMaps(User);
3956 // Update all operands that match "From" in case there are multiple uses.
3957 for (; Op != E; ++Op) {
3959 From.Val->removeUser(Op-User->op_begin(), User);
3962 To.Val->addUser(Op-User->op_begin(), User);
3966 // Now that we have modified User, add it back to the CSE maps. If it
3967 // already exists there, recursively merge the results together.
3968 SDNode *Existing = AddNonLeafNodeToCSEMaps(User);
3970 if (UpdateListener) UpdateListener->NodeUpdated(User);
3971 continue; // Continue on to next user.
3974 // If there was already an existing matching node, use ReplaceAllUsesWith
3975 // to replace the dead one with the existing one. This can cause
3976 // recursive merging of other unrelated nodes down the line. The merging
3977 // can cause deletion of nodes that used the old value. To handle this, we
3978 // use CSUL to remove them from the Users set.
3979 ReplaceAllUsesWith(User, Existing, &CSUL);
3981 // User is now dead. Notify a listener if present.
3982 if (UpdateListener) UpdateListener->NodeDeleted(User);
3983 DeleteNodeNotInCSEMaps(User);
3987 /// AssignNodeIds - Assign a unique node id for each node in the DAG based on
3988 /// their allnodes order. It returns the maximum id.
3989 unsigned SelectionDAG::AssignNodeIds() {
3991 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I){
3998 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
3999 /// based on their topological order. It returns the maximum id and a vector
4000 /// of the SDNodes* in assigned order by reference.
4001 unsigned SelectionDAG::AssignTopologicalOrder(std::vector<SDNode*> &TopOrder) {
4002 unsigned DAGSize = AllNodes.size();
4003 std::vector<unsigned> InDegree(DAGSize);
4004 std::vector<SDNode*> Sources;
4006 // Use a two pass approach to avoid using a std::map which is slow.
4008 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I){
4011 unsigned Degree = N->use_size();
4012 InDegree[N->getNodeId()] = Degree;
4014 Sources.push_back(N);
4018 while (!Sources.empty()) {
4019 SDNode *N = Sources.back();
4021 TopOrder.push_back(N);
4022 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I) {
4023 SDNode *P = I->getVal();
4024 unsigned Degree = --InDegree[P->getNodeId()];
4026 Sources.push_back(P);
4030 // Second pass, assign the actual topological order as node ids.
4032 for (std::vector<SDNode*>::iterator TI = TopOrder.begin(),TE = TopOrder.end();
4034 (*TI)->setNodeId(Id++);
4041 //===----------------------------------------------------------------------===//
4043 //===----------------------------------------------------------------------===//
4045 // Out-of-line virtual method to give class a home.
4046 void SDNode::ANCHOR() {}
4047 void UnarySDNode::ANCHOR() {}
4048 void BinarySDNode::ANCHOR() {}
4049 void TernarySDNode::ANCHOR() {}
4050 void HandleSDNode::ANCHOR() {}
4051 void StringSDNode::ANCHOR() {}
4052 void ConstantSDNode::ANCHOR() {}
4053 void ConstantFPSDNode::ANCHOR() {}
4054 void GlobalAddressSDNode::ANCHOR() {}
4055 void FrameIndexSDNode::ANCHOR() {}
4056 void JumpTableSDNode::ANCHOR() {}
4057 void ConstantPoolSDNode::ANCHOR() {}
4058 void BasicBlockSDNode::ANCHOR() {}
4059 void SrcValueSDNode::ANCHOR() {}
4060 void MemOperandSDNode::ANCHOR() {}
4061 void RegisterSDNode::ANCHOR() {}
4062 void ExternalSymbolSDNode::ANCHOR() {}
4063 void CondCodeSDNode::ANCHOR() {}
4064 void ARG_FLAGSSDNode::ANCHOR() {}
4065 void VTSDNode::ANCHOR() {}
4066 void LoadSDNode::ANCHOR() {}
4067 void StoreSDNode::ANCHOR() {}
4068 void AtomicSDNode::ANCHOR() {}
4070 HandleSDNode::~HandleSDNode() {
4071 SDVTList VTs = { 0, 0 };
4072 MorphNodeTo(ISD::HANDLENODE, VTs, SDOperandPtr(), 0); // Drops operand uses.
4075 GlobalAddressSDNode::GlobalAddressSDNode(bool isTarget, const GlobalValue *GA,
4076 MVT::ValueType VT, int o)
4077 : SDNode(isa<GlobalVariable>(GA) &&
4078 cast<GlobalVariable>(GA)->isThreadLocal() ?
4080 (isTarget ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress) :
4082 (isTarget ? ISD::TargetGlobalAddress : ISD::GlobalAddress),
4083 getSDVTList(VT)), Offset(o) {
4084 TheGlobal = const_cast<GlobalValue*>(GA);
4087 /// getMemOperand - Return a MachineMemOperand object describing the memory
4088 /// reference performed by this load or store.
4089 MachineMemOperand LSBaseSDNode::getMemOperand() const {
4090 int Size = (MVT::getSizeInBits(getMemoryVT()) + 7) >> 3;
4092 getOpcode() == ISD::LOAD ? MachineMemOperand::MOLoad :
4093 MachineMemOperand::MOStore;
4094 if (IsVolatile) Flags |= MachineMemOperand::MOVolatile;
4096 // Check if the load references a frame index, and does not have
4098 const FrameIndexSDNode *FI =
4099 dyn_cast<const FrameIndexSDNode>(getBasePtr().Val);
4100 if (!getSrcValue() && FI)
4101 return MachineMemOperand(PseudoSourceValue::getFixedStack(), Flags,
4102 FI->getIndex(), Size, Alignment);
4104 return MachineMemOperand(getSrcValue(), Flags,
4105 getSrcValueOffset(), Size, Alignment);
4108 /// Profile - Gather unique data for the node.
4110 void SDNode::Profile(FoldingSetNodeID &ID) {
4111 AddNodeIDNode(ID, this);
4114 /// getValueTypeList - Return a pointer to the specified value type.
4116 const MVT::ValueType *SDNode::getValueTypeList(MVT::ValueType VT) {
4117 if (MVT::isExtendedVT(VT)) {
4118 static std::set<MVT::ValueType> EVTs;
4119 return &(*EVTs.insert(VT).first);
4121 static MVT::ValueType VTs[MVT::LAST_VALUETYPE];
4127 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
4128 /// indicated value. This method ignores uses of other values defined by this
4130 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
4131 assert(Value < getNumValues() && "Bad value!");
4133 // If there is only one value, this is easy.
4134 if (getNumValues() == 1)
4135 return use_size() == NUses;
4136 if (use_size() < NUses) return false;
4138 SDOperand TheValue(const_cast<SDNode *>(this), Value);
4140 SmallPtrSet<SDNode*, 32> UsersHandled;
4142 // TODO: Only iterate over uses of a given value of the node
4143 for (SDNode::use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI) {
4144 if (*UI == TheValue) {
4151 // Found exactly the right number of uses?
4156 /// hasAnyUseOfValue - Return true if there are any use of the indicated
4157 /// value. This method ignores uses of other values defined by this operation.
4158 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
4159 assert(Value < getNumValues() && "Bad value!");
4161 if (use_empty()) return false;
4163 SDOperand TheValue(const_cast<SDNode *>(this), Value);
4165 SmallPtrSet<SDNode*, 32> UsersHandled;
4167 for (SDNode::use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI) {
4168 SDNode *User = UI->getUser();
4169 if (User->getNumOperands() == 1 ||
4170 UsersHandled.insert(User)) // First time we've seen this?
4171 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
4172 if (User->getOperand(i) == TheValue) {
4181 /// isOnlyUseOf - Return true if this node is the only use of N.
4183 bool SDNode::isOnlyUseOf(SDNode *N) const {
4185 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
4186 SDNode *User = I->getUser();
4196 /// isOperand - Return true if this node is an operand of N.
4198 bool SDOperand::isOperandOf(SDNode *N) const {
4199 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4200 if (*this == N->getOperand(i))
4205 bool SDNode::isOperandOf(SDNode *N) const {
4206 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
4207 if (this == N->OperandList[i].getVal())
4212 /// reachesChainWithoutSideEffects - Return true if this operand (which must
4213 /// be a chain) reaches the specified operand without crossing any
4214 /// side-effecting instructions. In practice, this looks through token
4215 /// factors and non-volatile loads. In order to remain efficient, this only
4216 /// looks a couple of nodes in, it does not do an exhaustive search.
4217 bool SDOperand::reachesChainWithoutSideEffects(SDOperand Dest,
4218 unsigned Depth) const {
4219 if (*this == Dest) return true;
4221 // Don't search too deeply, we just want to be able to see through
4222 // TokenFactor's etc.
4223 if (Depth == 0) return false;
4225 // If this is a token factor, all inputs to the TF happen in parallel. If any
4226 // of the operands of the TF reach dest, then we can do the xform.
4227 if (getOpcode() == ISD::TokenFactor) {
4228 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
4229 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1))
4234 // Loads don't have side effects, look through them.
4235 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) {
4236 if (!Ld->isVolatile())
4237 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1);
4243 static void findPredecessor(SDNode *N, const SDNode *P, bool &found,
4244 SmallPtrSet<SDNode *, 32> &Visited) {
4245 if (found || !Visited.insert(N))
4248 for (unsigned i = 0, e = N->getNumOperands(); !found && i != e; ++i) {
4249 SDNode *Op = N->getOperand(i).Val;
4254 findPredecessor(Op, P, found, Visited);
4258 /// isPredecessorOf - Return true if this node is a predecessor of N. This node
4259 /// is either an operand of N or it can be reached by recursively traversing
4260 /// up the operands.
4261 /// NOTE: this is an expensive method. Use it carefully.
4262 bool SDNode::isPredecessorOf(SDNode *N) const {
4263 SmallPtrSet<SDNode *, 32> Visited;
4265 findPredecessor(N, this, found, Visited);
4269 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
4270 assert(Num < NumOperands && "Invalid child # of SDNode!");
4271 return cast<ConstantSDNode>(OperandList[Num])->getValue();
4274 std::string SDNode::getOperationName(const SelectionDAG *G) const {
4275 switch (getOpcode()) {
4277 if (getOpcode() < ISD::BUILTIN_OP_END)
4278 return "<<Unknown DAG Node>>";
4281 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
4282 if (getOpcode()-ISD::BUILTIN_OP_END < TII->getNumOpcodes())
4283 return TII->get(getOpcode()-ISD::BUILTIN_OP_END).getName();
4285 TargetLowering &TLI = G->getTargetLoweringInfo();
4287 TLI.getTargetNodeName(getOpcode());
4288 if (Name) return Name;
4291 return "<<Unknown Target Node>>";
4294 case ISD::PREFETCH: return "Prefetch";
4295 case ISD::MEMBARRIER: return "MemBarrier";
4296 case ISD::ATOMIC_LCS: return "AtomicLCS";
4297 case ISD::ATOMIC_LAS: return "AtomicLAS";
4298 case ISD::ATOMIC_LSS: return "AtomicLSS";
4299 case ISD::ATOMIC_LOAD_AND: return "AtomicLoadAnd";
4300 case ISD::ATOMIC_LOAD_OR: return "AtomicLoadOr";
4301 case ISD::ATOMIC_LOAD_XOR: return "AtomicLoadXor";
4302 case ISD::ATOMIC_LOAD_MIN: return "AtomicLoadMin";
4303 case ISD::ATOMIC_LOAD_MAX: return "AtomicLoadMax";
4304 case ISD::ATOMIC_LOAD_UMIN: return "AtomicLoadUMin";
4305 case ISD::ATOMIC_LOAD_UMAX: return "AtomicLoadUMax";
4306 case ISD::ATOMIC_SWAP: return "AtomicSWAP";
4307 case ISD::PCMARKER: return "PCMarker";
4308 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
4309 case ISD::SRCVALUE: return "SrcValue";
4310 case ISD::MEMOPERAND: return "MemOperand";
4311 case ISD::EntryToken: return "EntryToken";
4312 case ISD::TokenFactor: return "TokenFactor";
4313 case ISD::AssertSext: return "AssertSext";
4314 case ISD::AssertZext: return "AssertZext";
4316 case ISD::STRING: return "String";
4317 case ISD::BasicBlock: return "BasicBlock";
4318 case ISD::ARG_FLAGS: return "ArgFlags";
4319 case ISD::VALUETYPE: return "ValueType";
4320 case ISD::Register: return "Register";
4322 case ISD::Constant: return "Constant";
4323 case ISD::ConstantFP: return "ConstantFP";
4324 case ISD::GlobalAddress: return "GlobalAddress";
4325 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
4326 case ISD::FrameIndex: return "FrameIndex";
4327 case ISD::JumpTable: return "JumpTable";
4328 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
4329 case ISD::RETURNADDR: return "RETURNADDR";
4330 case ISD::FRAMEADDR: return "FRAMEADDR";
4331 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
4332 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
4333 case ISD::EHSELECTION: return "EHSELECTION";
4334 case ISD::EH_RETURN: return "EH_RETURN";
4335 case ISD::ConstantPool: return "ConstantPool";
4336 case ISD::ExternalSymbol: return "ExternalSymbol";
4337 case ISD::INTRINSIC_WO_CHAIN: {
4338 unsigned IID = cast<ConstantSDNode>(getOperand(0))->getValue();
4339 return Intrinsic::getName((Intrinsic::ID)IID);
4341 case ISD::INTRINSIC_VOID:
4342 case ISD::INTRINSIC_W_CHAIN: {
4343 unsigned IID = cast<ConstantSDNode>(getOperand(1))->getValue();
4344 return Intrinsic::getName((Intrinsic::ID)IID);
4347 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
4348 case ISD::TargetConstant: return "TargetConstant";
4349 case ISD::TargetConstantFP:return "TargetConstantFP";
4350 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
4351 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
4352 case ISD::TargetFrameIndex: return "TargetFrameIndex";
4353 case ISD::TargetJumpTable: return "TargetJumpTable";
4354 case ISD::TargetConstantPool: return "TargetConstantPool";
4355 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
4357 case ISD::CopyToReg: return "CopyToReg";
4358 case ISD::CopyFromReg: return "CopyFromReg";
4359 case ISD::UNDEF: return "undef";
4360 case ISD::MERGE_VALUES: return "merge_values";
4361 case ISD::INLINEASM: return "inlineasm";
4362 case ISD::LABEL: return "label";
4363 case ISD::DECLARE: return "declare";
4364 case ISD::HANDLENODE: return "handlenode";
4365 case ISD::FORMAL_ARGUMENTS: return "formal_arguments";
4366 case ISD::CALL: return "call";
4369 case ISD::FABS: return "fabs";
4370 case ISD::FNEG: return "fneg";
4371 case ISD::FSQRT: return "fsqrt";
4372 case ISD::FSIN: return "fsin";
4373 case ISD::FCOS: return "fcos";
4374 case ISD::FPOWI: return "fpowi";
4375 case ISD::FPOW: return "fpow";
4378 case ISD::ADD: return "add";
4379 case ISD::SUB: return "sub";
4380 case ISD::MUL: return "mul";
4381 case ISD::MULHU: return "mulhu";
4382 case ISD::MULHS: return "mulhs";
4383 case ISD::SDIV: return "sdiv";
4384 case ISD::UDIV: return "udiv";
4385 case ISD::SREM: return "srem";
4386 case ISD::UREM: return "urem";
4387 case ISD::SMUL_LOHI: return "smul_lohi";
4388 case ISD::UMUL_LOHI: return "umul_lohi";
4389 case ISD::SDIVREM: return "sdivrem";
4390 case ISD::UDIVREM: return "divrem";
4391 case ISD::AND: return "and";
4392 case ISD::OR: return "or";
4393 case ISD::XOR: return "xor";
4394 case ISD::SHL: return "shl";
4395 case ISD::SRA: return "sra";
4396 case ISD::SRL: return "srl";
4397 case ISD::ROTL: return "rotl";
4398 case ISD::ROTR: return "rotr";
4399 case ISD::FADD: return "fadd";
4400 case ISD::FSUB: return "fsub";
4401 case ISD::FMUL: return "fmul";
4402 case ISD::FDIV: return "fdiv";
4403 case ISD::FREM: return "frem";
4404 case ISD::FCOPYSIGN: return "fcopysign";
4405 case ISD::FGETSIGN: return "fgetsign";
4407 case ISD::SETCC: return "setcc";
4408 case ISD::VSETCC: return "vsetcc";
4409 case ISD::SELECT: return "select";
4410 case ISD::SELECT_CC: return "select_cc";
4411 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
4412 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
4413 case ISD::CONCAT_VECTORS: return "concat_vectors";
4414 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
4415 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
4416 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
4417 case ISD::CARRY_FALSE: return "carry_false";
4418 case ISD::ADDC: return "addc";
4419 case ISD::ADDE: return "adde";
4420 case ISD::SUBC: return "subc";
4421 case ISD::SUBE: return "sube";
4422 case ISD::SHL_PARTS: return "shl_parts";
4423 case ISD::SRA_PARTS: return "sra_parts";
4424 case ISD::SRL_PARTS: return "srl_parts";
4426 case ISD::EXTRACT_SUBREG: return "extract_subreg";
4427 case ISD::INSERT_SUBREG: return "insert_subreg";
4429 // Conversion operators.
4430 case ISD::SIGN_EXTEND: return "sign_extend";
4431 case ISD::ZERO_EXTEND: return "zero_extend";
4432 case ISD::ANY_EXTEND: return "any_extend";
4433 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
4434 case ISD::TRUNCATE: return "truncate";
4435 case ISD::FP_ROUND: return "fp_round";
4436 case ISD::FLT_ROUNDS_: return "flt_rounds";
4437 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
4438 case ISD::FP_EXTEND: return "fp_extend";
4440 case ISD::SINT_TO_FP: return "sint_to_fp";
4441 case ISD::UINT_TO_FP: return "uint_to_fp";
4442 case ISD::FP_TO_SINT: return "fp_to_sint";
4443 case ISD::FP_TO_UINT: return "fp_to_uint";
4444 case ISD::BIT_CONVERT: return "bit_convert";
4446 // Control flow instructions
4447 case ISD::BR: return "br";
4448 case ISD::BRIND: return "brind";
4449 case ISD::BR_JT: return "br_jt";
4450 case ISD::BRCOND: return "brcond";
4451 case ISD::BR_CC: return "br_cc";
4452 case ISD::RET: return "ret";
4453 case ISD::CALLSEQ_START: return "callseq_start";
4454 case ISD::CALLSEQ_END: return "callseq_end";
4457 case ISD::LOAD: return "load";
4458 case ISD::STORE: return "store";
4459 case ISD::VAARG: return "vaarg";
4460 case ISD::VACOPY: return "vacopy";
4461 case ISD::VAEND: return "vaend";
4462 case ISD::VASTART: return "vastart";
4463 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
4464 case ISD::EXTRACT_ELEMENT: return "extract_element";
4465 case ISD::BUILD_PAIR: return "build_pair";
4466 case ISD::STACKSAVE: return "stacksave";
4467 case ISD::STACKRESTORE: return "stackrestore";
4468 case ISD::TRAP: return "trap";
4471 case ISD::BSWAP: return "bswap";
4472 case ISD::CTPOP: return "ctpop";
4473 case ISD::CTTZ: return "cttz";
4474 case ISD::CTLZ: return "ctlz";
4477 case ISD::LOCATION: return "location";
4478 case ISD::DEBUG_LOC: return "debug_loc";
4481 case ISD::TRAMPOLINE: return "trampoline";
4484 switch (cast<CondCodeSDNode>(this)->get()) {
4485 default: assert(0 && "Unknown setcc condition!");
4486 case ISD::SETOEQ: return "setoeq";
4487 case ISD::SETOGT: return "setogt";
4488 case ISD::SETOGE: return "setoge";
4489 case ISD::SETOLT: return "setolt";
4490 case ISD::SETOLE: return "setole";
4491 case ISD::SETONE: return "setone";
4493 case ISD::SETO: return "seto";
4494 case ISD::SETUO: return "setuo";
4495 case ISD::SETUEQ: return "setue";
4496 case ISD::SETUGT: return "setugt";
4497 case ISD::SETUGE: return "setuge";
4498 case ISD::SETULT: return "setult";
4499 case ISD::SETULE: return "setule";
4500 case ISD::SETUNE: return "setune";
4502 case ISD::SETEQ: return "seteq";
4503 case ISD::SETGT: return "setgt";
4504 case ISD::SETGE: return "setge";
4505 case ISD::SETLT: return "setlt";
4506 case ISD::SETLE: return "setle";
4507 case ISD::SETNE: return "setne";
4512 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
4521 return "<post-inc>";
4523 return "<post-dec>";
4527 std::string ISD::ArgFlagsTy::getArgFlagsString() {
4528 std::string S = "< ";
4542 if (getByValAlign())
4543 S += "byval-align:" + utostr(getByValAlign()) + " ";
4545 S += "orig-align:" + utostr(getOrigAlign()) + " ";
4547 S += "byval-size:" + utostr(getByValSize()) + " ";
4551 void SDNode::dump() const { dump(0); }
4552 void SDNode::dump(const SelectionDAG *G) const {
4553 cerr << (void*)this << ": ";
4555 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
4557 if (getValueType(i) == MVT::Other)
4560 cerr << MVT::getValueTypeString(getValueType(i));
4562 cerr << " = " << getOperationName(G);
4565 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
4566 if (i) cerr << ", ";
4567 cerr << (void*)getOperand(i).Val;
4568 if (unsigned RN = getOperand(i).ResNo)
4572 if (!isTargetOpcode() && getOpcode() == ISD::VECTOR_SHUFFLE) {
4573 SDNode *Mask = getOperand(2).Val;
4575 for (unsigned i = 0, e = Mask->getNumOperands(); i != e; ++i) {
4577 if (Mask->getOperand(i).getOpcode() == ISD::UNDEF)
4580 cerr << cast<ConstantSDNode>(Mask->getOperand(i))->getValue();
4585 if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
4586 cerr << "<" << CSDN->getValue() << ">";
4587 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
4588 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
4589 cerr << "<" << CSDN->getValueAPF().convertToFloat() << ">";
4590 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
4591 cerr << "<" << CSDN->getValueAPF().convertToDouble() << ">";
4593 cerr << "<APFloat(";
4594 CSDN->getValueAPF().convertToAPInt().dump();
4597 } else if (const GlobalAddressSDNode *GADN =
4598 dyn_cast<GlobalAddressSDNode>(this)) {
4599 int offset = GADN->getOffset();
4601 WriteAsOperand(*cerr.stream(), GADN->getGlobal()) << ">";
4603 cerr << " + " << offset;
4605 cerr << " " << offset;
4606 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
4607 cerr << "<" << FIDN->getIndex() << ">";
4608 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
4609 cerr << "<" << JTDN->getIndex() << ">";
4610 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
4611 int offset = CP->getOffset();
4612 if (CP->isMachineConstantPoolEntry())
4613 cerr << "<" << *CP->getMachineCPVal() << ">";
4615 cerr << "<" << *CP->getConstVal() << ">";
4617 cerr << " + " << offset;
4619 cerr << " " << offset;
4620 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
4622 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
4624 cerr << LBB->getName() << " ";
4625 cerr << (const void*)BBDN->getBasicBlock() << ">";
4626 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
4627 if (G && R->getReg() &&
4628 TargetRegisterInfo::isPhysicalRegister(R->getReg())) {
4629 cerr << " " << G->getTarget().getRegisterInfo()->getName(R->getReg());
4631 cerr << " #" << R->getReg();
4633 } else if (const ExternalSymbolSDNode *ES =
4634 dyn_cast<ExternalSymbolSDNode>(this)) {
4635 cerr << "'" << ES->getSymbol() << "'";
4636 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
4638 cerr << "<" << M->getValue() << ">";
4641 } else if (const MemOperandSDNode *M = dyn_cast<MemOperandSDNode>(this)) {
4642 if (M->MO.getValue())
4643 cerr << "<" << M->MO.getValue() << ":" << M->MO.getOffset() << ">";
4645 cerr << "<null:" << M->MO.getOffset() << ">";
4646 } else if (const ARG_FLAGSSDNode *N = dyn_cast<ARG_FLAGSSDNode>(this)) {
4647 cerr << N->getArgFlags().getArgFlagsString();
4648 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
4649 cerr << ":" << MVT::getValueTypeString(N->getVT());
4650 } else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
4651 const Value *SrcValue = LD->getSrcValue();
4652 int SrcOffset = LD->getSrcValueOffset();
4658 cerr << ":" << SrcOffset << ">";
4661 switch (LD->getExtensionType()) {
4662 default: doExt = false; break;
4664 cerr << " <anyext ";
4674 cerr << MVT::getValueTypeString(LD->getMemoryVT()) << ">";
4676 const char *AM = getIndexedModeName(LD->getAddressingMode());
4679 if (LD->isVolatile())
4680 cerr << " <volatile>";
4681 cerr << " alignment=" << LD->getAlignment();
4682 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
4683 const Value *SrcValue = ST->getSrcValue();
4684 int SrcOffset = ST->getSrcValueOffset();
4690 cerr << ":" << SrcOffset << ">";
4692 if (ST->isTruncatingStore())
4694 << MVT::getValueTypeString(ST->getMemoryVT()) << ">";
4696 const char *AM = getIndexedModeName(ST->getAddressingMode());
4699 if (ST->isVolatile())
4700 cerr << " <volatile>";
4701 cerr << " alignment=" << ST->getAlignment();
4705 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
4706 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
4707 if (N->getOperand(i).Val->hasOneUse())
4708 DumpNodes(N->getOperand(i).Val, indent+2, G);
4710 cerr << "\n" << std::string(indent+2, ' ')
4711 << (void*)N->getOperand(i).Val << ": <multiple use>";
4714 cerr << "\n" << std::string(indent, ' ');
4718 void SelectionDAG::dump() const {
4719 cerr << "SelectionDAG has " << AllNodes.size() << " nodes:";
4720 std::vector<const SDNode*> Nodes;
4721 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
4725 std::sort(Nodes.begin(), Nodes.end());
4727 for (unsigned i = 0, e = Nodes.size(); i != e; ++i) {
4728 if (!Nodes[i]->hasOneUse() && Nodes[i] != getRoot().Val)
4729 DumpNodes(Nodes[i], 2, this);
4732 if (getRoot().Val) DumpNodes(getRoot().Val, 2, this);
4737 const Type *ConstantPoolSDNode::getType() const {
4738 if (isMachineConstantPoolEntry())
4739 return Val.MachineCPVal->getType();
4740 return Val.ConstVal->getType();