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/Analysis/DebugInfo.h"
20 #include "llvm/CodeGen/PseudoSourceValue.h"
21 #include "llvm/Target/TargetFrameInfo.h"
22 #include "llvm/Target/TargetLowering.h"
23 #include "llvm/Target/TargetData.h"
24 #include "llvm/Target/TargetMachine.h"
25 #include "llvm/Target/TargetOptions.h"
26 #include "llvm/Target/TargetSubtarget.h"
27 #include "llvm/CallingConv.h"
28 #include "llvm/Constants.h"
29 #include "llvm/DerivedTypes.h"
30 #include "llvm/Function.h"
31 #include "llvm/GlobalVariable.h"
32 #include "llvm/LLVMContext.h"
33 #include "llvm/Support/CommandLine.h"
34 #include "llvm/Support/Debug.h"
35 #include "llvm/Support/MathExtras.h"
36 #include "llvm/Support/raw_ostream.h"
37 #include "llvm/ADT/DenseMap.h"
38 #include "llvm/ADT/SmallVector.h"
39 #include "llvm/ADT/SmallPtrSet.h"
42 //===----------------------------------------------------------------------===//
43 /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
44 /// hacks on it until the target machine can handle it. This involves
45 /// eliminating value sizes the machine cannot handle (promoting small sizes to
46 /// large sizes or splitting up large values into small values) as well as
47 /// eliminating operations the machine cannot handle.
49 /// This code also does a small amount of optimization and recognition of idioms
50 /// as part of its processing. For example, if a target does not support a
51 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
52 /// will attempt merge setcc and brc instructions into brcc's.
55 class SelectionDAGLegalize {
58 CodeGenOpt::Level OptLevel;
60 // Libcall insertion helpers.
62 /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been
63 /// legalized. We use this to ensure that calls are properly serialized
64 /// against each other, including inserted libcalls.
65 SDValue LastCALLSEQ_END;
67 /// IsLegalizingCall - This member is used *only* for purposes of providing
68 /// helpful assertions that a libcall isn't created while another call is
69 /// being legalized (which could lead to non-serialized call sequences).
70 bool IsLegalizingCall;
73 Legal, // The target natively supports this operation.
74 Promote, // This operation should be executed in a larger type.
75 Expand // Try to expand this to other ops, otherwise use a libcall.
78 /// ValueTypeActions - This is a bitvector that contains two bits for each
79 /// value type, where the two bits correspond to the LegalizeAction enum.
80 /// This can be queried with "getTypeAction(VT)".
81 TargetLowering::ValueTypeActionImpl ValueTypeActions;
83 /// LegalizedNodes - For nodes that are of legal width, and that have more
84 /// than one use, this map indicates what regularized operand to use. This
85 /// allows us to avoid legalizing the same thing more than once.
86 DenseMap<SDValue, SDValue> LegalizedNodes;
88 void AddLegalizedOperand(SDValue From, SDValue To) {
89 LegalizedNodes.insert(std::make_pair(From, To));
90 // If someone requests legalization of the new node, return itself.
92 LegalizedNodes.insert(std::make_pair(To, To));
96 SelectionDAGLegalize(SelectionDAG &DAG, CodeGenOpt::Level ol);
98 /// getTypeAction - Return how we should legalize values of this type, either
99 /// it is already legal or we need to expand it into multiple registers of
100 /// smaller integer type, or we need to promote it to a larger type.
101 LegalizeAction getTypeAction(EVT VT) const {
103 (LegalizeAction)ValueTypeActions.getTypeAction(*DAG.getContext(), VT);
106 /// isTypeLegal - Return true if this type is legal on this target.
108 bool isTypeLegal(EVT VT) const {
109 return getTypeAction(VT) == Legal;
115 /// LegalizeOp - We know that the specified value has a legal type.
116 /// Recursively ensure that the operands have legal types, then return the
118 SDValue LegalizeOp(SDValue O);
120 SDValue OptimizeFloatStore(StoreSDNode *ST);
122 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
123 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
124 /// is necessary to spill the vector being inserted into to memory, perform
125 /// the insert there, and then read the result back.
126 SDValue PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val,
127 SDValue Idx, DebugLoc dl);
128 SDValue ExpandINSERT_VECTOR_ELT(SDValue Vec, SDValue Val,
129 SDValue Idx, DebugLoc dl);
131 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
132 /// performs the same shuffe in terms of order or result bytes, but on a type
133 /// whose vector element type is narrower than the original shuffle type.
134 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
135 SDValue ShuffleWithNarrowerEltType(EVT NVT, EVT VT, DebugLoc dl,
136 SDValue N1, SDValue N2,
137 SmallVectorImpl<int> &Mask) const;
139 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
140 SmallPtrSet<SDNode*, 32> &NodesLeadingTo);
142 void LegalizeSetCCCondCode(EVT VT, SDValue &LHS, SDValue &RHS, SDValue &CC,
145 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
146 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
147 RTLIB::Libcall Call_F64, RTLIB::Libcall Call_F80,
148 RTLIB::Libcall Call_PPCF128);
149 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
150 RTLIB::Libcall Call_I8,
151 RTLIB::Libcall Call_I16,
152 RTLIB::Libcall Call_I32,
153 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 void ExpandDYNAMIC_STACKALLOC(SDNode *Node,
160 SmallVectorImpl<SDValue> &Results);
161 SDValue ExpandFCOPYSIGN(SDNode *Node);
162 SDValue ExpandLegalINT_TO_FP(bool isSigned, SDValue LegalOp, EVT DestVT,
164 SDValue PromoteLegalINT_TO_FP(SDValue LegalOp, EVT DestVT, bool isSigned,
166 SDValue PromoteLegalFP_TO_INT(SDValue LegalOp, EVT DestVT, bool isSigned,
169 SDValue ExpandBSWAP(SDValue Op, DebugLoc dl);
170 SDValue ExpandBitCount(unsigned Opc, SDValue Op, DebugLoc dl);
172 SDValue ExpandExtractFromVectorThroughStack(SDValue Op);
173 SDValue ExpandVectorBuildThroughStack(SDNode* Node);
175 void ExpandNode(SDNode *Node, SmallVectorImpl<SDValue> &Results);
176 void PromoteNode(SDNode *Node, SmallVectorImpl<SDValue> &Results);
180 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
181 /// performs the same shuffe in terms of order or result bytes, but on a type
182 /// whose vector element type is narrower than the original shuffle type.
183 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
185 SelectionDAGLegalize::ShuffleWithNarrowerEltType(EVT NVT, EVT VT, DebugLoc dl,
186 SDValue N1, SDValue N2,
187 SmallVectorImpl<int> &Mask) const {
188 unsigned NumMaskElts = VT.getVectorNumElements();
189 unsigned NumDestElts = NVT.getVectorNumElements();
190 unsigned NumEltsGrowth = NumDestElts / NumMaskElts;
192 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
194 if (NumEltsGrowth == 1)
195 return DAG.getVectorShuffle(NVT, dl, N1, N2, &Mask[0]);
197 SmallVector<int, 8> NewMask;
198 for (unsigned i = 0; i != NumMaskElts; ++i) {
200 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
202 NewMask.push_back(-1);
204 NewMask.push_back(Idx * NumEltsGrowth + j);
207 assert(NewMask.size() == NumDestElts && "Non-integer NumEltsGrowth?");
208 assert(TLI.isShuffleMaskLegal(NewMask, NVT) && "Shuffle not legal?");
209 return DAG.getVectorShuffle(NVT, dl, N1, N2, &NewMask[0]);
212 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag,
213 CodeGenOpt::Level ol)
214 : TLI(dag.getTargetLoweringInfo()), DAG(dag), OptLevel(ol),
215 ValueTypeActions(TLI.getValueTypeActions()) {
216 assert(MVT::LAST_VALUETYPE <= MVT::MAX_ALLOWED_VALUETYPE &&
217 "Too many value types for ValueTypeActions to hold!");
220 void SelectionDAGLegalize::LegalizeDAG() {
221 LastCALLSEQ_END = DAG.getEntryNode();
222 IsLegalizingCall = false;
224 // The legalize process is inherently a bottom-up recursive process (users
225 // legalize their uses before themselves). Given infinite stack space, we
226 // could just start legalizing on the root and traverse the whole graph. In
227 // practice however, this causes us to run out of stack space on large basic
228 // blocks. To avoid this problem, compute an ordering of the nodes where each
229 // node is only legalized after all of its operands are legalized.
230 DAG.AssignTopologicalOrder();
231 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
232 E = prior(DAG.allnodes_end()); I != llvm::next(E); ++I)
233 LegalizeOp(SDValue(I, 0));
235 // Finally, it's possible the root changed. Get the new root.
236 SDValue OldRoot = DAG.getRoot();
237 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
238 DAG.setRoot(LegalizedNodes[OldRoot]);
240 LegalizedNodes.clear();
242 // Remove dead nodes now.
243 DAG.RemoveDeadNodes();
247 /// FindCallEndFromCallStart - Given a chained node that is part of a call
248 /// sequence, find the CALLSEQ_END node that terminates the call sequence.
249 static SDNode *FindCallEndFromCallStart(SDNode *Node) {
250 if (Node->getOpcode() == ISD::CALLSEQ_END)
252 if (Node->use_empty())
253 return 0; // No CallSeqEnd
255 // The chain is usually at the end.
256 SDValue TheChain(Node, Node->getNumValues()-1);
257 if (TheChain.getValueType() != MVT::Other) {
258 // Sometimes it's at the beginning.
259 TheChain = SDValue(Node, 0);
260 if (TheChain.getValueType() != MVT::Other) {
261 // Otherwise, hunt for it.
262 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
263 if (Node->getValueType(i) == MVT::Other) {
264 TheChain = SDValue(Node, i);
268 // Otherwise, we walked into a node without a chain.
269 if (TheChain.getValueType() != MVT::Other)
274 for (SDNode::use_iterator UI = Node->use_begin(),
275 E = Node->use_end(); UI != E; ++UI) {
277 // Make sure to only follow users of our token chain.
279 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
280 if (User->getOperand(i) == TheChain)
281 if (SDNode *Result = FindCallEndFromCallStart(User))
287 /// FindCallStartFromCallEnd - Given a chained node that is part of a call
288 /// sequence, find the CALLSEQ_START node that initiates the call sequence.
289 static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
290 assert(Node && "Didn't find callseq_start for a call??");
291 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
293 assert(Node->getOperand(0).getValueType() == MVT::Other &&
294 "Node doesn't have a token chain argument!");
295 return FindCallStartFromCallEnd(Node->getOperand(0).getNode());
298 /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
299 /// see if any uses can reach Dest. If no dest operands can get to dest,
300 /// legalize them, legalize ourself, and return false, otherwise, return true.
302 /// Keep track of the nodes we fine that actually do lead to Dest in
303 /// NodesLeadingTo. This avoids retraversing them exponential number of times.
305 bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
306 SmallPtrSet<SDNode*, 32> &NodesLeadingTo) {
307 if (N == Dest) return true; // N certainly leads to Dest :)
309 // If we've already processed this node and it does lead to Dest, there is no
310 // need to reprocess it.
311 if (NodesLeadingTo.count(N)) return true;
313 // If the first result of this node has been already legalized, then it cannot
315 if (LegalizedNodes.count(SDValue(N, 0))) return false;
317 // Okay, this node has not already been legalized. Check and legalize all
318 // operands. If none lead to Dest, then we can legalize this node.
319 bool OperandsLeadToDest = false;
320 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
321 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
322 LegalizeAllNodesNotLeadingTo(N->getOperand(i).getNode(), Dest, NodesLeadingTo);
324 if (OperandsLeadToDest) {
325 NodesLeadingTo.insert(N);
329 // Okay, this node looks safe, legalize it and return false.
330 LegalizeOp(SDValue(N, 0));
334 /// ExpandConstantFP - Expands the ConstantFP node to an integer constant or
335 /// a load from the constant pool.
336 static SDValue ExpandConstantFP(ConstantFPSDNode *CFP, bool UseCP,
337 SelectionDAG &DAG, const TargetLowering &TLI) {
339 DebugLoc dl = CFP->getDebugLoc();
341 // If a FP immediate is precise when represented as a float and if the
342 // target can do an extending load from float to double, we put it into
343 // the constant pool as a float, even if it's is statically typed as a
344 // double. This shrinks FP constants and canonicalizes them for targets where
345 // an FP extending load is the same cost as a normal load (such as on the x87
346 // fp stack or PPC FP unit).
347 EVT VT = CFP->getValueType(0);
348 ConstantFP *LLVMC = const_cast<ConstantFP*>(CFP->getConstantFPValue());
350 assert((VT == MVT::f64 || VT == MVT::f32) && "Invalid type expansion");
351 return DAG.getConstant(LLVMC->getValueAPF().bitcastToAPInt(),
352 (VT == MVT::f64) ? MVT::i64 : MVT::i32);
357 while (SVT != MVT::f32) {
358 SVT = (MVT::SimpleValueType)(SVT.getSimpleVT().SimpleTy - 1);
359 if (CFP->isValueValidForType(SVT, CFP->getValueAPF()) &&
360 // Only do this if the target has a native EXTLOAD instruction from
362 TLI.isLoadExtLegal(ISD::EXTLOAD, SVT) &&
363 TLI.ShouldShrinkFPConstant(OrigVT)) {
364 const Type *SType = SVT.getTypeForEVT(*DAG.getContext());
365 LLVMC = cast<ConstantFP>(ConstantExpr::getFPTrunc(LLVMC, SType));
371 SDValue CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
372 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
374 return DAG.getExtLoad(ISD::EXTLOAD, dl,
375 OrigVT, DAG.getEntryNode(),
376 CPIdx, PseudoSourceValue::getConstantPool(),
377 0, VT, false, false, Alignment);
378 return DAG.getLoad(OrigVT, dl, DAG.getEntryNode(), CPIdx,
379 PseudoSourceValue::getConstantPool(), 0, false, false,
383 /// ExpandUnalignedStore - Expands an unaligned store to 2 half-size stores.
385 SDValue ExpandUnalignedStore(StoreSDNode *ST, SelectionDAG &DAG,
386 const TargetLowering &TLI) {
387 SDValue Chain = ST->getChain();
388 SDValue Ptr = ST->getBasePtr();
389 SDValue Val = ST->getValue();
390 EVT VT = Val.getValueType();
391 int Alignment = ST->getAlignment();
392 int SVOffset = ST->getSrcValueOffset();
393 DebugLoc dl = ST->getDebugLoc();
394 if (ST->getMemoryVT().isFloatingPoint() ||
395 ST->getMemoryVT().isVector()) {
396 EVT intVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits());
397 if (TLI.isTypeLegal(intVT)) {
398 // Expand to a bitconvert of the value to the integer type of the
399 // same size, then a (misaligned) int store.
400 // FIXME: Does not handle truncating floating point stores!
401 SDValue Result = DAG.getNode(ISD::BIT_CONVERT, dl, intVT, Val);
402 return DAG.getStore(Chain, dl, Result, Ptr, ST->getSrcValue(),
403 SVOffset, ST->isVolatile(), ST->isNonTemporal(),
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(),
411 EVT::getIntegerVT(*DAG.getContext(),
412 StoredVT.getSizeInBits()));
413 unsigned StoredBytes = StoredVT.getSizeInBits() / 8;
414 unsigned RegBytes = RegVT.getSizeInBits() / 8;
415 unsigned NumRegs = (StoredBytes + RegBytes - 1) / RegBytes;
417 // Make sure the stack slot is also aligned for the register type.
418 SDValue StackPtr = DAG.CreateStackTemporary(StoredVT, RegVT);
420 // Perform the original store, only redirected to the stack slot.
421 SDValue Store = DAG.getTruncStore(Chain, dl,
422 Val, StackPtr, NULL, 0, StoredVT,
424 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
425 SmallVector<SDValue, 8> Stores;
428 // Do all but one copies using the full register width.
429 for (unsigned i = 1; i < NumRegs; i++) {
430 // Load one integer register's worth from the stack slot.
431 SDValue Load = DAG.getLoad(RegVT, dl, Store, StackPtr, NULL, 0,
433 // Store it to the final location. Remember the store.
434 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr,
435 ST->getSrcValue(), SVOffset + Offset,
436 ST->isVolatile(), ST->isNonTemporal(),
437 MinAlign(ST->getAlignment(), Offset)));
438 // Increment the pointers.
440 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
442 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
445 // The last store may be partial. Do a truncating store. On big-endian
446 // machines this requires an extending load from the stack slot to ensure
447 // that the bits are in the right place.
448 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(),
449 8 * (StoredBytes - Offset));
451 // Load from the stack slot.
452 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Store, StackPtr,
453 NULL, 0, MemVT, false, false, 0);
455 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, Ptr,
456 ST->getSrcValue(), SVOffset + Offset,
457 MemVT, ST->isVolatile(),
459 MinAlign(ST->getAlignment(), Offset)));
460 // The order of the stores doesn't matter - say it with a TokenFactor.
461 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
465 assert(ST->getMemoryVT().isInteger() &&
466 !ST->getMemoryVT().isVector() &&
467 "Unaligned store of unknown type.");
468 // Get the half-size VT
469 EVT NewStoredVT = ST->getMemoryVT().getHalfSizedIntegerVT(*DAG.getContext());
470 int NumBits = NewStoredVT.getSizeInBits();
471 int IncrementSize = NumBits / 8;
473 // Divide the stored value in two parts.
474 SDValue ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
476 SDValue Hi = DAG.getNode(ISD::SRL, dl, VT, Val, ShiftAmount);
478 // Store the two parts
479 SDValue Store1, Store2;
480 Store1 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Lo:Hi, Ptr,
481 ST->getSrcValue(), SVOffset, NewStoredVT,
482 ST->isVolatile(), ST->isNonTemporal(), Alignment);
483 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
484 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
485 Alignment = MinAlign(Alignment, IncrementSize);
486 Store2 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Hi:Lo, Ptr,
487 ST->getSrcValue(), SVOffset + IncrementSize,
488 NewStoredVT, ST->isVolatile(), ST->isNonTemporal(),
491 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Store1, Store2);
494 /// ExpandUnalignedLoad - Expands an unaligned load to 2 half-size loads.
496 SDValue ExpandUnalignedLoad(LoadSDNode *LD, SelectionDAG &DAG,
497 const TargetLowering &TLI) {
498 int SVOffset = LD->getSrcValueOffset();
499 SDValue Chain = LD->getChain();
500 SDValue Ptr = LD->getBasePtr();
501 EVT VT = LD->getValueType(0);
502 EVT LoadedVT = LD->getMemoryVT();
503 DebugLoc dl = LD->getDebugLoc();
504 if (VT.isFloatingPoint() || VT.isVector()) {
505 EVT intVT = EVT::getIntegerVT(*DAG.getContext(), LoadedVT.getSizeInBits());
506 if (TLI.isTypeLegal(intVT)) {
507 // Expand to a (misaligned) integer load of the same size,
508 // then bitconvert to floating point or vector.
509 SDValue newLoad = DAG.getLoad(intVT, dl, Chain, Ptr, LD->getSrcValue(),
510 SVOffset, LD->isVolatile(),
511 LD->isNonTemporal(), LD->getAlignment());
512 SDValue Result = DAG.getNode(ISD::BIT_CONVERT, dl, LoadedVT, newLoad);
513 if (VT.isFloatingPoint() && LoadedVT != VT)
514 Result = DAG.getNode(ISD::FP_EXTEND, dl, VT, Result);
516 SDValue Ops[] = { Result, Chain };
517 return DAG.getMergeValues(Ops, 2, dl);
519 // Copy the value to a (aligned) stack slot using (unaligned) integer
520 // loads and stores, then do a (aligned) load from the stack slot.
521 EVT RegVT = TLI.getRegisterType(*DAG.getContext(), intVT);
522 unsigned LoadedBytes = LoadedVT.getSizeInBits() / 8;
523 unsigned RegBytes = RegVT.getSizeInBits() / 8;
524 unsigned NumRegs = (LoadedBytes + RegBytes - 1) / RegBytes;
526 // Make sure the stack slot is also aligned for the register type.
527 SDValue StackBase = DAG.CreateStackTemporary(LoadedVT, RegVT);
529 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
530 SmallVector<SDValue, 8> Stores;
531 SDValue StackPtr = StackBase;
534 // Do all but one copies using the full register width.
535 for (unsigned i = 1; i < NumRegs; i++) {
536 // Load one integer register's worth from the original location.
537 SDValue Load = DAG.getLoad(RegVT, dl, Chain, Ptr, LD->getSrcValue(),
538 SVOffset + Offset, LD->isVolatile(),
540 MinAlign(LD->getAlignment(), Offset));
541 // Follow the load with a store to the stack slot. Remember the store.
542 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, StackPtr,
543 NULL, 0, false, false, 0));
544 // Increment the pointers.
546 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
547 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
551 // The last copy may be partial. Do an extending load.
552 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(),
553 8 * (LoadedBytes - Offset));
554 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Chain, Ptr,
555 LD->getSrcValue(), SVOffset + Offset,
556 MemVT, LD->isVolatile(),
558 MinAlign(LD->getAlignment(), Offset));
559 // Follow the load with a store to the stack slot. Remember the store.
560 // On big-endian machines this requires a truncating store to ensure
561 // that the bits end up in the right place.
562 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, StackPtr,
563 NULL, 0, MemVT, false, false, 0));
565 // The order of the stores doesn't matter - say it with a TokenFactor.
566 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
569 // Finally, perform the original load only redirected to the stack slot.
570 Load = DAG.getExtLoad(LD->getExtensionType(), dl, VT, TF, StackBase,
571 NULL, 0, LoadedVT, false, false, 0);
573 // Callers expect a MERGE_VALUES node.
574 SDValue Ops[] = { Load, TF };
575 return DAG.getMergeValues(Ops, 2, dl);
578 assert(LoadedVT.isInteger() && !LoadedVT.isVector() &&
579 "Unaligned load of unsupported type.");
581 // Compute the new VT that is half the size of the old one. This is an
583 unsigned NumBits = LoadedVT.getSizeInBits();
585 NewLoadedVT = EVT::getIntegerVT(*DAG.getContext(), NumBits/2);
588 unsigned Alignment = LD->getAlignment();
589 unsigned IncrementSize = NumBits / 8;
590 ISD::LoadExtType HiExtType = LD->getExtensionType();
592 // If the original load is NON_EXTLOAD, the hi part load must be ZEXTLOAD.
593 if (HiExtType == ISD::NON_EXTLOAD)
594 HiExtType = ISD::ZEXTLOAD;
596 // Load the value in two parts
598 if (TLI.isLittleEndian()) {
599 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr, LD->getSrcValue(),
600 SVOffset, NewLoadedVT, LD->isVolatile(),
601 LD->isNonTemporal(), Alignment);
602 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
603 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
604 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr, LD->getSrcValue(),
605 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
606 LD->isNonTemporal(), MinAlign(Alignment, IncrementSize));
608 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr, LD->getSrcValue(),
609 SVOffset, NewLoadedVT, LD->isVolatile(),
610 LD->isNonTemporal(), Alignment);
611 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
612 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
613 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr, LD->getSrcValue(),
614 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
615 LD->isNonTemporal(), MinAlign(Alignment, IncrementSize));
618 // aggregate the two parts
619 SDValue ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
620 SDValue Result = DAG.getNode(ISD::SHL, dl, VT, Hi, ShiftAmount);
621 Result = DAG.getNode(ISD::OR, dl, VT, Result, Lo);
623 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
626 SDValue Ops[] = { Result, TF };
627 return DAG.getMergeValues(Ops, 2, dl);
630 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
631 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
632 /// is necessary to spill the vector being inserted into to memory, perform
633 /// the insert there, and then read the result back.
634 SDValue SelectionDAGLegalize::
635 PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val, SDValue Idx,
641 // If the target doesn't support this, we have to spill the input vector
642 // to a temporary stack slot, update the element, then reload it. This is
643 // badness. We could also load the value into a vector register (either
644 // with a "move to register" or "extload into register" instruction, then
645 // permute it into place, if the idx is a constant and if the idx is
646 // supported by the target.
647 EVT VT = Tmp1.getValueType();
648 EVT EltVT = VT.getVectorElementType();
649 EVT IdxVT = Tmp3.getValueType();
650 EVT PtrVT = TLI.getPointerTy();
651 SDValue StackPtr = DAG.CreateStackTemporary(VT);
653 int SPFI = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex();
656 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Tmp1, StackPtr,
657 PseudoSourceValue::getFixedStack(SPFI), 0,
660 // Truncate or zero extend offset to target pointer type.
661 unsigned CastOpc = IdxVT.bitsGT(PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
662 Tmp3 = DAG.getNode(CastOpc, dl, PtrVT, Tmp3);
663 // Add the offset to the index.
664 unsigned EltSize = EltVT.getSizeInBits()/8;
665 Tmp3 = DAG.getNode(ISD::MUL, dl, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
666 SDValue StackPtr2 = DAG.getNode(ISD::ADD, dl, IdxVT, Tmp3, StackPtr);
667 // Store the scalar value.
668 Ch = DAG.getTruncStore(Ch, dl, Tmp2, StackPtr2,
669 PseudoSourceValue::getFixedStack(SPFI), 0, EltVT,
671 // Load the updated vector.
672 return DAG.getLoad(VT, dl, Ch, StackPtr,
673 PseudoSourceValue::getFixedStack(SPFI), 0,
678 SDValue SelectionDAGLegalize::
679 ExpandINSERT_VECTOR_ELT(SDValue Vec, SDValue Val, SDValue Idx, DebugLoc dl) {
680 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Idx)) {
681 // SCALAR_TO_VECTOR requires that the type of the value being inserted
682 // match the element type of the vector being created, except for
683 // integers in which case the inserted value can be over width.
684 EVT EltVT = Vec.getValueType().getVectorElementType();
685 if (Val.getValueType() == EltVT ||
686 (EltVT.isInteger() && Val.getValueType().bitsGE(EltVT))) {
687 SDValue ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
688 Vec.getValueType(), Val);
690 unsigned NumElts = Vec.getValueType().getVectorNumElements();
691 // We generate a shuffle of InVec and ScVec, so the shuffle mask
692 // should be 0,1,2,3,4,5... with the appropriate element replaced with
694 SmallVector<int, 8> ShufOps;
695 for (unsigned i = 0; i != NumElts; ++i)
696 ShufOps.push_back(i != InsertPos->getZExtValue() ? i : NumElts);
698 return DAG.getVectorShuffle(Vec.getValueType(), dl, Vec, ScVec,
702 return PerformInsertVectorEltInMemory(Vec, Val, Idx, dl);
705 SDValue SelectionDAGLegalize::OptimizeFloatStore(StoreSDNode* ST) {
706 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
707 // FIXME: We shouldn't do this for TargetConstantFP's.
708 // FIXME: move this to the DAG Combiner! Note that we can't regress due
709 // to phase ordering between legalized code and the dag combiner. This
710 // probably means that we need to integrate dag combiner and legalizer
712 // We generally can't do this one for long doubles.
713 SDValue Tmp1 = ST->getChain();
714 SDValue Tmp2 = ST->getBasePtr();
716 int SVOffset = ST->getSrcValueOffset();
717 unsigned Alignment = ST->getAlignment();
718 bool isVolatile = ST->isVolatile();
719 bool isNonTemporal = ST->isNonTemporal();
720 DebugLoc dl = ST->getDebugLoc();
721 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(ST->getValue())) {
722 if (CFP->getValueType(0) == MVT::f32 &&
723 getTypeAction(MVT::i32) == Legal) {
724 Tmp3 = DAG.getConstant(CFP->getValueAPF().
725 bitcastToAPInt().zextOrTrunc(32),
727 return DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
728 SVOffset, isVolatile, isNonTemporal, Alignment);
729 } else if (CFP->getValueType(0) == MVT::f64) {
730 // If this target supports 64-bit registers, do a single 64-bit store.
731 if (getTypeAction(MVT::i64) == Legal) {
732 Tmp3 = DAG.getConstant(CFP->getValueAPF().bitcastToAPInt().
733 zextOrTrunc(64), MVT::i64);
734 return DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
735 SVOffset, isVolatile, isNonTemporal, Alignment);
736 } else if (getTypeAction(MVT::i32) == Legal && !ST->isVolatile()) {
737 // Otherwise, if the target supports 32-bit registers, use 2 32-bit
738 // stores. If the target supports neither 32- nor 64-bits, this
739 // xform is certainly not worth it.
740 const APInt &IntVal =CFP->getValueAPF().bitcastToAPInt();
741 SDValue Lo = DAG.getConstant(APInt(IntVal).trunc(32), MVT::i32);
742 SDValue Hi = DAG.getConstant(IntVal.lshr(32).trunc(32), MVT::i32);
743 if (TLI.isBigEndian()) std::swap(Lo, Hi);
745 Lo = DAG.getStore(Tmp1, dl, Lo, Tmp2, ST->getSrcValue(),
746 SVOffset, isVolatile, isNonTemporal, Alignment);
747 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
748 DAG.getIntPtrConstant(4));
749 Hi = DAG.getStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(), SVOffset+4,
750 isVolatile, isNonTemporal, MinAlign(Alignment, 4U));
752 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
759 /// LegalizeOp - We know that the specified value has a legal type, and
760 /// that its operands are legal. Now ensure that the operation itself
761 /// is legal, recursively ensuring that the operands' operations remain
763 SDValue SelectionDAGLegalize::LegalizeOp(SDValue Op) {
764 if (Op.getOpcode() == ISD::TargetConstant) // Allow illegal target nodes.
767 SDNode *Node = Op.getNode();
768 DebugLoc dl = Node->getDebugLoc();
770 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
771 assert(getTypeAction(Node->getValueType(i)) == Legal &&
772 "Unexpected illegal type!");
774 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
775 assert((isTypeLegal(Node->getOperand(i).getValueType()) ||
776 Node->getOperand(i).getOpcode() == ISD::TargetConstant) &&
777 "Unexpected illegal type!");
779 // Note that LegalizeOp may be reentered even from single-use nodes, which
780 // means that we always must cache transformed nodes.
781 DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
782 if (I != LegalizedNodes.end()) return I->second;
784 SDValue Tmp1, Tmp2, Tmp3, Tmp4;
786 bool isCustom = false;
788 // Figure out the correct action; the way to query this varies by opcode
789 TargetLowering::LegalizeAction Action;
790 bool SimpleFinishLegalizing = true;
791 switch (Node->getOpcode()) {
792 case ISD::INTRINSIC_W_CHAIN:
793 case ISD::INTRINSIC_WO_CHAIN:
794 case ISD::INTRINSIC_VOID:
797 Action = TLI.getOperationAction(Node->getOpcode(), MVT::Other);
799 case ISD::SINT_TO_FP:
800 case ISD::UINT_TO_FP:
801 case ISD::EXTRACT_VECTOR_ELT:
802 Action = TLI.getOperationAction(Node->getOpcode(),
803 Node->getOperand(0).getValueType());
805 case ISD::FP_ROUND_INREG:
806 case ISD::SIGN_EXTEND_INREG: {
807 EVT InnerType = cast<VTSDNode>(Node->getOperand(1))->getVT();
808 Action = TLI.getOperationAction(Node->getOpcode(), InnerType);
814 unsigned CCOperand = Node->getOpcode() == ISD::SELECT_CC ? 4 :
815 Node->getOpcode() == ISD::SETCC ? 2 : 1;
816 unsigned CompareOperand = Node->getOpcode() == ISD::BR_CC ? 2 : 0;
817 EVT OpVT = Node->getOperand(CompareOperand).getValueType();
818 ISD::CondCode CCCode =
819 cast<CondCodeSDNode>(Node->getOperand(CCOperand))->get();
820 Action = TLI.getCondCodeAction(CCCode, OpVT);
821 if (Action == TargetLowering::Legal) {
822 if (Node->getOpcode() == ISD::SELECT_CC)
823 Action = TLI.getOperationAction(Node->getOpcode(),
824 Node->getValueType(0));
826 Action = TLI.getOperationAction(Node->getOpcode(), OpVT);
832 // FIXME: Model these properly. LOAD and STORE are complicated, and
833 // STORE expects the unlegalized operand in some cases.
834 SimpleFinishLegalizing = false;
836 case ISD::CALLSEQ_START:
837 case ISD::CALLSEQ_END:
838 // FIXME: This shouldn't be necessary. These nodes have special properties
839 // dealing with the recursive nature of legalization. Removing this
840 // special case should be done as part of making LegalizeDAG non-recursive.
841 SimpleFinishLegalizing = false;
843 case ISD::EXTRACT_ELEMENT:
844 case ISD::FLT_ROUNDS_:
852 case ISD::MERGE_VALUES:
854 case ISD::FRAME_TO_ARGS_OFFSET:
855 // These operations lie about being legal: when they claim to be legal,
856 // they should actually be expanded.
857 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
858 if (Action == TargetLowering::Legal)
859 Action = TargetLowering::Expand;
861 case ISD::TRAMPOLINE:
863 case ISD::RETURNADDR:
864 // These operations lie about being legal: when they claim to be legal,
865 // they should actually be custom-lowered.
866 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
867 if (Action == TargetLowering::Legal)
868 Action = TargetLowering::Custom;
870 case ISD::BUILD_VECTOR:
871 // A weird case: legalization for BUILD_VECTOR never legalizes the
873 // FIXME: This really sucks... changing it isn't semantically incorrect,
874 // but it massively pessimizes the code for floating-point BUILD_VECTORs
875 // because ConstantFP operands get legalized into constant pool loads
876 // before the BUILD_VECTOR code can see them. It doesn't usually bite,
877 // though, because BUILD_VECTORS usually get lowered into other nodes
878 // which get legalized properly.
879 SimpleFinishLegalizing = false;
882 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
883 Action = TargetLowering::Legal;
885 Action = TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0));
890 if (SimpleFinishLegalizing) {
891 SmallVector<SDValue, 8> Ops, ResultVals;
892 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
893 Ops.push_back(LegalizeOp(Node->getOperand(i)));
894 switch (Node->getOpcode()) {
901 // Branches tweak the chain to include LastCALLSEQ_END
902 Ops[0] = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Ops[0],
904 Ops[0] = LegalizeOp(Ops[0]);
905 LastCALLSEQ_END = DAG.getEntryNode();
912 // Legalizing shifts/rotates requires adjusting the shift amount
913 // to the appropriate width.
914 if (!Ops[1].getValueType().isVector())
915 Ops[1] = LegalizeOp(DAG.getShiftAmountOperand(Ops[1]));
920 // Legalizing shifts/rotates requires adjusting the shift amount
921 // to the appropriate width.
922 if (!Ops[2].getValueType().isVector())
923 Ops[2] = LegalizeOp(DAG.getShiftAmountOperand(Ops[2]));
927 Result = DAG.UpdateNodeOperands(Result.getValue(0), Ops.data(),
930 case TargetLowering::Legal:
931 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
932 ResultVals.push_back(Result.getValue(i));
934 case TargetLowering::Custom:
935 // FIXME: The handling for custom lowering with multiple results is
937 Tmp1 = TLI.LowerOperation(Result, DAG);
938 if (Tmp1.getNode()) {
939 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
941 ResultVals.push_back(Tmp1);
943 ResultVals.push_back(Tmp1.getValue(i));
949 case TargetLowering::Expand:
950 ExpandNode(Result.getNode(), ResultVals);
952 case TargetLowering::Promote:
953 PromoteNode(Result.getNode(), ResultVals);
956 if (!ResultVals.empty()) {
957 for (unsigned i = 0, e = ResultVals.size(); i != e; ++i) {
958 if (ResultVals[i] != SDValue(Node, i))
959 ResultVals[i] = LegalizeOp(ResultVals[i]);
960 AddLegalizedOperand(SDValue(Node, i), ResultVals[i]);
962 return ResultVals[Op.getResNo()];
966 switch (Node->getOpcode()) {
973 assert(0 && "Do not know how to legalize this operator!");
975 case ISD::BUILD_VECTOR:
976 switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) {
977 default: assert(0 && "This action is not supported yet!");
978 case TargetLowering::Custom:
979 Tmp3 = TLI.LowerOperation(Result, DAG);
980 if (Tmp3.getNode()) {
985 case TargetLowering::Expand:
986 Result = ExpandBUILD_VECTOR(Result.getNode());
990 case ISD::CALLSEQ_START: {
991 SDNode *CallEnd = FindCallEndFromCallStart(Node);
993 // Recursively Legalize all of the inputs of the call end that do not lead
994 // to this call start. This ensures that any libcalls that need be inserted
995 // are inserted *before* the CALLSEQ_START.
996 {SmallPtrSet<SDNode*, 32> NodesLeadingTo;
997 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
998 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).getNode(), Node,
1002 // Now that we legalized all of the inputs (which may have inserted
1003 // libcalls) create the new CALLSEQ_START node.
1004 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1006 // Merge in the last call, to ensure that this call start after the last
1008 if (LastCALLSEQ_END.getOpcode() != ISD::EntryToken) {
1009 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
1010 Tmp1, LastCALLSEQ_END);
1011 Tmp1 = LegalizeOp(Tmp1);
1014 // Do not try to legalize the target-specific arguments (#1+).
1015 if (Tmp1 != Node->getOperand(0)) {
1016 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1018 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1021 // Remember that the CALLSEQ_START is legalized.
1022 AddLegalizedOperand(Op.getValue(0), Result);
1023 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
1024 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1026 // Now that the callseq_start and all of the non-call nodes above this call
1027 // sequence have been legalized, legalize the call itself. During this
1028 // process, no libcalls can/will be inserted, guaranteeing that no calls
1030 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
1031 // Note that we are selecting this call!
1032 LastCALLSEQ_END = SDValue(CallEnd, 0);
1033 IsLegalizingCall = true;
1035 // Legalize the call, starting from the CALLSEQ_END.
1036 LegalizeOp(LastCALLSEQ_END);
1037 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
1040 case ISD::CALLSEQ_END:
1041 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
1042 // will cause this node to be legalized as well as handling libcalls right.
1043 if (LastCALLSEQ_END.getNode() != Node) {
1044 LegalizeOp(SDValue(FindCallStartFromCallEnd(Node), 0));
1045 DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
1046 assert(I != LegalizedNodes.end() &&
1047 "Legalizing the call start should have legalized this node!");
1051 // Otherwise, the call start has been legalized and everything is going
1052 // according to plan. Just legalize ourselves normally here.
1053 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1054 // Do not try to legalize the target-specific arguments (#1+), except for
1055 // an optional flag input.
1056 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
1057 if (Tmp1 != Node->getOperand(0)) {
1058 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1060 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1063 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
1064 if (Tmp1 != Node->getOperand(0) ||
1065 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
1066 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1069 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1072 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
1073 // This finishes up call legalization.
1074 IsLegalizingCall = false;
1076 // If the CALLSEQ_END node has a flag, remember that we legalized it.
1077 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
1078 if (Node->getNumValues() == 2)
1079 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
1080 return Result.getValue(Op.getResNo());
1082 LoadSDNode *LD = cast<LoadSDNode>(Node);
1083 Tmp1 = LegalizeOp(LD->getChain()); // Legalize the chain.
1084 Tmp2 = LegalizeOp(LD->getBasePtr()); // Legalize the base pointer.
1086 ISD::LoadExtType ExtType = LD->getExtensionType();
1087 if (ExtType == ISD::NON_EXTLOAD) {
1088 EVT VT = Node->getValueType(0);
1089 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1090 Tmp3 = Result.getValue(0);
1091 Tmp4 = Result.getValue(1);
1093 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1094 default: assert(0 && "This action is not supported yet!");
1095 case TargetLowering::Legal:
1096 // If this is an unaligned load and the target doesn't support it,
1098 if (!TLI.allowsUnalignedMemoryAccesses(LD->getMemoryVT())) {
1099 const Type *Ty = LD->getMemoryVT().getTypeForEVT(*DAG.getContext());
1100 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1101 if (LD->getAlignment() < ABIAlignment){
1102 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.getNode()),
1104 Tmp3 = Result.getOperand(0);
1105 Tmp4 = Result.getOperand(1);
1106 Tmp3 = LegalizeOp(Tmp3);
1107 Tmp4 = LegalizeOp(Tmp4);
1111 case TargetLowering::Custom:
1112 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
1113 if (Tmp1.getNode()) {
1114 Tmp3 = LegalizeOp(Tmp1);
1115 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1118 case TargetLowering::Promote: {
1119 // Only promote a load of vector type to another.
1120 assert(VT.isVector() && "Cannot promote this load!");
1121 // Change base type to a different vector type.
1122 EVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
1124 Tmp1 = DAG.getLoad(NVT, dl, Tmp1, Tmp2, LD->getSrcValue(),
1125 LD->getSrcValueOffset(),
1126 LD->isVolatile(), LD->isNonTemporal(),
1127 LD->getAlignment());
1128 Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, dl, VT, Tmp1));
1129 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1133 // Since loads produce two values, make sure to remember that we
1134 // legalized both of them.
1135 AddLegalizedOperand(SDValue(Node, 0), Tmp3);
1136 AddLegalizedOperand(SDValue(Node, 1), Tmp4);
1137 return Op.getResNo() ? Tmp4 : Tmp3;
1139 EVT SrcVT = LD->getMemoryVT();
1140 unsigned SrcWidth = SrcVT.getSizeInBits();
1141 int SVOffset = LD->getSrcValueOffset();
1142 unsigned Alignment = LD->getAlignment();
1143 bool isVolatile = LD->isVolatile();
1144 bool isNonTemporal = LD->isNonTemporal();
1146 if (SrcWidth != SrcVT.getStoreSizeInBits() &&
1147 // Some targets pretend to have an i1 loading operation, and actually
1148 // load an i8. This trick is correct for ZEXTLOAD because the top 7
1149 // bits are guaranteed to be zero; it helps the optimizers understand
1150 // that these bits are zero. It is also useful for EXTLOAD, since it
1151 // tells the optimizers that those bits are undefined. It would be
1152 // nice to have an effective generic way of getting these benefits...
1153 // Until such a way is found, don't insist on promoting i1 here.
1154 (SrcVT != MVT::i1 ||
1155 TLI.getLoadExtAction(ExtType, MVT::i1) == TargetLowering::Promote)) {
1156 // Promote to a byte-sized load if not loading an integral number of
1157 // bytes. For example, promote EXTLOAD:i20 -> EXTLOAD:i24.
1158 unsigned NewWidth = SrcVT.getStoreSizeInBits();
1159 EVT NVT = EVT::getIntegerVT(*DAG.getContext(), NewWidth);
1162 // The extra bits are guaranteed to be zero, since we stored them that
1163 // way. A zext load from NVT thus automatically gives zext from SrcVT.
1165 ISD::LoadExtType NewExtType =
1166 ExtType == ISD::ZEXTLOAD ? ISD::ZEXTLOAD : ISD::EXTLOAD;
1168 Result = DAG.getExtLoad(NewExtType, dl, Node->getValueType(0),
1169 Tmp1, Tmp2, LD->getSrcValue(), SVOffset,
1170 NVT, isVolatile, isNonTemporal, Alignment);
1172 Ch = Result.getValue(1); // The chain.
1174 if (ExtType == ISD::SEXTLOAD)
1175 // Having the top bits zero doesn't help when sign extending.
1176 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
1177 Result.getValueType(),
1178 Result, DAG.getValueType(SrcVT));
1179 else if (ExtType == ISD::ZEXTLOAD || NVT == Result.getValueType())
1180 // All the top bits are guaranteed to be zero - inform the optimizers.
1181 Result = DAG.getNode(ISD::AssertZext, dl,
1182 Result.getValueType(), Result,
1183 DAG.getValueType(SrcVT));
1185 Tmp1 = LegalizeOp(Result);
1186 Tmp2 = LegalizeOp(Ch);
1187 } else if (SrcWidth & (SrcWidth - 1)) {
1188 // If not loading a power-of-2 number of bits, expand as two loads.
1189 assert(!SrcVT.isVector() && "Unsupported extload!");
1190 unsigned RoundWidth = 1 << Log2_32(SrcWidth);
1191 assert(RoundWidth < SrcWidth);
1192 unsigned ExtraWidth = SrcWidth - RoundWidth;
1193 assert(ExtraWidth < RoundWidth);
1194 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
1195 "Load size not an integral number of bytes!");
1196 EVT RoundVT = EVT::getIntegerVT(*DAG.getContext(), RoundWidth);
1197 EVT ExtraVT = EVT::getIntegerVT(*DAG.getContext(), ExtraWidth);
1199 unsigned IncrementSize;
1201 if (TLI.isLittleEndian()) {
1202 // EXTLOAD:i24 -> ZEXTLOAD:i16 | (shl EXTLOAD@+2:i8, 16)
1203 // Load the bottom RoundWidth bits.
1204 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl,
1205 Node->getValueType(0), Tmp1, Tmp2,
1206 LD->getSrcValue(), SVOffset, RoundVT, isVolatile,
1207 isNonTemporal, Alignment);
1209 // Load the remaining ExtraWidth bits.
1210 IncrementSize = RoundWidth / 8;
1211 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1212 DAG.getIntPtrConstant(IncrementSize));
1213 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
1214 LD->getSrcValue(), SVOffset + IncrementSize,
1215 ExtraVT, isVolatile, isNonTemporal,
1216 MinAlign(Alignment, IncrementSize));
1218 // Build a factor node to remember that this load is independent of the
1220 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1223 // Move the top bits to the right place.
1224 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
1225 DAG.getConstant(RoundWidth, TLI.getShiftAmountTy()));
1227 // Join the hi and lo parts.
1228 Result = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
1230 // Big endian - avoid unaligned loads.
1231 // EXTLOAD:i24 -> (shl EXTLOAD:i16, 8) | ZEXTLOAD@+2:i8
1232 // Load the top RoundWidth bits.
1233 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
1234 LD->getSrcValue(), SVOffset, RoundVT, isVolatile,
1235 isNonTemporal, Alignment);
1237 // Load the remaining ExtraWidth bits.
1238 IncrementSize = RoundWidth / 8;
1239 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1240 DAG.getIntPtrConstant(IncrementSize));
1241 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl,
1242 Node->getValueType(0), Tmp1, Tmp2,
1243 LD->getSrcValue(), SVOffset + IncrementSize,
1244 ExtraVT, isVolatile, isNonTemporal,
1245 MinAlign(Alignment, IncrementSize));
1247 // Build a factor node to remember that this load is independent of the
1249 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
1252 // Move the top bits to the right place.
1253 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
1254 DAG.getConstant(ExtraWidth, TLI.getShiftAmountTy()));
1256 // Join the hi and lo parts.
1257 Result = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
1260 Tmp1 = LegalizeOp(Result);
1261 Tmp2 = LegalizeOp(Ch);
1263 switch (TLI.getLoadExtAction(ExtType, SrcVT)) {
1264 default: assert(0 && "This action is not supported yet!");
1265 case TargetLowering::Custom:
1268 case TargetLowering::Legal:
1269 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1270 Tmp1 = Result.getValue(0);
1271 Tmp2 = Result.getValue(1);
1274 Tmp3 = TLI.LowerOperation(Result, DAG);
1275 if (Tmp3.getNode()) {
1276 Tmp1 = LegalizeOp(Tmp3);
1277 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1280 // If this is an unaligned load and the target doesn't support it,
1282 if (!TLI.allowsUnalignedMemoryAccesses(LD->getMemoryVT())) {
1283 const Type *Ty = LD->getMemoryVT().getTypeForEVT(*DAG.getContext());
1284 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1285 if (LD->getAlignment() < ABIAlignment){
1286 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.getNode()),
1288 Tmp1 = Result.getOperand(0);
1289 Tmp2 = Result.getOperand(1);
1290 Tmp1 = LegalizeOp(Tmp1);
1291 Tmp2 = LegalizeOp(Tmp2);
1296 case TargetLowering::Expand:
1297 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
1298 // f128 = EXTLOAD {f32,f64} too
1299 if ((SrcVT == MVT::f32 && (Node->getValueType(0) == MVT::f64 ||
1300 Node->getValueType(0) == MVT::f128)) ||
1301 (SrcVT == MVT::f64 && Node->getValueType(0) == MVT::f128)) {
1302 SDValue Load = DAG.getLoad(SrcVT, dl, Tmp1, Tmp2, LD->getSrcValue(),
1303 LD->getSrcValueOffset(),
1304 LD->isVolatile(), LD->isNonTemporal(),
1305 LD->getAlignment());
1306 Result = DAG.getNode(ISD::FP_EXTEND, dl,
1307 Node->getValueType(0), Load);
1308 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
1309 Tmp2 = LegalizeOp(Load.getValue(1));
1312 assert(ExtType != ISD::EXTLOAD &&"EXTLOAD should always be supported!");
1313 // Turn the unsupported load into an EXTLOAD followed by an explicit
1314 // zero/sign extend inreg.
1315 Result = DAG.getExtLoad(ISD::EXTLOAD, dl, Node->getValueType(0),
1316 Tmp1, Tmp2, LD->getSrcValue(),
1317 LD->getSrcValueOffset(), SrcVT,
1318 LD->isVolatile(), LD->isNonTemporal(),
1319 LD->getAlignment());
1321 if (ExtType == ISD::SEXTLOAD)
1322 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
1323 Result.getValueType(),
1324 Result, DAG.getValueType(SrcVT));
1326 ValRes = DAG.getZeroExtendInReg(Result, dl, SrcVT);
1327 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
1328 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
1333 // Since loads produce two values, make sure to remember that we legalized
1335 AddLegalizedOperand(SDValue(Node, 0), Tmp1);
1336 AddLegalizedOperand(SDValue(Node, 1), Tmp2);
1337 return Op.getResNo() ? Tmp2 : Tmp1;
1341 StoreSDNode *ST = cast<StoreSDNode>(Node);
1342 Tmp1 = LegalizeOp(ST->getChain()); // Legalize the chain.
1343 Tmp2 = LegalizeOp(ST->getBasePtr()); // Legalize the pointer.
1344 int SVOffset = ST->getSrcValueOffset();
1345 unsigned Alignment = ST->getAlignment();
1346 bool isVolatile = ST->isVolatile();
1347 bool isNonTemporal = ST->isNonTemporal();
1349 if (!ST->isTruncatingStore()) {
1350 if (SDNode *OptStore = OptimizeFloatStore(ST).getNode()) {
1351 Result = SDValue(OptStore, 0);
1356 Tmp3 = LegalizeOp(ST->getValue());
1357 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1360 EVT VT = Tmp3.getValueType();
1361 switch (TLI.getOperationAction(ISD::STORE, VT)) {
1362 default: assert(0 && "This action is not supported yet!");
1363 case TargetLowering::Legal:
1364 // If this is an unaligned store and the target doesn't support it,
1366 if (!TLI.allowsUnalignedMemoryAccesses(ST->getMemoryVT())) {
1367 const Type *Ty = ST->getMemoryVT().getTypeForEVT(*DAG.getContext());
1368 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1369 if (ST->getAlignment() < ABIAlignment)
1370 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.getNode()),
1374 case TargetLowering::Custom:
1375 Tmp1 = TLI.LowerOperation(Result, DAG);
1376 if (Tmp1.getNode()) Result = Tmp1;
1378 case TargetLowering::Promote:
1379 assert(VT.isVector() && "Unknown legal promote case!");
1380 Tmp3 = DAG.getNode(ISD::BIT_CONVERT, dl,
1381 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
1382 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2,
1383 ST->getSrcValue(), SVOffset, isVolatile,
1384 isNonTemporal, Alignment);
1390 Tmp3 = LegalizeOp(ST->getValue());
1392 EVT StVT = ST->getMemoryVT();
1393 unsigned StWidth = StVT.getSizeInBits();
1395 if (StWidth != StVT.getStoreSizeInBits()) {
1396 // Promote to a byte-sized store with upper bits zero if not
1397 // storing an integral number of bytes. For example, promote
1398 // TRUNCSTORE:i1 X -> TRUNCSTORE:i8 (and X, 1)
1399 EVT NVT = EVT::getIntegerVT(*DAG.getContext(),
1400 StVT.getStoreSizeInBits());
1401 Tmp3 = DAG.getZeroExtendInReg(Tmp3, dl, StVT);
1402 Result = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1403 SVOffset, NVT, isVolatile, isNonTemporal,
1405 } else if (StWidth & (StWidth - 1)) {
1406 // If not storing a power-of-2 number of bits, expand as two stores.
1407 assert(!StVT.isVector() && "Unsupported truncstore!");
1408 unsigned RoundWidth = 1 << Log2_32(StWidth);
1409 assert(RoundWidth < StWidth);
1410 unsigned ExtraWidth = StWidth - RoundWidth;
1411 assert(ExtraWidth < RoundWidth);
1412 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
1413 "Store size not an integral number of bytes!");
1414 EVT RoundVT = EVT::getIntegerVT(*DAG.getContext(), RoundWidth);
1415 EVT ExtraVT = EVT::getIntegerVT(*DAG.getContext(), ExtraWidth);
1417 unsigned IncrementSize;
1419 if (TLI.isLittleEndian()) {
1420 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 X, TRUNCSTORE@+2:i8 (srl X, 16)
1421 // Store the bottom RoundWidth bits.
1422 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1424 isVolatile, isNonTemporal, Alignment);
1426 // Store the remaining ExtraWidth bits.
1427 IncrementSize = RoundWidth / 8;
1428 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1429 DAG.getIntPtrConstant(IncrementSize));
1430 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
1431 DAG.getConstant(RoundWidth, TLI.getShiftAmountTy()));
1432 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(),
1433 SVOffset + IncrementSize, ExtraVT, isVolatile,
1435 MinAlign(Alignment, IncrementSize));
1437 // Big endian - avoid unaligned stores.
1438 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 (srl X, 8), TRUNCSTORE@+2:i8 X
1439 // Store the top RoundWidth bits.
1440 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
1441 DAG.getConstant(ExtraWidth, TLI.getShiftAmountTy()));
1442 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(),
1443 SVOffset, RoundVT, isVolatile, isNonTemporal,
1446 // Store the remaining ExtraWidth bits.
1447 IncrementSize = RoundWidth / 8;
1448 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
1449 DAG.getIntPtrConstant(IncrementSize));
1450 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1451 SVOffset + IncrementSize, ExtraVT, isVolatile,
1453 MinAlign(Alignment, IncrementSize));
1456 // The order of the stores doesn't matter.
1457 Result = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
1459 if (Tmp1 != ST->getChain() || Tmp3 != ST->getValue() ||
1460 Tmp2 != ST->getBasePtr())
1461 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1464 switch (TLI.getTruncStoreAction(ST->getValue().getValueType(), StVT)) {
1465 default: assert(0 && "This action is not supported yet!");
1466 case TargetLowering::Legal:
1467 // If this is an unaligned store and the target doesn't support it,
1469 if (!TLI.allowsUnalignedMemoryAccesses(ST->getMemoryVT())) {
1470 const Type *Ty = ST->getMemoryVT().getTypeForEVT(*DAG.getContext());
1471 unsigned ABIAlignment = TLI.getTargetData()->getABITypeAlignment(Ty);
1472 if (ST->getAlignment() < ABIAlignment)
1473 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.getNode()),
1477 case TargetLowering::Custom:
1478 Result = TLI.LowerOperation(Result, DAG);
1481 // TRUNCSTORE:i16 i32 -> STORE i16
1482 assert(isTypeLegal(StVT) && "Do not know how to expand this store!");
1483 Tmp3 = DAG.getNode(ISD::TRUNCATE, dl, StVT, Tmp3);
1484 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
1485 SVOffset, isVolatile, isNonTemporal,
1494 assert(Result.getValueType() == Op.getValueType() &&
1495 "Bad legalization!");
1497 // Make sure that the generated code is itself legal.
1499 Result = LegalizeOp(Result);
1501 // Note that LegalizeOp may be reentered even from single-use nodes, which
1502 // means that we always must cache transformed nodes.
1503 AddLegalizedOperand(Op, Result);
1507 SDValue SelectionDAGLegalize::ExpandExtractFromVectorThroughStack(SDValue Op) {
1508 SDValue Vec = Op.getOperand(0);
1509 SDValue Idx = Op.getOperand(1);
1510 DebugLoc dl = Op.getDebugLoc();
1511 // Store the value to a temporary stack slot, then LOAD the returned part.
1512 SDValue StackPtr = DAG.CreateStackTemporary(Vec.getValueType());
1513 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, NULL, 0,
1516 // Add the offset to the index.
1518 Vec.getValueType().getVectorElementType().getSizeInBits()/8;
1519 Idx = DAG.getNode(ISD::MUL, dl, Idx.getValueType(), Idx,
1520 DAG.getConstant(EltSize, Idx.getValueType()));
1522 if (Idx.getValueType().bitsGT(TLI.getPointerTy()))
1523 Idx = DAG.getNode(ISD::TRUNCATE, dl, TLI.getPointerTy(), Idx);
1525 Idx = DAG.getNode(ISD::ZERO_EXTEND, dl, TLI.getPointerTy(), Idx);
1527 StackPtr = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx, StackPtr);
1529 if (Op.getValueType().isVector())
1530 return DAG.getLoad(Op.getValueType(), dl, Ch, StackPtr, NULL, 0,
1533 return DAG.getExtLoad(ISD::EXTLOAD, dl, Op.getValueType(), Ch, StackPtr,
1534 NULL, 0, Vec.getValueType().getVectorElementType(),
1538 SDValue SelectionDAGLegalize::ExpandVectorBuildThroughStack(SDNode* Node) {
1539 // We can't handle this case efficiently. Allocate a sufficiently
1540 // aligned object on the stack, store each element into it, then load
1541 // the result as a vector.
1542 // Create the stack frame object.
1543 EVT VT = Node->getValueType(0);
1544 EVT EltVT = VT.getVectorElementType();
1545 DebugLoc dl = Node->getDebugLoc();
1546 SDValue FIPtr = DAG.CreateStackTemporary(VT);
1547 int FI = cast<FrameIndexSDNode>(FIPtr.getNode())->getIndex();
1548 const Value *SV = PseudoSourceValue::getFixedStack(FI);
1550 // Emit a store of each element to the stack slot.
1551 SmallVector<SDValue, 8> Stores;
1552 unsigned TypeByteSize = EltVT.getSizeInBits() / 8;
1553 // Store (in the right endianness) the elements to memory.
1554 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1555 // Ignore undef elements.
1556 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
1558 unsigned Offset = TypeByteSize*i;
1560 SDValue Idx = DAG.getConstant(Offset, FIPtr.getValueType());
1561 Idx = DAG.getNode(ISD::ADD, dl, FIPtr.getValueType(), FIPtr, Idx);
1563 // If the destination vector element type is narrower than the source
1564 // element type, only store the bits necessary.
1565 if (EltVT.bitsLT(Node->getOperand(i).getValueType().getScalarType())) {
1566 Stores.push_back(DAG.getTruncStore(DAG.getEntryNode(), dl,
1567 Node->getOperand(i), Idx, SV, Offset,
1568 EltVT, false, false, 0));
1570 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl,
1571 Node->getOperand(i), Idx, SV, Offset,
1576 if (!Stores.empty()) // Not all undef elements?
1577 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
1578 &Stores[0], Stores.size());
1580 StoreChain = DAG.getEntryNode();
1582 // Result is a load from the stack slot.
1583 return DAG.getLoad(VT, dl, StoreChain, FIPtr, SV, 0, false, false, 0);
1586 SDValue SelectionDAGLegalize::ExpandFCOPYSIGN(SDNode* Node) {
1587 DebugLoc dl = Node->getDebugLoc();
1588 SDValue Tmp1 = Node->getOperand(0);
1589 SDValue Tmp2 = Node->getOperand(1);
1591 // Get the sign bit of the RHS. First obtain a value that has the same
1592 // sign as the sign bit, i.e. negative if and only if the sign bit is 1.
1594 EVT FloatVT = Tmp2.getValueType();
1595 EVT IVT = EVT::getIntegerVT(*DAG.getContext(), FloatVT.getSizeInBits());
1596 if (isTypeLegal(IVT)) {
1597 // Convert to an integer with the same sign bit.
1598 SignBit = DAG.getNode(ISD::BIT_CONVERT, dl, IVT, Tmp2);
1600 // Store the float to memory, then load the sign part out as an integer.
1601 MVT LoadTy = TLI.getPointerTy();
1602 // First create a temporary that is aligned for both the load and store.
1603 SDValue StackPtr = DAG.CreateStackTemporary(FloatVT, LoadTy);
1604 // Then store the float to it.
1606 DAG.getStore(DAG.getEntryNode(), dl, Tmp2, StackPtr, NULL, 0,
1608 if (TLI.isBigEndian()) {
1609 assert(FloatVT.isByteSized() && "Unsupported floating point type!");
1610 // Load out a legal integer with the same sign bit as the float.
1611 SignBit = DAG.getLoad(LoadTy, dl, Ch, StackPtr, NULL, 0, false, false, 0);
1612 } else { // Little endian
1613 SDValue LoadPtr = StackPtr;
1614 // The float may be wider than the integer we are going to load. Advance
1615 // the pointer so that the loaded integer will contain the sign bit.
1616 unsigned Strides = (FloatVT.getSizeInBits()-1)/LoadTy.getSizeInBits();
1617 unsigned ByteOffset = (Strides * LoadTy.getSizeInBits()) / 8;
1618 LoadPtr = DAG.getNode(ISD::ADD, dl, LoadPtr.getValueType(),
1619 LoadPtr, DAG.getIntPtrConstant(ByteOffset));
1620 // Load a legal integer containing the sign bit.
1621 SignBit = DAG.getLoad(LoadTy, dl, Ch, LoadPtr, NULL, 0, false, false, 0);
1622 // Move the sign bit to the top bit of the loaded integer.
1623 unsigned BitShift = LoadTy.getSizeInBits() -
1624 (FloatVT.getSizeInBits() - 8 * ByteOffset);
1625 assert(BitShift < LoadTy.getSizeInBits() && "Pointer advanced wrong?");
1627 SignBit = DAG.getNode(ISD::SHL, dl, LoadTy, SignBit,
1628 DAG.getConstant(BitShift,TLI.getShiftAmountTy()));
1631 // Now get the sign bit proper, by seeing whether the value is negative.
1632 SignBit = DAG.getSetCC(dl, TLI.getSetCCResultType(SignBit.getValueType()),
1633 SignBit, DAG.getConstant(0, SignBit.getValueType()),
1635 // Get the absolute value of the result.
1636 SDValue AbsVal = DAG.getNode(ISD::FABS, dl, Tmp1.getValueType(), Tmp1);
1637 // Select between the nabs and abs value based on the sign bit of
1639 return DAG.getNode(ISD::SELECT, dl, AbsVal.getValueType(), SignBit,
1640 DAG.getNode(ISD::FNEG, dl, AbsVal.getValueType(), AbsVal),
1644 void SelectionDAGLegalize::ExpandDYNAMIC_STACKALLOC(SDNode* Node,
1645 SmallVectorImpl<SDValue> &Results) {
1646 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1647 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1648 " not tell us which reg is the stack pointer!");
1649 DebugLoc dl = Node->getDebugLoc();
1650 EVT VT = Node->getValueType(0);
1651 SDValue Tmp1 = SDValue(Node, 0);
1652 SDValue Tmp2 = SDValue(Node, 1);
1653 SDValue Tmp3 = Node->getOperand(2);
1654 SDValue Chain = Tmp1.getOperand(0);
1656 // Chain the dynamic stack allocation so that it doesn't modify the stack
1657 // pointer when other instructions are using the stack.
1658 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true));
1660 SDValue Size = Tmp2.getOperand(1);
1661 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
1662 Chain = SP.getValue(1);
1663 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
1664 unsigned StackAlign =
1665 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
1666 if (Align > StackAlign)
1667 SP = DAG.getNode(ISD::AND, dl, VT, SP,
1668 DAG.getConstant(-(uint64_t)Align, VT));
1669 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
1670 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
1672 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
1673 DAG.getIntPtrConstant(0, true), SDValue());
1675 Results.push_back(Tmp1);
1676 Results.push_back(Tmp2);
1679 /// LegalizeSetCCCondCode - Legalize a SETCC with given LHS and RHS and
1680 /// condition code CC on the current target. This routine expands SETCC with
1681 /// illegal condition code into AND / OR of multiple SETCC values.
1682 void SelectionDAGLegalize::LegalizeSetCCCondCode(EVT VT,
1683 SDValue &LHS, SDValue &RHS,
1686 EVT OpVT = LHS.getValueType();
1687 ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get();
1688 switch (TLI.getCondCodeAction(CCCode, OpVT)) {
1689 default: assert(0 && "Unknown condition code action!");
1690 case TargetLowering::Legal:
1693 case TargetLowering::Expand: {
1694 ISD::CondCode CC1 = ISD::SETCC_INVALID, CC2 = ISD::SETCC_INVALID;
1697 default: assert(0 && "Don't know how to expand this condition!");
1698 case ISD::SETOEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETO; Opc = ISD::AND; break;
1699 case ISD::SETOGT: CC1 = ISD::SETGT; CC2 = ISD::SETO; Opc = ISD::AND; break;
1700 case ISD::SETOGE: CC1 = ISD::SETGE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1701 case ISD::SETOLT: CC1 = ISD::SETLT; CC2 = ISD::SETO; Opc = ISD::AND; break;
1702 case ISD::SETOLE: CC1 = ISD::SETLE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1703 case ISD::SETONE: CC1 = ISD::SETNE; CC2 = ISD::SETO; Opc = ISD::AND; break;
1704 case ISD::SETUEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1705 case ISD::SETUGT: CC1 = ISD::SETGT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1706 case ISD::SETUGE: CC1 = ISD::SETGE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1707 case ISD::SETULT: CC1 = ISD::SETLT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1708 case ISD::SETULE: CC1 = ISD::SETLE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1709 case ISD::SETUNE: CC1 = ISD::SETNE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
1710 // FIXME: Implement more expansions.
1713 SDValue SetCC1 = DAG.getSetCC(dl, VT, LHS, RHS, CC1);
1714 SDValue SetCC2 = DAG.getSetCC(dl, VT, LHS, RHS, CC2);
1715 LHS = DAG.getNode(Opc, dl, VT, SetCC1, SetCC2);
1723 /// EmitStackConvert - Emit a store/load combination to the stack. This stores
1724 /// SrcOp to a stack slot of type SlotVT, truncating it if needed. It then does
1725 /// a load from the stack slot to DestVT, extending it if needed.
1726 /// The resultant code need not be legal.
1727 SDValue SelectionDAGLegalize::EmitStackConvert(SDValue SrcOp,
1731 // Create the stack frame object.
1733 TLI.getTargetData()->getPrefTypeAlignment(SrcOp.getValueType().
1734 getTypeForEVT(*DAG.getContext()));
1735 SDValue FIPtr = DAG.CreateStackTemporary(SlotVT, SrcAlign);
1737 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(FIPtr);
1738 int SPFI = StackPtrFI->getIndex();
1739 const Value *SV = PseudoSourceValue::getFixedStack(SPFI);
1741 unsigned SrcSize = SrcOp.getValueType().getSizeInBits();
1742 unsigned SlotSize = SlotVT.getSizeInBits();
1743 unsigned DestSize = DestVT.getSizeInBits();
1744 const Type *DestType = DestVT.getTypeForEVT(*DAG.getContext());
1745 unsigned DestAlign = TLI.getTargetData()->getPrefTypeAlignment(DestType);
1747 // Emit a store to the stack slot. Use a truncstore if the input value is
1748 // later than DestVT.
1751 if (SrcSize > SlotSize)
1752 Store = DAG.getTruncStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
1753 SV, 0, SlotVT, false, false, SrcAlign);
1755 assert(SrcSize == SlotSize && "Invalid store");
1756 Store = DAG.getStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
1757 SV, 0, false, false, SrcAlign);
1760 // Result is a load from the stack slot.
1761 if (SlotSize == DestSize)
1762 return DAG.getLoad(DestVT, dl, Store, FIPtr, SV, 0, false, false,
1765 assert(SlotSize < DestSize && "Unknown extension!");
1766 return DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT, Store, FIPtr, SV, 0, SlotVT,
1767 false, false, DestAlign);
1770 SDValue SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
1771 DebugLoc dl = Node->getDebugLoc();
1772 // Create a vector sized/aligned stack slot, store the value to element #0,
1773 // then load the whole vector back out.
1774 SDValue StackPtr = DAG.CreateStackTemporary(Node->getValueType(0));
1776 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(StackPtr);
1777 int SPFI = StackPtrFI->getIndex();
1779 SDValue Ch = DAG.getTruncStore(DAG.getEntryNode(), dl, Node->getOperand(0),
1781 PseudoSourceValue::getFixedStack(SPFI), 0,
1782 Node->getValueType(0).getVectorElementType(),
1784 return DAG.getLoad(Node->getValueType(0), dl, Ch, StackPtr,
1785 PseudoSourceValue::getFixedStack(SPFI), 0,
1790 /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
1791 /// support the operation, but do support the resultant vector type.
1792 SDValue SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
1793 unsigned NumElems = Node->getNumOperands();
1794 SDValue Value1, Value2;
1795 DebugLoc dl = Node->getDebugLoc();
1796 EVT VT = Node->getValueType(0);
1797 EVT OpVT = Node->getOperand(0).getValueType();
1798 EVT EltVT = VT.getVectorElementType();
1800 // If the only non-undef value is the low element, turn this into a
1801 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
1802 bool isOnlyLowElement = true;
1803 bool MoreThanTwoValues = false;
1804 bool isConstant = true;
1805 for (unsigned i = 0; i < NumElems; ++i) {
1806 SDValue V = Node->getOperand(i);
1807 if (V.getOpcode() == ISD::UNDEF)
1810 isOnlyLowElement = false;
1811 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V))
1814 if (!Value1.getNode()) {
1816 } else if (!Value2.getNode()) {
1819 } else if (V != Value1 && V != Value2) {
1820 MoreThanTwoValues = true;
1824 if (!Value1.getNode())
1825 return DAG.getUNDEF(VT);
1827 if (isOnlyLowElement)
1828 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Node->getOperand(0));
1830 // If all elements are constants, create a load from the constant pool.
1832 std::vector<Constant*> CV;
1833 for (unsigned i = 0, e = NumElems; i != e; ++i) {
1834 if (ConstantFPSDNode *V =
1835 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
1836 CV.push_back(const_cast<ConstantFP *>(V->getConstantFPValue()));
1837 } else if (ConstantSDNode *V =
1838 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
1840 CV.push_back(const_cast<ConstantInt *>(V->getConstantIntValue()));
1842 // If OpVT and EltVT don't match, EltVT is not legal and the
1843 // element values have been promoted/truncated earlier. Undo this;
1844 // we don't want a v16i8 to become a v16i32 for example.
1845 const ConstantInt *CI = V->getConstantIntValue();
1846 CV.push_back(ConstantInt::get(EltVT.getTypeForEVT(*DAG.getContext()),
1847 CI->getZExtValue()));
1850 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
1851 const Type *OpNTy = EltVT.getTypeForEVT(*DAG.getContext());
1852 CV.push_back(UndefValue::get(OpNTy));
1855 Constant *CP = ConstantVector::get(CV);
1856 SDValue CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
1857 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
1858 return DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
1859 PseudoSourceValue::getConstantPool(), 0,
1860 false, false, Alignment);
1863 if (!MoreThanTwoValues) {
1864 SmallVector<int, 8> ShuffleVec(NumElems, -1);
1865 for (unsigned i = 0; i < NumElems; ++i) {
1866 SDValue V = Node->getOperand(i);
1867 if (V.getOpcode() == ISD::UNDEF)
1869 ShuffleVec[i] = V == Value1 ? 0 : NumElems;
1871 if (TLI.isShuffleMaskLegal(ShuffleVec, Node->getValueType(0))) {
1872 // Get the splatted value into the low element of a vector register.
1873 SDValue Vec1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Value1);
1875 if (Value2.getNode())
1876 Vec2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Value2);
1878 Vec2 = DAG.getUNDEF(VT);
1880 // Return shuffle(LowValVec, undef, <0,0,0,0>)
1881 return DAG.getVectorShuffle(VT, dl, Vec1, Vec2, ShuffleVec.data());
1885 // Otherwise, we can't handle this case efficiently.
1886 return ExpandVectorBuildThroughStack(Node);
1889 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
1890 // does not fit into a register, return the lo part and set the hi part to the
1891 // by-reg argument. If it does fit into a single register, return the result
1892 // and leave the Hi part unset.
1893 SDValue SelectionDAGLegalize::ExpandLibCall(RTLIB::Libcall LC, SDNode *Node,
1895 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
1896 // The input chain to this libcall is the entry node of the function.
1897 // Legalizing the call will automatically add the previous call to the
1899 SDValue InChain = DAG.getEntryNode();
1901 TargetLowering::ArgListTy Args;
1902 TargetLowering::ArgListEntry Entry;
1903 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1904 EVT ArgVT = Node->getOperand(i).getValueType();
1905 const Type *ArgTy = ArgVT.getTypeForEVT(*DAG.getContext());
1906 Entry.Node = Node->getOperand(i); Entry.Ty = ArgTy;
1907 Entry.isSExt = isSigned;
1908 Entry.isZExt = !isSigned;
1909 Args.push_back(Entry);
1911 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC),
1912 TLI.getPointerTy());
1914 // Splice the libcall in wherever FindInputOutputChains tells us to.
1915 const Type *RetTy = Node->getValueType(0).getTypeForEVT(*DAG.getContext());
1916 std::pair<SDValue, SDValue> CallInfo =
1917 TLI.LowerCallTo(InChain, RetTy, isSigned, !isSigned, false, false,
1918 0, TLI.getLibcallCallingConv(LC), false,
1919 /*isReturnValueUsed=*/true,
1920 Callee, Args, DAG, Node->getDebugLoc());
1922 // Legalize the call sequence, starting with the chain. This will advance
1923 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
1924 // was added by LowerCallTo (guaranteeing proper serialization of calls).
1925 LegalizeOp(CallInfo.second);
1926 return CallInfo.first;
1929 SDValue SelectionDAGLegalize::ExpandFPLibCall(SDNode* Node,
1930 RTLIB::Libcall Call_F32,
1931 RTLIB::Libcall Call_F64,
1932 RTLIB::Libcall Call_F80,
1933 RTLIB::Libcall Call_PPCF128) {
1935 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1936 default: assert(0 && "Unexpected request for libcall!");
1937 case MVT::f32: LC = Call_F32; break;
1938 case MVT::f64: LC = Call_F64; break;
1939 case MVT::f80: LC = Call_F80; break;
1940 case MVT::ppcf128: LC = Call_PPCF128; break;
1942 return ExpandLibCall(LC, Node, false);
1945 SDValue SelectionDAGLegalize::ExpandIntLibCall(SDNode* Node, bool isSigned,
1946 RTLIB::Libcall Call_I8,
1947 RTLIB::Libcall Call_I16,
1948 RTLIB::Libcall Call_I32,
1949 RTLIB::Libcall Call_I64,
1950 RTLIB::Libcall Call_I128) {
1952 switch (Node->getValueType(0).getSimpleVT().SimpleTy) {
1953 default: assert(0 && "Unexpected request for libcall!");
1954 case MVT::i8: LC = Call_I8; break;
1955 case MVT::i16: LC = Call_I16; break;
1956 case MVT::i32: LC = Call_I32; break;
1957 case MVT::i64: LC = Call_I64; break;
1958 case MVT::i128: LC = Call_I128; break;
1960 return ExpandLibCall(LC, Node, isSigned);
1963 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
1964 /// INT_TO_FP operation of the specified operand when the target requests that
1965 /// we expand it. At this point, we know that the result and operand types are
1966 /// legal for the target.
1967 SDValue SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
1971 if (Op0.getValueType() == MVT::i32) {
1972 // simple 32-bit [signed|unsigned] integer to float/double expansion
1974 // Get the stack frame index of a 8 byte buffer.
1975 SDValue StackSlot = DAG.CreateStackTemporary(MVT::f64);
1977 // word offset constant for Hi/Lo address computation
1978 SDValue WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
1979 // set up Hi and Lo (into buffer) address based on endian
1980 SDValue Hi = StackSlot;
1981 SDValue Lo = DAG.getNode(ISD::ADD, dl,
1982 TLI.getPointerTy(), StackSlot, WordOff);
1983 if (TLI.isLittleEndian())
1986 // if signed map to unsigned space
1989 // constant used to invert sign bit (signed to unsigned mapping)
1990 SDValue SignBit = DAG.getConstant(0x80000000u, MVT::i32);
1991 Op0Mapped = DAG.getNode(ISD::XOR, dl, MVT::i32, Op0, SignBit);
1995 // store the lo of the constructed double - based on integer input
1996 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl,
1997 Op0Mapped, Lo, NULL, 0,
1999 // initial hi portion of constructed double
2000 SDValue InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
2001 // store the hi of the constructed double - biased exponent
2002 SDValue Store2=DAG.getStore(Store1, dl, InitialHi, Hi, NULL, 0,
2004 // load the constructed double
2005 SDValue Load = DAG.getLoad(MVT::f64, dl, Store2, StackSlot, NULL, 0,
2007 // FP constant to bias correct the final result
2008 SDValue Bias = DAG.getConstantFP(isSigned ?
2009 BitsToDouble(0x4330000080000000ULL) :
2010 BitsToDouble(0x4330000000000000ULL),
2012 // subtract the bias
2013 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Load, Bias);
2016 // handle final rounding
2017 if (DestVT == MVT::f64) {
2020 } else if (DestVT.bitsLT(MVT::f64)) {
2021 Result = DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
2022 DAG.getIntPtrConstant(0));
2023 } else if (DestVT.bitsGT(MVT::f64)) {
2024 Result = DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
2028 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
2030 // Implementation of unsigned i64 to f64 following the algorithm in
2031 // __floatundidf in compiler_rt. This implementation has the advantage
2032 // of performing rounding correctly, both in the default rounding mode
2033 // and in all alternate rounding modes.
2034 // TODO: Generalize this for use with other types.
2035 if (Op0.getValueType() == MVT::i64 && DestVT == MVT::f64) {
2037 DAG.getConstant(UINT64_C(0x4330000000000000), MVT::i64);
2038 SDValue TwoP84PlusTwoP52 =
2039 DAG.getConstantFP(BitsToDouble(UINT64_C(0x4530000000100000)), MVT::f64);
2041 DAG.getConstant(UINT64_C(0x4530000000000000), MVT::i64);
2043 SDValue Lo = DAG.getZeroExtendInReg(Op0, dl, MVT::i32);
2044 SDValue Hi = DAG.getNode(ISD::SRL, dl, MVT::i64, Op0,
2045 DAG.getConstant(32, MVT::i64));
2046 SDValue LoOr = DAG.getNode(ISD::OR, dl, MVT::i64, Lo, TwoP52);
2047 SDValue HiOr = DAG.getNode(ISD::OR, dl, MVT::i64, Hi, TwoP84);
2048 SDValue LoFlt = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f64, LoOr);
2049 SDValue HiFlt = DAG.getNode(ISD::BIT_CONVERT, dl, MVT::f64, HiOr);
2050 SDValue HiSub = DAG.getNode(ISD::FSUB, dl, MVT::f64, HiFlt, TwoP84PlusTwoP52);
2051 return DAG.getNode(ISD::FADD, dl, MVT::f64, LoFlt, HiSub);
2054 SDValue Tmp1 = DAG.getNode(ISD::SINT_TO_FP, dl, DestVT, Op0);
2056 SDValue SignSet = DAG.getSetCC(dl, TLI.getSetCCResultType(Op0.getValueType()),
2057 Op0, DAG.getConstant(0, Op0.getValueType()),
2059 SDValue Zero = DAG.getIntPtrConstant(0), Four = DAG.getIntPtrConstant(4);
2060 SDValue CstOffset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(),
2061 SignSet, Four, Zero);
2063 // If the sign bit of the integer is set, the large number will be treated
2064 // as a negative number. To counteract this, the dynamic code adds an
2065 // offset depending on the data type.
2067 switch (Op0.getValueType().getSimpleVT().SimpleTy) {
2068 default: assert(0 && "Unsupported integer type!");
2069 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
2070 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
2071 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
2072 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
2074 if (TLI.isLittleEndian()) FF <<= 32;
2075 Constant *FudgeFactor = ConstantInt::get(
2076 Type::getInt64Ty(*DAG.getContext()), FF);
2078 SDValue CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
2079 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
2080 CPIdx = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), CPIdx, CstOffset);
2081 Alignment = std::min(Alignment, 4u);
2083 if (DestVT == MVT::f32)
2084 FudgeInReg = DAG.getLoad(MVT::f32, dl, DAG.getEntryNode(), CPIdx,
2085 PseudoSourceValue::getConstantPool(), 0,
2086 false, false, Alignment);
2089 LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT,
2090 DAG.getEntryNode(), CPIdx,
2091 PseudoSourceValue::getConstantPool(), 0,
2092 MVT::f32, false, false, Alignment));
2095 return DAG.getNode(ISD::FADD, dl, DestVT, Tmp1, FudgeInReg);
2098 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
2099 /// *INT_TO_FP operation of the specified operand when the target requests that
2100 /// we promote it. At this point, we know that the result and operand types are
2101 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
2102 /// operation that takes a larger input.
2103 SDValue SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDValue LegalOp,
2107 // First step, figure out the appropriate *INT_TO_FP operation to use.
2108 EVT NewInTy = LegalOp.getValueType();
2110 unsigned OpToUse = 0;
2112 // Scan for the appropriate larger type to use.
2114 NewInTy = (MVT::SimpleValueType)(NewInTy.getSimpleVT().SimpleTy+1);
2115 assert(NewInTy.isInteger() && "Ran out of possibilities!");
2117 // If the target supports SINT_TO_FP of this type, use it.
2118 if (TLI.isOperationLegalOrCustom(ISD::SINT_TO_FP, NewInTy)) {
2119 OpToUse = ISD::SINT_TO_FP;
2122 if (isSigned) continue;
2124 // If the target supports UINT_TO_FP of this type, use it.
2125 if (TLI.isOperationLegalOrCustom(ISD::UINT_TO_FP, NewInTy)) {
2126 OpToUse = ISD::UINT_TO_FP;
2130 // Otherwise, try a larger type.
2133 // Okay, we found the operation and type to use. Zero extend our input to the
2134 // desired type then run the operation on it.
2135 return DAG.getNode(OpToUse, dl, DestVT,
2136 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
2137 dl, NewInTy, LegalOp));
2140 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
2141 /// FP_TO_*INT operation of the specified operand when the target requests that
2142 /// we promote it. At this point, we know that the result and operand types are
2143 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
2144 /// operation that returns a larger result.
2145 SDValue SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDValue LegalOp,
2149 // First step, figure out the appropriate FP_TO*INT operation to use.
2150 EVT NewOutTy = DestVT;
2152 unsigned OpToUse = 0;
2154 // Scan for the appropriate larger type to use.
2156 NewOutTy = (MVT::SimpleValueType)(NewOutTy.getSimpleVT().SimpleTy+1);
2157 assert(NewOutTy.isInteger() && "Ran out of possibilities!");
2159 if (TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NewOutTy)) {
2160 OpToUse = ISD::FP_TO_SINT;
2164 if (TLI.isOperationLegalOrCustom(ISD::FP_TO_UINT, NewOutTy)) {
2165 OpToUse = ISD::FP_TO_UINT;
2169 // Otherwise, try a larger type.
2173 // Okay, we found the operation and type to use.
2174 SDValue Operation = DAG.getNode(OpToUse, dl, NewOutTy, LegalOp);
2176 // Truncate the result of the extended FP_TO_*INT operation to the desired
2178 return DAG.getNode(ISD::TRUNCATE, dl, DestVT, Operation);
2181 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
2183 SDValue SelectionDAGLegalize::ExpandBSWAP(SDValue Op, DebugLoc dl) {
2184 EVT VT = Op.getValueType();
2185 EVT SHVT = TLI.getShiftAmountTy();
2186 SDValue Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
2187 switch (VT.getSimpleVT().SimpleTy) {
2188 default: assert(0 && "Unhandled Expand type in BSWAP!");
2190 Tmp2 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2191 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2192 return DAG.getNode(ISD::OR, dl, VT, Tmp1, Tmp2);
2194 Tmp4 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
2195 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2196 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2197 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
2198 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
2199 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(0xFF00, VT));
2200 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
2201 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
2202 return DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
2204 Tmp8 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(56, SHVT));
2205 Tmp7 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(40, SHVT));
2206 Tmp6 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
2207 Tmp5 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
2208 Tmp4 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
2209 Tmp3 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
2210 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(40, SHVT));
2211 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(56, SHVT));
2212 Tmp7 = DAG.getNode(ISD::AND, dl, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
2213 Tmp6 = DAG.getNode(ISD::AND, dl, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
2214 Tmp5 = DAG.getNode(ISD::AND, dl, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
2215 Tmp4 = DAG.getNode(ISD::AND, dl, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
2216 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
2217 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
2218 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp7);
2219 Tmp6 = DAG.getNode(ISD::OR, dl, VT, Tmp6, Tmp5);
2220 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
2221 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
2222 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp6);
2223 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
2224 return DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp4);
2228 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
2230 SDValue SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDValue Op,
2233 default: assert(0 && "Cannot expand this yet!");
2235 static const uint64_t mask[6] = {
2236 0x5555555555555555ULL, 0x3333333333333333ULL,
2237 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
2238 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
2240 EVT VT = Op.getValueType();
2241 EVT ShVT = TLI.getShiftAmountTy();
2242 unsigned len = VT.getSizeInBits();
2243 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
2244 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
2245 unsigned EltSize = VT.isVector() ?
2246 VT.getVectorElementType().getSizeInBits() : len;
2247 SDValue Tmp2 = DAG.getConstant(APInt(EltSize, mask[i]), VT);
2248 SDValue Tmp3 = DAG.getConstant(1ULL << i, ShVT);
2249 Op = DAG.getNode(ISD::ADD, dl, VT,
2250 DAG.getNode(ISD::AND, dl, VT, Op, Tmp2),
2251 DAG.getNode(ISD::AND, dl, VT,
2252 DAG.getNode(ISD::SRL, dl, VT, Op, Tmp3),
2258 // for now, we do this:
2259 // x = x | (x >> 1);
2260 // x = x | (x >> 2);
2262 // x = x | (x >>16);
2263 // x = x | (x >>32); // for 64-bit input
2264 // return popcount(~x);
2266 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
2267 EVT VT = Op.getValueType();
2268 EVT ShVT = TLI.getShiftAmountTy();
2269 unsigned len = VT.getSizeInBits();
2270 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
2271 SDValue Tmp3 = DAG.getConstant(1ULL << i, ShVT);
2272 Op = DAG.getNode(ISD::OR, dl, VT, Op,
2273 DAG.getNode(ISD::SRL, dl, VT, Op, Tmp3));
2275 Op = DAG.getNOT(dl, Op, VT);
2276 return DAG.getNode(ISD::CTPOP, dl, VT, Op);
2279 // for now, we use: { return popcount(~x & (x - 1)); }
2280 // unless the target has ctlz but not ctpop, in which case we use:
2281 // { return 32 - nlz(~x & (x-1)); }
2282 // see also http://www.hackersdelight.org/HDcode/ntz.cc
2283 EVT VT = Op.getValueType();
2284 SDValue Tmp3 = DAG.getNode(ISD::AND, dl, VT,
2285 DAG.getNOT(dl, Op, VT),
2286 DAG.getNode(ISD::SUB, dl, VT, Op,
2287 DAG.getConstant(1, VT)));
2288 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
2289 if (!TLI.isOperationLegalOrCustom(ISD::CTPOP, VT) &&
2290 TLI.isOperationLegalOrCustom(ISD::CTLZ, VT))
2291 return DAG.getNode(ISD::SUB, dl, VT,
2292 DAG.getConstant(VT.getSizeInBits(), VT),
2293 DAG.getNode(ISD::CTLZ, dl, VT, Tmp3));
2294 return DAG.getNode(ISD::CTPOP, dl, VT, Tmp3);
2299 void SelectionDAGLegalize::ExpandNode(SDNode *Node,
2300 SmallVectorImpl<SDValue> &Results) {
2301 DebugLoc dl = Node->getDebugLoc();
2302 SDValue Tmp1, Tmp2, Tmp3, Tmp4;
2303 switch (Node->getOpcode()) {
2307 Tmp1 = ExpandBitCount(Node->getOpcode(), Node->getOperand(0), dl);
2308 Results.push_back(Tmp1);
2311 Results.push_back(ExpandBSWAP(Node->getOperand(0), dl));
2313 case ISD::FRAMEADDR:
2314 case ISD::RETURNADDR:
2315 case ISD::FRAME_TO_ARGS_OFFSET:
2316 Results.push_back(DAG.getConstant(0, Node->getValueType(0)));
2318 case ISD::FLT_ROUNDS_:
2319 Results.push_back(DAG.getConstant(1, Node->getValueType(0)));
2321 case ISD::EH_RETURN:
2324 case ISD::MEMBARRIER:
2326 Results.push_back(Node->getOperand(0));
2328 case ISD::DYNAMIC_STACKALLOC:
2329 ExpandDYNAMIC_STACKALLOC(Node, Results);
2331 case ISD::MERGE_VALUES:
2332 for (unsigned i = 0; i < Node->getNumValues(); i++)
2333 Results.push_back(Node->getOperand(i));
2336 EVT VT = Node->getValueType(0);
2338 Results.push_back(DAG.getConstant(0, VT));
2340 assert(VT.isFloatingPoint() && "Unknown value type!");
2341 Results.push_back(DAG.getConstantFP(0, VT));
2346 // If this operation is not supported, lower it to 'abort()' call
2347 TargetLowering::ArgListTy Args;
2348 std::pair<SDValue, SDValue> CallResult =
2349 TLI.LowerCallTo(Node->getOperand(0), Type::getVoidTy(*DAG.getContext()),
2350 false, false, false, false, 0, CallingConv::C, false,
2351 /*isReturnValueUsed=*/true,
2352 DAG.getExternalSymbol("abort", TLI.getPointerTy()),
2354 Results.push_back(CallResult.second);
2358 case ISD::BIT_CONVERT:
2359 Tmp1 = EmitStackConvert(Node->getOperand(0), Node->getValueType(0),
2360 Node->getValueType(0), dl);
2361 Results.push_back(Tmp1);
2363 case ISD::FP_EXTEND:
2364 Tmp1 = EmitStackConvert(Node->getOperand(0),
2365 Node->getOperand(0).getValueType(),
2366 Node->getValueType(0), dl);
2367 Results.push_back(Tmp1);
2369 case ISD::SIGN_EXTEND_INREG: {
2370 // NOTE: we could fall back on load/store here too for targets without
2371 // SAR. However, it is doubtful that any exist.
2372 EVT ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2373 EVT VT = Node->getValueType(0);
2374 EVT ShiftAmountTy = TLI.getShiftAmountTy();
2377 unsigned BitsDiff = VT.getScalarType().getSizeInBits() -
2378 ExtraVT.getScalarType().getSizeInBits();
2379 SDValue ShiftCst = DAG.getConstant(BitsDiff, ShiftAmountTy);
2380 Tmp1 = DAG.getNode(ISD::SHL, dl, Node->getValueType(0),
2381 Node->getOperand(0), ShiftCst);
2382 Tmp1 = DAG.getNode(ISD::SRA, dl, Node->getValueType(0), Tmp1, ShiftCst);
2383 Results.push_back(Tmp1);
2386 case ISD::FP_ROUND_INREG: {
2387 // The only way we can lower this is to turn it into a TRUNCSTORE,
2388 // EXTLOAD pair, targetting a temporary location (a stack slot).
2390 // NOTE: there is a choice here between constantly creating new stack
2391 // slots and always reusing the same one. We currently always create
2392 // new ones, as reuse may inhibit scheduling.
2393 EVT ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2394 Tmp1 = EmitStackConvert(Node->getOperand(0), ExtraVT,
2395 Node->getValueType(0), dl);
2396 Results.push_back(Tmp1);
2399 case ISD::SINT_TO_FP:
2400 case ISD::UINT_TO_FP:
2401 Tmp1 = ExpandLegalINT_TO_FP(Node->getOpcode() == ISD::SINT_TO_FP,
2402 Node->getOperand(0), Node->getValueType(0), dl);
2403 Results.push_back(Tmp1);
2405 case ISD::FP_TO_UINT: {
2406 SDValue True, False;
2407 EVT VT = Node->getOperand(0).getValueType();
2408 EVT NVT = Node->getValueType(0);
2409 const uint64_t zero[] = {0, 0};
2410 APFloat apf = APFloat(APInt(VT.getSizeInBits(), 2, zero));
2411 APInt x = APInt::getSignBit(NVT.getSizeInBits());
2412 (void)apf.convertFromAPInt(x, false, APFloat::rmNearestTiesToEven);
2413 Tmp1 = DAG.getConstantFP(apf, VT);
2414 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(VT),
2415 Node->getOperand(0),
2417 True = DAG.getNode(ISD::FP_TO_SINT, dl, NVT, Node->getOperand(0));
2418 False = DAG.getNode(ISD::FP_TO_SINT, dl, NVT,
2419 DAG.getNode(ISD::FSUB, dl, VT,
2420 Node->getOperand(0), Tmp1));
2421 False = DAG.getNode(ISD::XOR, dl, NVT, False,
2422 DAG.getConstant(x, NVT));
2423 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2, True, False);
2424 Results.push_back(Tmp1);
2428 const Value *V = cast<SrcValueSDNode>(Node->getOperand(2))->getValue();
2429 EVT VT = Node->getValueType(0);
2430 Tmp1 = Node->getOperand(0);
2431 Tmp2 = Node->getOperand(1);
2432 SDValue VAList = DAG.getLoad(TLI.getPointerTy(), dl, Tmp1, Tmp2, V, 0,
2434 // Increment the pointer, VAList, to the next vaarg
2435 Tmp3 = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), VAList,
2436 DAG.getConstant(TLI.getTargetData()->
2437 getTypeAllocSize(VT.getTypeForEVT(*DAG.getContext())),
2438 TLI.getPointerTy()));
2439 // Store the incremented VAList to the legalized pointer
2440 Tmp3 = DAG.getStore(VAList.getValue(1), dl, Tmp3, Tmp2, V, 0,
2442 // Load the actual argument out of the pointer VAList
2443 Results.push_back(DAG.getLoad(VT, dl, Tmp3, VAList, NULL, 0,
2445 Results.push_back(Results[0].getValue(1));
2449 // This defaults to loading a pointer from the input and storing it to the
2450 // output, returning the chain.
2451 const Value *VD = cast<SrcValueSDNode>(Node->getOperand(3))->getValue();
2452 const Value *VS = cast<SrcValueSDNode>(Node->getOperand(4))->getValue();
2453 Tmp1 = DAG.getLoad(TLI.getPointerTy(), dl, Node->getOperand(0),
2454 Node->getOperand(2), VS, 0, false, false, 0);
2455 Tmp1 = DAG.getStore(Tmp1.getValue(1), dl, Tmp1, Node->getOperand(1), VD, 0,
2457 Results.push_back(Tmp1);
2460 case ISD::EXTRACT_VECTOR_ELT:
2461 if (Node->getOperand(0).getValueType().getVectorNumElements() == 1)
2462 // This must be an access of the only element. Return it.
2463 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, Node->getValueType(0),
2464 Node->getOperand(0));
2466 Tmp1 = ExpandExtractFromVectorThroughStack(SDValue(Node, 0));
2467 Results.push_back(Tmp1);
2469 case ISD::EXTRACT_SUBVECTOR:
2470 Results.push_back(ExpandExtractFromVectorThroughStack(SDValue(Node, 0)));
2472 case ISD::CONCAT_VECTORS: {
2473 Results.push_back(ExpandVectorBuildThroughStack(Node));
2476 case ISD::SCALAR_TO_VECTOR:
2477 Results.push_back(ExpandSCALAR_TO_VECTOR(Node));
2479 case ISD::INSERT_VECTOR_ELT:
2480 Results.push_back(ExpandINSERT_VECTOR_ELT(Node->getOperand(0),
2481 Node->getOperand(1),
2482 Node->getOperand(2), dl));
2484 case ISD::VECTOR_SHUFFLE: {
2485 SmallVector<int, 8> Mask;
2486 cast<ShuffleVectorSDNode>(Node)->getMask(Mask);
2488 EVT VT = Node->getValueType(0);
2489 EVT EltVT = VT.getVectorElementType();
2490 unsigned NumElems = VT.getVectorNumElements();
2491 SmallVector<SDValue, 8> Ops;
2492 for (unsigned i = 0; i != NumElems; ++i) {
2494 Ops.push_back(DAG.getUNDEF(EltVT));
2497 unsigned Idx = Mask[i];
2499 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
2500 Node->getOperand(0),
2501 DAG.getIntPtrConstant(Idx)));
2503 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT,
2504 Node->getOperand(1),
2505 DAG.getIntPtrConstant(Idx - NumElems)));
2507 Tmp1 = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, &Ops[0], Ops.size());
2508 Results.push_back(Tmp1);
2511 case ISD::EXTRACT_ELEMENT: {
2512 EVT OpTy = Node->getOperand(0).getValueType();
2513 if (cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue()) {
2515 Tmp1 = DAG.getNode(ISD::SRL, dl, OpTy, Node->getOperand(0),
2516 DAG.getConstant(OpTy.getSizeInBits()/2,
2517 TLI.getShiftAmountTy()));
2518 Tmp1 = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0), Tmp1);
2521 Tmp1 = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0),
2522 Node->getOperand(0));
2524 Results.push_back(Tmp1);
2527 case ISD::STACKSAVE:
2528 // Expand to CopyFromReg if the target set
2529 // StackPointerRegisterToSaveRestore.
2530 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2531 Results.push_back(DAG.getCopyFromReg(Node->getOperand(0), dl, SP,
2532 Node->getValueType(0)));
2533 Results.push_back(Results[0].getValue(1));
2535 Results.push_back(DAG.getUNDEF(Node->getValueType(0)));
2536 Results.push_back(Node->getOperand(0));
2539 case ISD::STACKRESTORE:
2540 // Expand to CopyToReg if the target set
2541 // StackPointerRegisterToSaveRestore.
2542 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2543 Results.push_back(DAG.getCopyToReg(Node->getOperand(0), dl, SP,
2544 Node->getOperand(1)));
2546 Results.push_back(Node->getOperand(0));
2549 case ISD::FCOPYSIGN:
2550 Results.push_back(ExpandFCOPYSIGN(Node));
2553 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
2554 Tmp1 = DAG.getConstantFP(-0.0, Node->getValueType(0));
2555 Tmp1 = DAG.getNode(ISD::FSUB, dl, Node->getValueType(0), Tmp1,
2556 Node->getOperand(0));
2557 Results.push_back(Tmp1);
2560 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
2561 EVT VT = Node->getValueType(0);
2562 Tmp1 = Node->getOperand(0);
2563 Tmp2 = DAG.getConstantFP(0.0, VT);
2564 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(Tmp1.getValueType()),
2565 Tmp1, Tmp2, ISD::SETUGT);
2566 Tmp3 = DAG.getNode(ISD::FNEG, dl, VT, Tmp1);
2567 Tmp1 = DAG.getNode(ISD::SELECT, dl, VT, Tmp2, Tmp1, Tmp3);
2568 Results.push_back(Tmp1);
2572 Results.push_back(ExpandFPLibCall(Node, RTLIB::SQRT_F32, RTLIB::SQRT_F64,
2573 RTLIB::SQRT_F80, RTLIB::SQRT_PPCF128));
2576 Results.push_back(ExpandFPLibCall(Node, RTLIB::SIN_F32, RTLIB::SIN_F64,
2577 RTLIB::SIN_F80, RTLIB::SIN_PPCF128));
2580 Results.push_back(ExpandFPLibCall(Node, RTLIB::COS_F32, RTLIB::COS_F64,
2581 RTLIB::COS_F80, RTLIB::COS_PPCF128));
2584 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG_F32, RTLIB::LOG_F64,
2585 RTLIB::LOG_F80, RTLIB::LOG_PPCF128));
2588 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG2_F32, RTLIB::LOG2_F64,
2589 RTLIB::LOG2_F80, RTLIB::LOG2_PPCF128));
2592 Results.push_back(ExpandFPLibCall(Node, RTLIB::LOG10_F32, RTLIB::LOG10_F64,
2593 RTLIB::LOG10_F80, RTLIB::LOG10_PPCF128));
2596 Results.push_back(ExpandFPLibCall(Node, RTLIB::EXP_F32, RTLIB::EXP_F64,
2597 RTLIB::EXP_F80, RTLIB::EXP_PPCF128));
2600 Results.push_back(ExpandFPLibCall(Node, RTLIB::EXP2_F32, RTLIB::EXP2_F64,
2601 RTLIB::EXP2_F80, RTLIB::EXP2_PPCF128));
2604 Results.push_back(ExpandFPLibCall(Node, RTLIB::TRUNC_F32, RTLIB::TRUNC_F64,
2605 RTLIB::TRUNC_F80, RTLIB::TRUNC_PPCF128));
2608 Results.push_back(ExpandFPLibCall(Node, RTLIB::FLOOR_F32, RTLIB::FLOOR_F64,
2609 RTLIB::FLOOR_F80, RTLIB::FLOOR_PPCF128));
2612 Results.push_back(ExpandFPLibCall(Node, RTLIB::CEIL_F32, RTLIB::CEIL_F64,
2613 RTLIB::CEIL_F80, RTLIB::CEIL_PPCF128));
2616 Results.push_back(ExpandFPLibCall(Node, RTLIB::RINT_F32, RTLIB::RINT_F64,
2617 RTLIB::RINT_F80, RTLIB::RINT_PPCF128));
2619 case ISD::FNEARBYINT:
2620 Results.push_back(ExpandFPLibCall(Node, RTLIB::NEARBYINT_F32,
2621 RTLIB::NEARBYINT_F64,
2622 RTLIB::NEARBYINT_F80,
2623 RTLIB::NEARBYINT_PPCF128));
2626 Results.push_back(ExpandFPLibCall(Node, RTLIB::POWI_F32, RTLIB::POWI_F64,
2627 RTLIB::POWI_F80, RTLIB::POWI_PPCF128));
2630 Results.push_back(ExpandFPLibCall(Node, RTLIB::POW_F32, RTLIB::POW_F64,
2631 RTLIB::POW_F80, RTLIB::POW_PPCF128));
2634 Results.push_back(ExpandFPLibCall(Node, RTLIB::DIV_F32, RTLIB::DIV_F64,
2635 RTLIB::DIV_F80, RTLIB::DIV_PPCF128));
2638 Results.push_back(ExpandFPLibCall(Node, RTLIB::REM_F32, RTLIB::REM_F64,
2639 RTLIB::REM_F80, RTLIB::REM_PPCF128));
2641 case ISD::FP16_TO_FP32:
2642 Results.push_back(ExpandLibCall(RTLIB::FPEXT_F16_F32, Node, false));
2644 case ISD::FP32_TO_FP16:
2645 Results.push_back(ExpandLibCall(RTLIB::FPROUND_F32_F16, Node, false));
2647 case ISD::ConstantFP: {
2648 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
2649 // Check to see if this FP immediate is already legal.
2650 // If this is a legal constant, turn it into a TargetConstantFP node.
2651 if (TLI.isFPImmLegal(CFP->getValueAPF(), Node->getValueType(0)))
2652 Results.push_back(SDValue(Node, 0));
2654 Results.push_back(ExpandConstantFP(CFP, true, DAG, TLI));
2657 case ISD::EHSELECTION: {
2658 unsigned Reg = TLI.getExceptionSelectorRegister();
2659 assert(Reg && "Can't expand to unknown register!");
2660 Results.push_back(DAG.getCopyFromReg(Node->getOperand(1), dl, Reg,
2661 Node->getValueType(0)));
2662 Results.push_back(Results[0].getValue(1));
2665 case ISD::EXCEPTIONADDR: {
2666 unsigned Reg = TLI.getExceptionAddressRegister();
2667 assert(Reg && "Can't expand to unknown register!");
2668 Results.push_back(DAG.getCopyFromReg(Node->getOperand(0), dl, Reg,
2669 Node->getValueType(0)));
2670 Results.push_back(Results[0].getValue(1));
2674 EVT VT = Node->getValueType(0);
2675 assert(TLI.isOperationLegalOrCustom(ISD::ADD, VT) &&
2676 TLI.isOperationLegalOrCustom(ISD::XOR, VT) &&
2677 "Don't know how to expand this subtraction!");
2678 Tmp1 = DAG.getNode(ISD::XOR, dl, VT, Node->getOperand(1),
2679 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), VT));
2680 Tmp1 = DAG.getNode(ISD::ADD, dl, VT, Tmp2, DAG.getConstant(1, VT));
2681 Results.push_back(DAG.getNode(ISD::ADD, dl, VT, Node->getOperand(0), Tmp1));
2686 EVT VT = Node->getValueType(0);
2687 SDVTList VTs = DAG.getVTList(VT, VT);
2688 bool isSigned = Node->getOpcode() == ISD::SREM;
2689 unsigned DivOpc = isSigned ? ISD::SDIV : ISD::UDIV;
2690 unsigned DivRemOpc = isSigned ? ISD::SDIVREM : ISD::UDIVREM;
2691 Tmp2 = Node->getOperand(0);
2692 Tmp3 = Node->getOperand(1);
2693 if (TLI.isOperationLegalOrCustom(DivRemOpc, VT)) {
2694 Tmp1 = DAG.getNode(DivRemOpc, dl, VTs, Tmp2, Tmp3).getValue(1);
2695 } else if (TLI.isOperationLegalOrCustom(DivOpc, VT)) {
2697 Tmp1 = DAG.getNode(DivOpc, dl, VT, Tmp2, Tmp3);
2698 Tmp1 = DAG.getNode(ISD::MUL, dl, VT, Tmp1, Tmp3);
2699 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, Tmp2, Tmp1);
2700 } else if (isSigned) {
2701 Tmp1 = ExpandIntLibCall(Node, true,
2703 RTLIB::SREM_I16, RTLIB::SREM_I32,
2704 RTLIB::SREM_I64, RTLIB::SREM_I128);
2706 Tmp1 = ExpandIntLibCall(Node, false,
2708 RTLIB::UREM_I16, RTLIB::UREM_I32,
2709 RTLIB::UREM_I64, RTLIB::UREM_I128);
2711 Results.push_back(Tmp1);
2716 bool isSigned = Node->getOpcode() == ISD::SDIV;
2717 unsigned DivRemOpc = isSigned ? ISD::SDIVREM : ISD::UDIVREM;
2718 EVT VT = Node->getValueType(0);
2719 SDVTList VTs = DAG.getVTList(VT, VT);
2720 if (TLI.isOperationLegalOrCustom(DivRemOpc, VT))
2721 Tmp1 = DAG.getNode(DivRemOpc, dl, VTs, Node->getOperand(0),
2722 Node->getOperand(1));
2724 Tmp1 = ExpandIntLibCall(Node, true,
2726 RTLIB::SDIV_I16, RTLIB::SDIV_I32,
2727 RTLIB::SDIV_I64, RTLIB::SDIV_I128);
2729 Tmp1 = ExpandIntLibCall(Node, false,
2731 RTLIB::UDIV_I16, RTLIB::UDIV_I32,
2732 RTLIB::UDIV_I64, RTLIB::UDIV_I128);
2733 Results.push_back(Tmp1);
2738 unsigned ExpandOpcode = Node->getOpcode() == ISD::MULHU ? ISD::UMUL_LOHI :
2740 EVT VT = Node->getValueType(0);
2741 SDVTList VTs = DAG.getVTList(VT, VT);
2742 assert(TLI.isOperationLegalOrCustom(ExpandOpcode, VT) &&
2743 "If this wasn't legal, it shouldn't have been created!");
2744 Tmp1 = DAG.getNode(ExpandOpcode, dl, VTs, Node->getOperand(0),
2745 Node->getOperand(1));
2746 Results.push_back(Tmp1.getValue(1));
2750 EVT VT = Node->getValueType(0);
2751 SDVTList VTs = DAG.getVTList(VT, VT);
2752 // See if multiply or divide can be lowered using two-result operations.
2753 // We just need the low half of the multiply; try both the signed
2754 // and unsigned forms. If the target supports both SMUL_LOHI and
2755 // UMUL_LOHI, form a preference by checking which forms of plain
2756 // MULH it supports.
2757 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, VT);
2758 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, VT);
2759 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, VT);
2760 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, VT);
2761 unsigned OpToUse = 0;
2762 if (HasSMUL_LOHI && !HasMULHS) {
2763 OpToUse = ISD::SMUL_LOHI;
2764 } else if (HasUMUL_LOHI && !HasMULHU) {
2765 OpToUse = ISD::UMUL_LOHI;
2766 } else if (HasSMUL_LOHI) {
2767 OpToUse = ISD::SMUL_LOHI;
2768 } else if (HasUMUL_LOHI) {
2769 OpToUse = ISD::UMUL_LOHI;
2772 Results.push_back(DAG.getNode(OpToUse, dl, VTs, Node->getOperand(0),
2773 Node->getOperand(1)));
2776 Tmp1 = ExpandIntLibCall(Node, false,
2778 RTLIB::MUL_I16, RTLIB::MUL_I32,
2779 RTLIB::MUL_I64, RTLIB::MUL_I128);
2780 Results.push_back(Tmp1);
2785 SDValue LHS = Node->getOperand(0);
2786 SDValue RHS = Node->getOperand(1);
2787 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::SADDO ?
2788 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2790 Results.push_back(Sum);
2791 EVT OType = Node->getValueType(1);
2793 SDValue Zero = DAG.getConstant(0, LHS.getValueType());
2795 // LHSSign -> LHS >= 0
2796 // RHSSign -> RHS >= 0
2797 // SumSign -> Sum >= 0
2800 // Overflow -> (LHSSign == RHSSign) && (LHSSign != SumSign)
2802 // Overflow -> (LHSSign != RHSSign) && (LHSSign != SumSign)
2804 SDValue LHSSign = DAG.getSetCC(dl, OType, LHS, Zero, ISD::SETGE);
2805 SDValue RHSSign = DAG.getSetCC(dl, OType, RHS, Zero, ISD::SETGE);
2806 SDValue SignsMatch = DAG.getSetCC(dl, OType, LHSSign, RHSSign,
2807 Node->getOpcode() == ISD::SADDO ?
2808 ISD::SETEQ : ISD::SETNE);
2810 SDValue SumSign = DAG.getSetCC(dl, OType, Sum, Zero, ISD::SETGE);
2811 SDValue SumSignNE = DAG.getSetCC(dl, OType, LHSSign, SumSign, ISD::SETNE);
2813 SDValue Cmp = DAG.getNode(ISD::AND, dl, OType, SignsMatch, SumSignNE);
2814 Results.push_back(Cmp);
2819 SDValue LHS = Node->getOperand(0);
2820 SDValue RHS = Node->getOperand(1);
2821 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::UADDO ?
2822 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
2824 Results.push_back(Sum);
2825 Results.push_back(DAG.getSetCC(dl, Node->getValueType(1), Sum, LHS,
2826 Node->getOpcode () == ISD::UADDO ?
2827 ISD::SETULT : ISD::SETUGT));
2832 EVT VT = Node->getValueType(0);
2833 SDValue LHS = Node->getOperand(0);
2834 SDValue RHS = Node->getOperand(1);
2837 static const unsigned Ops[2][3] =
2838 { { ISD::MULHU, ISD::UMUL_LOHI, ISD::ZERO_EXTEND },
2839 { ISD::MULHS, ISD::SMUL_LOHI, ISD::SIGN_EXTEND }};
2840 bool isSigned = Node->getOpcode() == ISD::SMULO;
2841 if (TLI.isOperationLegalOrCustom(Ops[isSigned][0], VT)) {
2842 BottomHalf = DAG.getNode(ISD::MUL, dl, VT, LHS, RHS);
2843 TopHalf = DAG.getNode(Ops[isSigned][0], dl, VT, LHS, RHS);
2844 } else if (TLI.isOperationLegalOrCustom(Ops[isSigned][1], VT)) {
2845 BottomHalf = DAG.getNode(Ops[isSigned][1], dl, DAG.getVTList(VT, VT), LHS,
2847 TopHalf = BottomHalf.getValue(1);
2849 // FIXME: We should be able to fall back to a libcall with an illegal
2850 // type in some cases.
2851 // Also, we can fall back to a division in some cases, but that's a big
2852 // performance hit in the general case.
2853 assert(TLI.isTypeLegal(EVT::getIntegerVT(*DAG.getContext(),
2854 VT.getSizeInBits() * 2)) &&
2855 "Don't know how to expand this operation yet!");
2856 EVT WideVT = EVT::getIntegerVT(*DAG.getContext(), VT.getSizeInBits() * 2);
2857 LHS = DAG.getNode(Ops[isSigned][2], dl, WideVT, LHS);
2858 RHS = DAG.getNode(Ops[isSigned][2], dl, WideVT, RHS);
2859 Tmp1 = DAG.getNode(ISD::MUL, dl, WideVT, LHS, RHS);
2860 BottomHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Tmp1,
2861 DAG.getIntPtrConstant(0));
2862 TopHalf = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, VT, Tmp1,
2863 DAG.getIntPtrConstant(1));
2866 Tmp1 = DAG.getConstant(VT.getSizeInBits() - 1, TLI.getShiftAmountTy());
2867 Tmp1 = DAG.getNode(ISD::SRA, dl, VT, BottomHalf, Tmp1);
2868 TopHalf = DAG.getSetCC(dl, TLI.getSetCCResultType(VT), TopHalf, Tmp1,
2871 TopHalf = DAG.getSetCC(dl, TLI.getSetCCResultType(VT), TopHalf,
2872 DAG.getConstant(0, VT), ISD::SETNE);
2874 Results.push_back(BottomHalf);
2875 Results.push_back(TopHalf);
2878 case ISD::BUILD_PAIR: {
2879 EVT PairTy = Node->getValueType(0);
2880 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, PairTy, Node->getOperand(0));
2881 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, dl, PairTy, Node->getOperand(1));
2882 Tmp2 = DAG.getNode(ISD::SHL, dl, PairTy, Tmp2,
2883 DAG.getConstant(PairTy.getSizeInBits()/2,
2884 TLI.getShiftAmountTy()));
2885 Results.push_back(DAG.getNode(ISD::OR, dl, PairTy, Tmp1, Tmp2));
2889 Tmp1 = Node->getOperand(0);
2890 Tmp2 = Node->getOperand(1);
2891 Tmp3 = Node->getOperand(2);
2892 if (Tmp1.getOpcode() == ISD::SETCC) {
2893 Tmp1 = DAG.getSelectCC(dl, Tmp1.getOperand(0), Tmp1.getOperand(1),
2895 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
2897 Tmp1 = DAG.getSelectCC(dl, Tmp1,
2898 DAG.getConstant(0, Tmp1.getValueType()),
2899 Tmp2, Tmp3, ISD::SETNE);
2901 Results.push_back(Tmp1);
2904 SDValue Chain = Node->getOperand(0);
2905 SDValue Table = Node->getOperand(1);
2906 SDValue Index = Node->getOperand(2);
2908 EVT PTy = TLI.getPointerTy();
2910 const TargetData &TD = *TLI.getTargetData();
2911 unsigned EntrySize =
2912 DAG.getMachineFunction().getJumpTableInfo()->getEntrySize(TD);
2914 Index = DAG.getNode(ISD::MUL, dl, PTy,
2915 Index, DAG.getConstant(EntrySize, PTy));
2916 SDValue Addr = DAG.getNode(ISD::ADD, dl, PTy, Index, Table);
2918 EVT MemVT = EVT::getIntegerVT(*DAG.getContext(), EntrySize * 8);
2919 SDValue LD = DAG.getExtLoad(ISD::SEXTLOAD, dl, PTy, Chain, Addr,
2920 PseudoSourceValue::getJumpTable(), 0, MemVT,
2923 if (TLI.getTargetMachine().getRelocationModel() == Reloc::PIC_) {
2924 // For PIC, the sequence is:
2925 // BRIND(load(Jumptable + index) + RelocBase)
2926 // RelocBase can be JumpTable, GOT or some sort of global base.
2927 Addr = DAG.getNode(ISD::ADD, dl, PTy, Addr,
2928 TLI.getPICJumpTableRelocBase(Table, DAG));
2930 Tmp1 = DAG.getNode(ISD::BRIND, dl, MVT::Other, LD.getValue(1), Addr);
2931 Results.push_back(Tmp1);
2935 // Expand brcond's setcc into its constituent parts and create a BR_CC
2937 Tmp1 = Node->getOperand(0);
2938 Tmp2 = Node->getOperand(1);
2939 if (Tmp2.getOpcode() == ISD::SETCC) {
2940 Tmp1 = DAG.getNode(ISD::BR_CC, dl, MVT::Other,
2941 Tmp1, Tmp2.getOperand(2),
2942 Tmp2.getOperand(0), Tmp2.getOperand(1),
2943 Node->getOperand(2));
2945 Tmp1 = DAG.getNode(ISD::BR_CC, dl, MVT::Other, Tmp1,
2946 DAG.getCondCode(ISD::SETNE), Tmp2,
2947 DAG.getConstant(0, Tmp2.getValueType()),
2948 Node->getOperand(2));
2950 Results.push_back(Tmp1);
2953 Tmp1 = Node->getOperand(0);
2954 Tmp2 = Node->getOperand(1);
2955 Tmp3 = Node->getOperand(2);
2956 LegalizeSetCCCondCode(Node->getValueType(0), Tmp1, Tmp2, Tmp3, dl);
2958 // If we expanded the SETCC into an AND/OR, return the new node
2959 if (Tmp2.getNode() == 0) {
2960 Results.push_back(Tmp1);
2964 // Otherwise, SETCC for the given comparison type must be completely
2965 // illegal; expand it into a SELECT_CC.
2966 EVT VT = Node->getValueType(0);
2967 Tmp1 = DAG.getNode(ISD::SELECT_CC, dl, VT, Tmp1, Tmp2,
2968 DAG.getConstant(1, VT), DAG.getConstant(0, VT), Tmp3);
2969 Results.push_back(Tmp1);
2972 case ISD::SELECT_CC: {
2973 Tmp1 = Node->getOperand(0); // LHS
2974 Tmp2 = Node->getOperand(1); // RHS
2975 Tmp3 = Node->getOperand(2); // True
2976 Tmp4 = Node->getOperand(3); // False
2977 SDValue CC = Node->getOperand(4);
2979 LegalizeSetCCCondCode(TLI.getSetCCResultType(Tmp1.getValueType()),
2980 Tmp1, Tmp2, CC, dl);
2982 assert(!Tmp2.getNode() && "Can't legalize SELECT_CC with legal condition!");
2983 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
2984 CC = DAG.getCondCode(ISD::SETNE);
2985 Tmp1 = DAG.getNode(ISD::SELECT_CC, dl, Node->getValueType(0), Tmp1, Tmp2,
2987 Results.push_back(Tmp1);
2991 Tmp1 = Node->getOperand(0); // Chain
2992 Tmp2 = Node->getOperand(2); // LHS
2993 Tmp3 = Node->getOperand(3); // RHS
2994 Tmp4 = Node->getOperand(1); // CC
2996 LegalizeSetCCCondCode(TLI.getSetCCResultType(Tmp2.getValueType()),
2997 Tmp2, Tmp3, Tmp4, dl);
2998 LastCALLSEQ_END = DAG.getEntryNode();
3000 assert(!Tmp3.getNode() && "Can't legalize BR_CC with legal condition!");
3001 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
3002 Tmp4 = DAG.getCondCode(ISD::SETNE);
3003 Tmp1 = DAG.getNode(ISD::BR_CC, dl, Node->getValueType(0), Tmp1, Tmp4, Tmp2,
3004 Tmp3, Node->getOperand(4));
3005 Results.push_back(Tmp1);
3008 case ISD::GLOBAL_OFFSET_TABLE:
3009 case ISD::GlobalAddress:
3010 case ISD::GlobalTLSAddress:
3011 case ISD::ExternalSymbol:
3012 case ISD::ConstantPool:
3013 case ISD::JumpTable:
3014 case ISD::INTRINSIC_W_CHAIN:
3015 case ISD::INTRINSIC_WO_CHAIN:
3016 case ISD::INTRINSIC_VOID:
3017 // FIXME: Custom lowering for these operations shouldn't return null!
3018 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
3019 Results.push_back(SDValue(Node, i));
3023 void SelectionDAGLegalize::PromoteNode(SDNode *Node,
3024 SmallVectorImpl<SDValue> &Results) {
3025 EVT OVT = Node->getValueType(0);
3026 if (Node->getOpcode() == ISD::UINT_TO_FP ||
3027 Node->getOpcode() == ISD::SINT_TO_FP ||
3028 Node->getOpcode() == ISD::SETCC) {
3029 OVT = Node->getOperand(0).getValueType();
3031 EVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
3032 DebugLoc dl = Node->getDebugLoc();
3033 SDValue Tmp1, Tmp2, Tmp3;
3034 switch (Node->getOpcode()) {
3038 // Zero extend the argument.
3039 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Node->getOperand(0));
3040 // Perform the larger operation.
3041 Tmp1 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
3042 if (Node->getOpcode() == ISD::CTTZ) {
3043 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
3044 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT),
3045 Tmp1, DAG.getConstant(NVT.getSizeInBits(), NVT),
3047 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2,
3048 DAG.getConstant(OVT.getSizeInBits(), NVT), Tmp1);
3049 } else if (Node->getOpcode() == ISD::CTLZ) {
3050 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
3051 Tmp1 = DAG.getNode(ISD::SUB, dl, NVT, Tmp1,
3052 DAG.getConstant(NVT.getSizeInBits() -
3053 OVT.getSizeInBits(), NVT));
3055 Results.push_back(DAG.getNode(ISD::TRUNCATE, dl, OVT, Tmp1));
3058 unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits();
3059 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Node->getOperand(0));
3060 Tmp1 = DAG.getNode(ISD::BSWAP, dl, NVT, Tmp1);
3061 Tmp1 = DAG.getNode(ISD::SRL, dl, NVT, Tmp1,
3062 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
3063 Results.push_back(Tmp1);
3066 case ISD::FP_TO_UINT:
3067 case ISD::FP_TO_SINT:
3068 Tmp1 = PromoteLegalFP_TO_INT(Node->getOperand(0), Node->getValueType(0),
3069 Node->getOpcode() == ISD::FP_TO_SINT, dl);
3070 Results.push_back(Tmp1);
3072 case ISD::UINT_TO_FP:
3073 case ISD::SINT_TO_FP:
3074 Tmp1 = PromoteLegalINT_TO_FP(Node->getOperand(0), Node->getValueType(0),
3075 Node->getOpcode() == ISD::SINT_TO_FP, dl);
3076 Results.push_back(Tmp1);
3081 unsigned ExtOp, TruncOp;
3082 if (OVT.isVector()) {
3083 ExtOp = ISD::BIT_CONVERT;
3084 TruncOp = ISD::BIT_CONVERT;
3086 assert(OVT.isInteger() && "Cannot promote logic operation");
3087 ExtOp = ISD::ANY_EXTEND;
3088 TruncOp = ISD::TRUNCATE;
3090 // Promote each of the values to the new type.
3091 Tmp1 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(0));
3092 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3093 // Perform the larger operation, then convert back
3094 Tmp1 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
3095 Results.push_back(DAG.getNode(TruncOp, dl, OVT, Tmp1));
3099 unsigned ExtOp, TruncOp;
3100 if (Node->getValueType(0).isVector()) {
3101 ExtOp = ISD::BIT_CONVERT;
3102 TruncOp = ISD::BIT_CONVERT;
3103 } else if (Node->getValueType(0).isInteger()) {
3104 ExtOp = ISD::ANY_EXTEND;
3105 TruncOp = ISD::TRUNCATE;
3107 ExtOp = ISD::FP_EXTEND;
3108 TruncOp = ISD::FP_ROUND;
3110 Tmp1 = Node->getOperand(0);
3111 // Promote each of the values to the new type.
3112 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3113 Tmp3 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(2));
3114 // Perform the larger operation, then round down.
3115 Tmp1 = DAG.getNode(ISD::SELECT, dl, NVT, Tmp1, Tmp2, Tmp3);
3116 if (TruncOp != ISD::FP_ROUND)
3117 Tmp1 = DAG.getNode(TruncOp, dl, Node->getValueType(0), Tmp1);
3119 Tmp1 = DAG.getNode(TruncOp, dl, Node->getValueType(0), Tmp1,
3120 DAG.getIntPtrConstant(0));
3121 Results.push_back(Tmp1);
3124 case ISD::VECTOR_SHUFFLE: {
3125 SmallVector<int, 8> Mask;
3126 cast<ShuffleVectorSDNode>(Node)->getMask(Mask);
3128 // Cast the two input vectors.
3129 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(0));
3130 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(1));
3132 // Convert the shuffle mask to the right # elements.
3133 Tmp1 = ShuffleWithNarrowerEltType(NVT, OVT, dl, Tmp1, Tmp2, Mask);
3134 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, OVT, Tmp1);
3135 Results.push_back(Tmp1);
3139 unsigned ExtOp = ISD::FP_EXTEND;
3140 if (NVT.isInteger()) {
3141 ISD::CondCode CCCode =
3142 cast<CondCodeSDNode>(Node->getOperand(2))->get();
3143 ExtOp = isSignedIntSetCC(CCCode) ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND;
3145 Tmp1 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(0));
3146 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Node->getOperand(1));
3147 Results.push_back(DAG.getNode(ISD::SETCC, dl, Node->getValueType(0),
3148 Tmp1, Tmp2, Node->getOperand(2)));
3154 // SelectionDAG::Legalize - This is the entry point for the file.
3156 void SelectionDAG::Legalize(CodeGenOpt::Level OptLevel) {
3157 /// run - This is the main entry point to this class.
3159 SelectionDAGLegalize(*this, OptLevel).LegalizeDAG();