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/CodeGen/SelectionDAG.h"
15 #include "llvm/CodeGen/MachineFunction.h"
16 #include "llvm/CodeGen/MachineFrameInfo.h"
17 #include "llvm/CodeGen/MachineJumpTableInfo.h"
18 #include "llvm/CodeGen/MachineModuleInfo.h"
19 #include "llvm/CodeGen/DwarfWriter.h"
20 #include "llvm/Analysis/DebugInfo.h"
21 #include "llvm/CodeGen/PseudoSourceValue.h"
22 #include "llvm/Target/TargetFrameInfo.h"
23 #include "llvm/Target/TargetLowering.h"
24 #include "llvm/Target/TargetData.h"
25 #include "llvm/Target/TargetMachine.h"
26 #include "llvm/Target/TargetOptions.h"
27 #include "llvm/Target/TargetSubtarget.h"
28 #include "llvm/CallingConv.h"
29 #include "llvm/Constants.h"
30 #include "llvm/DerivedTypes.h"
31 #include "llvm/Function.h"
32 #include "llvm/GlobalVariable.h"
33 #include "llvm/LLVMContext.h"
34 #include "llvm/Support/CommandLine.h"
35 #include "llvm/Support/Compiler.h"
36 #include "llvm/Support/ErrorHandling.h"
37 #include "llvm/Support/MathExtras.h"
38 #include "llvm/Support/raw_ostream.h"
39 #include "llvm/ADT/DenseMap.h"
40 #include "llvm/ADT/SmallVector.h"
41 #include "llvm/ADT/SmallPtrSet.h"
45 //===----------------------------------------------------------------------===//
46 /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
47 /// hacks on it until the target machine can handle it. This involves
48 /// eliminating value sizes the machine cannot handle (promoting small sizes to
49 /// large sizes or splitting up large values into small values) as well as
50 /// eliminating operations the machine cannot handle.
52 /// This code also does a small amount of optimization and recognition of idioms
53 /// as part of its processing. For example, if a target does not support a
54 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
55 /// will attempt merge setcc and brc instructions into brcc's.
58 class VISIBILITY_HIDDEN SelectionDAGLegalize {
61 CodeGenOpt::Level OptLevel;
63 // Libcall insertion helpers.
65 /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been
66 /// legalized. We use this to ensure that calls are properly serialized
67 /// against each other, including inserted libcalls.
68 SDValue LastCALLSEQ_END;
70 /// IsLegalizingCall - This member is used *only* for purposes of providing
71 /// helpful assertions that a libcall isn't created while another call is
72 /// being legalized (which could lead to non-serialized call sequences).
73 bool IsLegalizingCall;
76 Legal, // The target natively supports this operation.
77 Promote, // This operation should be executed in a larger type.
78 Expand // Try to expand this to other ops, otherwise use a libcall.
81 /// ValueTypeActions - This is a bitvector that contains two bits for each
82 /// value type, where the two bits correspond to the LegalizeAction enum.
83 /// This can be queried with "getTypeAction(VT)".
84 TargetLowering::ValueTypeActionImpl ValueTypeActions;
86 /// LegalizedNodes - For nodes that are of legal width, and that have more
87 /// than one use, this map indicates what regularized operand to use. This
88 /// allows us to avoid legalizing the same thing more than once.
89 DenseMap<SDValue, SDValue> LegalizedNodes;
91 void AddLegalizedOperand(SDValue From, SDValue To) {
92 LegalizedNodes.insert(std::make_pair(From, To));
93 // If someone requests legalization of the new node, return itself.
95 LegalizedNodes.insert(std::make_pair(To, To));
99 SelectionDAGLegalize(SelectionDAG &DAG, CodeGenOpt::Level ol);
101 /// getTypeAction - Return how we should legalize values of this type, either
102 /// it is already legal or we need to expand it into multiple registers of
103 /// smaller integer type, or we need to promote it to a larger type.
104 LegalizeAction getTypeAction(EVT VT) const {
106 (LegalizeAction)ValueTypeActions.getTypeAction(*DAG.getContext(), VT);
109 /// isTypeLegal - Return true if this type is legal on this target.
111 bool isTypeLegal(EVT VT) const {
112 return getTypeAction(VT) == Legal;
118 /// LegalizeOp - We know that the specified value has a legal type.
119 /// Recursively ensure that the operands have legal types, then return the
121 SDValue LegalizeOp(SDValue O);
123 SDValue OptimizeFloatStore(StoreSDNode *ST);
125 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
126 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
127 /// is necessary to spill the vector being inserted into to memory, perform
128 /// the insert there, and then read the result back.
129 SDValue PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val,
130 SDValue Idx, DebugLoc dl);
131 SDValue ExpandINSERT_VECTOR_ELT(SDValue Vec, SDValue Val,
132 SDValue Idx, DebugLoc dl);
134 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
135 /// performs the same shuffe in terms of order or result bytes, but on a type
136 /// whose vector element type is narrower than the original shuffle type.
137 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
138 SDValue ShuffleWithNarrowerEltType(EVT NVT, EVT VT, DebugLoc dl,
139 SDValue N1, SDValue N2,
140 SmallVectorImpl<int> &Mask) const;
142 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
143 SmallPtrSet<SDNode*, 32> &NodesLeadingTo);
145 void LegalizeSetCCCondCode(EVT VT, SDValue &LHS, SDValue &RHS, SDValue &CC,
148 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
149 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
150 RTLIB::Libcall Call_F64, RTLIB::Libcall Call_F80,
151 RTLIB::Libcall Call_PPCF128);
152 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned, RTLIB::Libcall Call_I16,
153 RTLIB::Libcall Call_I32, RTLIB::Libcall Call_I64,
154 RTLIB::Libcall Call_I128);
156 SDValue EmitStackConvert(SDValue SrcOp, EVT SlotVT, EVT DestVT, DebugLoc dl);
157 SDValue ExpandBUILD_VECTOR(SDNode *Node);
158 SDValue ExpandSCALAR_TO_VECTOR(SDNode *Node);
159 SDValue ExpandDBG_STOPPOINT(SDNode *Node);
160 void ExpandDYNAMIC_STACKALLOC(SDNode *Node,
161 SmallVectorImpl<SDValue> &Results);
162 SDValue ExpandFCOPYSIGN(SDNode *Node);
163 SDValue ExpandLegalINT_TO_FP(bool isSigned, SDValue LegalOp, EVT DestVT,
165 SDValue PromoteLegalINT_TO_FP(SDValue LegalOp, EVT DestVT, bool isSigned,
167 SDValue PromoteLegalFP_TO_INT(SDValue LegalOp, EVT DestVT, bool isSigned,
170 SDValue ExpandBSWAP(SDValue Op, DebugLoc dl);
171 SDValue ExpandBitCount(unsigned Opc, SDValue Op, DebugLoc dl);
173 SDValue ExpandExtractFromVectorThroughStack(SDValue Op);
174 SDValue ExpandVectorBuildThroughStack(SDNode* Node);
176 void ExpandNode(SDNode *Node, SmallVectorImpl<SDValue> &Results);
177 void PromoteNode(SDNode *Node, SmallVectorImpl<SDValue> &Results);
181 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
182 /// performs the same shuffe in terms of order or result bytes, but on a type
183 /// whose vector element type is narrower than the original shuffle type.
184 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
186 SelectionDAGLegalize::ShuffleWithNarrowerEltType(EVT NVT, EVT VT, DebugLoc dl,
187 SDValue N1, SDValue N2,
188 SmallVectorImpl<int> &Mask) const {
189 EVT EltVT = NVT.getVectorElementType();
190 unsigned NumMaskElts = VT.getVectorNumElements();
191 unsigned NumDestElts = NVT.getVectorNumElements();
192 unsigned NumEltsGrowth = NumDestElts / NumMaskElts;
194 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
196 if (NumEltsGrowth == 1)
197 return DAG.getVectorShuffle(NVT, dl, N1, N2, &Mask[0]);
199 SmallVector<int, 8> NewMask;
200 for (unsigned i = 0; i != NumMaskElts; ++i) {
202 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
204 NewMask.push_back(-1);
206 NewMask.push_back(Idx * NumEltsGrowth + j);
209 assert(NewMask.size() == NumDestElts && "Non-integer NumEltsGrowth?");
210 assert(TLI.isShuffleMaskLegal(NewMask, NVT) && "Shuffle not legal?");
211 return DAG.getVectorShuffle(NVT, dl, N1, N2, &NewMask[0]);
214 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag,
215 CodeGenOpt::Level ol)
216 : TLI(dag.getTargetLoweringInfo()), DAG(dag), OptLevel(ol),
217 ValueTypeActions(TLI.getValueTypeActions()) {
218 assert(MVT::LAST_VALUETYPE <= MVT::MAX_ALLOWED_VALUETYPE &&
219 "Too many value types for ValueTypeActions to hold!");
222 void SelectionDAGLegalize::LegalizeDAG() {
223 LastCALLSEQ_END = DAG.getEntryNode();
224 IsLegalizingCall = false;
226 // The legalize process is inherently a bottom-up recursive process (users
227 // legalize their uses before themselves). Given infinite stack space, we
228 // could just start legalizing on the root and traverse the whole graph. In
229 // practice however, this causes us to run out of stack space on large basic
230 // blocks. To avoid this problem, compute an ordering of the nodes where each
231 // node is only legalized after all of its operands are legalized.
232 DAG.AssignTopologicalOrder();
233 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
234 E = prior(DAG.allnodes_end()); I != next(E); ++I)
235 LegalizeOp(SDValue(I, 0));
237 // Finally, it's possible the root changed. Get the new root.
238 SDValue OldRoot = DAG.getRoot();
239 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
240 DAG.setRoot(LegalizedNodes[OldRoot]);
242 LegalizedNodes.clear();
244 // Remove dead nodes now.
245 DAG.RemoveDeadNodes();
249 /// FindCallEndFromCallStart - Given a chained node that is part of a call
250 /// sequence, find the CALLSEQ_END node that terminates the call sequence.
251 static SDNode *FindCallEndFromCallStart(SDNode *Node) {
252 if (Node->getOpcode() == ISD::CALLSEQ_END)
254 if (Node->use_empty())
255 return 0; // No CallSeqEnd
257 // The chain is usually at the end.
258 SDValue TheChain(Node, Node->getNumValues()-1);
259 if (TheChain.getValueType() != MVT::Other) {
260 // Sometimes it's at the beginning.
261 TheChain = SDValue(Node, 0);
262 if (TheChain.getValueType() != MVT::Other) {
263 // Otherwise, hunt for it.
264 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
265 if (Node->getValueType(i) == MVT::Other) {
266 TheChain = SDValue(Node, i);
270 // Otherwise, we walked into a node without a chain.
271 if (TheChain.getValueType() != MVT::Other)
276 for (SDNode::use_iterator UI = Node->use_begin(),
277 E = Node->use_end(); UI != E; ++UI) {
279 // Make sure to only follow users of our token chain.
281 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
282 if (User->getOperand(i) == TheChain)
283 if (SDNode *Result = FindCallEndFromCallStart(User))
289 /// FindCallStartFromCallEnd - Given a chained node that is part of a call
290 /// sequence, find the CALLSEQ_START node that initiates the call sequence.
291 static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
292 assert(Node && "Didn't find callseq_start for a call??");
293 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
295 assert(Node->getOperand(0).getValueType() == MVT::Other &&
296 "Node doesn't have a token chain argument!");
297 return FindCallStartFromCallEnd(Node->getOperand(0).getNode());
300 /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
301 /// see if any uses can reach Dest. If no dest operands can get to dest,
302 /// legalize them, legalize ourself, and return false, otherwise, return true.
304 /// Keep track of the nodes we fine that actually do lead to Dest in
305 /// NodesLeadingTo. This avoids retraversing them exponential number of times.
307 bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
308 SmallPtrSet<SDNode*, 32> &NodesLeadingTo) {
309 if (N == Dest) return true; // N certainly leads to Dest :)
311 // If we've already processed this node and it does lead to Dest, there is no
312 // need to reprocess it.
313 if (NodesLeadingTo.count(N)) return true;
315 // If the first result of this node has been already legalized, then it cannot
317 if (LegalizedNodes.count(SDValue(N, 0))) return false;
319 // Okay, this node has not already been legalized. Check and legalize all
320 // operands. If none lead to Dest, then we can legalize this node.
321 bool OperandsLeadToDest = false;
322 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
323 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
324 LegalizeAllNodesNotLeadingTo(N->getOperand(i).getNode(), Dest, NodesLeadingTo);
326 if (OperandsLeadToDest) {
327 NodesLeadingTo.insert(N);
331 // Okay, this node looks safe, legalize it and return false.
332 LegalizeOp(SDValue(N, 0));
336 /// ExpandConstantFP - Expands the ConstantFP node to an integer constant or
337 /// a load from the constant pool.
338 static SDValue ExpandConstantFP(ConstantFPSDNode *CFP, bool UseCP,
339 SelectionDAG &DAG, const TargetLowering &TLI) {
341 DebugLoc dl = CFP->getDebugLoc();
343 // If a FP immediate is precise when represented as a float and if the
344 // target can do an extending load from float to double, we put it into
345 // the constant pool as a float, even if it's is statically typed as a
346 // double. This shrinks FP constants and canonicalizes them for targets where
347 // an FP extending load is the same cost as a normal load (such as on the x87
348 // fp stack or PPC FP unit).
349 EVT VT = CFP->getValueType(0);
350 ConstantFP *LLVMC = const_cast<ConstantFP*>(CFP->getConstantFPValue());
352 assert((VT == MVT::f64 || VT == MVT::f32) && "Invalid type expansion");
353 return DAG.getConstant(LLVMC->getValueAPF().bitcastToAPInt(),
354 (VT == MVT::f64) ? MVT::i64 : MVT::i32);
359 while (SVT != MVT::f32) {
360 SVT = (MVT::SimpleValueType)(SVT.getSimpleVT().SimpleTy - 1);
361 if (CFP->isValueValidForType(SVT, CFP->getValueAPF()) &&
362 // Only do this if the target has a native EXTLOAD instruction from
364 TLI.isLoadExtLegal(ISD::EXTLOAD, SVT) &&
365 TLI.ShouldShrinkFPConstant(OrigVT)) {
366 const Type *SType = SVT.getTypeForEVT(*DAG.getContext());
367 LLVMC = cast<ConstantFP>(ConstantExpr::getFPTrunc(LLVMC, SType));
373 SDValue CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
374 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
376 return DAG.getExtLoad(ISD::EXTLOAD, dl,
377 OrigVT, DAG.getEntryNode(),
378 CPIdx, PseudoSourceValue::getConstantPool(),
379 0, VT, false, Alignment);
380 return DAG.getLoad(OrigVT, dl, DAG.getEntryNode(), CPIdx,
381 PseudoSourceValue::getConstantPool(), 0, false, Alignment);
384 /// ExpandUnalignedStore - Expands an unaligned store to 2 half-size stores.
386 SDValue ExpandUnalignedStore(StoreSDNode *ST, SelectionDAG &DAG,
387 const TargetLowering &TLI) {
388 SDValue Chain = ST->getChain();
389 SDValue Ptr = ST->getBasePtr();
390 SDValue Val = ST->getValue();
391 EVT VT = Val.getValueType();
392 int Alignment = ST->getAlignment();
393 int SVOffset = ST->getSrcValueOffset();
394 DebugLoc dl = ST->getDebugLoc();
395 if (ST->getMemoryVT().isFloatingPoint() ||
396 ST->getMemoryVT().isVector()) {
397 EVT intVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits());
398 if (TLI.isTypeLegal(intVT)) {
399 // Expand to a bitconvert of the value to the integer type of the
400 // same size, then a (misaligned) int store.
401 // FIXME: Does not handle truncating floating point stores!
402 SDValue Result = DAG.getNode(ISD::BIT_CONVERT, dl, intVT, Val);
403 return DAG.getStore(Chain, dl, Result, Ptr, ST->getSrcValue(),
404 SVOffset, ST->isVolatile(), Alignment);
406 // Do a (aligned) store to a stack slot, then copy from the stack slot
407 // to the final destination using (unaligned) integer loads and stores.
408 EVT StoredVT = ST->getMemoryVT();
410 TLI.getRegisterType(*DAG.getContext(), EVT::getIntegerVT(*DAG.getContext(), StoredVT.getSizeInBits()));
411 unsigned StoredBytes = StoredVT.getSizeInBits() / 8;
412 unsigned RegBytes = RegVT.getSizeInBits() / 8;
413 unsigned NumRegs = (StoredBytes + RegBytes - 1) / RegBytes;
415 // Make sure the stack slot is also aligned for the register type.
416 SDValue StackPtr = DAG.CreateStackTemporary(StoredVT, RegVT);
418 // Perform the original store, only redirected to the stack slot.
419 SDValue Store = DAG.getTruncStore(Chain, dl,
420 Val, StackPtr, NULL, 0, StoredVT);
421 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
422 SmallVector<SDValue, 8> Stores;
425 // Do all but one copies using the full register width.
426 for (unsigned i = 1; i < NumRegs; i++) {
427 // Load one integer register's worth from the stack slot.
428 SDValue Load = DAG.getLoad(RegVT, dl, Store, StackPtr, NULL, 0);
429 // Store it to the final location. Remember the store.
430 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr,
431 ST->getSrcValue(), SVOffset + Offset,
433 MinAlign(ST->getAlignment(), Offset)));
434 // Increment the pointers.
436 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
438 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
441 // The last store may be partial. Do a truncating store. On big-endian
442 // machines this requires an extending load from the stack slot to ensure
443 // that the bits are in the right place.
444 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(), 8 * (StoredBytes - Offset));
446 // Load from the stack slot.
447 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Store, StackPtr,
450 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, Ptr,
451 ST->getSrcValue(), SVOffset + Offset,
452 MemVT, ST->isVolatile(),
453 MinAlign(ST->getAlignment(), Offset)));
454 // The order of the stores doesn't matter - say it with a TokenFactor.
455 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
459 assert(ST->getMemoryVT().isInteger() &&
460 !ST->getMemoryVT().isVector() &&
461 "Unaligned store of unknown type.");
462 // Get the half-size VT
464 (MVT::SimpleValueType)(ST->getMemoryVT().getSimpleVT().SimpleTy - 1);
465 int NumBits = NewStoredVT.getSizeInBits();
466 int IncrementSize = NumBits / 8;
468 // Divide the stored value in two parts.
469 SDValue ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
471 SDValue Hi = DAG.getNode(ISD::SRL, dl, VT, Val, ShiftAmount);
473 // Store the two parts
474 SDValue Store1, Store2;
475 Store1 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Lo:Hi, Ptr,
476 ST->getSrcValue(), SVOffset, NewStoredVT,
477 ST->isVolatile(), Alignment);
478 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
479 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
480 Alignment = MinAlign(Alignment, IncrementSize);
481 Store2 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Hi:Lo, Ptr,
482 ST->getSrcValue(), SVOffset + IncrementSize,
483 NewStoredVT, ST->isVolatile(), Alignment);
485 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Store1, Store2);
488 /// ExpandUnalignedLoad - Expands an unaligned load to 2 half-size loads.
490 SDValue ExpandUnalignedLoad(LoadSDNode *LD, SelectionDAG &DAG,
491 const TargetLowering &TLI) {
492 int SVOffset = LD->getSrcValueOffset();
493 SDValue Chain = LD->getChain();
494 SDValue Ptr = LD->getBasePtr();
495 EVT VT = LD->getValueType(0);
496 EVT LoadedVT = LD->getMemoryVT();
497 DebugLoc dl = LD->getDebugLoc();
498 if (VT.isFloatingPoint() || VT.isVector()) {
499 EVT intVT = EVT::getIntegerVT(*DAG.getContext(), LoadedVT.getSizeInBits());
500 if (TLI.isTypeLegal(intVT)) {
501 // Expand to a (misaligned) integer load of the same size,
502 // then bitconvert to floating point or vector.
503 SDValue newLoad = DAG.getLoad(intVT, dl, Chain, Ptr, LD->getSrcValue(),
504 SVOffset, LD->isVolatile(),
506 SDValue Result = DAG.getNode(ISD::BIT_CONVERT, dl, LoadedVT, newLoad);
507 if (VT.isFloatingPoint() && LoadedVT != VT)
508 Result = DAG.getNode(ISD::FP_EXTEND, dl, VT, Result);
510 SDValue Ops[] = { Result, Chain };
511 return DAG.getMergeValues(Ops, 2, dl);
513 // Copy the value to a (aligned) stack slot using (unaligned) integer
514 // loads and stores, then do a (aligned) load from the stack slot.
515 EVT RegVT = TLI.getRegisterType(*DAG.getContext(), intVT);
516 unsigned LoadedBytes = LoadedVT.getSizeInBits() / 8;
517 unsigned RegBytes = RegVT.getSizeInBits() / 8;
518 unsigned NumRegs = (LoadedBytes + RegBytes - 1) / RegBytes;
520 // Make sure the stack slot is also aligned for the register type.
521 SDValue StackBase = DAG.CreateStackTemporary(LoadedVT, RegVT);
523 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
524 SmallVector<SDValue, 8> Stores;
525 SDValue StackPtr = StackBase;
528 // Do all but one copies using the full register width.
529 for (unsigned i = 1; i < NumRegs; i++) {
530 // Load one integer register's worth from the original location.
531 SDValue Load = DAG.getLoad(RegVT, dl, Chain, Ptr, LD->getSrcValue(),
532 SVOffset + Offset, LD->isVolatile(),
533 MinAlign(LD->getAlignment(), Offset));
534 // Follow the load with a store to the stack slot. Remember the store.
535 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, StackPtr,
537 // Increment the pointers.
539 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
540 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
544 // The last copy may be partial. Do an extending load.
545 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(), 8 * (LoadedBytes - Offset));
546 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Chain, Ptr,
547 LD->getSrcValue(), SVOffset + Offset,
548 MemVT, LD->isVolatile(),
549 MinAlign(LD->getAlignment(), Offset));
550 // Follow the load with a store to the stack slot. Remember the store.
551 // On big-endian machines this requires a truncating store to ensure
552 // that the bits end up in the right place.
553 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, StackPtr,
556 // The order of the stores doesn't matter - say it with a TokenFactor.
557 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
560 // Finally, perform the original load only redirected to the stack slot.
561 Load = DAG.getExtLoad(LD->getExtensionType(), dl, VT, TF, StackBase,
564 // Callers expect a MERGE_VALUES node.
565 SDValue Ops[] = { Load, TF };
566 return DAG.getMergeValues(Ops, 2, dl);
569 assert(LoadedVT.isInteger() && !LoadedVT.isVector() &&
570 "Unaligned load of unsupported type.");
572 // Compute the new VT that is half the size of the old one. This is an
574 unsigned NumBits = LoadedVT.getSizeInBits();
576 NewLoadedVT = EVT::getIntegerVT(*DAG.getContext(), NumBits/2);
579 unsigned Alignment = LD->getAlignment();
580 unsigned IncrementSize = NumBits / 8;
581 ISD::LoadExtType HiExtType = LD->getExtensionType();
583 // If the original load is NON_EXTLOAD, the hi part load must be ZEXTLOAD.
584 if (HiExtType == ISD::NON_EXTLOAD)
585 HiExtType = ISD::ZEXTLOAD;
587 // Load the value in two parts
589 if (TLI.isLittleEndian()) {
590 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr, LD->getSrcValue(),
591 SVOffset, NewLoadedVT, LD->isVolatile(), Alignment);
592 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
593 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
594 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr, LD->getSrcValue(),
595 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
596 MinAlign(Alignment, IncrementSize));
598 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr, LD->getSrcValue(),
599 SVOffset, NewLoadedVT, LD->isVolatile(), Alignment);
600 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
601 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
602 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr, LD->getSrcValue(),
603 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
604 MinAlign(Alignment, IncrementSize));
607 // aggregate the two parts
608 SDValue ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
609 SDValue Result = DAG.getNode(ISD::SHL, dl, VT, Hi, ShiftAmount);
610 Result = DAG.getNode(ISD::OR, dl, VT, Result, Lo);
612 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
615 SDValue Ops[] = { Result, TF };
616 return DAG.getMergeValues(Ops, 2, dl);
619 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
620 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
621 /// is necessary to spill the vector being inserted into to memory, perform
622 /// the insert there, and then read the result back.
623 SDValue SelectionDAGLegalize::
624 PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val, SDValue Idx,
630 // If the target doesn't support this, we have to spill the input vector
631 // to a temporary stack slot, update the element, then reload it. This is
632 // badness. We could also load the value into a vector register (either
633 // with a "move to register" or "extload into register" instruction, then
634 // permute it into place, if the idx is a constant and if the idx is
635 // supported by the target.
636 EVT VT = Tmp1.getValueType();
637 EVT EltVT = VT.getVectorElementType();
638 EVT IdxVT = Tmp3.getValueType();
639 EVT PtrVT = TLI.getPointerTy();
640 SDValue StackPtr = DAG.CreateStackTemporary(VT);
642 int SPFI = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex();
645 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Tmp1, StackPtr,
646 PseudoSourceValue::getFixedStack(SPFI), 0);
648 // Truncate or zero extend offset to target pointer type.
649 unsigned CastOpc = IdxVT.bitsGT(PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
650 Tmp3 = DAG.getNode(CastOpc, dl, PtrVT, Tmp3);
651 // Add the offset to the index.
652 unsigned EltSize = EltVT.getSizeInBits()/8;
653 Tmp3 = DAG.getNode(ISD::MUL, dl, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
654 SDValue StackPtr2 = DAG.getNode(ISD::ADD, dl, IdxVT, Tmp3, StackPtr);
655 // Store the scalar value.
656 Ch = DAG.getTruncStore(Ch, dl, Tmp2, StackPtr2,
657 PseudoSourceValue::getFixedStack(SPFI), 0, EltVT);
658 // Load the updated vector.
659 return DAG.getLoad(VT, dl, Ch, StackPtr,
660 PseudoSourceValue::getFixedStack(SPFI), 0);
664 SDValue SelectionDAGLegalize::
665 ExpandINSERT_VECTOR_ELT(SDValue Vec, SDValue Val, SDValue Idx, DebugLoc dl) {
666 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Idx)) {
667 // SCALAR_TO_VECTOR requires that the type of the value being inserted
668 // match the element type of the vector being created, except for
669 // integers in which case the inserted value can be over width.
670 EVT EltVT = Vec.getValueType().getVectorElementType();
671 if (Val.getValueType() == EltVT ||
672 (EltVT.isInteger() && Val.getValueType().bitsGE(EltVT))) {
673 SDValue ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
674 Vec.getValueType(), Val);
676 unsigned NumElts = Vec.getValueType().getVectorNumElements();
677 // We generate a shuffle of InVec and ScVec, so the shuffle mask
678 // should be 0,1,2,3,4,5... with the appropriate element replaced with
680 SmallVector<int, 8> ShufOps;
681 for (unsigned i = 0; i != NumElts; ++i)
682 ShufOps.push_back(i != InsertPos->getZExtValue() ? i : NumElts);
684 return DAG.getVectorShuffle(Vec.getValueType(), dl, Vec, ScVec,
688 return PerformInsertVectorEltInMemory(Vec, Val, Idx, dl);
691 SDValue SelectionDAGLegalize::OptimizeFloatStore(StoreSDNode* ST) {
692 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
693 // FIXME: We shouldn't do this for TargetConstantFP's.
694 // FIXME: move this to the DAG Combiner! Note that we can't regress due
695 // to phase ordering between legalized code and the dag combiner. This
696 // probably means that we need to integrate dag combiner and legalizer
698 // We generally can't do this one for long doubles.
699 SDValue Tmp1 = ST->getChain();
700 SDValue Tmp2 = ST->getBasePtr();
702 int SVOffset = ST->getSrcValueOffset();
703 unsigned Alignment = ST->getAlignment();
704 bool isVolatile = ST->isVolatile();
705 DebugLoc dl = ST->getDebugLoc();
706 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(ST->getValue())) {
707 if (CFP->getValueType(0) == MVT::f32 &&
708 getTypeAction(MVT::i32) == Legal) {
709 Tmp3 = DAG.getConstant(CFP->getValueAPF().
710 bitcastToAPInt().zextOrTrunc(32),
712 return DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
713 SVOffset, isVolatile, Alignment);
714 } else if (CFP->getValueType(0) == MVT::f64) {
715 // If this target supports 64-bit registers, do a single 64-bit store.
716 if (getTypeAction(MVT::i64) == Legal) {
717 Tmp3 = DAG.getConstant(CFP->getValueAPF().bitcastToAPInt().
718 zextOrTrunc(64), MVT::i64);
719 return DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
720 SVOffset, isVolatile, Alignment);
721 } else if (getTypeAction(MVT::i32) == Legal && !ST->isVolatile()) {
722 // Otherwise, if the target supports 32-bit registers, use 2 32-bit
723 // stores. If the target supports neither 32- nor 64-bits, this
724 // xform is certainly not worth it.
725 const APInt &IntVal =CFP->getValueAPF().bitcastToAPInt();
726 SDValue Lo = DAG.getConstant(APInt(IntVal).trunc(32), MVT::i32);
727 SDValue Hi = DAG.getConstant(IntVal.lshr(32).trunc(32), MVT::i32);
728 if (TLI.isBigEndian()) std::swap(Lo, Hi);
730 Lo = DAG.getStore(Tmp1, dl, Lo, Tmp2, ST->getSrcValue(),
731 SVOffset, isVolatile, Alignment);
732 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
733 DAG.getIntPtrConstant(4));
734 Hi = DAG.getStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(), SVOffset+4,
735 isVolatile, MinAlign(Alignment, 4U));
737 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
744 /// LegalizeOp - We know that the specified value has a legal type, and
745 /// that its operands are legal. Now ensure that the operation itself
746 /// is legal, recursively ensuring that the operands' operations remain
748 SDValue SelectionDAGLegalize::LegalizeOp(SDValue Op) {
749 if (Op.getOpcode() == ISD::TargetConstant) // Allow illegal target nodes.
752 SDNode *Node = Op.getNode();
753 DebugLoc dl = Node->getDebugLoc();
755 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
756 assert(getTypeAction(Node->getValueType(i)) == Legal &&
757 "Unexpected illegal type!");
759 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
760 assert((isTypeLegal(Node->getOperand(i).getValueType()) ||
761 Node->getOperand(i).getOpcode() == ISD::TargetConstant) &&
762 "Unexpected illegal type!");
764 // Note that LegalizeOp may be reentered even from single-use nodes, which
765 // means that we always must cache transformed nodes.
766 DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
767 if (I != LegalizedNodes.end()) return I->second;
769 SDValue Tmp1, Tmp2, Tmp3, Tmp4;
771 bool isCustom = false;
773 // Figure out the correct action; the way to query this varies by opcode
774 TargetLowering::LegalizeAction Action;
775 bool SimpleFinishLegalizing = true;
776 switch (Node->getOpcode()) {
777 case ISD::INTRINSIC_W_CHAIN:
778 case ISD::INTRINSIC_WO_CHAIN:
779 case ISD::INTRINSIC_VOID:
782 Action = TLI.getOperationAction(Node->getOpcode(), MVT::Other);
784 case ISD::SINT_TO_FP:
785 case ISD::UINT_TO_FP:
786 case ISD::EXTRACT_VECTOR_ELT:
787 Action = TLI.getOperationAction(Node->getOpcode(),
788 Node->getOperand(0).getValueType());
790 case ISD::FP_ROUND_INREG:
791 case ISD::SIGN_EXTEND_INREG: {
792 EVT InnerType = cast<VTSDNode>(Node->getOperand(1))->getVT();
793 Action = TLI.getOperationAction(Node->getOpcode(), InnerType);
799 unsigned CCOperand = Node->getOpcode() == ISD::SELECT_CC ? 4 :
800 Node->getOpcode() == ISD::SETCC ? 2 : 1;
801 unsigned CompareOperand = Node->getOpcode() == ISD::BR_CC ? 2 : 0;
802 EVT OpVT = Node->getOperand(CompareOperand).getValueType();
803 ISD::CondCode CCCode =
804 cast<CondCodeSDNode>(Node->getOperand(CCOperand))->get();
805 Action = TLI.getCondCodeAction(CCCode, OpVT);
806 if (Action == TargetLowering::Legal) {
807 if (Node->getOpcode() == ISD::SELECT_CC)
808 Action = TLI.getOperationAction(Node->getOpcode(),
809 Node->getValueType(0));
811 Action = TLI.getOperationAction(Node->getOpcode(), OpVT);
817 // FIXME: Model these properly. LOAD and STORE are complicated, and
818 // STORE expects the unlegalized operand in some cases.
819 SimpleFinishLegalizing = false;
821 case ISD::CALLSEQ_START:
822 case ISD::CALLSEQ_END:
823 // FIXME: This shouldn't be necessary. These nodes have special properties
824 // dealing with the recursive nature of legalization. Removing this
825 // special case should be done as part of making LegalizeDAG non-recursive.
826 SimpleFinishLegalizing = false;
828 case ISD::EXTRACT_ELEMENT:
829 case ISD::FLT_ROUNDS_:
837 case ISD::MERGE_VALUES:
839 case ISD::FRAME_TO_ARGS_OFFSET:
840 // These operations lie about being legal: when they claim to be legal,
841 // they should actually be expanded.
842 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
843 if (Action == TargetLowering::Legal)
844 Action = TargetLowering::Expand;
846 case ISD::TRAMPOLINE:
848 case ISD::RETURNADDR:
849 // These operations lie about being legal: when they claim to be legal,
850 // they should actually be custom-lowered.
851 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
852 if (Action == TargetLowering::Legal)
853 Action = TargetLowering::Custom;
855 case ISD::BUILD_VECTOR:
856 // A weird case: legalization for BUILD_VECTOR never legalizes the
858 // FIXME: This really sucks... changing it isn't semantically incorrect,
859 // but it massively pessimizes the code for floating-point BUILD_VECTORs
860 // because ConstantFP operands get legalized into constant pool loads
861 // before the BUILD_VECTOR code can see them. It doesn't usually bite,
862 // though, because BUILD_VECTORS usually get lowered into other nodes
863 // which get legalized properly.
864 SimpleFinishLegalizing = false;
867 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
868 Action = TargetLowering::Legal;
870 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
875 if (SimpleFinishLegalizing) {
876 SmallVector<SDValue, 8> Ops, ResultVals;
877 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
878 Ops.push_back(LegalizeOp(Node->getOperand(i)));
879 switch (Node->getOpcode()) {
886 // Branches tweak the chain to include LastCALLSEQ_END
887 Ops[0] = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ops[0],
889 Ops[0] = LegalizeOp(Ops[0]);
890 LastCALLSEQ_END = DAG.getEntryNode();
897 // Legalizing shifts/rotates requires adjusting the shift amount
898 // to the appropriate width.
899 if (!Ops[1].getValueType().isVector())
900 Ops[1] = LegalizeOp(DAG.getShiftAmountOperand(Ops[1]));
905 // Legalizing shifts/rotates requires adjusting the shift amount
906 // to the appropriate width.
907 if (!Ops[2].getValueType().isVector())
908 Ops[2] = LegalizeOp(DAG.getShiftAmountOperand(Ops[2]));
912 Result = DAG.UpdateNodeOperands(Result.getValue(0), Ops.data(),
915 case TargetLowering::Legal:
916 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
917 ResultVals.push_back(Result.getValue(i));
919 case TargetLowering::Custom:
920 // FIXME: The handling for custom lowering with multiple results is
922 Tmp1 = TLI.LowerOperation(Result, DAG);
923 if (Tmp1.getNode()) {
924 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
926 ResultVals.push_back(Tmp1);
928 ResultVals.push_back(Tmp1.getValue(i));
934 case TargetLowering::Expand:
935 ExpandNode(Result.getNode(), ResultVals);
937 case TargetLowering::Promote:
938 PromoteNode(Result.getNode(), ResultVals);
941 if (!ResultVals.empty()) {
942 for (unsigned i = 0, e = ResultVals.size(); i != e; ++i) {
943 if (ResultVals[i] != SDValue(Node, i))
944 ResultVals[i] = LegalizeOp(ResultVals[i]);
945 AddLegalizedOperand(SDValue(Node, i), ResultVals[i]);
947 return ResultVals[Op.getResNo()];
951 switch (Node->getOpcode()) {
958 llvm_unreachable("Do not know how to legalize this operator!");
960 case ISD::BUILD_VECTOR:
961 switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) {
962 default: llvm_unreachable("This action is not supported yet!");
963 case TargetLowering::Custom:
964 Tmp3 = TLI.LowerOperation(Result, DAG);
965 if (Tmp3.getNode()) {
970 case TargetLowering::Expand:
971 Result = ExpandBUILD_VECTOR(Result.getNode());
975 case ISD::CALLSEQ_START: {
976 SDNode *CallEnd = FindCallEndFromCallStart(Node);
978 // Recursively Legalize all of the inputs of the call end that do not lead
979 // to this call start. This ensures that any libcalls that need be inserted
980 // are inserted *before* the CALLSEQ_START.
981 {SmallPtrSet<SDNode*, 32> NodesLeadingTo;
982 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
983 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).getNode(), Node,
987 // Now that we legalized all of the inputs (which may have inserted
988 // libcalls) create the new CALLSEQ_START node.
989 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
991 // Merge in the last call, to ensure that this call start after the last
993 if (LastCALLSEQ_END.getOpcode() != ISD::EntryToken) {
994 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
995 Tmp1, LastCALLSEQ_END);
996 Tmp1 = LegalizeOp(Tmp1);
999 // Do not try to legalize the target-specific arguments (#1+).
1000 if (Tmp1 != Node->getOperand(0)) {
1001 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1003 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1006 // Remember that the CALLSEQ_START is legalized.
1007 AddLegalizedOperand(Op.getValue(0), Result);
1008 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
1009 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1011 // Now that the callseq_start and all of the non-call nodes above this call
1012 // sequence have been legalized, legalize the call itself. During this
1013 // process, no libcalls can/will be inserted, guaranteeing that no calls
1015 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
1016 // Note that we are selecting this call!
1017 LastCALLSEQ_END = SDValue(CallEnd, 0);
1018 IsLegalizingCall = true;
1020 // Legalize the call, starting from the CALLSEQ_END.
1021 LegalizeOp(LastCALLSEQ_END);
1022 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
1025 case ISD::CALLSEQ_END:
1026 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
1027 // will cause this node to be legalized as well as handling libcalls right.
1028 if (LastCALLSEQ_END.getNode() != Node) {
1029 LegalizeOp(SDValue(FindCallStartFromCallEnd(Node), 0));
1030 DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
1031 assert(I != LegalizedNodes.end() &&
1032 "Legalizing the call start should have legalized this node!");
1036 // Otherwise, the call start has been legalized and everything is going
1037 // according to plan. Just legalize ourselves normally here.
1038 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1039 // Do not try to legalize the target-specific arguments (#1+), except for
1040 // an optional flag input.
1041 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
1042 if (Tmp1 != Node->getOperand(0)) {
1043 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1045 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1048 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
1049 if (Tmp1 != Node->getOperand(0) ||
1050 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
1051 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1054 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1057 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
1058 // This finishes up call legalization.
1059 IsLegalizingCall = false;
1061 // If the CALLSEQ_END node has a flag, remember that we legalized it.
1062 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
1063 if (Node->getNumValues() == 2)
1064 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
1065 return Result.getValue(Op.getResNo());
1067 LoadSDNode *LD = cast<LoadSDNode>(Node);
1068 Tmp1 = LegalizeOp(LD->getChain()); // Legalize the chain.
1069 Tmp2 = LegalizeOp(LD->getBasePtr()); // Legalize the base pointer.
1071 ISD::LoadExtType ExtType = LD->getExtensionType();
1072 if (ExtType == ISD::NON_EXTLOAD) {
1073 EVT VT = Node->getValueType(0);
1074 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1075 Tmp3 = Result.getValue(0);
1076 Tmp4 = Result.getValue(1);
1078 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1079 default: llvm_unreachable("This action is not supported yet!");
1080 case TargetLowering::Legal:
1081 // If this is an unaligned load and the target doesn't support it,
1083 if (!TLI.allowsUnalignedMemoryAccesses(LD->getMemoryVT())) {
1084 const Type *Ty = LD->getMemoryVT().getTypeForEVT(*DAG.getContext());
1085 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1086 if (LD->getAlignment() < ABIAlignment){
1087 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.getNode()),
1089 Tmp3 = Result.getOperand(0);
1090 Tmp4 = Result.getOperand(1);
1091 Tmp3 = LegalizeOp(Tmp3);
1092 Tmp4 = LegalizeOp(Tmp4);
1096 case TargetLowering::Custom:
1097 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
1098 if (Tmp1.getNode()) {
1099 Tmp3 = LegalizeOp(Tmp1);
1100 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1103 case TargetLowering::Promote: {
1104 // Only promote a load of vector type to another.
1105 assert(VT.isVector() && "Cannot promote this load!");
1106 // Change base type to a different vector type.
1107 EVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
1109 Tmp1 = DAG.getLoad(NVT, dl, Tmp1, Tmp2, LD->getSrcValue(),
1110 LD->getSrcValueOffset(),
1111 LD->isVolatile(), LD->getAlignment());
1112 Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, dl, VT, Tmp1));
1113 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1117 // Since loads produce two values, make sure to remember that we
1118 // legalized both of them.
1119 AddLegalizedOperand(SDValue(Node, 0), Tmp3);
1120 AddLegalizedOperand(SDValue(Node, 1), Tmp4);
1121 return Op.getResNo() ? Tmp4 : Tmp3;
1123 EVT SrcVT = LD->getMemoryVT();
1124 unsigned SrcWidth = SrcVT.getSizeInBits();
1125 int SVOffset = LD->getSrcValueOffset();
1126 unsigned Alignment = LD->getAlignment();
1127 bool isVolatile = LD->isVolatile();
1129 if (SrcWidth != SrcVT.getStoreSizeInBits() &&
1130 // Some targets pretend to have an i1 loading operation, and actually
1131 // load an i8. This trick is correct for ZEXTLOAD because the top 7
1132 // bits are guaranteed to be zero; it helps the optimizers understand
1133 // that these bits are zero. It is also useful for EXTLOAD, since it
1134 // tells the optimizers that those bits are undefined. It would be
1135 // nice to have an effective generic way of getting these benefits...
1136 // Until such a way is found, don't insist on promoting i1 here.
1137 (SrcVT != MVT::i1 ||
1138 TLI.getLoadExtAction(ExtType, MVT::i1) == TargetLowering::Promote)) {
1139 // Promote to a byte-sized load if not loading an integral number of
1140 // bytes. For example, promote EXTLOAD:i20 -> EXTLOAD:i24.
1141 unsigned NewWidth = SrcVT.getStoreSizeInBits();
1142 EVT NVT = EVT::getIntegerVT(*DAG.getContext(), NewWidth);
1145 // The extra bits are guaranteed to be zero, since we stored them that
1146 // way. A zext load from NVT thus automatically gives zext from SrcVT.
1148 ISD::LoadExtType NewExtType =
1149 ExtType == ISD::ZEXTLOAD ? ISD::ZEXTLOAD : ISD::EXTLOAD;
1151 Result = DAG.getExtLoad(NewExtType, dl, Node->getValueType(0),
1152 Tmp1, Tmp2, LD->getSrcValue(), SVOffset,
1153 NVT, isVolatile, Alignment);
1155 Ch = Result.getValue(1); // The chain.
1157 if (ExtType == ISD::SEXTLOAD)
1158 // Having the top bits zero doesn't help when sign extending.
1159 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
1160 Result.getValueType(),
1161 Result, DAG.getValueType(SrcVT));
1162 else if (ExtType == ISD::ZEXTLOAD || NVT == Result.getValueType())
1163 // All the top bits are guaranteed to be zero - inform the optimizers.
1164 Result = DAG.getNode(ISD::AssertZext, dl,
1165 Result.getValueType(), Result,
1166 DAG.getValueType(SrcVT));
1168 Tmp1 = LegalizeOp(Result);
1169 Tmp2 = LegalizeOp(Ch);
1170 } else if (SrcWidth & (SrcWidth - 1)) {
1171 // If not loading a power-of-2 number of bits, expand as two loads.
1172 assert(SrcVT.isExtended() && !SrcVT.isVector() &&
1173 "Unsupported extload!");
1174 unsigned RoundWidth = 1 << Log2_32(SrcWidth);
1175 assert(RoundWidth < SrcWidth);
1176 unsigned ExtraWidth = SrcWidth - RoundWidth;
1177 assert(ExtraWidth < RoundWidth);
1178 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
1179 "Load size not an integral number of bytes!");
1180 EVT RoundVT = EVT::getIntegerVT(*DAG.getContext(), RoundWidth);
1181 EVT ExtraVT = EVT::getIntegerVT(*DAG.getContext(), ExtraWidth);
1183 unsigned IncrementSize;
1185 if (TLI.isLittleEndian()) {
1186 // EXTLOAD:i24 -> ZEXTLOAD:i16 | (shl EXTLOAD@+2:i8, 16)
1187 // Load the bottom RoundWidth bits.
1188 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl,
1189 Node->getValueType(0), Tmp1, Tmp2,
1190 LD->getSrcValue(), SVOffset, RoundVT, isVolatile,
1193 // Load the remaining ExtraWidth bits.
1194 IncrementSize = RoundWidth / 8;
1195 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1196 DAG.getIntPtrConstant(IncrementSize));
1197 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
1198 LD->getSrcValue(), SVOffset + IncrementSize,
1199 ExtraVT, isVolatile,
1200 MinAlign(Alignment, IncrementSize));
1202 // Build a factor node to remember that this load is independent of the
1204 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1207 // Move the top bits to the right place.
1208 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
1209 DAG.getConstant(RoundWidth, TLI.getShiftAmountTy()));
1211 // Join the hi and lo parts.
1212 Result = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
1214 // Big endian - avoid unaligned loads.
1215 // EXTLOAD:i24 -> (shl EXTLOAD:i16, 8) | ZEXTLOAD@+2:i8
1216 // Load the top RoundWidth bits.
1217 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
1218 LD->getSrcValue(), SVOffset, RoundVT, isVolatile,
1221 // Load the remaining ExtraWidth bits.
1222 IncrementSize = RoundWidth / 8;
1223 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1224 DAG.getIntPtrConstant(IncrementSize));
1225 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl,
1226 Node->getValueType(0), Tmp1, Tmp2,
1227 LD->getSrcValue(), SVOffset + IncrementSize,
1228 ExtraVT, isVolatile,
1229 MinAlign(Alignment, IncrementSize));
1231 // Build a factor node to remember that this load is independent of the
1233 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1236 // Move the top bits to the right place.
1237 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
1238 DAG.getConstant(ExtraWidth, TLI.getShiftAmountTy()));
1240 // Join the hi and lo parts.
1241 Result = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
1244 Tmp1 = LegalizeOp(Result);
1245 Tmp2 = LegalizeOp(Ch);
1247 switch (TLI.getLoadExtAction(ExtType, SrcVT)) {
1248 default: llvm_unreachable("This action is not supported yet!");
1249 case TargetLowering::Custom:
1252 case TargetLowering::Legal:
1253 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1254 Tmp1 = Result.getValue(0);
1255 Tmp2 = Result.getValue(1);
1258 Tmp3 = TLI.LowerOperation(Result, DAG);
1259 if (Tmp3.getNode()) {
1260 Tmp1 = LegalizeOp(Tmp3);
1261 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1264 // If this is an unaligned load and the target doesn't support it,
1266 if (!TLI.allowsUnalignedMemoryAccesses(LD->getMemoryVT())) {
1267 const Type *Ty = LD->getMemoryVT().getTypeForEVT(*DAG.getContext());
1268 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1269 if (LD->getAlignment() < ABIAlignment){
1270 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.getNode()),
1272 Tmp1 = Result.getOperand(0);
1273 Tmp2 = Result.getOperand(1);
1274 Tmp1 = LegalizeOp(Tmp1);
1275 Tmp2 = LegalizeOp(Tmp2);
1280 case TargetLowering::Expand:
1281 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
1282 if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) {
1283 SDValue Load = DAG.getLoad(SrcVT, dl, Tmp1, Tmp2, LD->getSrcValue(),
1284 LD->getSrcValueOffset(),
1285 LD->isVolatile(), LD->getAlignment());
1286 Result = DAG.getNode(ISD::FP_EXTEND, dl,
1287 Node->getValueType(0), Load);
1288 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
1289 Tmp2 = LegalizeOp(Load.getValue(1));
1292 assert(ExtType != ISD::EXTLOAD &&"EXTLOAD should always be supported!");
1293 // Turn the unsupported load into an EXTLOAD followed by an explicit
1294 // zero/sign extend inreg.
1295 Result = DAG.getExtLoad(ISD::EXTLOAD, dl, Node->getValueType(0),
1296 Tmp1, Tmp2, LD->getSrcValue(),
1297 LD->getSrcValueOffset(), SrcVT,
1298 LD->isVolatile(), LD->getAlignment());
1300 if (ExtType == ISD::SEXTLOAD)
1301 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
1302 Result.getValueType(),
1303 Result, DAG.getValueType(SrcVT));
1305 ValRes = DAG.getZeroExtendInReg(Result, dl, SrcVT);
1306 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
1307 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
1312 // Since loads produce two values, make sure to remember that we legalized
1314 AddLegalizedOperand(SDValue(Node, 0), Tmp1);
1315 AddLegalizedOperand(SDValue(Node, 1), Tmp2);
1316 return Op.getResNo() ? Tmp2 : Tmp1;
1320 StoreSDNode *ST = cast<StoreSDNode>(Node);
1321 Tmp1 = LegalizeOp(ST->getChain()); // Legalize the chain.
1322 Tmp2 = LegalizeOp(ST->getBasePtr()); // Legalize the pointer.
1323 int SVOffset = ST->getSrcValueOffset();
1324 unsigned Alignment = ST->getAlignment();
1325 bool isVolatile = ST->isVolatile();
1327 if (!ST->isTruncatingStore()) {
1328 if (SDNode *OptStore = OptimizeFloatStore(ST).getNode()) {
1329 Result = SDValue(OptStore, 0);
1334 Tmp3 = LegalizeOp(ST->getValue());
1335 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1338 EVT VT = Tmp3.getValueType();
1339 switch (TLI.getOperationAction(ISD::STORE, VT)) {
1340 default: llvm_unreachable("This action is not supported yet!");
1341 case TargetLowering::Legal:
1342 // If this is an unaligned store and the target doesn't support it,
1344 if (!TLI.allowsUnalignedMemoryAccesses(ST->getMemoryVT())) {
1345 const Type *Ty = ST->getMemoryVT().getTypeForEVT(*DAG.getContext());
1346 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1347 if (ST->getAlignment() < ABIAlignment)
1348 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.getNode()),
1352 case TargetLowering::Custom:
1353 Tmp1 = TLI.LowerOperation(Result, DAG);
1354 if (Tmp1.getNode()) Result = Tmp1;
1356 case TargetLowering::Promote:
1357 assert(VT.isVector() && "Unknown legal promote case!");
1358 Tmp3 = DAG.getNode(ISD::BIT_CONVERT, dl,
1359 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
1360 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2,
1361 ST->getSrcValue(), SVOffset, isVolatile,
1368 Tmp3 = LegalizeOp(ST->getValue());
1370 EVT StVT = ST->getMemoryVT();
1371 unsigned StWidth = StVT.getSizeInBits();
1373 if (StWidth != StVT.getStoreSizeInBits()) {
1374 // Promote to a byte-sized store with upper bits zero if not
1375 // storing an integral number of bytes. For example, promote
1376 // TRUNCSTORE:i1 X -> TRUNCSTORE:i8 (and X, 1)
1377 EVT NVT = EVT::getIntegerVT(*DAG.getContext(), StVT.getStoreSizeInBits());
1378 Tmp3 = DAG.getZeroExtendInReg(Tmp3, dl, StVT);
1379 Result = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1380 SVOffset, NVT, isVolatile, Alignment);
1381 } else if (StWidth & (StWidth - 1)) {
1382 // If not storing a power-of-2 number of bits, expand as two stores.
1383 assert(StVT.isExtended() && !StVT.isVector() &&
1384 "Unsupported truncstore!");
1385 unsigned RoundWidth = 1 << Log2_32(StWidth);
1386 assert(RoundWidth < StWidth);
1387 unsigned ExtraWidth = StWidth - RoundWidth;
1388 assert(ExtraWidth < RoundWidth);
1389 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
1390 "Store size not an integral number of bytes!");
1391 EVT RoundVT = EVT::getIntegerVT(*DAG.getContext(), RoundWidth);
1392 EVT ExtraVT = EVT::getIntegerVT(*DAG.getContext(), ExtraWidth);
1394 unsigned IncrementSize;
1396 if (TLI.isLittleEndian()) {
1397 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 X, TRUNCSTORE@+2:i8 (srl X, 16)
1398 // Store the bottom RoundWidth bits.
1399 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1401 isVolatile, Alignment);
1403 // Store the remaining ExtraWidth bits.
1404 IncrementSize = RoundWidth / 8;
1405 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1406 DAG.getIntPtrConstant(IncrementSize));
1407 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
1408 DAG.getConstant(RoundWidth, TLI.getShiftAmountTy()));
1409 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(),
1410 SVOffset + IncrementSize, ExtraVT, isVolatile,
1411 MinAlign(Alignment, IncrementSize));
1413 // Big endian - avoid unaligned stores.
1414 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 (srl X, 8), TRUNCSTORE@+2:i8 X
1415 // Store the top RoundWidth bits.
1416 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
1417 DAG.getConstant(ExtraWidth, TLI.getShiftAmountTy()));
1418 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(),
1419 SVOffset, RoundVT, isVolatile, Alignment);
1421 // Store the remaining ExtraWidth bits.
1422 IncrementSize = RoundWidth / 8;
1423 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1424 DAG.getIntPtrConstant(IncrementSize));
1425 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1426 SVOffset + IncrementSize, ExtraVT, isVolatile,
1427 MinAlign(Alignment, IncrementSize));
1430 // The order of the stores doesn't matter.
1431 Result = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
1433 if (Tmp1 != ST->getChain() || Tmp3 != ST->getValue() ||
1434 Tmp2 != ST->getBasePtr())
1435 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1438 switch (TLI.getTruncStoreAction(ST->getValue().getValueType(), StVT)) {
1439 default: llvm_unreachable("This action is not supported yet!");
1440 case TargetLowering::Legal:
1441 // If this is an unaligned store and the target doesn't support it,
1443 if (!TLI.allowsUnalignedMemoryAccesses(ST->getMemoryVT())) {
1444 const Type *Ty = ST->getMemoryVT().getTypeForEVT(*DAG.getContext());
1445 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1446 if (ST->getAlignment() < ABIAlignment)
1447 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.getNode()),
1451 case TargetLowering::Custom:
1452 Result = TLI.LowerOperation(Result, DAG);
1455 // TRUNCSTORE:i16 i32 -> STORE i16
1456 assert(isTypeLegal(StVT) && "Do not know how to expand this store!");
1457 Tmp3 = DAG.getNode(ISD::TRUNCATE, dl, StVT, Tmp3);
1458 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1459 SVOffset, isVolatile, Alignment);
1467 assert(Result.getValueType() == Op.getValueType() &&
1468 "Bad legalization!");
1470 // Make sure that the generated code is itself legal.
1472 Result = LegalizeOp(Result);
1474 // Note that LegalizeOp may be reentered even from single-use nodes, which
1475 // means that we always must cache transformed nodes.
1476 AddLegalizedOperand(Op, Result);
1480 SDValue SelectionDAGLegalize::ExpandExtractFromVectorThroughStack(SDValue Op) {
1481 SDValue Vec = Op.getOperand(0);
1482 SDValue Idx = Op.getOperand(1);
1483 DebugLoc dl = Op.getDebugLoc();
1484 // Store the value to a temporary stack slot, then LOAD the returned part.
1485 SDValue StackPtr = DAG.CreateStackTemporary(Vec.getValueType());
1486 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, NULL, 0);
1488 // Add the offset to the index.
1490 Vec.getValueType().getVectorElementType().getSizeInBits()/8;
1491 Idx = DAG.getNode(ISD::MUL, dl, Idx.getValueType(), Idx,
1492 DAG.getConstant(EltSize, Idx.getValueType()));
1494 if (Idx.getValueType().bitsGT(TLI.getPointerTy()))
1495 Idx = DAG.getNode(ISD::TRUNCATE, dl, TLI.getPointerTy(), Idx);
1497 Idx = DAG.getNode(ISD::ZERO_EXTEND, dl, TLI.getPointerTy(), Idx);
1499 StackPtr = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx, StackPtr);
1501 if (Op.getValueType().isVector())
1502 return DAG.getLoad(Op.getValueType(), dl, Ch, StackPtr, NULL, 0);
1504 return DAG.getExtLoad(ISD::EXTLOAD, dl, Op.getValueType(), Ch, StackPtr,
1505 NULL, 0, Vec.getValueType().getVectorElementType());
1508 SDValue SelectionDAGLegalize::ExpandVectorBuildThroughStack(SDNode* Node) {
1509 // We can't handle this case efficiently. Allocate a sufficiently
1510 // aligned object on the stack, store each element into it, then load
1511 // the result as a vector.
1512 // Create the stack frame object.
1513 EVT VT = Node->getValueType(0);
1514 EVT OpVT = Node->getOperand(0).getValueType();
1515 DebugLoc dl = Node->getDebugLoc();
1516 SDValue FIPtr = DAG.CreateStackTemporary(VT);
1517 int FI = cast<FrameIndexSDNode>(FIPtr.getNode())->getIndex();
1518 const Value *SV = PseudoSourceValue::getFixedStack(FI);
1520 // Emit a store of each element to the stack slot.
1521 SmallVector<SDValue, 8> Stores;
1522 unsigned TypeByteSize = OpVT.getSizeInBits() / 8;
1523 // Store (in the right endianness) the elements to memory.
1524 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1525 // Ignore undef elements.
1526 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
1528 unsigned Offset = TypeByteSize*i;
1530 SDValue Idx = DAG.getConstant(Offset, FIPtr.getValueType());
1531 Idx = DAG.getNode(ISD::ADD, dl, FIPtr.getValueType(), FIPtr, Idx);
1533 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl, Node->getOperand(i),
1538 if (!Stores.empty()) // Not all undef elements?
1539 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
1540 &Stores[0], Stores.size());
1542 StoreChain = DAG.getEntryNode();
1544 // Result is a load from the stack slot.
1545 return DAG.getLoad(VT, dl, StoreChain, FIPtr, SV, 0);
1548 SDValue SelectionDAGLegalize::ExpandFCOPYSIGN(SDNode* Node) {
1549 DebugLoc dl = Node->getDebugLoc();
1550 SDValue Tmp1 = Node->getOperand(0);
1551 SDValue Tmp2 = Node->getOperand(1);
1552 assert((Tmp2.getValueType() == MVT::f32 ||
1553 Tmp2.getValueType() == MVT::f64) &&
1554 "Ugly special-cased code!");
1555 // Get the sign bit of the RHS.
1557 EVT IVT = Tmp2.getValueType() == MVT::f64 ? MVT::i64 : MVT::i32;
1558 if (isTypeLegal(IVT)) {
1559 SignBit = DAG.getNode(ISD::BIT_CONVERT, dl, IVT, Tmp2);
1561 assert(isTypeLegal(TLI.getPointerTy()) &&
1562 (TLI.getPointerTy() == MVT::i32 ||
1563 TLI.getPointerTy() == MVT::i64) &&
1564 "Legal type for load?!");
1565 SDValue StackPtr = DAG.CreateStackTemporary(Tmp2.getValueType());
1566 SDValue StorePtr = StackPtr, LoadPtr = StackPtr;
1568 DAG.getStore(DAG.getEntryNode(), dl, Tmp2, StorePtr, NULL, 0);
1569 if (Tmp2.getValueType() == MVT::f64 && TLI.isLittleEndian())
1570 LoadPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(),
1571 LoadPtr, DAG.getIntPtrConstant(4));
1572 SignBit = DAG.getExtLoad(ISD::SEXTLOAD, dl, TLI.getPointerTy(),
1573 Ch, LoadPtr, NULL, 0, MVT::i32);
1576 DAG.getSetCC(dl, TLI.getSetCCResultType(SignBit.getValueType()),
1577 SignBit, DAG.getConstant(0, SignBit.getValueType()),
1579 // Get the absolute value of the result.
1580 SDValue AbsVal = DAG.getNode(ISD::FABS, dl, Tmp1.getValueType(), Tmp1);
1581 // Select between the nabs and abs value based on the sign bit of
1583 return DAG.getNode(ISD::SELECT, dl, AbsVal.getValueType(), SignBit,
1584 DAG.getNode(ISD::FNEG, dl, AbsVal.getValueType(), AbsVal),
1588 SDValue SelectionDAGLegalize::ExpandDBG_STOPPOINT(SDNode* Node) {
1589 DebugLoc dl = Node->getDebugLoc();
1590 DwarfWriter *DW = DAG.getDwarfWriter();
1591 bool useDEBUG_LOC = TLI.isOperationLegalOrCustom(ISD::DEBUG_LOC,
1593 bool useLABEL = TLI.isOperationLegalOrCustom(ISD::DBG_LABEL, MVT::Other);
1595 const DbgStopPointSDNode *DSP = cast<DbgStopPointSDNode>(Node);
1596 GlobalVariable *CU_GV = cast<GlobalVariable>(DSP->getCompileUnit());
1597 if (DW && (useDEBUG_LOC || useLABEL) && !CU_GV->isDeclaration()) {
1598 DICompileUnit CU(cast<GlobalVariable>(DSP->getCompileUnit()));
1600 unsigned Line = DSP->getLine();
1601 unsigned Col = DSP->getColumn();
1603 if (OptLevel == CodeGenOpt::None) {
1604 // A bit self-referential to have DebugLoc on Debug_Loc nodes, but it
1605 // won't hurt anything.
1607 return DAG.getNode(ISD::DEBUG_LOC, dl, MVT::Other, Node->getOperand(0),
1608 DAG.getConstant(Line, MVT::i32),
1609 DAG.getConstant(Col, MVT::i32),
1610 DAG.getSrcValue(CU.getGV()));
1612 unsigned ID = DW->RecordSourceLine(Line, Col, CU);
1613 return DAG.getLabel(ISD::DBG_LABEL, dl, Node->getOperand(0), ID);
1617 return Node->getOperand(0);
1620 void SelectionDAGLegalize::ExpandDYNAMIC_STACKALLOC(SDNode* Node,
1621 SmallVectorImpl<SDValue> &Results) {
1622 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1623 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1624 " not tell us which reg is the stack pointer!");
1625 DebugLoc dl = Node->getDebugLoc();
1626 EVT VT = Node->getValueType(0);
1627 SDValue Tmp1 = SDValue(Node, 0);
1628 SDValue Tmp2 = SDValue(Node, 1);
1629 SDValue Tmp3 = Node->getOperand(2);
1630 SDValue Chain = Tmp1.getOperand(0);
1632 // Chain the dynamic stack allocation so that it doesn't modify the stack
1633 // pointer when other instructions are using the stack.
1634 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true));
1636 SDValue Size = Tmp2.getOperand(1);
1637 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
1638 Chain = SP.getValue(1);
1639 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
1640 unsigned StackAlign =
1641 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
1642 if (Align > StackAlign)
1643 SP = DAG.getNode(ISD::AND, dl, VT, SP,
1644 DAG.getConstant(-(uint64_t)Align, VT));
1645 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
1646 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
1648 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
1649 DAG.getIntPtrConstant(0, true), SDValue());
1651 Results.push_back(Tmp1);
1652 Results.push_back(Tmp2);
1655 /// LegalizeSetCCCondCode - Legalize a SETCC with given LHS and RHS and
1656 /// condition code CC on the current target. This routine assumes LHS and rHS
1657 /// have already been legalized by LegalizeSetCCOperands. It expands SETCC with
1658 /// illegal condition code into AND / OR of multiple SETCC values.
1659 void SelectionDAGLegalize::LegalizeSetCCCondCode(EVT VT,
1660 SDValue &LHS, SDValue &RHS,
1663 EVT OpVT = LHS.getValueType();
1664 ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get();
1665 switch (TLI.getCondCodeAction(CCCode, OpVT)) {
1666 default: llvm_unreachable("Unknown condition code action!");
1667 case TargetLowering::Legal:
1670 case TargetLowering::Expand: {
1671 ISD::CondCode CC1 = ISD::SETCC_INVALID, CC2 = ISD::SETCC_INVALID;
1674 default: llvm_unreachable("Don't know how to expand this condition!");
1675 case ISD::SETOEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETO; Opc = ISD::AND; break;
1676 case ISD::SETOGT: CC1 = ISD::SETGT; CC2 = ISD::SETO; Opc = ISD::AND; break;
1677 case ISD::SETOGE: CC1 = ISD::SETGE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1678 case ISD::SETOLT: CC1 = ISD::SETLT; CC2 = ISD::SETO; Opc = ISD::AND; break;
1679 case ISD::SETOLE: CC1 = ISD::SETLE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1680 case ISD::SETONE: CC1 = ISD::SETNE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1681 case ISD::SETUEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1682 case ISD::SETUGT: CC1 = ISD::SETGT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1683 case ISD::SETUGE: CC1 = ISD::SETGE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1684 case ISD::SETULT: CC1 = ISD::SETLT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1685 case ISD::SETULE: CC1 = ISD::SETLE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1686 case ISD::SETUNE: CC1 = ISD::SETNE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1687 // FIXME: Implement more expansions.
1690 SDValue SetCC1 = DAG.getSetCC(dl, VT, LHS, RHS, CC1);
1691 SDValue SetCC2 = DAG.getSetCC(dl, VT, LHS, RHS, CC2);
1692 LHS = DAG.getNode(Opc, dl, VT, SetCC1, SetCC2);
1700 /// EmitStackConvert - Emit a store/load combination to the stack. This stores
1701 /// SrcOp to a stack slot of type SlotVT, truncating it if needed. It then does
1702 /// a load from the stack slot to DestVT, extending it if needed.
1703 /// The resultant code need not be legal.
1704 SDValue SelectionDAGLegalize::EmitStackConvert(SDValue SrcOp,
1708 // Create the stack frame object.
1710 TLI.getTargetData()->getPrefTypeAlignment(SrcOp.getValueType().
1711 getTypeForEVT(*DAG.getContext()));
1712 SDValue FIPtr = DAG.CreateStackTemporary(SlotVT, SrcAlign);
1714 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(FIPtr);
1715 int SPFI = StackPtrFI->getIndex();
1716 const Value *SV = PseudoSourceValue::getFixedStack(SPFI);
1718 unsigned SrcSize = SrcOp.getValueType().getSizeInBits();
1719 unsigned SlotSize = SlotVT.getSizeInBits();
1720 unsigned DestSize = DestVT.getSizeInBits();
1721 unsigned DestAlign =
1722 TLI.getTargetData()->getPrefTypeAlignment(DestVT.getTypeForEVT(*DAG.getContext()));
1724 // Emit a store to the stack slot. Use a truncstore if the input value is
1725 // later than DestVT.
1728 if (SrcSize > SlotSize)
1729 Store = DAG.getTruncStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
1730 SV, 0, SlotVT, false, SrcAlign);
1732 assert(SrcSize == SlotSize && "Invalid store");
1733 Store = DAG.getStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
1734 SV, 0, false, SrcAlign);
1737 // Result is a load from the stack slot.
1738 if (SlotSize == DestSize)
1739 return DAG.getLoad(DestVT, dl, Store, FIPtr, SV, 0, false, DestAlign);
1741 assert(SlotSize < DestSize && "Unknown extension!");
1742 return DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT, Store, FIPtr, SV, 0, SlotVT,
1746 SDValue SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
1747 DebugLoc dl = Node->getDebugLoc();
1748 // Create a vector sized/aligned stack slot, store the value to element #0,
1749 // then load the whole vector back out.
1750 SDValue StackPtr = DAG.CreateStackTemporary(Node->getValueType(0));
1752 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(StackPtr);
1753 int SPFI = StackPtrFI->getIndex();
1755 SDValue Ch = DAG.getTruncStore(DAG.getEntryNode(), dl, Node->getOperand(0),
1757 PseudoSourceValue::getFixedStack(SPFI), 0,
1758 Node->getValueType(0).getVectorElementType());
1759 return DAG.getLoad(Node->getValueType(0), dl, Ch, StackPtr,
1760 PseudoSourceValue::getFixedStack(SPFI), 0);
1764 /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
1765 /// support the operation, but do support the resultant vector type.
1766 SDValue SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
1767 unsigned NumElems = Node->getNumOperands();
1768 SDValue Value1, Value2;
1769 DebugLoc dl = Node->getDebugLoc();
1770 EVT VT = Node->getValueType(0);
1771 EVT OpVT = Node->getOperand(0).getValueType();
1772 EVT EltVT = VT.getVectorElementType();
1774 // If the only non-undef value is the low element, turn this into a
1775 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
1776 bool isOnlyLowElement = true;
1777 bool MoreThanTwoValues = false;
1778 bool isConstant = true;
1779 for (unsigned i = 0; i < NumElems; ++i) {
1780 SDValue V = Node->getOperand(i);
1781 if (V.getOpcode() == ISD::UNDEF)
1784 isOnlyLowElement = false;
1785 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V))
1788 if (!Value1.getNode()) {
1790 } else if (!Value2.getNode()) {
1793 } else if (V != Value1 && V != Value2) {
1794 MoreThanTwoValues = true;
1798 if (!Value1.getNode())
1799 return DAG.getUNDEF(VT);
1801 if (isOnlyLowElement)
1802 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Node->getOperand(0));
1804 // If all elements are constants, create a load from the constant pool.
1806 std::vector<Constant*> CV;
1807 for (unsigned i = 0, e = NumElems; i != e; ++i) {
1808 if (ConstantFPSDNode *V =
1809 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
1810 CV.push_back(const_cast<ConstantFP *>(V->getConstantFPValue()));
1811 } else if (ConstantSDNode *V =
1812 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
1813 CV.push_back(const_cast<ConstantInt *>(V->getConstantIntValue()));
1815 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
1816 const Type *OpNTy = OpVT.getTypeForEVT(*DAG.getContext());
1817 CV.push_back(UndefValue::get(OpNTy));
1820 Constant *CP = ConstantVector::get(CV);
1821 SDValue CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
1822 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
1823 return DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
1824 PseudoSourceValue::getConstantPool(), 0,
1828 if (!MoreThanTwoValues) {
1829 SmallVector<int, 8> ShuffleVec(NumElems, -1);
1830 for (unsigned i = 0; i < NumElems; ++i) {
1831 SDValue V = Node->getOperand(i);
1832 if (V.getOpcode() == ISD::UNDEF)
1834 ShuffleVec[i] = V == Value1 ? 0 : NumElems;
1836 if (TLI.isShuffleMaskLegal(ShuffleVec, Node->getValueType(0))) {
1837 // Get the splatted value into the low element of a vector register.
1838 SDValue Vec1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Value1);
1840 if (Value2.getNode())
1841 Vec2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Value2);
1843 Vec2 = DAG.getUNDEF(VT);
1845 // Return shuffle(LowValVec, undef, <0,0,0,0>)
1846 return DAG.getVectorShuffle(VT, dl, Vec1, Vec2, ShuffleVec.data());
1850 // Otherwise, we can't handle this case efficiently.
1851 return ExpandVectorBuildThroughStack(Node);
1854 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
1855 // does not fit into a register, return the lo part and set the hi part to the
1856 // by-reg argument. If it does fit into a single register, return the result
1857 // and leave the Hi part unset.
1858 SDValue SelectionDAGLegalize::ExpandLibCall(RTLIB::Libcall LC, SDNode *Node,
1860 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
1861 // The input chain to this libcall is the entry node of the function.
1862 // Legalizing the call will automatically add the previous call to the
1864 SDValue InChain = DAG.getEntryNode();
1866 TargetLowering::ArgListTy Args;
1867 TargetLowering::ArgListEntry Entry;
1868 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1869 EVT ArgVT = Node->getOperand(i).getValueType();
1870 const Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
1871 Entry.Node = Node->getOperand(i); Entry.Ty = ArgTy;
1872 Entry.isSExt = isSigned;
1873 Entry.isZExt = !isSigned;
1874 Args.push_back(Entry);
1876 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC),
1877 TLI.getPointerTy());
1879 // Splice the libcall in wherever FindInputOutputChains tells us to.
1880 const Type *RetTy = Node->getValueType(0).getTypeForEVT(*DAG.getContext());
1881 std::pair<SDValue, SDValue> CallInfo =
1882 TLI.LowerCallTo(InChain, RetTy, isSigned, !isSigned, false, false,
1883 0, TLI.getLibcallCallingConv(LC), false,
1884 /*isReturnValueUsed=*/true,
1886 Node->getDebugLoc());
1888 // Legalize the call sequence, starting with the chain. This will advance
1889 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
1890 // was added by LowerCallTo (guaranteeing proper serialization of calls).
1891 LegalizeOp(CallInfo.second);
1892 return CallInfo.first;
1895 SDValue SelectionDAGLegalize::ExpandFPLibCall(SDNode* Node,
1896 RTLIB::Libcall Call_F32,
1897 RTLIB::Libcall Call_F64,
1898 RTLIB::Libcall Call_F80,
1899 RTLIB::Libcall Call_PPCF128) {
1901 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1902 default: llvm_unreachable("Unexpected request for libcall!");
1903 case MVT::f32: LC = Call_F32; break;
1904 case MVT::f64: LC = Call_F64; break;
1905 case MVT::f80: LC = Call_F80; break;
1906 case MVT::ppcf128: LC = Call_PPCF128; break;
1908 return ExpandLibCall(LC, Node, false);
1911 SDValue SelectionDAGLegalize::ExpandIntLibCall(SDNode* Node, bool isSigned,
1912 RTLIB::Libcall Call_I16,
1913 RTLIB::Libcall Call_I32,
1914 RTLIB::Libcall Call_I64,
1915 RTLIB::Libcall Call_I128) {
1917 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1918 default: llvm_unreachable("Unexpected request for libcall!");
1919 case MVT::i16: LC = Call_I16; break;
1920 case MVT::i32: LC = Call_I32; break;
1921 case MVT::i64: LC = Call_I64; break;
1922 case MVT::i128: LC = Call_I128; break;
1924 return ExpandLibCall(LC, Node, isSigned);
1927 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
1928 /// INT_TO_FP operation of the specified operand when the target requests that
1929 /// we expand it. At this point, we know that the result and operand types are
1930 /// legal for the target.
1931 SDValue SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
1935 if (Op0.getValueType() == MVT::i32) {
1936 // simple 32-bit [signed|unsigned] integer to float/double expansion
1938 // Get the stack frame index of a 8 byte buffer.
1939 SDValue StackSlot = DAG.CreateStackTemporary(MVT::f64);
1941 // word offset constant for Hi/Lo address computation
1942 SDValue WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
1943 // set up Hi and Lo (into buffer) address based on endian
1944 SDValue Hi = StackSlot;
1945 SDValue Lo = DAG.getNode(ISD::ADD, dl,
1946 TLI.getPointerTy(), StackSlot, WordOff);
1947 if (TLI.isLittleEndian())
1950 // if signed map to unsigned space
1953 // constant used to invert sign bit (signed to unsigned mapping)
1954 SDValue SignBit = DAG.getConstant(0x80000000u, MVT::i32);
1955 Op0Mapped = DAG.getNode(ISD::XOR, dl, MVT::i32, Op0, SignBit);
1959 // store the lo of the constructed double - based on integer input
1960 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl,
1961 Op0Mapped, Lo, NULL, 0);
1962 // initial hi portion of constructed double
1963 SDValue InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
1964 // store the hi of the constructed double - biased exponent
1965 SDValue Store2=DAG.getStore(Store1, dl, InitialHi, Hi, NULL, 0);
1966 // load the constructed double
1967 SDValue Load = DAG.getLoad(MVT::f64, dl, Store2, StackSlot, NULL, 0);
1968 // FP constant to bias correct the final result
1969 SDValue Bias = DAG.getConstantFP(isSigned ?
1970 BitsToDouble(0x4330000080000000ULL) :
1971 BitsToDouble(0x4330000000000000ULL),
1973 // subtract the bias
1974 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Load, Bias);
1977 // handle final rounding
1978 if (DestVT == MVT::f64) {
1981 } else if (DestVT.bitsLT(MVT::f64)) {
1982 Result = DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
1983 DAG.getIntPtrConstant(0));
1984 } else if (DestVT.bitsGT(MVT::f64)) {
1985 Result = DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
1989 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
1990 SDValue Tmp1 = DAG.getNode(ISD::SINT_TO_FP, dl, DestVT, Op0);
1992 SDValue SignSet = DAG.getSetCC(dl, TLI.getSetCCResultType(Op0.getValueType()),
1993 Op0, DAG.getConstant(0, Op0.getValueType()),
1995 SDValue Zero = DAG.getIntPtrConstant(0), Four = DAG.getIntPtrConstant(4);
1996 SDValue CstOffset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(),
1997 SignSet, Four, Zero);
1999 // If the sign bit of the integer is set, the large number will be treated
2000 // as a negative number. To counteract this, the dynamic code adds an
2001 // offset depending on the data type.
2003 switch (Op0.getValueType().getSimpleVT().SimpleTy) {
2004 default: llvm_unreachable("Unsupported integer type!");
2005 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
2006 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
2007 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
2008 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
2010 if (TLI.isLittleEndian()) FF <<= 32;
2011 Constant *FudgeFactor = ConstantInt::get(
2012 Type::getInt64Ty(*DAG.getContext()), FF);
2014 SDValue CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
2015 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
2016 CPIdx = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), CPIdx, CstOffset);
2017 Alignment = std::min(Alignment, 4u);
2019 if (DestVT == MVT::f32)
2020 FudgeInReg = DAG.getLoad(MVT::f32, dl, DAG.getEntryNode(), CPIdx,
2021 PseudoSourceValue::getConstantPool(), 0,
2025 LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT,
2026 DAG.getEntryNode(), CPIdx,
2027 PseudoSourceValue::getConstantPool(), 0,
2028 MVT::f32, false, Alignment));
2031 return DAG.getNode(ISD::FADD, dl, DestVT, Tmp1, FudgeInReg);
2034 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
2035 /// *INT_TO_FP operation of the specified operand when the target requests that
2036 /// we promote it. At this point, we know that the result and operand types are
2037 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
2038 /// operation that takes a larger input.
2039 SDValue SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDValue LegalOp,
2043 // First step, figure out the appropriate *INT_TO_FP operation to use.
2044 EVT NewInTy = LegalOp.getValueType();
2046 unsigned OpToUse = 0;
2048 // Scan for the appropriate larger type to use.
2050 NewInTy = (MVT::SimpleValueType)(NewInTy.getSimpleVT().SimpleTy+1);
2051 assert(NewInTy.isInteger() && "Ran out of possibilities!");
2053 // If the target supports SINT_TO_FP of this type, use it.
2054 if (TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, NewInTy)) {
2055 OpToUse = ISD::SINT_TO_FP;
2058 if (isSigned) continue;
2060 // If the target supports UINT_TO_FP of this type, use it.
2061 if (TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, NewInTy)) {
2062 OpToUse = ISD::UINT_TO_FP;
2066 // Otherwise, try a larger type.
2069 // Okay, we found the operation and type to use. Zero extend our input to the
2070 // desired type then run the operation on it.
2071 return DAG.getNode(OpToUse, dl, DestVT,
2072 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
2073 dl, NewInTy, LegalOp));
2076 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
2077 /// FP_TO_*INT operation of the specified operand when the target requests that
2078 /// we promote it. At this point, we know that the result and operand types are
2079 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
2080 /// operation that returns a larger result.
2081 SDValue SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDValue LegalOp,
2085 // First step, figure out the appropriate FP_TO*INT operation to use.
2086 EVT NewOutTy = DestVT;
2088 unsigned OpToUse = 0;
2090 // Scan for the appropriate larger type to use.
2092 NewOutTy = (MVT::SimpleValueType)(NewOutTy.getSimpleVT().SimpleTy+1);
2093 assert(NewOutTy.isInteger() && "Ran out of possibilities!");
2095 if (TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NewOutTy)) {
2096 OpToUse = ISD::FP_TO_SINT;
2100 if (TLI.isOperationLegalOrCustom(ISD::FP_TO_UINT, NewOutTy)) {
2101 OpToUse = ISD::FP_TO_UINT;
2105 // Otherwise, try a larger type.
2109 // Okay, we found the operation and type to use.
2110 SDValue Operation = DAG.getNode(OpToUse, dl, NewOutTy, LegalOp);
2112 // Truncate the result of the extended FP_TO_*INT operation to the desired
2114 return DAG.getNode(ISD::TRUNCATE, dl, DestVT, Operation);
2117 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
2119 SDValue SelectionDAGLegalize::ExpandBSWAP(SDValue Op, DebugLoc dl) {
2120 EVT VT = Op.getValueType();
2121 EVT SHVT = TLI.getShiftAmountTy();
2122 SDValue Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
2123 switch (VT.getSimpleVT().SimpleTy) {
2124 default: llvm_unreachable("Unhandled Expand type in BSWAP!");
2126 Tmp2 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2127 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2128 return DAG.getNode(ISD::OR, dl, VT, Tmp1, Tmp2);
2130 Tmp4 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
2131 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2132 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2133 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
2134 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
2135 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(0xFF00, VT));
2136 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
2137 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
2138 return DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
2140 Tmp8 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(56, SHVT));
2141 Tmp7 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(40, SHVT));
2142 Tmp6 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
2143 Tmp5 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2144 Tmp4 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2145 Tmp3 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
2146 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(40, SHVT));
2147 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(56, SHVT));
2148 Tmp7 = DAG.getNode(ISD::AND, dl, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
2149 Tmp6 = DAG.getNode(ISD::AND, dl, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
2150 Tmp5 = DAG.getNode(ISD::AND, dl, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
2151 Tmp4 = DAG.getNode(ISD::AND, dl, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
2152 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
2153 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
2154 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp7);
2155 Tmp6 = DAG.getNode(ISD::OR, dl, VT, Tmp6, Tmp5);
2156 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
2157 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
2158 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp6);
2159 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
2160 return DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp4);
2164 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
2166 SDValue SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDValue Op,
2169 default: llvm_unreachable("Cannot expand this yet!");
2171 static const uint64_t mask[6] = {
2172 0x5555555555555555ULL, 0x3333333333333333ULL,
2173 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
2174 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
2176 EVT VT = Op.getValueType();
2177 EVT ShVT = TLI.getShiftAmountTy();
2178 unsigned len = VT.getSizeInBits();
2179 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
2180 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
2181 unsigned EltSize = VT.isVector() ?
2182 VT.getVectorElementType().getSizeInBits() : len;
2183 SDValue Tmp2 = DAG.getConstant(APInt(EltSize, mask[i]), VT);
2184 SDValue Tmp3 = DAG.getConstant(1ULL << i, ShVT);
2185 Op = DAG.getNode(ISD::ADD, dl, VT,
2186 DAG.getNode(ISD::AND, dl, VT, Op, Tmp2),
2187 DAG.getNode(ISD::AND, dl, VT,
2188 DAG.getNode(ISD::SRL, dl, VT, Op, Tmp3),
2194 // for now, we do this:
2195 // x = x | (x >> 1);
2196 // x = x | (x >> 2);
2198 // x = x | (x >>16);
2199 // x = x | (x >>32); // for 64-bit input
2200 // return popcount(~x);
2202 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
2203 EVT VT = Op.getValueType();
2204 EVT ShVT = TLI.getShiftAmountTy();
2205 unsigned len = VT.getSizeInBits();
2206 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
2207 SDValue Tmp3 = DAG.getConstant(1ULL << i, ShVT);
2208 Op = DAG.getNode(ISD::OR, dl, VT, Op,
2209 DAG.getNode(ISD::SRL, dl, VT, Op, Tmp3));
2211 Op = DAG.getNOT(dl, Op, VT);
2212 return DAG.getNode(ISD::CTPOP, dl, VT, Op);
2215 // for now, we use: { return popcount(~x & (x - 1)); }
2216 // unless the target has ctlz but not ctpop, in which case we use:
2217 // { return 32 - nlz(~x & (x-1)); }
2218 // see also http://www.hackersdelight.org/HDcode/ntz.cc
2219 EVT VT = Op.getValueType();
2220 SDValue Tmp3 = DAG.getNode(ISD::AND, dl, VT,
2221 DAG.getNOT(dl, Op, VT),
2222 DAG.getNode(ISD::SUB, dl, VT, Op,
2223 DAG.getConstant(1, VT)));
2224 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
2225 if (!TLI.isOperationLegalOrCustom(ISD::CTPOP, VT) &&
2226 TLI.isOperationLegalOrCustom(ISD::CTLZ, VT))
2227 return DAG.getNode(ISD::SUB, dl, VT,
2228 DAG.getConstant(VT.getSizeInBits(), VT),
2229 DAG.getNode(ISD::CTLZ, dl, VT, Tmp3));
2230 return DAG.getNode(ISD::CTPOP, dl, VT, Tmp3);
2235 void SelectionDAGLegalize::ExpandNode(SDNode *Node,
2236 SmallVectorImpl<SDValue> &Results) {
2237 DebugLoc dl = Node->getDebugLoc();
2238 SDValue Tmp1, Tmp2, Tmp3, Tmp4;
2239 switch (Node->getOpcode()) {
2243 Tmp1 = ExpandBitCount(Node->getOpcode(), Node->getOperand(0), dl);
2244 Results.push_back(Tmp1);
2247 Results.push_back(ExpandBSWAP(Node->getOperand(0), dl));
2249 case ISD::FRAMEADDR:
2250 case ISD::RETURNADDR:
2251 case ISD::FRAME_TO_ARGS_OFFSET:
2252 Results.push_back(DAG.getConstant(0, Node->getValueType(0)));
2254 case ISD::FLT_ROUNDS_:
2255 Results.push_back(DAG.getConstant(1, Node->getValueType(0)));
2257 case ISD::EH_RETURN:
2258 case ISD::DBG_LABEL:
2261 case ISD::MEMBARRIER:
2263 Results.push_back(Node->getOperand(0));
2265 case ISD::DBG_STOPPOINT:
2266 Results.push_back(ExpandDBG_STOPPOINT(Node));
2268 case ISD::DYNAMIC_STACKALLOC:
2269 ExpandDYNAMIC_STACKALLOC(Node, Results);
2271 case ISD::MERGE_VALUES:
2272 for (unsigned i = 0; i < Node->getNumValues(); i++)
2273 Results.push_back(Node->getOperand(i));
2276 EVT VT = Node->getValueType(0);
2278 Results.push_back(DAG.getConstant(0, VT));
2279 else if (VT.isFloatingPoint())
2280 Results.push_back(DAG.getConstantFP(0, VT));
2282 llvm_unreachable("Unknown value type!");
2286 // If this operation is not supported, lower it to 'abort()' call
2287 TargetLowering::ArgListTy Args;
2288 std::pair<SDValue, SDValue> CallResult =
2289 TLI.LowerCallTo(Node->getOperand(0), Type::getVoidTy(*DAG.getContext()),
2290 false, false, false, false, 0, CallingConv::C, false,
2291 /*isReturnValueUsed=*/true,
2292 DAG.getExternalSymbol("abort", TLI.getPointerTy()),
2294 Results.push_back(CallResult.second);
2298 case ISD::BIT_CONVERT:
2299 Tmp1 = EmitStackConvert(Node->getOperand(0), Node->getValueType(0),
2300 Node->getValueType(0), dl);
2301 Results.push_back(Tmp1);
2303 case ISD::FP_EXTEND:
2304 Tmp1 = EmitStackConvert(Node->getOperand(0),
2305 Node->getOperand(0).getValueType(),
2306 Node->getValueType(0), dl);
2307 Results.push_back(Tmp1);
2309 case ISD::SIGN_EXTEND_INREG: {
2310 // NOTE: we could fall back on load/store here too for targets without
2311 // SAR. However, it is doubtful that any exist.
2312 EVT ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2313 unsigned BitsDiff = Node->getValueType(0).getSizeInBits() -
2314 ExtraVT.getSizeInBits();
2315 SDValue ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy());
2316 Tmp1 = DAG.getNode(ISD::SHL, dl, Node->getValueType(0),
2317 Node->getOperand(0), ShiftCst);
2318 Tmp1 = DAG.getNode(ISD::SRA, dl, Node->getValueType(0), Tmp1, ShiftCst);
2319 Results.push_back(Tmp1);
2322 case ISD::FP_ROUND_INREG: {
2323 // The only way we can lower this is to turn it into a TRUNCSTORE,
2324 // EXTLOAD pair, targetting a temporary location (a stack slot).
2326 // NOTE: there is a choice here between constantly creating new stack
2327 // slots and always reusing the same one. We currently always create
2328 // new ones, as reuse may inhibit scheduling.
2329 EVT ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2330 Tmp1 = EmitStackConvert(Node->getOperand(0), ExtraVT,
2331 Node->getValueType(0), dl);
2332 Results.push_back(Tmp1);
2335 case ISD::SINT_TO_FP:
2336 case ISD::UINT_TO_FP:
2337 Tmp1 = ExpandLegalINT_TO_FP(Node->getOpcode() == ISD::SINT_TO_FP,
2338 Node->getOperand(0), Node->getValueType(0), dl);
2339 Results.push_back(Tmp1);
2341 case ISD::FP_TO_UINT: {
2342 SDValue True, False;
2343 EVT VT = Node->getOperand(0).getValueType();
2344 EVT NVT = Node->getValueType(0);
2345 const uint64_t zero[] = {0, 0};
2346 APFloat apf = APFloat(APInt(VT.getSizeInBits(), 2, zero));
2347 APInt x = APInt::getSignBit(NVT.getSizeInBits());
2348 (void)apf.convertFromAPInt(x, false, APFloat::rmNearestTiesToEven);
2349 Tmp1 = DAG.getConstantFP(apf, VT);
2350 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(VT),
2351 Node->getOperand(0),
2353 True = DAG.getNode(ISD::FP_TO_SINT, dl, NVT, Node->getOperand(0));
2354 False = DAG.getNode(ISD::FP_TO_SINT, dl, NVT,
2355 DAG.getNode(ISD::FSUB, dl, VT,
2356 Node->getOperand(0), Tmp1));
2357 False = DAG.getNode(ISD::XOR, dl, NVT, False,
2358 DAG.getConstant(x, NVT));
2359 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2, True, False);
2360 Results.push_back(Tmp1);
2364 const Value *V = cast<SrcValueSDNode>(Node->getOperand(2))->getValue();
2365 EVT VT = Node->getValueType(0);
2366 Tmp1 = Node->getOperand(0);
2367 Tmp2 = Node->getOperand(1);
2368 SDValue VAList = DAG.getLoad(TLI.getPointerTy(), dl, Tmp1, Tmp2, V, 0);
2369 // Increment the pointer, VAList, to the next vaarg
2370 Tmp3 = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), VAList,
2371 DAG.getConstant(TLI.getTargetData()->
2372 getTypeAllocSize(VT.getTypeForEVT(*DAG.getContext())),
2373 TLI.getPointerTy()));
2374 // Store the incremented VAList to the legalized pointer
2375 Tmp3 = DAG.getStore(VAList.getValue(1), dl, Tmp3, Tmp2, V, 0);
2376 // Load the actual argument out of the pointer VAList
2377 Results.push_back(DAG.getLoad(VT, dl, Tmp3, VAList, NULL, 0));
2378 Results.push_back(Results[0].getValue(1));
2382 // This defaults to loading a pointer from the input and storing it to the
2383 // output, returning the chain.
2384 const Value *VD = cast<SrcValueSDNode>(Node->getOperand(3))->getValue();
2385 const Value *VS = cast<SrcValueSDNode>(Node->getOperand(4))->getValue();
2386 Tmp1 = DAG.getLoad(TLI.getPointerTy(), dl, Node->getOperand(0),
2387 Node->getOperand(2), VS, 0);
2388 Tmp1 = DAG.getStore(Tmp1.getValue(1), dl, Tmp1, Node->getOperand(1), VD, 0);
2389 Results.push_back(Tmp1);
2392 case ISD::EXTRACT_VECTOR_ELT:
2393 if (Node->getOperand(0).getValueType().getVectorNumElements() == 1)
2394 // This must be an access of the only element. Return it.
2395 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, Node->getValueType(0),
2396 Node->getOperand(0));
2398 Tmp1 = ExpandExtractFromVectorThroughStack(SDValue(Node, 0));
2399 Results.push_back(Tmp1);
2401 case ISD::EXTRACT_SUBVECTOR:
2402 Results.push_back(ExpandExtractFromVectorThroughStack(SDValue(Node, 0)));
2404 case ISD::CONCAT_VECTORS: {
2405 Results.push_back(ExpandVectorBuildThroughStack(Node));
2408 case ISD::SCALAR_TO_VECTOR:
2409 Results.push_back(ExpandSCALAR_TO_VECTOR(Node));
2411 case ISD::INSERT_VECTOR_ELT:
2412 Results.push_back(ExpandINSERT_VECTOR_ELT(Node->getOperand(0),
2413 Node->getOperand(1),
2414 Node->getOperand(2), dl));
2416 case ISD::VECTOR_SHUFFLE: {
2417 SmallVector<int, 8> Mask;
2418 cast<ShuffleVectorSDNode>(Node)->getMask(Mask);
2420 EVT VT = Node->getValueType(0);
2421 EVT EltVT = VT.getVectorElementType();
2422 unsigned NumElems = VT.getVectorNumElements();
2423 SmallVector<SDValue, 8> Ops;
2424 for (unsigned i = 0; i != NumElems; ++i) {
2426 Ops.push_back(DAG.getUNDEF(EltVT));
2429 unsigned Idx = Mask[i];
2431 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
2432 Node->getOperand(0),
2433 DAG.getIntPtrConstant(Idx)));
2435 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
2436 Node->getOperand(1),
2437 DAG.getIntPtrConstant(Idx - NumElems)));
2439 Tmp1 = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, &Ops[0], Ops.size());
2440 Results.push_back(Tmp1);
2443 case ISD::EXTRACT_ELEMENT: {
2444 EVT OpTy = Node->getOperand(0).getValueType();
2445 if (cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue()) {
2447 Tmp1 = DAG.getNode(ISD::SRL, dl, OpTy, Node->getOperand(0),
2448 DAG.getConstant(OpTy.getSizeInBits()/2,
2449 TLI.getShiftAmountTy()));
2450 Tmp1 = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0), Tmp1);
2453 Tmp1 = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0),
2454 Node->getOperand(0));
2456 Results.push_back(Tmp1);
2459 case ISD::STACKSAVE:
2460 // Expand to CopyFromReg if the target set
2461 // StackPointerRegisterToSaveRestore.
2462 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2463 Results.push_back(DAG.getCopyFromReg(Node->getOperand(0), dl, SP,
2464 Node->getValueType(0)));
2465 Results.push_back(Results[0].getValue(1));
2467 Results.push_back(DAG.getUNDEF(Node->getValueType(0)));
2468 Results.push_back(Node->getOperand(0));
2471 case ISD::STACKRESTORE:
2472 // Expand to CopyToReg if the target set
2473 // StackPointerRegisterToSaveRestore.
2474 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2475 Results.push_back(DAG.getCopyToReg(Node->getOperand(0), dl, SP,
2476 Node->getOperand(1)));
2478 Results.push_back(Node->getOperand(0));
2481 case ISD::FCOPYSIGN:
2482 Results.push_back(ExpandFCOPYSIGN(Node));
2485 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
2486 Tmp1 = DAG.getConstantFP(-0.0, Node->getValueType(0));
2487 Tmp1 = DAG.getNode(ISD::FSUB, dl, Node->getValueType(0), Tmp1,
2488 Node->getOperand(0));
2489 Results.push_back(Tmp1);
2492 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
2493 EVT VT = Node->getValueType(0);
2494 Tmp1 = Node->getOperand(0);
2495 Tmp2 = DAG.getConstantFP(0.0, VT);
2496 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(Tmp1.getValueType()),
2497 Tmp1, Tmp2, ISD::SETUGT);
2498 Tmp3 = DAG.getNode(ISD::FNEG, dl, VT, Tmp1);
2499 Tmp1 = DAG.getNode(ISD::SELECT, dl, VT, Tmp2, Tmp1, Tmp3);
2500 Results.push_back(Tmp1);
2504 Results.push_back(ExpandFPLibCall(Node, RTLIB::SQRT_F32, RTLIB::SQRT_F64,
2505 RTLIB::SQRT_F80, RTLIB::SQRT_PPCF128));
2508 Results.push_back(ExpandFPLibCall(Node, RTLIB::SIN_F32, RTLIB::SIN_F64,
2509 RTLIB::SIN_F80, RTLIB::SIN_PPCF128));
2512 Results.push_back(ExpandFPLibCall(Node, RTLIB::COS_F32, RTLIB::COS_F64,
2513 RTLIB::COS_F80, RTLIB::COS_PPCF128));
2516 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG_F32, RTLIB::LOG_F64,
2517 RTLIB::LOG_F80, RTLIB::LOG_PPCF128));
2520 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG2_F32, RTLIB::LOG2_F64,
2521 RTLIB::LOG2_F80, RTLIB::LOG2_PPCF128));
2524 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG10_F32, RTLIB::LOG10_F64,
2525 RTLIB::LOG10_F80, RTLIB::LOG10_PPCF128));
2528 Results.push_back(ExpandFPLibCall(Node, RTLIB::EXP_F32, RTLIB::EXP_F64,
2529 RTLIB::EXP_F80, RTLIB::EXP_PPCF128));
2532 Results.push_back(ExpandFPLibCall(Node, RTLIB::EXP2_F32, RTLIB::EXP2_F64,
2533 RTLIB::EXP2_F80, RTLIB::EXP2_PPCF128));
2536 Results.push_back(ExpandFPLibCall(Node, RTLIB::TRUNC_F32, RTLIB::TRUNC_F64,
2537 RTLIB::TRUNC_F80, RTLIB::TRUNC_PPCF128));
2540 Results.push_back(ExpandFPLibCall(Node, RTLIB::FLOOR_F32, RTLIB::FLOOR_F64,
2541 RTLIB::FLOOR_F80, RTLIB::FLOOR_PPCF128));
2544 Results.push_back(ExpandFPLibCall(Node, RTLIB::CEIL_F32, RTLIB::CEIL_F64,
2545 RTLIB::CEIL_F80, RTLIB::CEIL_PPCF128));
2548 Results.push_back(ExpandFPLibCall(Node, RTLIB::RINT_F32, RTLIB::RINT_F64,
2549 RTLIB::RINT_F80, RTLIB::RINT_PPCF128));
2551 case ISD::FNEARBYINT:
2552 Results.push_back(ExpandFPLibCall(Node, RTLIB::NEARBYINT_F32,
2553 RTLIB::NEARBYINT_F64,
2554 RTLIB::NEARBYINT_F80,
2555 RTLIB::NEARBYINT_PPCF128));
2558 Results.push_back(ExpandFPLibCall(Node, RTLIB::POWI_F32, RTLIB::POWI_F64,
2559 RTLIB::POWI_F80, RTLIB::POWI_PPCF128));
2562 Results.push_back(ExpandFPLibCall(Node, RTLIB::POW_F32, RTLIB::POW_F64,
2563 RTLIB::POW_F80, RTLIB::POW_PPCF128));
2566 Results.push_back(ExpandFPLibCall(Node, RTLIB::DIV_F32, RTLIB::DIV_F64,
2567 RTLIB::DIV_F80, RTLIB::DIV_PPCF128));
2570 Results.push_back(ExpandFPLibCall(Node, RTLIB::REM_F32, RTLIB::REM_F64,
2571 RTLIB::REM_F80, RTLIB::REM_PPCF128));
2573 case ISD::ConstantFP: {
2574 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
2575 // Check to see if this FP immediate is already legal.
2576 bool isLegal = false;
2577 for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(),
2578 E = TLI.legal_fpimm_end(); I != E; ++I) {
2579 if (CFP->isExactlyValue(*I)) {
2584 // If this is a legal constant, turn it into a TargetConstantFP node.
2586 Results.push_back(SDValue(Node, 0));
2588 Results.push_back(ExpandConstantFP(CFP, true, DAG, TLI));
2591 case ISD::EHSELECTION: {
2592 unsigned Reg = TLI.getExceptionSelectorRegister();
2593 assert(Reg && "Can't expand to unknown register!");
2594 Results.push_back(DAG.getCopyFromReg(Node->getOperand(1), dl, Reg,
2595 Node->getValueType(0)));
2596 Results.push_back(Results[0].getValue(1));
2599 case ISD::EXCEPTIONADDR: {
2600 unsigned Reg = TLI.getExceptionAddressRegister();
2601 assert(Reg && "Can't expand to unknown register!");
2602 Results.push_back(DAG.getCopyFromReg(Node->getOperand(0), dl, Reg,
2603 Node->getValueType(0)));
2604 Results.push_back(Results[0].getValue(1));
2608 EVT VT = Node->getValueType(0);
2609 assert(TLI.isOperationLegalOrCustom(ISD::ADD, VT) &&
2610 TLI.isOperationLegalOrCustom(ISD::XOR, VT) &&
2611 "Don't know how to expand this subtraction!");
2612 Tmp1 = DAG.getNode(ISD::XOR, dl, VT, Node->getOperand(1),
2613 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), VT));
2614 Tmp1 = DAG.getNode(ISD::ADD, dl, VT, Tmp2, DAG.getConstant(1, VT));
2615 Results.push_back(DAG.getNode(ISD::ADD, dl, VT, Node->getOperand(0), Tmp1));
2620 EVT VT = Node->getValueType(0);
2621 SDVTList VTs = DAG.getVTList(VT, VT);
2622 bool isSigned = Node->getOpcode() == ISD::SREM;
2623 unsigned DivOpc = isSigned ? ISD::SDIV : ISD::UDIV;
2624 unsigned DivRemOpc = isSigned ? ISD::SDIVREM : ISD::UDIVREM;
2625 Tmp2 = Node->getOperand(0);
2626 Tmp3 = Node->getOperand(1);
2627 if (TLI.isOperationLegalOrCustom(DivRemOpc, VT)) {
2628 Tmp1 = DAG.getNode(DivRemOpc, dl, VTs, Tmp2, Tmp3).getValue(1);
2629 } else if (TLI.isOperationLegalOrCustom(DivOpc, VT)) {
2631 Tmp1 = DAG.getNode(DivOpc, dl, VT, Tmp2, Tmp3);
2632 Tmp1 = DAG.getNode(ISD::MUL, dl, VT, Tmp1, Tmp3);
2633 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, Tmp2, Tmp1);
2634 } else if (isSigned) {
2635 Tmp1 = ExpandIntLibCall(Node, true, RTLIB::SREM_I16, RTLIB::SREM_I32,
2636 RTLIB::SREM_I64, RTLIB::SREM_I128);
2638 Tmp1 = ExpandIntLibCall(Node, false, RTLIB::UREM_I16, RTLIB::UREM_I32,
2639 RTLIB::UREM_I64, RTLIB::UREM_I128);
2641 Results.push_back(Tmp1);
2646 bool isSigned = Node->getOpcode() == ISD::SDIV;
2647 unsigned DivRemOpc = isSigned ? ISD::SDIVREM : ISD::UDIVREM;
2648 EVT VT = Node->getValueType(0);
2649 SDVTList VTs = DAG.getVTList(VT, VT);
2650 if (TLI.isOperationLegalOrCustom(DivRemOpc, VT))
2651 Tmp1 = DAG.getNode(DivRemOpc, dl, VTs, Node->getOperand(0),
2652 Node->getOperand(1));
2654 Tmp1 = ExpandIntLibCall(Node, true, RTLIB::SDIV_I16, RTLIB::SDIV_I32,
2655 RTLIB::SDIV_I64, RTLIB::SDIV_I128);
2657 Tmp1 = ExpandIntLibCall(Node, false, RTLIB::UDIV_I16, RTLIB::UDIV_I32,
2658 RTLIB::UDIV_I64, RTLIB::UDIV_I128);
2659 Results.push_back(Tmp1);
2664 unsigned ExpandOpcode = Node->getOpcode() == ISD::MULHU ? ISD::UMUL_LOHI :
2666 EVT VT = Node->getValueType(0);
2667 SDVTList VTs = DAG.getVTList(VT, VT);
2668 assert(TLI.isOperationLegalOrCustom(ExpandOpcode, VT) &&
2669 "If this wasn't legal, it shouldn't have been created!");
2670 Tmp1 = DAG.getNode(ExpandOpcode, dl, VTs, Node->getOperand(0),
2671 Node->getOperand(1));
2672 Results.push_back(Tmp1.getValue(1));
2676 EVT VT = Node->getValueType(0);
2677 SDVTList VTs = DAG.getVTList(VT, VT);
2678 // See if multiply or divide can be lowered using two-result operations.
2679 // We just need the low half of the multiply; try both the signed
2680 // and unsigned forms. If the target supports both SMUL_LOHI and
2681 // UMUL_LOHI, form a preference by checking which forms of plain
2682 // MULH it supports.
2683 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, VT);
2684 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, VT);
2685 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, VT);
2686 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, VT);
2687 unsigned OpToUse = 0;
2688 if (HasSMUL_LOHI && !HasMULHS) {
2689 OpToUse = ISD::SMUL_LOHI;
2690 } else if (HasUMUL_LOHI && !HasMULHU) {
2691 OpToUse = ISD::UMUL_LOHI;
2692 } else if (HasSMUL_LOHI) {
2693 OpToUse = ISD::SMUL_LOHI;
2694 } else if (HasUMUL_LOHI) {
2695 OpToUse = ISD::UMUL_LOHI;
2698 Results.push_back(DAG.getNode(OpToUse, dl, VTs, Node->getOperand(0),
2699 Node->getOperand(1)));
2702 Tmp1 = ExpandIntLibCall(Node, false, RTLIB::MUL_I16, RTLIB::MUL_I32,
2703 RTLIB::MUL_I64, RTLIB::MUL_I128);
2704 Results.push_back(Tmp1);
2709 SDValue LHS = Node->getOperand(0);
2710 SDValue RHS = Node->getOperand(1);
2711 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::SADDO ?
2712 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2714 Results.push_back(Sum);
2715 EVT OType = Node->getValueType(1);
2717 SDValue Zero = DAG.getConstant(0, LHS.getValueType());
2719 // LHSSign -> LHS >= 0
2720 // RHSSign -> RHS >= 0
2721 // SumSign -> Sum >= 0
2724 // Overflow -> (LHSSign == RHSSign) && (LHSSign != SumSign)
2726 // Overflow -> (LHSSign != RHSSign) && (LHSSign != SumSign)
2728 SDValue LHSSign = DAG.getSetCC(dl, OType, LHS, Zero, ISD::SETGE);
2729 SDValue RHSSign = DAG.getSetCC(dl, OType, RHS, Zero, ISD::SETGE);
2730 SDValue SignsMatch = DAG.getSetCC(dl, OType, LHSSign, RHSSign,
2731 Node->getOpcode() == ISD::SADDO ?
2732 ISD::SETEQ : ISD::SETNE);
2734 SDValue SumSign = DAG.getSetCC(dl, OType, Sum, Zero, ISD::SETGE);
2735 SDValue SumSignNE = DAG.getSetCC(dl, OType, LHSSign, SumSign, ISD::SETNE);
2737 SDValue Cmp = DAG.getNode(ISD::AND, dl, OType, SignsMatch, SumSignNE);
2738 Results.push_back(Cmp);
2743 SDValue LHS = Node->getOperand(0);
2744 SDValue RHS = Node->getOperand(1);
2745 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::UADDO ?
2746 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2748 Results.push_back(Sum);
2749 Results.push_back(DAG.getSetCC(dl, Node->getValueType(1), Sum, LHS,
2750 Node->getOpcode () == ISD::UADDO ?
2751 ISD::SETULT : ISD::SETUGT));
2756 EVT VT = Node->getValueType(0);
2757 SDValue LHS = Node->getOperand(0);
2758 SDValue RHS = Node->getOperand(1);
2761 static unsigned Ops[2][3] =
2762 { { ISD::MULHU, ISD::UMUL_LOHI, ISD::ZERO_EXTEND },
2763 { ISD::MULHS, ISD::SMUL_LOHI, ISD::SIGN_EXTEND }};
2764 bool isSigned = Node->getOpcode() == ISD::SMULO;
2765 if (TLI.isOperationLegalOrCustom(Ops[isSigned][0], VT)) {
2766 BottomHalf = DAG.getNode(ISD::MUL, dl, VT, LHS, RHS);
2767 TopHalf = DAG.getNode(Ops[isSigned][0], dl, VT, LHS, RHS);
2768 } else if (TLI.isOperationLegalOrCustom(Ops[isSigned][1], VT)) {
2769 BottomHalf = DAG.getNode(Ops[isSigned][1], dl, DAG.getVTList(VT, VT), LHS,
2771 TopHalf = BottomHalf.getValue(1);
2772 } else if (TLI.isTypeLegal(EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits() * 2))) {
2773 EVT WideVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits() * 2);
2774 LHS = DAG.getNode(Ops[isSigned][2], dl, WideVT, LHS);
2775 RHS = DAG.getNode(Ops[isSigned][2], dl, WideVT, RHS);
2776 Tmp1 = DAG.getNode(ISD::MUL, dl, WideVT, LHS, RHS);
2777 BottomHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Tmp1,
2778 DAG.getIntPtrConstant(0));
2779 TopHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Tmp1,
2780 DAG.getIntPtrConstant(1));
2782 // FIXME: We should be able to fall back to a libcall with an illegal
2783 // type in some cases cases.
2784 // Also, we can fall back to a division in some cases, but that's a big
2785 // performance hit in the general case.
2786 llvm_unreachable("Don't know how to expand this operation yet!");
2789 Tmp1 = DAG.getConstant(VT.getSizeInBits() - 1, TLI.getShiftAmountTy());
2790 Tmp1 = DAG.getNode(ISD::SRA, dl, VT, BottomHalf, Tmp1);
2791 TopHalf = DAG.getSetCC(dl, TLI.getSetCCResultType(VT), TopHalf, Tmp1,
2794 TopHalf = DAG.getSetCC(dl, TLI.getSetCCResultType(VT), TopHalf,
2795 DAG.getConstant(0, VT), ISD::SETNE);
2797 Results.push_back(BottomHalf);
2798 Results.push_back(TopHalf);
2801 case ISD::BUILD_PAIR: {
2802 EVT PairTy = Node->getValueType(0);
2803 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, PairTy, Node->getOperand(0));
2804 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, dl, PairTy, Node->getOperand(1));
2805 Tmp2 = DAG.getNode(ISD::SHL, dl, PairTy, Tmp2,
2806 DAG.getConstant(PairTy.getSizeInBits()/2,
2807 TLI.getShiftAmountTy()));
2808 Results.push_back(DAG.getNode(ISD::OR, dl, PairTy, Tmp1, Tmp2));
2812 Tmp1 = Node->getOperand(0);
2813 Tmp2 = Node->getOperand(1);
2814 Tmp3 = Node->getOperand(2);
2815 if (Tmp1.getOpcode() == ISD::SETCC) {
2816 Tmp1 = DAG.getSelectCC(dl, Tmp1.getOperand(0), Tmp1.getOperand(1),
2818 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
2820 Tmp1 = DAG.getSelectCC(dl, Tmp1,
2821 DAG.getConstant(0, Tmp1.getValueType()),
2822 Tmp2, Tmp3, ISD::SETNE);
2824 Results.push_back(Tmp1);
2827 SDValue Chain = Node->getOperand(0);
2828 SDValue Table = Node->getOperand(1);
2829 SDValue Index = Node->getOperand(2);
2831 EVT PTy = TLI.getPointerTy();
2832 MachineFunction &MF = DAG.getMachineFunction();
2833 unsigned EntrySize = MF.getJumpTableInfo()->getEntrySize();
2834 Index= DAG.getNode(ISD::MUL, dl, PTy,
2835 Index, DAG.getConstant(EntrySize, PTy));
2836 SDValue Addr = DAG.getNode(ISD::ADD, dl, PTy, Index, Table);
2838 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(), EntrySize * 8);
2839 SDValue LD = DAG.getExtLoad(ISD::SEXTLOAD, dl, PTy, Chain, Addr,
2840 PseudoSourceValue::getJumpTable(), 0, MemVT);
2842 if (TLI.getTargetMachine().getRelocationModel() == Reloc::PIC_) {
2843 // For PIC, the sequence is:
2844 // BRIND(load(Jumptable + index) + RelocBase)
2845 // RelocBase can be JumpTable, GOT or some sort of global base.
2846 Addr = DAG.getNode(ISD::ADD, dl, PTy, Addr,
2847 TLI.getPICJumpTableRelocBase(Table, DAG));
2849 Tmp1 = DAG.getNode(ISD::BRIND, dl, MVT::Other, LD.getValue(1), Addr);
2850 Results.push_back(Tmp1);
2854 // Expand brcond's setcc into its constituent parts and create a BR_CC
2856 Tmp1 = Node->getOperand(0);
2857 Tmp2 = Node->getOperand(1);
2858 if (Tmp2.getOpcode() == ISD::SETCC) {
2859 Tmp1 = DAG.getNode(ISD::BR_CC, dl, MVT::Other,
2860 Tmp1, Tmp2.getOperand(2),
2861 Tmp2.getOperand(0), Tmp2.getOperand(1),
2862 Node->getOperand(2));
2864 Tmp1 = DAG.getNode(ISD::BR_CC, dl, MVT::Other, Tmp1,
2865 DAG.getCondCode(ISD::SETNE), Tmp2,
2866 DAG.getConstant(0, Tmp2.getValueType()),
2867 Node->getOperand(2));
2869 Results.push_back(Tmp1);
2872 Tmp1 = Node->getOperand(0);
2873 Tmp2 = Node->getOperand(1);
2874 Tmp3 = Node->getOperand(2);
2875 LegalizeSetCCCondCode(Node->getValueType(0), Tmp1, Tmp2, Tmp3, dl);
2877 // If we expanded the SETCC into an AND/OR, return the new node
2878 if (Tmp2.getNode() == 0) {
2879 Results.push_back(Tmp1);
2883 // Otherwise, SETCC for the given comparison type must be completely
2884 // illegal; expand it into a SELECT_CC.
2885 EVT VT = Node->getValueType(0);
2886 Tmp1 = DAG.getNode(ISD::SELECT_CC, dl, VT, Tmp1, Tmp2,
2887 DAG.getConstant(1, VT), DAG.getConstant(0, VT), Tmp3);
2888 Results.push_back(Tmp1);
2891 case ISD::SELECT_CC: {
2892 Tmp1 = Node->getOperand(0); // LHS
2893 Tmp2 = Node->getOperand(1); // RHS
2894 Tmp3 = Node->getOperand(2); // True
2895 Tmp4 = Node->getOperand(3); // False
2896 SDValue CC = Node->getOperand(4);
2898 LegalizeSetCCCondCode(TLI.getSetCCResultType(Tmp1.getValueType()),
2899 Tmp1, Tmp2, CC, dl);
2901 assert(!Tmp2.getNode() && "Can't legalize SELECT_CC with legal condition!");
2902 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
2903 CC = DAG.getCondCode(ISD::SETNE);
2904 Tmp1 = DAG.getNode(ISD::SELECT_CC, dl, Node->getValueType(0), Tmp1, Tmp2,
2906 Results.push_back(Tmp1);
2910 Tmp1 = Node->getOperand(0); // Chain
2911 Tmp2 = Node->getOperand(2); // LHS
2912 Tmp3 = Node->getOperand(3); // RHS
2913 Tmp4 = Node->getOperand(1); // CC
2915 LegalizeSetCCCondCode(TLI.getSetCCResultType(Tmp2.getValueType()),
2916 Tmp2, Tmp3, Tmp4, dl);
2917 LastCALLSEQ_END = DAG.getEntryNode();
2919 assert(!Tmp3.getNode() && "Can't legalize BR_CC with legal condition!");
2920 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
2921 Tmp4 = DAG.getCondCode(ISD::SETNE);
2922 Tmp1 = DAG.getNode(ISD::BR_CC, dl, Node->getValueType(0), Tmp1, Tmp4, Tmp2,
2923 Tmp3, Node->getOperand(4));
2924 Results.push_back(Tmp1);
2927 case ISD::GLOBAL_OFFSET_TABLE:
2928 case ISD::GlobalAddress:
2929 case ISD::GlobalTLSAddress:
2930 case ISD::ExternalSymbol:
2931 case ISD::ConstantPool:
2932 case ISD::JumpTable:
2933 case ISD::INTRINSIC_W_CHAIN:
2934 case ISD::INTRINSIC_WO_CHAIN:
2935 case ISD::INTRINSIC_VOID:
2936 // FIXME: Custom lowering for these operations shouldn't return null!
2937 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
2938 Results.push_back(SDValue(Node, i));
2942 void SelectionDAGLegalize::PromoteNode(SDNode *Node,
2943 SmallVectorImpl<SDValue> &Results) {
2944 EVT OVT = Node->getValueType(0);
2945 if (Node->getOpcode() == ISD::UINT_TO_FP ||
2946 Node->getOpcode() == ISD::SINT_TO_FP ||
2947 Node->getOpcode() == ISD::SETCC) {
2948 OVT = Node->getOperand(0).getValueType();
2950 EVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2951 DebugLoc dl = Node->getDebugLoc();
2952 SDValue Tmp1, Tmp2, Tmp3;
2953 switch (Node->getOpcode()) {
2957 // Zero extend the argument.
2958 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Node->getOperand(0));
2959 // Perform the larger operation.
2960 Tmp1 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
2961 if (Node->getOpcode() == ISD::CTTZ) {
2962 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
2963 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT),
2964 Tmp1, DAG.getConstant(NVT.getSizeInBits(), NVT),
2966 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2,
2967 DAG.getConstant(OVT.getSizeInBits(), NVT), Tmp1);
2968 } else if (Node->getOpcode() == ISD::CTLZ) {
2969 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
2970 Tmp1 = DAG.getNode(ISD::SUB, dl, NVT, Tmp1,
2971 DAG.getConstant(NVT.getSizeInBits() -
2972 OVT.getSizeInBits(), NVT));
2974 Results.push_back(DAG.getNode(ISD::TRUNCATE, dl, OVT, Tmp1));
2977 unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits();
2978 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Tmp1);
2979 Tmp1 = DAG.getNode(ISD::BSWAP, dl, NVT, Tmp1);
2980 Tmp1 = DAG.getNode(ISD::SRL, dl, NVT, Tmp1,
2981 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
2982 Results.push_back(Tmp1);
2985 case ISD::FP_TO_UINT:
2986 case ISD::FP_TO_SINT:
2987 Tmp1 = PromoteLegalFP_TO_INT(Node->getOperand(0), Node->getValueType(0),
2988 Node->getOpcode() == ISD::FP_TO_SINT, dl);
2989 Results.push_back(Tmp1);
2991 case ISD::UINT_TO_FP:
2992 case ISD::SINT_TO_FP:
2993 Tmp1 = PromoteLegalINT_TO_FP(Node->getOperand(0), Node->getValueType(0),
2994 Node->getOpcode() == ISD::SINT_TO_FP, dl);
2995 Results.push_back(Tmp1);
3000 unsigned ExtOp, TruncOp;
3001 if (OVT.isVector()) {
3002 ExtOp = ISD::BIT_CONVERT;
3003 TruncOp = ISD::BIT_CONVERT;
3004 } else if (OVT.isInteger()) {
3005 ExtOp = ISD::ANY_EXTEND;
3006 TruncOp = ISD::TRUNCATE;
3008 llvm_report_error("Cannot promote logic operation");
3010 // Promote each of the values to the new type.
3011 Tmp1 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(0));
3012 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3013 // Perform the larger operation, then convert back
3014 Tmp1 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
3015 Results.push_back(DAG.getNode(TruncOp, dl, OVT, Tmp1));
3019 unsigned ExtOp, TruncOp;
3020 if (Node->getValueType(0).isVector()) {
3021 ExtOp = ISD::BIT_CONVERT;
3022 TruncOp = ISD::BIT_CONVERT;
3023 } else if (Node->getValueType(0).isInteger()) {
3024 ExtOp = ISD::ANY_EXTEND;
3025 TruncOp = ISD::TRUNCATE;
3027 ExtOp = ISD::FP_EXTEND;
3028 TruncOp = ISD::FP_ROUND;
3030 Tmp1 = Node->getOperand(0);
3031 // Promote each of the values to the new type.
3032 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3033 Tmp3 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(2));
3034 // Perform the larger operation, then round down.
3035 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp1, Tmp2, Tmp3);
3036 if (TruncOp != ISD::FP_ROUND)
3037 Tmp1 = DAG.getNode(TruncOp, dl, Node->getValueType(0), Tmp1);
3039 Tmp1 = DAG.getNode(TruncOp, dl, Node->getValueType(0), Tmp1,
3040 DAG.getIntPtrConstant(0));
3041 Results.push_back(Tmp1);
3044 case ISD::VECTOR_SHUFFLE: {
3045 SmallVector<int, 8> Mask;
3046 cast<ShuffleVectorSDNode>(Node)->getMask(Mask);
3048 // Cast the two input vectors.
3049 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(0));
3050 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(1));
3052 // Convert the shuffle mask to the right # elements.
3053 Tmp1 = ShuffleWithNarrowerEltType(NVT, OVT, dl, Tmp1, Tmp2, Mask);
3054 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, OVT, Tmp1);
3055 Results.push_back(Tmp1);
3059 unsigned ExtOp = ISD::FP_EXTEND;
3060 if (NVT.isInteger()) {
3061 ISD::CondCode CCCode =
3062 cast<CondCodeSDNode>(Node->getOperand(2))->get();
3063 ExtOp = isSignedIntSetCC(CCCode) ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
3065 Tmp1 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(0));
3066 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3067 Results.push_back(DAG.getNode(ISD::SETCC, dl, Node->getValueType(0),
3068 Tmp1, Tmp2, Node->getOperand(2)));
3074 // SelectionDAG::Legalize - This is the entry point for the file.
3076 void SelectionDAG::Legalize(bool TypesNeedLegalizing,
3077 CodeGenOpt::Level OptLevel) {
3078 /// run - This is the main entry point to this class.
3080 SelectionDAGLegalize(*this, OptLevel).LegalizeDAG();