1 //===-- SelectionDAG.cpp - Implement the SelectionDAG data structures -----===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This implements the SelectionDAG class.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/CodeGen/SelectionDAG.h"
15 #include "SDNodeOrdering.h"
16 #include "SDNodeDbgValue.h"
17 #include "llvm/Constants.h"
18 #include "llvm/Analysis/DebugInfo.h"
19 #include "llvm/Analysis/ValueTracking.h"
20 #include "llvm/Function.h"
21 #include "llvm/GlobalAlias.h"
22 #include "llvm/GlobalVariable.h"
23 #include "llvm/Intrinsics.h"
24 #include "llvm/DerivedTypes.h"
25 #include "llvm/Assembly/Writer.h"
26 #include "llvm/CallingConv.h"
27 #include "llvm/CodeGen/MachineBasicBlock.h"
28 #include "llvm/CodeGen/MachineConstantPool.h"
29 #include "llvm/CodeGen/MachineFrameInfo.h"
30 #include "llvm/CodeGen/MachineModuleInfo.h"
31 #include "llvm/CodeGen/PseudoSourceValue.h"
32 #include "llvm/Target/TargetRegisterInfo.h"
33 #include "llvm/Target/TargetData.h"
34 #include "llvm/Target/TargetFrameInfo.h"
35 #include "llvm/Target/TargetLowering.h"
36 #include "llvm/Target/TargetSelectionDAGInfo.h"
37 #include "llvm/Target/TargetOptions.h"
38 #include "llvm/Target/TargetInstrInfo.h"
39 #include "llvm/Target/TargetIntrinsicInfo.h"
40 #include "llvm/Target/TargetMachine.h"
41 #include "llvm/Support/CommandLine.h"
42 #include "llvm/Support/Debug.h"
43 #include "llvm/Support/ErrorHandling.h"
44 #include "llvm/Support/ManagedStatic.h"
45 #include "llvm/Support/MathExtras.h"
46 #include "llvm/Support/raw_ostream.h"
47 #include "llvm/System/Mutex.h"
48 #include "llvm/ADT/SetVector.h"
49 #include "llvm/ADT/SmallPtrSet.h"
50 #include "llvm/ADT/SmallSet.h"
51 #include "llvm/ADT/SmallVector.h"
52 #include "llvm/ADT/StringExtras.h"
57 /// makeVTList - Return an instance of the SDVTList struct initialized with the
58 /// specified members.
59 static SDVTList makeVTList(const EVT *VTs, unsigned NumVTs) {
60 SDVTList Res = {VTs, NumVTs};
64 static const fltSemantics *EVTToAPFloatSemantics(EVT VT) {
65 switch (VT.getSimpleVT().SimpleTy) {
66 default: llvm_unreachable("Unknown FP format");
67 case MVT::f32: return &APFloat::IEEEsingle;
68 case MVT::f64: return &APFloat::IEEEdouble;
69 case MVT::f80: return &APFloat::x87DoubleExtended;
70 case MVT::f128: return &APFloat::IEEEquad;
71 case MVT::ppcf128: return &APFloat::PPCDoubleDouble;
75 SelectionDAG::DAGUpdateListener::~DAGUpdateListener() {}
77 //===----------------------------------------------------------------------===//
78 // ConstantFPSDNode Class
79 //===----------------------------------------------------------------------===//
81 /// isExactlyValue - We don't rely on operator== working on double values, as
82 /// it returns true for things that are clearly not equal, like -0.0 and 0.0.
83 /// As such, this method can be used to do an exact bit-for-bit comparison of
84 /// two floating point values.
85 bool ConstantFPSDNode::isExactlyValue(const APFloat& V) const {
86 return getValueAPF().bitwiseIsEqual(V);
89 bool ConstantFPSDNode::isValueValidForType(EVT VT,
91 assert(VT.isFloatingPoint() && "Can only convert between FP types");
93 // PPC long double cannot be converted to any other type.
94 if (VT == MVT::ppcf128 ||
95 &Val.getSemantics() == &APFloat::PPCDoubleDouble)
98 // convert modifies in place, so make a copy.
99 APFloat Val2 = APFloat(Val);
101 (void) Val2.convert(*EVTToAPFloatSemantics(VT), APFloat::rmNearestTiesToEven,
106 //===----------------------------------------------------------------------===//
108 //===----------------------------------------------------------------------===//
110 /// isBuildVectorAllOnes - Return true if the specified node is a
111 /// BUILD_VECTOR where all of the elements are ~0 or undef.
112 bool ISD::isBuildVectorAllOnes(const SDNode *N) {
113 // Look through a bit convert.
114 if (N->getOpcode() == ISD::BIT_CONVERT)
115 N = N->getOperand(0).getNode();
117 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
119 unsigned i = 0, e = N->getNumOperands();
121 // Skip over all of the undef values.
122 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
125 // Do not accept an all-undef vector.
126 if (i == e) return false;
128 // Do not accept build_vectors that aren't all constants or which have non-~0
130 SDValue NotZero = N->getOperand(i);
131 if (isa<ConstantSDNode>(NotZero)) {
132 if (!cast<ConstantSDNode>(NotZero)->isAllOnesValue())
134 } else if (isa<ConstantFPSDNode>(NotZero)) {
135 if (!cast<ConstantFPSDNode>(NotZero)->getValueAPF().
136 bitcastToAPInt().isAllOnesValue())
141 // Okay, we have at least one ~0 value, check to see if the rest match or are
143 for (++i; i != e; ++i)
144 if (N->getOperand(i) != NotZero &&
145 N->getOperand(i).getOpcode() != ISD::UNDEF)
151 /// isBuildVectorAllZeros - Return true if the specified node is a
152 /// BUILD_VECTOR where all of the elements are 0 or undef.
153 bool ISD::isBuildVectorAllZeros(const SDNode *N) {
154 // Look through a bit convert.
155 if (N->getOpcode() == ISD::BIT_CONVERT)
156 N = N->getOperand(0).getNode();
158 if (N->getOpcode() != ISD::BUILD_VECTOR) return false;
160 unsigned i = 0, e = N->getNumOperands();
162 // Skip over all of the undef values.
163 while (i != e && N->getOperand(i).getOpcode() == ISD::UNDEF)
166 // Do not accept an all-undef vector.
167 if (i == e) return false;
169 // Do not accept build_vectors that aren't all constants or which have non-0
171 SDValue Zero = N->getOperand(i);
172 if (isa<ConstantSDNode>(Zero)) {
173 if (!cast<ConstantSDNode>(Zero)->isNullValue())
175 } else if (isa<ConstantFPSDNode>(Zero)) {
176 if (!cast<ConstantFPSDNode>(Zero)->getValueAPF().isPosZero())
181 // Okay, we have at least one 0 value, check to see if the rest match or are
183 for (++i; i != e; ++i)
184 if (N->getOperand(i) != Zero &&
185 N->getOperand(i).getOpcode() != ISD::UNDEF)
190 /// isScalarToVector - Return true if the specified node is a
191 /// ISD::SCALAR_TO_VECTOR node or a BUILD_VECTOR node where only the low
192 /// element is not an undef.
193 bool ISD::isScalarToVector(const SDNode *N) {
194 if (N->getOpcode() == ISD::SCALAR_TO_VECTOR)
197 if (N->getOpcode() != ISD::BUILD_VECTOR)
199 if (N->getOperand(0).getOpcode() == ISD::UNDEF)
201 unsigned NumElems = N->getNumOperands();
202 for (unsigned i = 1; i < NumElems; ++i) {
203 SDValue V = N->getOperand(i);
204 if (V.getOpcode() != ISD::UNDEF)
210 /// getSetCCSwappedOperands - Return the operation corresponding to (Y op X)
211 /// when given the operation for (X op Y).
212 ISD::CondCode ISD::getSetCCSwappedOperands(ISD::CondCode Operation) {
213 // To perform this operation, we just need to swap the L and G bits of the
215 unsigned OldL = (Operation >> 2) & 1;
216 unsigned OldG = (Operation >> 1) & 1;
217 return ISD::CondCode((Operation & ~6) | // Keep the N, U, E bits
218 (OldL << 1) | // New G bit
219 (OldG << 2)); // New L bit.
222 /// getSetCCInverse - Return the operation corresponding to !(X op Y), where
223 /// 'op' is a valid SetCC operation.
224 ISD::CondCode ISD::getSetCCInverse(ISD::CondCode Op, bool isInteger) {
225 unsigned Operation = Op;
227 Operation ^= 7; // Flip L, G, E bits, but not U.
229 Operation ^= 15; // Flip all of the condition bits.
231 if (Operation > ISD::SETTRUE2)
232 Operation &= ~8; // Don't let N and U bits get set.
234 return ISD::CondCode(Operation);
238 /// isSignedOp - For an integer comparison, return 1 if the comparison is a
239 /// signed operation and 2 if the result is an unsigned comparison. Return zero
240 /// if the operation does not depend on the sign of the input (setne and seteq).
241 static int isSignedOp(ISD::CondCode Opcode) {
243 default: llvm_unreachable("Illegal integer setcc operation!");
245 case ISD::SETNE: return 0;
249 case ISD::SETGE: return 1;
253 case ISD::SETUGE: return 2;
257 /// getSetCCOrOperation - Return the result of a logical OR between different
258 /// comparisons of identical values: ((X op1 Y) | (X op2 Y)). This function
259 /// returns SETCC_INVALID if it is not possible to represent the resultant
261 ISD::CondCode ISD::getSetCCOrOperation(ISD::CondCode Op1, ISD::CondCode Op2,
263 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
264 // Cannot fold a signed integer setcc with an unsigned integer setcc.
265 return ISD::SETCC_INVALID;
267 unsigned Op = Op1 | Op2; // Combine all of the condition bits.
269 // If the N and U bits get set then the resultant comparison DOES suddenly
270 // care about orderedness, and is true when ordered.
271 if (Op > ISD::SETTRUE2)
272 Op &= ~16; // Clear the U bit if the N bit is set.
274 // Canonicalize illegal integer setcc's.
275 if (isInteger && Op == ISD::SETUNE) // e.g. SETUGT | SETULT
278 return ISD::CondCode(Op);
281 /// getSetCCAndOperation - Return the result of a logical AND between different
282 /// comparisons of identical values: ((X op1 Y) & (X op2 Y)). This
283 /// function returns zero if it is not possible to represent the resultant
285 ISD::CondCode ISD::getSetCCAndOperation(ISD::CondCode Op1, ISD::CondCode Op2,
287 if (isInteger && (isSignedOp(Op1) | isSignedOp(Op2)) == 3)
288 // Cannot fold a signed setcc with an unsigned setcc.
289 return ISD::SETCC_INVALID;
291 // Combine all of the condition bits.
292 ISD::CondCode Result = ISD::CondCode(Op1 & Op2);
294 // Canonicalize illegal integer setcc's.
298 case ISD::SETUO : Result = ISD::SETFALSE; break; // SETUGT & SETULT
299 case ISD::SETOEQ: // SETEQ & SETU[LG]E
300 case ISD::SETUEQ: Result = ISD::SETEQ ; break; // SETUGE & SETULE
301 case ISD::SETOLT: Result = ISD::SETULT ; break; // SETULT & SETNE
302 case ISD::SETOGT: Result = ISD::SETUGT ; break; // SETUGT & SETNE
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 const SDValue *Ops, unsigned NumOps) {
329 for (; NumOps; --NumOps, ++Ops) {
330 ID.AddPointer(Ops->getNode());
331 ID.AddInteger(Ops->getResNo());
335 /// AddNodeIDOperands - Various routines for adding operands to the NodeID data.
337 static void AddNodeIDOperands(FoldingSetNodeID &ID,
338 const SDUse *Ops, unsigned NumOps) {
339 for (; NumOps; --NumOps, ++Ops) {
340 ID.AddPointer(Ops->getNode());
341 ID.AddInteger(Ops->getResNo());
345 static void AddNodeIDNode(FoldingSetNodeID &ID,
346 unsigned short OpC, SDVTList VTList,
347 const SDValue *OpList, unsigned N) {
348 AddNodeIDOpcode(ID, OpC);
349 AddNodeIDValueTypes(ID, VTList);
350 AddNodeIDOperands(ID, OpList, N);
353 /// AddNodeIDCustom - If this is an SDNode with special info, add this info to
355 static void AddNodeIDCustom(FoldingSetNodeID &ID, const SDNode *N) {
356 switch (N->getOpcode()) {
357 case ISD::TargetExternalSymbol:
358 case ISD::ExternalSymbol:
359 llvm_unreachable("Should only be used on nodes with operands");
360 default: break; // Normal nodes don't need extra info.
361 case ISD::TargetConstant:
363 ID.AddPointer(cast<ConstantSDNode>(N)->getConstantIntValue());
365 case ISD::TargetConstantFP:
366 case ISD::ConstantFP: {
367 ID.AddPointer(cast<ConstantFPSDNode>(N)->getConstantFPValue());
370 case ISD::TargetGlobalAddress:
371 case ISD::GlobalAddress:
372 case ISD::TargetGlobalTLSAddress:
373 case ISD::GlobalTLSAddress: {
374 const GlobalAddressSDNode *GA = cast<GlobalAddressSDNode>(N);
375 ID.AddPointer(GA->getGlobal());
376 ID.AddInteger(GA->getOffset());
377 ID.AddInteger(GA->getTargetFlags());
380 case ISD::BasicBlock:
381 ID.AddPointer(cast<BasicBlockSDNode>(N)->getBasicBlock());
384 ID.AddInteger(cast<RegisterSDNode>(N)->getReg());
388 ID.AddPointer(cast<SrcValueSDNode>(N)->getValue());
390 case ISD::FrameIndex:
391 case ISD::TargetFrameIndex:
392 ID.AddInteger(cast<FrameIndexSDNode>(N)->getIndex());
395 case ISD::TargetJumpTable:
396 ID.AddInteger(cast<JumpTableSDNode>(N)->getIndex());
397 ID.AddInteger(cast<JumpTableSDNode>(N)->getTargetFlags());
399 case ISD::ConstantPool:
400 case ISD::TargetConstantPool: {
401 const ConstantPoolSDNode *CP = cast<ConstantPoolSDNode>(N);
402 ID.AddInteger(CP->getAlignment());
403 ID.AddInteger(CP->getOffset());
404 if (CP->isMachineConstantPoolEntry())
405 CP->getMachineCPVal()->AddSelectionDAGCSEId(ID);
407 ID.AddPointer(CP->getConstVal());
408 ID.AddInteger(CP->getTargetFlags());
412 const LoadSDNode *LD = cast<LoadSDNode>(N);
413 ID.AddInteger(LD->getMemoryVT().getRawBits());
414 ID.AddInteger(LD->getRawSubclassData());
418 const StoreSDNode *ST = cast<StoreSDNode>(N);
419 ID.AddInteger(ST->getMemoryVT().getRawBits());
420 ID.AddInteger(ST->getRawSubclassData());
423 case ISD::ATOMIC_CMP_SWAP:
424 case ISD::ATOMIC_SWAP:
425 case ISD::ATOMIC_LOAD_ADD:
426 case ISD::ATOMIC_LOAD_SUB:
427 case ISD::ATOMIC_LOAD_AND:
428 case ISD::ATOMIC_LOAD_OR:
429 case ISD::ATOMIC_LOAD_XOR:
430 case ISD::ATOMIC_LOAD_NAND:
431 case ISD::ATOMIC_LOAD_MIN:
432 case ISD::ATOMIC_LOAD_MAX:
433 case ISD::ATOMIC_LOAD_UMIN:
434 case ISD::ATOMIC_LOAD_UMAX: {
435 const AtomicSDNode *AT = cast<AtomicSDNode>(N);
436 ID.AddInteger(AT->getMemoryVT().getRawBits());
437 ID.AddInteger(AT->getRawSubclassData());
440 case ISD::VECTOR_SHUFFLE: {
441 const ShuffleVectorSDNode *SVN = cast<ShuffleVectorSDNode>(N);
442 for (unsigned i = 0, e = N->getValueType(0).getVectorNumElements();
444 ID.AddInteger(SVN->getMaskElt(i));
447 case ISD::TargetBlockAddress:
448 case ISD::BlockAddress: {
449 ID.AddPointer(cast<BlockAddressSDNode>(N)->getBlockAddress());
450 ID.AddInteger(cast<BlockAddressSDNode>(N)->getTargetFlags());
453 } // end switch (N->getOpcode())
456 /// AddNodeIDNode - Generic routine for adding a nodes info to the NodeID
458 static void AddNodeIDNode(FoldingSetNodeID &ID, const SDNode *N) {
459 AddNodeIDOpcode(ID, N->getOpcode());
460 // Add the return value info.
461 AddNodeIDValueTypes(ID, N->getVTList());
462 // Add the operand info.
463 AddNodeIDOperands(ID, N->op_begin(), N->getNumOperands());
465 // Handle SDNode leafs with special info.
466 AddNodeIDCustom(ID, N);
469 /// encodeMemSDNodeFlags - Generic routine for computing a value for use in
470 /// the CSE map that carries volatility, temporalness, indexing mode, and
471 /// extension/truncation information.
473 static inline unsigned
474 encodeMemSDNodeFlags(int ConvType, ISD::MemIndexedMode AM, bool isVolatile,
475 bool isNonTemporal) {
476 assert((ConvType & 3) == ConvType &&
477 "ConvType may not require more than 2 bits!");
478 assert((AM & 7) == AM &&
479 "AM may not require more than 3 bits!");
483 (isNonTemporal << 6);
486 //===----------------------------------------------------------------------===//
487 // SelectionDAG Class
488 //===----------------------------------------------------------------------===//
490 /// doNotCSE - Return true if CSE should not be performed for this node.
491 static bool doNotCSE(SDNode *N) {
492 if (N->getValueType(0) == MVT::Flag)
493 return true; // Never CSE anything that produces a flag.
495 switch (N->getOpcode()) {
497 case ISD::HANDLENODE:
499 return true; // Never CSE these nodes.
502 // Check that remaining values produced are not flags.
503 for (unsigned i = 1, e = N->getNumValues(); i != e; ++i)
504 if (N->getValueType(i) == MVT::Flag)
505 return true; // Never CSE anything that produces a flag.
510 /// RemoveDeadNodes - This method deletes all unreachable nodes in the
512 void SelectionDAG::RemoveDeadNodes() {
513 // Create a dummy node (which is not added to allnodes), that adds a reference
514 // to the root node, preventing it from being deleted.
515 HandleSDNode Dummy(getRoot());
517 SmallVector<SDNode*, 128> DeadNodes;
519 // Add all obviously-dead nodes to the DeadNodes worklist.
520 for (allnodes_iterator I = allnodes_begin(), E = allnodes_end(); I != E; ++I)
522 DeadNodes.push_back(I);
524 RemoveDeadNodes(DeadNodes);
526 // If the root changed (e.g. it was a dead load, update the root).
527 setRoot(Dummy.getValue());
530 /// RemoveDeadNodes - This method deletes the unreachable nodes in the
531 /// given list, and any nodes that become unreachable as a result.
532 void SelectionDAG::RemoveDeadNodes(SmallVectorImpl<SDNode *> &DeadNodes,
533 DAGUpdateListener *UpdateListener) {
535 // Process the worklist, deleting the nodes and adding their uses to the
537 while (!DeadNodes.empty()) {
538 SDNode *N = DeadNodes.pop_back_val();
541 UpdateListener->NodeDeleted(N, 0);
543 // Take the node out of the appropriate CSE map.
544 RemoveNodeFromCSEMaps(N);
546 // Next, brutally remove the operand list. This is safe to do, as there are
547 // no cycles in the graph.
548 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ) {
550 SDNode *Operand = Use.getNode();
553 // Now that we removed this operand, see if there are no uses of it left.
554 if (Operand->use_empty())
555 DeadNodes.push_back(Operand);
562 void SelectionDAG::RemoveDeadNode(SDNode *N, DAGUpdateListener *UpdateListener){
563 SmallVector<SDNode*, 16> DeadNodes(1, N);
564 RemoveDeadNodes(DeadNodes, UpdateListener);
567 void SelectionDAG::DeleteNode(SDNode *N) {
568 // First take this out of the appropriate CSE map.
569 RemoveNodeFromCSEMaps(N);
571 // Finally, remove uses due to operands of this node, remove from the
572 // AllNodes list, and delete the node.
573 DeleteNodeNotInCSEMaps(N);
576 void SelectionDAG::DeleteNodeNotInCSEMaps(SDNode *N) {
577 assert(N != AllNodes.begin() && "Cannot delete the entry node!");
578 assert(N->use_empty() && "Cannot delete a node that is not dead!");
580 // Drop all of the operands and decrement used node's use counts.
586 void SelectionDAG::DeallocateNode(SDNode *N) {
587 if (N->OperandsNeedDelete)
588 delete[] N->OperandList;
590 // Set the opcode to DELETED_NODE to help catch bugs when node
591 // memory is reallocated.
592 N->NodeType = ISD::DELETED_NODE;
594 NodeAllocator.Deallocate(AllNodes.remove(N));
596 // Remove the ordering of this node.
599 // If any of the SDDbgValue nodes refer to this SDNode, invalidate them.
600 SmallVector<SDDbgValue*, 2> &DbgVals = DbgInfo->getSDDbgValues(N);
601 for (unsigned i = 0, e = DbgVals.size(); i != e; ++i)
602 DbgVals[i]->setIsInvalidated();
605 /// RemoveNodeFromCSEMaps - Take the specified node out of the CSE map that
606 /// correspond to it. This is useful when we're about to delete or repurpose
607 /// the node. We don't want future request for structurally identical nodes
608 /// to return N anymore.
609 bool SelectionDAG::RemoveNodeFromCSEMaps(SDNode *N) {
611 switch (N->getOpcode()) {
612 case ISD::EntryToken:
613 llvm_unreachable("EntryToken should not be in CSEMaps!");
615 case ISD::HANDLENODE: return false; // noop.
617 assert(CondCodeNodes[cast<CondCodeSDNode>(N)->get()] &&
618 "Cond code doesn't exist!");
619 Erased = CondCodeNodes[cast<CondCodeSDNode>(N)->get()] != 0;
620 CondCodeNodes[cast<CondCodeSDNode>(N)->get()] = 0;
622 case ISD::ExternalSymbol:
623 Erased = ExternalSymbols.erase(cast<ExternalSymbolSDNode>(N)->getSymbol());
625 case ISD::TargetExternalSymbol: {
626 ExternalSymbolSDNode *ESN = cast<ExternalSymbolSDNode>(N);
627 Erased = TargetExternalSymbols.erase(
628 std::pair<std::string,unsigned char>(ESN->getSymbol(),
629 ESN->getTargetFlags()));
632 case ISD::VALUETYPE: {
633 EVT VT = cast<VTSDNode>(N)->getVT();
634 if (VT.isExtended()) {
635 Erased = ExtendedValueTypeNodes.erase(VT);
637 Erased = ValueTypeNodes[VT.getSimpleVT().SimpleTy] != 0;
638 ValueTypeNodes[VT.getSimpleVT().SimpleTy] = 0;
643 // Remove it from the CSE Map.
644 Erased = CSEMap.RemoveNode(N);
648 // Verify that the node was actually in one of the CSE maps, unless it has a
649 // flag result (which cannot be CSE'd) or is one of the special cases that are
650 // not subject to CSE.
651 if (!Erased && N->getValueType(N->getNumValues()-1) != MVT::Flag &&
652 !N->isMachineOpcode() && !doNotCSE(N)) {
655 llvm_unreachable("Node is not in map!");
661 /// AddModifiedNodeToCSEMaps - The specified node has been removed from the CSE
662 /// maps and modified in place. Add it back to the CSE maps, unless an identical
663 /// node already exists, in which case transfer all its users to the existing
664 /// node. This transfer can potentially trigger recursive merging.
667 SelectionDAG::AddModifiedNodeToCSEMaps(SDNode *N,
668 DAGUpdateListener *UpdateListener) {
669 // For node types that aren't CSE'd, just act as if no identical node
672 SDNode *Existing = CSEMap.GetOrInsertNode(N);
674 // If there was already an existing matching node, use ReplaceAllUsesWith
675 // to replace the dead one with the existing one. This can cause
676 // recursive merging of other unrelated nodes down the line.
677 ReplaceAllUsesWith(N, Existing, UpdateListener);
679 // N is now dead. Inform the listener if it exists and delete it.
681 UpdateListener->NodeDeleted(N, Existing);
682 DeleteNodeNotInCSEMaps(N);
687 // If the node doesn't already exist, we updated it. Inform a listener if
690 UpdateListener->NodeUpdated(N);
693 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
694 /// were replaced with those specified. If this node is never memoized,
695 /// return null, otherwise return a pointer to the slot it would take. If a
696 /// node already exists with these operands, the slot will be non-null.
697 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N, SDValue Op,
702 SDValue Ops[] = { Op };
704 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 1);
705 AddNodeIDCustom(ID, N);
706 SDNode *Node = CSEMap.FindNodeOrInsertPos(ID, InsertPos);
710 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
711 /// were replaced with those specified. If this node is never memoized,
712 /// return null, otherwise return a pointer to the slot it would take. If a
713 /// node already exists with these operands, the slot will be non-null.
714 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
715 SDValue Op1, SDValue Op2,
720 SDValue Ops[] = { Op1, Op2 };
722 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, 2);
723 AddNodeIDCustom(ID, N);
724 SDNode *Node = CSEMap.FindNodeOrInsertPos(ID, InsertPos);
729 /// FindModifiedNodeSlot - Find a slot for the specified node if its operands
730 /// were replaced with those specified. If this node is never memoized,
731 /// return null, otherwise return a pointer to the slot it would take. If a
732 /// node already exists with these operands, the slot will be non-null.
733 SDNode *SelectionDAG::FindModifiedNodeSlot(SDNode *N,
734 const SDValue *Ops,unsigned NumOps,
740 AddNodeIDNode(ID, N->getOpcode(), N->getVTList(), Ops, NumOps);
741 AddNodeIDCustom(ID, N);
742 SDNode *Node = CSEMap.FindNodeOrInsertPos(ID, InsertPos);
746 /// VerifyNode - Sanity check the given node. Aborts if it is invalid.
747 void SelectionDAG::VerifyNode(SDNode *N) {
748 switch (N->getOpcode()) {
751 case ISD::BUILD_PAIR: {
752 EVT VT = N->getValueType(0);
753 assert(N->getNumValues() == 1 && "Too many results!");
754 assert(!VT.isVector() && (VT.isInteger() || VT.isFloatingPoint()) &&
755 "Wrong return type!");
756 assert(N->getNumOperands() == 2 && "Wrong number of operands!");
757 assert(N->getOperand(0).getValueType() == N->getOperand(1).getValueType() &&
758 "Mismatched operand types!");
759 assert(N->getOperand(0).getValueType().isInteger() == VT.isInteger() &&
760 "Wrong operand type!");
761 assert(VT.getSizeInBits() == 2 * N->getOperand(0).getValueSizeInBits() &&
762 "Wrong return type size");
765 case ISD::BUILD_VECTOR: {
766 assert(N->getNumValues() == 1 && "Too many results!");
767 assert(N->getValueType(0).isVector() && "Wrong return type!");
768 assert(N->getNumOperands() == N->getValueType(0).getVectorNumElements() &&
769 "Wrong number of operands!");
770 EVT EltVT = N->getValueType(0).getVectorElementType();
771 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ++I)
772 assert((I->getValueType() == EltVT ||
773 (EltVT.isInteger() && I->getValueType().isInteger() &&
774 EltVT.bitsLE(I->getValueType()))) &&
775 "Wrong operand type!");
781 /// getEVTAlignment - Compute the default alignment value for the
784 unsigned SelectionDAG::getEVTAlignment(EVT VT) const {
785 const Type *Ty = VT == MVT::iPTR ?
786 PointerType::get(Type::getInt8Ty(*getContext()), 0) :
787 VT.getTypeForEVT(*getContext());
789 return TLI.getTargetData()->getABITypeAlignment(Ty);
792 // EntryNode could meaningfully have debug info if we can find it...
793 SelectionDAG::SelectionDAG(const TargetMachine &tm)
794 : TM(tm), TLI(*tm.getTargetLowering()), TSI(*tm.getSelectionDAGInfo()),
795 EntryNode(ISD::EntryToken, DebugLoc(), getVTList(MVT::Other)),
796 Root(getEntryNode()), Ordering(0) {
797 AllNodes.push_back(&EntryNode);
798 Ordering = new SDNodeOrdering();
799 DbgInfo = new SDDbgInfo();
802 void SelectionDAG::init(MachineFunction &mf) {
804 Context = &mf.getFunction()->getContext();
807 SelectionDAG::~SelectionDAG() {
813 void SelectionDAG::allnodes_clear() {
814 assert(&*AllNodes.begin() == &EntryNode);
815 AllNodes.remove(AllNodes.begin());
816 while (!AllNodes.empty())
817 DeallocateNode(AllNodes.begin());
820 void SelectionDAG::clear() {
822 OperandAllocator.Reset();
825 ExtendedValueTypeNodes.clear();
826 ExternalSymbols.clear();
827 TargetExternalSymbols.clear();
828 std::fill(CondCodeNodes.begin(), CondCodeNodes.end(),
829 static_cast<CondCodeSDNode*>(0));
830 std::fill(ValueTypeNodes.begin(), ValueTypeNodes.end(),
831 static_cast<SDNode*>(0));
833 EntryNode.UseList = 0;
834 AllNodes.push_back(&EntryNode);
835 Root = getEntryNode();
840 SDValue SelectionDAG::getSExtOrTrunc(SDValue Op, DebugLoc DL, EVT VT) {
841 return VT.bitsGT(Op.getValueType()) ?
842 getNode(ISD::SIGN_EXTEND, DL, VT, Op) :
843 getNode(ISD::TRUNCATE, DL, VT, Op);
846 SDValue SelectionDAG::getZExtOrTrunc(SDValue Op, DebugLoc DL, EVT VT) {
847 return VT.bitsGT(Op.getValueType()) ?
848 getNode(ISD::ZERO_EXTEND, DL, VT, Op) :
849 getNode(ISD::TRUNCATE, DL, VT, Op);
852 SDValue SelectionDAG::getZeroExtendInReg(SDValue Op, DebugLoc DL, EVT VT) {
853 assert(!VT.isVector() &&
854 "getZeroExtendInReg should use the vector element type instead of "
856 if (Op.getValueType() == VT) return Op;
857 unsigned BitWidth = Op.getValueType().getScalarType().getSizeInBits();
858 APInt Imm = APInt::getLowBitsSet(BitWidth,
860 return getNode(ISD::AND, DL, Op.getValueType(), Op,
861 getConstant(Imm, Op.getValueType()));
864 /// getNOT - Create a bitwise NOT operation as (XOR Val, -1).
866 SDValue SelectionDAG::getNOT(DebugLoc DL, SDValue Val, EVT VT) {
867 EVT EltVT = VT.getScalarType();
869 getConstant(APInt::getAllOnesValue(EltVT.getSizeInBits()), VT);
870 return getNode(ISD::XOR, DL, VT, Val, NegOne);
873 SDValue SelectionDAG::getConstant(uint64_t Val, EVT VT, bool isT) {
874 EVT EltVT = VT.getScalarType();
875 assert((EltVT.getSizeInBits() >= 64 ||
876 (uint64_t)((int64_t)Val >> EltVT.getSizeInBits()) + 1 < 2) &&
877 "getConstant with a uint64_t value that doesn't fit in the type!");
878 return getConstant(APInt(EltVT.getSizeInBits(), Val), VT, isT);
881 SDValue SelectionDAG::getConstant(const APInt &Val, EVT VT, bool isT) {
882 return getConstant(*ConstantInt::get(*Context, Val), VT, isT);
885 SDValue SelectionDAG::getConstant(const ConstantInt &Val, EVT VT, bool isT) {
886 assert(VT.isInteger() && "Cannot create FP integer constant!");
888 EVT EltVT = VT.getScalarType();
889 assert(Val.getBitWidth() == EltVT.getSizeInBits() &&
890 "APInt size does not match type size!");
892 unsigned Opc = isT ? ISD::TargetConstant : ISD::Constant;
894 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
898 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
900 return SDValue(N, 0);
903 N = new (NodeAllocator) ConstantSDNode(isT, &Val, EltVT);
904 CSEMap.InsertNode(N, IP);
905 AllNodes.push_back(N);
908 SDValue Result(N, 0);
910 SmallVector<SDValue, 8> Ops;
911 Ops.assign(VT.getVectorNumElements(), Result);
912 Result = getNode(ISD::BUILD_VECTOR, DebugLoc(), VT, &Ops[0], Ops.size());
917 SDValue SelectionDAG::getIntPtrConstant(uint64_t Val, bool isTarget) {
918 return getConstant(Val, TLI.getPointerTy(), isTarget);
922 SDValue SelectionDAG::getConstantFP(const APFloat& V, EVT VT, bool isTarget) {
923 return getConstantFP(*ConstantFP::get(*getContext(), V), VT, isTarget);
926 SDValue SelectionDAG::getConstantFP(const ConstantFP& V, EVT VT, bool isTarget){
927 assert(VT.isFloatingPoint() && "Cannot create integer FP constant!");
929 EVT EltVT = VT.getScalarType();
931 // Do the map lookup using the actual bit pattern for the floating point
932 // value, so that we don't have problems with 0.0 comparing equal to -0.0, and
933 // we don't have issues with SNANs.
934 unsigned Opc = isTarget ? ISD::TargetConstantFP : ISD::ConstantFP;
936 AddNodeIDNode(ID, Opc, getVTList(EltVT), 0, 0);
940 if ((N = CSEMap.FindNodeOrInsertPos(ID, IP)))
942 return SDValue(N, 0);
945 N = new (NodeAllocator) ConstantFPSDNode(isTarget, &V, EltVT);
946 CSEMap.InsertNode(N, IP);
947 AllNodes.push_back(N);
950 SDValue Result(N, 0);
952 SmallVector<SDValue, 8> Ops;
953 Ops.assign(VT.getVectorNumElements(), Result);
954 // FIXME DebugLoc info might be appropriate here
955 Result = getNode(ISD::BUILD_VECTOR, DebugLoc(), VT, &Ops[0], Ops.size());
960 SDValue SelectionDAG::getConstantFP(double Val, EVT VT, bool isTarget) {
961 EVT EltVT = VT.getScalarType();
963 return getConstantFP(APFloat((float)Val), VT, isTarget);
964 else if (EltVT==MVT::f64)
965 return getConstantFP(APFloat(Val), VT, isTarget);
966 else if (EltVT==MVT::f80 || EltVT==MVT::f128) {
968 APFloat apf = APFloat(Val);
969 apf.convert(*EVTToAPFloatSemantics(EltVT), APFloat::rmNearestTiesToEven,
971 return getConstantFP(apf, VT, isTarget);
973 assert(0 && "Unsupported type in getConstantFP");
978 SDValue SelectionDAG::getGlobalAddress(const GlobalValue *GV,
979 EVT VT, int64_t Offset,
981 unsigned char TargetFlags) {
982 assert((TargetFlags == 0 || isTargetGA) &&
983 "Cannot set target flags on target-independent globals");
985 // Truncate (with sign-extension) the offset value to the pointer size.
986 EVT PTy = TLI.getPointerTy();
987 unsigned BitWidth = PTy.getSizeInBits();
989 Offset = (Offset << (64 - BitWidth) >> (64 - BitWidth));
991 const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV);
993 // If GV is an alias then use the aliasee for determining thread-localness.
994 if (const GlobalAlias *GA = dyn_cast<GlobalAlias>(GV))
995 GVar = dyn_cast_or_null<GlobalVariable>(GA->resolveAliasedGlobal(false));
999 if (GVar && GVar->isThreadLocal())
1000 Opc = isTargetGA ? ISD::TargetGlobalTLSAddress : ISD::GlobalTLSAddress;
1002 Opc = isTargetGA ? ISD::TargetGlobalAddress : ISD::GlobalAddress;
1004 FoldingSetNodeID ID;
1005 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
1007 ID.AddInteger(Offset);
1008 ID.AddInteger(TargetFlags);
1010 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1011 return SDValue(E, 0);
1013 SDNode *N = new (NodeAllocator) GlobalAddressSDNode(Opc, GV, VT,
1014 Offset, TargetFlags);
1015 CSEMap.InsertNode(N, IP);
1016 AllNodes.push_back(N);
1017 return SDValue(N, 0);
1020 SDValue SelectionDAG::getFrameIndex(int FI, EVT VT, bool isTarget) {
1021 unsigned Opc = isTarget ? ISD::TargetFrameIndex : ISD::FrameIndex;
1022 FoldingSetNodeID ID;
1023 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
1026 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1027 return SDValue(E, 0);
1029 SDNode *N = new (NodeAllocator) FrameIndexSDNode(FI, VT, isTarget);
1030 CSEMap.InsertNode(N, IP);
1031 AllNodes.push_back(N);
1032 return SDValue(N, 0);
1035 SDValue SelectionDAG::getJumpTable(int JTI, EVT VT, bool isTarget,
1036 unsigned char TargetFlags) {
1037 assert((TargetFlags == 0 || isTarget) &&
1038 "Cannot set target flags on target-independent jump tables");
1039 unsigned Opc = isTarget ? ISD::TargetJumpTable : ISD::JumpTable;
1040 FoldingSetNodeID ID;
1041 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
1043 ID.AddInteger(TargetFlags);
1045 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1046 return SDValue(E, 0);
1048 SDNode *N = new (NodeAllocator) JumpTableSDNode(JTI, VT, isTarget,
1050 CSEMap.InsertNode(N, IP);
1051 AllNodes.push_back(N);
1052 return SDValue(N, 0);
1055 SDValue SelectionDAG::getConstantPool(const Constant *C, EVT VT,
1056 unsigned Alignment, int Offset,
1058 unsigned char TargetFlags) {
1059 assert((TargetFlags == 0 || isTarget) &&
1060 "Cannot set target flags on target-independent globals");
1062 Alignment = TLI.getTargetData()->getPrefTypeAlignment(C->getType());
1063 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
1064 FoldingSetNodeID ID;
1065 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
1066 ID.AddInteger(Alignment);
1067 ID.AddInteger(Offset);
1069 ID.AddInteger(TargetFlags);
1071 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1072 return SDValue(E, 0);
1074 SDNode *N = new (NodeAllocator) ConstantPoolSDNode(isTarget, C, VT, Offset,
1075 Alignment, TargetFlags);
1076 CSEMap.InsertNode(N, IP);
1077 AllNodes.push_back(N);
1078 return SDValue(N, 0);
1082 SDValue SelectionDAG::getConstantPool(MachineConstantPoolValue *C, EVT VT,
1083 unsigned Alignment, int Offset,
1085 unsigned char TargetFlags) {
1086 assert((TargetFlags == 0 || isTarget) &&
1087 "Cannot set target flags on target-independent globals");
1089 Alignment = TLI.getTargetData()->getPrefTypeAlignment(C->getType());
1090 unsigned Opc = isTarget ? ISD::TargetConstantPool : ISD::ConstantPool;
1091 FoldingSetNodeID ID;
1092 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
1093 ID.AddInteger(Alignment);
1094 ID.AddInteger(Offset);
1095 C->AddSelectionDAGCSEId(ID);
1096 ID.AddInteger(TargetFlags);
1098 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1099 return SDValue(E, 0);
1101 SDNode *N = new (NodeAllocator) ConstantPoolSDNode(isTarget, C, VT, Offset,
1102 Alignment, TargetFlags);
1103 CSEMap.InsertNode(N, IP);
1104 AllNodes.push_back(N);
1105 return SDValue(N, 0);
1108 SDValue SelectionDAG::getBasicBlock(MachineBasicBlock *MBB) {
1109 FoldingSetNodeID ID;
1110 AddNodeIDNode(ID, ISD::BasicBlock, getVTList(MVT::Other), 0, 0);
1113 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1114 return SDValue(E, 0);
1116 SDNode *N = new (NodeAllocator) BasicBlockSDNode(MBB);
1117 CSEMap.InsertNode(N, IP);
1118 AllNodes.push_back(N);
1119 return SDValue(N, 0);
1122 SDValue SelectionDAG::getValueType(EVT VT) {
1123 if (VT.isSimple() && (unsigned)VT.getSimpleVT().SimpleTy >=
1124 ValueTypeNodes.size())
1125 ValueTypeNodes.resize(VT.getSimpleVT().SimpleTy+1);
1127 SDNode *&N = VT.isExtended() ?
1128 ExtendedValueTypeNodes[VT] : ValueTypeNodes[VT.getSimpleVT().SimpleTy];
1130 if (N) return SDValue(N, 0);
1131 N = new (NodeAllocator) VTSDNode(VT);
1132 AllNodes.push_back(N);
1133 return SDValue(N, 0);
1136 SDValue SelectionDAG::getExternalSymbol(const char *Sym, EVT VT) {
1137 SDNode *&N = ExternalSymbols[Sym];
1138 if (N) return SDValue(N, 0);
1139 N = new (NodeAllocator) ExternalSymbolSDNode(false, Sym, 0, VT);
1140 AllNodes.push_back(N);
1141 return SDValue(N, 0);
1144 SDValue SelectionDAG::getTargetExternalSymbol(const char *Sym, EVT VT,
1145 unsigned char TargetFlags) {
1147 TargetExternalSymbols[std::pair<std::string,unsigned char>(Sym,
1149 if (N) return SDValue(N, 0);
1150 N = new (NodeAllocator) ExternalSymbolSDNode(true, Sym, TargetFlags, VT);
1151 AllNodes.push_back(N);
1152 return SDValue(N, 0);
1155 SDValue SelectionDAG::getCondCode(ISD::CondCode Cond) {
1156 if ((unsigned)Cond >= CondCodeNodes.size())
1157 CondCodeNodes.resize(Cond+1);
1159 if (CondCodeNodes[Cond] == 0) {
1160 CondCodeSDNode *N = new (NodeAllocator) CondCodeSDNode(Cond);
1161 CondCodeNodes[Cond] = N;
1162 AllNodes.push_back(N);
1165 return SDValue(CondCodeNodes[Cond], 0);
1168 // commuteShuffle - swaps the values of N1 and N2, and swaps all indices in
1169 // the shuffle mask M that point at N1 to point at N2, and indices that point
1170 // N2 to point at N1.
1171 static void commuteShuffle(SDValue &N1, SDValue &N2, SmallVectorImpl<int> &M) {
1173 int NElts = M.size();
1174 for (int i = 0; i != NElts; ++i) {
1182 SDValue SelectionDAG::getVectorShuffle(EVT VT, DebugLoc dl, SDValue N1,
1183 SDValue N2, const int *Mask) {
1184 assert(N1.getValueType() == N2.getValueType() && "Invalid VECTOR_SHUFFLE");
1185 assert(VT.isVector() && N1.getValueType().isVector() &&
1186 "Vector Shuffle VTs must be a vectors");
1187 assert(VT.getVectorElementType() == N1.getValueType().getVectorElementType()
1188 && "Vector Shuffle VTs must have same element type");
1190 // Canonicalize shuffle undef, undef -> undef
1191 if (N1.getOpcode() == ISD::UNDEF && N2.getOpcode() == ISD::UNDEF)
1192 return getUNDEF(VT);
1194 // Validate that all indices in Mask are within the range of the elements
1195 // input to the shuffle.
1196 unsigned NElts = VT.getVectorNumElements();
1197 SmallVector<int, 8> MaskVec;
1198 for (unsigned i = 0; i != NElts; ++i) {
1199 assert(Mask[i] < (int)(NElts * 2) && "Index out of range");
1200 MaskVec.push_back(Mask[i]);
1203 // Canonicalize shuffle v, v -> v, undef
1206 for (unsigned i = 0; i != NElts; ++i)
1207 if (MaskVec[i] >= (int)NElts) MaskVec[i] -= NElts;
1210 // Canonicalize shuffle undef, v -> v, undef. Commute the shuffle mask.
1211 if (N1.getOpcode() == ISD::UNDEF)
1212 commuteShuffle(N1, N2, MaskVec);
1214 // Canonicalize all index into lhs, -> shuffle lhs, undef
1215 // Canonicalize all index into rhs, -> shuffle rhs, undef
1216 bool AllLHS = true, AllRHS = true;
1217 bool N2Undef = N2.getOpcode() == ISD::UNDEF;
1218 for (unsigned i = 0; i != NElts; ++i) {
1219 if (MaskVec[i] >= (int)NElts) {
1224 } else if (MaskVec[i] >= 0) {
1228 if (AllLHS && AllRHS)
1229 return getUNDEF(VT);
1230 if (AllLHS && !N2Undef)
1234 commuteShuffle(N1, N2, MaskVec);
1237 // If Identity shuffle, or all shuffle in to undef, return that node.
1238 bool AllUndef = true;
1239 bool Identity = true;
1240 for (unsigned i = 0; i != NElts; ++i) {
1241 if (MaskVec[i] >= 0 && MaskVec[i] != (int)i) Identity = false;
1242 if (MaskVec[i] >= 0) AllUndef = false;
1244 if (Identity && NElts == N1.getValueType().getVectorNumElements())
1247 return getUNDEF(VT);
1249 FoldingSetNodeID ID;
1250 SDValue Ops[2] = { N1, N2 };
1251 AddNodeIDNode(ID, ISD::VECTOR_SHUFFLE, getVTList(VT), Ops, 2);
1252 for (unsigned i = 0; i != NElts; ++i)
1253 ID.AddInteger(MaskVec[i]);
1256 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1257 return SDValue(E, 0);
1259 // Allocate the mask array for the node out of the BumpPtrAllocator, since
1260 // SDNode doesn't have access to it. This memory will be "leaked" when
1261 // the node is deallocated, but recovered when the NodeAllocator is released.
1262 int *MaskAlloc = OperandAllocator.Allocate<int>(NElts);
1263 memcpy(MaskAlloc, &MaskVec[0], NElts * sizeof(int));
1265 ShuffleVectorSDNode *N =
1266 new (NodeAllocator) ShuffleVectorSDNode(VT, dl, N1, N2, MaskAlloc);
1267 CSEMap.InsertNode(N, IP);
1268 AllNodes.push_back(N);
1269 return SDValue(N, 0);
1272 SDValue SelectionDAG::getConvertRndSat(EVT VT, DebugLoc dl,
1273 SDValue Val, SDValue DTy,
1274 SDValue STy, SDValue Rnd, SDValue Sat,
1275 ISD::CvtCode Code) {
1276 // If the src and dest types are the same and the conversion is between
1277 // integer types of the same sign or two floats, no conversion is necessary.
1279 (Code == ISD::CVT_UU || Code == ISD::CVT_SS || Code == ISD::CVT_FF))
1282 FoldingSetNodeID ID;
1283 SDValue Ops[] = { Val, DTy, STy, Rnd, Sat };
1284 AddNodeIDNode(ID, ISD::CONVERT_RNDSAT, getVTList(VT), &Ops[0], 5);
1286 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1287 return SDValue(E, 0);
1289 CvtRndSatSDNode *N = new (NodeAllocator) CvtRndSatSDNode(VT, dl, Ops, 5,
1291 CSEMap.InsertNode(N, IP);
1292 AllNodes.push_back(N);
1293 return SDValue(N, 0);
1296 SDValue SelectionDAG::getRegister(unsigned RegNo, EVT VT) {
1297 FoldingSetNodeID ID;
1298 AddNodeIDNode(ID, ISD::Register, getVTList(VT), 0, 0);
1299 ID.AddInteger(RegNo);
1301 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1302 return SDValue(E, 0);
1304 SDNode *N = new (NodeAllocator) RegisterSDNode(RegNo, VT);
1305 CSEMap.InsertNode(N, IP);
1306 AllNodes.push_back(N);
1307 return SDValue(N, 0);
1310 SDValue SelectionDAG::getEHLabel(DebugLoc dl, SDValue Root, MCSymbol *Label) {
1311 FoldingSetNodeID ID;
1312 SDValue Ops[] = { Root };
1313 AddNodeIDNode(ID, ISD::EH_LABEL, getVTList(MVT::Other), &Ops[0], 1);
1314 ID.AddPointer(Label);
1316 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1317 return SDValue(E, 0);
1319 SDNode *N = new (NodeAllocator) EHLabelSDNode(dl, Root, Label);
1320 CSEMap.InsertNode(N, IP);
1321 AllNodes.push_back(N);
1322 return SDValue(N, 0);
1326 SDValue SelectionDAG::getBlockAddress(const BlockAddress *BA, EVT VT,
1328 unsigned char TargetFlags) {
1329 unsigned Opc = isTarget ? ISD::TargetBlockAddress : ISD::BlockAddress;
1331 FoldingSetNodeID ID;
1332 AddNodeIDNode(ID, Opc, getVTList(VT), 0, 0);
1334 ID.AddInteger(TargetFlags);
1336 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1337 return SDValue(E, 0);
1339 SDNode *N = new (NodeAllocator) BlockAddressSDNode(Opc, VT, BA, TargetFlags);
1340 CSEMap.InsertNode(N, IP);
1341 AllNodes.push_back(N);
1342 return SDValue(N, 0);
1345 SDValue SelectionDAG::getSrcValue(const Value *V) {
1346 assert((!V || V->getType()->isPointerTy()) &&
1347 "SrcValue is not a pointer?");
1349 FoldingSetNodeID ID;
1350 AddNodeIDNode(ID, ISD::SRCVALUE, getVTList(MVT::Other), 0, 0);
1354 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1355 return SDValue(E, 0);
1357 SDNode *N = new (NodeAllocator) SrcValueSDNode(V);
1358 CSEMap.InsertNode(N, IP);
1359 AllNodes.push_back(N);
1360 return SDValue(N, 0);
1363 /// getMDNode - Return an MDNodeSDNode which holds an MDNode.
1364 SDValue SelectionDAG::getMDNode(const MDNode *MD) {
1365 FoldingSetNodeID ID;
1366 AddNodeIDNode(ID, ISD::MDNODE_SDNODE, getVTList(MVT::Other), 0, 0);
1370 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
1371 return SDValue(E, 0);
1373 SDNode *N = new (NodeAllocator) MDNodeSDNode(MD);
1374 CSEMap.InsertNode(N, IP);
1375 AllNodes.push_back(N);
1376 return SDValue(N, 0);
1380 /// getShiftAmountOperand - Return the specified value casted to
1381 /// the target's desired shift amount type.
1382 SDValue SelectionDAG::getShiftAmountOperand(SDValue Op) {
1383 EVT OpTy = Op.getValueType();
1384 MVT ShTy = TLI.getShiftAmountTy();
1385 if (OpTy == ShTy || OpTy.isVector()) return Op;
1387 ISD::NodeType Opcode = OpTy.bitsGT(ShTy) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
1388 return getNode(Opcode, Op.getDebugLoc(), ShTy, Op);
1391 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
1392 /// specified value type.
1393 SDValue SelectionDAG::CreateStackTemporary(EVT VT, unsigned minAlign) {
1394 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
1395 unsigned ByteSize = VT.getStoreSize();
1396 const Type *Ty = VT.getTypeForEVT(*getContext());
1397 unsigned StackAlign =
1398 std::max((unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty), minAlign);
1400 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign, false);
1401 return getFrameIndex(FrameIdx, TLI.getPointerTy());
1404 /// CreateStackTemporary - Create a stack temporary suitable for holding
1405 /// either of the specified value types.
1406 SDValue SelectionDAG::CreateStackTemporary(EVT VT1, EVT VT2) {
1407 unsigned Bytes = std::max(VT1.getStoreSizeInBits(),
1408 VT2.getStoreSizeInBits())/8;
1409 const Type *Ty1 = VT1.getTypeForEVT(*getContext());
1410 const Type *Ty2 = VT2.getTypeForEVT(*getContext());
1411 const TargetData *TD = TLI.getTargetData();
1412 unsigned Align = std::max(TD->getPrefTypeAlignment(Ty1),
1413 TD->getPrefTypeAlignment(Ty2));
1415 MachineFrameInfo *FrameInfo = getMachineFunction().getFrameInfo();
1416 int FrameIdx = FrameInfo->CreateStackObject(Bytes, Align, false);
1417 return getFrameIndex(FrameIdx, TLI.getPointerTy());
1420 SDValue SelectionDAG::FoldSetCC(EVT VT, SDValue N1,
1421 SDValue N2, ISD::CondCode Cond, DebugLoc dl) {
1422 // These setcc operations always fold.
1426 case ISD::SETFALSE2: return getConstant(0, VT);
1428 case ISD::SETTRUE2: return getConstant(1, VT);
1440 assert(!N1.getValueType().isInteger() && "Illegal setcc for integer!");
1444 if (ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.getNode())) {
1445 const APInt &C2 = N2C->getAPIntValue();
1446 if (ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode())) {
1447 const APInt &C1 = N1C->getAPIntValue();
1450 default: llvm_unreachable("Unknown integer setcc!");
1451 case ISD::SETEQ: return getConstant(C1 == C2, VT);
1452 case ISD::SETNE: return getConstant(C1 != C2, VT);
1453 case ISD::SETULT: return getConstant(C1.ult(C2), VT);
1454 case ISD::SETUGT: return getConstant(C1.ugt(C2), VT);
1455 case ISD::SETULE: return getConstant(C1.ule(C2), VT);
1456 case ISD::SETUGE: return getConstant(C1.uge(C2), VT);
1457 case ISD::SETLT: return getConstant(C1.slt(C2), VT);
1458 case ISD::SETGT: return getConstant(C1.sgt(C2), VT);
1459 case ISD::SETLE: return getConstant(C1.sle(C2), VT);
1460 case ISD::SETGE: return getConstant(C1.sge(C2), VT);
1464 if (ConstantFPSDNode *N1C = dyn_cast<ConstantFPSDNode>(N1.getNode())) {
1465 if (ConstantFPSDNode *N2C = dyn_cast<ConstantFPSDNode>(N2.getNode())) {
1466 // No compile time operations on this type yet.
1467 if (N1C->getValueType(0) == MVT::ppcf128)
1470 APFloat::cmpResult R = N1C->getValueAPF().compare(N2C->getValueAPF());
1473 case ISD::SETEQ: if (R==APFloat::cmpUnordered)
1474 return getUNDEF(VT);
1476 case ISD::SETOEQ: return getConstant(R==APFloat::cmpEqual, VT);
1477 case ISD::SETNE: if (R==APFloat::cmpUnordered)
1478 return getUNDEF(VT);
1480 case ISD::SETONE: return getConstant(R==APFloat::cmpGreaterThan ||
1481 R==APFloat::cmpLessThan, VT);
1482 case ISD::SETLT: if (R==APFloat::cmpUnordered)
1483 return getUNDEF(VT);
1485 case ISD::SETOLT: return getConstant(R==APFloat::cmpLessThan, VT);
1486 case ISD::SETGT: if (R==APFloat::cmpUnordered)
1487 return getUNDEF(VT);
1489 case ISD::SETOGT: return getConstant(R==APFloat::cmpGreaterThan, VT);
1490 case ISD::SETLE: if (R==APFloat::cmpUnordered)
1491 return getUNDEF(VT);
1493 case ISD::SETOLE: return getConstant(R==APFloat::cmpLessThan ||
1494 R==APFloat::cmpEqual, VT);
1495 case ISD::SETGE: if (R==APFloat::cmpUnordered)
1496 return getUNDEF(VT);
1498 case ISD::SETOGE: return getConstant(R==APFloat::cmpGreaterThan ||
1499 R==APFloat::cmpEqual, VT);
1500 case ISD::SETO: return getConstant(R!=APFloat::cmpUnordered, VT);
1501 case ISD::SETUO: return getConstant(R==APFloat::cmpUnordered, VT);
1502 case ISD::SETUEQ: return getConstant(R==APFloat::cmpUnordered ||
1503 R==APFloat::cmpEqual, VT);
1504 case ISD::SETUNE: return getConstant(R!=APFloat::cmpEqual, VT);
1505 case ISD::SETULT: return getConstant(R==APFloat::cmpUnordered ||
1506 R==APFloat::cmpLessThan, VT);
1507 case ISD::SETUGT: return getConstant(R==APFloat::cmpGreaterThan ||
1508 R==APFloat::cmpUnordered, VT);
1509 case ISD::SETULE: return getConstant(R!=APFloat::cmpGreaterThan, VT);
1510 case ISD::SETUGE: return getConstant(R!=APFloat::cmpLessThan, VT);
1513 // Ensure that the constant occurs on the RHS.
1514 return getSetCC(dl, VT, N2, N1, ISD::getSetCCSwappedOperands(Cond));
1518 // Could not fold it.
1522 /// SignBitIsZero - Return true if the sign bit of Op is known to be zero. We
1523 /// use this predicate to simplify operations downstream.
1524 bool SelectionDAG::SignBitIsZero(SDValue Op, unsigned Depth) const {
1525 // This predicate is not safe for vector operations.
1526 if (Op.getValueType().isVector())
1529 unsigned BitWidth = Op.getValueType().getScalarType().getSizeInBits();
1530 return MaskedValueIsZero(Op, APInt::getSignBit(BitWidth), Depth);
1533 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
1534 /// this predicate to simplify operations downstream. Mask is known to be zero
1535 /// for bits that V cannot have.
1536 bool SelectionDAG::MaskedValueIsZero(SDValue Op, const APInt &Mask,
1537 unsigned Depth) const {
1538 APInt KnownZero, KnownOne;
1539 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
1540 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1541 return (KnownZero & Mask) == Mask;
1544 /// ComputeMaskedBits - Determine which of the bits specified in Mask are
1545 /// known to be either zero or one and return them in the KnownZero/KnownOne
1546 /// bitsets. This code only analyzes bits in Mask, in order to short-circuit
1548 void SelectionDAG::ComputeMaskedBits(SDValue Op, const APInt &Mask,
1549 APInt &KnownZero, APInt &KnownOne,
1550 unsigned Depth) const {
1551 unsigned BitWidth = Mask.getBitWidth();
1552 assert(BitWidth == Op.getValueType().getScalarType().getSizeInBits() &&
1553 "Mask size mismatches value type size!");
1555 KnownZero = KnownOne = APInt(BitWidth, 0); // Don't know anything.
1556 if (Depth == 6 || Mask == 0)
1557 return; // Limit search depth.
1559 APInt KnownZero2, KnownOne2;
1561 switch (Op.getOpcode()) {
1563 // We know all of the bits for a constant!
1564 KnownOne = cast<ConstantSDNode>(Op)->getAPIntValue() & Mask;
1565 KnownZero = ~KnownOne & Mask;
1568 // If either the LHS or the RHS are Zero, the result is zero.
1569 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1570 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownZero,
1571 KnownZero2, KnownOne2, Depth+1);
1572 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1573 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1575 // Output known-1 bits are only known if set in both the LHS & RHS.
1576 KnownOne &= KnownOne2;
1577 // Output known-0 are known to be clear if zero in either the LHS | RHS.
1578 KnownZero |= KnownZero2;
1581 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1582 ComputeMaskedBits(Op.getOperand(0), Mask & ~KnownOne,
1583 KnownZero2, KnownOne2, Depth+1);
1584 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1585 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1587 // Output known-0 bits are only known if clear in both the LHS & RHS.
1588 KnownZero &= KnownZero2;
1589 // Output known-1 are known to be set if set in either the LHS | RHS.
1590 KnownOne |= KnownOne2;
1593 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
1594 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero2, KnownOne2, Depth+1);
1595 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1596 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1598 // Output known-0 bits are known if clear or set in both the LHS & RHS.
1599 APInt KnownZeroOut = (KnownZero & KnownZero2) | (KnownOne & KnownOne2);
1600 // Output known-1 are known to be set if set in only one of the LHS, RHS.
1601 KnownOne = (KnownZero & KnownOne2) | (KnownOne & KnownZero2);
1602 KnownZero = KnownZeroOut;
1606 APInt Mask2 = APInt::getAllOnesValue(BitWidth);
1607 ComputeMaskedBits(Op.getOperand(1), Mask2, KnownZero, KnownOne, Depth+1);
1608 ComputeMaskedBits(Op.getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
1609 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1610 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1612 // If low bits are zero in either operand, output low known-0 bits.
1613 // Also compute a conserative estimate for high known-0 bits.
1614 // More trickiness is possible, but this is sufficient for the
1615 // interesting case of alignment computation.
1617 unsigned TrailZ = KnownZero.countTrailingOnes() +
1618 KnownZero2.countTrailingOnes();
1619 unsigned LeadZ = std::max(KnownZero.countLeadingOnes() +
1620 KnownZero2.countLeadingOnes(),
1621 BitWidth) - BitWidth;
1623 TrailZ = std::min(TrailZ, BitWidth);
1624 LeadZ = std::min(LeadZ, BitWidth);
1625 KnownZero = APInt::getLowBitsSet(BitWidth, TrailZ) |
1626 APInt::getHighBitsSet(BitWidth, LeadZ);
1631 // For the purposes of computing leading zeros we can conservatively
1632 // treat a udiv as a logical right shift by the power of 2 known to
1633 // be less than the denominator.
1634 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
1635 ComputeMaskedBits(Op.getOperand(0),
1636 AllOnes, KnownZero2, KnownOne2, Depth+1);
1637 unsigned LeadZ = KnownZero2.countLeadingOnes();
1641 ComputeMaskedBits(Op.getOperand(1),
1642 AllOnes, KnownZero2, KnownOne2, Depth+1);
1643 unsigned RHSUnknownLeadingOnes = KnownOne2.countLeadingZeros();
1644 if (RHSUnknownLeadingOnes != BitWidth)
1645 LeadZ = std::min(BitWidth,
1646 LeadZ + BitWidth - RHSUnknownLeadingOnes - 1);
1648 KnownZero = APInt::getHighBitsSet(BitWidth, LeadZ) & Mask;
1652 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero, KnownOne, Depth+1);
1653 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero2, KnownOne2, Depth+1);
1654 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1655 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1657 // Only known if known in both the LHS and RHS.
1658 KnownOne &= KnownOne2;
1659 KnownZero &= KnownZero2;
1661 case ISD::SELECT_CC:
1662 ComputeMaskedBits(Op.getOperand(3), Mask, KnownZero, KnownOne, Depth+1);
1663 ComputeMaskedBits(Op.getOperand(2), Mask, KnownZero2, KnownOne2, Depth+1);
1664 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1665 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1667 // Only known if known in both the LHS and RHS.
1668 KnownOne &= KnownOne2;
1669 KnownZero &= KnownZero2;
1677 if (Op.getResNo() != 1)
1679 // The boolean result conforms to getBooleanContents. Fall through.
1681 // If we know the result of a setcc has the top bits zero, use this info.
1682 if (TLI.getBooleanContents() == TargetLowering::ZeroOrOneBooleanContent &&
1684 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1687 // (shl X, C1) & C2 == 0 iff (X & C2 >>u C1) == 0
1688 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1689 unsigned ShAmt = SA->getZExtValue();
1691 // If the shift count is an invalid immediate, don't do anything.
1692 if (ShAmt >= BitWidth)
1695 ComputeMaskedBits(Op.getOperand(0), Mask.lshr(ShAmt),
1696 KnownZero, KnownOne, Depth+1);
1697 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1698 KnownZero <<= ShAmt;
1700 // low bits known zero.
1701 KnownZero |= APInt::getLowBitsSet(BitWidth, ShAmt);
1705 // (ushr X, C1) & C2 == 0 iff (-1 >> C1) & C2 == 0
1706 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1707 unsigned ShAmt = SA->getZExtValue();
1709 // If the shift count is an invalid immediate, don't do anything.
1710 if (ShAmt >= BitWidth)
1713 ComputeMaskedBits(Op.getOperand(0), (Mask << ShAmt),
1714 KnownZero, KnownOne, Depth+1);
1715 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1716 KnownZero = KnownZero.lshr(ShAmt);
1717 KnownOne = KnownOne.lshr(ShAmt);
1719 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1720 KnownZero |= HighBits; // High bits known zero.
1724 if (ConstantSDNode *SA = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1725 unsigned ShAmt = SA->getZExtValue();
1727 // If the shift count is an invalid immediate, don't do anything.
1728 if (ShAmt >= BitWidth)
1731 APInt InDemandedMask = (Mask << ShAmt);
1732 // If any of the demanded bits are produced by the sign extension, we also
1733 // demand the input sign bit.
1734 APInt HighBits = APInt::getHighBitsSet(BitWidth, ShAmt) & Mask;
1735 if (HighBits.getBoolValue())
1736 InDemandedMask |= APInt::getSignBit(BitWidth);
1738 ComputeMaskedBits(Op.getOperand(0), InDemandedMask, KnownZero, KnownOne,
1740 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1741 KnownZero = KnownZero.lshr(ShAmt);
1742 KnownOne = KnownOne.lshr(ShAmt);
1744 // Handle the sign bits.
1745 APInt SignBit = APInt::getSignBit(BitWidth);
1746 SignBit = SignBit.lshr(ShAmt); // Adjust to where it is now in the mask.
1748 if (KnownZero.intersects(SignBit)) {
1749 KnownZero |= HighBits; // New bits are known zero.
1750 } else if (KnownOne.intersects(SignBit)) {
1751 KnownOne |= HighBits; // New bits are known one.
1755 case ISD::SIGN_EXTEND_INREG: {
1756 EVT EVT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1757 unsigned EBits = EVT.getScalarType().getSizeInBits();
1759 // Sign extension. Compute the demanded bits in the result that are not
1760 // present in the input.
1761 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - EBits) & Mask;
1763 APInt InSignBit = APInt::getSignBit(EBits);
1764 APInt InputDemandedBits = Mask & APInt::getLowBitsSet(BitWidth, EBits);
1766 // If the sign extended bits are demanded, we know that the sign
1768 InSignBit.zext(BitWidth);
1769 if (NewBits.getBoolValue())
1770 InputDemandedBits |= InSignBit;
1772 ComputeMaskedBits(Op.getOperand(0), InputDemandedBits,
1773 KnownZero, KnownOne, Depth+1);
1774 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1776 // If the sign bit of the input is known set or clear, then we know the
1777 // top bits of the result.
1778 if (KnownZero.intersects(InSignBit)) { // Input sign bit known clear
1779 KnownZero |= NewBits;
1780 KnownOne &= ~NewBits;
1781 } else if (KnownOne.intersects(InSignBit)) { // Input sign bit known set
1782 KnownOne |= NewBits;
1783 KnownZero &= ~NewBits;
1784 } else { // Input sign bit unknown
1785 KnownZero &= ~NewBits;
1786 KnownOne &= ~NewBits;
1793 unsigned LowBits = Log2_32(BitWidth)+1;
1794 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - LowBits);
1799 if (ISD::isZEXTLoad(Op.getNode())) {
1800 LoadSDNode *LD = cast<LoadSDNode>(Op);
1801 EVT VT = LD->getMemoryVT();
1802 unsigned MemBits = VT.getScalarType().getSizeInBits();
1803 KnownZero |= APInt::getHighBitsSet(BitWidth, BitWidth - MemBits) & Mask;
1807 case ISD::ZERO_EXTEND: {
1808 EVT InVT = Op.getOperand(0).getValueType();
1809 unsigned InBits = InVT.getScalarType().getSizeInBits();
1810 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1811 APInt InMask = Mask;
1812 InMask.trunc(InBits);
1813 KnownZero.trunc(InBits);
1814 KnownOne.trunc(InBits);
1815 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1816 KnownZero.zext(BitWidth);
1817 KnownOne.zext(BitWidth);
1818 KnownZero |= NewBits;
1821 case ISD::SIGN_EXTEND: {
1822 EVT InVT = Op.getOperand(0).getValueType();
1823 unsigned InBits = InVT.getScalarType().getSizeInBits();
1824 APInt InSignBit = APInt::getSignBit(InBits);
1825 APInt NewBits = APInt::getHighBitsSet(BitWidth, BitWidth - InBits) & Mask;
1826 APInt InMask = Mask;
1827 InMask.trunc(InBits);
1829 // If any of the sign extended bits are demanded, we know that the sign
1830 // bit is demanded. Temporarily set this bit in the mask for our callee.
1831 if (NewBits.getBoolValue())
1832 InMask |= InSignBit;
1834 KnownZero.trunc(InBits);
1835 KnownOne.trunc(InBits);
1836 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1838 // Note if the sign bit is known to be zero or one.
1839 bool SignBitKnownZero = KnownZero.isNegative();
1840 bool SignBitKnownOne = KnownOne.isNegative();
1841 assert(!(SignBitKnownZero && SignBitKnownOne) &&
1842 "Sign bit can't be known to be both zero and one!");
1844 // If the sign bit wasn't actually demanded by our caller, we don't
1845 // want it set in the KnownZero and KnownOne result values. Reset the
1846 // mask and reapply it to the result values.
1848 InMask.trunc(InBits);
1849 KnownZero &= InMask;
1852 KnownZero.zext(BitWidth);
1853 KnownOne.zext(BitWidth);
1855 // If the sign bit is known zero or one, the top bits match.
1856 if (SignBitKnownZero)
1857 KnownZero |= NewBits;
1858 else if (SignBitKnownOne)
1859 KnownOne |= NewBits;
1862 case ISD::ANY_EXTEND: {
1863 EVT InVT = Op.getOperand(0).getValueType();
1864 unsigned InBits = InVT.getScalarType().getSizeInBits();
1865 APInt InMask = Mask;
1866 InMask.trunc(InBits);
1867 KnownZero.trunc(InBits);
1868 KnownOne.trunc(InBits);
1869 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1870 KnownZero.zext(BitWidth);
1871 KnownOne.zext(BitWidth);
1874 case ISD::TRUNCATE: {
1875 EVT InVT = Op.getOperand(0).getValueType();
1876 unsigned InBits = InVT.getScalarType().getSizeInBits();
1877 APInt InMask = Mask;
1878 InMask.zext(InBits);
1879 KnownZero.zext(InBits);
1880 KnownOne.zext(InBits);
1881 ComputeMaskedBits(Op.getOperand(0), InMask, KnownZero, KnownOne, Depth+1);
1882 assert((KnownZero & KnownOne) == 0 && "Bits known to be one AND zero?");
1883 KnownZero.trunc(BitWidth);
1884 KnownOne.trunc(BitWidth);
1887 case ISD::AssertZext: {
1888 EVT VT = cast<VTSDNode>(Op.getOperand(1))->getVT();
1889 APInt InMask = APInt::getLowBitsSet(BitWidth, VT.getSizeInBits());
1890 ComputeMaskedBits(Op.getOperand(0), Mask & InMask, KnownZero,
1892 KnownZero |= (~InMask) & Mask;
1896 // All bits are zero except the low bit.
1897 KnownZero = APInt::getHighBitsSet(BitWidth, BitWidth - 1);
1901 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0))) {
1902 // We know that the top bits of C-X are clear if X contains less bits
1903 // than C (i.e. no wrap-around can happen). For example, 20-X is
1904 // positive if we can prove that X is >= 0 and < 16.
1905 if (CLHS->getAPIntValue().isNonNegative()) {
1906 unsigned NLZ = (CLHS->getAPIntValue()+1).countLeadingZeros();
1907 // NLZ can't be BitWidth with no sign bit
1908 APInt MaskV = APInt::getHighBitsSet(BitWidth, NLZ+1);
1909 ComputeMaskedBits(Op.getOperand(1), MaskV, KnownZero2, KnownOne2,
1912 // If all of the MaskV bits are known to be zero, then we know the
1913 // output top bits are zero, because we now know that the output is
1915 if ((KnownZero2 & MaskV) == MaskV) {
1916 unsigned NLZ2 = CLHS->getAPIntValue().countLeadingZeros();
1917 // Top bits known zero.
1918 KnownZero = APInt::getHighBitsSet(BitWidth, NLZ2) & Mask;
1925 // Output known-0 bits are known if clear or set in both the low clear bits
1926 // common to both LHS & RHS. For example, 8+(X<<3) is known to have the
1927 // low 3 bits clear.
1928 APInt Mask2 = APInt::getLowBitsSet(BitWidth,
1929 BitWidth - Mask.countLeadingZeros());
1930 ComputeMaskedBits(Op.getOperand(0), Mask2, KnownZero2, KnownOne2, Depth+1);
1931 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1932 unsigned KnownZeroOut = KnownZero2.countTrailingOnes();
1934 ComputeMaskedBits(Op.getOperand(1), Mask2, KnownZero2, KnownOne2, Depth+1);
1935 assert((KnownZero2 & KnownOne2) == 0 && "Bits known to be one AND zero?");
1936 KnownZeroOut = std::min(KnownZeroOut,
1937 KnownZero2.countTrailingOnes());
1939 KnownZero |= APInt::getLowBitsSet(BitWidth, KnownZeroOut);
1943 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1944 const APInt &RA = Rem->getAPIntValue().abs();
1945 if (RA.isPowerOf2()) {
1946 APInt LowBits = RA - 1;
1947 APInt Mask2 = LowBits | APInt::getSignBit(BitWidth);
1948 ComputeMaskedBits(Op.getOperand(0), Mask2,KnownZero2,KnownOne2,Depth+1);
1950 // The low bits of the first operand are unchanged by the srem.
1951 KnownZero = KnownZero2 & LowBits;
1952 KnownOne = KnownOne2 & LowBits;
1954 // If the first operand is non-negative or has all low bits zero, then
1955 // the upper bits are all zero.
1956 if (KnownZero2[BitWidth-1] || ((KnownZero2 & LowBits) == LowBits))
1957 KnownZero |= ~LowBits;
1959 // If the first operand is negative and not all low bits are zero, then
1960 // the upper bits are all one.
1961 if (KnownOne2[BitWidth-1] && ((KnownOne2 & LowBits) != 0))
1962 KnownOne |= ~LowBits;
1967 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
1972 if (ConstantSDNode *Rem = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
1973 const APInt &RA = Rem->getAPIntValue();
1974 if (RA.isPowerOf2()) {
1975 APInt LowBits = (RA - 1);
1976 APInt Mask2 = LowBits & Mask;
1977 KnownZero |= ~LowBits & Mask;
1978 ComputeMaskedBits(Op.getOperand(0), Mask2, KnownZero, KnownOne,Depth+1);
1979 assert((KnownZero & KnownOne) == 0&&"Bits known to be one AND zero?");
1984 // Since the result is less than or equal to either operand, any leading
1985 // zero bits in either operand must also exist in the result.
1986 APInt AllOnes = APInt::getAllOnesValue(BitWidth);
1987 ComputeMaskedBits(Op.getOperand(0), AllOnes, KnownZero, KnownOne,
1989 ComputeMaskedBits(Op.getOperand(1), AllOnes, KnownZero2, KnownOne2,
1992 uint32_t Leaders = std::max(KnownZero.countLeadingOnes(),
1993 KnownZero2.countLeadingOnes());
1995 KnownZero = APInt::getHighBitsSet(BitWidth, Leaders) & Mask;
1999 // Allow the target to implement this method for its nodes.
2000 if (Op.getOpcode() >= ISD::BUILTIN_OP_END) {
2001 case ISD::INTRINSIC_WO_CHAIN:
2002 case ISD::INTRINSIC_W_CHAIN:
2003 case ISD::INTRINSIC_VOID:
2004 TLI.computeMaskedBitsForTargetNode(Op, Mask, KnownZero, KnownOne, *this,
2011 /// ComputeNumSignBits - Return the number of times the sign bit of the
2012 /// register is replicated into the other bits. We know that at least 1 bit
2013 /// is always equal to the sign bit (itself), but other cases can give us
2014 /// information. For example, immediately after an "SRA X, 2", we know that
2015 /// the top 3 bits are all equal to each other, so we return 3.
2016 unsigned SelectionDAG::ComputeNumSignBits(SDValue Op, unsigned Depth) const{
2017 EVT VT = Op.getValueType();
2018 assert(VT.isInteger() && "Invalid VT!");
2019 unsigned VTBits = VT.getScalarType().getSizeInBits();
2021 unsigned FirstAnswer = 1;
2024 return 1; // Limit search depth.
2026 switch (Op.getOpcode()) {
2028 case ISD::AssertSext:
2029 Tmp = cast<VTSDNode>(Op.getOperand(1))->getVT().getSizeInBits();
2030 return VTBits-Tmp+1;
2031 case ISD::AssertZext:
2032 Tmp = cast<VTSDNode>(Op.getOperand(1))->getVT().getSizeInBits();
2035 case ISD::Constant: {
2036 const APInt &Val = cast<ConstantSDNode>(Op)->getAPIntValue();
2037 // If negative, return # leading ones.
2038 if (Val.isNegative())
2039 return Val.countLeadingOnes();
2041 // Return # leading zeros.
2042 return Val.countLeadingZeros();
2045 case ISD::SIGN_EXTEND:
2046 Tmp = VTBits-Op.getOperand(0).getValueType().getScalarType().getSizeInBits();
2047 return ComputeNumSignBits(Op.getOperand(0), Depth+1) + Tmp;
2049 case ISD::SIGN_EXTEND_INREG:
2050 // Max of the input and what this extends.
2052 cast<VTSDNode>(Op.getOperand(1))->getVT().getScalarType().getSizeInBits();
2055 Tmp2 = ComputeNumSignBits(Op.getOperand(0), Depth+1);
2056 return std::max(Tmp, Tmp2);
2059 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
2060 // SRA X, C -> adds C sign bits.
2061 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
2062 Tmp += C->getZExtValue();
2063 if (Tmp > VTBits) Tmp = VTBits;
2067 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
2068 // shl destroys sign bits.
2069 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
2070 if (C->getZExtValue() >= VTBits || // Bad shift.
2071 C->getZExtValue() >= Tmp) break; // Shifted all sign bits out.
2072 return Tmp - C->getZExtValue();
2077 case ISD::XOR: // NOT is handled here.
2078 // Logical binary ops preserve the number of sign bits at the worst.
2079 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
2081 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
2082 FirstAnswer = std::min(Tmp, Tmp2);
2083 // We computed what we know about the sign bits as our first
2084 // answer. Now proceed to the generic code that uses
2085 // ComputeMaskedBits, and pick whichever answer is better.
2090 Tmp = ComputeNumSignBits(Op.getOperand(1), Depth+1);
2091 if (Tmp == 1) return 1; // Early out.
2092 Tmp2 = ComputeNumSignBits(Op.getOperand(2), Depth+1);
2093 return std::min(Tmp, Tmp2);
2101 if (Op.getResNo() != 1)
2103 // The boolean result conforms to getBooleanContents. Fall through.
2105 // If setcc returns 0/-1, all bits are sign bits.
2106 if (TLI.getBooleanContents() ==
2107 TargetLowering::ZeroOrNegativeOneBooleanContent)
2112 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Op.getOperand(1))) {
2113 unsigned RotAmt = C->getZExtValue() & (VTBits-1);
2115 // Handle rotate right by N like a rotate left by 32-N.
2116 if (Op.getOpcode() == ISD::ROTR)
2117 RotAmt = (VTBits-RotAmt) & (VTBits-1);
2119 // If we aren't rotating out all of the known-in sign bits, return the
2120 // number that are left. This handles rotl(sext(x), 1) for example.
2121 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
2122 if (Tmp > RotAmt+1) return Tmp-RotAmt;
2126 // Add can have at most one carry bit. Thus we know that the output
2127 // is, at worst, one more bit than the inputs.
2128 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
2129 if (Tmp == 1) return 1; // Early out.
2131 // Special case decrementing a value (ADD X, -1):
2132 if (ConstantSDNode *CRHS = dyn_cast<ConstantSDNode>(Op.getOperand(1)))
2133 if (CRHS->isAllOnesValue()) {
2134 APInt KnownZero, KnownOne;
2135 APInt Mask = APInt::getAllOnesValue(VTBits);
2136 ComputeMaskedBits(Op.getOperand(0), Mask, KnownZero, KnownOne, Depth+1);
2138 // If the input is known to be 0 or 1, the output is 0/-1, which is all
2140 if ((KnownZero | APInt(VTBits, 1)) == Mask)
2143 // If we are subtracting one from a positive number, there is no carry
2144 // out of the result.
2145 if (KnownZero.isNegative())
2149 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
2150 if (Tmp2 == 1) return 1;
2151 return std::min(Tmp, Tmp2)-1;
2155 Tmp2 = ComputeNumSignBits(Op.getOperand(1), Depth+1);
2156 if (Tmp2 == 1) return 1;
2159 if (ConstantSDNode *CLHS = dyn_cast<ConstantSDNode>(Op.getOperand(0)))
2160 if (CLHS->isNullValue()) {
2161 APInt KnownZero, KnownOne;
2162 APInt Mask = APInt::getAllOnesValue(VTBits);
2163 ComputeMaskedBits(Op.getOperand(1), Mask, KnownZero, KnownOne, Depth+1);
2164 // If the input is known to be 0 or 1, the output is 0/-1, which is all
2166 if ((KnownZero | APInt(VTBits, 1)) == Mask)
2169 // If the input is known to be positive (the sign bit is known clear),
2170 // the output of the NEG has the same number of sign bits as the input.
2171 if (KnownZero.isNegative())
2174 // Otherwise, we treat this like a SUB.
2177 // Sub can have at most one carry bit. Thus we know that the output
2178 // is, at worst, one more bit than the inputs.
2179 Tmp = ComputeNumSignBits(Op.getOperand(0), Depth+1);
2180 if (Tmp == 1) return 1; // Early out.
2181 return std::min(Tmp, Tmp2)-1;
2184 // FIXME: it's tricky to do anything useful for this, but it is an important
2185 // case for targets like X86.
2189 // Handle LOADX separately here. EXTLOAD case will fallthrough.
2190 if (Op.getOpcode() == ISD::LOAD) {
2191 LoadSDNode *LD = cast<LoadSDNode>(Op);
2192 unsigned ExtType = LD->getExtensionType();
2195 case ISD::SEXTLOAD: // '17' bits known
2196 Tmp = LD->getMemoryVT().getScalarType().getSizeInBits();
2197 return VTBits-Tmp+1;
2198 case ISD::ZEXTLOAD: // '16' bits known
2199 Tmp = LD->getMemoryVT().getScalarType().getSizeInBits();
2204 // Allow the target to implement this method for its nodes.
2205 if (Op.getOpcode() >= ISD::BUILTIN_OP_END ||
2206 Op.getOpcode() == ISD::INTRINSIC_WO_CHAIN ||
2207 Op.getOpcode() == ISD::INTRINSIC_W_CHAIN ||
2208 Op.getOpcode() == ISD::INTRINSIC_VOID) {
2209 unsigned NumBits = TLI.ComputeNumSignBitsForTargetNode(Op, Depth);
2210 if (NumBits > 1) FirstAnswer = std::max(FirstAnswer, NumBits);
2213 // Finally, if we can prove that the top bits of the result are 0's or 1's,
2214 // use this information.
2215 APInt KnownZero, KnownOne;
2216 APInt Mask = APInt::getAllOnesValue(VTBits);
2217 ComputeMaskedBits(Op, Mask, KnownZero, KnownOne, Depth);
2219 if (KnownZero.isNegative()) { // sign bit is 0
2221 } else if (KnownOne.isNegative()) { // sign bit is 1;
2228 // Okay, we know that the sign bit in Mask is set. Use CLZ to determine
2229 // the number of identical bits in the top of the input value.
2231 Mask <<= Mask.getBitWidth()-VTBits;
2232 // Return # leading zeros. We use 'min' here in case Val was zero before
2233 // shifting. We don't want to return '64' as for an i32 "0".
2234 return std::max(FirstAnswer, std::min(VTBits, Mask.countLeadingZeros()));
2237 bool SelectionDAG::isKnownNeverNaN(SDValue Op) const {
2238 // If we're told that NaNs won't happen, assume they won't.
2239 if (FiniteOnlyFPMath())
2242 // If the value is a constant, we can obviously see if it is a NaN or not.
2243 if (const ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Op))
2244 return !C->getValueAPF().isNaN();
2246 // TODO: Recognize more cases here.
2251 bool SelectionDAG::isKnownNeverZero(SDValue Op) const {
2252 // If the value is a constant, we can obviously see if it is a zero or not.
2253 if (const ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Op))
2254 return !C->isZero();
2256 // TODO: Recognize more cases here.
2261 bool SelectionDAG::isEqualTo(SDValue A, SDValue B) const {
2262 // Check the obvious case.
2263 if (A == B) return true;
2265 // For for negative and positive zero.
2266 if (const ConstantFPSDNode *CA = dyn_cast<ConstantFPSDNode>(A))
2267 if (const ConstantFPSDNode *CB = dyn_cast<ConstantFPSDNode>(B))
2268 if (CA->isZero() && CB->isZero()) return true;
2270 // Otherwise they may not be equal.
2274 bool SelectionDAG::isVerifiedDebugInfoDesc(SDValue Op) const {
2275 GlobalAddressSDNode *GA = dyn_cast<GlobalAddressSDNode>(Op);
2276 if (!GA) return false;
2277 if (GA->getOffset() != 0) return false;
2278 const GlobalVariable *GV = dyn_cast<GlobalVariable>(GA->getGlobal());
2279 if (!GV) return false;
2280 return MF->getMMI().hasDebugInfo();
2284 /// getShuffleScalarElt - Returns the scalar element that will make up the ith
2285 /// element of the result of the vector shuffle.
2286 SDValue SelectionDAG::getShuffleScalarElt(const ShuffleVectorSDNode *N,
2288 EVT VT = N->getValueType(0);
2289 DebugLoc dl = N->getDebugLoc();
2290 if (N->getMaskElt(i) < 0)
2291 return getUNDEF(VT.getVectorElementType());
2292 unsigned Index = N->getMaskElt(i);
2293 unsigned NumElems = VT.getVectorNumElements();
2294 SDValue V = (Index < NumElems) ? N->getOperand(0) : N->getOperand(1);
2297 if (V.getOpcode() == ISD::BIT_CONVERT) {
2298 V = V.getOperand(0);
2299 EVT VVT = V.getValueType();
2300 if (!VVT.isVector() || VVT.getVectorNumElements() != (unsigned)NumElems)
2303 if (V.getOpcode() == ISD::SCALAR_TO_VECTOR)
2304 return (Index == 0) ? V.getOperand(0)
2305 : getUNDEF(VT.getVectorElementType());
2306 if (V.getOpcode() == ISD::BUILD_VECTOR)
2307 return V.getOperand(Index);
2308 if (const ShuffleVectorSDNode *SVN = dyn_cast<ShuffleVectorSDNode>(V))
2309 return getShuffleScalarElt(SVN, Index);
2314 /// getNode - Gets or creates the specified node.
2316 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, EVT VT) {
2317 FoldingSetNodeID ID;
2318 AddNodeIDNode(ID, Opcode, getVTList(VT), 0, 0);
2320 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2321 return SDValue(E, 0);
2323 SDNode *N = new (NodeAllocator) SDNode(Opcode, DL, getVTList(VT));
2324 CSEMap.InsertNode(N, IP);
2326 AllNodes.push_back(N);
2330 return SDValue(N, 0);
2333 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL,
2334 EVT VT, SDValue Operand) {
2335 // Constant fold unary operations with an integer constant operand.
2336 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Operand.getNode())) {
2337 const APInt &Val = C->getAPIntValue();
2340 case ISD::SIGN_EXTEND:
2341 return getConstant(APInt(Val).sextOrTrunc(VT.getSizeInBits()), VT);
2342 case ISD::ANY_EXTEND:
2343 case ISD::ZERO_EXTEND:
2345 return getConstant(APInt(Val).zextOrTrunc(VT.getSizeInBits()), VT);
2346 case ISD::UINT_TO_FP:
2347 case ISD::SINT_TO_FP: {
2348 const uint64_t zero[] = {0, 0};
2349 // No compile time operations on ppcf128.
2350 if (VT == MVT::ppcf128) break;
2351 APFloat apf = APFloat(APInt(VT.getSizeInBits(), 2, zero));
2352 (void)apf.convertFromAPInt(Val,
2353 Opcode==ISD::SINT_TO_FP,
2354 APFloat::rmNearestTiesToEven);
2355 return getConstantFP(apf, VT);
2357 case ISD::BIT_CONVERT:
2358 if (VT == MVT::f32 && C->getValueType(0) == MVT::i32)
2359 return getConstantFP(Val.bitsToFloat(), VT);
2360 else if (VT == MVT::f64 && C->getValueType(0) == MVT::i64)
2361 return getConstantFP(Val.bitsToDouble(), VT);
2364 return getConstant(Val.byteSwap(), VT);
2366 return getConstant(Val.countPopulation(), VT);
2368 return getConstant(Val.countLeadingZeros(), VT);
2370 return getConstant(Val.countTrailingZeros(), VT);
2374 // Constant fold unary operations with a floating point constant operand.
2375 if (ConstantFPSDNode *C = dyn_cast<ConstantFPSDNode>(Operand.getNode())) {
2376 APFloat V = C->getValueAPF(); // make copy
2377 if (VT != MVT::ppcf128 && Operand.getValueType() != MVT::ppcf128) {
2381 return getConstantFP(V, VT);
2384 return getConstantFP(V, VT);
2386 case ISD::FP_EXTEND: {
2388 // This can return overflow, underflow, or inexact; we don't care.
2389 // FIXME need to be more flexible about rounding mode.
2390 (void)V.convert(*EVTToAPFloatSemantics(VT),
2391 APFloat::rmNearestTiesToEven, &ignored);
2392 return getConstantFP(V, VT);
2394 case ISD::FP_TO_SINT:
2395 case ISD::FP_TO_UINT: {
2398 assert(integerPartWidth >= 64);
2399 // FIXME need to be more flexible about rounding mode.
2400 APFloat::opStatus s = V.convertToInteger(x, VT.getSizeInBits(),
2401 Opcode==ISD::FP_TO_SINT,
2402 APFloat::rmTowardZero, &ignored);
2403 if (s==APFloat::opInvalidOp) // inexact is OK, in fact usual
2405 APInt api(VT.getSizeInBits(), 2, x);
2406 return getConstant(api, VT);
2408 case ISD::BIT_CONVERT:
2409 if (VT == MVT::i32 && C->getValueType(0) == MVT::f32)
2410 return getConstant((uint32_t)V.bitcastToAPInt().getZExtValue(), VT);
2411 else if (VT == MVT::i64 && C->getValueType(0) == MVT::f64)
2412 return getConstant(V.bitcastToAPInt().getZExtValue(), VT);
2418 unsigned OpOpcode = Operand.getNode()->getOpcode();
2420 case ISD::TokenFactor:
2421 case ISD::MERGE_VALUES:
2422 case ISD::CONCAT_VECTORS:
2423 return Operand; // Factor, merge or concat of one node? No need.
2424 case ISD::FP_ROUND: llvm_unreachable("Invalid method to make FP_ROUND node");
2425 case ISD::FP_EXTEND:
2426 assert(VT.isFloatingPoint() &&
2427 Operand.getValueType().isFloatingPoint() && "Invalid FP cast!");
2428 if (Operand.getValueType() == VT) return Operand; // noop conversion.
2429 assert((!VT.isVector() ||
2430 VT.getVectorNumElements() ==
2431 Operand.getValueType().getVectorNumElements()) &&
2432 "Vector element count mismatch!");
2433 if (Operand.getOpcode() == ISD::UNDEF)
2434 return getUNDEF(VT);
2436 case ISD::SIGN_EXTEND:
2437 assert(VT.isInteger() && Operand.getValueType().isInteger() &&
2438 "Invalid SIGN_EXTEND!");
2439 if (Operand.getValueType() == VT) return Operand; // noop extension
2440 assert(Operand.getValueType().getScalarType().bitsLT(VT.getScalarType()) &&
2441 "Invalid sext node, dst < src!");
2442 assert((!VT.isVector() ||
2443 VT.getVectorNumElements() ==
2444 Operand.getValueType().getVectorNumElements()) &&
2445 "Vector element count mismatch!");
2446 if (OpOpcode == ISD::SIGN_EXTEND || OpOpcode == ISD::ZERO_EXTEND)
2447 return getNode(OpOpcode, DL, VT, Operand.getNode()->getOperand(0));
2449 case ISD::ZERO_EXTEND:
2450 assert(VT.isInteger() && Operand.getValueType().isInteger() &&
2451 "Invalid ZERO_EXTEND!");
2452 if (Operand.getValueType() == VT) return Operand; // noop extension
2453 assert(Operand.getValueType().getScalarType().bitsLT(VT.getScalarType()) &&
2454 "Invalid zext node, dst < src!");
2455 assert((!VT.isVector() ||
2456 VT.getVectorNumElements() ==
2457 Operand.getValueType().getVectorNumElements()) &&
2458 "Vector element count mismatch!");
2459 if (OpOpcode == ISD::ZERO_EXTEND) // (zext (zext x)) -> (zext x)
2460 return getNode(ISD::ZERO_EXTEND, DL, VT,
2461 Operand.getNode()->getOperand(0));
2463 case ISD::ANY_EXTEND:
2464 assert(VT.isInteger() && Operand.getValueType().isInteger() &&
2465 "Invalid ANY_EXTEND!");
2466 if (Operand.getValueType() == VT) return Operand; // noop extension
2467 assert(Operand.getValueType().getScalarType().bitsLT(VT.getScalarType()) &&
2468 "Invalid anyext node, dst < src!");
2469 assert((!VT.isVector() ||
2470 VT.getVectorNumElements() ==
2471 Operand.getValueType().getVectorNumElements()) &&
2472 "Vector element count mismatch!");
2474 if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
2475 OpOpcode == ISD::ANY_EXTEND)
2476 // (ext (zext x)) -> (zext x) and (ext (sext x)) -> (sext x)
2477 return getNode(OpOpcode, DL, VT, Operand.getNode()->getOperand(0));
2479 // (ext (trunx x)) -> x
2480 if (OpOpcode == ISD::TRUNCATE) {
2481 SDValue OpOp = Operand.getNode()->getOperand(0);
2482 if (OpOp.getValueType() == VT)
2487 assert(VT.isInteger() && Operand.getValueType().isInteger() &&
2488 "Invalid TRUNCATE!");
2489 if (Operand.getValueType() == VT) return Operand; // noop truncate
2490 assert(Operand.getValueType().getScalarType().bitsGT(VT.getScalarType()) &&
2491 "Invalid truncate node, src < dst!");
2492 assert((!VT.isVector() ||
2493 VT.getVectorNumElements() ==
2494 Operand.getValueType().getVectorNumElements()) &&
2495 "Vector element count mismatch!");
2496 if (OpOpcode == ISD::TRUNCATE)
2497 return getNode(ISD::TRUNCATE, DL, VT, Operand.getNode()->getOperand(0));
2498 else if (OpOpcode == ISD::ZERO_EXTEND || OpOpcode == ISD::SIGN_EXTEND ||
2499 OpOpcode == ISD::ANY_EXTEND) {
2500 // If the source is smaller than the dest, we still need an extend.
2501 if (Operand.getNode()->getOperand(0).getValueType().getScalarType()
2502 .bitsLT(VT.getScalarType()))
2503 return getNode(OpOpcode, DL, VT, Operand.getNode()->getOperand(0));
2504 else if (Operand.getNode()->getOperand(0).getValueType().bitsGT(VT))
2505 return getNode(ISD::TRUNCATE, DL, VT, Operand.getNode()->getOperand(0));
2507 return Operand.getNode()->getOperand(0);
2510 case ISD::BIT_CONVERT:
2511 // Basic sanity checking.
2512 assert(VT.getSizeInBits() == Operand.getValueType().getSizeInBits()
2513 && "Cannot BIT_CONVERT between types of different sizes!");
2514 if (VT == Operand.getValueType()) return Operand; // noop conversion.
2515 if (OpOpcode == ISD::BIT_CONVERT) // bitconv(bitconv(x)) -> bitconv(x)
2516 return getNode(ISD::BIT_CONVERT, DL, VT, Operand.getOperand(0));
2517 if (OpOpcode == ISD::UNDEF)
2518 return getUNDEF(VT);
2520 case ISD::SCALAR_TO_VECTOR:
2521 assert(VT.isVector() && !Operand.getValueType().isVector() &&
2522 (VT.getVectorElementType() == Operand.getValueType() ||
2523 (VT.getVectorElementType().isInteger() &&
2524 Operand.getValueType().isInteger() &&
2525 VT.getVectorElementType().bitsLE(Operand.getValueType()))) &&
2526 "Illegal SCALAR_TO_VECTOR node!");
2527 if (OpOpcode == ISD::UNDEF)
2528 return getUNDEF(VT);
2529 // scalar_to_vector(extract_vector_elt V, 0) -> V, top bits are undefined.
2530 if (OpOpcode == ISD::EXTRACT_VECTOR_ELT &&
2531 isa<ConstantSDNode>(Operand.getOperand(1)) &&
2532 Operand.getConstantOperandVal(1) == 0 &&
2533 Operand.getOperand(0).getValueType() == VT)
2534 return Operand.getOperand(0);
2537 // -(X-Y) -> (Y-X) is unsafe because when X==Y, -0.0 != +0.0
2538 if (UnsafeFPMath && OpOpcode == ISD::FSUB)
2539 return getNode(ISD::FSUB, DL, VT, Operand.getNode()->getOperand(1),
2540 Operand.getNode()->getOperand(0));
2541 if (OpOpcode == ISD::FNEG) // --X -> X
2542 return Operand.getNode()->getOperand(0);
2545 if (OpOpcode == ISD::FNEG) // abs(-X) -> abs(X)
2546 return getNode(ISD::FABS, DL, VT, Operand.getNode()->getOperand(0));
2551 SDVTList VTs = getVTList(VT);
2552 if (VT != MVT::Flag) { // Don't CSE flag producing nodes
2553 FoldingSetNodeID ID;
2554 SDValue Ops[1] = { Operand };
2555 AddNodeIDNode(ID, Opcode, VTs, Ops, 1);
2557 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2558 return SDValue(E, 0);
2560 N = new (NodeAllocator) UnarySDNode(Opcode, DL, VTs, Operand);
2561 CSEMap.InsertNode(N, IP);
2563 N = new (NodeAllocator) UnarySDNode(Opcode, DL, VTs, Operand);
2566 AllNodes.push_back(N);
2570 return SDValue(N, 0);
2573 SDValue SelectionDAG::FoldConstantArithmetic(unsigned Opcode,
2575 ConstantSDNode *Cst1,
2576 ConstantSDNode *Cst2) {
2577 const APInt &C1 = Cst1->getAPIntValue(), &C2 = Cst2->getAPIntValue();
2580 case ISD::ADD: return getConstant(C1 + C2, VT);
2581 case ISD::SUB: return getConstant(C1 - C2, VT);
2582 case ISD::MUL: return getConstant(C1 * C2, VT);
2584 if (C2.getBoolValue()) return getConstant(C1.udiv(C2), VT);
2587 if (C2.getBoolValue()) return getConstant(C1.urem(C2), VT);
2590 if (C2.getBoolValue()) return getConstant(C1.sdiv(C2), VT);
2593 if (C2.getBoolValue()) return getConstant(C1.srem(C2), VT);
2595 case ISD::AND: return getConstant(C1 & C2, VT);
2596 case ISD::OR: return getConstant(C1 | C2, VT);
2597 case ISD::XOR: return getConstant(C1 ^ C2, VT);
2598 case ISD::SHL: return getConstant(C1 << C2, VT);
2599 case ISD::SRL: return getConstant(C1.lshr(C2), VT);
2600 case ISD::SRA: return getConstant(C1.ashr(C2), VT);
2601 case ISD::ROTL: return getConstant(C1.rotl(C2), VT);
2602 case ISD::ROTR: return getConstant(C1.rotr(C2), VT);
2609 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, EVT VT,
2610 SDValue N1, SDValue N2) {
2611 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode());
2612 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.getNode());
2615 case ISD::TokenFactor:
2616 assert(VT == MVT::Other && N1.getValueType() == MVT::Other &&
2617 N2.getValueType() == MVT::Other && "Invalid token factor!");
2618 // Fold trivial token factors.
2619 if (N1.getOpcode() == ISD::EntryToken) return N2;
2620 if (N2.getOpcode() == ISD::EntryToken) return N1;
2621 if (N1 == N2) return N1;
2623 case ISD::CONCAT_VECTORS:
2624 // A CONCAT_VECTOR with all operands BUILD_VECTOR can be simplified to
2625 // one big BUILD_VECTOR.
2626 if (N1.getOpcode() == ISD::BUILD_VECTOR &&
2627 N2.getOpcode() == ISD::BUILD_VECTOR) {
2628 SmallVector<SDValue, 16> Elts(N1.getNode()->op_begin(), N1.getNode()->op_end());
2629 Elts.append(N2.getNode()->op_begin(), N2.getNode()->op_end());
2630 return getNode(ISD::BUILD_VECTOR, DL, VT, &Elts[0], Elts.size());
2634 assert(VT.isInteger() && "This operator does not apply to FP types!");
2635 assert(N1.getValueType() == N2.getValueType() &&
2636 N1.getValueType() == VT && "Binary operator types must match!");
2637 // (X & 0) -> 0. This commonly occurs when legalizing i64 values, so it's
2638 // worth handling here.
2639 if (N2C && N2C->isNullValue())
2641 if (N2C && N2C->isAllOnesValue()) // X & -1 -> X
2648 assert(VT.isInteger() && "This operator does not apply to FP types!");
2649 assert(N1.getValueType() == N2.getValueType() &&
2650 N1.getValueType() == VT && "Binary operator types must match!");
2651 // (X ^|+- 0) -> X. This commonly occurs when legalizing i64 values, so
2652 // it's worth handling here.
2653 if (N2C && N2C->isNullValue())
2663 assert(VT.isInteger() && "This operator does not apply to FP types!");
2664 assert(N1.getValueType() == N2.getValueType() &&
2665 N1.getValueType() == VT && "Binary operator types must match!");
2673 if (Opcode == ISD::FADD) {
2675 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N1))
2676 if (CFP->getValueAPF().isZero())
2679 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N2))
2680 if (CFP->getValueAPF().isZero())
2682 } else if (Opcode == ISD::FSUB) {
2684 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(N2))
2685 if (CFP->getValueAPF().isZero())
2689 assert(VT.isFloatingPoint() && "This operator only applies to FP types!");
2690 assert(N1.getValueType() == N2.getValueType() &&
2691 N1.getValueType() == VT && "Binary operator types must match!");
2693 case ISD::FCOPYSIGN: // N1 and result must match. N1/N2 need not match.
2694 assert(N1.getValueType() == VT &&
2695 N1.getValueType().isFloatingPoint() &&
2696 N2.getValueType().isFloatingPoint() &&
2697 "Invalid FCOPYSIGN!");
2704 assert(VT == N1.getValueType() &&
2705 "Shift operators return type must be the same as their first arg");
2706 assert(VT.isInteger() && N2.getValueType().isInteger() &&
2707 "Shifts only work on integers");
2709 // Always fold shifts of i1 values so the code generator doesn't need to
2710 // handle them. Since we know the size of the shift has to be less than the
2711 // size of the value, the shift/rotate count is guaranteed to be zero.
2714 if (N2C && N2C->isNullValue())
2717 case ISD::FP_ROUND_INREG: {
2718 EVT EVT = cast<VTSDNode>(N2)->getVT();
2719 assert(VT == N1.getValueType() && "Not an inreg round!");
2720 assert(VT.isFloatingPoint() && EVT.isFloatingPoint() &&
2721 "Cannot FP_ROUND_INREG integer types");
2722 assert(EVT.isVector() == VT.isVector() &&
2723 "FP_ROUND_INREG type should be vector iff the operand "
2725 assert((!EVT.isVector() ||
2726 EVT.getVectorNumElements() == VT.getVectorNumElements()) &&
2727 "Vector element counts must match in FP_ROUND_INREG");
2728 assert(EVT.bitsLE(VT) && "Not rounding down!");
2729 if (cast<VTSDNode>(N2)->getVT() == VT) return N1; // Not actually rounding.
2733 assert(VT.isFloatingPoint() &&
2734 N1.getValueType().isFloatingPoint() &&
2735 VT.bitsLE(N1.getValueType()) &&
2736 isa<ConstantSDNode>(N2) && "Invalid FP_ROUND!");
2737 if (N1.getValueType() == VT) return N1; // noop conversion.
2739 case ISD::AssertSext:
2740 case ISD::AssertZext: {
2741 EVT EVT = cast<VTSDNode>(N2)->getVT();
2742 assert(VT == N1.getValueType() && "Not an inreg extend!");
2743 assert(VT.isInteger() && EVT.isInteger() &&
2744 "Cannot *_EXTEND_INREG FP types");
2745 assert(!EVT.isVector() &&
2746 "AssertSExt/AssertZExt type should be the vector element type "
2747 "rather than the vector type!");
2748 assert(EVT.bitsLE(VT) && "Not extending!");
2749 if (VT == EVT) return N1; // noop assertion.
2752 case ISD::SIGN_EXTEND_INREG: {
2753 EVT EVT = cast<VTSDNode>(N2)->getVT();
2754 assert(VT == N1.getValueType() && "Not an inreg extend!");
2755 assert(VT.isInteger() && EVT.isInteger() &&
2756 "Cannot *_EXTEND_INREG FP types");
2757 assert(EVT.isVector() == VT.isVector() &&
2758 "SIGN_EXTEND_INREG type should be vector iff the operand "
2760 assert((!EVT.isVector() ||
2761 EVT.getVectorNumElements() == VT.getVectorNumElements()) &&
2762 "Vector element counts must match in SIGN_EXTEND_INREG");
2763 assert(EVT.bitsLE(VT) && "Not extending!");
2764 if (EVT == VT) return N1; // Not actually extending
2767 APInt Val = N1C->getAPIntValue();
2768 unsigned FromBits = EVT.getScalarType().getSizeInBits();
2769 Val <<= Val.getBitWidth()-FromBits;
2770 Val = Val.ashr(Val.getBitWidth()-FromBits);
2771 return getConstant(Val, VT);
2775 case ISD::EXTRACT_VECTOR_ELT:
2776 // EXTRACT_VECTOR_ELT of an UNDEF is an UNDEF.
2777 if (N1.getOpcode() == ISD::UNDEF)
2778 return getUNDEF(VT);
2780 // EXTRACT_VECTOR_ELT of CONCAT_VECTORS is often formed while lowering is
2781 // expanding copies of large vectors from registers.
2783 N1.getOpcode() == ISD::CONCAT_VECTORS &&
2784 N1.getNumOperands() > 0) {
2786 N1.getOperand(0).getValueType().getVectorNumElements();
2787 return getNode(ISD::EXTRACT_VECTOR_ELT, DL, VT,
2788 N1.getOperand(N2C->getZExtValue() / Factor),
2789 getConstant(N2C->getZExtValue() % Factor,
2790 N2.getValueType()));
2793 // EXTRACT_VECTOR_ELT of BUILD_VECTOR is often formed while lowering is
2794 // expanding large vector constants.
2795 if (N2C && N1.getOpcode() == ISD::BUILD_VECTOR) {
2796 SDValue Elt = N1.getOperand(N2C->getZExtValue());
2797 EVT VEltTy = N1.getValueType().getVectorElementType();
2798 if (Elt.getValueType() != VEltTy) {
2799 // If the vector element type is not legal, the BUILD_VECTOR operands
2800 // are promoted and implicitly truncated. Make that explicit here.
2801 Elt = getNode(ISD::TRUNCATE, DL, VEltTy, Elt);
2804 // If the vector element type is not legal, the EXTRACT_VECTOR_ELT
2805 // result is implicitly extended.
2806 Elt = getNode(ISD::ANY_EXTEND, DL, VT, Elt);
2811 // EXTRACT_VECTOR_ELT of INSERT_VECTOR_ELT is often formed when vector
2812 // operations are lowered to scalars.
2813 if (N1.getOpcode() == ISD::INSERT_VECTOR_ELT) {
2814 // If the indices are the same, return the inserted element else
2815 // if the indices are known different, extract the element from
2816 // the original vector.
2817 SDValue N1Op2 = N1.getOperand(2);
2818 ConstantSDNode *N1Op2C = dyn_cast<ConstantSDNode>(N1Op2.getNode());
2820 if (N1Op2C && N2C) {
2821 if (N1Op2C->getZExtValue() == N2C->getZExtValue()) {
2822 if (VT == N1.getOperand(1).getValueType())
2823 return N1.getOperand(1);
2825 return getSExtOrTrunc(N1.getOperand(1), DL, VT);
2828 return getNode(ISD::EXTRACT_VECTOR_ELT, DL, VT, N1.getOperand(0), N2);
2832 case ISD::EXTRACT_ELEMENT:
2833 assert(N2C && (unsigned)N2C->getZExtValue() < 2 && "Bad EXTRACT_ELEMENT!");
2834 assert(!N1.getValueType().isVector() && !VT.isVector() &&
2835 (N1.getValueType().isInteger() == VT.isInteger()) &&
2836 "Wrong types for EXTRACT_ELEMENT!");
2838 // EXTRACT_ELEMENT of BUILD_PAIR is often formed while legalize is expanding
2839 // 64-bit integers into 32-bit parts. Instead of building the extract of
2840 // the BUILD_PAIR, only to have legalize rip it apart, just do it now.
2841 if (N1.getOpcode() == ISD::BUILD_PAIR)
2842 return N1.getOperand(N2C->getZExtValue());
2844 // EXTRACT_ELEMENT of a constant int is also very common.
2845 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(N1)) {
2846 unsigned ElementSize = VT.getSizeInBits();
2847 unsigned Shift = ElementSize * N2C->getZExtValue();
2848 APInt ShiftedVal = C->getAPIntValue().lshr(Shift);
2849 return getConstant(ShiftedVal.trunc(ElementSize), VT);
2852 case ISD::EXTRACT_SUBVECTOR:
2853 if (N1.getValueType() == VT) // Trivial extraction.
2860 SDValue SV = FoldConstantArithmetic(Opcode, VT, N1C, N2C);
2861 if (SV.getNode()) return SV;
2862 } else { // Cannonicalize constant to RHS if commutative
2863 if (isCommutativeBinOp(Opcode)) {
2864 std::swap(N1C, N2C);
2870 // Constant fold FP operations.
2871 ConstantFPSDNode *N1CFP = dyn_cast<ConstantFPSDNode>(N1.getNode());
2872 ConstantFPSDNode *N2CFP = dyn_cast<ConstantFPSDNode>(N2.getNode());
2874 if (!N2CFP && isCommutativeBinOp(Opcode)) {
2875 // Cannonicalize constant to RHS if commutative
2876 std::swap(N1CFP, N2CFP);
2878 } else if (N2CFP && VT != MVT::ppcf128) {
2879 APFloat V1 = N1CFP->getValueAPF(), V2 = N2CFP->getValueAPF();
2880 APFloat::opStatus s;
2883 s = V1.add(V2, APFloat::rmNearestTiesToEven);
2884 if (s != APFloat::opInvalidOp)
2885 return getConstantFP(V1, VT);
2888 s = V1.subtract(V2, APFloat::rmNearestTiesToEven);
2889 if (s!=APFloat::opInvalidOp)
2890 return getConstantFP(V1, VT);
2893 s = V1.multiply(V2, APFloat::rmNearestTiesToEven);
2894 if (s!=APFloat::opInvalidOp)
2895 return getConstantFP(V1, VT);
2898 s = V1.divide(V2, APFloat::rmNearestTiesToEven);
2899 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2900 return getConstantFP(V1, VT);
2903 s = V1.mod(V2, APFloat::rmNearestTiesToEven);
2904 if (s!=APFloat::opInvalidOp && s!=APFloat::opDivByZero)
2905 return getConstantFP(V1, VT);
2907 case ISD::FCOPYSIGN:
2909 return getConstantFP(V1, VT);
2915 // Canonicalize an UNDEF to the RHS, even over a constant.
2916 if (N1.getOpcode() == ISD::UNDEF) {
2917 if (isCommutativeBinOp(Opcode)) {
2921 case ISD::FP_ROUND_INREG:
2922 case ISD::SIGN_EXTEND_INREG:
2928 return N1; // fold op(undef, arg2) -> undef
2936 return getConstant(0, VT); // fold op(undef, arg2) -> 0
2937 // For vectors, we can't easily build an all zero vector, just return
2944 // Fold a bunch of operators when the RHS is undef.
2945 if (N2.getOpcode() == ISD::UNDEF) {
2948 if (N1.getOpcode() == ISD::UNDEF)
2949 // Handle undef ^ undef -> 0 special case. This is a common
2951 return getConstant(0, VT);
2961 return N2; // fold op(arg1, undef) -> undef
2975 return getConstant(0, VT); // fold op(arg1, undef) -> 0
2976 // For vectors, we can't easily build an all zero vector, just return
2981 return getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), VT);
2982 // For vectors, we can't easily build an all one vector, just return
2990 // Memoize this node if possible.
2992 SDVTList VTs = getVTList(VT);
2993 if (VT != MVT::Flag) {
2994 SDValue Ops[] = { N1, N2 };
2995 FoldingSetNodeID ID;
2996 AddNodeIDNode(ID, Opcode, VTs, Ops, 2);
2998 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
2999 return SDValue(E, 0);
3001 N = new (NodeAllocator) BinarySDNode(Opcode, DL, VTs, N1, N2);
3002 CSEMap.InsertNode(N, IP);
3004 N = new (NodeAllocator) BinarySDNode(Opcode, DL, VTs, N1, N2);
3007 AllNodes.push_back(N);
3011 return SDValue(N, 0);
3014 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, EVT VT,
3015 SDValue N1, SDValue N2, SDValue N3) {
3016 // Perform various simplifications.
3017 ConstantSDNode *N1C = dyn_cast<ConstantSDNode>(N1.getNode());
3018 ConstantSDNode *N2C = dyn_cast<ConstantSDNode>(N2.getNode());
3020 case ISD::CONCAT_VECTORS:
3021 // A CONCAT_VECTOR with all operands BUILD_VECTOR can be simplified to
3022 // one big BUILD_VECTOR.
3023 if (N1.getOpcode() == ISD::BUILD_VECTOR &&
3024 N2.getOpcode() == ISD::BUILD_VECTOR &&
3025 N3.getOpcode() == ISD::BUILD_VECTOR) {
3026 SmallVector<SDValue, 16> Elts(N1.getNode()->op_begin(), N1.getNode()->op_end());
3027 Elts.append(N2.getNode()->op_begin(), N2.getNode()->op_end());
3028 Elts.append(N3.getNode()->op_begin(), N3.getNode()->op_end());
3029 return getNode(ISD::BUILD_VECTOR, DL, VT, &Elts[0], Elts.size());
3033 // Use FoldSetCC to simplify SETCC's.
3034 SDValue Simp = FoldSetCC(VT, N1, N2, cast<CondCodeSDNode>(N3)->get(), DL);
3035 if (Simp.getNode()) return Simp;
3040 if (N1C->getZExtValue())
3041 return N2; // select true, X, Y -> X
3043 return N3; // select false, X, Y -> Y
3046 if (N2 == N3) return N2; // select C, X, X -> X
3050 if (N2C->getZExtValue()) // Unconditional branch
3051 return getNode(ISD::BR, DL, MVT::Other, N1, N3);
3053 return N1; // Never-taken branch
3056 case ISD::VECTOR_SHUFFLE:
3057 llvm_unreachable("should use getVectorShuffle constructor!");
3059 case ISD::BIT_CONVERT:
3060 // Fold bit_convert nodes from a type to themselves.
3061 if (N1.getValueType() == VT)
3066 // Memoize node if it doesn't produce a flag.
3068 SDVTList VTs = getVTList(VT);
3069 if (VT != MVT::Flag) {
3070 SDValue Ops[] = { N1, N2, N3 };
3071 FoldingSetNodeID ID;
3072 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
3074 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
3075 return SDValue(E, 0);
3077 N = new (NodeAllocator) TernarySDNode(Opcode, DL, VTs, N1, N2, N3);
3078 CSEMap.InsertNode(N, IP);
3080 N = new (NodeAllocator) TernarySDNode(Opcode, DL, VTs, N1, N2, N3);
3083 AllNodes.push_back(N);
3087 return SDValue(N, 0);
3090 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, EVT VT,
3091 SDValue N1, SDValue N2, SDValue N3,
3093 SDValue Ops[] = { N1, N2, N3, N4 };
3094 return getNode(Opcode, DL, VT, Ops, 4);
3097 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, EVT VT,
3098 SDValue N1, SDValue N2, SDValue N3,
3099 SDValue N4, SDValue N5) {
3100 SDValue Ops[] = { N1, N2, N3, N4, N5 };
3101 return getNode(Opcode, DL, VT, Ops, 5);
3104 /// getStackArgumentTokenFactor - Compute a TokenFactor to force all
3105 /// the incoming stack arguments to be loaded from the stack.
3106 SDValue SelectionDAG::getStackArgumentTokenFactor(SDValue Chain) {
3107 SmallVector<SDValue, 8> ArgChains;
3109 // Include the original chain at the beginning of the list. When this is
3110 // used by target LowerCall hooks, this helps legalize find the
3111 // CALLSEQ_BEGIN node.
3112 ArgChains.push_back(Chain);
3114 // Add a chain value for each stack argument.
3115 for (SDNode::use_iterator U = getEntryNode().getNode()->use_begin(),
3116 UE = getEntryNode().getNode()->use_end(); U != UE; ++U)
3117 if (LoadSDNode *L = dyn_cast<LoadSDNode>(*U))
3118 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(L->getBasePtr()))
3119 if (FI->getIndex() < 0)
3120 ArgChains.push_back(SDValue(L, 1));
3122 // Build a tokenfactor for all the chains.
3123 return getNode(ISD::TokenFactor, Chain.getDebugLoc(), MVT::Other,
3124 &ArgChains[0], ArgChains.size());
3127 /// getMemsetValue - Vectorized representation of the memset value
3129 static SDValue getMemsetValue(SDValue Value, EVT VT, SelectionDAG &DAG,
3131 assert(Value.getOpcode() != ISD::UNDEF);
3133 unsigned NumBits = VT.getScalarType().getSizeInBits();
3134 if (ConstantSDNode *C = dyn_cast<ConstantSDNode>(Value)) {
3135 APInt Val = APInt(NumBits, C->getZExtValue() & 255);
3137 for (unsigned i = NumBits; i > 8; i >>= 1) {
3138 Val = (Val << Shift) | Val;
3142 return DAG.getConstant(Val, VT);
3143 return DAG.getConstantFP(APFloat(Val), VT);
3146 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3147 Value = DAG.getNode(ISD::ZERO_EXTEND, dl, VT, Value);
3149 for (unsigned i = NumBits; i > 8; i >>= 1) {
3150 Value = DAG.getNode(ISD::OR, dl, VT,
3151 DAG.getNode(ISD::SHL, dl, VT, Value,
3152 DAG.getConstant(Shift,
3153 TLI.getShiftAmountTy())),
3161 /// getMemsetStringVal - Similar to getMemsetValue. Except this is only
3162 /// used when a memcpy is turned into a memset when the source is a constant
3164 static SDValue getMemsetStringVal(EVT VT, DebugLoc dl, SelectionDAG &DAG,
3165 const TargetLowering &TLI,
3166 std::string &Str, unsigned Offset) {
3167 // Handle vector with all elements zero.
3170 return DAG.getConstant(0, VT);
3171 else if (VT.getSimpleVT().SimpleTy == MVT::f32 ||
3172 VT.getSimpleVT().SimpleTy == MVT::f64)
3173 return DAG.getConstantFP(0.0, VT);
3174 else if (VT.isVector()) {
3175 unsigned NumElts = VT.getVectorNumElements();
3176 MVT EltVT = (VT.getVectorElementType() == MVT::f32) ? MVT::i32 : MVT::i64;
3177 return DAG.getNode(ISD::BIT_CONVERT, dl, VT,
3178 DAG.getConstant(0, EVT::getVectorVT(*DAG.getContext(),
3181 llvm_unreachable("Expected type!");
3184 assert(!VT.isVector() && "Can't handle vector type here!");
3185 unsigned NumBits = VT.getSizeInBits();
3186 unsigned MSB = NumBits / 8;
3188 if (TLI.isLittleEndian())
3189 Offset = Offset + MSB - 1;
3190 for (unsigned i = 0; i != MSB; ++i) {
3191 Val = (Val << 8) | (unsigned char)Str[Offset];
3192 Offset += TLI.isLittleEndian() ? -1 : 1;
3194 return DAG.getConstant(Val, VT);
3197 /// getMemBasePlusOffset - Returns base and offset node for the
3199 static SDValue getMemBasePlusOffset(SDValue Base, unsigned Offset,
3200 SelectionDAG &DAG) {
3201 EVT VT = Base.getValueType();
3202 return DAG.getNode(ISD::ADD, Base.getDebugLoc(),
3203 VT, Base, DAG.getConstant(Offset, VT));
3206 /// isMemSrcFromString - Returns true if memcpy source is a string constant.
3208 static bool isMemSrcFromString(SDValue Src, std::string &Str) {
3209 unsigned SrcDelta = 0;
3210 GlobalAddressSDNode *G = NULL;
3211 if (Src.getOpcode() == ISD::GlobalAddress)
3212 G = cast<GlobalAddressSDNode>(Src);
3213 else if (Src.getOpcode() == ISD::ADD &&
3214 Src.getOperand(0).getOpcode() == ISD::GlobalAddress &&
3215 Src.getOperand(1).getOpcode() == ISD::Constant) {
3216 G = cast<GlobalAddressSDNode>(Src.getOperand(0));
3217 SrcDelta = cast<ConstantSDNode>(Src.getOperand(1))->getZExtValue();
3222 const GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getGlobal());
3223 if (GV && GetConstantStringInfo(GV, Str, SrcDelta, false))
3229 /// FindOptimalMemOpLowering - Determines the optimial series memory ops
3230 /// to replace the memset / memcpy. Return true if the number of memory ops
3231 /// is below the threshold. It returns the types of the sequence of
3232 /// memory ops to perform memset / memcpy by reference.
3233 static bool FindOptimalMemOpLowering(std::vector<EVT> &MemOps,
3234 unsigned Limit, uint64_t Size,
3235 unsigned DstAlign, unsigned SrcAlign,
3236 bool NonScalarIntSafe,
3239 const TargetLowering &TLI) {
3240 assert((SrcAlign == 0 || SrcAlign >= DstAlign) &&
3241 "Expecting memcpy / memset source to meet alignment requirement!");
3242 // If 'SrcAlign' is zero, that means the memory operation does not need load
3243 // the value, i.e. memset or memcpy from constant string. Otherwise, it's
3244 // the inferred alignment of the source. 'DstAlign', on the other hand, is the
3245 // specified alignment of the memory operation. If it is zero, that means
3246 // it's possible to change the alignment of the destination. 'MemcpyStrSrc'
3247 // indicates whether the memcpy source is constant so it does not need to be
3249 EVT VT = TLI.getOptimalMemOpType(Size, DstAlign, SrcAlign,
3250 NonScalarIntSafe, MemcpyStrSrc,
3251 DAG.getMachineFunction());
3253 if (VT == MVT::Other) {
3254 if (DstAlign >= TLI.getTargetData()->getPointerPrefAlignment() ||
3255 TLI.allowsUnalignedMemoryAccesses(VT)) {
3256 VT = TLI.getPointerTy();
3258 switch (DstAlign & 7) {
3259 case 0: VT = MVT::i64; break;
3260 case 4: VT = MVT::i32; break;
3261 case 2: VT = MVT::i16; break;
3262 default: VT = MVT::i8; break;
3267 while (!TLI.isTypeLegal(LVT))
3268 LVT = (MVT::SimpleValueType)(LVT.SimpleTy - 1);
3269 assert(LVT.isInteger());
3275 // If we're optimizing for size, and there is a limit, bump the maximum number
3276 // of operations inserted down to 4. This is a wild guess that approximates
3277 // the size of a call to memcpy or memset (3 arguments + call).
3279 const Function *F = DAG.getMachineFunction().getFunction();
3280 if (F->hasFnAttr(Attribute::OptimizeForSize))
3284 unsigned NumMemOps = 0;
3286 unsigned VTSize = VT.getSizeInBits() / 8;
3287 while (VTSize > Size) {
3288 // For now, only use non-vector load / store's for the left-over pieces.
3289 if (VT.isVector() || VT.isFloatingPoint()) {
3291 while (!TLI.isTypeLegal(VT))
3292 VT = (MVT::SimpleValueType)(VT.getSimpleVT().SimpleTy - 1);
3293 VTSize = VT.getSizeInBits() / 8;
3295 // This can result in a type that is not legal on the target, e.g.
3296 // 1 or 2 bytes on PPC.
3297 VT = (MVT::SimpleValueType)(VT.getSimpleVT().SimpleTy - 1);
3302 if (++NumMemOps > Limit)
3304 MemOps.push_back(VT);
3311 static SDValue getMemcpyLoadsAndStores(SelectionDAG &DAG, DebugLoc dl,
3312 SDValue Chain, SDValue Dst,
3313 SDValue Src, uint64_t Size,
3314 unsigned Align, bool isVol,
3316 const Value *DstSV, uint64_t DstSVOff,
3317 const Value *SrcSV, uint64_t SrcSVOff) {
3318 // Turn a memcpy of undef to nop.
3319 if (Src.getOpcode() == ISD::UNDEF)
3322 // Expand memcpy to a series of load and store ops if the size operand falls
3323 // below a certain threshold.
3324 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3325 std::vector<EVT> MemOps;
3326 bool DstAlignCanChange = false;
3327 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
3328 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Dst);
3329 if (FI && !MFI->isFixedObjectIndex(FI->getIndex()))
3330 DstAlignCanChange = true;
3331 unsigned SrcAlign = DAG.InferPtrAlignment(Src);
3332 if (Align > SrcAlign)
3335 bool CopyFromStr = isMemSrcFromString(Src, Str);
3336 bool isZeroStr = CopyFromStr && Str.empty();
3337 unsigned Limit = AlwaysInline ? ~0U : TLI.getMaxStoresPerMemcpy();
3339 if (!FindOptimalMemOpLowering(MemOps, Limit, Size,
3340 (DstAlignCanChange ? 0 : Align),
3341 (isZeroStr ? 0 : SrcAlign),
3342 true, CopyFromStr, DAG, TLI))
3345 if (DstAlignCanChange) {
3346 const Type *Ty = MemOps[0].getTypeForEVT(*DAG.getContext());
3347 unsigned NewAlign = (unsigned) TLI.getTargetData()->getABITypeAlignment(Ty);
3348 if (NewAlign > Align) {
3349 // Give the stack frame object a larger alignment if needed.
3350 if (MFI->getObjectAlignment(FI->getIndex()) < NewAlign)
3351 MFI->setObjectAlignment(FI->getIndex(), NewAlign);
3356 SmallVector<SDValue, 8> OutChains;
3357 unsigned NumMemOps = MemOps.size();
3358 uint64_t SrcOff = 0, DstOff = 0;
3359 for (unsigned i = 0; i != NumMemOps; ++i) {
3361 unsigned VTSize = VT.getSizeInBits() / 8;
3362 SDValue Value, Store;
3365 (isZeroStr || (VT.isInteger() && !VT.isVector()))) {
3366 // It's unlikely a store of a vector immediate can be done in a single
3367 // instruction. It would require a load from a constantpool first.
3368 // We only handle zero vectors here.
3369 // FIXME: Handle other cases where store of vector immediate is done in
3370 // a single instruction.
3371 Value = getMemsetStringVal(VT, dl, DAG, TLI, Str, SrcOff);
3372 Store = DAG.getStore(Chain, dl, Value,
3373 getMemBasePlusOffset(Dst, DstOff, DAG),
3374 DstSV, DstSVOff + DstOff, isVol, false, Align);
3376 // The type might not be legal for the target. This should only happen
3377 // if the type is smaller than a legal type, as on PPC, so the right
3378 // thing to do is generate a LoadExt/StoreTrunc pair. These simplify
3379 // to Load/Store if NVT==VT.
3380 // FIXME does the case above also need this?
3381 EVT NVT = TLI.getTypeToTransformTo(*DAG.getContext(), VT);
3382 assert(NVT.bitsGE(VT));
3383 Value = DAG.getExtLoad(ISD::EXTLOAD, dl, NVT, Chain,
3384 getMemBasePlusOffset(Src, SrcOff, DAG),
3385 SrcSV, SrcSVOff + SrcOff, VT, isVol, false,
3386 MinAlign(SrcAlign, SrcOff));
3387 Store = DAG.getTruncStore(Chain, dl, Value,
3388 getMemBasePlusOffset(Dst, DstOff, DAG),
3389 DstSV, DstSVOff + DstOff, VT, isVol, false,
3392 OutChains.push_back(Store);
3397 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
3398 &OutChains[0], OutChains.size());
3401 static SDValue getMemmoveLoadsAndStores(SelectionDAG &DAG, DebugLoc dl,
3402 SDValue Chain, SDValue Dst,
3403 SDValue Src, uint64_t Size,
3404 unsigned Align, bool isVol,
3406 const Value *DstSV, uint64_t DstSVOff,
3407 const Value *SrcSV, uint64_t SrcSVOff) {
3408 // Turn a memmove of undef to nop.
3409 if (Src.getOpcode() == ISD::UNDEF)
3412 // Expand memmove to a series of load and store ops if the size operand falls
3413 // below a certain threshold.
3414 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3415 std::vector<EVT> MemOps;
3416 bool DstAlignCanChange = false;
3417 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
3418 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Dst);
3419 if (FI && !MFI->isFixedObjectIndex(FI->getIndex()))
3420 DstAlignCanChange = true;
3421 unsigned SrcAlign = DAG.InferPtrAlignment(Src);
3422 if (Align > SrcAlign)
3424 unsigned Limit = AlwaysInline ? ~0U : TLI.getMaxStoresPerMemmove();
3426 if (!FindOptimalMemOpLowering(MemOps, Limit, Size,
3427 (DstAlignCanChange ? 0 : Align),
3428 SrcAlign, true, false, DAG, TLI))
3431 if (DstAlignCanChange) {
3432 const Type *Ty = MemOps[0].getTypeForEVT(*DAG.getContext());
3433 unsigned NewAlign = (unsigned) TLI.getTargetData()->getABITypeAlignment(Ty);
3434 if (NewAlign > Align) {
3435 // Give the stack frame object a larger alignment if needed.
3436 if (MFI->getObjectAlignment(FI->getIndex()) < NewAlign)
3437 MFI->setObjectAlignment(FI->getIndex(), NewAlign);
3442 uint64_t SrcOff = 0, DstOff = 0;
3443 SmallVector<SDValue, 8> LoadValues;
3444 SmallVector<SDValue, 8> LoadChains;
3445 SmallVector<SDValue, 8> OutChains;
3446 unsigned NumMemOps = MemOps.size();
3447 for (unsigned i = 0; i < NumMemOps; i++) {
3449 unsigned VTSize = VT.getSizeInBits() / 8;
3450 SDValue Value, Store;
3452 Value = DAG.getLoad(VT, dl, Chain,
3453 getMemBasePlusOffset(Src, SrcOff, DAG),
3454 SrcSV, SrcSVOff + SrcOff, isVol, false, SrcAlign);
3455 LoadValues.push_back(Value);
3456 LoadChains.push_back(Value.getValue(1));
3459 Chain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
3460 &LoadChains[0], LoadChains.size());
3462 for (unsigned i = 0; i < NumMemOps; i++) {
3464 unsigned VTSize = VT.getSizeInBits() / 8;
3465 SDValue Value, Store;
3467 Store = DAG.getStore(Chain, dl, LoadValues[i],
3468 getMemBasePlusOffset(Dst, DstOff, DAG),
3469 DstSV, DstSVOff + DstOff, isVol, false, Align);
3470 OutChains.push_back(Store);
3474 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
3475 &OutChains[0], OutChains.size());
3478 static SDValue getMemsetStores(SelectionDAG &DAG, DebugLoc dl,
3479 SDValue Chain, SDValue Dst,
3480 SDValue Src, uint64_t Size,
3481 unsigned Align, bool isVol,
3482 const Value *DstSV, uint64_t DstSVOff) {
3483 // Turn a memset of undef to nop.
3484 if (Src.getOpcode() == ISD::UNDEF)
3487 // Expand memset to a series of load/store ops if the size operand
3488 // falls below a certain threshold.
3489 const TargetLowering &TLI = DAG.getTargetLoweringInfo();
3490 std::vector<EVT> MemOps;
3491 bool DstAlignCanChange = false;
3492 MachineFrameInfo *MFI = DAG.getMachineFunction().getFrameInfo();
3493 FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Dst);
3494 if (FI && !MFI->isFixedObjectIndex(FI->getIndex()))
3495 DstAlignCanChange = true;
3496 bool NonScalarIntSafe =
3497 isa<ConstantSDNode>(Src) && cast<ConstantSDNode>(Src)->isNullValue();
3498 if (!FindOptimalMemOpLowering(MemOps, TLI.getMaxStoresPerMemset(),
3499 Size, (DstAlignCanChange ? 0 : Align), 0,
3500 NonScalarIntSafe, false, DAG, TLI))
3503 if (DstAlignCanChange) {
3504 const Type *Ty = MemOps[0].getTypeForEVT(*DAG.getContext());
3505 unsigned NewAlign = (unsigned) TLI.getTargetData()->getABITypeAlignment(Ty);
3506 if (NewAlign > Align) {
3507 // Give the stack frame object a larger alignment if needed.
3508 if (MFI->getObjectAlignment(FI->getIndex()) < NewAlign)
3509 MFI->setObjectAlignment(FI->getIndex(), NewAlign);
3514 SmallVector<SDValue, 8> OutChains;
3515 uint64_t DstOff = 0;
3516 unsigned NumMemOps = MemOps.size();
3517 for (unsigned i = 0; i < NumMemOps; i++) {
3519 unsigned VTSize = VT.getSizeInBits() / 8;
3520 SDValue Value = getMemsetValue(Src, VT, DAG, dl);
3521 SDValue Store = DAG.getStore(Chain, dl, Value,
3522 getMemBasePlusOffset(Dst, DstOff, DAG),
3523 DstSV, DstSVOff + DstOff, isVol, false, 0);
3524 OutChains.push_back(Store);
3528 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
3529 &OutChains[0], OutChains.size());
3532 SDValue SelectionDAG::getMemcpy(SDValue Chain, DebugLoc dl, SDValue Dst,
3533 SDValue Src, SDValue Size,
3534 unsigned Align, bool isVol, bool AlwaysInline,
3535 const Value *DstSV, uint64_t DstSVOff,
3536 const Value *SrcSV, uint64_t SrcSVOff) {
3538 // Check to see if we should lower the memcpy to loads and stores first.
3539 // For cases within the target-specified limits, this is the best choice.
3540 ConstantSDNode *ConstantSize = dyn_cast<ConstantSDNode>(Size);
3542 // Memcpy with size zero? Just return the original chain.
3543 if (ConstantSize->isNullValue())
3546 SDValue Result = getMemcpyLoadsAndStores(*this, dl, Chain, Dst, Src,
3547 ConstantSize->getZExtValue(),Align,
3548 isVol, false, DstSV, DstSVOff, SrcSV, SrcSVOff);
3549 if (Result.getNode())
3553 // Then check to see if we should lower the memcpy with target-specific
3554 // code. If the target chooses to do this, this is the next best.
3556 TSI.EmitTargetCodeForMemcpy(*this, dl, Chain, Dst, Src, Size, Align,
3557 isVol, AlwaysInline,
3558 DstSV, DstSVOff, SrcSV, SrcSVOff);
3559 if (Result.getNode())
3562 // If we really need inline code and the target declined to provide it,
3563 // use a (potentially long) sequence of loads and stores.
3565 assert(ConstantSize && "AlwaysInline requires a constant size!");
3566 return getMemcpyLoadsAndStores(*this, dl, Chain, Dst, Src,
3567 ConstantSize->getZExtValue(), Align, isVol,
3568 true, DstSV, DstSVOff, SrcSV, SrcSVOff);
3571 // FIXME: If the memcpy is volatile (isVol), lowering it to a plain libc
3572 // memcpy is not guaranteed to be safe. libc memcpys aren't required to
3573 // respect volatile, so they may do things like read or write memory
3574 // beyond the given memory regions. But fixing this isn't easy, and most
3575 // people don't care.
3577 // Emit a library call.
3578 TargetLowering::ArgListTy Args;
3579 TargetLowering::ArgListEntry Entry;
3580 Entry.Ty = TLI.getTargetData()->getIntPtrType(*getContext());
3581 Entry.Node = Dst; Args.push_back(Entry);
3582 Entry.Node = Src; Args.push_back(Entry);
3583 Entry.Node = Size; Args.push_back(Entry);
3584 // FIXME: pass in DebugLoc
3585 std::pair<SDValue,SDValue> CallResult =
3586 TLI.LowerCallTo(Chain, Type::getVoidTy(*getContext()),
3587 false, false, false, false, 0,
3588 TLI.getLibcallCallingConv(RTLIB::MEMCPY), false,
3589 /*isReturnValueUsed=*/false,
3590 getExternalSymbol(TLI.getLibcallName(RTLIB::MEMCPY),
3591 TLI.getPointerTy()),
3593 return CallResult.second;
3596 SDValue SelectionDAG::getMemmove(SDValue Chain, DebugLoc dl, SDValue Dst,
3597 SDValue Src, SDValue Size,
3598 unsigned Align, bool isVol,
3599 const Value *DstSV, uint64_t DstSVOff,
3600 const Value *SrcSV, uint64_t SrcSVOff) {
3602 // Check to see if we should lower the memmove to loads and stores first.
3603 // For cases within the target-specified limits, this is the best choice.
3604 ConstantSDNode *ConstantSize = dyn_cast<ConstantSDNode>(Size);
3606 // Memmove with size zero? Just return the original chain.
3607 if (ConstantSize->isNullValue())
3611 getMemmoveLoadsAndStores(*this, dl, Chain, Dst, Src,
3612 ConstantSize->getZExtValue(), Align, isVol,
3613 false, DstSV, DstSVOff, SrcSV, SrcSVOff);
3614 if (Result.getNode())
3618 // Then check to see if we should lower the memmove with target-specific
3619 // code. If the target chooses to do this, this is the next best.
3621 TSI.EmitTargetCodeForMemmove(*this, dl, Chain, Dst, Src, Size, Align, isVol,
3622 DstSV, DstSVOff, SrcSV, SrcSVOff);
3623 if (Result.getNode())
3626 // FIXME: If the memmove is volatile, lowering it to plain libc memmove may
3627 // not be safe. See memcpy above for more details.
3629 // Emit a library call.
3630 TargetLowering::ArgListTy Args;
3631 TargetLowering::ArgListEntry Entry;
3632 Entry.Ty = TLI.getTargetData()->getIntPtrType(*getContext());
3633 Entry.Node = Dst; Args.push_back(Entry);
3634 Entry.Node = Src; Args.push_back(Entry);
3635 Entry.Node = Size; Args.push_back(Entry);
3636 // FIXME: pass in DebugLoc
3637 std::pair<SDValue,SDValue> CallResult =
3638 TLI.LowerCallTo(Chain, Type::getVoidTy(*getContext()),
3639 false, false, false, false, 0,
3640 TLI.getLibcallCallingConv(RTLIB::MEMMOVE), false,
3641 /*isReturnValueUsed=*/false,
3642 getExternalSymbol(TLI.getLibcallName(RTLIB::MEMMOVE),
3643 TLI.getPointerTy()),
3645 return CallResult.second;
3648 SDValue SelectionDAG::getMemset(SDValue Chain, DebugLoc dl, SDValue Dst,
3649 SDValue Src, SDValue Size,
3650 unsigned Align, bool isVol,
3651 const Value *DstSV, uint64_t DstSVOff) {
3653 // Check to see if we should lower the memset to stores first.
3654 // For cases within the target-specified limits, this is the best choice.
3655 ConstantSDNode *ConstantSize = dyn_cast<ConstantSDNode>(Size);
3657 // Memset with size zero? Just return the original chain.
3658 if (ConstantSize->isNullValue())
3662 getMemsetStores(*this, dl, Chain, Dst, Src, ConstantSize->getZExtValue(),
3663 Align, isVol, DstSV, DstSVOff);
3665 if (Result.getNode())
3669 // Then check to see if we should lower the memset with target-specific
3670 // code. If the target chooses to do this, this is the next best.
3672 TSI.EmitTargetCodeForMemset(*this, dl, Chain, Dst, Src, Size, Align, isVol,
3674 if (Result.getNode())
3677 // Emit a library call.
3678 const Type *IntPtrTy = TLI.getTargetData()->getIntPtrType(*getContext());
3679 TargetLowering::ArgListTy Args;
3680 TargetLowering::ArgListEntry Entry;
3681 Entry.Node = Dst; Entry.Ty = IntPtrTy;
3682 Args.push_back(Entry);
3683 // Extend or truncate the argument to be an i32 value for the call.
3684 if (Src.getValueType().bitsGT(MVT::i32))
3685 Src = getNode(ISD::TRUNCATE, dl, MVT::i32, Src);
3687 Src = getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Src);
3689 Entry.Ty = Type::getInt32Ty(*getContext());
3690 Entry.isSExt = true;
3691 Args.push_back(Entry);
3693 Entry.Ty = IntPtrTy;
3694 Entry.isSExt = false;
3695 Args.push_back(Entry);
3696 // FIXME: pass in DebugLoc
3697 std::pair<SDValue,SDValue> CallResult =
3698 TLI.LowerCallTo(Chain, Type::getVoidTy(*getContext()),
3699 false, false, false, false, 0,
3700 TLI.getLibcallCallingConv(RTLIB::MEMSET), false,
3701 /*isReturnValueUsed=*/false,
3702 getExternalSymbol(TLI.getLibcallName(RTLIB::MEMSET),
3703 TLI.getPointerTy()),
3705 return CallResult.second;
3708 SDValue SelectionDAG::getAtomic(unsigned Opcode, DebugLoc dl, EVT MemVT,
3710 SDValue Ptr, SDValue Cmp,
3711 SDValue Swp, const Value* PtrVal,
3712 unsigned Alignment) {
3713 if (Alignment == 0) // Ensure that codegen never sees alignment 0
3714 Alignment = getEVTAlignment(MemVT);
3716 // Check if the memory reference references a frame index
3718 if (const FrameIndexSDNode *FI =
3719 dyn_cast<const FrameIndexSDNode>(Ptr.getNode()))
3720 PtrVal = PseudoSourceValue::getFixedStack(FI->getIndex());
3722 MachineFunction &MF = getMachineFunction();
3723 unsigned Flags = MachineMemOperand::MOLoad | MachineMemOperand::MOStore;
3725 // For now, atomics are considered to be volatile always.
3726 Flags |= MachineMemOperand::MOVolatile;
3728 MachineMemOperand *MMO =
3729 MF.getMachineMemOperand(PtrVal, Flags, 0,
3730 MemVT.getStoreSize(), Alignment);
3732 return getAtomic(Opcode, dl, MemVT, Chain, Ptr, Cmp, Swp, MMO);
3735 SDValue SelectionDAG::getAtomic(unsigned Opcode, DebugLoc dl, EVT MemVT,
3737 SDValue Ptr, SDValue Cmp,
3738 SDValue Swp, MachineMemOperand *MMO) {
3739 assert(Opcode == ISD::ATOMIC_CMP_SWAP && "Invalid Atomic Op");
3740 assert(Cmp.getValueType() == Swp.getValueType() && "Invalid Atomic Op Types");
3742 EVT VT = Cmp.getValueType();
3744 SDVTList VTs = getVTList(VT, MVT::Other);
3745 FoldingSetNodeID ID;
3746 ID.AddInteger(MemVT.getRawBits());
3747 SDValue Ops[] = {Chain, Ptr, Cmp, Swp};
3748 AddNodeIDNode(ID, Opcode, VTs, Ops, 4);
3750 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) {
3751 cast<AtomicSDNode>(E)->refineAlignment(MMO);
3752 return SDValue(E, 0);
3754 SDNode *N = new (NodeAllocator) AtomicSDNode(Opcode, dl, VTs, MemVT, Chain,
3755 Ptr, Cmp, Swp, MMO);
3756 CSEMap.InsertNode(N, IP);
3757 AllNodes.push_back(N);
3758 return SDValue(N, 0);
3761 SDValue SelectionDAG::getAtomic(unsigned Opcode, DebugLoc dl, EVT MemVT,
3763 SDValue Ptr, SDValue Val,
3764 const Value* PtrVal,
3765 unsigned Alignment) {
3766 if (Alignment == 0) // Ensure that codegen never sees alignment 0
3767 Alignment = getEVTAlignment(MemVT);
3769 // Check if the memory reference references a frame index
3771 if (const FrameIndexSDNode *FI =
3772 dyn_cast<const FrameIndexSDNode>(Ptr.getNode()))
3773 PtrVal = PseudoSourceValue::getFixedStack(FI->getIndex());
3775 MachineFunction &MF = getMachineFunction();
3776 unsigned Flags = MachineMemOperand::MOLoad | MachineMemOperand::MOStore;
3778 // For now, atomics are considered to be volatile always.
3779 Flags |= MachineMemOperand::MOVolatile;
3781 MachineMemOperand *MMO =
3782 MF.getMachineMemOperand(PtrVal, Flags, 0,
3783 MemVT.getStoreSize(), Alignment);
3785 return getAtomic(Opcode, dl, MemVT, Chain, Ptr, Val, MMO);
3788 SDValue SelectionDAG::getAtomic(unsigned Opcode, DebugLoc dl, EVT MemVT,
3790 SDValue Ptr, SDValue Val,
3791 MachineMemOperand *MMO) {
3792 assert((Opcode == ISD::ATOMIC_LOAD_ADD ||
3793 Opcode == ISD::ATOMIC_LOAD_SUB ||
3794 Opcode == ISD::ATOMIC_LOAD_AND ||
3795 Opcode == ISD::ATOMIC_LOAD_OR ||
3796 Opcode == ISD::ATOMIC_LOAD_XOR ||
3797 Opcode == ISD::ATOMIC_LOAD_NAND ||
3798 Opcode == ISD::ATOMIC_LOAD_MIN ||
3799 Opcode == ISD::ATOMIC_LOAD_MAX ||
3800 Opcode == ISD::ATOMIC_LOAD_UMIN ||
3801 Opcode == ISD::ATOMIC_LOAD_UMAX ||
3802 Opcode == ISD::ATOMIC_SWAP) &&
3803 "Invalid Atomic Op");
3805 EVT VT = Val.getValueType();
3807 SDVTList VTs = getVTList(VT, MVT::Other);
3808 FoldingSetNodeID ID;
3809 ID.AddInteger(MemVT.getRawBits());
3810 SDValue Ops[] = {Chain, Ptr, Val};
3811 AddNodeIDNode(ID, Opcode, VTs, Ops, 3);
3813 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) {
3814 cast<AtomicSDNode>(E)->refineAlignment(MMO);
3815 return SDValue(E, 0);
3817 SDNode *N = new (NodeAllocator) AtomicSDNode(Opcode, dl, VTs, MemVT, Chain,
3819 CSEMap.InsertNode(N, IP);
3820 AllNodes.push_back(N);
3821 return SDValue(N, 0);
3824 /// getMergeValues - Create a MERGE_VALUES node from the given operands.
3825 /// Allowed to return something different (and simpler) if Simplify is true.
3826 SDValue SelectionDAG::getMergeValues(const SDValue *Ops, unsigned NumOps,
3831 SmallVector<EVT, 4> VTs;
3832 VTs.reserve(NumOps);
3833 for (unsigned i = 0; i < NumOps; ++i)
3834 VTs.push_back(Ops[i].getValueType());
3835 return getNode(ISD::MERGE_VALUES, dl, getVTList(&VTs[0], NumOps),
3840 SelectionDAG::getMemIntrinsicNode(unsigned Opcode, DebugLoc dl,
3841 const EVT *VTs, unsigned NumVTs,
3842 const SDValue *Ops, unsigned NumOps,
3843 EVT MemVT, const Value *srcValue, int SVOff,
3844 unsigned Align, bool Vol,
3845 bool ReadMem, bool WriteMem) {
3846 return getMemIntrinsicNode(Opcode, dl, makeVTList(VTs, NumVTs), Ops, NumOps,
3847 MemVT, srcValue, SVOff, Align, Vol,
3852 SelectionDAG::getMemIntrinsicNode(unsigned Opcode, DebugLoc dl, SDVTList VTList,
3853 const SDValue *Ops, unsigned NumOps,
3854 EVT MemVT, const Value *srcValue, int SVOff,
3855 unsigned Align, bool Vol,
3856 bool ReadMem, bool WriteMem) {
3857 if (Align == 0) // Ensure that codegen never sees alignment 0
3858 Align = getEVTAlignment(MemVT);
3860 MachineFunction &MF = getMachineFunction();
3863 Flags |= MachineMemOperand::MOStore;
3865 Flags |= MachineMemOperand::MOLoad;
3867 Flags |= MachineMemOperand::MOVolatile;
3868 MachineMemOperand *MMO =
3869 MF.getMachineMemOperand(srcValue, Flags, SVOff,
3870 MemVT.getStoreSize(), Align);
3872 return getMemIntrinsicNode(Opcode, dl, VTList, Ops, NumOps, MemVT, MMO);
3876 SelectionDAG::getMemIntrinsicNode(unsigned Opcode, DebugLoc dl, SDVTList VTList,
3877 const SDValue *Ops, unsigned NumOps,
3878 EVT MemVT, MachineMemOperand *MMO) {
3879 assert((Opcode == ISD::INTRINSIC_VOID ||
3880 Opcode == ISD::INTRINSIC_W_CHAIN ||
3881 (Opcode <= INT_MAX &&
3882 (int)Opcode >= ISD::FIRST_TARGET_MEMORY_OPCODE)) &&
3883 "Opcode is not a memory-accessing opcode!");
3885 // Memoize the node unless it returns a flag.
3886 MemIntrinsicSDNode *N;
3887 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
3888 FoldingSetNodeID ID;
3889 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
3891 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) {
3892 cast<MemIntrinsicSDNode>(E)->refineAlignment(MMO);
3893 return SDValue(E, 0);
3896 N = new (NodeAllocator) MemIntrinsicSDNode(Opcode, dl, VTList, Ops, NumOps,
3898 CSEMap.InsertNode(N, IP);
3900 N = new (NodeAllocator) MemIntrinsicSDNode(Opcode, dl, VTList, Ops, NumOps,
3903 AllNodes.push_back(N);
3904 return SDValue(N, 0);
3908 SelectionDAG::getLoad(ISD::MemIndexedMode AM, DebugLoc dl,
3909 ISD::LoadExtType ExtType, EVT VT, SDValue Chain,
3910 SDValue Ptr, SDValue Offset,
3911 const Value *SV, int SVOffset, EVT MemVT,
3912 bool isVolatile, bool isNonTemporal,
3913 unsigned Alignment) {
3914 if (Alignment == 0) // Ensure that codegen never sees alignment 0
3915 Alignment = getEVTAlignment(VT);
3917 // Check if the memory reference references a frame index
3919 if (const FrameIndexSDNode *FI =
3920 dyn_cast<const FrameIndexSDNode>(Ptr.getNode()))
3921 SV = PseudoSourceValue::getFixedStack(FI->getIndex());
3923 MachineFunction &MF = getMachineFunction();
3924 unsigned Flags = MachineMemOperand::MOLoad;
3926 Flags |= MachineMemOperand::MOVolatile;
3928 Flags |= MachineMemOperand::MONonTemporal;
3929 MachineMemOperand *MMO =
3930 MF.getMachineMemOperand(SV, Flags, SVOffset,
3931 MemVT.getStoreSize(), Alignment);
3932 return getLoad(AM, dl, ExtType, VT, Chain, Ptr, Offset, MemVT, MMO);
3936 SelectionDAG::getLoad(ISD::MemIndexedMode AM, DebugLoc dl,
3937 ISD::LoadExtType ExtType, EVT VT, SDValue Chain,
3938 SDValue Ptr, SDValue Offset, EVT MemVT,
3939 MachineMemOperand *MMO) {
3941 ExtType = ISD::NON_EXTLOAD;
3942 } else if (ExtType == ISD::NON_EXTLOAD) {
3943 assert(VT == MemVT && "Non-extending load from different memory type!");
3946 assert(MemVT.getScalarType().bitsLT(VT.getScalarType()) &&
3947 "Should only be an extending load, not truncating!");
3948 assert(VT.isInteger() == MemVT.isInteger() &&
3949 "Cannot convert from FP to Int or Int -> FP!");
3950 assert(VT.isVector() == MemVT.isVector() &&
3951 "Cannot use trunc store to convert to or from a vector!");
3952 assert((!VT.isVector() ||
3953 VT.getVectorNumElements() == MemVT.getVectorNumElements()) &&
3954 "Cannot use trunc store to change the number of vector elements!");
3957 bool Indexed = AM != ISD::UNINDEXED;
3958 assert((Indexed || Offset.getOpcode() == ISD::UNDEF) &&
3959 "Unindexed load with an offset!");
3961 SDVTList VTs = Indexed ?
3962 getVTList(VT, Ptr.getValueType(), MVT::Other) : getVTList(VT, MVT::Other);
3963 SDValue Ops[] = { Chain, Ptr, Offset };
3964 FoldingSetNodeID ID;
3965 AddNodeIDNode(ID, ISD::LOAD, VTs, Ops, 3);
3966 ID.AddInteger(MemVT.getRawBits());
3967 ID.AddInteger(encodeMemSDNodeFlags(ExtType, AM, MMO->isVolatile(),
3968 MMO->isNonTemporal()));
3970 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) {
3971 cast<LoadSDNode>(E)->refineAlignment(MMO);
3972 return SDValue(E, 0);
3974 SDNode *N = new (NodeAllocator) LoadSDNode(Ops, dl, VTs, AM, ExtType,
3976 CSEMap.InsertNode(N, IP);
3977 AllNodes.push_back(N);
3978 return SDValue(N, 0);
3981 SDValue SelectionDAG::getLoad(EVT VT, DebugLoc dl,
3982 SDValue Chain, SDValue Ptr,
3983 const Value *SV, int SVOffset,
3984 bool isVolatile, bool isNonTemporal,
3985 unsigned Alignment) {
3986 SDValue Undef = getUNDEF(Ptr.getValueType());
3987 return getLoad(ISD::UNINDEXED, dl, ISD::NON_EXTLOAD, VT, Chain, Ptr, Undef,
3988 SV, SVOffset, VT, isVolatile, isNonTemporal, Alignment);
3991 SDValue SelectionDAG::getExtLoad(ISD::LoadExtType ExtType, DebugLoc dl, EVT VT,
3992 SDValue Chain, SDValue Ptr,
3994 int SVOffset, EVT MemVT,
3995 bool isVolatile, bool isNonTemporal,
3996 unsigned Alignment) {
3997 SDValue Undef = getUNDEF(Ptr.getValueType());
3998 return getLoad(ISD::UNINDEXED, dl, ExtType, VT, Chain, Ptr, Undef,
3999 SV, SVOffset, MemVT, isVolatile, isNonTemporal, Alignment);
4003 SelectionDAG::getIndexedLoad(SDValue OrigLoad, DebugLoc dl, SDValue Base,
4004 SDValue Offset, ISD::MemIndexedMode AM) {
4005 LoadSDNode *LD = cast<LoadSDNode>(OrigLoad);
4006 assert(LD->getOffset().getOpcode() == ISD::UNDEF &&
4007 "Load is already a indexed load!");
4008 return getLoad(AM, dl, LD->getExtensionType(), OrigLoad.getValueType(),
4009 LD->getChain(), Base, Offset, LD->getSrcValue(),
4010 LD->getSrcValueOffset(), LD->getMemoryVT(),
4011 LD->isVolatile(), LD->isNonTemporal(), LD->getAlignment());
4014 SDValue SelectionDAG::getStore(SDValue Chain, DebugLoc dl, SDValue Val,
4015 SDValue Ptr, const Value *SV, int SVOffset,
4016 bool isVolatile, bool isNonTemporal,
4017 unsigned Alignment) {
4018 if (Alignment == 0) // Ensure that codegen never sees alignment 0
4019 Alignment = getEVTAlignment(Val.getValueType());
4021 // Check if the memory reference references a frame index
4023 if (const FrameIndexSDNode *FI =
4024 dyn_cast<const FrameIndexSDNode>(Ptr.getNode()))
4025 SV = PseudoSourceValue::getFixedStack(FI->getIndex());
4027 MachineFunction &MF = getMachineFunction();
4028 unsigned Flags = MachineMemOperand::MOStore;
4030 Flags |= MachineMemOperand::MOVolatile;
4032 Flags |= MachineMemOperand::MONonTemporal;
4033 MachineMemOperand *MMO =
4034 MF.getMachineMemOperand(SV, Flags, SVOffset,
4035 Val.getValueType().getStoreSize(), Alignment);
4037 return getStore(Chain, dl, Val, Ptr, MMO);
4040 SDValue SelectionDAG::getStore(SDValue Chain, DebugLoc dl, SDValue Val,
4041 SDValue Ptr, MachineMemOperand *MMO) {
4042 EVT VT = Val.getValueType();
4043 SDVTList VTs = getVTList(MVT::Other);
4044 SDValue Undef = getUNDEF(Ptr.getValueType());
4045 SDValue Ops[] = { Chain, Val, Ptr, Undef };
4046 FoldingSetNodeID ID;
4047 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
4048 ID.AddInteger(VT.getRawBits());
4049 ID.AddInteger(encodeMemSDNodeFlags(false, ISD::UNINDEXED, MMO->isVolatile(),
4050 MMO->isNonTemporal()));
4052 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) {
4053 cast<StoreSDNode>(E)->refineAlignment(MMO);
4054 return SDValue(E, 0);
4056 SDNode *N = new (NodeAllocator) StoreSDNode(Ops, dl, VTs, ISD::UNINDEXED,
4058 CSEMap.InsertNode(N, IP);
4059 AllNodes.push_back(N);
4060 return SDValue(N, 0);
4063 SDValue SelectionDAG::getTruncStore(SDValue Chain, DebugLoc dl, SDValue Val,
4064 SDValue Ptr, const Value *SV,
4065 int SVOffset, EVT SVT,
4066 bool isVolatile, bool isNonTemporal,
4067 unsigned Alignment) {
4068 if (Alignment == 0) // Ensure that codegen never sees alignment 0
4069 Alignment = getEVTAlignment(SVT);
4071 // Check if the memory reference references a frame index
4073 if (const FrameIndexSDNode *FI =
4074 dyn_cast<const FrameIndexSDNode>(Ptr.getNode()))
4075 SV = PseudoSourceValue::getFixedStack(FI->getIndex());
4077 MachineFunction &MF = getMachineFunction();
4078 unsigned Flags = MachineMemOperand::MOStore;
4080 Flags |= MachineMemOperand::MOVolatile;
4082 Flags |= MachineMemOperand::MONonTemporal;
4083 MachineMemOperand *MMO =
4084 MF.getMachineMemOperand(SV, Flags, SVOffset, SVT.getStoreSize(), Alignment);
4086 return getTruncStore(Chain, dl, Val, Ptr, SVT, MMO);
4089 SDValue SelectionDAG::getTruncStore(SDValue Chain, DebugLoc dl, SDValue Val,
4090 SDValue Ptr, EVT SVT,
4091 MachineMemOperand *MMO) {
4092 EVT VT = Val.getValueType();
4095 return getStore(Chain, dl, Val, Ptr, MMO);
4097 assert(SVT.getScalarType().bitsLT(VT.getScalarType()) &&
4098 "Should only be a truncating store, not extending!");
4099 assert(VT.isInteger() == SVT.isInteger() &&
4100 "Can't do FP-INT conversion!");
4101 assert(VT.isVector() == SVT.isVector() &&
4102 "Cannot use trunc store to convert to or from a vector!");
4103 assert((!VT.isVector() ||
4104 VT.getVectorNumElements() == SVT.getVectorNumElements()) &&
4105 "Cannot use trunc store to change the number of vector elements!");
4107 SDVTList VTs = getVTList(MVT::Other);
4108 SDValue Undef = getUNDEF(Ptr.getValueType());
4109 SDValue Ops[] = { Chain, Val, Ptr, Undef };
4110 FoldingSetNodeID ID;
4111 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
4112 ID.AddInteger(SVT.getRawBits());
4113 ID.AddInteger(encodeMemSDNodeFlags(true, ISD::UNINDEXED, MMO->isVolatile(),
4114 MMO->isNonTemporal()));
4116 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP)) {
4117 cast<StoreSDNode>(E)->refineAlignment(MMO);
4118 return SDValue(E, 0);
4120 SDNode *N = new (NodeAllocator) StoreSDNode(Ops, dl, VTs, ISD::UNINDEXED,
4122 CSEMap.InsertNode(N, IP);
4123 AllNodes.push_back(N);
4124 return SDValue(N, 0);
4128 SelectionDAG::getIndexedStore(SDValue OrigStore, DebugLoc dl, SDValue Base,
4129 SDValue Offset, ISD::MemIndexedMode AM) {
4130 StoreSDNode *ST = cast<StoreSDNode>(OrigStore);
4131 assert(ST->getOffset().getOpcode() == ISD::UNDEF &&
4132 "Store is already a indexed store!");
4133 SDVTList VTs = getVTList(Base.getValueType(), MVT::Other);
4134 SDValue Ops[] = { ST->getChain(), ST->getValue(), Base, Offset };
4135 FoldingSetNodeID ID;
4136 AddNodeIDNode(ID, ISD::STORE, VTs, Ops, 4);
4137 ID.AddInteger(ST->getMemoryVT().getRawBits());
4138 ID.AddInteger(ST->getRawSubclassData());
4140 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
4141 return SDValue(E, 0);
4143 SDNode *N = new (NodeAllocator) StoreSDNode(Ops, dl, VTs, AM,
4144 ST->isTruncatingStore(),
4146 ST->getMemOperand());
4147 CSEMap.InsertNode(N, IP);
4148 AllNodes.push_back(N);
4149 return SDValue(N, 0);
4152 SDValue SelectionDAG::getVAArg(EVT VT, DebugLoc dl,
4153 SDValue Chain, SDValue Ptr,
4155 SDValue Ops[] = { Chain, Ptr, SV };
4156 return getNode(ISD::VAARG, dl, getVTList(VT, MVT::Other), Ops, 3);
4159 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, EVT VT,
4160 const SDUse *Ops, unsigned NumOps) {
4162 case 0: return getNode(Opcode, DL, VT);
4163 case 1: return getNode(Opcode, DL, VT, Ops[0]);
4164 case 2: return getNode(Opcode, DL, VT, Ops[0], Ops[1]);
4165 case 3: return getNode(Opcode, DL, VT, Ops[0], Ops[1], Ops[2]);
4169 // Copy from an SDUse array into an SDValue array for use with
4170 // the regular getNode logic.
4171 SmallVector<SDValue, 8> NewOps(Ops, Ops + NumOps);
4172 return getNode(Opcode, DL, VT, &NewOps[0], NumOps);
4175 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, EVT VT,
4176 const SDValue *Ops, unsigned NumOps) {
4178 case 0: return getNode(Opcode, DL, VT);
4179 case 1: return getNode(Opcode, DL, VT, Ops[0]);
4180 case 2: return getNode(Opcode, DL, VT, Ops[0], Ops[1]);
4181 case 3: return getNode(Opcode, DL, VT, Ops[0], Ops[1], Ops[2]);
4187 case ISD::SELECT_CC: {
4188 assert(NumOps == 5 && "SELECT_CC takes 5 operands!");
4189 assert(Ops[0].getValueType() == Ops[1].getValueType() &&
4190 "LHS and RHS of condition must have same type!");
4191 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
4192 "True and False arms of SelectCC must have same type!");
4193 assert(Ops[2].getValueType() == VT &&
4194 "select_cc node must be of same type as true and false value!");
4198 assert(NumOps == 5 && "BR_CC takes 5 operands!");
4199 assert(Ops[2].getValueType() == Ops[3].getValueType() &&
4200 "LHS/RHS of comparison should match types!");
4207 SDVTList VTs = getVTList(VT);
4209 if (VT != MVT::Flag) {
4210 FoldingSetNodeID ID;
4211 AddNodeIDNode(ID, Opcode, VTs, Ops, NumOps);
4214 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
4215 return SDValue(E, 0);
4217 N = new (NodeAllocator) SDNode(Opcode, DL, VTs, Ops, NumOps);
4218 CSEMap.InsertNode(N, IP);
4220 N = new (NodeAllocator) SDNode(Opcode, DL, VTs, Ops, NumOps);
4223 AllNodes.push_back(N);
4227 return SDValue(N, 0);
4230 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL,
4231 const std::vector<EVT> &ResultTys,
4232 const SDValue *Ops, unsigned NumOps) {
4233 return getNode(Opcode, DL, getVTList(&ResultTys[0], ResultTys.size()),
4237 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL,
4238 const EVT *VTs, unsigned NumVTs,
4239 const SDValue *Ops, unsigned NumOps) {
4241 return getNode(Opcode, DL, VTs[0], Ops, NumOps);
4242 return getNode(Opcode, DL, makeVTList(VTs, NumVTs), Ops, NumOps);
4245 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, SDVTList VTList,
4246 const SDValue *Ops, unsigned NumOps) {
4247 if (VTList.NumVTs == 1)
4248 return getNode(Opcode, DL, VTList.VTs[0], Ops, NumOps);
4252 // FIXME: figure out how to safely handle things like
4253 // int foo(int x) { return 1 << (x & 255); }
4254 // int bar() { return foo(256); }
4255 case ISD::SRA_PARTS:
4256 case ISD::SRL_PARTS:
4257 case ISD::SHL_PARTS:
4258 if (N3.getOpcode() == ISD::SIGN_EXTEND_INREG &&
4259 cast<VTSDNode>(N3.getOperand(1))->getVT() != MVT::i1)
4260 return getNode(Opcode, DL, VT, N1, N2, N3.getOperand(0));
4261 else if (N3.getOpcode() == ISD::AND)
4262 if (ConstantSDNode *AndRHS = dyn_cast<ConstantSDNode>(N3.getOperand(1))) {
4263 // If the and is only masking out bits that cannot effect the shift,
4264 // eliminate the and.
4265 unsigned NumBits = VT.getScalarType().getSizeInBits()*2;
4266 if ((AndRHS->getValue() & (NumBits-1)) == NumBits-1)
4267 return getNode(Opcode, DL, VT, N1, N2, N3.getOperand(0));
4273 // Memoize the node unless it returns a flag.
4275 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
4276 FoldingSetNodeID ID;
4277 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
4279 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
4280 return SDValue(E, 0);
4283 N = new (NodeAllocator) UnarySDNode(Opcode, DL, VTList, Ops[0]);
4284 } else if (NumOps == 2) {
4285 N = new (NodeAllocator) BinarySDNode(Opcode, DL, VTList, Ops[0], Ops[1]);
4286 } else if (NumOps == 3) {
4287 N = new (NodeAllocator) TernarySDNode(Opcode, DL, VTList, Ops[0], Ops[1],
4290 N = new (NodeAllocator) SDNode(Opcode, DL, VTList, Ops, NumOps);
4292 CSEMap.InsertNode(N, IP);
4295 N = new (NodeAllocator) UnarySDNode(Opcode, DL, VTList, Ops[0]);
4296 } else if (NumOps == 2) {
4297 N = new (NodeAllocator) BinarySDNode(Opcode, DL, VTList, Ops[0], Ops[1]);
4298 } else if (NumOps == 3) {
4299 N = new (NodeAllocator) TernarySDNode(Opcode, DL, VTList, Ops[0], Ops[1],
4302 N = new (NodeAllocator) SDNode(Opcode, DL, VTList, Ops, NumOps);
4305 AllNodes.push_back(N);
4309 return SDValue(N, 0);
4312 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, SDVTList VTList) {
4313 return getNode(Opcode, DL, VTList, 0, 0);
4316 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, SDVTList VTList,
4318 SDValue Ops[] = { N1 };
4319 return getNode(Opcode, DL, VTList, Ops, 1);
4322 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, SDVTList VTList,
4323 SDValue N1, SDValue N2) {
4324 SDValue Ops[] = { N1, N2 };
4325 return getNode(Opcode, DL, VTList, Ops, 2);
4328 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, SDVTList VTList,
4329 SDValue N1, SDValue N2, SDValue N3) {
4330 SDValue Ops[] = { N1, N2, N3 };
4331 return getNode(Opcode, DL, VTList, Ops, 3);
4334 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, SDVTList VTList,
4335 SDValue N1, SDValue N2, SDValue N3,
4337 SDValue Ops[] = { N1, N2, N3, N4 };
4338 return getNode(Opcode, DL, VTList, Ops, 4);
4341 SDValue SelectionDAG::getNode(unsigned Opcode, DebugLoc DL, SDVTList VTList,
4342 SDValue N1, SDValue N2, SDValue N3,
4343 SDValue N4, SDValue N5) {
4344 SDValue Ops[] = { N1, N2, N3, N4, N5 };
4345 return getNode(Opcode, DL, VTList, Ops, 5);
4348 SDVTList SelectionDAG::getVTList(EVT VT) {
4349 return makeVTList(SDNode::getValueTypeList(VT), 1);
4352 SDVTList SelectionDAG::getVTList(EVT VT1, EVT VT2) {
4353 for (std::vector<SDVTList>::reverse_iterator I = VTList.rbegin(),
4354 E = VTList.rend(); I != E; ++I)
4355 if (I->NumVTs == 2 && I->VTs[0] == VT1 && I->VTs[1] == VT2)
4358 EVT *Array = Allocator.Allocate<EVT>(2);
4361 SDVTList Result = makeVTList(Array, 2);
4362 VTList.push_back(Result);
4366 SDVTList SelectionDAG::getVTList(EVT VT1, EVT VT2, EVT VT3) {
4367 for (std::vector<SDVTList>::reverse_iterator I = VTList.rbegin(),
4368 E = VTList.rend(); I != E; ++I)
4369 if (I->NumVTs == 3 && I->VTs[0] == VT1 && I->VTs[1] == VT2 &&
4373 EVT *Array = Allocator.Allocate<EVT>(3);
4377 SDVTList Result = makeVTList(Array, 3);
4378 VTList.push_back(Result);
4382 SDVTList SelectionDAG::getVTList(EVT VT1, EVT VT2, EVT VT3, EVT VT4) {
4383 for (std::vector<SDVTList>::reverse_iterator I = VTList.rbegin(),
4384 E = VTList.rend(); I != E; ++I)
4385 if (I->NumVTs == 4 && I->VTs[0] == VT1 && I->VTs[1] == VT2 &&
4386 I->VTs[2] == VT3 && I->VTs[3] == VT4)
4389 EVT *Array = Allocator.Allocate<EVT>(4);
4394 SDVTList Result = makeVTList(Array, 4);
4395 VTList.push_back(Result);
4399 SDVTList SelectionDAG::getVTList(const EVT *VTs, unsigned NumVTs) {
4401 case 0: llvm_unreachable("Cannot have nodes without results!");
4402 case 1: return getVTList(VTs[0]);
4403 case 2: return getVTList(VTs[0], VTs[1]);
4404 case 3: return getVTList(VTs[0], VTs[1], VTs[2]);
4405 case 4: return getVTList(VTs[0], VTs[1], VTs[2], VTs[3]);
4409 for (std::vector<SDVTList>::reverse_iterator I = VTList.rbegin(),
4410 E = VTList.rend(); I != E; ++I) {
4411 if (I->NumVTs != NumVTs || VTs[0] != I->VTs[0] || VTs[1] != I->VTs[1])
4414 bool NoMatch = false;
4415 for (unsigned i = 2; i != NumVTs; ++i)
4416 if (VTs[i] != I->VTs[i]) {
4424 EVT *Array = Allocator.Allocate<EVT>(NumVTs);
4425 std::copy(VTs, VTs+NumVTs, Array);
4426 SDVTList Result = makeVTList(Array, NumVTs);
4427 VTList.push_back(Result);
4432 /// UpdateNodeOperands - *Mutate* the specified node in-place to have the
4433 /// specified operands. If the resultant node already exists in the DAG,
4434 /// this does not modify the specified node, instead it returns the node that
4435 /// already exists. If the resultant node does not exist in the DAG, the
4436 /// input node is returned. As a degenerate case, if you specify the same
4437 /// input operands as the node already has, the input node is returned.
4438 SDNode *SelectionDAG::UpdateNodeOperands(SDNode *N, SDValue Op) {
4439 assert(N->getNumOperands() == 1 && "Update with wrong number of operands");
4441 // Check to see if there is no change.
4442 if (Op == N->getOperand(0)) return N;
4444 // See if the modified node already exists.
4445 void *InsertPos = 0;
4446 if (SDNode *Existing = FindModifiedNodeSlot(N, Op, InsertPos))
4449 // Nope it doesn't. Remove the node from its current place in the maps.
4451 if (!RemoveNodeFromCSEMaps(N))
4454 // Now we update the operands.
4455 N->OperandList[0].set(Op);
4457 // If this gets put into a CSE map, add it.
4458 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
4462 SDNode *SelectionDAG::UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2) {
4463 assert(N->getNumOperands() == 2 && "Update with wrong number of operands");
4465 // Check to see if there is no change.
4466 if (Op1 == N->getOperand(0) && Op2 == N->getOperand(1))
4467 return N; // No operands changed, just return the input node.
4469 // See if the modified node already exists.
4470 void *InsertPos = 0;
4471 if (SDNode *Existing = FindModifiedNodeSlot(N, Op1, Op2, InsertPos))
4474 // Nope it doesn't. Remove the node from its current place in the maps.
4476 if (!RemoveNodeFromCSEMaps(N))
4479 // Now we update the operands.
4480 if (N->OperandList[0] != Op1)
4481 N->OperandList[0].set(Op1);
4482 if (N->OperandList[1] != Op2)
4483 N->OperandList[1].set(Op2);
4485 // If this gets put into a CSE map, add it.
4486 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
4490 SDNode *SelectionDAG::
4491 UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2, SDValue Op3) {
4492 SDValue Ops[] = { Op1, Op2, Op3 };
4493 return UpdateNodeOperands(N, Ops, 3);
4496 SDNode *SelectionDAG::
4497 UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2,
4498 SDValue Op3, SDValue Op4) {
4499 SDValue Ops[] = { Op1, Op2, Op3, Op4 };
4500 return UpdateNodeOperands(N, Ops, 4);
4503 SDNode *SelectionDAG::
4504 UpdateNodeOperands(SDNode *N, SDValue Op1, SDValue Op2,
4505 SDValue Op3, SDValue Op4, SDValue Op5) {
4506 SDValue Ops[] = { Op1, Op2, Op3, Op4, Op5 };
4507 return UpdateNodeOperands(N, Ops, 5);
4510 SDNode *SelectionDAG::
4511 UpdateNodeOperands(SDNode *N, const SDValue *Ops, unsigned NumOps) {
4512 assert(N->getNumOperands() == NumOps &&
4513 "Update with wrong number of operands");
4515 // Check to see if there is no change.
4516 bool AnyChange = false;
4517 for (unsigned i = 0; i != NumOps; ++i) {
4518 if (Ops[i] != N->getOperand(i)) {
4524 // No operands changed, just return the input node.
4525 if (!AnyChange) return N;
4527 // See if the modified node already exists.
4528 void *InsertPos = 0;
4529 if (SDNode *Existing = FindModifiedNodeSlot(N, Ops, NumOps, InsertPos))
4532 // Nope it doesn't. Remove the node from its current place in the maps.
4534 if (!RemoveNodeFromCSEMaps(N))
4537 // Now we update the operands.
4538 for (unsigned i = 0; i != NumOps; ++i)
4539 if (N->OperandList[i] != Ops[i])
4540 N->OperandList[i].set(Ops[i]);
4542 // If this gets put into a CSE map, add it.
4543 if (InsertPos) CSEMap.InsertNode(N, InsertPos);
4547 /// DropOperands - Release the operands and set this node to have
4549 void SDNode::DropOperands() {
4550 // Unlike the code in MorphNodeTo that does this, we don't need to
4551 // watch for dead nodes here.
4552 for (op_iterator I = op_begin(), E = op_end(); I != E; ) {
4558 /// SelectNodeTo - These are wrappers around MorphNodeTo that accept a
4561 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4563 SDVTList VTs = getVTList(VT);
4564 return SelectNodeTo(N, MachineOpc, VTs, 0, 0);
4567 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4568 EVT VT, SDValue Op1) {
4569 SDVTList VTs = getVTList(VT);
4570 SDValue Ops[] = { Op1 };
4571 return SelectNodeTo(N, MachineOpc, VTs, Ops, 1);
4574 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4575 EVT VT, SDValue Op1,
4577 SDVTList VTs = getVTList(VT);
4578 SDValue Ops[] = { Op1, Op2 };
4579 return SelectNodeTo(N, MachineOpc, VTs, Ops, 2);
4582 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4583 EVT VT, SDValue Op1,
4584 SDValue Op2, SDValue Op3) {
4585 SDVTList VTs = getVTList(VT);
4586 SDValue Ops[] = { Op1, Op2, Op3 };
4587 return SelectNodeTo(N, MachineOpc, VTs, Ops, 3);
4590 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4591 EVT VT, const SDValue *Ops,
4593 SDVTList VTs = getVTList(VT);
4594 return SelectNodeTo(N, MachineOpc, VTs, Ops, NumOps);
4597 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4598 EVT VT1, EVT VT2, const SDValue *Ops,
4600 SDVTList VTs = getVTList(VT1, VT2);
4601 return SelectNodeTo(N, MachineOpc, VTs, Ops, NumOps);
4604 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4606 SDVTList VTs = getVTList(VT1, VT2);
4607 return SelectNodeTo(N, MachineOpc, VTs, (SDValue *)0, 0);
4610 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4611 EVT VT1, EVT VT2, EVT VT3,
4612 const SDValue *Ops, unsigned NumOps) {
4613 SDVTList VTs = getVTList(VT1, VT2, VT3);
4614 return SelectNodeTo(N, MachineOpc, VTs, Ops, NumOps);
4617 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4618 EVT VT1, EVT VT2, EVT VT3, EVT VT4,
4619 const SDValue *Ops, unsigned NumOps) {
4620 SDVTList VTs = getVTList(VT1, VT2, VT3, VT4);
4621 return SelectNodeTo(N, MachineOpc, VTs, Ops, NumOps);
4624 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4627 SDVTList VTs = getVTList(VT1, VT2);
4628 SDValue Ops[] = { Op1 };
4629 return SelectNodeTo(N, MachineOpc, VTs, Ops, 1);
4632 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4634 SDValue Op1, SDValue Op2) {
4635 SDVTList VTs = getVTList(VT1, VT2);
4636 SDValue Ops[] = { Op1, Op2 };
4637 return SelectNodeTo(N, MachineOpc, VTs, Ops, 2);
4640 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4642 SDValue Op1, SDValue Op2,
4644 SDVTList VTs = getVTList(VT1, VT2);
4645 SDValue Ops[] = { Op1, Op2, Op3 };
4646 return SelectNodeTo(N, MachineOpc, VTs, Ops, 3);
4649 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4650 EVT VT1, EVT VT2, EVT VT3,
4651 SDValue Op1, SDValue Op2,
4653 SDVTList VTs = getVTList(VT1, VT2, VT3);
4654 SDValue Ops[] = { Op1, Op2, Op3 };
4655 return SelectNodeTo(N, MachineOpc, VTs, Ops, 3);
4658 SDNode *SelectionDAG::SelectNodeTo(SDNode *N, unsigned MachineOpc,
4659 SDVTList VTs, const SDValue *Ops,
4661 N = MorphNodeTo(N, ~MachineOpc, VTs, Ops, NumOps);
4662 // Reset the NodeID to -1.
4667 /// MorphNodeTo - This *mutates* the specified node to have the specified
4668 /// return type, opcode, and operands.
4670 /// Note that MorphNodeTo returns the resultant node. If there is already a
4671 /// node of the specified opcode and operands, it returns that node instead of
4672 /// the current one. Note that the DebugLoc need not be the same.
4674 /// Using MorphNodeTo is faster than creating a new node and swapping it in
4675 /// with ReplaceAllUsesWith both because it often avoids allocating a new
4676 /// node, and because it doesn't require CSE recalculation for any of
4677 /// the node's users.
4679 SDNode *SelectionDAG::MorphNodeTo(SDNode *N, unsigned Opc,
4680 SDVTList VTs, const SDValue *Ops,
4682 // If an identical node already exists, use it.
4684 if (VTs.VTs[VTs.NumVTs-1] != MVT::Flag) {
4685 FoldingSetNodeID ID;
4686 AddNodeIDNode(ID, Opc, VTs, Ops, NumOps);
4687 if (SDNode *ON = CSEMap.FindNodeOrInsertPos(ID, IP))
4691 if (!RemoveNodeFromCSEMaps(N))
4694 // Start the morphing.
4696 N->ValueList = VTs.VTs;
4697 N->NumValues = VTs.NumVTs;
4699 // Clear the operands list, updating used nodes to remove this from their
4700 // use list. Keep track of any operands that become dead as a result.
4701 SmallPtrSet<SDNode*, 16> DeadNodeSet;
4702 for (SDNode::op_iterator I = N->op_begin(), E = N->op_end(); I != E; ) {
4704 SDNode *Used = Use.getNode();
4706 if (Used->use_empty())
4707 DeadNodeSet.insert(Used);
4710 if (MachineSDNode *MN = dyn_cast<MachineSDNode>(N)) {
4711 // Initialize the memory references information.
4712 MN->setMemRefs(0, 0);
4713 // If NumOps is larger than the # of operands we can have in a
4714 // MachineSDNode, reallocate the operand list.
4715 if (NumOps > MN->NumOperands || !MN->OperandsNeedDelete) {
4716 if (MN->OperandsNeedDelete)
4717 delete[] MN->OperandList;
4718 if (NumOps > array_lengthof(MN->LocalOperands))
4719 // We're creating a final node that will live unmorphed for the
4720 // remainder of the current SelectionDAG iteration, so we can allocate
4721 // the operands directly out of a pool with no recycling metadata.
4722 MN->InitOperands(OperandAllocator.Allocate<SDUse>(NumOps),
4725 MN->InitOperands(MN->LocalOperands, Ops, NumOps);
4726 MN->OperandsNeedDelete = false;
4728 MN->InitOperands(MN->OperandList, Ops, NumOps);
4730 // If NumOps is larger than the # of operands we currently have, reallocate
4731 // the operand list.
4732 if (NumOps > N->NumOperands) {
4733 if (N->OperandsNeedDelete)
4734 delete[] N->OperandList;
4735 N->InitOperands(new SDUse[NumOps], Ops, NumOps);
4736 N->OperandsNeedDelete = true;
4738 N->InitOperands(N->OperandList, Ops, NumOps);
4741 // Delete any nodes that are still dead after adding the uses for the
4743 if (!DeadNodeSet.empty()) {
4744 SmallVector<SDNode *, 16> DeadNodes;
4745 for (SmallPtrSet<SDNode *, 16>::iterator I = DeadNodeSet.begin(),
4746 E = DeadNodeSet.end(); I != E; ++I)
4747 if ((*I)->use_empty())
4748 DeadNodes.push_back(*I);
4749 RemoveDeadNodes(DeadNodes);
4753 CSEMap.InsertNode(N, IP); // Memoize the new node.
4758 /// getMachineNode - These are used for target selectors to create a new node
4759 /// with specified return type(s), MachineInstr opcode, and operands.
4761 /// Note that getMachineNode returns the resultant node. If there is already a
4762 /// node of the specified opcode and operands, it returns that node instead of
4763 /// the current one.
4765 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl, EVT VT) {
4766 SDVTList VTs = getVTList(VT);
4767 return getMachineNode(Opcode, dl, VTs, 0, 0);
4771 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl, EVT VT, SDValue Op1) {
4772 SDVTList VTs = getVTList(VT);
4773 SDValue Ops[] = { Op1 };
4774 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4778 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl, EVT VT,
4779 SDValue Op1, SDValue Op2) {
4780 SDVTList VTs = getVTList(VT);
4781 SDValue Ops[] = { Op1, Op2 };
4782 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4786 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl, EVT VT,
4787 SDValue Op1, SDValue Op2, SDValue Op3) {
4788 SDVTList VTs = getVTList(VT);
4789 SDValue Ops[] = { Op1, Op2, Op3 };
4790 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4794 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl, EVT VT,
4795 const SDValue *Ops, unsigned NumOps) {
4796 SDVTList VTs = getVTList(VT);
4797 return getMachineNode(Opcode, dl, VTs, Ops, NumOps);
4801 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl, EVT VT1, EVT VT2) {
4802 SDVTList VTs = getVTList(VT1, VT2);
4803 return getMachineNode(Opcode, dl, VTs, 0, 0);
4807 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4808 EVT VT1, EVT VT2, SDValue Op1) {
4809 SDVTList VTs = getVTList(VT1, VT2);
4810 SDValue Ops[] = { Op1 };
4811 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4815 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4816 EVT VT1, EVT VT2, SDValue Op1, SDValue Op2) {
4817 SDVTList VTs = getVTList(VT1, VT2);
4818 SDValue Ops[] = { Op1, Op2 };
4819 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4823 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4824 EVT VT1, EVT VT2, SDValue Op1,
4825 SDValue Op2, SDValue Op3) {
4826 SDVTList VTs = getVTList(VT1, VT2);
4827 SDValue Ops[] = { Op1, Op2, Op3 };
4828 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4832 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4834 const SDValue *Ops, unsigned NumOps) {
4835 SDVTList VTs = getVTList(VT1, VT2);
4836 return getMachineNode(Opcode, dl, VTs, Ops, NumOps);
4840 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4841 EVT VT1, EVT VT2, EVT VT3,
4842 SDValue Op1, SDValue Op2) {
4843 SDVTList VTs = getVTList(VT1, VT2, VT3);
4844 SDValue Ops[] = { Op1, Op2 };
4845 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4849 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4850 EVT VT1, EVT VT2, EVT VT3,
4851 SDValue Op1, SDValue Op2, SDValue Op3) {
4852 SDVTList VTs = getVTList(VT1, VT2, VT3);
4853 SDValue Ops[] = { Op1, Op2, Op3 };
4854 return getMachineNode(Opcode, dl, VTs, Ops, array_lengthof(Ops));
4858 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4859 EVT VT1, EVT VT2, EVT VT3,
4860 const SDValue *Ops, unsigned NumOps) {
4861 SDVTList VTs = getVTList(VT1, VT2, VT3);
4862 return getMachineNode(Opcode, dl, VTs, Ops, NumOps);
4866 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl, EVT VT1,
4867 EVT VT2, EVT VT3, EVT VT4,
4868 const SDValue *Ops, unsigned NumOps) {
4869 SDVTList VTs = getVTList(VT1, VT2, VT3, VT4);
4870 return getMachineNode(Opcode, dl, VTs, Ops, NumOps);
4874 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc dl,
4875 const std::vector<EVT> &ResultTys,
4876 const SDValue *Ops, unsigned NumOps) {
4877 SDVTList VTs = getVTList(&ResultTys[0], ResultTys.size());
4878 return getMachineNode(Opcode, dl, VTs, Ops, NumOps);
4882 SelectionDAG::getMachineNode(unsigned Opcode, DebugLoc DL, SDVTList VTs,
4883 const SDValue *Ops, unsigned NumOps) {
4884 bool DoCSE = VTs.VTs[VTs.NumVTs-1] != MVT::Flag;
4889 FoldingSetNodeID ID;
4890 AddNodeIDNode(ID, ~Opcode, VTs, Ops, NumOps);
4892 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
4893 return cast<MachineSDNode>(E);
4896 // Allocate a new MachineSDNode.
4897 N = new (NodeAllocator) MachineSDNode(~Opcode, DL, VTs);
4899 // Initialize the operands list.
4900 if (NumOps > array_lengthof(N->LocalOperands))
4901 // We're creating a final node that will live unmorphed for the
4902 // remainder of the current SelectionDAG iteration, so we can allocate
4903 // the operands directly out of a pool with no recycling metadata.
4904 N->InitOperands(OperandAllocator.Allocate<SDUse>(NumOps),
4907 N->InitOperands(N->LocalOperands, Ops, NumOps);
4908 N->OperandsNeedDelete = false;
4911 CSEMap.InsertNode(N, IP);
4913 AllNodes.push_back(N);
4920 /// getTargetExtractSubreg - A convenience function for creating
4921 /// TargetOpcode::EXTRACT_SUBREG nodes.
4923 SelectionDAG::getTargetExtractSubreg(int SRIdx, DebugLoc DL, EVT VT,
4925 SDValue SRIdxVal = getTargetConstant(SRIdx, MVT::i32);
4926 SDNode *Subreg = getMachineNode(TargetOpcode::EXTRACT_SUBREG, DL,
4927 VT, Operand, SRIdxVal);
4928 return SDValue(Subreg, 0);
4931 /// getTargetInsertSubreg - A convenience function for creating
4932 /// TargetOpcode::INSERT_SUBREG nodes.
4934 SelectionDAG::getTargetInsertSubreg(int SRIdx, DebugLoc DL, EVT VT,
4935 SDValue Operand, SDValue Subreg) {
4936 SDValue SRIdxVal = getTargetConstant(SRIdx, MVT::i32);
4937 SDNode *Result = getMachineNode(TargetOpcode::INSERT_SUBREG, DL,
4938 VT, Operand, Subreg, SRIdxVal);
4939 return SDValue(Result, 0);
4942 /// getNodeIfExists - Get the specified node if it's already available, or
4943 /// else return NULL.
4944 SDNode *SelectionDAG::getNodeIfExists(unsigned Opcode, SDVTList VTList,
4945 const SDValue *Ops, unsigned NumOps) {
4946 if (VTList.VTs[VTList.NumVTs-1] != MVT::Flag) {
4947 FoldingSetNodeID ID;
4948 AddNodeIDNode(ID, Opcode, VTList, Ops, NumOps);
4950 if (SDNode *E = CSEMap.FindNodeOrInsertPos(ID, IP))
4956 /// getDbgValue - Creates a SDDbgValue node.
4959 SelectionDAG::getDbgValue(MDNode *MDPtr, SDNode *N, unsigned R, uint64_t Off,
4960 DebugLoc DL, unsigned O) {
4961 return new (Allocator) SDDbgValue(MDPtr, N, R, Off, DL, O);
4965 SelectionDAG::getDbgValue(MDNode *MDPtr, const Value *C, uint64_t Off,
4966 DebugLoc DL, unsigned O) {
4967 return new (Allocator) SDDbgValue(MDPtr, C, Off, DL, O);
4971 SelectionDAG::getDbgValue(MDNode *MDPtr, unsigned FI, uint64_t Off,
4972 DebugLoc DL, unsigned O) {
4973 return new (Allocator) SDDbgValue(MDPtr, FI, Off, DL, O);
4978 /// RAUWUpdateListener - Helper for ReplaceAllUsesWith - When the node
4979 /// pointed to by a use iterator is deleted, increment the use iterator
4980 /// so that it doesn't dangle.
4982 /// This class also manages a "downlink" DAGUpdateListener, to forward
4983 /// messages to ReplaceAllUsesWith's callers.
4985 class RAUWUpdateListener : public SelectionDAG::DAGUpdateListener {
4986 SelectionDAG::DAGUpdateListener *DownLink;
4987 SDNode::use_iterator &UI;
4988 SDNode::use_iterator &UE;
4990 virtual void NodeDeleted(SDNode *N, SDNode *E) {
4991 // Increment the iterator as needed.
4992 while (UI != UE && N == *UI)
4995 // Then forward the message.
4996 if (DownLink) DownLink->NodeDeleted(N, E);
4999 virtual void NodeUpdated(SDNode *N) {
5000 // Just forward the message.
5001 if (DownLink) DownLink->NodeUpdated(N);
5005 RAUWUpdateListener(SelectionDAG::DAGUpdateListener *dl,
5006 SDNode::use_iterator &ui,
5007 SDNode::use_iterator &ue)
5008 : DownLink(dl), UI(ui), UE(ue) {}
5013 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
5014 /// This can cause recursive merging of nodes in the DAG.
5016 /// This version assumes From has a single result value.
5018 void SelectionDAG::ReplaceAllUsesWith(SDValue FromN, SDValue To,
5019 DAGUpdateListener *UpdateListener) {
5020 SDNode *From = FromN.getNode();
5021 assert(From->getNumValues() == 1 && FromN.getResNo() == 0 &&
5022 "Cannot replace with this method!");
5023 assert(From != To.getNode() && "Cannot replace uses of with self");
5025 // Iterate over all the existing uses of From. New uses will be added
5026 // to the beginning of the use list, which we avoid visiting.
5027 // This specifically avoids visiting uses of From that arise while the
5028 // replacement is happening, because any such uses would be the result
5029 // of CSE: If an existing node looks like From after one of its operands
5030 // is replaced by To, we don't want to replace of all its users with To
5031 // too. See PR3018 for more info.
5032 SDNode::use_iterator UI = From->use_begin(), UE = From->use_end();
5033 RAUWUpdateListener Listener(UpdateListener, UI, UE);
5037 // This node is about to morph, remove its old self from the CSE maps.
5038 RemoveNodeFromCSEMaps(User);
5040 // A user can appear in a use list multiple times, and when this
5041 // happens the uses are usually next to each other in the list.
5042 // To help reduce the number of CSE recomputations, process all
5043 // the uses of this user that we can find this way.
5045 SDUse &Use = UI.getUse();
5048 } while (UI != UE && *UI == User);
5050 // Now that we have modified User, add it back to the CSE maps. If it
5051 // already exists there, recursively merge the results together.
5052 AddModifiedNodeToCSEMaps(User, &Listener);
5056 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
5057 /// This can cause recursive merging of nodes in the DAG.
5059 /// This version assumes that for each value of From, there is a
5060 /// corresponding value in To in the same position with the same type.
5062 void SelectionDAG::ReplaceAllUsesWith(SDNode *From, SDNode *To,
5063 DAGUpdateListener *UpdateListener) {
5065 for (unsigned i = 0, e = From->getNumValues(); i != e; ++i)
5066 assert((!From->hasAnyUseOfValue(i) ||
5067 From->getValueType(i) == To->getValueType(i)) &&
5068 "Cannot use this version of ReplaceAllUsesWith!");
5071 // Handle the trivial case.
5075 // Iterate over just the existing users of From. See the comments in
5076 // the ReplaceAllUsesWith above.
5077 SDNode::use_iterator UI = From->use_begin(), UE = From->use_end();
5078 RAUWUpdateListener Listener(UpdateListener, UI, UE);
5082 // This node is about to morph, remove its old self from the CSE maps.
5083 RemoveNodeFromCSEMaps(User);
5085 // A user can appear in a use list multiple times, and when this
5086 // happens the uses are usually next to each other in the list.
5087 // To help reduce the number of CSE recomputations, process all
5088 // the uses of this user that we can find this way.
5090 SDUse &Use = UI.getUse();
5093 } while (UI != UE && *UI == User);
5095 // Now that we have modified User, add it back to the CSE maps. If it
5096 // already exists there, recursively merge the results together.
5097 AddModifiedNodeToCSEMaps(User, &Listener);
5101 /// ReplaceAllUsesWith - Modify anything using 'From' to use 'To' instead.
5102 /// This can cause recursive merging of nodes in the DAG.
5104 /// This version can replace From with any result values. To must match the
5105 /// number and types of values returned by From.
5106 void SelectionDAG::ReplaceAllUsesWith(SDNode *From,
5108 DAGUpdateListener *UpdateListener) {
5109 if (From->getNumValues() == 1) // Handle the simple case efficiently.
5110 return ReplaceAllUsesWith(SDValue(From, 0), To[0], UpdateListener);
5112 // Iterate over just the existing users of From. See the comments in
5113 // the ReplaceAllUsesWith above.
5114 SDNode::use_iterator UI = From->use_begin(), UE = From->use_end();
5115 RAUWUpdateListener Listener(UpdateListener, UI, UE);
5119 // This node is about to morph, remove its old self from the CSE maps.
5120 RemoveNodeFromCSEMaps(User);
5122 // A user can appear in a use list multiple times, and when this
5123 // happens the uses are usually next to each other in the list.
5124 // To help reduce the number of CSE recomputations, process all
5125 // the uses of this user that we can find this way.
5127 SDUse &Use = UI.getUse();
5128 const SDValue &ToOp = To[Use.getResNo()];
5131 } while (UI != UE && *UI == User);
5133 // Now that we have modified User, add it back to the CSE maps. If it
5134 // already exists there, recursively merge the results together.
5135 AddModifiedNodeToCSEMaps(User, &Listener);
5139 /// ReplaceAllUsesOfValueWith - Replace any uses of From with To, leaving
5140 /// uses of other values produced by From.getNode() alone. The Deleted
5141 /// vector is handled the same way as for ReplaceAllUsesWith.
5142 void SelectionDAG::ReplaceAllUsesOfValueWith(SDValue From, SDValue To,
5143 DAGUpdateListener *UpdateListener){
5144 // Handle the really simple, really trivial case efficiently.
5145 if (From == To) return;
5147 // Handle the simple, trivial, case efficiently.
5148 if (From.getNode()->getNumValues() == 1) {
5149 ReplaceAllUsesWith(From, To, UpdateListener);
5153 // Iterate over just the existing users of From. See the comments in
5154 // the ReplaceAllUsesWith above.
5155 SDNode::use_iterator UI = From.getNode()->use_begin(),
5156 UE = From.getNode()->use_end();
5157 RAUWUpdateListener Listener(UpdateListener, UI, UE);
5160 bool UserRemovedFromCSEMaps = false;
5162 // A user can appear in a use list multiple times, and when this
5163 // happens the uses are usually next to each other in the list.
5164 // To help reduce the number of CSE recomputations, process all
5165 // the uses of this user that we can find this way.
5167 SDUse &Use = UI.getUse();
5169 // Skip uses of different values from the same node.
5170 if (Use.getResNo() != From.getResNo()) {
5175 // If this node hasn't been modified yet, it's still in the CSE maps,
5176 // so remove its old self from the CSE maps.
5177 if (!UserRemovedFromCSEMaps) {
5178 RemoveNodeFromCSEMaps(User);
5179 UserRemovedFromCSEMaps = true;
5184 } while (UI != UE && *UI == User);
5186 // We are iterating over all uses of the From node, so if a use
5187 // doesn't use the specific value, no changes are made.
5188 if (!UserRemovedFromCSEMaps)
5191 // Now that we have modified User, add it back to the CSE maps. If it
5192 // already exists there, recursively merge the results together.
5193 AddModifiedNodeToCSEMaps(User, &Listener);
5198 /// UseMemo - This class is used by SelectionDAG::ReplaceAllUsesOfValuesWith
5199 /// to record information about a use.
5206 /// operator< - Sort Memos by User.
5207 bool operator<(const UseMemo &L, const UseMemo &R) {
5208 return (intptr_t)L.User < (intptr_t)R.User;
5212 /// ReplaceAllUsesOfValuesWith - Replace any uses of From with To, leaving
5213 /// uses of other values produced by From.getNode() alone. The same value
5214 /// may appear in both the From and To list. The Deleted vector is
5215 /// handled the same way as for ReplaceAllUsesWith.
5216 void SelectionDAG::ReplaceAllUsesOfValuesWith(const SDValue *From,
5219 DAGUpdateListener *UpdateListener){
5220 // Handle the simple, trivial case efficiently.
5222 return ReplaceAllUsesOfValueWith(*From, *To, UpdateListener);
5224 // Read up all the uses and make records of them. This helps
5225 // processing new uses that are introduced during the
5226 // replacement process.
5227 SmallVector<UseMemo, 4> Uses;
5228 for (unsigned i = 0; i != Num; ++i) {
5229 unsigned FromResNo = From[i].getResNo();
5230 SDNode *FromNode = From[i].getNode();
5231 for (SDNode::use_iterator UI = FromNode->use_begin(),
5232 E = FromNode->use_end(); UI != E; ++UI) {
5233 SDUse &Use = UI.getUse();
5234 if (Use.getResNo() == FromResNo) {
5235 UseMemo Memo = { *UI, i, &Use };
5236 Uses.push_back(Memo);
5241 // Sort the uses, so that all the uses from a given User are together.
5242 std::sort(Uses.begin(), Uses.end());
5244 for (unsigned UseIndex = 0, UseIndexEnd = Uses.size();
5245 UseIndex != UseIndexEnd; ) {
5246 // We know that this user uses some value of From. If it is the right
5247 // value, update it.
5248 SDNode *User = Uses[UseIndex].User;
5250 // This node is about to morph, remove its old self from the CSE maps.
5251 RemoveNodeFromCSEMaps(User);
5253 // The Uses array is sorted, so all the uses for a given User
5254 // are next to each other in the list.
5255 // To help reduce the number of CSE recomputations, process all
5256 // the uses of this user that we can find this way.
5258 unsigned i = Uses[UseIndex].Index;
5259 SDUse &Use = *Uses[UseIndex].Use;
5263 } while (UseIndex != UseIndexEnd && Uses[UseIndex].User == User);
5265 // Now that we have modified User, add it back to the CSE maps. If it
5266 // already exists there, recursively merge the results together.
5267 AddModifiedNodeToCSEMaps(User, UpdateListener);
5271 /// AssignTopologicalOrder - Assign a unique node id for each node in the DAG
5272 /// based on their topological order. It returns the maximum id and a vector
5273 /// of the SDNodes* in assigned order by reference.
5274 unsigned SelectionDAG::AssignTopologicalOrder() {
5276 unsigned DAGSize = 0;
5278 // SortedPos tracks the progress of the algorithm. Nodes before it are
5279 // sorted, nodes after it are unsorted. When the algorithm completes
5280 // it is at the end of the list.
5281 allnodes_iterator SortedPos = allnodes_begin();
5283 // Visit all the nodes. Move nodes with no operands to the front of
5284 // the list immediately. Annotate nodes that do have operands with their
5285 // operand count. Before we do this, the Node Id fields of the nodes
5286 // may contain arbitrary values. After, the Node Id fields for nodes
5287 // before SortedPos will contain the topological sort index, and the
5288 // Node Id fields for nodes At SortedPos and after will contain the
5289 // count of outstanding operands.
5290 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ) {
5293 unsigned Degree = N->getNumOperands();
5295 // A node with no uses, add it to the result array immediately.
5296 N->setNodeId(DAGSize++);
5297 allnodes_iterator Q = N;
5299 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(Q));
5300 assert(SortedPos != AllNodes.end() && "Overran node list");
5303 // Temporarily use the Node Id as scratch space for the degree count.
5304 N->setNodeId(Degree);
5308 // Visit all the nodes. As we iterate, moves nodes into sorted order,
5309 // such that by the time the end is reached all nodes will be sorted.
5310 for (allnodes_iterator I = allnodes_begin(),E = allnodes_end(); I != E; ++I) {
5313 // N is in sorted position, so all its uses have one less operand
5314 // that needs to be sorted.
5315 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
5318 unsigned Degree = P->getNodeId();
5319 assert(Degree != 0 && "Invalid node degree");
5322 // All of P's operands are sorted, so P may sorted now.
5323 P->setNodeId(DAGSize++);
5325 SortedPos = AllNodes.insert(SortedPos, AllNodes.remove(P));
5326 assert(SortedPos != AllNodes.end() && "Overran node list");
5329 // Update P's outstanding operand count.
5330 P->setNodeId(Degree);
5333 if (I == SortedPos) {
5336 dbgs() << "Overran sorted position:\n";
5339 llvm_unreachable(0);
5343 assert(SortedPos == AllNodes.end() &&
5344 "Topological sort incomplete!");
5345 assert(AllNodes.front().getOpcode() == ISD::EntryToken &&
5346 "First node in topological sort is not the entry token!");
5347 assert(AllNodes.front().getNodeId() == 0 &&
5348 "First node in topological sort has non-zero id!");
5349 assert(AllNodes.front().getNumOperands() == 0 &&
5350 "First node in topological sort has operands!");
5351 assert(AllNodes.back().getNodeId() == (int)DAGSize-1 &&
5352 "Last node in topologic sort has unexpected id!");
5353 assert(AllNodes.back().use_empty() &&
5354 "Last node in topologic sort has users!");
5355 assert(DAGSize == allnodes_size() && "Node count mismatch!");
5359 /// AssignOrdering - Assign an order to the SDNode.
5360 void SelectionDAG::AssignOrdering(const SDNode *SD, unsigned Order) {
5361 assert(SD && "Trying to assign an order to a null node!");
5362 Ordering->add(SD, Order);
5365 /// GetOrdering - Get the order for the SDNode.
5366 unsigned SelectionDAG::GetOrdering(const SDNode *SD) const {
5367 assert(SD && "Trying to get the order of a null node!");
5368 return Ordering->getOrder(SD);
5371 /// AddDbgValue - Add a dbg_value SDNode. If SD is non-null that means the
5372 /// value is produced by SD.
5373 void SelectionDAG::AddDbgValue(SDDbgValue *DB, SDNode *SD, bool isParameter) {
5374 DbgInfo->add(DB, SD, isParameter);
5376 SD->setHasDebugValue(true);
5379 //===----------------------------------------------------------------------===//
5381 //===----------------------------------------------------------------------===//
5383 HandleSDNode::~HandleSDNode() {
5387 GlobalAddressSDNode::GlobalAddressSDNode(unsigned Opc, const GlobalValue *GA,
5388 EVT VT, int64_t o, unsigned char TF)
5389 : SDNode(Opc, DebugLoc(), getSDVTList(VT)), Offset(o), TargetFlags(TF) {
5393 MemSDNode::MemSDNode(unsigned Opc, DebugLoc dl, SDVTList VTs, EVT memvt,
5394 MachineMemOperand *mmo)
5395 : SDNode(Opc, dl, VTs), MemoryVT(memvt), MMO(mmo) {
5396 SubclassData = encodeMemSDNodeFlags(0, ISD::UNINDEXED, MMO->isVolatile(),
5397 MMO->isNonTemporal());
5398 assert(isVolatile() == MMO->isVolatile() && "Volatile encoding error!");
5399 assert(isNonTemporal() == MMO->isNonTemporal() &&
5400 "Non-temporal encoding error!");
5401 assert(memvt.getStoreSize() == MMO->getSize() && "Size mismatch!");
5404 MemSDNode::MemSDNode(unsigned Opc, DebugLoc dl, SDVTList VTs,
5405 const SDValue *Ops, unsigned NumOps, EVT memvt,
5406 MachineMemOperand *mmo)
5407 : SDNode(Opc, dl, VTs, Ops, NumOps),
5408 MemoryVT(memvt), MMO(mmo) {
5409 SubclassData = encodeMemSDNodeFlags(0, ISD::UNINDEXED, MMO->isVolatile(),
5410 MMO->isNonTemporal());
5411 assert(isVolatile() == MMO->isVolatile() && "Volatile encoding error!");
5412 assert(memvt.getStoreSize() == MMO->getSize() && "Size mismatch!");
5415 /// Profile - Gather unique data for the node.
5417 void SDNode::Profile(FoldingSetNodeID &ID) const {
5418 AddNodeIDNode(ID, this);
5423 std::vector<EVT> VTs;
5426 VTs.reserve(MVT::LAST_VALUETYPE);
5427 for (unsigned i = 0; i < MVT::LAST_VALUETYPE; ++i)
5428 VTs.push_back(MVT((MVT::SimpleValueType)i));
5433 static ManagedStatic<std::set<EVT, EVT::compareRawBits> > EVTs;
5434 static ManagedStatic<EVTArray> SimpleVTArray;
5435 static ManagedStatic<sys::SmartMutex<true> > VTMutex;
5437 /// getValueTypeList - Return a pointer to the specified value type.
5439 const EVT *SDNode::getValueTypeList(EVT VT) {
5440 if (VT.isExtended()) {
5441 sys::SmartScopedLock<true> Lock(*VTMutex);
5442 return &(*EVTs->insert(VT).first);
5444 assert(VT.getSimpleVT().SimpleTy < MVT::LAST_VALUETYPE &&
5445 "Value type out of range!");
5446 return &SimpleVTArray->VTs[VT.getSimpleVT().SimpleTy];
5450 /// hasNUsesOfValue - Return true if there are exactly NUSES uses of the
5451 /// indicated value. This method ignores uses of other values defined by this
5453 bool SDNode::hasNUsesOfValue(unsigned NUses, unsigned Value) const {
5454 assert(Value < getNumValues() && "Bad value!");
5456 // TODO: Only iterate over uses of a given value of the node
5457 for (SDNode::use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI) {
5458 if (UI.getUse().getResNo() == Value) {
5465 // Found exactly the right number of uses?
5470 /// hasAnyUseOfValue - Return true if there are any use of the indicated
5471 /// value. This method ignores uses of other values defined by this operation.
5472 bool SDNode::hasAnyUseOfValue(unsigned Value) const {
5473 assert(Value < getNumValues() && "Bad value!");
5475 for (SDNode::use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI)
5476 if (UI.getUse().getResNo() == Value)
5483 /// isOnlyUserOf - Return true if this node is the only use of N.
5485 bool SDNode::isOnlyUserOf(SDNode *N) const {
5487 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
5498 /// isOperand - Return true if this node is an operand of N.
5500 bool SDValue::isOperandOf(SDNode *N) const {
5501 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
5502 if (*this == N->getOperand(i))
5507 bool SDNode::isOperandOf(SDNode *N) const {
5508 for (unsigned i = 0, e = N->NumOperands; i != e; ++i)
5509 if (this == N->OperandList[i].getNode())
5514 /// reachesChainWithoutSideEffects - Return true if this operand (which must
5515 /// be a chain) reaches the specified operand without crossing any
5516 /// side-effecting instructions. In practice, this looks through token
5517 /// factors and non-volatile loads. In order to remain efficient, this only
5518 /// looks a couple of nodes in, it does not do an exhaustive search.
5519 bool SDValue::reachesChainWithoutSideEffects(SDValue Dest,
5520 unsigned Depth) const {
5521 if (*this == Dest) return true;
5523 // Don't search too deeply, we just want to be able to see through
5524 // TokenFactor's etc.
5525 if (Depth == 0) return false;
5527 // If this is a token factor, all inputs to the TF happen in parallel. If any
5528 // of the operands of the TF reach dest, then we can do the xform.
5529 if (getOpcode() == ISD::TokenFactor) {
5530 for (unsigned i = 0, e = getNumOperands(); i != e; ++i)
5531 if (getOperand(i).reachesChainWithoutSideEffects(Dest, Depth-1))
5536 // Loads don't have side effects, look through them.
5537 if (LoadSDNode *Ld = dyn_cast<LoadSDNode>(*this)) {
5538 if (!Ld->isVolatile())
5539 return Ld->getChain().reachesChainWithoutSideEffects(Dest, Depth-1);
5544 /// isPredecessorOf - Return true if this node is a predecessor of N. This node
5545 /// is either an operand of N or it can be reached by traversing up the operands.
5546 /// NOTE: this is an expensive method. Use it carefully.
5547 bool SDNode::isPredecessorOf(SDNode *N) const {
5548 SmallPtrSet<SDNode *, 32> Visited;
5549 SmallVector<SDNode *, 16> Worklist;
5550 Worklist.push_back(N);
5553 N = Worklist.pop_back_val();
5554 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
5555 SDNode *Op = N->getOperand(i).getNode();
5558 if (Visited.insert(Op))
5559 Worklist.push_back(Op);
5561 } while (!Worklist.empty());
5566 uint64_t SDNode::getConstantOperandVal(unsigned Num) const {
5567 assert(Num < NumOperands && "Invalid child # of SDNode!");
5568 return cast<ConstantSDNode>(OperandList[Num])->getZExtValue();
5571 std::string SDNode::getOperationName(const SelectionDAG *G) const {
5572 switch (getOpcode()) {
5574 if (getOpcode() < ISD::BUILTIN_OP_END)
5575 return "<<Unknown DAG Node>>";
5576 if (isMachineOpcode()) {
5578 if (const TargetInstrInfo *TII = G->getTarget().getInstrInfo())
5579 if (getMachineOpcode() < TII->getNumOpcodes())
5580 return TII->get(getMachineOpcode()).getName();
5581 return "<<Unknown Machine Node #" + utostr(getOpcode()) + ">>";
5584 const TargetLowering &TLI = G->getTargetLoweringInfo();
5585 const char *Name = TLI.getTargetNodeName(getOpcode());
5586 if (Name) return Name;
5587 return "<<Unknown Target Node #" + utostr(getOpcode()) + ">>";
5589 return "<<Unknown Node #" + utostr(getOpcode()) + ">>";
5592 case ISD::DELETED_NODE:
5593 return "<<Deleted Node!>>";
5595 case ISD::PREFETCH: return "Prefetch";
5596 case ISD::MEMBARRIER: return "MemBarrier";
5597 case ISD::ATOMIC_CMP_SWAP: return "AtomicCmpSwap";
5598 case ISD::ATOMIC_SWAP: return "AtomicSwap";
5599 case ISD::ATOMIC_LOAD_ADD: return "AtomicLoadAdd";
5600 case ISD::ATOMIC_LOAD_SUB: return "AtomicLoadSub";
5601 case ISD::ATOMIC_LOAD_AND: return "AtomicLoadAnd";
5602 case ISD::ATOMIC_LOAD_OR: return "AtomicLoadOr";
5603 case ISD::ATOMIC_LOAD_XOR: return "AtomicLoadXor";
5604 case ISD::ATOMIC_LOAD_NAND: return "AtomicLoadNand";
5605 case ISD::ATOMIC_LOAD_MIN: return "AtomicLoadMin";
5606 case ISD::ATOMIC_LOAD_MAX: return "AtomicLoadMax";
5607 case ISD::ATOMIC_LOAD_UMIN: return "AtomicLoadUMin";
5608 case ISD::ATOMIC_LOAD_UMAX: return "AtomicLoadUMax";
5609 case ISD::PCMARKER: return "PCMarker";
5610 case ISD::READCYCLECOUNTER: return "ReadCycleCounter";
5611 case ISD::SRCVALUE: return "SrcValue";
5612 case ISD::MDNODE_SDNODE: return "MDNode";
5613 case ISD::EntryToken: return "EntryToken";
5614 case ISD::TokenFactor: return "TokenFactor";
5615 case ISD::AssertSext: return "AssertSext";
5616 case ISD::AssertZext: return "AssertZext";
5618 case ISD::BasicBlock: return "BasicBlock";
5619 case ISD::VALUETYPE: return "ValueType";
5620 case ISD::Register: return "Register";
5622 case ISD::Constant: return "Constant";
5623 case ISD::ConstantFP: return "ConstantFP";
5624 case ISD::GlobalAddress: return "GlobalAddress";
5625 case ISD::GlobalTLSAddress: return "GlobalTLSAddress";
5626 case ISD::FrameIndex: return "FrameIndex";
5627 case ISD::JumpTable: return "JumpTable";
5628 case ISD::GLOBAL_OFFSET_TABLE: return "GLOBAL_OFFSET_TABLE";
5629 case ISD::RETURNADDR: return "RETURNADDR";
5630 case ISD::FRAMEADDR: return "FRAMEADDR";
5631 case ISD::FRAME_TO_ARGS_OFFSET: return "FRAME_TO_ARGS_OFFSET";
5632 case ISD::EXCEPTIONADDR: return "EXCEPTIONADDR";
5633 case ISD::LSDAADDR: return "LSDAADDR";
5634 case ISD::EHSELECTION: return "EHSELECTION";
5635 case ISD::EH_RETURN: return "EH_RETURN";
5636 case ISD::EH_SJLJ_SETJMP: return "EH_SJLJ_SETJMP";
5637 case ISD::EH_SJLJ_LONGJMP: return "EH_SJLJ_LONGJMP";
5638 case ISD::ConstantPool: return "ConstantPool";
5639 case ISD::ExternalSymbol: return "ExternalSymbol";
5640 case ISD::BlockAddress: return "BlockAddress";
5641 case ISD::INTRINSIC_WO_CHAIN:
5642 case ISD::INTRINSIC_VOID:
5643 case ISD::INTRINSIC_W_CHAIN: {
5644 unsigned OpNo = getOpcode() == ISD::INTRINSIC_WO_CHAIN ? 0 : 1;
5645 unsigned IID = cast<ConstantSDNode>(getOperand(OpNo))->getZExtValue();
5646 if (IID < Intrinsic::num_intrinsics)
5647 return Intrinsic::getName((Intrinsic::ID)IID);
5648 else if (const TargetIntrinsicInfo *TII = G->getTarget().getIntrinsicInfo())
5649 return TII->getName(IID);
5650 llvm_unreachable("Invalid intrinsic ID");
5653 case ISD::BUILD_VECTOR: return "BUILD_VECTOR";
5654 case ISD::TargetConstant: return "TargetConstant";
5655 case ISD::TargetConstantFP:return "TargetConstantFP";
5656 case ISD::TargetGlobalAddress: return "TargetGlobalAddress";
5657 case ISD::TargetGlobalTLSAddress: return "TargetGlobalTLSAddress";
5658 case ISD::TargetFrameIndex: return "TargetFrameIndex";
5659 case ISD::TargetJumpTable: return "TargetJumpTable";
5660 case ISD::TargetConstantPool: return "TargetConstantPool";
5661 case ISD::TargetExternalSymbol: return "TargetExternalSymbol";
5662 case ISD::TargetBlockAddress: return "TargetBlockAddress";
5664 case ISD::CopyToReg: return "CopyToReg";
5665 case ISD::CopyFromReg: return "CopyFromReg";
5666 case ISD::UNDEF: return "undef";
5667 case ISD::MERGE_VALUES: return "merge_values";
5668 case ISD::INLINEASM: return "inlineasm";
5669 case ISD::EH_LABEL: return "eh_label";
5670 case ISD::HANDLENODE: return "handlenode";
5673 case ISD::FABS: return "fabs";
5674 case ISD::FNEG: return "fneg";
5675 case ISD::FSQRT: return "fsqrt";
5676 case ISD::FSIN: return "fsin";
5677 case ISD::FCOS: return "fcos";
5678 case ISD::FTRUNC: return "ftrunc";
5679 case ISD::FFLOOR: return "ffloor";
5680 case ISD::FCEIL: return "fceil";
5681 case ISD::FRINT: return "frint";
5682 case ISD::FNEARBYINT: return "fnearbyint";
5683 case ISD::FEXP: return "fexp";
5684 case ISD::FEXP2: return "fexp2";
5685 case ISD::FLOG: return "flog";
5686 case ISD::FLOG2: return "flog2";
5687 case ISD::FLOG10: return "flog10";
5690 case ISD::ADD: return "add";
5691 case ISD::SUB: return "sub";
5692 case ISD::MUL: return "mul";
5693 case ISD::MULHU: return "mulhu";
5694 case ISD::MULHS: return "mulhs";
5695 case ISD::SDIV: return "sdiv";
5696 case ISD::UDIV: return "udiv";
5697 case ISD::SREM: return "srem";
5698 case ISD::UREM: return "urem";
5699 case ISD::SMUL_LOHI: return "smul_lohi";
5700 case ISD::UMUL_LOHI: return "umul_lohi";
5701 case ISD::SDIVREM: return "sdivrem";
5702 case ISD::UDIVREM: return "udivrem";
5703 case ISD::AND: return "and";
5704 case ISD::OR: return "or";
5705 case ISD::XOR: return "xor";
5706 case ISD::SHL: return "shl";
5707 case ISD::SRA: return "sra";
5708 case ISD::SRL: return "srl";
5709 case ISD::ROTL: return "rotl";
5710 case ISD::ROTR: return "rotr";
5711 case ISD::FADD: return "fadd";
5712 case ISD::FSUB: return "fsub";
5713 case ISD::FMUL: return "fmul";
5714 case ISD::FDIV: return "fdiv";
5715 case ISD::FREM: return "frem";
5716 case ISD::FCOPYSIGN: return "fcopysign";
5717 case ISD::FGETSIGN: return "fgetsign";
5718 case ISD::FPOW: return "fpow";
5720 case ISD::FPOWI: return "fpowi";
5721 case ISD::SETCC: return "setcc";
5722 case ISD::VSETCC: return "vsetcc";
5723 case ISD::SELECT: return "select";
5724 case ISD::SELECT_CC: return "select_cc";
5725 case ISD::INSERT_VECTOR_ELT: return "insert_vector_elt";
5726 case ISD::EXTRACT_VECTOR_ELT: return "extract_vector_elt";
5727 case ISD::CONCAT_VECTORS: return "concat_vectors";
5728 case ISD::EXTRACT_SUBVECTOR: return "extract_subvector";
5729 case ISD::SCALAR_TO_VECTOR: return "scalar_to_vector";
5730 case ISD::VECTOR_SHUFFLE: return "vector_shuffle";
5731 case ISD::CARRY_FALSE: return "carry_false";
5732 case ISD::ADDC: return "addc";
5733 case ISD::ADDE: return "adde";
5734 case ISD::SADDO: return "saddo";
5735 case ISD::UADDO: return "uaddo";
5736 case ISD::SSUBO: return "ssubo";
5737 case ISD::USUBO: return "usubo";
5738 case ISD::SMULO: return "smulo";
5739 case ISD::UMULO: return "umulo";
5740 case ISD::SUBC: return "subc";
5741 case ISD::SUBE: return "sube";
5742 case ISD::SHL_PARTS: return "shl_parts";
5743 case ISD::SRA_PARTS: return "sra_parts";
5744 case ISD::SRL_PARTS: return "srl_parts";
5746 // Conversion operators.
5747 case ISD::SIGN_EXTEND: return "sign_extend";
5748 case ISD::ZERO_EXTEND: return "zero_extend";
5749 case ISD::ANY_EXTEND: return "any_extend";
5750 case ISD::SIGN_EXTEND_INREG: return "sign_extend_inreg";
5751 case ISD::TRUNCATE: return "truncate";
5752 case ISD::FP_ROUND: return "fp_round";
5753 case ISD::FLT_ROUNDS_: return "flt_rounds";
5754 case ISD::FP_ROUND_INREG: return "fp_round_inreg";
5755 case ISD::FP_EXTEND: return "fp_extend";
5757 case ISD::SINT_TO_FP: return "sint_to_fp";
5758 case ISD::UINT_TO_FP: return "uint_to_fp";
5759 case ISD::FP_TO_SINT: return "fp_to_sint";
5760 case ISD::FP_TO_UINT: return "fp_to_uint";
5761 case ISD::BIT_CONVERT: return "bit_convert";
5762 case ISD::FP16_TO_FP32: return "fp16_to_fp32";
5763 case ISD::FP32_TO_FP16: return "fp32_to_fp16";
5765 case ISD::CONVERT_RNDSAT: {
5766 switch (cast<CvtRndSatSDNode>(this)->getCvtCode()) {
5767 default: llvm_unreachable("Unknown cvt code!");
5768 case ISD::CVT_FF: return "cvt_ff";
5769 case ISD::CVT_FS: return "cvt_fs";
5770 case ISD::CVT_FU: return "cvt_fu";
5771 case ISD::CVT_SF: return "cvt_sf";
5772 case ISD::CVT_UF: return "cvt_uf";
5773 case ISD::CVT_SS: return "cvt_ss";
5774 case ISD::CVT_SU: return "cvt_su";
5775 case ISD::CVT_US: return "cvt_us";
5776 case ISD::CVT_UU: return "cvt_uu";
5780 // Control flow instructions
5781 case ISD::BR: return "br";
5782 case ISD::BRIND: return "brind";
5783 case ISD::BR_JT: return "br_jt";
5784 case ISD::BRCOND: return "brcond";
5785 case ISD::BR_CC: return "br_cc";
5786 case ISD::CALLSEQ_START: return "callseq_start";
5787 case ISD::CALLSEQ_END: return "callseq_end";
5790 case ISD::LOAD: return "load";
5791 case ISD::STORE: return "store";
5792 case ISD::VAARG: return "vaarg";
5793 case ISD::VACOPY: return "vacopy";
5794 case ISD::VAEND: return "vaend";
5795 case ISD::VASTART: return "vastart";
5796 case ISD::DYNAMIC_STACKALLOC: return "dynamic_stackalloc";
5797 case ISD::EXTRACT_ELEMENT: return "extract_element";
5798 case ISD::BUILD_PAIR: return "build_pair";
5799 case ISD::STACKSAVE: return "stacksave";
5800 case ISD::STACKRESTORE: return "stackrestore";
5801 case ISD::TRAP: return "trap";
5804 case ISD::BSWAP: return "bswap";
5805 case ISD::CTPOP: return "ctpop";
5806 case ISD::CTTZ: return "cttz";
5807 case ISD::CTLZ: return "ctlz";
5810 case ISD::TRAMPOLINE: return "trampoline";
5813 switch (cast<CondCodeSDNode>(this)->get()) {
5814 default: llvm_unreachable("Unknown setcc condition!");
5815 case ISD::SETOEQ: return "setoeq";
5816 case ISD::SETOGT: return "setogt";
5817 case ISD::SETOGE: return "setoge";
5818 case ISD::SETOLT: return "setolt";
5819 case ISD::SETOLE: return "setole";
5820 case ISD::SETONE: return "setone";
5822 case ISD::SETO: return "seto";
5823 case ISD::SETUO: return "setuo";
5824 case ISD::SETUEQ: return "setue";
5825 case ISD::SETUGT: return "setugt";
5826 case ISD::SETUGE: return "setuge";
5827 case ISD::SETULT: return "setult";
5828 case ISD::SETULE: return "setule";
5829 case ISD::SETUNE: return "setune";
5831 case ISD::SETEQ: return "seteq";
5832 case ISD::SETGT: return "setgt";
5833 case ISD::SETGE: return "setge";
5834 case ISD::SETLT: return "setlt";
5835 case ISD::SETLE: return "setle";
5836 case ISD::SETNE: return "setne";
5841 const char *SDNode::getIndexedModeName(ISD::MemIndexedMode AM) {
5850 return "<post-inc>";
5852 return "<post-dec>";
5856 std::string ISD::ArgFlagsTy::getArgFlagsString() {
5857 std::string S = "< ";
5871 if (getByValAlign())
5872 S += "byval-align:" + utostr(getByValAlign()) + " ";
5874 S += "orig-align:" + utostr(getOrigAlign()) + " ";
5876 S += "byval-size:" + utostr(getByValSize()) + " ";
5880 void SDNode::dump() const { dump(0); }
5881 void SDNode::dump(const SelectionDAG *G) const {
5885 void SDNode::print_types(raw_ostream &OS, const SelectionDAG *G) const {
5886 OS << (void*)this << ": ";
5888 for (unsigned i = 0, e = getNumValues(); i != e; ++i) {
5890 if (getValueType(i) == MVT::Other)
5893 OS << getValueType(i).getEVTString();
5895 OS << " = " << getOperationName(G);
5898 void SDNode::print_details(raw_ostream &OS, const SelectionDAG *G) const {
5899 if (const MachineSDNode *MN = dyn_cast<MachineSDNode>(this)) {
5900 if (!MN->memoperands_empty()) {
5903 for (MachineSDNode::mmo_iterator i = MN->memoperands_begin(),
5904 e = MN->memoperands_end(); i != e; ++i) {
5911 } else if (const ShuffleVectorSDNode *SVN =
5912 dyn_cast<ShuffleVectorSDNode>(this)) {
5914 for (unsigned i = 0, e = ValueList[0].getVectorNumElements(); i != e; ++i) {
5915 int Idx = SVN->getMaskElt(i);
5923 } else if (const ConstantSDNode *CSDN = dyn_cast<ConstantSDNode>(this)) {
5924 OS << '<' << CSDN->getAPIntValue() << '>';
5925 } else if (const ConstantFPSDNode *CSDN = dyn_cast<ConstantFPSDNode>(this)) {
5926 if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEsingle)
5927 OS << '<' << CSDN->getValueAPF().convertToFloat() << '>';
5928 else if (&CSDN->getValueAPF().getSemantics()==&APFloat::IEEEdouble)
5929 OS << '<' << CSDN->getValueAPF().convertToDouble() << '>';
5932 CSDN->getValueAPF().bitcastToAPInt().dump();
5935 } else if (const GlobalAddressSDNode *GADN =
5936 dyn_cast<GlobalAddressSDNode>(this)) {
5937 int64_t offset = GADN->getOffset();
5939 WriteAsOperand(OS, GADN->getGlobal());
5942 OS << " + " << offset;
5944 OS << " " << offset;
5945 if (unsigned int TF = GADN->getTargetFlags())
5946 OS << " [TF=" << TF << ']';
5947 } else if (const FrameIndexSDNode *FIDN = dyn_cast<FrameIndexSDNode>(this)) {
5948 OS << "<" << FIDN->getIndex() << ">";
5949 } else if (const JumpTableSDNode *JTDN = dyn_cast<JumpTableSDNode>(this)) {
5950 OS << "<" << JTDN->getIndex() << ">";
5951 if (unsigned int TF = JTDN->getTargetFlags())
5952 OS << " [TF=" << TF << ']';
5953 } else if (const ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(this)){
5954 int offset = CP->getOffset();
5955 if (CP->isMachineConstantPoolEntry())
5956 OS << "<" << *CP->getMachineCPVal() << ">";
5958 OS << "<" << *CP->getConstVal() << ">";
5960 OS << " + " << offset;
5962 OS << " " << offset;
5963 if (unsigned int TF = CP->getTargetFlags())
5964 OS << " [TF=" << TF << ']';
5965 } else if (const BasicBlockSDNode *BBDN = dyn_cast<BasicBlockSDNode>(this)) {
5967 const Value *LBB = (const Value*)BBDN->getBasicBlock()->getBasicBlock();
5969 OS << LBB->getName() << " ";
5970 OS << (const void*)BBDN->getBasicBlock() << ">";
5971 } else if (const RegisterSDNode *R = dyn_cast<RegisterSDNode>(this)) {
5972 if (G && R->getReg() &&
5973 TargetRegisterInfo::isPhysicalRegister(R->getReg())) {
5974 OS << " %" << G->getTarget().getRegisterInfo()->getName(R->getReg());
5976 OS << " %reg" << R->getReg();
5978 } else if (const ExternalSymbolSDNode *ES =
5979 dyn_cast<ExternalSymbolSDNode>(this)) {
5980 OS << "'" << ES->getSymbol() << "'";
5981 if (unsigned int TF = ES->getTargetFlags())
5982 OS << " [TF=" << TF << ']';
5983 } else if (const SrcValueSDNode *M = dyn_cast<SrcValueSDNode>(this)) {
5985 OS << "<" << M->getValue() << ">";
5988 } else if (const MDNodeSDNode *MD = dyn_cast<MDNodeSDNode>(this)) {
5990 OS << "<" << MD->getMD() << ">";
5993 } else if (const VTSDNode *N = dyn_cast<VTSDNode>(this)) {
5994 OS << ":" << N->getVT().getEVTString();
5996 else if (const LoadSDNode *LD = dyn_cast<LoadSDNode>(this)) {
5997 OS << "<" << *LD->getMemOperand();
6000 switch (LD->getExtensionType()) {
6001 default: doExt = false; break;
6002 case ISD::EXTLOAD: OS << ", anyext"; break;
6003 case ISD::SEXTLOAD: OS << ", sext"; break;
6004 case ISD::ZEXTLOAD: OS << ", zext"; break;
6007 OS << " from " << LD->getMemoryVT().getEVTString();
6009 const char *AM = getIndexedModeName(LD->getAddressingMode());
6014 } else if (const StoreSDNode *ST = dyn_cast<StoreSDNode>(this)) {
6015 OS << "<" << *ST->getMemOperand();
6017 if (ST->isTruncatingStore())
6018 OS << ", trunc to " << ST->getMemoryVT().getEVTString();
6020 const char *AM = getIndexedModeName(ST->getAddressingMode());
6025 } else if (const MemSDNode* M = dyn_cast<MemSDNode>(this)) {
6026 OS << "<" << *M->getMemOperand() << ">";
6027 } else if (const BlockAddressSDNode *BA =
6028 dyn_cast<BlockAddressSDNode>(this)) {
6030 WriteAsOperand(OS, BA->getBlockAddress()->getFunction(), false);
6032 WriteAsOperand(OS, BA->getBlockAddress()->getBasicBlock(), false);
6034 if (unsigned int TF = BA->getTargetFlags())
6035 OS << " [TF=" << TF << ']';
6039 if (unsigned Order = G->GetOrdering(this))
6040 OS << " [ORD=" << Order << ']';
6042 if (getNodeId() != -1)
6043 OS << " [ID=" << getNodeId() << ']';
6045 DebugLoc dl = getDebugLoc();
6046 if (G && !dl.isUnknown()) {
6048 Scope(dl.getScope(G->getMachineFunction().getFunction()->getContext()));
6050 // Omit the directory, since it's usually long and uninteresting.
6052 OS << Scope.getFilename();
6055 OS << ':' << dl.getLine();
6056 if (dl.getCol() != 0)
6057 OS << ':' << dl.getCol();
6061 void SDNode::print(raw_ostream &OS, const SelectionDAG *G) const {
6063 for (unsigned i = 0, e = getNumOperands(); i != e; ++i) {
6064 if (i) OS << ", "; else OS << " ";
6065 OS << (void*)getOperand(i).getNode();
6066 if (unsigned RN = getOperand(i).getResNo())
6069 print_details(OS, G);
6072 static void printrWithDepthHelper(raw_ostream &OS, const SDNode *N,
6073 const SelectionDAG *G, unsigned depth,
6086 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
6088 printrWithDepthHelper(OS, N->getOperand(i).getNode(), G, depth-1, indent+2);
6092 void SDNode::printrWithDepth(raw_ostream &OS, const SelectionDAG *G,
6093 unsigned depth) const {
6094 printrWithDepthHelper(OS, this, G, depth, 0);
6097 void SDNode::printrFull(raw_ostream &OS, const SelectionDAG *G) const {
6098 // Don't print impossibly deep things.
6099 printrWithDepth(OS, G, 100);
6102 void SDNode::dumprWithDepth(const SelectionDAG *G, unsigned depth) const {
6103 printrWithDepth(dbgs(), G, depth);
6106 void SDNode::dumprFull(const SelectionDAG *G) const {
6107 // Don't print impossibly deep things.
6108 dumprWithDepth(G, 100);
6111 static void DumpNodes(const SDNode *N, unsigned indent, const SelectionDAG *G) {
6112 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
6113 if (N->getOperand(i).getNode()->hasOneUse())
6114 DumpNodes(N->getOperand(i).getNode(), indent+2, G);
6116 dbgs() << "\n" << std::string(indent+2, ' ')
6117 << (void*)N->getOperand(i).getNode() << ": <multiple use>";
6121 dbgs().indent(indent);
6125 SDValue SelectionDAG::UnrollVectorOp(SDNode *N, unsigned ResNE) {
6126 assert(N->getNumValues() == 1 &&
6127 "Can't unroll a vector with multiple results!");
6129 EVT VT = N->getValueType(0);
6130 unsigned NE = VT.getVectorNumElements();
6131 EVT EltVT = VT.getVectorElementType();
6132 DebugLoc dl = N->getDebugLoc();
6134 SmallVector<SDValue, 8> Scalars;
6135 SmallVector<SDValue, 4> Operands(N->getNumOperands());
6137 // If ResNE is 0, fully unroll the vector op.
6140 else if (NE > ResNE)
6144 for (i= 0; i != NE; ++i) {
6145 for (unsigned j = 0, e = N->getNumOperands(); j != e; ++j) {
6146 SDValue Operand = N->getOperand(j);
6147 EVT OperandVT = Operand.getValueType();
6148 if (OperandVT.isVector()) {
6149 // A vector operand; extract a single element.
6150 EVT OperandEltVT = OperandVT.getVectorElementType();
6151 Operands[j] = getNode(ISD::EXTRACT_VECTOR_ELT, dl,
6154 getConstant(i, MVT::i32));
6156 // A scalar operand; just use it as is.
6157 Operands[j] = Operand;
6161 switch (N->getOpcode()) {
6163 Scalars.push_back(getNode(N->getOpcode(), dl, EltVT,
6164 &Operands[0], Operands.size()));
6171 Scalars.push_back(getNode(N->getOpcode(), dl, EltVT, Operands[0],
6172 getShiftAmountOperand(Operands[1])));
6174 case ISD::SIGN_EXTEND_INREG:
6175 case ISD::FP_ROUND_INREG: {
6176 EVT ExtVT = cast<VTSDNode>(Operands[1])->getVT().getVectorElementType();
6177 Scalars.push_back(getNode(N->getOpcode(), dl, EltVT,
6179 getValueType(ExtVT)));
6184 for (; i < ResNE; ++i)
6185 Scalars.push_back(getUNDEF(EltVT));
6187 return getNode(ISD::BUILD_VECTOR, dl,
6188 EVT::getVectorVT(*getContext(), EltVT, ResNE),
6189 &Scalars[0], Scalars.size());
6193 /// isConsecutiveLoad - Return true if LD is loading 'Bytes' bytes from a
6194 /// location that is 'Dist' units away from the location that the 'Base' load
6195 /// is loading from.
6196 bool SelectionDAG::isConsecutiveLoad(LoadSDNode *LD, LoadSDNode *Base,
6197 unsigned Bytes, int Dist) const {
6198 if (LD->getChain() != Base->getChain())
6200 EVT VT = LD->getValueType(0);
6201 if (VT.getSizeInBits() / 8 != Bytes)
6204 SDValue Loc = LD->getOperand(1);
6205 SDValue BaseLoc = Base->getOperand(1);
6206 if (Loc.getOpcode() == ISD::FrameIndex) {
6207 if (BaseLoc.getOpcode() != ISD::FrameIndex)
6209 const MachineFrameInfo *MFI = getMachineFunction().getFrameInfo();
6210 int FI = cast<FrameIndexSDNode>(Loc)->getIndex();
6211 int BFI = cast<FrameIndexSDNode>(BaseLoc)->getIndex();
6212 int FS = MFI->getObjectSize(FI);
6213 int BFS = MFI->getObjectSize(BFI);
6214 if (FS != BFS || FS != (int)Bytes) return false;
6215 return MFI->getObjectOffset(FI) == (MFI->getObjectOffset(BFI) + Dist*Bytes);
6217 if (Loc.getOpcode() == ISD::ADD && Loc.getOperand(0) == BaseLoc) {
6218 ConstantSDNode *V = dyn_cast<ConstantSDNode>(Loc.getOperand(1));
6219 if (V && (V->getSExtValue() == Dist*Bytes))
6223 const GlobalValue *GV1 = NULL;
6224 const GlobalValue *GV2 = NULL;
6225 int64_t Offset1 = 0;
6226 int64_t Offset2 = 0;
6227 bool isGA1 = TLI.isGAPlusOffset(Loc.getNode(), GV1, Offset1);
6228 bool isGA2 = TLI.isGAPlusOffset(BaseLoc.getNode(), GV2, Offset2);
6229 if (isGA1 && isGA2 && GV1 == GV2)
6230 return Offset1 == (Offset2 + Dist*Bytes);
6235 /// InferPtrAlignment - Infer alignment of a load / store address. Return 0 if
6236 /// it cannot be inferred.
6237 unsigned SelectionDAG::InferPtrAlignment(SDValue Ptr) const {
6238 // If this is a GlobalAddress + cst, return the alignment.
6239 const GlobalValue *GV;
6240 int64_t GVOffset = 0;
6241 if (TLI.isGAPlusOffset(Ptr.getNode(), GV, GVOffset)) {
6242 // If GV has specified alignment, then use it. Otherwise, use the preferred
6244 unsigned Align = GV->getAlignment();
6246 if (const GlobalVariable *GVar = dyn_cast<GlobalVariable>(GV)) {
6247 if (GVar->hasInitializer()) {
6248 const TargetData *TD = TLI.getTargetData();
6249 Align = TD->getPreferredAlignment(GVar);
6253 return MinAlign(Align, GVOffset);
6256 // If this is a direct reference to a stack slot, use information about the
6257 // stack slot's alignment.
6258 int FrameIdx = 1 << 31;
6259 int64_t FrameOffset = 0;
6260 if (FrameIndexSDNode *FI = dyn_cast<FrameIndexSDNode>(Ptr)) {
6261 FrameIdx = FI->getIndex();
6262 } else if (Ptr.getOpcode() == ISD::ADD &&
6263 isa<ConstantSDNode>(Ptr.getOperand(1)) &&
6264 isa<FrameIndexSDNode>(Ptr.getOperand(0))) {
6265 FrameIdx = cast<FrameIndexSDNode>(Ptr.getOperand(0))->getIndex();
6266 FrameOffset = Ptr.getConstantOperandVal(1);
6269 if (FrameIdx != (1 << 31)) {
6270 // FIXME: Handle FI+CST.
6271 const MachineFrameInfo &MFI = *getMachineFunction().getFrameInfo();
6272 unsigned FIInfoAlign = MinAlign(MFI.getObjectAlignment(FrameIdx),
6274 if (MFI.isFixedObjectIndex(FrameIdx)) {
6275 int64_t ObjectOffset = MFI.getObjectOffset(FrameIdx) + FrameOffset;
6277 // The alignment of the frame index can be determined from its offset from
6278 // the incoming frame position. If the frame object is at offset 32 and
6279 // the stack is guaranteed to be 16-byte aligned, then we know that the
6280 // object is 16-byte aligned.
6281 unsigned StackAlign = getTarget().getFrameInfo()->getStackAlignment();
6282 unsigned Align = MinAlign(ObjectOffset, StackAlign);
6284 // Finally, the frame object itself may have a known alignment. Factor
6285 // the alignment + offset into a new alignment. For example, if we know
6286 // the FI is 8 byte aligned, but the pointer is 4 off, we really have a
6287 // 4-byte alignment of the resultant pointer. Likewise align 4 + 4-byte
6288 // offset = 4-byte alignment, align 4 + 1-byte offset = align 1, etc.
6289 return std::max(Align, FIInfoAlign);
6297 void SelectionDAG::dump() const {
6298 dbgs() << "SelectionDAG has " << AllNodes.size() << " nodes:";
6300 for (allnodes_const_iterator I = allnodes_begin(), E = allnodes_end();
6302 const SDNode *N = I;
6303 if (!N->hasOneUse() && N != getRoot().getNode())
6304 DumpNodes(N, 2, this);
6307 if (getRoot().getNode()) DumpNodes(getRoot().getNode(), 2, this);
6312 void SDNode::printr(raw_ostream &OS, const SelectionDAG *G) const {
6314 print_details(OS, G);
6317 typedef SmallPtrSet<const SDNode *, 128> VisitedSDNodeSet;
6318 static void DumpNodesr(raw_ostream &OS, const SDNode *N, unsigned indent,
6319 const SelectionDAG *G, VisitedSDNodeSet &once) {
6320 if (!once.insert(N)) // If we've been here before, return now.
6323 // Dump the current SDNode, but don't end the line yet.
6324 OS << std::string(indent, ' ');
6327 // Having printed this SDNode, walk the children:
6328 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
6329 const SDNode *child = N->getOperand(i).getNode();
6334 if (child->getNumOperands() == 0) {
6335 // This child has no grandchildren; print it inline right here.
6336 child->printr(OS, G);
6338 } else { // Just the address. FIXME: also print the child's opcode.
6340 if (unsigned RN = N->getOperand(i).getResNo())
6347 // Dump children that have grandchildren on their own line(s).
6348 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
6349 const SDNode *child = N->getOperand(i).getNode();
6350 DumpNodesr(OS, child, indent+2, G, once);
6354 void SDNode::dumpr() const {
6355 VisitedSDNodeSet once;
6356 DumpNodesr(dbgs(), this, 0, 0, once);
6359 void SDNode::dumpr(const SelectionDAG *G) const {
6360 VisitedSDNodeSet once;
6361 DumpNodesr(dbgs(), this, 0, G, once);
6365 // getAddressSpace - Return the address space this GlobalAddress belongs to.
6366 unsigned GlobalAddressSDNode::getAddressSpace() const {
6367 return getGlobal()->getType()->getAddressSpace();
6371 const Type *ConstantPoolSDNode::getType() const {
6372 if (isMachineConstantPoolEntry())
6373 return Val.MachineCPVal->getType();
6374 return Val.ConstVal->getType();
6377 bool BuildVectorSDNode::isConstantSplat(APInt &SplatValue,
6379 unsigned &SplatBitSize,
6381 unsigned MinSplatBits,
6383 EVT VT = getValueType(0);
6384 assert(VT.isVector() && "Expected a vector type");
6385 unsigned sz = VT.getSizeInBits();
6386 if (MinSplatBits > sz)
6389 SplatValue = APInt(sz, 0);
6390 SplatUndef = APInt(sz, 0);
6392 // Get the bits. Bits with undefined values (when the corresponding element
6393 // of the vector is an ISD::UNDEF value) are set in SplatUndef and cleared
6394 // in SplatValue. If any of the values are not constant, give up and return
6396 unsigned int nOps = getNumOperands();
6397 assert(nOps > 0 && "isConstantSplat has 0-size build vector");
6398 unsigned EltBitSize = VT.getVectorElementType().getSizeInBits();
6400 for (unsigned j = 0; j < nOps; ++j) {
6401 unsigned i = isBigEndian ? nOps-1-j : j;
6402 SDValue OpVal = getOperand(i);
6403 unsigned BitPos = j * EltBitSize;
6405 if (OpVal.getOpcode() == ISD::UNDEF)
6406 SplatUndef |= APInt::getBitsSet(sz, BitPos, BitPos + EltBitSize);
6407 else if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(OpVal))
6408 SplatValue |= APInt(CN->getAPIntValue()).zextOrTrunc(EltBitSize).
6409 zextOrTrunc(sz) << BitPos;
6410 else if (ConstantFPSDNode *CN = dyn_cast<ConstantFPSDNode>(OpVal))
6411 SplatValue |= CN->getValueAPF().bitcastToAPInt().zextOrTrunc(sz) <<BitPos;
6416 // The build_vector is all constants or undefs. Find the smallest element
6417 // size that splats the vector.
6419 HasAnyUndefs = (SplatUndef != 0);
6422 unsigned HalfSize = sz / 2;
6423 APInt HighValue = APInt(SplatValue).lshr(HalfSize).trunc(HalfSize);
6424 APInt LowValue = APInt(SplatValue).trunc(HalfSize);
6425 APInt HighUndef = APInt(SplatUndef).lshr(HalfSize).trunc(HalfSize);
6426 APInt LowUndef = APInt(SplatUndef).trunc(HalfSize);
6428 // If the two halves do not match (ignoring undef bits), stop here.
6429 if ((HighValue & ~LowUndef) != (LowValue & ~HighUndef) ||
6430 MinSplatBits > HalfSize)
6433 SplatValue = HighValue | LowValue;
6434 SplatUndef = HighUndef & LowUndef;
6443 bool ShuffleVectorSDNode::isSplatMask(const int *Mask, EVT VT) {
6444 // Find the first non-undef value in the shuffle mask.
6446 for (i = 0, e = VT.getVectorNumElements(); i != e && Mask[i] < 0; ++i)
6449 assert(i != e && "VECTOR_SHUFFLE node with all undef indices!");
6451 // Make sure all remaining elements are either undef or the same as the first
6453 for (int Idx = Mask[i]; i != e; ++i)
6454 if (Mask[i] >= 0 && Mask[i] != Idx)
6460 static void checkForCyclesHelper(const SDNode *N,
6461 SmallPtrSet<const SDNode*, 32> &Visited,
6462 SmallPtrSet<const SDNode*, 32> &Checked) {
6463 // If this node has already been checked, don't check it again.
6464 if (Checked.count(N))
6467 // If a node has already been visited on this depth-first walk, reject it as
6469 if (!Visited.insert(N)) {
6470 dbgs() << "Offending node:\n";
6472 errs() << "Detected cycle in SelectionDAG\n";
6476 for(unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
6477 checkForCyclesHelper(N->getOperand(i).getNode(), Visited, Checked);
6484 void llvm::checkForCycles(const llvm::SDNode *N) {
6486 assert(N && "Checking nonexistant SDNode");
6487 SmallPtrSet<const SDNode*, 32> visited;
6488 SmallPtrSet<const SDNode*, 32> checked;
6489 checkForCyclesHelper(N, visited, checked);
6493 void llvm::checkForCycles(const llvm::SelectionDAG *DAG) {
6494 checkForCycles(DAG->getRoot().getNode());