1 //===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===//
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 file implements the SelectionDAG::Legalize method.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Analysis/DebugInfo.h"
15 #include "llvm/CodeGen/Analysis.h"
16 #include "llvm/CodeGen/MachineFunction.h"
17 #include "llvm/CodeGen/MachineJumpTableInfo.h"
18 #include "llvm/CodeGen/SelectionDAG.h"
19 #include "llvm/Target/TargetFrameLowering.h"
20 #include "llvm/Target/TargetLowering.h"
21 #include "llvm/Target/TargetData.h"
22 #include "llvm/Target/TargetMachine.h"
23 #include "llvm/CallingConv.h"
24 #include "llvm/Constants.h"
25 #include "llvm/DerivedTypes.h"
26 #include "llvm/LLVMContext.h"
27 #include "llvm/Support/Debug.h"
28 #include "llvm/Support/ErrorHandling.h"
29 #include "llvm/Support/MathExtras.h"
30 #include "llvm/Support/raw_ostream.h"
31 #include "llvm/ADT/DenseMap.h"
32 #include "llvm/ADT/SmallVector.h"
33 #include "llvm/ADT/SmallPtrSet.h"
36 //===----------------------------------------------------------------------===//
37 /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
38 /// hacks on it until the target machine can handle it. This involves
39 /// eliminating value sizes the machine cannot handle (promoting small sizes to
40 /// large sizes or splitting up large values into small values) as well as
41 /// eliminating operations the machine cannot handle.
43 /// This code also does a small amount of optimization and recognition of idioms
44 /// as part of its processing. For example, if a target does not support a
45 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
46 /// will attempt merge setcc and brc instructions into brcc's.
49 class SelectionDAGLegalize : public SelectionDAG::DAGUpdateListener {
50 const TargetMachine &TM;
51 const TargetLowering &TLI;
54 /// LegalizePosition - The iterator for walking through the node list.
55 SelectionDAG::allnodes_iterator LegalizePosition;
57 /// LegalizedNodes - The set of nodes which have already been legalized.
58 SmallPtrSet<SDNode *, 16> LegalizedNodes;
60 // Libcall insertion helpers.
63 explicit SelectionDAGLegalize(SelectionDAG &DAG);
68 /// LegalizeOp - Legalizes the given operation.
69 void LegalizeOp(SDNode *Node);
71 SDValue OptimizeFloatStore(StoreSDNode *ST);
73 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
74 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
75 /// is necessary to spill the vector being inserted into to memory, perform
76 /// the insert there, and then read the result back.
77 SDValue PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val,
78 SDValue Idx, DebugLoc dl);
79 SDValue ExpandINSERT_VECTOR_ELT(SDValue Vec, SDValue Val,
80 SDValue Idx, DebugLoc dl);
82 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
83 /// performs the same shuffe in terms of order or result bytes, but on a type
84 /// whose vector element type is narrower than the original shuffle type.
85 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
86 SDValue ShuffleWithNarrowerEltType(EVT NVT, EVT VT, DebugLoc dl,
87 SDValue N1, SDValue N2,
88 ArrayRef<int> Mask) const;
90 void LegalizeSetCCCondCode(EVT VT, SDValue &LHS, SDValue &RHS, SDValue &CC,
93 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
94 SDValue ExpandLibCall(RTLIB::Libcall LC, EVT RetVT, const SDValue *Ops,
95 unsigned NumOps, bool isSigned, DebugLoc dl);
97 std::pair<SDValue, SDValue> ExpandChainLibCall(RTLIB::Libcall LC,
98 SDNode *Node, bool isSigned);
99 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
100 RTLIB::Libcall Call_F64, RTLIB::Libcall Call_F80,
101 RTLIB::Libcall Call_PPCF128);
102 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
103 RTLIB::Libcall Call_I8,
104 RTLIB::Libcall Call_I16,
105 RTLIB::Libcall Call_I32,
106 RTLIB::Libcall Call_I64,
107 RTLIB::Libcall Call_I128);
108 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
110 SDValue EmitStackConvert(SDValue SrcOp, EVT SlotVT, EVT DestVT, DebugLoc dl);
111 SDValue ExpandBUILD_VECTOR(SDNode *Node);
112 SDValue ExpandSCALAR_TO_VECTOR(SDNode *Node);
113 void ExpandDYNAMIC_STACKALLOC(SDNode *Node,
114 SmallVectorImpl<SDValue> &Results);
115 SDValue ExpandFCOPYSIGN(SDNode *Node);
116 SDValue ExpandLegalINT_TO_FP(bool isSigned, SDValue LegalOp, EVT DestVT,
118 SDValue PromoteLegalINT_TO_FP(SDValue LegalOp, EVT DestVT, bool isSigned,
120 SDValue PromoteLegalFP_TO_INT(SDValue LegalOp, EVT DestVT, bool isSigned,
123 SDValue ExpandBSWAP(SDValue Op, DebugLoc dl);
124 SDValue ExpandBitCount(unsigned Opc, SDValue Op, DebugLoc dl);
126 SDValue ExpandExtractFromVectorThroughStack(SDValue Op);
127 SDValue ExpandInsertToVectorThroughStack(SDValue Op);
128 SDValue ExpandVectorBuildThroughStack(SDNode* Node);
130 SDValue ExpandConstantFP(ConstantFPSDNode *CFP, bool UseCP);
132 std::pair<SDValue, SDValue> ExpandAtomic(SDNode *Node);
134 void ExpandNode(SDNode *Node);
135 void PromoteNode(SDNode *Node);
137 void ForgetNode(SDNode *N) {
138 LegalizedNodes.erase(N);
139 if (LegalizePosition == SelectionDAG::allnodes_iterator(N))
144 // DAGUpdateListener implementation.
145 virtual void NodeDeleted(SDNode *N, SDNode *E) {
148 virtual void NodeUpdated(SDNode *N) {}
150 // Node replacement helpers
151 void ReplacedNode(SDNode *N) {
152 if (N->use_empty()) {
153 DAG.RemoveDeadNode(N);
158 void ReplaceNode(SDNode *Old, SDNode *New) {
159 DAG.ReplaceAllUsesWith(Old, New);
162 void ReplaceNode(SDValue Old, SDValue New) {
163 DAG.ReplaceAllUsesWith(Old, New);
164 ReplacedNode(Old.getNode());
166 void ReplaceNode(SDNode *Old, const SDValue *New) {
167 DAG.ReplaceAllUsesWith(Old, New);
173 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
174 /// performs the same shuffe in terms of order or result bytes, but on a type
175 /// whose vector element type is narrower than the original shuffle type.
176 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
178 SelectionDAGLegalize::ShuffleWithNarrowerEltType(EVT NVT, EVT VT, DebugLoc dl,
179 SDValue N1, SDValue N2,
180 ArrayRef<int> Mask) const {
181 unsigned NumMaskElts = VT.getVectorNumElements();
182 unsigned NumDestElts = NVT.getVectorNumElements();
183 unsigned NumEltsGrowth = NumDestElts / NumMaskElts;
185 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
187 if (NumEltsGrowth == 1)
188 return DAG.getVectorShuffle(NVT, dl, N1, N2, &Mask[0]);
190 SmallVector<int, 8> NewMask;
191 for (unsigned i = 0; i != NumMaskElts; ++i) {
193 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
195 NewMask.push_back(-1);
197 NewMask.push_back(Idx * NumEltsGrowth + j);
200 assert(NewMask.size() == NumDestElts && "Non-integer NumEltsGrowth?");
201 assert(TLI.isShuffleMaskLegal(NewMask, NVT) && "Shuffle not legal?");
202 return DAG.getVectorShuffle(NVT, dl, N1, N2, &NewMask[0]);
205 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
206 : SelectionDAG::DAGUpdateListener(dag),
207 TM(dag.getTarget()), TLI(dag.getTargetLoweringInfo()),
211 void SelectionDAGLegalize::LegalizeDAG() {
212 DAG.AssignTopologicalOrder();
214 // Visit all the nodes. We start in topological order, so that we see
215 // nodes with their original operands intact. Legalization can produce
216 // new nodes which may themselves need to be legalized. Iterate until all
217 // nodes have been legalized.
219 bool AnyLegalized = false;
220 for (LegalizePosition = DAG.allnodes_end();
221 LegalizePosition != DAG.allnodes_begin(); ) {
224 SDNode *N = LegalizePosition;
225 if (LegalizedNodes.insert(N)) {
235 // Remove dead nodes now.
236 DAG.RemoveDeadNodes();
239 /// ExpandConstantFP - Expands the ConstantFP node to an integer constant or
240 /// a load from the constant pool.
242 SelectionDAGLegalize::ExpandConstantFP(ConstantFPSDNode *CFP, bool UseCP) {
244 DebugLoc dl = CFP->getDebugLoc();
246 // If a FP immediate is precise when represented as a float and if the
247 // target can do an extending load from float to double, we put it into
248 // the constant pool as a float, even if it's is statically typed as a
249 // double. This shrinks FP constants and canonicalizes them for targets where
250 // an FP extending load is the same cost as a normal load (such as on the x87
251 // fp stack or PPC FP unit).
252 EVT VT = CFP->getValueType(0);
253 ConstantFP *LLVMC = const_cast<ConstantFP*>(CFP->getConstantFPValue());
255 assert((VT == MVT::f64 || VT == MVT::f32) && "Invalid type expansion");
256 return DAG.getConstant(LLVMC->getValueAPF().bitcastToAPInt(),
257 (VT == MVT::f64) ? MVT::i64 : MVT::i32);
262 while (SVT != MVT::f32) {
263 SVT = (MVT::SimpleValueType)(SVT.getSimpleVT().SimpleTy - 1);
264 if (ConstantFPSDNode::isValueValidForType(SVT, CFP->getValueAPF()) &&
265 // Only do this if the target has a native EXTLOAD instruction from
267 TLI.isLoadExtLegal(ISD::EXTLOAD, SVT) &&
268 TLI.ShouldShrinkFPConstant(OrigVT)) {
269 Type *SType = SVT.getTypeForEVT(*DAG.getContext());
270 LLVMC = cast<ConstantFP>(ConstantExpr::getFPTrunc(LLVMC, SType));
276 SDValue CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
277 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
280 DAG.getExtLoad(ISD::EXTLOAD, dl, OrigVT,
282 CPIdx, MachinePointerInfo::getConstantPool(),
283 VT, false, false, Alignment);
287 DAG.getLoad(OrigVT, dl, DAG.getEntryNode(), CPIdx,
288 MachinePointerInfo::getConstantPool(), false, false, false,
293 /// ExpandUnalignedStore - Expands an unaligned store to 2 half-size stores.
294 static void ExpandUnalignedStore(StoreSDNode *ST, SelectionDAG &DAG,
295 const TargetLowering &TLI,
296 SelectionDAGLegalize *DAGLegalize) {
297 assert(ST->getAddressingMode() == ISD::UNINDEXED &&
298 "unaligned indexed stores not implemented!");
299 SDValue Chain = ST->getChain();
300 SDValue Ptr = ST->getBasePtr();
301 SDValue Val = ST->getValue();
302 EVT VT = Val.getValueType();
303 int Alignment = ST->getAlignment();
304 DebugLoc dl = ST->getDebugLoc();
305 if (ST->getMemoryVT().isFloatingPoint() ||
306 ST->getMemoryVT().isVector()) {
307 EVT intVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits());
308 if (TLI.isTypeLegal(intVT)) {
309 // Expand to a bitconvert of the value to the integer type of the
310 // same size, then a (misaligned) int store.
311 // FIXME: Does not handle truncating floating point stores!
312 SDValue Result = DAG.getNode(ISD::BITCAST, dl, intVT, Val);
313 Result = DAG.getStore(Chain, dl, Result, Ptr, ST->getPointerInfo(),
314 ST->isVolatile(), ST->isNonTemporal(), Alignment);
315 DAGLegalize->ReplaceNode(SDValue(ST, 0), Result);
318 // Do a (aligned) store to a stack slot, then copy from the stack slot
319 // to the final destination using (unaligned) integer loads and stores.
320 EVT StoredVT = ST->getMemoryVT();
322 TLI.getRegisterType(*DAG.getContext(),
323 EVT::getIntegerVT(*DAG.getContext(),
324 StoredVT.getSizeInBits()));
325 unsigned StoredBytes = StoredVT.getSizeInBits() / 8;
326 unsigned RegBytes = RegVT.getSizeInBits() / 8;
327 unsigned NumRegs = (StoredBytes + RegBytes - 1) / RegBytes;
329 // Make sure the stack slot is also aligned for the register type.
330 SDValue StackPtr = DAG.CreateStackTemporary(StoredVT, RegVT);
332 // Perform the original store, only redirected to the stack slot.
333 SDValue Store = DAG.getTruncStore(Chain, dl,
334 Val, StackPtr, MachinePointerInfo(),
335 StoredVT, false, false, 0);
336 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
337 SmallVector<SDValue, 8> Stores;
340 // Do all but one copies using the full register width.
341 for (unsigned i = 1; i < NumRegs; i++) {
342 // Load one integer register's worth from the stack slot.
343 SDValue Load = DAG.getLoad(RegVT, dl, Store, StackPtr,
344 MachinePointerInfo(),
345 false, false, false, 0);
346 // Store it to the final location. Remember the store.
347 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr,
348 ST->getPointerInfo().getWithOffset(Offset),
349 ST->isVolatile(), ST->isNonTemporal(),
350 MinAlign(ST->getAlignment(), Offset)));
351 // Increment the pointers.
353 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
355 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
358 // The last store may be partial. Do a truncating store. On big-endian
359 // machines this requires an extending load from the stack slot to ensure
360 // that the bits are in the right place.
361 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(),
362 8 * (StoredBytes - Offset));
364 // Load from the stack slot.
365 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Store, StackPtr,
366 MachinePointerInfo(),
367 MemVT, false, false, 0);
369 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, Ptr,
371 .getWithOffset(Offset),
372 MemVT, ST->isVolatile(),
374 MinAlign(ST->getAlignment(), Offset)));
375 // The order of the stores doesn't matter - say it with a TokenFactor.
377 DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
379 DAGLegalize->ReplaceNode(SDValue(ST, 0), Result);
382 assert(ST->getMemoryVT().isInteger() &&
383 !ST->getMemoryVT().isVector() &&
384 "Unaligned store of unknown type.");
385 // Get the half-size VT
386 EVT NewStoredVT = ST->getMemoryVT().getHalfSizedIntegerVT(*DAG.getContext());
387 int NumBits = NewStoredVT.getSizeInBits();
388 int IncrementSize = NumBits / 8;
390 // Divide the stored value in two parts.
391 SDValue ShiftAmount = DAG.getConstant(NumBits,
392 TLI.getShiftAmountTy(Val.getValueType()));
394 SDValue Hi = DAG.getNode(ISD::SRL, dl, VT, Val, ShiftAmount);
396 // Store the two parts
397 SDValue Store1, Store2;
398 Store1 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Lo:Hi, Ptr,
399 ST->getPointerInfo(), NewStoredVT,
400 ST->isVolatile(), ST->isNonTemporal(), Alignment);
401 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
402 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
403 Alignment = MinAlign(Alignment, IncrementSize);
404 Store2 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Hi:Lo, Ptr,
405 ST->getPointerInfo().getWithOffset(IncrementSize),
406 NewStoredVT, ST->isVolatile(), ST->isNonTemporal(),
410 DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Store1, Store2);
411 DAGLegalize->ReplaceNode(SDValue(ST, 0), Result);
414 /// ExpandUnalignedLoad - Expands an unaligned load to 2 half-size loads.
416 ExpandUnalignedLoad(LoadSDNode *LD, SelectionDAG &DAG,
417 const TargetLowering &TLI,
418 SDValue &ValResult, SDValue &ChainResult) {
419 assert(LD->getAddressingMode() == ISD::UNINDEXED &&
420 "unaligned indexed loads not implemented!");
421 SDValue Chain = LD->getChain();
422 SDValue Ptr = LD->getBasePtr();
423 EVT VT = LD->getValueType(0);
424 EVT LoadedVT = LD->getMemoryVT();
425 DebugLoc dl = LD->getDebugLoc();
426 if (VT.isFloatingPoint() || VT.isVector()) {
427 EVT intVT = EVT::getIntegerVT(*DAG.getContext(), LoadedVT.getSizeInBits());
428 if (TLI.isTypeLegal(intVT)) {
429 // Expand to a (misaligned) integer load of the same size,
430 // then bitconvert to floating point or vector.
431 SDValue newLoad = DAG.getLoad(intVT, dl, Chain, Ptr, LD->getPointerInfo(),
434 LD->isInvariant(), LD->getAlignment());
435 SDValue Result = DAG.getNode(ISD::BITCAST, dl, LoadedVT, newLoad);
436 if (VT.isFloatingPoint() && LoadedVT != VT)
437 Result = DAG.getNode(ISD::FP_EXTEND, dl, VT, Result);
444 // Copy the value to a (aligned) stack slot using (unaligned) integer
445 // loads and stores, then do a (aligned) load from the stack slot.
446 EVT RegVT = TLI.getRegisterType(*DAG.getContext(), intVT);
447 unsigned LoadedBytes = LoadedVT.getSizeInBits() / 8;
448 unsigned RegBytes = RegVT.getSizeInBits() / 8;
449 unsigned NumRegs = (LoadedBytes + RegBytes - 1) / RegBytes;
451 // Make sure the stack slot is also aligned for the register type.
452 SDValue StackBase = DAG.CreateStackTemporary(LoadedVT, RegVT);
454 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
455 SmallVector<SDValue, 8> Stores;
456 SDValue StackPtr = StackBase;
459 // Do all but one copies using the full register width.
460 for (unsigned i = 1; i < NumRegs; i++) {
461 // Load one integer register's worth from the original location.
462 SDValue Load = DAG.getLoad(RegVT, dl, Chain, Ptr,
463 LD->getPointerInfo().getWithOffset(Offset),
464 LD->isVolatile(), LD->isNonTemporal(),
466 MinAlign(LD->getAlignment(), Offset));
467 // Follow the load with a store to the stack slot. Remember the store.
468 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, StackPtr,
469 MachinePointerInfo(), false, false, 0));
470 // Increment the pointers.
472 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
473 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
477 // The last copy may be partial. Do an extending load.
478 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(),
479 8 * (LoadedBytes - Offset));
480 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Chain, Ptr,
481 LD->getPointerInfo().getWithOffset(Offset),
482 MemVT, LD->isVolatile(),
484 MinAlign(LD->getAlignment(), Offset));
485 // Follow the load with a store to the stack slot. Remember the store.
486 // On big-endian machines this requires a truncating store to ensure
487 // that the bits end up in the right place.
488 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, StackPtr,
489 MachinePointerInfo(), MemVT,
492 // The order of the stores doesn't matter - say it with a TokenFactor.
493 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
496 // Finally, perform the original load only redirected to the stack slot.
497 Load = DAG.getExtLoad(LD->getExtensionType(), dl, VT, TF, StackBase,
498 MachinePointerInfo(), LoadedVT, false, false, 0);
500 // Callers expect a MERGE_VALUES node.
505 assert(LoadedVT.isInteger() && !LoadedVT.isVector() &&
506 "Unaligned load of unsupported type.");
508 // Compute the new VT that is half the size of the old one. This is an
510 unsigned NumBits = LoadedVT.getSizeInBits();
512 NewLoadedVT = EVT::getIntegerVT(*DAG.getContext(), NumBits/2);
515 unsigned Alignment = LD->getAlignment();
516 unsigned IncrementSize = NumBits / 8;
517 ISD::LoadExtType HiExtType = LD->getExtensionType();
519 // If the original load is NON_EXTLOAD, the hi part load must be ZEXTLOAD.
520 if (HiExtType == ISD::NON_EXTLOAD)
521 HiExtType = ISD::ZEXTLOAD;
523 // Load the value in two parts
525 if (TLI.isLittleEndian()) {
526 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr, LD->getPointerInfo(),
527 NewLoadedVT, LD->isVolatile(),
528 LD->isNonTemporal(), Alignment);
529 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
530 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
531 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr,
532 LD->getPointerInfo().getWithOffset(IncrementSize),
533 NewLoadedVT, LD->isVolatile(),
534 LD->isNonTemporal(), MinAlign(Alignment,IncrementSize));
536 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr, LD->getPointerInfo(),
537 NewLoadedVT, LD->isVolatile(),
538 LD->isNonTemporal(), Alignment);
539 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
540 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
541 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr,
542 LD->getPointerInfo().getWithOffset(IncrementSize),
543 NewLoadedVT, LD->isVolatile(),
544 LD->isNonTemporal(), MinAlign(Alignment,IncrementSize));
547 // aggregate the two parts
548 SDValue ShiftAmount = DAG.getConstant(NumBits,
549 TLI.getShiftAmountTy(Hi.getValueType()));
550 SDValue Result = DAG.getNode(ISD::SHL, dl, VT, Hi, ShiftAmount);
551 Result = DAG.getNode(ISD::OR, dl, VT, Result, Lo);
553 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
560 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
561 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
562 /// is necessary to spill the vector being inserted into to memory, perform
563 /// the insert there, and then read the result back.
564 SDValue SelectionDAGLegalize::
565 PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val, SDValue Idx,
571 // If the target doesn't support this, we have to spill the input vector
572 // to a temporary stack slot, update the element, then reload it. This is
573 // badness. We could also load the value into a vector register (either
574 // with a "move to register" or "extload into register" instruction, then
575 // permute it into place, if the idx is a constant and if the idx is
576 // supported by the target.
577 EVT VT = Tmp1.getValueType();
578 EVT EltVT = VT.getVectorElementType();
579 EVT IdxVT = Tmp3.getValueType();
580 EVT PtrVT = TLI.getPointerTy();
581 SDValue StackPtr = DAG.CreateStackTemporary(VT);
583 int SPFI = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex();
586 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Tmp1, StackPtr,
587 MachinePointerInfo::getFixedStack(SPFI),
590 // Truncate or zero extend offset to target pointer type.
591 unsigned CastOpc = IdxVT.bitsGT(PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
592 Tmp3 = DAG.getNode(CastOpc, dl, PtrVT, Tmp3);
593 // Add the offset to the index.
594 unsigned EltSize = EltVT.getSizeInBits()/8;
595 Tmp3 = DAG.getNode(ISD::MUL, dl, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
596 SDValue StackPtr2 = DAG.getNode(ISD::ADD, dl, IdxVT, Tmp3, StackPtr);
597 // Store the scalar value.
598 Ch = DAG.getTruncStore(Ch, dl, Tmp2, StackPtr2, MachinePointerInfo(), EltVT,
600 // Load the updated vector.
601 return DAG.getLoad(VT, dl, Ch, StackPtr,
602 MachinePointerInfo::getFixedStack(SPFI), false, false,
607 SDValue SelectionDAGLegalize::
608 ExpandINSERT_VECTOR_ELT(SDValue Vec, SDValue Val, SDValue Idx, DebugLoc dl) {
609 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Idx)) {
610 // SCALAR_TO_VECTOR requires that the type of the value being inserted
611 // match the element type of the vector being created, except for
612 // integers in which case the inserted value can be over width.
613 EVT EltVT = Vec.getValueType().getVectorElementType();
614 if (Val.getValueType() == EltVT ||
615 (EltVT.isInteger() && Val.getValueType().bitsGE(EltVT))) {
616 SDValue ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
617 Vec.getValueType(), Val);
619 unsigned NumElts = Vec.getValueType().getVectorNumElements();
620 // We generate a shuffle of InVec and ScVec, so the shuffle mask
621 // should be 0,1,2,3,4,5... with the appropriate element replaced with
623 SmallVector<int, 8> ShufOps;
624 for (unsigned i = 0; i != NumElts; ++i)
625 ShufOps.push_back(i != InsertPos->getZExtValue() ? i : NumElts);
627 return DAG.getVectorShuffle(Vec.getValueType(), dl, Vec, ScVec,
631 return PerformInsertVectorEltInMemory(Vec, Val, Idx, dl);
634 SDValue SelectionDAGLegalize::OptimizeFloatStore(StoreSDNode* ST) {
635 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
636 // FIXME: We shouldn't do this for TargetConstantFP's.
637 // FIXME: move this to the DAG Combiner! Note that we can't regress due
638 // to phase ordering between legalized code and the dag combiner. This
639 // probably means that we need to integrate dag combiner and legalizer
641 // We generally can't do this one for long doubles.
642 SDValue Tmp1 = ST->getChain();
643 SDValue Tmp2 = ST->getBasePtr();
645 unsigned Alignment = ST->getAlignment();
646 bool isVolatile = ST->isVolatile();
647 bool isNonTemporal = ST->isNonTemporal();
648 DebugLoc dl = ST->getDebugLoc();
649 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(ST->getValue())) {
650 if (CFP->getValueType(0) == MVT::f32 &&
651 TLI.isTypeLegal(MVT::i32)) {
652 Tmp3 = DAG.getConstant(CFP->getValueAPF().
653 bitcastToAPInt().zextOrTrunc(32),
655 return DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getPointerInfo(),
656 isVolatile, isNonTemporal, Alignment);
659 if (CFP->getValueType(0) == MVT::f64) {
660 // If this target supports 64-bit registers, do a single 64-bit store.
661 if (TLI.isTypeLegal(MVT::i64)) {
662 Tmp3 = DAG.getConstant(CFP->getValueAPF().bitcastToAPInt().
663 zextOrTrunc(64), MVT::i64);
664 return DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getPointerInfo(),
665 isVolatile, isNonTemporal, Alignment);
668 if (TLI.isTypeLegal(MVT::i32) && !ST->isVolatile()) {
669 // Otherwise, if the target supports 32-bit registers, use 2 32-bit
670 // stores. If the target supports neither 32- nor 64-bits, this
671 // xform is certainly not worth it.
672 const APInt &IntVal =CFP->getValueAPF().bitcastToAPInt();
673 SDValue Lo = DAG.getConstant(IntVal.trunc(32), MVT::i32);
674 SDValue Hi = DAG.getConstant(IntVal.lshr(32).trunc(32), MVT::i32);
675 if (TLI.isBigEndian()) std::swap(Lo, Hi);
677 Lo = DAG.getStore(Tmp1, dl, Lo, Tmp2, ST->getPointerInfo(), isVolatile,
678 isNonTemporal, Alignment);
679 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
680 DAG.getIntPtrConstant(4));
681 Hi = DAG.getStore(Tmp1, dl, Hi, Tmp2,
682 ST->getPointerInfo().getWithOffset(4),
683 isVolatile, isNonTemporal, MinAlign(Alignment, 4U));
685 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
689 return SDValue(0, 0);
692 /// LegalizeOp - Return a legal replacement for the given operation, with
693 /// all legal operands.
694 void SelectionDAGLegalize::LegalizeOp(SDNode *Node) {
695 if (Node->getOpcode() == ISD::TargetConstant) // Allow illegal target nodes.
698 DebugLoc dl = Node->getDebugLoc();
700 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
701 assert(TLI.getTypeAction(*DAG.getContext(), Node->getValueType(i)) ==
702 TargetLowering::TypeLegal &&
703 "Unexpected illegal type!");
705 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
706 assert((TLI.getTypeAction(*DAG.getContext(),
707 Node->getOperand(i).getValueType()) ==
708 TargetLowering::TypeLegal ||
709 Node->getOperand(i).getOpcode() == ISD::TargetConstant) &&
710 "Unexpected illegal type!");
712 SDValue Tmp1, Tmp2, Tmp3, Tmp4;
713 bool isCustom = false;
715 // Figure out the correct action; the way to query this varies by opcode
716 TargetLowering::LegalizeAction Action = TargetLowering::Legal;
717 bool SimpleFinishLegalizing = true;
718 switch (Node->getOpcode()) {
719 case ISD::INTRINSIC_W_CHAIN:
720 case ISD::INTRINSIC_WO_CHAIN:
721 case ISD::INTRINSIC_VOID:
723 Action = TLI.getOperationAction(Node->getOpcode(), MVT::Other);
726 Action = TLI.getOperationAction(Node->getOpcode(),
727 Node->getValueType(0));
728 if (Action != TargetLowering::Promote)
729 Action = TLI.getOperationAction(Node->getOpcode(), MVT::Other);
731 case ISD::SINT_TO_FP:
732 case ISD::UINT_TO_FP:
733 case ISD::EXTRACT_VECTOR_ELT:
734 Action = TLI.getOperationAction(Node->getOpcode(),
735 Node->getOperand(0).getValueType());
737 case ISD::FP_ROUND_INREG:
738 case ISD::SIGN_EXTEND_INREG: {
739 EVT InnerType = cast<VTSDNode>(Node->getOperand(1))->getVT();
740 Action = TLI.getOperationAction(Node->getOpcode(), InnerType);
743 case ISD::ATOMIC_STORE: {
744 Action = TLI.getOperationAction(Node->getOpcode(),
745 Node->getOperand(2).getValueType());
751 unsigned CCOperand = Node->getOpcode() == ISD::SELECT_CC ? 4 :
752 Node->getOpcode() == ISD::SETCC ? 2 : 1;
753 unsigned CompareOperand = Node->getOpcode() == ISD::BR_CC ? 2 : 0;
754 EVT OpVT = Node->getOperand(CompareOperand).getValueType();
755 ISD::CondCode CCCode =
756 cast<CondCodeSDNode>(Node->getOperand(CCOperand))->get();
757 Action = TLI.getCondCodeAction(CCCode, OpVT);
758 if (Action == TargetLowering::Legal) {
759 if (Node->getOpcode() == ISD::SELECT_CC)
760 Action = TLI.getOperationAction(Node->getOpcode(),
761 Node->getValueType(0));
763 Action = TLI.getOperationAction(Node->getOpcode(), OpVT);
769 // FIXME: Model these properly. LOAD and STORE are complicated, and
770 // STORE expects the unlegalized operand in some cases.
771 SimpleFinishLegalizing = false;
773 case ISD::CALLSEQ_START:
774 case ISD::CALLSEQ_END:
775 // FIXME: This shouldn't be necessary. These nodes have special properties
776 // dealing with the recursive nature of legalization. Removing this
777 // special case should be done as part of making LegalizeDAG non-recursive.
778 SimpleFinishLegalizing = false;
780 case ISD::EXTRACT_ELEMENT:
781 case ISD::FLT_ROUNDS_:
789 case ISD::MERGE_VALUES:
791 case ISD::FRAME_TO_ARGS_OFFSET:
792 case ISD::EH_SJLJ_SETJMP:
793 case ISD::EH_SJLJ_LONGJMP:
794 // These operations lie about being legal: when they claim to be legal,
795 // they should actually be expanded.
796 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
797 if (Action == TargetLowering::Legal)
798 Action = TargetLowering::Expand;
800 case ISD::INIT_TRAMPOLINE:
801 case ISD::ADJUST_TRAMPOLINE:
803 case ISD::RETURNADDR:
804 // These operations lie about being legal: when they claim to be legal,
805 // they should actually be custom-lowered.
806 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
807 if (Action == TargetLowering::Legal)
808 Action = TargetLowering::Custom;
811 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
812 Action = TargetLowering::Legal;
814 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
819 if (SimpleFinishLegalizing) {
820 SDNode *NewNode = Node;
821 switch (Node->getOpcode()) {
828 // Legalizing shifts/rotates requires adjusting the shift amount
829 // to the appropriate width.
830 if (!Node->getOperand(1).getValueType().isVector()) {
832 DAG.getShiftAmountOperand(Node->getOperand(0).getValueType(),
833 Node->getOperand(1));
834 HandleSDNode Handle(SAO);
835 LegalizeOp(SAO.getNode());
836 NewNode = DAG.UpdateNodeOperands(Node, Node->getOperand(0),
843 // Legalizing shifts/rotates requires adjusting the shift amount
844 // to the appropriate width.
845 if (!Node->getOperand(2).getValueType().isVector()) {
847 DAG.getShiftAmountOperand(Node->getOperand(0).getValueType(),
848 Node->getOperand(2));
849 HandleSDNode Handle(SAO);
850 LegalizeOp(SAO.getNode());
851 NewNode = DAG.UpdateNodeOperands(Node, Node->getOperand(0),
858 if (NewNode != Node) {
859 DAG.ReplaceAllUsesWith(Node, NewNode);
860 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
861 DAG.TransferDbgValues(SDValue(Node, i), SDValue(NewNode, i));
866 case TargetLowering::Legal:
868 case TargetLowering::Custom:
869 // FIXME: The handling for custom lowering with multiple results is
871 Tmp1 = TLI.LowerOperation(SDValue(Node, 0), DAG);
872 if (Tmp1.getNode()) {
873 SmallVector<SDValue, 8> ResultVals;
874 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
876 ResultVals.push_back(Tmp1);
878 ResultVals.push_back(Tmp1.getValue(i));
880 if (Tmp1.getNode() != Node || Tmp1.getResNo() != 0) {
881 DAG.ReplaceAllUsesWith(Node, ResultVals.data());
882 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
883 DAG.TransferDbgValues(SDValue(Node, i), ResultVals[i]);
890 case TargetLowering::Expand:
893 case TargetLowering::Promote:
899 switch (Node->getOpcode()) {
906 llvm_unreachable("Do not know how to legalize this operator!");
908 case ISD::CALLSEQ_START:
909 case ISD::CALLSEQ_END:
912 LoadSDNode *LD = cast<LoadSDNode>(Node);
913 Tmp1 = LD->getChain(); // Legalize the chain.
914 Tmp2 = LD->getBasePtr(); // Legalize the base pointer.
916 ISD::LoadExtType ExtType = LD->getExtensionType();
917 if (ExtType == ISD::NON_EXTLOAD) {
918 EVT VT = Node->getValueType(0);
919 Tmp3 = SDValue(Node, 0);
920 Tmp4 = SDValue(Node, 1);
922 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
923 default: llvm_unreachable("This action is not supported yet!");
924 case TargetLowering::Legal:
925 // If this is an unaligned load and the target doesn't support it,
927 if (!TLI.allowsUnalignedMemoryAccesses(LD->getMemoryVT())) {
928 Type *Ty = LD->getMemoryVT().getTypeForEVT(*DAG.getContext());
929 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
930 if (LD->getAlignment() < ABIAlignment){
931 ExpandUnalignedLoad(cast<LoadSDNode>(Node),
932 DAG, TLI, Tmp3, Tmp4);
936 case TargetLowering::Custom:
937 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
938 if (Tmp1.getNode()) {
940 Tmp4 = Tmp1.getValue(1);
943 case TargetLowering::Promote: {
944 // Only promote a load of vector type to another.
945 assert(VT.isVector() && "Cannot promote this load!");
946 // Change base type to a different vector type.
947 EVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
949 Tmp1 = DAG.getLoad(NVT, dl, Tmp1, Tmp2, LD->getPointerInfo(),
950 LD->isVolatile(), LD->isNonTemporal(),
951 LD->isInvariant(), LD->getAlignment());
952 Tmp3 = DAG.getNode(ISD::BITCAST, dl, VT, Tmp1);
953 Tmp4 = Tmp1.getValue(1);
957 if (Tmp4.getNode() != Node) {
958 assert(Tmp3.getNode() != Node && "Load must be completely replaced");
959 DAG.ReplaceAllUsesOfValueWith(SDValue(Node, 0), Tmp3);
960 DAG.ReplaceAllUsesOfValueWith(SDValue(Node, 1), Tmp4);
966 EVT SrcVT = LD->getMemoryVT();
967 unsigned SrcWidth = SrcVT.getSizeInBits();
968 unsigned Alignment = LD->getAlignment();
969 bool isVolatile = LD->isVolatile();
970 bool isNonTemporal = LD->isNonTemporal();
972 if (SrcWidth != SrcVT.getStoreSizeInBits() &&
973 // Some targets pretend to have an i1 loading operation, and actually
974 // load an i8. This trick is correct for ZEXTLOAD because the top 7
975 // bits are guaranteed to be zero; it helps the optimizers understand
976 // that these bits are zero. It is also useful for EXTLOAD, since it
977 // tells the optimizers that those bits are undefined. It would be
978 // nice to have an effective generic way of getting these benefits...
979 // Until such a way is found, don't insist on promoting i1 here.
981 TLI.getLoadExtAction(ExtType, MVT::i1) == TargetLowering::Promote)) {
982 // Promote to a byte-sized load if not loading an integral number of
983 // bytes. For example, promote EXTLOAD:i20 -> EXTLOAD:i24.
984 unsigned NewWidth = SrcVT.getStoreSizeInBits();
985 EVT NVT = EVT::getIntegerVT(*DAG.getContext(), NewWidth);
988 // The extra bits are guaranteed to be zero, since we stored them that
989 // way. A zext load from NVT thus automatically gives zext from SrcVT.
991 ISD::LoadExtType NewExtType =
992 ExtType == ISD::ZEXTLOAD ? ISD::ZEXTLOAD : ISD::EXTLOAD;
995 DAG.getExtLoad(NewExtType, dl, Node->getValueType(0),
996 Tmp1, Tmp2, LD->getPointerInfo(),
997 NVT, isVolatile, isNonTemporal, Alignment);
999 Ch = Result.getValue(1); // The chain.
1001 if (ExtType == ISD::SEXTLOAD)
1002 // Having the top bits zero doesn't help when sign extending.
1003 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
1004 Result.getValueType(),
1005 Result, DAG.getValueType(SrcVT));
1006 else if (ExtType == ISD::ZEXTLOAD || NVT == Result.getValueType())
1007 // All the top bits are guaranteed to be zero - inform the optimizers.
1008 Result = DAG.getNode(ISD::AssertZext, dl,
1009 Result.getValueType(), Result,
1010 DAG.getValueType(SrcVT));
1014 } else if (SrcWidth & (SrcWidth - 1)) {
1015 // If not loading a power-of-2 number of bits, expand as two loads.
1016 assert(!SrcVT.isVector() && "Unsupported extload!");
1017 unsigned RoundWidth = 1 << Log2_32(SrcWidth);
1018 assert(RoundWidth < SrcWidth);
1019 unsigned ExtraWidth = SrcWidth - RoundWidth;
1020 assert(ExtraWidth < RoundWidth);
1021 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
1022 "Load size not an integral number of bytes!");
1023 EVT RoundVT = EVT::getIntegerVT(*DAG.getContext(), RoundWidth);
1024 EVT ExtraVT = EVT::getIntegerVT(*DAG.getContext(), ExtraWidth);
1026 unsigned IncrementSize;
1028 if (TLI.isLittleEndian()) {
1029 // EXTLOAD:i24 -> ZEXTLOAD:i16 | (shl EXTLOAD@+2:i8, 16)
1030 // Load the bottom RoundWidth bits.
1031 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, Node->getValueType(0),
1033 LD->getPointerInfo(), RoundVT, isVolatile,
1034 isNonTemporal, Alignment);
1036 // Load the remaining ExtraWidth bits.
1037 IncrementSize = RoundWidth / 8;
1038 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1039 DAG.getIntPtrConstant(IncrementSize));
1040 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
1041 LD->getPointerInfo().getWithOffset(IncrementSize),
1042 ExtraVT, isVolatile, isNonTemporal,
1043 MinAlign(Alignment, IncrementSize));
1045 // Build a factor node to remember that this load is independent of
1047 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1050 // Move the top bits to the right place.
1051 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
1052 DAG.getConstant(RoundWidth,
1053 TLI.getShiftAmountTy(Hi.getValueType())));
1055 // Join the hi and lo parts.
1056 Tmp1 = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
1058 // Big endian - avoid unaligned loads.
1059 // EXTLOAD:i24 -> (shl EXTLOAD:i16, 8) | ZEXTLOAD@+2:i8
1060 // Load the top RoundWidth bits.
1061 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
1062 LD->getPointerInfo(), RoundVT, isVolatile,
1063 isNonTemporal, Alignment);
1065 // Load the remaining ExtraWidth bits.
1066 IncrementSize = RoundWidth / 8;
1067 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1068 DAG.getIntPtrConstant(IncrementSize));
1069 Lo = DAG.getExtLoad(ISD::ZEXTLOAD,
1070 dl, Node->getValueType(0), Tmp1, Tmp2,
1071 LD->getPointerInfo().getWithOffset(IncrementSize),
1072 ExtraVT, isVolatile, isNonTemporal,
1073 MinAlign(Alignment, IncrementSize));
1075 // Build a factor node to remember that this load is independent of
1077 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1080 // Move the top bits to the right place.
1081 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
1082 DAG.getConstant(ExtraWidth,
1083 TLI.getShiftAmountTy(Hi.getValueType())));
1085 // Join the hi and lo parts.
1086 Tmp1 = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
1091 switch (TLI.getLoadExtAction(ExtType, SrcVT)) {
1092 default: llvm_unreachable("This action is not supported yet!");
1093 case TargetLowering::Custom:
1096 case TargetLowering::Legal:
1097 Tmp1 = SDValue(Node, 0);
1098 Tmp2 = SDValue(Node, 1);
1101 Tmp3 = TLI.LowerOperation(SDValue(Node, 0), DAG);
1102 if (Tmp3.getNode()) {
1104 Tmp2 = Tmp3.getValue(1);
1107 // If this is an unaligned load and the target doesn't support it,
1109 if (!TLI.allowsUnalignedMemoryAccesses(LD->getMemoryVT())) {
1111 LD->getMemoryVT().getTypeForEVT(*DAG.getContext());
1112 unsigned ABIAlignment =
1113 TLI.getTargetData()->getABITypeAlignment(Ty);
1114 if (LD->getAlignment() < ABIAlignment){
1115 ExpandUnalignedLoad(cast<LoadSDNode>(Node),
1116 DAG, TLI, Tmp1, Tmp2);
1121 case TargetLowering::Expand:
1122 if (!TLI.isLoadExtLegal(ISD::EXTLOAD, SrcVT) && TLI.isTypeLegal(SrcVT)) {
1123 SDValue Load = DAG.getLoad(SrcVT, dl, Tmp1, Tmp2,
1124 LD->getPointerInfo(),
1125 LD->isVolatile(), LD->isNonTemporal(),
1126 LD->isInvariant(), LD->getAlignment());
1130 ExtendOp = (SrcVT.isFloatingPoint() ?
1131 ISD::FP_EXTEND : ISD::ANY_EXTEND);
1133 case ISD::SEXTLOAD: ExtendOp = ISD::SIGN_EXTEND; break;
1134 case ISD::ZEXTLOAD: ExtendOp = ISD::ZERO_EXTEND; break;
1135 default: llvm_unreachable("Unexpected extend load type!");
1137 Tmp1 = DAG.getNode(ExtendOp, dl, Node->getValueType(0), Load);
1138 Tmp2 = Load.getValue(1);
1142 assert(!SrcVT.isVector() &&
1143 "Vector Loads are handled in LegalizeVectorOps");
1145 // FIXME: This does not work for vectors on most targets. Sign- and
1146 // zero-extend operations are currently folded into extending loads,
1147 // whether they are legal or not, and then we end up here without any
1148 // support for legalizing them.
1149 assert(ExtType != ISD::EXTLOAD &&
1150 "EXTLOAD should always be supported!");
1151 // Turn the unsupported load into an EXTLOAD followed by an explicit
1152 // zero/sign extend inreg.
1153 SDValue Result = DAG.getExtLoad(ISD::EXTLOAD, dl, Node->getValueType(0),
1154 Tmp1, Tmp2, LD->getPointerInfo(), SrcVT,
1155 LD->isVolatile(), LD->isNonTemporal(),
1156 LD->getAlignment());
1158 if (ExtType == ISD::SEXTLOAD)
1159 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
1160 Result.getValueType(),
1161 Result, DAG.getValueType(SrcVT));
1163 ValRes = DAG.getZeroExtendInReg(Result, dl, SrcVT.getScalarType());
1165 Tmp2 = Result.getValue(1);
1170 // Since loads produce two values, make sure to remember that we legalized
1172 if (Tmp2.getNode() != Node) {
1173 assert(Tmp1.getNode() != Node && "Load must be completely replaced");
1174 DAG.ReplaceAllUsesOfValueWith(SDValue(Node, 0), Tmp1);
1175 DAG.ReplaceAllUsesOfValueWith(SDValue(Node, 1), Tmp2);
1181 StoreSDNode *ST = cast<StoreSDNode>(Node);
1182 Tmp1 = ST->getChain();
1183 Tmp2 = ST->getBasePtr();
1184 unsigned Alignment = ST->getAlignment();
1185 bool isVolatile = ST->isVolatile();
1186 bool isNonTemporal = ST->isNonTemporal();
1188 if (!ST->isTruncatingStore()) {
1189 if (SDNode *OptStore = OptimizeFloatStore(ST).getNode()) {
1190 ReplaceNode(ST, OptStore);
1195 Tmp3 = ST->getValue();
1196 EVT VT = Tmp3.getValueType();
1197 switch (TLI.getOperationAction(ISD::STORE, VT)) {
1198 default: llvm_unreachable("This action is not supported yet!");
1199 case TargetLowering::Legal:
1200 // If this is an unaligned store and the target doesn't support it,
1202 if (!TLI.allowsUnalignedMemoryAccesses(ST->getMemoryVT())) {
1203 Type *Ty = ST->getMemoryVT().getTypeForEVT(*DAG.getContext());
1204 unsigned ABIAlignment= TLI.getTargetData()->getABITypeAlignment(Ty);
1205 if (ST->getAlignment() < ABIAlignment)
1206 ExpandUnalignedStore(cast<StoreSDNode>(Node),
1210 case TargetLowering::Custom:
1211 Tmp1 = TLI.LowerOperation(SDValue(Node, 0), DAG);
1213 ReplaceNode(SDValue(Node, 0), Tmp1);
1215 case TargetLowering::Promote: {
1216 assert(VT.isVector() && "Unknown legal promote case!");
1217 Tmp3 = DAG.getNode(ISD::BITCAST, dl,
1218 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
1220 DAG.getStore(Tmp1, dl, Tmp3, Tmp2,
1221 ST->getPointerInfo(), isVolatile,
1222 isNonTemporal, Alignment);
1223 ReplaceNode(SDValue(Node, 0), Result);
1230 Tmp3 = ST->getValue();
1232 EVT StVT = ST->getMemoryVT();
1233 unsigned StWidth = StVT.getSizeInBits();
1235 if (StWidth != StVT.getStoreSizeInBits()) {
1236 // Promote to a byte-sized store with upper bits zero if not
1237 // storing an integral number of bytes. For example, promote
1238 // TRUNCSTORE:i1 X -> TRUNCSTORE:i8 (and X, 1)
1239 EVT NVT = EVT::getIntegerVT(*DAG.getContext(),
1240 StVT.getStoreSizeInBits());
1241 Tmp3 = DAG.getZeroExtendInReg(Tmp3, dl, StVT);
1243 DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getPointerInfo(),
1244 NVT, isVolatile, isNonTemporal, Alignment);
1245 ReplaceNode(SDValue(Node, 0), Result);
1246 } else if (StWidth & (StWidth - 1)) {
1247 // If not storing a power-of-2 number of bits, expand as two stores.
1248 assert(!StVT.isVector() && "Unsupported truncstore!");
1249 unsigned RoundWidth = 1 << Log2_32(StWidth);
1250 assert(RoundWidth < StWidth);
1251 unsigned ExtraWidth = StWidth - RoundWidth;
1252 assert(ExtraWidth < RoundWidth);
1253 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
1254 "Store size not an integral number of bytes!");
1255 EVT RoundVT = EVT::getIntegerVT(*DAG.getContext(), RoundWidth);
1256 EVT ExtraVT = EVT::getIntegerVT(*DAG.getContext(), ExtraWidth);
1258 unsigned IncrementSize;
1260 if (TLI.isLittleEndian()) {
1261 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 X, TRUNCSTORE@+2:i8 (srl X, 16)
1262 // Store the bottom RoundWidth bits.
1263 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getPointerInfo(),
1265 isVolatile, isNonTemporal, Alignment);
1267 // Store the remaining ExtraWidth bits.
1268 IncrementSize = RoundWidth / 8;
1269 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1270 DAG.getIntPtrConstant(IncrementSize));
1271 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
1272 DAG.getConstant(RoundWidth,
1273 TLI.getShiftAmountTy(Tmp3.getValueType())));
1274 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2,
1275 ST->getPointerInfo().getWithOffset(IncrementSize),
1276 ExtraVT, isVolatile, isNonTemporal,
1277 MinAlign(Alignment, IncrementSize));
1279 // Big endian - avoid unaligned stores.
1280 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 (srl X, 8), TRUNCSTORE@+2:i8 X
1281 // Store the top RoundWidth bits.
1282 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
1283 DAG.getConstant(ExtraWidth,
1284 TLI.getShiftAmountTy(Tmp3.getValueType())));
1285 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2, ST->getPointerInfo(),
1286 RoundVT, isVolatile, isNonTemporal, Alignment);
1288 // Store the remaining ExtraWidth bits.
1289 IncrementSize = RoundWidth / 8;
1290 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1291 DAG.getIntPtrConstant(IncrementSize));
1292 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2,
1293 ST->getPointerInfo().getWithOffset(IncrementSize),
1294 ExtraVT, isVolatile, isNonTemporal,
1295 MinAlign(Alignment, IncrementSize));
1298 // The order of the stores doesn't matter.
1299 SDValue Result = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
1300 ReplaceNode(SDValue(Node, 0), Result);
1302 switch (TLI.getTruncStoreAction(ST->getValue().getValueType(), StVT)) {
1303 default: llvm_unreachable("This action is not supported yet!");
1304 case TargetLowering::Legal:
1305 // If this is an unaligned store and the target doesn't support it,
1307 if (!TLI.allowsUnalignedMemoryAccesses(ST->getMemoryVT())) {
1308 Type *Ty = ST->getMemoryVT().getTypeForEVT(*DAG.getContext());
1309 unsigned ABIAlignment= TLI.getTargetData()->getABITypeAlignment(Ty);
1310 if (ST->getAlignment() < ABIAlignment)
1311 ExpandUnalignedStore(cast<StoreSDNode>(Node), DAG, TLI, this);
1314 case TargetLowering::Custom:
1315 ReplaceNode(SDValue(Node, 0),
1316 TLI.LowerOperation(SDValue(Node, 0), DAG));
1318 case TargetLowering::Expand:
1319 assert(!StVT.isVector() &&
1320 "Vector Stores are handled in LegalizeVectorOps");
1322 // TRUNCSTORE:i16 i32 -> STORE i16
1323 assert(TLI.isTypeLegal(StVT) && "Do not know how to expand this store!");
1324 Tmp3 = DAG.getNode(ISD::TRUNCATE, dl, StVT, Tmp3);
1326 DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getPointerInfo(),
1327 isVolatile, isNonTemporal, Alignment);
1328 ReplaceNode(SDValue(Node, 0), Result);
1338 SDValue SelectionDAGLegalize::ExpandExtractFromVectorThroughStack(SDValue Op) {
1339 SDValue Vec = Op.getOperand(0);
1340 SDValue Idx = Op.getOperand(1);
1341 DebugLoc dl = Op.getDebugLoc();
1342 // Store the value to a temporary stack slot, then LOAD the returned part.
1343 SDValue StackPtr = DAG.CreateStackTemporary(Vec.getValueType());
1344 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr,
1345 MachinePointerInfo(), false, false, 0);
1347 // Add the offset to the index.
1349 Vec.getValueType().getVectorElementType().getSizeInBits()/8;
1350 Idx = DAG.getNode(ISD::MUL, dl, Idx.getValueType(), Idx,
1351 DAG.getConstant(EltSize, Idx.getValueType()));
1353 if (Idx.getValueType().bitsGT(TLI.getPointerTy()))
1354 Idx = DAG.getNode(ISD::TRUNCATE, dl, TLI.getPointerTy(), Idx);
1356 Idx = DAG.getNode(ISD::ZERO_EXTEND, dl, TLI.getPointerTy(), Idx);
1358 StackPtr = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx, StackPtr);
1360 if (Op.getValueType().isVector())
1361 return DAG.getLoad(Op.getValueType(), dl, Ch, StackPtr,MachinePointerInfo(),
1362 false, false, false, 0);
1363 return DAG.getExtLoad(ISD::EXTLOAD, dl, Op.getValueType(), Ch, StackPtr,
1364 MachinePointerInfo(),
1365 Vec.getValueType().getVectorElementType(),
1369 SDValue SelectionDAGLegalize::ExpandInsertToVectorThroughStack(SDValue Op) {
1370 assert(Op.getValueType().isVector() && "Non-vector insert subvector!");
1372 SDValue Vec = Op.getOperand(0);
1373 SDValue Part = Op.getOperand(1);
1374 SDValue Idx = Op.getOperand(2);
1375 DebugLoc dl = Op.getDebugLoc();
1377 // Store the value to a temporary stack slot, then LOAD the returned part.
1379 SDValue StackPtr = DAG.CreateStackTemporary(Vec.getValueType());
1380 int FI = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex();
1381 MachinePointerInfo PtrInfo = MachinePointerInfo::getFixedStack(FI);
1383 // First store the whole vector.
1384 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, PtrInfo,
1387 // Then store the inserted part.
1389 // Add the offset to the index.
1391 Vec.getValueType().getVectorElementType().getSizeInBits()/8;
1393 Idx = DAG.getNode(ISD::MUL, dl, Idx.getValueType(), Idx,
1394 DAG.getConstant(EltSize, Idx.getValueType()));
1396 if (Idx.getValueType().bitsGT(TLI.getPointerTy()))
1397 Idx = DAG.getNode(ISD::TRUNCATE, dl, TLI.getPointerTy(), Idx);
1399 Idx = DAG.getNode(ISD::ZERO_EXTEND, dl, TLI.getPointerTy(), Idx);
1401 SDValue SubStackPtr = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx,
1404 // Store the subvector.
1405 Ch = DAG.getStore(DAG.getEntryNode(), dl, Part, SubStackPtr,
1406 MachinePointerInfo(), false, false, 0);
1408 // Finally, load the updated vector.
1409 return DAG.getLoad(Op.getValueType(), dl, Ch, StackPtr, PtrInfo,
1410 false, false, false, 0);
1413 SDValue SelectionDAGLegalize::ExpandVectorBuildThroughStack(SDNode* Node) {
1414 // We can't handle this case efficiently. Allocate a sufficiently
1415 // aligned object on the stack, store each element into it, then load
1416 // the result as a vector.
1417 // Create the stack frame object.
1418 EVT VT = Node->getValueType(0);
1419 EVT EltVT = VT.getVectorElementType();
1420 DebugLoc dl = Node->getDebugLoc();
1421 SDValue FIPtr = DAG.CreateStackTemporary(VT);
1422 int FI = cast<FrameIndexSDNode>(FIPtr.getNode())->getIndex();
1423 MachinePointerInfo PtrInfo = MachinePointerInfo::getFixedStack(FI);
1425 // Emit a store of each element to the stack slot.
1426 SmallVector<SDValue, 8> Stores;
1427 unsigned TypeByteSize = EltVT.getSizeInBits() / 8;
1428 // Store (in the right endianness) the elements to memory.
1429 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1430 // Ignore undef elements.
1431 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
1433 unsigned Offset = TypeByteSize*i;
1435 SDValue Idx = DAG.getConstant(Offset, FIPtr.getValueType());
1436 Idx = DAG.getNode(ISD::ADD, dl, FIPtr.getValueType(), FIPtr, Idx);
1438 // If the destination vector element type is narrower than the source
1439 // element type, only store the bits necessary.
1440 if (EltVT.bitsLT(Node->getOperand(i).getValueType().getScalarType())) {
1441 Stores.push_back(DAG.getTruncStore(DAG.getEntryNode(), dl,
1442 Node->getOperand(i), Idx,
1443 PtrInfo.getWithOffset(Offset),
1444 EltVT, false, false, 0));
1446 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl,
1447 Node->getOperand(i), Idx,
1448 PtrInfo.getWithOffset(Offset),
1453 if (!Stores.empty()) // Not all undef elements?
1454 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
1455 &Stores[0], Stores.size());
1457 StoreChain = DAG.getEntryNode();
1459 // Result is a load from the stack slot.
1460 return DAG.getLoad(VT, dl, StoreChain, FIPtr, PtrInfo,
1461 false, false, false, 0);
1464 SDValue SelectionDAGLegalize::ExpandFCOPYSIGN(SDNode* Node) {
1465 DebugLoc dl = Node->getDebugLoc();
1466 SDValue Tmp1 = Node->getOperand(0);
1467 SDValue Tmp2 = Node->getOperand(1);
1469 // Get the sign bit of the RHS. First obtain a value that has the same
1470 // sign as the sign bit, i.e. negative if and only if the sign bit is 1.
1472 EVT FloatVT = Tmp2.getValueType();
1473 EVT IVT = EVT::getIntegerVT(*DAG.getContext(), FloatVT.getSizeInBits());
1474 if (TLI.isTypeLegal(IVT)) {
1475 // Convert to an integer with the same sign bit.
1476 SignBit = DAG.getNode(ISD::BITCAST, dl, IVT, Tmp2);
1478 // Store the float to memory, then load the sign part out as an integer.
1479 MVT LoadTy = TLI.getPointerTy();
1480 // First create a temporary that is aligned for both the load and store.
1481 SDValue StackPtr = DAG.CreateStackTemporary(FloatVT, LoadTy);
1482 // Then store the float to it.
1484 DAG.getStore(DAG.getEntryNode(), dl, Tmp2, StackPtr, MachinePointerInfo(),
1486 if (TLI.isBigEndian()) {
1487 assert(FloatVT.isByteSized() && "Unsupported floating point type!");
1488 // Load out a legal integer with the same sign bit as the float.
1489 SignBit = DAG.getLoad(LoadTy, dl, Ch, StackPtr, MachinePointerInfo(),
1490 false, false, false, 0);
1491 } else { // Little endian
1492 SDValue LoadPtr = StackPtr;
1493 // The float may be wider than the integer we are going to load. Advance
1494 // the pointer so that the loaded integer will contain the sign bit.
1495 unsigned Strides = (FloatVT.getSizeInBits()-1)/LoadTy.getSizeInBits();
1496 unsigned ByteOffset = (Strides * LoadTy.getSizeInBits()) / 8;
1497 LoadPtr = DAG.getNode(ISD::ADD, dl, LoadPtr.getValueType(),
1498 LoadPtr, DAG.getIntPtrConstant(ByteOffset));
1499 // Load a legal integer containing the sign bit.
1500 SignBit = DAG.getLoad(LoadTy, dl, Ch, LoadPtr, MachinePointerInfo(),
1501 false, false, false, 0);
1502 // Move the sign bit to the top bit of the loaded integer.
1503 unsigned BitShift = LoadTy.getSizeInBits() -
1504 (FloatVT.getSizeInBits() - 8 * ByteOffset);
1505 assert(BitShift < LoadTy.getSizeInBits() && "Pointer advanced wrong?");
1507 SignBit = DAG.getNode(ISD::SHL, dl, LoadTy, SignBit,
1508 DAG.getConstant(BitShift,
1509 TLI.getShiftAmountTy(SignBit.getValueType())));
1512 // Now get the sign bit proper, by seeing whether the value is negative.
1513 SignBit = DAG.getSetCC(dl, TLI.getSetCCResultType(SignBit.getValueType()),
1514 SignBit, DAG.getConstant(0, SignBit.getValueType()),
1516 // Get the absolute value of the result.
1517 SDValue AbsVal = DAG.getNode(ISD::FABS, dl, Tmp1.getValueType(), Tmp1);
1518 // Select between the nabs and abs value based on the sign bit of
1520 return DAG.getNode(ISD::SELECT, dl, AbsVal.getValueType(), SignBit,
1521 DAG.getNode(ISD::FNEG, dl, AbsVal.getValueType(), AbsVal),
1525 void SelectionDAGLegalize::ExpandDYNAMIC_STACKALLOC(SDNode* Node,
1526 SmallVectorImpl<SDValue> &Results) {
1527 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1528 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1529 " not tell us which reg is the stack pointer!");
1530 DebugLoc dl = Node->getDebugLoc();
1531 EVT VT = Node->getValueType(0);
1532 SDValue Tmp1 = SDValue(Node, 0);
1533 SDValue Tmp2 = SDValue(Node, 1);
1534 SDValue Tmp3 = Node->getOperand(2);
1535 SDValue Chain = Tmp1.getOperand(0);
1537 // Chain the dynamic stack allocation so that it doesn't modify the stack
1538 // pointer when other instructions are using the stack.
1539 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true));
1541 SDValue Size = Tmp2.getOperand(1);
1542 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
1543 Chain = SP.getValue(1);
1544 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
1545 unsigned StackAlign = TM.getFrameLowering()->getStackAlignment();
1546 if (Align > StackAlign)
1547 SP = DAG.getNode(ISD::AND, dl, VT, SP,
1548 DAG.getConstant(-(uint64_t)Align, VT));
1549 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
1550 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
1552 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
1553 DAG.getIntPtrConstant(0, true), SDValue());
1555 Results.push_back(Tmp1);
1556 Results.push_back(Tmp2);
1559 /// LegalizeSetCCCondCode - Legalize a SETCC with given LHS and RHS and
1560 /// condition code CC on the current target. This routine expands SETCC with
1561 /// illegal condition code into AND / OR of multiple SETCC values.
1562 void SelectionDAGLegalize::LegalizeSetCCCondCode(EVT VT,
1563 SDValue &LHS, SDValue &RHS,
1566 EVT OpVT = LHS.getValueType();
1567 ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get();
1568 switch (TLI.getCondCodeAction(CCCode, OpVT)) {
1569 default: llvm_unreachable("Unknown condition code action!");
1570 case TargetLowering::Legal:
1573 case TargetLowering::Expand: {
1574 ISD::CondCode CC1 = ISD::SETCC_INVALID, CC2 = ISD::SETCC_INVALID;
1577 default: llvm_unreachable("Don't know how to expand this condition!");
1578 case ISD::SETOEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETO; Opc = ISD::AND; break;
1579 case ISD::SETOGT: CC1 = ISD::SETGT; CC2 = ISD::SETO; Opc = ISD::AND; break;
1580 case ISD::SETOGE: CC1 = ISD::SETGE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1581 case ISD::SETOLT: CC1 = ISD::SETLT; CC2 = ISD::SETO; Opc = ISD::AND; break;
1582 case ISD::SETOLE: CC1 = ISD::SETLE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1583 case ISD::SETONE: CC1 = ISD::SETNE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1584 case ISD::SETUEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1585 case ISD::SETUGT: CC1 = ISD::SETGT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1586 case ISD::SETUGE: CC1 = ISD::SETGE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1587 case ISD::SETULT: CC1 = ISD::SETLT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1588 case ISD::SETULE: CC1 = ISD::SETLE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1589 case ISD::SETUNE: CC1 = ISD::SETNE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1590 // FIXME: Implement more expansions.
1593 SDValue SetCC1 = DAG.getSetCC(dl, VT, LHS, RHS, CC1);
1594 SDValue SetCC2 = DAG.getSetCC(dl, VT, LHS, RHS, CC2);
1595 LHS = DAG.getNode(Opc, dl, VT, SetCC1, SetCC2);
1603 /// EmitStackConvert - Emit a store/load combination to the stack. This stores
1604 /// SrcOp to a stack slot of type SlotVT, truncating it if needed. It then does
1605 /// a load from the stack slot to DestVT, extending it if needed.
1606 /// The resultant code need not be legal.
1607 SDValue SelectionDAGLegalize::EmitStackConvert(SDValue SrcOp,
1611 // Create the stack frame object.
1613 TLI.getTargetData()->getPrefTypeAlignment(SrcOp.getValueType().
1614 getTypeForEVT(*DAG.getContext()));
1615 SDValue FIPtr = DAG.CreateStackTemporary(SlotVT, SrcAlign);
1617 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(FIPtr);
1618 int SPFI = StackPtrFI->getIndex();
1619 MachinePointerInfo PtrInfo = MachinePointerInfo::getFixedStack(SPFI);
1621 unsigned SrcSize = SrcOp.getValueType().getSizeInBits();
1622 unsigned SlotSize = SlotVT.getSizeInBits();
1623 unsigned DestSize = DestVT.getSizeInBits();
1624 Type *DestType = DestVT.getTypeForEVT(*DAG.getContext());
1625 unsigned DestAlign = TLI.getTargetData()->getPrefTypeAlignment(DestType);
1627 // Emit a store to the stack slot. Use a truncstore if the input value is
1628 // later than DestVT.
1631 if (SrcSize > SlotSize)
1632 Store = DAG.getTruncStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
1633 PtrInfo, SlotVT, false, false, SrcAlign);
1635 assert(SrcSize == SlotSize && "Invalid store");
1636 Store = DAG.getStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
1637 PtrInfo, false, false, SrcAlign);
1640 // Result is a load from the stack slot.
1641 if (SlotSize == DestSize)
1642 return DAG.getLoad(DestVT, dl, Store, FIPtr, PtrInfo,
1643 false, false, false, DestAlign);
1645 assert(SlotSize < DestSize && "Unknown extension!");
1646 return DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT, Store, FIPtr,
1647 PtrInfo, SlotVT, false, false, DestAlign);
1650 SDValue SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
1651 DebugLoc dl = Node->getDebugLoc();
1652 // Create a vector sized/aligned stack slot, store the value to element #0,
1653 // then load the whole vector back out.
1654 SDValue StackPtr = DAG.CreateStackTemporary(Node->getValueType(0));
1656 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(StackPtr);
1657 int SPFI = StackPtrFI->getIndex();
1659 SDValue Ch = DAG.getTruncStore(DAG.getEntryNode(), dl, Node->getOperand(0),
1661 MachinePointerInfo::getFixedStack(SPFI),
1662 Node->getValueType(0).getVectorElementType(),
1664 return DAG.getLoad(Node->getValueType(0), dl, Ch, StackPtr,
1665 MachinePointerInfo::getFixedStack(SPFI),
1666 false, false, false, 0);
1670 /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
1671 /// support the operation, but do support the resultant vector type.
1672 SDValue SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
1673 unsigned NumElems = Node->getNumOperands();
1674 SDValue Value1, Value2;
1675 DebugLoc dl = Node->getDebugLoc();
1676 EVT VT = Node->getValueType(0);
1677 EVT OpVT = Node->getOperand(0).getValueType();
1678 EVT EltVT = VT.getVectorElementType();
1680 // If the only non-undef value is the low element, turn this into a
1681 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
1682 bool isOnlyLowElement = true;
1683 bool MoreThanTwoValues = false;
1684 bool isConstant = true;
1685 for (unsigned i = 0; i < NumElems; ++i) {
1686 SDValue V = Node->getOperand(i);
1687 if (V.getOpcode() == ISD::UNDEF)
1690 isOnlyLowElement = false;
1691 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V))
1694 if (!Value1.getNode()) {
1696 } else if (!Value2.getNode()) {
1699 } else if (V != Value1 && V != Value2) {
1700 MoreThanTwoValues = true;
1704 if (!Value1.getNode())
1705 return DAG.getUNDEF(VT);
1707 if (isOnlyLowElement)
1708 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Node->getOperand(0));
1710 // If all elements are constants, create a load from the constant pool.
1712 SmallVector<Constant*, 16> CV;
1713 for (unsigned i = 0, e = NumElems; i != e; ++i) {
1714 if (ConstantFPSDNode *V =
1715 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
1716 CV.push_back(const_cast<ConstantFP *>(V->getConstantFPValue()));
1717 } else if (ConstantSDNode *V =
1718 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
1720 CV.push_back(const_cast<ConstantInt *>(V->getConstantIntValue()));
1722 // If OpVT and EltVT don't match, EltVT is not legal and the
1723 // element values have been promoted/truncated earlier. Undo this;
1724 // we don't want a v16i8 to become a v16i32 for example.
1725 const ConstantInt *CI = V->getConstantIntValue();
1726 CV.push_back(ConstantInt::get(EltVT.getTypeForEVT(*DAG.getContext()),
1727 CI->getZExtValue()));
1730 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
1731 Type *OpNTy = EltVT.getTypeForEVT(*DAG.getContext());
1732 CV.push_back(UndefValue::get(OpNTy));
1735 Constant *CP = ConstantVector::get(CV);
1736 SDValue CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
1737 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
1738 return DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
1739 MachinePointerInfo::getConstantPool(),
1740 false, false, false, Alignment);
1743 if (!MoreThanTwoValues) {
1744 SmallVector<int, 8> ShuffleVec(NumElems, -1);
1745 for (unsigned i = 0; i < NumElems; ++i) {
1746 SDValue V = Node->getOperand(i);
1747 if (V.getOpcode() == ISD::UNDEF)
1749 ShuffleVec[i] = V == Value1 ? 0 : NumElems;
1751 if (TLI.isShuffleMaskLegal(ShuffleVec, Node->getValueType(0))) {
1752 // Get the splatted value into the low element of a vector register.
1753 SDValue Vec1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Value1);
1755 if (Value2.getNode())
1756 Vec2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Value2);
1758 Vec2 = DAG.getUNDEF(VT);
1760 // Return shuffle(LowValVec, undef, <0,0,0,0>)
1761 return DAG.getVectorShuffle(VT, dl, Vec1, Vec2, ShuffleVec.data());
1765 // Otherwise, we can't handle this case efficiently.
1766 return ExpandVectorBuildThroughStack(Node);
1769 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
1770 // does not fit into a register, return the lo part and set the hi part to the
1771 // by-reg argument. If it does fit into a single register, return the result
1772 // and leave the Hi part unset.
1773 SDValue SelectionDAGLegalize::ExpandLibCall(RTLIB::Libcall LC, SDNode *Node,
1775 TargetLowering::ArgListTy Args;
1776 TargetLowering::ArgListEntry Entry;
1777 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1778 EVT ArgVT = Node->getOperand(i).getValueType();
1779 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
1780 Entry.Node = Node->getOperand(i); Entry.Ty = ArgTy;
1781 Entry.isSExt = isSigned;
1782 Entry.isZExt = !isSigned;
1783 Args.push_back(Entry);
1785 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC),
1786 TLI.getPointerTy());
1788 Type *RetTy = Node->getValueType(0).getTypeForEVT(*DAG.getContext());
1790 // By default, the input chain to this libcall is the entry node of the
1791 // function. If the libcall is going to be emitted as a tail call then
1792 // TLI.isUsedByReturnOnly will change it to the right chain if the return
1793 // node which is being folded has a non-entry input chain.
1794 SDValue InChain = DAG.getEntryNode();
1796 // isTailCall may be true since the callee does not reference caller stack
1797 // frame. Check if it's in the right position.
1798 SDValue TCChain = InChain;
1799 bool isTailCall = isInTailCallPosition(DAG, Node, TCChain, TLI);
1804 CallLoweringInfo CLI(InChain, RetTy, isSigned, !isSigned, false, false,
1805 0, TLI.getLibcallCallingConv(LC), isTailCall,
1806 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
1807 Callee, Args, DAG, Node->getDebugLoc());
1808 std::pair<SDValue, SDValue> CallInfo = TLI.LowerCallTo(CLI);
1811 if (!CallInfo.second.getNode())
1812 // It's a tailcall, return the chain (which is the DAG root).
1813 return DAG.getRoot();
1815 return CallInfo.first;
1818 /// ExpandLibCall - Generate a libcall taking the given operands as arguments
1819 /// and returning a result of type RetVT.
1820 SDValue SelectionDAGLegalize::ExpandLibCall(RTLIB::Libcall LC, EVT RetVT,
1821 const SDValue *Ops, unsigned NumOps,
1822 bool isSigned, DebugLoc dl) {
1823 TargetLowering::ArgListTy Args;
1824 Args.reserve(NumOps);
1826 TargetLowering::ArgListEntry Entry;
1827 for (unsigned i = 0; i != NumOps; ++i) {
1828 Entry.Node = Ops[i];
1829 Entry.Ty = Entry.Node.getValueType().getTypeForEVT(*DAG.getContext());
1830 Entry.isSExt = isSigned;
1831 Entry.isZExt = !isSigned;
1832 Args.push_back(Entry);
1834 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC),
1835 TLI.getPointerTy());
1837 Type *RetTy = RetVT.getTypeForEVT(*DAG.getContext());
1839 CallLoweringInfo CLI(DAG.getEntryNode(), RetTy, isSigned, !isSigned, false,
1840 false, 0, TLI.getLibcallCallingConv(LC),
1841 /*isTailCall=*/false,
1842 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
1843 Callee, Args, DAG, dl);
1844 std::pair<SDValue,SDValue> CallInfo = TLI.LowerCallTo(CLI);
1846 return CallInfo.first;
1849 // ExpandChainLibCall - Expand a node into a call to a libcall. Similar to
1850 // ExpandLibCall except that the first operand is the in-chain.
1851 std::pair<SDValue, SDValue>
1852 SelectionDAGLegalize::ExpandChainLibCall(RTLIB::Libcall LC,
1855 SDValue InChain = Node->getOperand(0);
1857 TargetLowering::ArgListTy Args;
1858 TargetLowering::ArgListEntry Entry;
1859 for (unsigned i = 1, e = Node->getNumOperands(); i != e; ++i) {
1860 EVT ArgVT = Node->getOperand(i).getValueType();
1861 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
1862 Entry.Node = Node->getOperand(i);
1864 Entry.isSExt = isSigned;
1865 Entry.isZExt = !isSigned;
1866 Args.push_back(Entry);
1868 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC),
1869 TLI.getPointerTy());
1871 Type *RetTy = Node->getValueType(0).getTypeForEVT(*DAG.getContext());
1873 CallLoweringInfo CLI(InChain, RetTy, isSigned, !isSigned, false, false,
1874 0, TLI.getLibcallCallingConv(LC), /*isTailCall=*/false,
1875 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
1876 Callee, Args, DAG, Node->getDebugLoc());
1877 std::pair<SDValue, SDValue> CallInfo = TLI.LowerCallTo(CLI);
1882 SDValue SelectionDAGLegalize::ExpandFPLibCall(SDNode* Node,
1883 RTLIB::Libcall Call_F32,
1884 RTLIB::Libcall Call_F64,
1885 RTLIB::Libcall Call_F80,
1886 RTLIB::Libcall Call_PPCF128) {
1888 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1889 default: llvm_unreachable("Unexpected request for libcall!");
1890 case MVT::f32: LC = Call_F32; break;
1891 case MVT::f64: LC = Call_F64; break;
1892 case MVT::f80: LC = Call_F80; break;
1893 case MVT::ppcf128: LC = Call_PPCF128; break;
1895 return ExpandLibCall(LC, Node, false);
1898 SDValue SelectionDAGLegalize::ExpandIntLibCall(SDNode* Node, bool isSigned,
1899 RTLIB::Libcall Call_I8,
1900 RTLIB::Libcall Call_I16,
1901 RTLIB::Libcall Call_I32,
1902 RTLIB::Libcall Call_I64,
1903 RTLIB::Libcall Call_I128) {
1905 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1906 default: llvm_unreachable("Unexpected request for libcall!");
1907 case MVT::i8: LC = Call_I8; break;
1908 case MVT::i16: LC = Call_I16; break;
1909 case MVT::i32: LC = Call_I32; break;
1910 case MVT::i64: LC = Call_I64; break;
1911 case MVT::i128: LC = Call_I128; break;
1913 return ExpandLibCall(LC, Node, isSigned);
1916 /// isDivRemLibcallAvailable - Return true if divmod libcall is available.
1917 static bool isDivRemLibcallAvailable(SDNode *Node, bool isSigned,
1918 const TargetLowering &TLI) {
1920 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1921 default: llvm_unreachable("Unexpected request for libcall!");
1922 case MVT::i8: LC= isSigned ? RTLIB::SDIVREM_I8 : RTLIB::UDIVREM_I8; break;
1923 case MVT::i16: LC= isSigned ? RTLIB::SDIVREM_I16 : RTLIB::UDIVREM_I16; break;
1924 case MVT::i32: LC= isSigned ? RTLIB::SDIVREM_I32 : RTLIB::UDIVREM_I32; break;
1925 case MVT::i64: LC= isSigned ? RTLIB::SDIVREM_I64 : RTLIB::UDIVREM_I64; break;
1926 case MVT::i128: LC= isSigned ? RTLIB::SDIVREM_I128:RTLIB::UDIVREM_I128; break;
1929 return TLI.getLibcallName(LC) != 0;
1932 /// UseDivRem - Only issue divrem libcall if both quotient and remainder are
1934 static bool UseDivRem(SDNode *Node, bool isSigned, bool isDIV) {
1935 unsigned OtherOpcode = 0;
1937 OtherOpcode = isDIV ? ISD::SREM : ISD::SDIV;
1939 OtherOpcode = isDIV ? ISD::UREM : ISD::UDIV;
1941 SDValue Op0 = Node->getOperand(0);
1942 SDValue Op1 = Node->getOperand(1);
1943 for (SDNode::use_iterator UI = Op0.getNode()->use_begin(),
1944 UE = Op0.getNode()->use_end(); UI != UE; ++UI) {
1948 if (User->getOpcode() == OtherOpcode &&
1949 User->getOperand(0) == Op0 &&
1950 User->getOperand(1) == Op1)
1956 /// ExpandDivRemLibCall - Issue libcalls to __{u}divmod to compute div / rem
1959 SelectionDAGLegalize::ExpandDivRemLibCall(SDNode *Node,
1960 SmallVectorImpl<SDValue> &Results) {
1961 unsigned Opcode = Node->getOpcode();
1962 bool isSigned = Opcode == ISD::SDIVREM;
1965 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1966 default: llvm_unreachable("Unexpected request for libcall!");
1967 case MVT::i8: LC= isSigned ? RTLIB::SDIVREM_I8 : RTLIB::UDIVREM_I8; break;
1968 case MVT::i16: LC= isSigned ? RTLIB::SDIVREM_I16 : RTLIB::UDIVREM_I16; break;
1969 case MVT::i32: LC= isSigned ? RTLIB::SDIVREM_I32 : RTLIB::UDIVREM_I32; break;
1970 case MVT::i64: LC= isSigned ? RTLIB::SDIVREM_I64 : RTLIB::UDIVREM_I64; break;
1971 case MVT::i128: LC= isSigned ? RTLIB::SDIVREM_I128:RTLIB::UDIVREM_I128; break;
1974 // The input chain to this libcall is the entry node of the function.
1975 // Legalizing the call will automatically add the previous call to the
1977 SDValue InChain = DAG.getEntryNode();
1979 EVT RetVT = Node->getValueType(0);
1980 Type *RetTy = RetVT.getTypeForEVT(*DAG.getContext());
1982 TargetLowering::ArgListTy Args;
1983 TargetLowering::ArgListEntry Entry;
1984 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1985 EVT ArgVT = Node->getOperand(i).getValueType();
1986 Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
1987 Entry.Node = Node->getOperand(i); Entry.Ty = ArgTy;
1988 Entry.isSExt = isSigned;
1989 Entry.isZExt = !isSigned;
1990 Args.push_back(Entry);
1993 // Also pass the return address of the remainder.
1994 SDValue FIPtr = DAG.CreateStackTemporary(RetVT);
1996 Entry.Ty = RetTy->getPointerTo();
1997 Entry.isSExt = isSigned;
1998 Entry.isZExt = !isSigned;
1999 Args.push_back(Entry);
2001 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC),
2002 TLI.getPointerTy());
2004 DebugLoc dl = Node->getDebugLoc();
2006 CallLoweringInfo CLI(InChain, RetTy, isSigned, !isSigned, false, false,
2007 0, TLI.getLibcallCallingConv(LC), /*isTailCall=*/false,
2008 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
2009 Callee, Args, DAG, dl);
2010 std::pair<SDValue, SDValue> CallInfo = TLI.LowerCallTo(CLI);
2012 // Remainder is loaded back from the stack frame.
2013 SDValue Rem = DAG.getLoad(RetVT, dl, CallInfo.second, FIPtr,
2014 MachinePointerInfo(), false, false, false, 0);
2015 Results.push_back(CallInfo.first);
2016 Results.push_back(Rem);
2019 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
2020 /// INT_TO_FP operation of the specified operand when the target requests that
2021 /// we expand it. At this point, we know that the result and operand types are
2022 /// legal for the target.
2023 SDValue SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
2027 if (Op0.getValueType() == MVT::i32) {
2028 // simple 32-bit [signed|unsigned] integer to float/double expansion
2030 // Get the stack frame index of a 8 byte buffer.
2031 SDValue StackSlot = DAG.CreateStackTemporary(MVT::f64);
2033 // word offset constant for Hi/Lo address computation
2034 SDValue WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
2035 // set up Hi and Lo (into buffer) address based on endian
2036 SDValue Hi = StackSlot;
2037 SDValue Lo = DAG.getNode(ISD::ADD, dl,
2038 TLI.getPointerTy(), StackSlot, WordOff);
2039 if (TLI.isLittleEndian())
2042 // if signed map to unsigned space
2045 // constant used to invert sign bit (signed to unsigned mapping)
2046 SDValue SignBit = DAG.getConstant(0x80000000u, MVT::i32);
2047 Op0Mapped = DAG.getNode(ISD::XOR, dl, MVT::i32, Op0, SignBit);
2051 // store the lo of the constructed double - based on integer input
2052 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl,
2053 Op0Mapped, Lo, MachinePointerInfo(),
2055 // initial hi portion of constructed double
2056 SDValue InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
2057 // store the hi of the constructed double - biased exponent
2058 SDValue Store2 = DAG.getStore(Store1, dl, InitialHi, Hi,
2059 MachinePointerInfo(),
2061 // load the constructed double
2062 SDValue Load = DAG.getLoad(MVT::f64, dl, Store2, StackSlot,
2063 MachinePointerInfo(), false, false, false, 0);
2064 // FP constant to bias correct the final result
2065 SDValue Bias = DAG.getConstantFP(isSigned ?
2066 BitsToDouble(0x4330000080000000ULL) :
2067 BitsToDouble(0x4330000000000000ULL),
2069 // subtract the bias
2070 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Load, Bias);
2073 // handle final rounding
2074 if (DestVT == MVT::f64) {
2077 } else if (DestVT.bitsLT(MVT::f64)) {
2078 Result = DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
2079 DAG.getIntPtrConstant(0));
2080 } else if (DestVT.bitsGT(MVT::f64)) {
2081 Result = DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
2085 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
2086 // Code below here assumes !isSigned without checking again.
2088 // Implementation of unsigned i64 to f64 following the algorithm in
2089 // __floatundidf in compiler_rt. This implementation has the advantage
2090 // of performing rounding correctly, both in the default rounding mode
2091 // and in all alternate rounding modes.
2092 // TODO: Generalize this for use with other types.
2093 if (Op0.getValueType() == MVT::i64 && DestVT == MVT::f64) {
2095 DAG.getConstant(UINT64_C(0x4330000000000000), MVT::i64);
2096 SDValue TwoP84PlusTwoP52 =
2097 DAG.getConstantFP(BitsToDouble(UINT64_C(0x4530000000100000)), MVT::f64);
2099 DAG.getConstant(UINT64_C(0x4530000000000000), MVT::i64);
2101 SDValue Lo = DAG.getZeroExtendInReg(Op0, dl, MVT::i32);
2102 SDValue Hi = DAG.getNode(ISD::SRL, dl, MVT::i64, Op0,
2103 DAG.getConstant(32, MVT::i64));
2104 SDValue LoOr = DAG.getNode(ISD::OR, dl, MVT::i64, Lo, TwoP52);
2105 SDValue HiOr = DAG.getNode(ISD::OR, dl, MVT::i64, Hi, TwoP84);
2106 SDValue LoFlt = DAG.getNode(ISD::BITCAST, dl, MVT::f64, LoOr);
2107 SDValue HiFlt = DAG.getNode(ISD::BITCAST, dl, MVT::f64, HiOr);
2108 SDValue HiSub = DAG.getNode(ISD::FSUB, dl, MVT::f64, HiFlt,
2110 return DAG.getNode(ISD::FADD, dl, MVT::f64, LoFlt, HiSub);
2113 // Implementation of unsigned i64 to f32.
2114 // TODO: Generalize this for use with other types.
2115 if (Op0.getValueType() == MVT::i64 && DestVT == MVT::f32) {
2116 // For unsigned conversions, convert them to signed conversions using the
2117 // algorithm from the x86_64 __floatundidf in compiler_rt.
2119 SDValue Fast = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, Op0);
2121 SDValue ShiftConst =
2122 DAG.getConstant(1, TLI.getShiftAmountTy(Op0.getValueType()));
2123 SDValue Shr = DAG.getNode(ISD::SRL, dl, MVT::i64, Op0, ShiftConst);
2124 SDValue AndConst = DAG.getConstant(1, MVT::i64);
2125 SDValue And = DAG.getNode(ISD::AND, dl, MVT::i64, Op0, AndConst);
2126 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::i64, And, Shr);
2128 SDValue SignCvt = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, Or);
2129 SDValue Slow = DAG.getNode(ISD::FADD, dl, MVT::f32, SignCvt, SignCvt);
2131 // TODO: This really should be implemented using a branch rather than a
2132 // select. We happen to get lucky and machinesink does the right
2133 // thing most of the time. This would be a good candidate for a
2134 //pseudo-op, or, even better, for whole-function isel.
2135 SDValue SignBitTest = DAG.getSetCC(dl, TLI.getSetCCResultType(MVT::i64),
2136 Op0, DAG.getConstant(0, MVT::i64), ISD::SETLT);
2137 return DAG.getNode(ISD::SELECT, dl, MVT::f32, SignBitTest, Slow, Fast);
2140 // Otherwise, implement the fully general conversion.
2142 SDValue And = DAG.getNode(ISD::AND, dl, MVT::i64, Op0,
2143 DAG.getConstant(UINT64_C(0xfffffffffffff800), MVT::i64));
2144 SDValue Or = DAG.getNode(ISD::OR, dl, MVT::i64, And,
2145 DAG.getConstant(UINT64_C(0x800), MVT::i64));
2146 SDValue And2 = DAG.getNode(ISD::AND, dl, MVT::i64, Op0,
2147 DAG.getConstant(UINT64_C(0x7ff), MVT::i64));
2148 SDValue Ne = DAG.getSetCC(dl, TLI.getSetCCResultType(MVT::i64),
2149 And2, DAG.getConstant(UINT64_C(0), MVT::i64), ISD::SETNE);
2150 SDValue Sel = DAG.getNode(ISD::SELECT, dl, MVT::i64, Ne, Or, Op0);
2151 SDValue Ge = DAG.getSetCC(dl, TLI.getSetCCResultType(MVT::i64),
2152 Op0, DAG.getConstant(UINT64_C(0x0020000000000000), MVT::i64),
2154 SDValue Sel2 = DAG.getNode(ISD::SELECT, dl, MVT::i64, Ge, Sel, Op0);
2155 EVT SHVT = TLI.getShiftAmountTy(Sel2.getValueType());
2157 SDValue Sh = DAG.getNode(ISD::SRL, dl, MVT::i64, Sel2,
2158 DAG.getConstant(32, SHVT));
2159 SDValue Trunc = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Sh);
2160 SDValue Fcvt = DAG.getNode(ISD::UINT_TO_FP, dl, MVT::f64, Trunc);
2162 DAG.getConstantFP(BitsToDouble(UINT64_C(0x41f0000000000000)), MVT::f64);
2163 SDValue Fmul = DAG.getNode(ISD::FMUL, dl, MVT::f64, TwoP32, Fcvt);
2164 SDValue Lo = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Sel2);
2165 SDValue Fcvt2 = DAG.getNode(ISD::UINT_TO_FP, dl, MVT::f64, Lo);
2166 SDValue Fadd = DAG.getNode(ISD::FADD, dl, MVT::f64, Fmul, Fcvt2);
2167 return DAG.getNode(ISD::FP_ROUND, dl, MVT::f32, Fadd,
2168 DAG.getIntPtrConstant(0));
2171 SDValue Tmp1 = DAG.getNode(ISD::SINT_TO_FP, dl, DestVT, Op0);
2173 SDValue SignSet = DAG.getSetCC(dl, TLI.getSetCCResultType(Op0.getValueType()),
2174 Op0, DAG.getConstant(0, Op0.getValueType()),
2176 SDValue Zero = DAG.getIntPtrConstant(0), Four = DAG.getIntPtrConstant(4);
2177 SDValue CstOffset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(),
2178 SignSet, Four, Zero);
2180 // If the sign bit of the integer is set, the large number will be treated
2181 // as a negative number. To counteract this, the dynamic code adds an
2182 // offset depending on the data type.
2184 switch (Op0.getValueType().getSimpleVT().SimpleTy) {
2185 default: llvm_unreachable("Unsupported integer type!");
2186 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
2187 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
2188 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
2189 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
2191 if (TLI.isLittleEndian()) FF <<= 32;
2192 Constant *FudgeFactor = ConstantInt::get(
2193 Type::getInt64Ty(*DAG.getContext()), FF);
2195 SDValue CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
2196 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
2197 CPIdx = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), CPIdx, CstOffset);
2198 Alignment = std::min(Alignment, 4u);
2200 if (DestVT == MVT::f32)
2201 FudgeInReg = DAG.getLoad(MVT::f32, dl, DAG.getEntryNode(), CPIdx,
2202 MachinePointerInfo::getConstantPool(),
2203 false, false, false, Alignment);
2205 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT,
2206 DAG.getEntryNode(), CPIdx,
2207 MachinePointerInfo::getConstantPool(),
2208 MVT::f32, false, false, Alignment);
2209 HandleSDNode Handle(Load);
2210 LegalizeOp(Load.getNode());
2211 FudgeInReg = Handle.getValue();
2214 return DAG.getNode(ISD::FADD, dl, DestVT, Tmp1, FudgeInReg);
2217 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
2218 /// *INT_TO_FP operation of the specified operand when the target requests that
2219 /// we promote it. At this point, we know that the result and operand types are
2220 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
2221 /// operation that takes a larger input.
2222 SDValue SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDValue LegalOp,
2226 // First step, figure out the appropriate *INT_TO_FP operation to use.
2227 EVT NewInTy = LegalOp.getValueType();
2229 unsigned OpToUse = 0;
2231 // Scan for the appropriate larger type to use.
2233 NewInTy = (MVT::SimpleValueType)(NewInTy.getSimpleVT().SimpleTy+1);
2234 assert(NewInTy.isInteger() && "Ran out of possibilities!");
2236 // If the target supports SINT_TO_FP of this type, use it.
2237 if (TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, NewInTy)) {
2238 OpToUse = ISD::SINT_TO_FP;
2241 if (isSigned) continue;
2243 // If the target supports UINT_TO_FP of this type, use it.
2244 if (TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, NewInTy)) {
2245 OpToUse = ISD::UINT_TO_FP;
2249 // Otherwise, try a larger type.
2252 // Okay, we found the operation and type to use. Zero extend our input to the
2253 // desired type then run the operation on it.
2254 return DAG.getNode(OpToUse, dl, DestVT,
2255 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
2256 dl, NewInTy, LegalOp));
2259 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
2260 /// FP_TO_*INT operation of the specified operand when the target requests that
2261 /// we promote it. At this point, we know that the result and operand types are
2262 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
2263 /// operation that returns a larger result.
2264 SDValue SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDValue LegalOp,
2268 // First step, figure out the appropriate FP_TO*INT operation to use.
2269 EVT NewOutTy = DestVT;
2271 unsigned OpToUse = 0;
2273 // Scan for the appropriate larger type to use.
2275 NewOutTy = (MVT::SimpleValueType)(NewOutTy.getSimpleVT().SimpleTy+1);
2276 assert(NewOutTy.isInteger() && "Ran out of possibilities!");
2278 if (TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NewOutTy)) {
2279 OpToUse = ISD::FP_TO_SINT;
2283 if (TLI.isOperationLegalOrCustom(ISD::FP_TO_UINT, NewOutTy)) {
2284 OpToUse = ISD::FP_TO_UINT;
2288 // Otherwise, try a larger type.
2292 // Okay, we found the operation and type to use.
2293 SDValue Operation = DAG.getNode(OpToUse, dl, NewOutTy, LegalOp);
2295 // Truncate the result of the extended FP_TO_*INT operation to the desired
2297 return DAG.getNode(ISD::TRUNCATE, dl, DestVT, Operation);
2300 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
2302 SDValue SelectionDAGLegalize::ExpandBSWAP(SDValue Op, DebugLoc dl) {
2303 EVT VT = Op.getValueType();
2304 EVT SHVT = TLI.getShiftAmountTy(VT);
2305 SDValue Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
2306 switch (VT.getSimpleVT().SimpleTy) {
2307 default: llvm_unreachable("Unhandled Expand type in BSWAP!");
2309 Tmp2 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2310 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2311 return DAG.getNode(ISD::OR, dl, VT, Tmp1, Tmp2);
2313 Tmp4 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
2314 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2315 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2316 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
2317 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
2318 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(0xFF00, VT));
2319 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
2320 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
2321 return DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
2323 Tmp8 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(56, SHVT));
2324 Tmp7 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(40, SHVT));
2325 Tmp6 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
2326 Tmp5 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2327 Tmp4 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2328 Tmp3 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
2329 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(40, SHVT));
2330 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(56, SHVT));
2331 Tmp7 = DAG.getNode(ISD::AND, dl, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
2332 Tmp6 = DAG.getNode(ISD::AND, dl, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
2333 Tmp5 = DAG.getNode(ISD::AND, dl, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
2334 Tmp4 = DAG.getNode(ISD::AND, dl, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
2335 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
2336 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
2337 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp7);
2338 Tmp6 = DAG.getNode(ISD::OR, dl, VT, Tmp6, Tmp5);
2339 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
2340 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
2341 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp6);
2342 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
2343 return DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp4);
2347 /// SplatByte - Distribute ByteVal over NumBits bits.
2348 // FIXME: Move this helper to a common place.
2349 static APInt SplatByte(unsigned NumBits, uint8_t ByteVal) {
2350 APInt Val = APInt(NumBits, ByteVal);
2352 for (unsigned i = NumBits; i > 8; i >>= 1) {
2353 Val = (Val << Shift) | Val;
2359 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
2361 SDValue SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDValue Op,
2364 default: llvm_unreachable("Cannot expand this yet!");
2366 EVT VT = Op.getValueType();
2367 EVT ShVT = TLI.getShiftAmountTy(VT);
2368 unsigned Len = VT.getSizeInBits();
2370 assert(VT.isInteger() && Len <= 128 && Len % 8 == 0 &&
2371 "CTPOP not implemented for this type.");
2373 // This is the "best" algorithm from
2374 // http://graphics.stanford.edu/~seander/bithacks.html#CountBitsSetParallel
2376 SDValue Mask55 = DAG.getConstant(SplatByte(Len, 0x55), VT);
2377 SDValue Mask33 = DAG.getConstant(SplatByte(Len, 0x33), VT);
2378 SDValue Mask0F = DAG.getConstant(SplatByte(Len, 0x0F), VT);
2379 SDValue Mask01 = DAG.getConstant(SplatByte(Len, 0x01), VT);
2381 // v = v - ((v >> 1) & 0x55555555...)
2382 Op = DAG.getNode(ISD::SUB, dl, VT, Op,
2383 DAG.getNode(ISD::AND, dl, VT,
2384 DAG.getNode(ISD::SRL, dl, VT, Op,
2385 DAG.getConstant(1, ShVT)),
2387 // v = (v & 0x33333333...) + ((v >> 2) & 0x33333333...)
2388 Op = DAG.getNode(ISD::ADD, dl, VT,
2389 DAG.getNode(ISD::AND, dl, VT, Op, Mask33),
2390 DAG.getNode(ISD::AND, dl, VT,
2391 DAG.getNode(ISD::SRL, dl, VT, Op,
2392 DAG.getConstant(2, ShVT)),
2394 // v = (v + (v >> 4)) & 0x0F0F0F0F...
2395 Op = DAG.getNode(ISD::AND, dl, VT,
2396 DAG.getNode(ISD::ADD, dl, VT, Op,
2397 DAG.getNode(ISD::SRL, dl, VT, Op,
2398 DAG.getConstant(4, ShVT))),
2400 // v = (v * 0x01010101...) >> (Len - 8)
2401 Op = DAG.getNode(ISD::SRL, dl, VT,
2402 DAG.getNode(ISD::MUL, dl, VT, Op, Mask01),
2403 DAG.getConstant(Len - 8, ShVT));
2407 case ISD::CTLZ_ZERO_UNDEF:
2408 // This trivially expands to CTLZ.
2409 return DAG.getNode(ISD::CTLZ, dl, Op.getValueType(), Op);
2411 // for now, we do this:
2412 // x = x | (x >> 1);
2413 // x = x | (x >> 2);
2415 // x = x | (x >>16);
2416 // x = x | (x >>32); // for 64-bit input
2417 // return popcount(~x);
2419 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
2420 EVT VT = Op.getValueType();
2421 EVT ShVT = TLI.getShiftAmountTy(VT);
2422 unsigned len = VT.getSizeInBits();
2423 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
2424 SDValue Tmp3 = DAG.getConstant(1ULL << i, ShVT);
2425 Op = DAG.getNode(ISD::OR, dl, VT, Op,
2426 DAG.getNode(ISD::SRL, dl, VT, Op, Tmp3));
2428 Op = DAG.getNOT(dl, Op, VT);
2429 return DAG.getNode(ISD::CTPOP, dl, VT, Op);
2431 case ISD::CTTZ_ZERO_UNDEF:
2432 // This trivially expands to CTTZ.
2433 return DAG.getNode(ISD::CTTZ, dl, Op.getValueType(), Op);
2435 // for now, we use: { return popcount(~x & (x - 1)); }
2436 // unless the target has ctlz but not ctpop, in which case we use:
2437 // { return 32 - nlz(~x & (x-1)); }
2438 // see also http://www.hackersdelight.org/HDcode/ntz.cc
2439 EVT VT = Op.getValueType();
2440 SDValue Tmp3 = DAG.getNode(ISD::AND, dl, VT,
2441 DAG.getNOT(dl, Op, VT),
2442 DAG.getNode(ISD::SUB, dl, VT, Op,
2443 DAG.getConstant(1, VT)));
2444 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
2445 if (!TLI.isOperationLegalOrCustom(ISD::CTPOP, VT) &&
2446 TLI.isOperationLegalOrCustom(ISD::CTLZ, VT))
2447 return DAG.getNode(ISD::SUB, dl, VT,
2448 DAG.getConstant(VT.getSizeInBits(), VT),
2449 DAG.getNode(ISD::CTLZ, dl, VT, Tmp3));
2450 return DAG.getNode(ISD::CTPOP, dl, VT, Tmp3);
2455 std::pair <SDValue, SDValue> SelectionDAGLegalize::ExpandAtomic(SDNode *Node) {
2456 unsigned Opc = Node->getOpcode();
2457 MVT VT = cast<AtomicSDNode>(Node)->getMemoryVT().getSimpleVT();
2462 llvm_unreachable("Unhandled atomic intrinsic Expand!");
2463 case ISD::ATOMIC_SWAP:
2464 switch (VT.SimpleTy) {
2465 default: llvm_unreachable("Unexpected value type for atomic!");
2466 case MVT::i8: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_1; break;
2467 case MVT::i16: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_2; break;
2468 case MVT::i32: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_4; break;
2469 case MVT::i64: LC = RTLIB::SYNC_LOCK_TEST_AND_SET_8; break;
2472 case ISD::ATOMIC_CMP_SWAP:
2473 switch (VT.SimpleTy) {
2474 default: llvm_unreachable("Unexpected value type for atomic!");
2475 case MVT::i8: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_1; break;
2476 case MVT::i16: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_2; break;
2477 case MVT::i32: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_4; break;
2478 case MVT::i64: LC = RTLIB::SYNC_VAL_COMPARE_AND_SWAP_8; break;
2481 case ISD::ATOMIC_LOAD_ADD:
2482 switch (VT.SimpleTy) {
2483 default: llvm_unreachable("Unexpected value type for atomic!");
2484 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_ADD_1; break;
2485 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_ADD_2; break;
2486 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_ADD_4; break;
2487 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_ADD_8; break;
2490 case ISD::ATOMIC_LOAD_SUB:
2491 switch (VT.SimpleTy) {
2492 default: llvm_unreachable("Unexpected value type for atomic!");
2493 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_SUB_1; break;
2494 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_SUB_2; break;
2495 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_SUB_4; break;
2496 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_SUB_8; break;
2499 case ISD::ATOMIC_LOAD_AND:
2500 switch (VT.SimpleTy) {
2501 default: llvm_unreachable("Unexpected value type for atomic!");
2502 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_AND_1; break;
2503 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_AND_2; break;
2504 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_AND_4; break;
2505 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_AND_8; break;
2508 case ISD::ATOMIC_LOAD_OR:
2509 switch (VT.SimpleTy) {
2510 default: llvm_unreachable("Unexpected value type for atomic!");
2511 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_OR_1; break;
2512 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_OR_2; break;
2513 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_OR_4; break;
2514 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_OR_8; break;
2517 case ISD::ATOMIC_LOAD_XOR:
2518 switch (VT.SimpleTy) {
2519 default: llvm_unreachable("Unexpected value type for atomic!");
2520 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_XOR_1; break;
2521 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_XOR_2; break;
2522 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_XOR_4; break;
2523 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_XOR_8; break;
2526 case ISD::ATOMIC_LOAD_NAND:
2527 switch (VT.SimpleTy) {
2528 default: llvm_unreachable("Unexpected value type for atomic!");
2529 case MVT::i8: LC = RTLIB::SYNC_FETCH_AND_NAND_1; break;
2530 case MVT::i16: LC = RTLIB::SYNC_FETCH_AND_NAND_2; break;
2531 case MVT::i32: LC = RTLIB::SYNC_FETCH_AND_NAND_4; break;
2532 case MVT::i64: LC = RTLIB::SYNC_FETCH_AND_NAND_8; break;
2537 return ExpandChainLibCall(LC, Node, false);
2540 void SelectionDAGLegalize::ExpandNode(SDNode *Node) {
2541 SmallVector<SDValue, 8> Results;
2542 DebugLoc dl = Node->getDebugLoc();
2543 SDValue Tmp1, Tmp2, Tmp3, Tmp4;
2544 switch (Node->getOpcode()) {
2547 case ISD::CTLZ_ZERO_UNDEF:
2549 case ISD::CTTZ_ZERO_UNDEF:
2550 Tmp1 = ExpandBitCount(Node->getOpcode(), Node->getOperand(0), dl);
2551 Results.push_back(Tmp1);
2554 Results.push_back(ExpandBSWAP(Node->getOperand(0), dl));
2556 case ISD::FRAMEADDR:
2557 case ISD::RETURNADDR:
2558 case ISD::FRAME_TO_ARGS_OFFSET:
2559 Results.push_back(DAG.getConstant(0, Node->getValueType(0)));
2561 case ISD::FLT_ROUNDS_:
2562 Results.push_back(DAG.getConstant(1, Node->getValueType(0)));
2564 case ISD::EH_RETURN:
2568 case ISD::EH_SJLJ_LONGJMP:
2569 // If the target didn't expand these, there's nothing to do, so just
2570 // preserve the chain and be done.
2571 Results.push_back(Node->getOperand(0));
2573 case ISD::EH_SJLJ_SETJMP:
2574 // If the target didn't expand this, just return 'zero' and preserve the
2576 Results.push_back(DAG.getConstant(0, MVT::i32));
2577 Results.push_back(Node->getOperand(0));
2579 case ISD::ATOMIC_FENCE:
2580 case ISD::MEMBARRIER: {
2581 // If the target didn't lower this, lower it to '__sync_synchronize()' call
2582 // FIXME: handle "fence singlethread" more efficiently.
2583 TargetLowering::ArgListTy Args;
2585 CallLoweringInfo CLI(Node->getOperand(0),
2586 Type::getVoidTy(*DAG.getContext()),
2587 false, false, false, false, 0, CallingConv::C,
2588 /*isTailCall=*/false,
2589 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
2590 DAG.getExternalSymbol("__sync_synchronize",
2591 TLI.getPointerTy()),
2593 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
2595 Results.push_back(CallResult.second);
2598 case ISD::ATOMIC_LOAD: {
2599 // There is no libcall for atomic load; fake it with ATOMIC_CMP_SWAP.
2600 SDValue Zero = DAG.getConstant(0, Node->getValueType(0));
2601 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_CMP_SWAP, dl,
2602 cast<AtomicSDNode>(Node)->getMemoryVT(),
2603 Node->getOperand(0),
2604 Node->getOperand(1), Zero, Zero,
2605 cast<AtomicSDNode>(Node)->getMemOperand(),
2606 cast<AtomicSDNode>(Node)->getOrdering(),
2607 cast<AtomicSDNode>(Node)->getSynchScope());
2608 Results.push_back(Swap.getValue(0));
2609 Results.push_back(Swap.getValue(1));
2612 case ISD::ATOMIC_STORE: {
2613 // There is no libcall for atomic store; fake it with ATOMIC_SWAP.
2614 SDValue Swap = DAG.getAtomic(ISD::ATOMIC_SWAP, dl,
2615 cast<AtomicSDNode>(Node)->getMemoryVT(),
2616 Node->getOperand(0),
2617 Node->getOperand(1), Node->getOperand(2),
2618 cast<AtomicSDNode>(Node)->getMemOperand(),
2619 cast<AtomicSDNode>(Node)->getOrdering(),
2620 cast<AtomicSDNode>(Node)->getSynchScope());
2621 Results.push_back(Swap.getValue(1));
2624 // By default, atomic intrinsics are marked Legal and lowered. Targets
2625 // which don't support them directly, however, may want libcalls, in which
2626 // case they mark them Expand, and we get here.
2627 case ISD::ATOMIC_SWAP:
2628 case ISD::ATOMIC_LOAD_ADD:
2629 case ISD::ATOMIC_LOAD_SUB:
2630 case ISD::ATOMIC_LOAD_AND:
2631 case ISD::ATOMIC_LOAD_OR:
2632 case ISD::ATOMIC_LOAD_XOR:
2633 case ISD::ATOMIC_LOAD_NAND:
2634 case ISD::ATOMIC_LOAD_MIN:
2635 case ISD::ATOMIC_LOAD_MAX:
2636 case ISD::ATOMIC_LOAD_UMIN:
2637 case ISD::ATOMIC_LOAD_UMAX:
2638 case ISD::ATOMIC_CMP_SWAP: {
2639 std::pair<SDValue, SDValue> Tmp = ExpandAtomic(Node);
2640 Results.push_back(Tmp.first);
2641 Results.push_back(Tmp.second);
2644 case ISD::DYNAMIC_STACKALLOC:
2645 ExpandDYNAMIC_STACKALLOC(Node, Results);
2647 case ISD::MERGE_VALUES:
2648 for (unsigned i = 0; i < Node->getNumValues(); i++)
2649 Results.push_back(Node->getOperand(i));
2652 EVT VT = Node->getValueType(0);
2654 Results.push_back(DAG.getConstant(0, VT));
2656 assert(VT.isFloatingPoint() && "Unknown value type!");
2657 Results.push_back(DAG.getConstantFP(0, VT));
2662 // If this operation is not supported, lower it to 'abort()' call
2663 TargetLowering::ArgListTy Args;
2665 CallLoweringInfo CLI(Node->getOperand(0),
2666 Type::getVoidTy(*DAG.getContext()),
2667 false, false, false, false, 0, CallingConv::C,
2668 /*isTailCall=*/false,
2669 /*doesNotReturn=*/false, /*isReturnValueUsed=*/true,
2670 DAG.getExternalSymbol("abort", TLI.getPointerTy()),
2672 std::pair<SDValue, SDValue> CallResult = TLI.LowerCallTo(CLI);
2674 Results.push_back(CallResult.second);
2679 Tmp1 = EmitStackConvert(Node->getOperand(0), Node->getValueType(0),
2680 Node->getValueType(0), dl);
2681 Results.push_back(Tmp1);
2683 case ISD::FP_EXTEND:
2684 Tmp1 = EmitStackConvert(Node->getOperand(0),
2685 Node->getOperand(0).getValueType(),
2686 Node->getValueType(0), dl);
2687 Results.push_back(Tmp1);
2689 case ISD::SIGN_EXTEND_INREG: {
2690 // NOTE: we could fall back on load/store here too for targets without
2691 // SAR. However, it is doubtful that any exist.
2692 EVT ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2693 EVT VT = Node->getValueType(0);
2694 EVT ShiftAmountTy = TLI.getShiftAmountTy(VT);
2697 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
2698 ExtraVT.getScalarType().getSizeInBits();
2699 SDValue ShiftCst = DAG.getConstant(BitsDiff, ShiftAmountTy);
2700 Tmp1 = DAG.getNode(ISD::SHL, dl, Node->getValueType(0),
2701 Node->getOperand(0), ShiftCst);
2702 Tmp1 = DAG.getNode(ISD::SRA, dl, Node->getValueType(0), Tmp1, ShiftCst);
2703 Results.push_back(Tmp1);
2706 case ISD::FP_ROUND_INREG: {
2707 // The only way we can lower this is to turn it into a TRUNCSTORE,
2708 // EXTLOAD pair, targeting a temporary location (a stack slot).
2710 // NOTE: there is a choice here between constantly creating new stack
2711 // slots and always reusing the same one. We currently always create
2712 // new ones, as reuse may inhibit scheduling.
2713 EVT ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2714 Tmp1 = EmitStackConvert(Node->getOperand(0), ExtraVT,
2715 Node->getValueType(0), dl);
2716 Results.push_back(Tmp1);
2719 case ISD::SINT_TO_FP:
2720 case ISD::UINT_TO_FP:
2721 Tmp1 = ExpandLegalINT_TO_FP(Node->getOpcode() == ISD::SINT_TO_FP,
2722 Node->getOperand(0), Node->getValueType(0), dl);
2723 Results.push_back(Tmp1);
2725 case ISD::FP_TO_UINT: {
2726 SDValue True, False;
2727 EVT VT = Node->getOperand(0).getValueType();
2728 EVT NVT = Node->getValueType(0);
2729 APFloat apf(APInt::getNullValue(VT.getSizeInBits()));
2730 APInt x = APInt::getSignBit(NVT.getSizeInBits());
2731 (void)apf.convertFromAPInt(x, false, APFloat::rmNearestTiesToEven);
2732 Tmp1 = DAG.getConstantFP(apf, VT);
2733 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(VT),
2734 Node->getOperand(0),
2736 True = DAG.getNode(ISD::FP_TO_SINT, dl, NVT, Node->getOperand(0));
2737 False = DAG.getNode(ISD::FP_TO_SINT, dl, NVT,
2738 DAG.getNode(ISD::FSUB, dl, VT,
2739 Node->getOperand(0), Tmp1));
2740 False = DAG.getNode(ISD::XOR, dl, NVT, False,
2741 DAG.getConstant(x, NVT));
2742 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2, True, False);
2743 Results.push_back(Tmp1);
2747 const Value *V = cast<SrcValueSDNode>(Node->getOperand(2))->getValue();
2748 EVT VT = Node->getValueType(0);
2749 Tmp1 = Node->getOperand(0);
2750 Tmp2 = Node->getOperand(1);
2751 unsigned Align = Node->getConstantOperandVal(3);
2753 SDValue VAListLoad = DAG.getLoad(TLI.getPointerTy(), dl, Tmp1, Tmp2,
2754 MachinePointerInfo(V),
2755 false, false, false, 0);
2756 SDValue VAList = VAListLoad;
2758 if (Align > TLI.getMinStackArgumentAlignment()) {
2759 assert(((Align & (Align-1)) == 0) && "Expected Align to be a power of 2");
2761 VAList = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), VAList,
2762 DAG.getConstant(Align - 1,
2763 TLI.getPointerTy()));
2765 VAList = DAG.getNode(ISD::AND, dl, TLI.getPointerTy(), VAList,
2766 DAG.getConstant(-(int64_t)Align,
2767 TLI.getPointerTy()));
2770 // Increment the pointer, VAList, to the next vaarg
2771 Tmp3 = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), VAList,
2772 DAG.getConstant(TLI.getTargetData()->
2773 getTypeAllocSize(VT.getTypeForEVT(*DAG.getContext())),
2774 TLI.getPointerTy()));
2775 // Store the incremented VAList to the legalized pointer
2776 Tmp3 = DAG.getStore(VAListLoad.getValue(1), dl, Tmp3, Tmp2,
2777 MachinePointerInfo(V), false, false, 0);
2778 // Load the actual argument out of the pointer VAList
2779 Results.push_back(DAG.getLoad(VT, dl, Tmp3, VAList, MachinePointerInfo(),
2780 false, false, false, 0));
2781 Results.push_back(Results[0].getValue(1));
2785 // This defaults to loading a pointer from the input and storing it to the
2786 // output, returning the chain.
2787 const Value *VD = cast<SrcValueSDNode>(Node->getOperand(3))->getValue();
2788 const Value *VS = cast<SrcValueSDNode>(Node->getOperand(4))->getValue();
2789 Tmp1 = DAG.getLoad(TLI.getPointerTy(), dl, Node->getOperand(0),
2790 Node->getOperand(2), MachinePointerInfo(VS),
2791 false, false, false, 0);
2792 Tmp1 = DAG.getStore(Tmp1.getValue(1), dl, Tmp1, Node->getOperand(1),
2793 MachinePointerInfo(VD), false, false, 0);
2794 Results.push_back(Tmp1);
2797 case ISD::EXTRACT_VECTOR_ELT:
2798 if (Node->getOperand(0).getValueType().getVectorNumElements() == 1)
2799 // This must be an access of the only element. Return it.
2800 Tmp1 = DAG.getNode(ISD::BITCAST, dl, Node->getValueType(0),
2801 Node->getOperand(0));
2803 Tmp1 = ExpandExtractFromVectorThroughStack(SDValue(Node, 0));
2804 Results.push_back(Tmp1);
2806 case ISD::EXTRACT_SUBVECTOR:
2807 Results.push_back(ExpandExtractFromVectorThroughStack(SDValue(Node, 0)));
2809 case ISD::INSERT_SUBVECTOR:
2810 Results.push_back(ExpandInsertToVectorThroughStack(SDValue(Node, 0)));
2812 case ISD::CONCAT_VECTORS: {
2813 Results.push_back(ExpandVectorBuildThroughStack(Node));
2816 case ISD::SCALAR_TO_VECTOR:
2817 Results.push_back(ExpandSCALAR_TO_VECTOR(Node));
2819 case ISD::INSERT_VECTOR_ELT:
2820 Results.push_back(ExpandINSERT_VECTOR_ELT(Node->getOperand(0),
2821 Node->getOperand(1),
2822 Node->getOperand(2), dl));
2824 case ISD::VECTOR_SHUFFLE: {
2825 SmallVector<int, 32> NewMask;
2826 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(Node)->getMask();
2828 EVT VT = Node->getValueType(0);
2829 EVT EltVT = VT.getVectorElementType();
2830 SDValue Op0 = Node->getOperand(0);
2831 SDValue Op1 = Node->getOperand(1);
2832 if (!TLI.isTypeLegal(EltVT)) {
2834 EVT NewEltVT = TLI.getTypeToTransformTo(*DAG.getContext(), EltVT);
2836 // BUILD_VECTOR operands are allowed to be wider than the element type.
2837 // But if NewEltVT is smaller that EltVT the BUILD_VECTOR does not accept it
2838 if (NewEltVT.bitsLT(EltVT)) {
2840 // Convert shuffle node.
2841 // If original node was v4i64 and the new EltVT is i32,
2842 // cast operands to v8i32 and re-build the mask.
2844 // Calculate new VT, the size of the new VT should be equal to original.
2845 EVT NewVT = EVT::getVectorVT(*DAG.getContext(), NewEltVT,
2846 VT.getSizeInBits()/NewEltVT.getSizeInBits());
2847 assert(NewVT.bitsEq(VT));
2849 // cast operands to new VT
2850 Op0 = DAG.getNode(ISD::BITCAST, dl, NewVT, Op0);
2851 Op1 = DAG.getNode(ISD::BITCAST, dl, NewVT, Op1);
2853 // Convert the shuffle mask
2854 unsigned int factor = NewVT.getVectorNumElements()/VT.getVectorNumElements();
2856 // EltVT gets smaller
2859 for (unsigned i = 0; i < VT.getVectorNumElements(); ++i) {
2861 for (unsigned fi = 0; fi < factor; ++fi)
2862 NewMask.push_back(Mask[i]);
2865 for (unsigned fi = 0; fi < factor; ++fi)
2866 NewMask.push_back(Mask[i]*factor+fi);
2874 unsigned NumElems = VT.getVectorNumElements();
2875 SmallVector<SDValue, 16> Ops;
2876 for (unsigned i = 0; i != NumElems; ++i) {
2878 Ops.push_back(DAG.getUNDEF(EltVT));
2881 unsigned Idx = Mask[i];
2883 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
2885 DAG.getIntPtrConstant(Idx)));
2887 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
2889 DAG.getIntPtrConstant(Idx - NumElems)));
2892 Tmp1 = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, &Ops[0], Ops.size());
2893 // We may have changed the BUILD_VECTOR type. Cast it back to the Node type.
2894 Tmp1 = DAG.getNode(ISD::BITCAST, dl, Node->getValueType(0), Tmp1);
2895 Results.push_back(Tmp1);
2898 case ISD::EXTRACT_ELEMENT: {
2899 EVT OpTy = Node->getOperand(0).getValueType();
2900 if (cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue()) {
2902 Tmp1 = DAG.getNode(ISD::SRL, dl, OpTy, Node->getOperand(0),
2903 DAG.getConstant(OpTy.getSizeInBits()/2,
2904 TLI.getShiftAmountTy(Node->getOperand(0).getValueType())));
2905 Tmp1 = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0), Tmp1);
2908 Tmp1 = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0),
2909 Node->getOperand(0));
2911 Results.push_back(Tmp1);
2914 case ISD::STACKSAVE:
2915 // Expand to CopyFromReg if the target set
2916 // StackPointerRegisterToSaveRestore.
2917 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2918 Results.push_back(DAG.getCopyFromReg(Node->getOperand(0), dl, SP,
2919 Node->getValueType(0)));
2920 Results.push_back(Results[0].getValue(1));
2922 Results.push_back(DAG.getUNDEF(Node->getValueType(0)));
2923 Results.push_back(Node->getOperand(0));
2926 case ISD::STACKRESTORE:
2927 // Expand to CopyToReg if the target set
2928 // StackPointerRegisterToSaveRestore.
2929 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2930 Results.push_back(DAG.getCopyToReg(Node->getOperand(0), dl, SP,
2931 Node->getOperand(1)));
2933 Results.push_back(Node->getOperand(0));
2936 case ISD::FCOPYSIGN:
2937 Results.push_back(ExpandFCOPYSIGN(Node));
2940 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
2941 Tmp1 = DAG.getConstantFP(-0.0, Node->getValueType(0));
2942 Tmp1 = DAG.getNode(ISD::FSUB, dl, Node->getValueType(0), Tmp1,
2943 Node->getOperand(0));
2944 Results.push_back(Tmp1);
2947 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
2948 EVT VT = Node->getValueType(0);
2949 Tmp1 = Node->getOperand(0);
2950 Tmp2 = DAG.getConstantFP(0.0, VT);
2951 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(Tmp1.getValueType()),
2952 Tmp1, Tmp2, ISD::SETUGT);
2953 Tmp3 = DAG.getNode(ISD::FNEG, dl, VT, Tmp1);
2954 Tmp1 = DAG.getNode(ISD::SELECT, dl, VT, Tmp2, Tmp1, Tmp3);
2955 Results.push_back(Tmp1);
2959 Results.push_back(ExpandFPLibCall(Node, RTLIB::SQRT_F32, RTLIB::SQRT_F64,
2960 RTLIB::SQRT_F80, RTLIB::SQRT_PPCF128));
2963 Results.push_back(ExpandFPLibCall(Node, RTLIB::SIN_F32, RTLIB::SIN_F64,
2964 RTLIB::SIN_F80, RTLIB::SIN_PPCF128));
2967 Results.push_back(ExpandFPLibCall(Node, RTLIB::COS_F32, RTLIB::COS_F64,
2968 RTLIB::COS_F80, RTLIB::COS_PPCF128));
2971 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG_F32, RTLIB::LOG_F64,
2972 RTLIB::LOG_F80, RTLIB::LOG_PPCF128));
2975 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG2_F32, RTLIB::LOG2_F64,
2976 RTLIB::LOG2_F80, RTLIB::LOG2_PPCF128));
2979 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG10_F32, RTLIB::LOG10_F64,
2980 RTLIB::LOG10_F80, RTLIB::LOG10_PPCF128));
2983 Results.push_back(ExpandFPLibCall(Node, RTLIB::EXP_F32, RTLIB::EXP_F64,
2984 RTLIB::EXP_F80, RTLIB::EXP_PPCF128));
2987 Results.push_back(ExpandFPLibCall(Node, RTLIB::EXP2_F32, RTLIB::EXP2_F64,
2988 RTLIB::EXP2_F80, RTLIB::EXP2_PPCF128));
2991 Results.push_back(ExpandFPLibCall(Node, RTLIB::TRUNC_F32, RTLIB::TRUNC_F64,
2992 RTLIB::TRUNC_F80, RTLIB::TRUNC_PPCF128));
2995 Results.push_back(ExpandFPLibCall(Node, RTLIB::FLOOR_F32, RTLIB::FLOOR_F64,
2996 RTLIB::FLOOR_F80, RTLIB::FLOOR_PPCF128));
2999 Results.push_back(ExpandFPLibCall(Node, RTLIB::CEIL_F32, RTLIB::CEIL_F64,
3000 RTLIB::CEIL_F80, RTLIB::CEIL_PPCF128));
3003 Results.push_back(ExpandFPLibCall(Node, RTLIB::RINT_F32, RTLIB::RINT_F64,
3004 RTLIB::RINT_F80, RTLIB::RINT_PPCF128));
3006 case ISD::FNEARBYINT:
3007 Results.push_back(ExpandFPLibCall(Node, RTLIB::NEARBYINT_F32,
3008 RTLIB::NEARBYINT_F64,
3009 RTLIB::NEARBYINT_F80,
3010 RTLIB::NEARBYINT_PPCF128));
3013 Results.push_back(ExpandFPLibCall(Node, RTLIB::POWI_F32, RTLIB::POWI_F64,
3014 RTLIB::POWI_F80, RTLIB::POWI_PPCF128));
3017 Results.push_back(ExpandFPLibCall(Node, RTLIB::POW_F32, RTLIB::POW_F64,
3018 RTLIB::POW_F80, RTLIB::POW_PPCF128));
3021 Results.push_back(ExpandFPLibCall(Node, RTLIB::DIV_F32, RTLIB::DIV_F64,
3022 RTLIB::DIV_F80, RTLIB::DIV_PPCF128));
3025 Results.push_back(ExpandFPLibCall(Node, RTLIB::REM_F32, RTLIB::REM_F64,
3026 RTLIB::REM_F80, RTLIB::REM_PPCF128));
3029 Results.push_back(ExpandFPLibCall(Node, RTLIB::FMA_F32, RTLIB::FMA_F64,
3030 RTLIB::FMA_F80, RTLIB::FMA_PPCF128));
3032 case ISD::FP16_TO_FP32:
3033 Results.push_back(ExpandLibCall(RTLIB::FPEXT_F16_F32, Node, false));
3035 case ISD::FP32_TO_FP16:
3036 Results.push_back(ExpandLibCall(RTLIB::FPROUND_F32_F16, Node, false));
3038 case ISD::ConstantFP: {
3039 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
3040 // Check to see if this FP immediate is already legal.
3041 // If this is a legal constant, turn it into a TargetConstantFP node.
3042 if (!TLI.isFPImmLegal(CFP->getValueAPF(), Node->getValueType(0)))
3043 Results.push_back(ExpandConstantFP(CFP, true));
3046 case ISD::EHSELECTION: {
3047 unsigned Reg = TLI.getExceptionSelectorRegister();
3048 assert(Reg && "Can't expand to unknown register!");
3049 Results.push_back(DAG.getCopyFromReg(Node->getOperand(1), dl, Reg,
3050 Node->getValueType(0)));
3051 Results.push_back(Results[0].getValue(1));
3054 case ISD::EXCEPTIONADDR: {
3055 unsigned Reg = TLI.getExceptionPointerRegister();
3056 assert(Reg && "Can't expand to unknown register!");
3057 Results.push_back(DAG.getCopyFromReg(Node->getOperand(0), dl, Reg,
3058 Node->getValueType(0)));
3059 Results.push_back(Results[0].getValue(1));
3063 EVT VT = Node->getValueType(0);
3064 assert(TLI.isOperationLegalOrCustom(ISD::FADD, VT) &&
3065 TLI.isOperationLegalOrCustom(ISD::FNEG, VT) &&
3066 "Don't know how to expand this FP subtraction!");
3067 Tmp1 = DAG.getNode(ISD::FNEG, dl, VT, Node->getOperand(1));
3068 Tmp1 = DAG.getNode(ISD::FADD, dl, VT, Node->getOperand(0), Tmp1);
3069 Results.push_back(Tmp1);
3073 EVT VT = Node->getValueType(0);
3074 assert(TLI.isOperationLegalOrCustom(ISD::ADD, VT) &&
3075 TLI.isOperationLegalOrCustom(ISD::XOR, VT) &&
3076 "Don't know how to expand this subtraction!");
3077 Tmp1 = DAG.getNode(ISD::XOR, dl, VT, Node->getOperand(1),
3078 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), VT));
3079 Tmp1 = DAG.getNode(ISD::ADD, dl, VT, Tmp1, DAG.getConstant(1, VT));
3080 Results.push_back(DAG.getNode(ISD::ADD, dl, VT, Node->getOperand(0), Tmp1));
3085 EVT VT = Node->getValueType(0);
3086 SDVTList VTs = DAG.getVTList(VT, VT);
3087 bool isSigned = Node->getOpcode() == ISD::SREM;
3088 unsigned DivOpc = isSigned ? ISD::SDIV : ISD::UDIV;
3089 unsigned DivRemOpc = isSigned ? ISD::SDIVREM : ISD::UDIVREM;
3090 Tmp2 = Node->getOperand(0);
3091 Tmp3 = Node->getOperand(1);
3092 if (TLI.isOperationLegalOrCustom(DivRemOpc, VT) ||
3093 (isDivRemLibcallAvailable(Node, isSigned, TLI) &&
3094 UseDivRem(Node, isSigned, false))) {
3095 Tmp1 = DAG.getNode(DivRemOpc, dl, VTs, Tmp2, Tmp3).getValue(1);
3096 } else if (TLI.isOperationLegalOrCustom(DivOpc, VT)) {
3098 Tmp1 = DAG.getNode(DivOpc, dl, VT, Tmp2, Tmp3);
3099 Tmp1 = DAG.getNode(ISD::MUL, dl, VT, Tmp1, Tmp3);
3100 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, Tmp2, Tmp1);
3101 } else if (isSigned)
3102 Tmp1 = ExpandIntLibCall(Node, true,
3104 RTLIB::SREM_I16, RTLIB::SREM_I32,
3105 RTLIB::SREM_I64, RTLIB::SREM_I128);
3107 Tmp1 = ExpandIntLibCall(Node, false,
3109 RTLIB::UREM_I16, RTLIB::UREM_I32,
3110 RTLIB::UREM_I64, RTLIB::UREM_I128);
3111 Results.push_back(Tmp1);
3116 bool isSigned = Node->getOpcode() == ISD::SDIV;
3117 unsigned DivRemOpc = isSigned ? ISD::SDIVREM : ISD::UDIVREM;
3118 EVT VT = Node->getValueType(0);
3119 SDVTList VTs = DAG.getVTList(VT, VT);
3120 if (TLI.isOperationLegalOrCustom(DivRemOpc, VT) ||
3121 (isDivRemLibcallAvailable(Node, isSigned, TLI) &&
3122 UseDivRem(Node, isSigned, true)))
3123 Tmp1 = DAG.getNode(DivRemOpc, dl, VTs, Node->getOperand(0),
3124 Node->getOperand(1));
3126 Tmp1 = ExpandIntLibCall(Node, true,
3128 RTLIB::SDIV_I16, RTLIB::SDIV_I32,
3129 RTLIB::SDIV_I64, RTLIB::SDIV_I128);
3131 Tmp1 = ExpandIntLibCall(Node, false,
3133 RTLIB::UDIV_I16, RTLIB::UDIV_I32,
3134 RTLIB::UDIV_I64, RTLIB::UDIV_I128);
3135 Results.push_back(Tmp1);
3140 unsigned ExpandOpcode = Node->getOpcode() == ISD::MULHU ? ISD::UMUL_LOHI :
3142 EVT VT = Node->getValueType(0);
3143 SDVTList VTs = DAG.getVTList(VT, VT);
3144 assert(TLI.isOperationLegalOrCustom(ExpandOpcode, VT) &&
3145 "If this wasn't legal, it shouldn't have been created!");
3146 Tmp1 = DAG.getNode(ExpandOpcode, dl, VTs, Node->getOperand(0),
3147 Node->getOperand(1));
3148 Results.push_back(Tmp1.getValue(1));
3153 // Expand into divrem libcall
3154 ExpandDivRemLibCall(Node, Results);
3157 EVT VT = Node->getValueType(0);
3158 SDVTList VTs = DAG.getVTList(VT, VT);
3159 // See if multiply or divide can be lowered using two-result operations.
3160 // We just need the low half of the multiply; try both the signed
3161 // and unsigned forms. If the target supports both SMUL_LOHI and
3162 // UMUL_LOHI, form a preference by checking which forms of plain
3163 // MULH it supports.
3164 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, VT);
3165 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, VT);
3166 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, VT);
3167 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, VT);
3168 unsigned OpToUse = 0;
3169 if (HasSMUL_LOHI && !HasMULHS) {
3170 OpToUse = ISD::SMUL_LOHI;
3171 } else if (HasUMUL_LOHI && !HasMULHU) {
3172 OpToUse = ISD::UMUL_LOHI;
3173 } else if (HasSMUL_LOHI) {
3174 OpToUse = ISD::SMUL_LOHI;
3175 } else if (HasUMUL_LOHI) {
3176 OpToUse = ISD::UMUL_LOHI;
3179 Results.push_back(DAG.getNode(OpToUse, dl, VTs, Node->getOperand(0),
3180 Node->getOperand(1)));
3183 Tmp1 = ExpandIntLibCall(Node, false,
3185 RTLIB::MUL_I16, RTLIB::MUL_I32,
3186 RTLIB::MUL_I64, RTLIB::MUL_I128);
3187 Results.push_back(Tmp1);
3192 SDValue LHS = Node->getOperand(0);
3193 SDValue RHS = Node->getOperand(1);
3194 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::SADDO ?
3195 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
3197 Results.push_back(Sum);
3198 EVT OType = Node->getValueType(1);
3200 SDValue Zero = DAG.getConstant(0, LHS.getValueType());
3202 // LHSSign -> LHS >= 0
3203 // RHSSign -> RHS >= 0
3204 // SumSign -> Sum >= 0
3207 // Overflow -> (LHSSign == RHSSign) && (LHSSign != SumSign)
3209 // Overflow -> (LHSSign != RHSSign) && (LHSSign != SumSign)
3211 SDValue LHSSign = DAG.getSetCC(dl, OType, LHS, Zero, ISD::SETGE);
3212 SDValue RHSSign = DAG.getSetCC(dl, OType, RHS, Zero, ISD::SETGE);
3213 SDValue SignsMatch = DAG.getSetCC(dl, OType, LHSSign, RHSSign,
3214 Node->getOpcode() == ISD::SADDO ?
3215 ISD::SETEQ : ISD::SETNE);
3217 SDValue SumSign = DAG.getSetCC(dl, OType, Sum, Zero, ISD::SETGE);
3218 SDValue SumSignNE = DAG.getSetCC(dl, OType, LHSSign, SumSign, ISD::SETNE);
3220 SDValue Cmp = DAG.getNode(ISD::AND, dl, OType, SignsMatch, SumSignNE);
3221 Results.push_back(Cmp);
3226 SDValue LHS = Node->getOperand(0);
3227 SDValue RHS = Node->getOperand(1);
3228 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::UADDO ?
3229 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
3231 Results.push_back(Sum);
3232 Results.push_back(DAG.getSetCC(dl, Node->getValueType(1), Sum, LHS,
3233 Node->getOpcode () == ISD::UADDO ?
3234 ISD::SETULT : ISD::SETUGT));
3239 EVT VT = Node->getValueType(0);
3240 EVT WideVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits() * 2);
3241 SDValue LHS = Node->getOperand(0);
3242 SDValue RHS = Node->getOperand(1);
3245 static const unsigned Ops[2][3] =
3246 { { ISD::MULHU, ISD::UMUL_LOHI, ISD::ZERO_EXTEND },
3247 { ISD::MULHS, ISD::SMUL_LOHI, ISD::SIGN_EXTEND }};
3248 bool isSigned = Node->getOpcode() == ISD::SMULO;
3249 if (TLI.isOperationLegalOrCustom(Ops[isSigned][0], VT)) {
3250 BottomHalf = DAG.getNode(ISD::MUL, dl, VT, LHS, RHS);
3251 TopHalf = DAG.getNode(Ops[isSigned][0], dl, VT, LHS, RHS);
3252 } else if (TLI.isOperationLegalOrCustom(Ops[isSigned][1], VT)) {
3253 BottomHalf = DAG.getNode(Ops[isSigned][1], dl, DAG.getVTList(VT, VT), LHS,
3255 TopHalf = BottomHalf.getValue(1);
3256 } else if (TLI.isTypeLegal(EVT::getIntegerVT(*DAG.getContext(),
3257 VT.getSizeInBits() * 2))) {
3258 LHS = DAG.getNode(Ops[isSigned][2], dl, WideVT, LHS);
3259 RHS = DAG.getNode(Ops[isSigned][2], dl, WideVT, RHS);
3260 Tmp1 = DAG.getNode(ISD::MUL, dl, WideVT, LHS, RHS);
3261 BottomHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Tmp1,
3262 DAG.getIntPtrConstant(0));
3263 TopHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Tmp1,
3264 DAG.getIntPtrConstant(1));
3266 // We can fall back to a libcall with an illegal type for the MUL if we
3267 // have a libcall big enough.
3268 // Also, we can fall back to a division in some cases, but that's a big
3269 // performance hit in the general case.
3270 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
3271 if (WideVT == MVT::i16)
3272 LC = RTLIB::MUL_I16;
3273 else if (WideVT == MVT::i32)
3274 LC = RTLIB::MUL_I32;
3275 else if (WideVT == MVT::i64)
3276 LC = RTLIB::MUL_I64;
3277 else if (WideVT == MVT::i128)
3278 LC = RTLIB::MUL_I128;
3279 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Cannot expand this operation!");
3281 // The high part is obtained by SRA'ing all but one of the bits of low
3283 unsigned LoSize = VT.getSizeInBits();
3284 SDValue HiLHS = DAG.getNode(ISD::SRA, dl, VT, RHS,
3285 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
3286 SDValue HiRHS = DAG.getNode(ISD::SRA, dl, VT, LHS,
3287 DAG.getConstant(LoSize-1, TLI.getPointerTy()));
3289 // Here we're passing the 2 arguments explicitly as 4 arguments that are
3290 // pre-lowered to the correct types. This all depends upon WideVT not
3291 // being a legal type for the architecture and thus has to be split to
3293 SDValue Args[] = { LHS, HiLHS, RHS, HiRHS };
3294 SDValue Ret = ExpandLibCall(LC, WideVT, Args, 4, isSigned, dl);
3295 BottomHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Ret,
3296 DAG.getIntPtrConstant(0));
3297 TopHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Ret,
3298 DAG.getIntPtrConstant(1));
3299 // Ret is a node with an illegal type. Because such things are not
3300 // generally permitted during this phase of legalization, delete the
3301 // node. The above EXTRACT_ELEMENT nodes should have been folded.
3302 DAG.DeleteNode(Ret.getNode());
3306 Tmp1 = DAG.getConstant(VT.getSizeInBits() - 1,
3307 TLI.getShiftAmountTy(BottomHalf.getValueType()));
3308 Tmp1 = DAG.getNode(ISD::SRA, dl, VT, BottomHalf, Tmp1);
3309 TopHalf = DAG.getSetCC(dl, TLI.getSetCCResultType(VT), TopHalf, Tmp1,
3312 TopHalf = DAG.getSetCC(dl, TLI.getSetCCResultType(VT), TopHalf,
3313 DAG.getConstant(0, VT), ISD::SETNE);
3315 Results.push_back(BottomHalf);
3316 Results.push_back(TopHalf);
3319 case ISD::BUILD_PAIR: {
3320 EVT PairTy = Node->getValueType(0);
3321 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, PairTy, Node->getOperand(0));
3322 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, dl, PairTy, Node->getOperand(1));
3323 Tmp2 = DAG.getNode(ISD::SHL, dl, PairTy, Tmp2,
3324 DAG.getConstant(PairTy.getSizeInBits()/2,
3325 TLI.getShiftAmountTy(PairTy)));
3326 Results.push_back(DAG.getNode(ISD::OR, dl, PairTy, Tmp1, Tmp2));
3330 Tmp1 = Node->getOperand(0);
3331 Tmp2 = Node->getOperand(1);
3332 Tmp3 = Node->getOperand(2);
3333 if (Tmp1.getOpcode() == ISD::SETCC) {
3334 Tmp1 = DAG.getSelectCC(dl, Tmp1.getOperand(0), Tmp1.getOperand(1),
3336 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
3338 Tmp1 = DAG.getSelectCC(dl, Tmp1,
3339 DAG.getConstant(0, Tmp1.getValueType()),
3340 Tmp2, Tmp3, ISD::SETNE);
3342 Results.push_back(Tmp1);
3345 SDValue Chain = Node->getOperand(0);
3346 SDValue Table = Node->getOperand(1);
3347 SDValue Index = Node->getOperand(2);
3349 EVT PTy = TLI.getPointerTy();
3351 const TargetData &TD = *TLI.getTargetData();
3352 unsigned EntrySize =
3353 DAG.getMachineFunction().getJumpTableInfo()->getEntrySize(TD);
3355 Index = DAG.getNode(ISD::MUL, dl, PTy,
3356 Index, DAG.getConstant(EntrySize, PTy));
3357 SDValue Addr = DAG.getNode(ISD::ADD, dl, PTy, Index, Table);
3359 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(), EntrySize * 8);
3360 SDValue LD = DAG.getExtLoad(ISD::SEXTLOAD, dl, PTy, Chain, Addr,
3361 MachinePointerInfo::getJumpTable(), MemVT,
3364 if (TM.getRelocationModel() == Reloc::PIC_) {
3365 // For PIC, the sequence is:
3366 // BRIND(load(Jumptable + index) + RelocBase)
3367 // RelocBase can be JumpTable, GOT or some sort of global base.
3368 Addr = DAG.getNode(ISD::ADD, dl, PTy, Addr,
3369 TLI.getPICJumpTableRelocBase(Table, DAG));
3371 Tmp1 = DAG.getNode(ISD::BRIND, dl, MVT::Other, LD.getValue(1), Addr);
3372 Results.push_back(Tmp1);
3376 // Expand brcond's setcc into its constituent parts and create a BR_CC
3378 Tmp1 = Node->getOperand(0);
3379 Tmp2 = Node->getOperand(1);
3380 if (Tmp2.getOpcode() == ISD::SETCC) {
3381 Tmp1 = DAG.getNode(ISD::BR_CC, dl, MVT::Other,
3382 Tmp1, Tmp2.getOperand(2),
3383 Tmp2.getOperand(0), Tmp2.getOperand(1),
3384 Node->getOperand(2));
3386 // We test only the i1 bit. Skip the AND if UNDEF.
3387 Tmp3 = (Tmp2.getOpcode() == ISD::UNDEF) ? Tmp2 :
3388 DAG.getNode(ISD::AND, dl, Tmp2.getValueType(), Tmp2,
3389 DAG.getConstant(1, Tmp2.getValueType()));
3390 Tmp1 = DAG.getNode(ISD::BR_CC, dl, MVT::Other, Tmp1,
3391 DAG.getCondCode(ISD::SETNE), Tmp3,
3392 DAG.getConstant(0, Tmp3.getValueType()),
3393 Node->getOperand(2));
3395 Results.push_back(Tmp1);
3398 Tmp1 = Node->getOperand(0);
3399 Tmp2 = Node->getOperand(1);
3400 Tmp3 = Node->getOperand(2);
3401 LegalizeSetCCCondCode(Node->getValueType(0), Tmp1, Tmp2, Tmp3, dl);
3403 // If we expanded the SETCC into an AND/OR, return the new node
3404 if (Tmp2.getNode() == 0) {
3405 Results.push_back(Tmp1);
3409 // Otherwise, SETCC for the given comparison type must be completely
3410 // illegal; expand it into a SELECT_CC.
3411 EVT VT = Node->getValueType(0);
3412 Tmp1 = DAG.getNode(ISD::SELECT_CC, dl, VT, Tmp1, Tmp2,
3413 DAG.getConstant(1, VT), DAG.getConstant(0, VT), Tmp3);
3414 Results.push_back(Tmp1);
3417 case ISD::SELECT_CC: {
3418 Tmp1 = Node->getOperand(0); // LHS
3419 Tmp2 = Node->getOperand(1); // RHS
3420 Tmp3 = Node->getOperand(2); // True
3421 Tmp4 = Node->getOperand(3); // False
3422 SDValue CC = Node->getOperand(4);
3424 LegalizeSetCCCondCode(TLI.getSetCCResultType(Tmp1.getValueType()),
3425 Tmp1, Tmp2, CC, dl);
3427 assert(!Tmp2.getNode() && "Can't legalize SELECT_CC with legal condition!");
3428 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
3429 CC = DAG.getCondCode(ISD::SETNE);
3430 Tmp1 = DAG.getNode(ISD::SELECT_CC, dl, Node->getValueType(0), Tmp1, Tmp2,
3432 Results.push_back(Tmp1);
3436 Tmp1 = Node->getOperand(0); // Chain
3437 Tmp2 = Node->getOperand(2); // LHS
3438 Tmp3 = Node->getOperand(3); // RHS
3439 Tmp4 = Node->getOperand(1); // CC
3441 LegalizeSetCCCondCode(TLI.getSetCCResultType(Tmp2.getValueType()),
3442 Tmp2, Tmp3, Tmp4, dl);
3444 assert(!Tmp3.getNode() && "Can't legalize BR_CC with legal condition!");
3445 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
3446 Tmp4 = DAG.getCondCode(ISD::SETNE);
3447 Tmp1 = DAG.getNode(ISD::BR_CC, dl, Node->getValueType(0), Tmp1, Tmp4, Tmp2,
3448 Tmp3, Node->getOperand(4));
3449 Results.push_back(Tmp1);
3452 case ISD::BUILD_VECTOR:
3453 Results.push_back(ExpandBUILD_VECTOR(Node));
3458 // Scalarize vector SRA/SRL/SHL.
3459 EVT VT = Node->getValueType(0);
3460 assert(VT.isVector() && "Unable to legalize non-vector shift");
3461 assert(TLI.isTypeLegal(VT.getScalarType())&& "Element type must be legal");
3462 unsigned NumElem = VT.getVectorNumElements();
3464 SmallVector<SDValue, 8> Scalars;
3465 for (unsigned Idx = 0; Idx < NumElem; Idx++) {
3466 SDValue Ex = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
3468 Node->getOperand(0), DAG.getIntPtrConstant(Idx));
3469 SDValue Sh = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
3471 Node->getOperand(1), DAG.getIntPtrConstant(Idx));
3472 Scalars.push_back(DAG.getNode(Node->getOpcode(), dl,
3473 VT.getScalarType(), Ex, Sh));
3476 DAG.getNode(ISD::BUILD_VECTOR, dl, Node->getValueType(0),
3477 &Scalars[0], Scalars.size());
3478 ReplaceNode(SDValue(Node, 0), Result);
3481 case ISD::GLOBAL_OFFSET_TABLE:
3482 case ISD::GlobalAddress:
3483 case ISD::GlobalTLSAddress:
3484 case ISD::ExternalSymbol:
3485 case ISD::ConstantPool:
3486 case ISD::JumpTable:
3487 case ISD::INTRINSIC_W_CHAIN:
3488 case ISD::INTRINSIC_WO_CHAIN:
3489 case ISD::INTRINSIC_VOID:
3490 // FIXME: Custom lowering for these operations shouldn't return null!
3494 // Replace the original node with the legalized result.
3495 if (!Results.empty())
3496 ReplaceNode(Node, Results.data());
3499 void SelectionDAGLegalize::PromoteNode(SDNode *Node) {
3500 SmallVector<SDValue, 8> Results;
3501 EVT OVT = Node->getValueType(0);
3502 if (Node->getOpcode() == ISD::UINT_TO_FP ||
3503 Node->getOpcode() == ISD::SINT_TO_FP ||
3504 Node->getOpcode() == ISD::SETCC) {
3505 OVT = Node->getOperand(0).getValueType();
3507 EVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
3508 DebugLoc dl = Node->getDebugLoc();
3509 SDValue Tmp1, Tmp2, Tmp3;
3510 switch (Node->getOpcode()) {
3512 case ISD::CTTZ_ZERO_UNDEF:
3514 case ISD::CTLZ_ZERO_UNDEF:
3516 // Zero extend the argument.
3517 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Node->getOperand(0));
3518 // Perform the larger operation. For CTPOP and CTTZ_ZERO_UNDEF, this is
3519 // already the correct result.
3520 Tmp1 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
3521 if (Node->getOpcode() == ISD::CTTZ) {
3522 // FIXME: This should set a bit in the zero extended value instead.
3523 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT),
3524 Tmp1, DAG.getConstant(NVT.getSizeInBits(), NVT),
3526 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2,
3527 DAG.getConstant(OVT.getSizeInBits(), NVT), Tmp1);
3528 } else if (Node->getOpcode() == ISD::CTLZ ||
3529 Node->getOpcode() == ISD::CTLZ_ZERO_UNDEF) {
3530 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
3531 Tmp1 = DAG.getNode(ISD::SUB, dl, NVT, Tmp1,
3532 DAG.getConstant(NVT.getSizeInBits() -
3533 OVT.getSizeInBits(), NVT));
3535 Results.push_back(DAG.getNode(ISD::TRUNCATE, dl, OVT, Tmp1));
3538 unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits();
3539 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Node->getOperand(0));
3540 Tmp1 = DAG.getNode(ISD::BSWAP, dl, NVT, Tmp1);
3541 Tmp1 = DAG.getNode(ISD::SRL, dl, NVT, Tmp1,
3542 DAG.getConstant(DiffBits, TLI.getShiftAmountTy(NVT)));
3543 Results.push_back(Tmp1);
3546 case ISD::FP_TO_UINT:
3547 case ISD::FP_TO_SINT:
3548 Tmp1 = PromoteLegalFP_TO_INT(Node->getOperand(0), Node->getValueType(0),
3549 Node->getOpcode() == ISD::FP_TO_SINT, dl);
3550 Results.push_back(Tmp1);
3552 case ISD::UINT_TO_FP:
3553 case ISD::SINT_TO_FP:
3554 Tmp1 = PromoteLegalINT_TO_FP(Node->getOperand(0), Node->getValueType(0),
3555 Node->getOpcode() == ISD::SINT_TO_FP, dl);
3556 Results.push_back(Tmp1);
3559 SDValue Chain = Node->getOperand(0); // Get the chain.
3560 SDValue Ptr = Node->getOperand(1); // Get the pointer.
3563 if (OVT.isVector()) {
3564 TruncOp = ISD::BITCAST;
3566 assert(OVT.isInteger()
3567 && "VAARG promotion is supported only for vectors or integer types");
3568 TruncOp = ISD::TRUNCATE;
3571 // Perform the larger operation, then convert back
3572 Tmp1 = DAG.getVAArg(NVT, dl, Chain, Ptr, Node->getOperand(2),
3573 Node->getConstantOperandVal(3));
3574 Chain = Tmp1.getValue(1);
3576 Tmp2 = DAG.getNode(TruncOp, dl, OVT, Tmp1);
3578 // Modified the chain result - switch anything that used the old chain to
3580 DAG.ReplaceAllUsesOfValueWith(SDValue(Node, 0), Tmp2);
3581 DAG.ReplaceAllUsesOfValueWith(SDValue(Node, 1), Chain);
3588 unsigned ExtOp, TruncOp;
3589 if (OVT.isVector()) {
3590 ExtOp = ISD::BITCAST;
3591 TruncOp = ISD::BITCAST;
3593 assert(OVT.isInteger() && "Cannot promote logic operation");
3594 ExtOp = ISD::ANY_EXTEND;
3595 TruncOp = ISD::TRUNCATE;
3597 // Promote each of the values to the new type.
3598 Tmp1 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(0));
3599 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3600 // Perform the larger operation, then convert back
3601 Tmp1 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
3602 Results.push_back(DAG.getNode(TruncOp, dl, OVT, Tmp1));
3606 unsigned ExtOp, TruncOp;
3607 if (Node->getValueType(0).isVector()) {
3608 ExtOp = ISD::BITCAST;
3609 TruncOp = ISD::BITCAST;
3610 } else if (Node->getValueType(0).isInteger()) {
3611 ExtOp = ISD::ANY_EXTEND;
3612 TruncOp = ISD::TRUNCATE;
3614 ExtOp = ISD::FP_EXTEND;
3615 TruncOp = ISD::FP_ROUND;
3617 Tmp1 = Node->getOperand(0);
3618 // Promote each of the values to the new type.
3619 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3620 Tmp3 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(2));
3621 // Perform the larger operation, then round down.
3622 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp1, Tmp2, Tmp3);
3623 if (TruncOp != ISD::FP_ROUND)
3624 Tmp1 = DAG.getNode(TruncOp, dl, Node->getValueType(0), Tmp1);
3626 Tmp1 = DAG.getNode(TruncOp, dl, Node->getValueType(0), Tmp1,
3627 DAG.getIntPtrConstant(0));
3628 Results.push_back(Tmp1);
3631 case ISD::VECTOR_SHUFFLE: {
3632 ArrayRef<int> Mask = cast<ShuffleVectorSDNode>(Node)->getMask();
3634 // Cast the two input vectors.
3635 Tmp1 = DAG.getNode(ISD::BITCAST, dl, NVT, Node->getOperand(0));
3636 Tmp2 = DAG.getNode(ISD::BITCAST, dl, NVT, Node->getOperand(1));
3638 // Convert the shuffle mask to the right # elements.
3639 Tmp1 = ShuffleWithNarrowerEltType(NVT, OVT, dl, Tmp1, Tmp2, Mask);
3640 Tmp1 = DAG.getNode(ISD::BITCAST, dl, OVT, Tmp1);
3641 Results.push_back(Tmp1);
3645 unsigned ExtOp = ISD::FP_EXTEND;
3646 if (NVT.isInteger()) {
3647 ISD::CondCode CCCode =
3648 cast<CondCodeSDNode>(Node->getOperand(2))->get();
3649 ExtOp = isSignedIntSetCC(CCCode) ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
3651 Tmp1 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(0));
3652 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3653 Results.push_back(DAG.getNode(ISD::SETCC, dl, Node->getValueType(0),
3654 Tmp1, Tmp2, Node->getOperand(2)));
3660 Tmp1 = DAG.getNode(ISD::FP_EXTEND, dl, NVT, Node->getOperand(0));
3661 Tmp2 = DAG.getNode(ISD::FP_EXTEND, dl, NVT, Node->getOperand(1));
3662 Tmp3 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
3663 Results.push_back(DAG.getNode(ISD::FP_ROUND, dl, OVT,
3664 Tmp3, DAG.getIntPtrConstant(0)));
3671 Tmp1 = DAG.getNode(ISD::FP_EXTEND, dl, NVT, Node->getOperand(0));
3672 Tmp2 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
3673 Results.push_back(DAG.getNode(ISD::FP_ROUND, dl, OVT,
3674 Tmp2, DAG.getIntPtrConstant(0)));
3679 // Replace the original node with the legalized result.
3680 if (!Results.empty())
3681 ReplaceNode(Node, Results.data());
3684 // SelectionDAG::Legalize - This is the entry point for the file.
3686 void SelectionDAG::Legalize() {
3687 /// run - This is the main entry point to this class.
3689 SelectionDAGLegalize(*this).LegalizeDAG();