1 //===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the SelectionDAG::Legalize method.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/CodeGen/SelectionDAG.h"
15 #include "llvm/CodeGen/MachineFunction.h"
16 #include "llvm/CodeGen/MachineFrameInfo.h"
17 #include "llvm/CodeGen/MachineJumpTableInfo.h"
18 #include "llvm/CodeGen/MachineModuleInfo.h"
19 #include "llvm/CodeGen/DwarfWriter.h"
20 #include "llvm/Analysis/DebugInfo.h"
21 #include "llvm/CodeGen/PseudoSourceValue.h"
22 #include "llvm/Target/TargetFrameInfo.h"
23 #include "llvm/Target/TargetLowering.h"
24 #include "llvm/Target/TargetData.h"
25 #include "llvm/Target/TargetMachine.h"
26 #include "llvm/Target/TargetOptions.h"
27 #include "llvm/Target/TargetSubtarget.h"
28 #include "llvm/CallingConv.h"
29 #include "llvm/Constants.h"
30 #include "llvm/DerivedTypes.h"
31 #include "llvm/Function.h"
32 #include "llvm/GlobalVariable.h"
33 #include "llvm/Support/CommandLine.h"
34 #include "llvm/Support/Compiler.h"
35 #include "llvm/Support/MathExtras.h"
36 #include "llvm/ADT/DenseMap.h"
37 #include "llvm/ADT/SmallVector.h"
38 #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 VISIBILITY_HIDDEN SelectionDAGLegalize {
58 CodeGenOpt::Level OptLevel;
59 bool TypesNeedLegalizing;
61 // Libcall insertion helpers.
63 /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been
64 /// legalized. We use this to ensure that calls are properly serialized
65 /// against each other, including inserted libcalls.
66 SDValue LastCALLSEQ_END;
68 /// IsLegalizingCall - This member is used *only* for purposes of providing
69 /// helpful assertions that a libcall isn't created while another call is
70 /// being legalized (which could lead to non-serialized call sequences).
71 bool IsLegalizingCall;
73 /// IsLegalizingCallArguments - This member is used only for the purpose
74 /// of providing assert to check for LegalizeTypes because legalizing an
75 /// operation might introduce call nodes that might need type legalization.
76 bool IsLegalizingCallArgs;
79 Legal, // The target natively supports this operation.
80 Promote, // This operation should be executed in a larger type.
81 Expand // Try to expand this to other ops, otherwise use a libcall.
84 /// ValueTypeActions - This is a bitvector that contains two bits for each
85 /// value type, where the two bits correspond to the LegalizeAction enum.
86 /// This can be queried with "getTypeAction(VT)".
87 TargetLowering::ValueTypeActionImpl ValueTypeActions;
89 /// LegalizedNodes - For nodes that are of legal width, and that have more
90 /// than one use, this map indicates what regularized operand to use. This
91 /// allows us to avoid legalizing the same thing more than once.
92 DenseMap<SDValue, SDValue> LegalizedNodes;
94 /// PromotedNodes - For nodes that are below legal width, and that have more
95 /// than one use, this map indicates what promoted value to use. This allows
96 /// us to avoid promoting the same thing more than once.
97 DenseMap<SDValue, SDValue> PromotedNodes;
99 /// ExpandedNodes - For nodes that need to be expanded this map indicates
100 /// which operands are the expanded version of the input. This allows
101 /// us to avoid expanding the same node more than once.
102 DenseMap<SDValue, std::pair<SDValue, SDValue> > ExpandedNodes;
104 /// SplitNodes - For vector nodes that need to be split, this map indicates
105 /// which operands are the split version of the input. This allows us
106 /// to avoid splitting the same node more than once.
107 std::map<SDValue, std::pair<SDValue, SDValue> > SplitNodes;
109 /// ScalarizedNodes - For nodes that need to be converted from vector types to
110 /// scalar types, this contains the mapping of ones we have already
111 /// processed to the result.
112 std::map<SDValue, SDValue> ScalarizedNodes;
114 /// WidenNodes - For nodes that need to be widened from one vector type to
115 /// another, this contains the mapping of those that we have already widen.
116 /// This allows us to avoid widening more than once.
117 std::map<SDValue, SDValue> WidenNodes;
119 void AddLegalizedOperand(SDValue From, SDValue To) {
120 LegalizedNodes.insert(std::make_pair(From, To));
121 // If someone requests legalization of the new node, return itself.
123 LegalizedNodes.insert(std::make_pair(To, To));
125 void AddPromotedOperand(SDValue From, SDValue To) {
126 bool isNew = PromotedNodes.insert(std::make_pair(From, To)).second;
127 assert(isNew && "Got into the map somehow?");
129 // If someone requests legalization of the new node, return itself.
130 LegalizedNodes.insert(std::make_pair(To, To));
132 void AddWidenedOperand(SDValue From, SDValue To) {
133 bool isNew = WidenNodes.insert(std::make_pair(From, To)).second;
134 assert(isNew && "Got into the map somehow?");
136 // If someone requests legalization of the new node, return itself.
137 LegalizedNodes.insert(std::make_pair(To, To));
141 explicit SelectionDAGLegalize(SelectionDAG &DAG, bool TypesNeedLegalizing,
142 CodeGenOpt::Level ol);
144 /// getTypeAction - Return how we should legalize values of this type, either
145 /// it is already legal or we need to expand it into multiple registers of
146 /// smaller integer type, or we need to promote it to a larger type.
147 LegalizeAction getTypeAction(MVT VT) const {
148 return (LegalizeAction)ValueTypeActions.getTypeAction(VT);
151 /// isTypeLegal - Return true if this type is legal on this target.
153 bool isTypeLegal(MVT VT) const {
154 return getTypeAction(VT) == Legal;
160 /// HandleOp - Legalize, Promote, or Expand the specified operand as
161 /// appropriate for its type.
162 void HandleOp(SDValue Op);
164 /// LegalizeOp - We know that the specified value has a legal type.
165 /// Recursively ensure that the operands have legal types, then return the
167 SDValue LegalizeOp(SDValue O);
169 /// UnrollVectorOp - We know that the given vector has a legal type, however
170 /// the operation it performs is not legal and is an operation that we have
171 /// no way of lowering. "Unroll" the vector, splitting out the scalars and
172 /// operating on each element individually.
173 SDValue UnrollVectorOp(SDValue O);
175 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
176 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
177 /// is necessary to spill the vector being inserted into to memory, perform
178 /// the insert there, and then read the result back.
179 SDValue PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val,
180 SDValue Idx, DebugLoc dl);
182 /// PromoteOp - Given an operation that produces a value in an invalid type,
183 /// promote it to compute the value into a larger type. The produced value
184 /// will have the correct bits for the low portion of the register, but no
185 /// guarantee is made about the top bits: it may be zero, sign-extended, or
187 SDValue PromoteOp(SDValue O);
189 /// ExpandOp - Expand the specified SDValue into its two component pieces
190 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this,
191 /// the LegalizedNodes map is filled in for any results that are not expanded,
192 /// the ExpandedNodes map is filled in for any results that are expanded, and
193 /// the Lo/Hi values are returned. This applies to integer types and Vector
195 void ExpandOp(SDValue O, SDValue &Lo, SDValue &Hi);
197 /// WidenVectorOp - Widen a vector operation to a wider type given by WidenVT
198 /// (e.g., v3i32 to v4i32). The produced value will have the correct value
199 /// for the existing elements but no guarantee is made about the new elements
200 /// at the end of the vector: it may be zero, ones, or garbage. This is useful
201 /// when we have an instruction operating on an illegal vector type and we
202 /// want to widen it to do the computation on a legal wider vector type.
203 SDValue WidenVectorOp(SDValue Op, MVT WidenVT);
205 /// SplitVectorOp - Given an operand of vector type, break it down into
206 /// two smaller values.
207 void SplitVectorOp(SDValue O, SDValue &Lo, SDValue &Hi);
209 /// ScalarizeVectorOp - Given an operand of single-element vector type
210 /// (e.g. v1f32), convert it into the equivalent operation that returns a
211 /// scalar (e.g. f32) value.
212 SDValue ScalarizeVectorOp(SDValue O);
214 /// Useful 16 element vector type that is used to pass operands for widening.
215 typedef SmallVector<SDValue, 16> SDValueVector;
217 /// LoadWidenVectorOp - Load a vector for a wider type. Returns true if
218 /// the LdChain contains a single load and false if it contains a token
219 /// factor for multiple loads. It takes
220 /// Result: location to return the result
221 /// LdChain: location to return the load chain
222 /// Op: load operation to widen
223 /// NVT: widen vector result type we want for the load
224 bool LoadWidenVectorOp(SDValue& Result, SDValue& LdChain,
225 SDValue Op, MVT NVT);
227 /// Helper genWidenVectorLoads - Helper function to generate a set of
228 /// loads to load a vector with a resulting wider type. It takes
229 /// LdChain: list of chains for the load we have generated
230 /// Chain: incoming chain for the ld vector
231 /// BasePtr: base pointer to load from
232 /// SV: memory disambiguation source value
233 /// SVOffset: memory disambiugation offset
234 /// Alignment: alignment of the memory
235 /// isVolatile: volatile load
236 /// LdWidth: width of memory that we want to load
237 /// ResType: the wider result result type for the resulting loaded vector
238 SDValue genWidenVectorLoads(SDValueVector& LdChain, SDValue Chain,
239 SDValue BasePtr, const Value *SV,
240 int SVOffset, unsigned Alignment,
241 bool isVolatile, unsigned LdWidth,
242 MVT ResType, DebugLoc dl);
244 /// StoreWidenVectorOp - Stores a widen vector into non widen memory
245 /// location. It takes
246 /// ST: store node that we want to replace
247 /// Chain: incoming store chain
248 /// BasePtr: base address of where we want to store into
249 SDValue StoreWidenVectorOp(StoreSDNode *ST, SDValue Chain,
252 /// Helper genWidenVectorStores - Helper function to generate a set of
253 /// stores to store a widen vector into non widen memory
255 // StChain: list of chains for the stores we have generated
256 // Chain: incoming chain for the ld vector
257 // BasePtr: base pointer to load from
258 // SV: memory disambiguation source value
259 // SVOffset: memory disambiugation offset
260 // Alignment: alignment of the memory
261 // isVolatile: volatile lod
262 // ValOp: value to store
263 // StWidth: width of memory that we want to store
264 void genWidenVectorStores(SDValueVector& StChain, SDValue Chain,
265 SDValue BasePtr, const Value *SV,
266 int SVOffset, unsigned Alignment,
267 bool isVolatile, SDValue ValOp,
268 unsigned StWidth, DebugLoc dl);
270 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
271 /// performs the same shuffe in terms of order or result bytes, but on a type
272 /// whose vector element type is narrower than the original shuffle type.
273 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
274 SDValue ShuffleWithNarrowerEltType(MVT NVT, MVT VT, DebugLoc dl,
275 SDValue N1, SDValue N2,
276 SmallVectorImpl<int> &Mask) const;
278 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
279 SmallPtrSet<SDNode*, 32> &NodesLeadingTo);
281 void LegalizeSetCCOperands(SDValue &LHS, SDValue &RHS, SDValue &CC,
283 void LegalizeSetCCCondCode(MVT VT, SDValue &LHS, SDValue &RHS, SDValue &CC,
285 void LegalizeSetCC(MVT VT, SDValue &LHS, SDValue &RHS, SDValue &CC,
287 LegalizeSetCCOperands(LHS, RHS, CC, dl);
288 LegalizeSetCCCondCode(VT, LHS, RHS, CC, dl);
291 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned,
293 SDValue ExpandIntToFP(bool isSigned, MVT DestTy, SDValue Source, DebugLoc dl);
295 SDValue EmitStackConvert(SDValue SrcOp, MVT SlotVT, MVT DestVT, DebugLoc dl);
296 SDValue ExpandBUILD_VECTOR(SDNode *Node);
297 SDValue ExpandSCALAR_TO_VECTOR(SDNode *Node);
298 SDValue LegalizeINT_TO_FP(SDValue Result, bool isSigned, MVT DestTy,
299 SDValue Op, DebugLoc dl);
300 SDValue ExpandLegalINT_TO_FP(bool isSigned, SDValue LegalOp, MVT DestVT,
302 SDValue PromoteLegalINT_TO_FP(SDValue LegalOp, MVT DestVT, bool isSigned,
304 SDValue PromoteLegalFP_TO_INT(SDValue LegalOp, MVT DestVT, bool isSigned,
307 SDValue ExpandBSWAP(SDValue Op, DebugLoc dl);
308 SDValue ExpandBitCount(unsigned Opc, SDValue Op, DebugLoc dl);
309 bool ExpandShift(unsigned Opc, SDValue Op, SDValue Amt,
310 SDValue &Lo, SDValue &Hi, DebugLoc dl);
311 void ExpandShiftParts(unsigned NodeOp, SDValue Op, SDValue Amt,
312 SDValue &Lo, SDValue &Hi, DebugLoc dl);
314 SDValue ExpandEXTRACT_SUBVECTOR(SDValue Op);
315 SDValue ExpandEXTRACT_VECTOR_ELT(SDValue Op);
319 /// ShuffleWithNarrowerEltType - Return a vector shuffle operation which
320 /// performs the same shuffe in terms of order or result bytes, but on a type
321 /// whose vector element type is narrower than the original shuffle type.
322 /// e.g. <v4i32> <0, 1, 0, 1> -> v8i16 <0, 1, 2, 3, 0, 1, 2, 3>
324 SelectionDAGLegalize::ShuffleWithNarrowerEltType(MVT NVT, MVT VT, DebugLoc dl,
325 SDValue N1, SDValue N2,
326 SmallVectorImpl<int> &Mask) const {
327 MVT EltVT = NVT.getVectorElementType();
328 unsigned NumMaskElts = VT.getVectorNumElements();
329 unsigned NumDestElts = NVT.getVectorNumElements();
330 unsigned NumEltsGrowth = NumDestElts / NumMaskElts;
332 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
334 if (NumEltsGrowth == 1)
335 return DAG.getVectorShuffle(NVT, dl, N1, N2, &Mask[0]);
337 SmallVector<int, 8> NewMask;
338 for (unsigned i = 0; i != NumMaskElts; ++i) {
340 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
342 NewMask.push_back(-1);
344 NewMask.push_back(Idx * NumEltsGrowth + j);
347 assert(NewMask.size() == NumDestElts && "Non-integer NumEltsGrowth?");
348 assert(TLI.isShuffleMaskLegal(NewMask, NVT) && "Shuffle not legal?");
349 return DAG.getVectorShuffle(NVT, dl, N1, N2, &NewMask[0]);
352 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag,
353 bool types, CodeGenOpt::Level ol)
354 : TLI(dag.getTargetLoweringInfo()), DAG(dag), OptLevel(ol),
355 TypesNeedLegalizing(types), ValueTypeActions(TLI.getValueTypeActions()) {
356 assert(MVT::LAST_VALUETYPE <= 32 &&
357 "Too many value types for ValueTypeActions to hold!");
360 void SelectionDAGLegalize::LegalizeDAG() {
361 LastCALLSEQ_END = DAG.getEntryNode();
362 IsLegalizingCall = false;
363 IsLegalizingCallArgs = false;
365 // The legalize process is inherently a bottom-up recursive process (users
366 // legalize their uses before themselves). Given infinite stack space, we
367 // could just start legalizing on the root and traverse the whole graph. In
368 // practice however, this causes us to run out of stack space on large basic
369 // blocks. To avoid this problem, compute an ordering of the nodes where each
370 // node is only legalized after all of its operands are legalized.
371 DAG.AssignTopologicalOrder();
372 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
373 E = prior(DAG.allnodes_end()); I != next(E); ++I)
374 HandleOp(SDValue(I, 0));
376 // Finally, it's possible the root changed. Get the new root.
377 SDValue OldRoot = DAG.getRoot();
378 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
379 DAG.setRoot(LegalizedNodes[OldRoot]);
381 ExpandedNodes.clear();
382 LegalizedNodes.clear();
383 PromotedNodes.clear();
385 ScalarizedNodes.clear();
388 // Remove dead nodes now.
389 DAG.RemoveDeadNodes();
393 /// FindCallEndFromCallStart - Given a chained node that is part of a call
394 /// sequence, find the CALLSEQ_END node that terminates the call sequence.
395 static SDNode *FindCallEndFromCallStart(SDNode *Node) {
396 if (Node->getOpcode() == ISD::CALLSEQ_END)
398 if (Node->use_empty())
399 return 0; // No CallSeqEnd
401 // The chain is usually at the end.
402 SDValue TheChain(Node, Node->getNumValues()-1);
403 if (TheChain.getValueType() != MVT::Other) {
404 // Sometimes it's at the beginning.
405 TheChain = SDValue(Node, 0);
406 if (TheChain.getValueType() != MVT::Other) {
407 // Otherwise, hunt for it.
408 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
409 if (Node->getValueType(i) == MVT::Other) {
410 TheChain = SDValue(Node, i);
414 // Otherwise, we walked into a node without a chain.
415 if (TheChain.getValueType() != MVT::Other)
420 for (SDNode::use_iterator UI = Node->use_begin(),
421 E = Node->use_end(); UI != E; ++UI) {
423 // Make sure to only follow users of our token chain.
425 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
426 if (User->getOperand(i) == TheChain)
427 if (SDNode *Result = FindCallEndFromCallStart(User))
433 /// FindCallStartFromCallEnd - Given a chained node that is part of a call
434 /// sequence, find the CALLSEQ_START node that initiates the call sequence.
435 static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
436 assert(Node && "Didn't find callseq_start for a call??");
437 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
439 assert(Node->getOperand(0).getValueType() == MVT::Other &&
440 "Node doesn't have a token chain argument!");
441 return FindCallStartFromCallEnd(Node->getOperand(0).getNode());
444 /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
445 /// see if any uses can reach Dest. If no dest operands can get to dest,
446 /// legalize them, legalize ourself, and return false, otherwise, return true.
448 /// Keep track of the nodes we fine that actually do lead to Dest in
449 /// NodesLeadingTo. This avoids retraversing them exponential number of times.
451 bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
452 SmallPtrSet<SDNode*, 32> &NodesLeadingTo) {
453 if (N == Dest) return true; // N certainly leads to Dest :)
455 // If we've already processed this node and it does lead to Dest, there is no
456 // need to reprocess it.
457 if (NodesLeadingTo.count(N)) return true;
459 // If the first result of this node has been already legalized, then it cannot
461 switch (getTypeAction(N->getValueType(0))) {
463 if (LegalizedNodes.count(SDValue(N, 0))) return false;
466 if (PromotedNodes.count(SDValue(N, 0))) return false;
469 if (ExpandedNodes.count(SDValue(N, 0))) return false;
473 // Okay, this node has not already been legalized. Check and legalize all
474 // operands. If none lead to Dest, then we can legalize this node.
475 bool OperandsLeadToDest = false;
476 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
477 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
478 LegalizeAllNodesNotLeadingTo(N->getOperand(i).getNode(), Dest, NodesLeadingTo);
480 if (OperandsLeadToDest) {
481 NodesLeadingTo.insert(N);
485 // Okay, this node looks safe, legalize it and return false.
486 HandleOp(SDValue(N, 0));
490 /// HandleOp - Legalize, Promote, Widen, or Expand the specified operand as
491 /// appropriate for its type.
492 void SelectionDAGLegalize::HandleOp(SDValue Op) {
493 MVT VT = Op.getValueType();
494 // If the type legalizer was run then we should never see any illegal result
495 // types here except for target constants (the type legalizer does not touch
496 // those) or for build vector used as a mask for a vector shuffle.
497 assert((TypesNeedLegalizing || getTypeAction(VT) == Legal ||
498 IsLegalizingCallArgs || Op.getOpcode() == ISD::TargetConstant) &&
499 "Illegal type introduced after type legalization?");
500 switch (getTypeAction(VT)) {
501 default: assert(0 && "Bad type action!");
502 case Legal: (void)LegalizeOp(Op); break;
504 if (!VT.isVector()) {
509 // See if we can widen otherwise use Expand to either scalarize or split
510 MVT WidenVT = TLI.getWidenVectorType(VT);
511 if (WidenVT != MVT::Other) {
512 (void) WidenVectorOp(Op, WidenVT);
515 // else fall thru to expand since we can't widen the vector
518 if (!VT.isVector()) {
519 // If this is an illegal scalar, expand it into its two component
522 if (Op.getOpcode() == ISD::TargetConstant)
523 break; // Allow illegal target nodes.
525 } else if (VT.getVectorNumElements() == 1) {
526 // If this is an illegal single element vector, convert it to a
528 (void)ScalarizeVectorOp(Op);
530 // This is an illegal multiple element vector.
531 // Split it in half and legalize both parts.
533 SplitVectorOp(Op, X, Y);
539 /// ExpandConstantFP - Expands the ConstantFP node to an integer constant or
540 /// a load from the constant pool.
541 static SDValue ExpandConstantFP(ConstantFPSDNode *CFP, bool UseCP,
542 SelectionDAG &DAG, const TargetLowering &TLI) {
544 DebugLoc dl = CFP->getDebugLoc();
546 // If a FP immediate is precise when represented as a float and if the
547 // target can do an extending load from float to double, we put it into
548 // the constant pool as a float, even if it's is statically typed as a
549 // double. This shrinks FP constants and canonicalizes them for targets where
550 // an FP extending load is the same cost as a normal load (such as on the x87
551 // fp stack or PPC FP unit).
552 MVT VT = CFP->getValueType(0);
553 ConstantFP *LLVMC = const_cast<ConstantFP*>(CFP->getConstantFPValue());
555 assert((VT == MVT::f64 || VT == MVT::f32) && "Invalid type expansion");
556 return DAG.getConstant(LLVMC->getValueAPF().bitcastToAPInt(),
557 (VT == MVT::f64) ? MVT::i64 : MVT::i32);
562 while (SVT != MVT::f32) {
563 SVT = (MVT::SimpleValueType)(SVT.getSimpleVT() - 1);
564 if (CFP->isValueValidForType(SVT, CFP->getValueAPF()) &&
565 // Only do this if the target has a native EXTLOAD instruction from
567 TLI.isLoadExtLegal(ISD::EXTLOAD, SVT) &&
568 TLI.ShouldShrinkFPConstant(OrigVT)) {
569 const Type *SType = SVT.getTypeForMVT();
570 LLVMC = cast<ConstantFP>(ConstantExpr::getFPTrunc(LLVMC, SType));
576 SDValue CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
577 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
579 return DAG.getExtLoad(ISD::EXTLOAD, dl,
580 OrigVT, DAG.getEntryNode(),
581 CPIdx, PseudoSourceValue::getConstantPool(),
582 0, VT, false, Alignment);
583 return DAG.getLoad(OrigVT, dl, DAG.getEntryNode(), CPIdx,
584 PseudoSourceValue::getConstantPool(), 0, false, Alignment);
588 /// ExpandFCOPYSIGNToBitwiseOps - Expands fcopysign to a series of bitwise
591 SDValue ExpandFCOPYSIGNToBitwiseOps(SDNode *Node, MVT NVT,
593 const TargetLowering &TLI) {
594 DebugLoc dl = Node->getDebugLoc();
595 MVT VT = Node->getValueType(0);
596 MVT SrcVT = Node->getOperand(1).getValueType();
597 assert((SrcVT == MVT::f32 || SrcVT == MVT::f64) &&
598 "fcopysign expansion only supported for f32 and f64");
599 MVT SrcNVT = (SrcVT == MVT::f64) ? MVT::i64 : MVT::i32;
601 // First get the sign bit of second operand.
602 SDValue Mask1 = (SrcVT == MVT::f64)
603 ? DAG.getConstantFP(BitsToDouble(1ULL << 63), SrcVT)
604 : DAG.getConstantFP(BitsToFloat(1U << 31), SrcVT);
605 Mask1 = DAG.getNode(ISD::BIT_CONVERT, dl, SrcNVT, Mask1);
606 SDValue SignBit= DAG.getNode(ISD::BIT_CONVERT, dl, SrcNVT,
607 Node->getOperand(1));
608 SignBit = DAG.getNode(ISD::AND, dl, SrcNVT, SignBit, Mask1);
609 // Shift right or sign-extend it if the two operands have different types.
610 int SizeDiff = SrcNVT.getSizeInBits() - NVT.getSizeInBits();
612 SignBit = DAG.getNode(ISD::SRL, dl, SrcNVT, SignBit,
613 DAG.getConstant(SizeDiff, TLI.getShiftAmountTy()));
614 SignBit = DAG.getNode(ISD::TRUNCATE, dl, NVT, SignBit);
615 } else if (SizeDiff < 0) {
616 SignBit = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, SignBit);
617 SignBit = DAG.getNode(ISD::SHL, dl, NVT, SignBit,
618 DAG.getConstant(-SizeDiff, TLI.getShiftAmountTy()));
621 // Clear the sign bit of first operand.
622 SDValue Mask2 = (VT == MVT::f64)
623 ? DAG.getConstantFP(BitsToDouble(~(1ULL << 63)), VT)
624 : DAG.getConstantFP(BitsToFloat(~(1U << 31)), VT);
625 Mask2 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Mask2);
626 SDValue Result = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(0));
627 Result = DAG.getNode(ISD::AND, dl, NVT, Result, Mask2);
629 // Or the value with the sign bit.
630 Result = DAG.getNode(ISD::OR, dl, NVT, Result, SignBit);
634 /// ExpandUnalignedStore - Expands an unaligned store to 2 half-size stores.
636 SDValue ExpandUnalignedStore(StoreSDNode *ST, SelectionDAG &DAG,
637 const TargetLowering &TLI) {
638 SDValue Chain = ST->getChain();
639 SDValue Ptr = ST->getBasePtr();
640 SDValue Val = ST->getValue();
641 MVT VT = Val.getValueType();
642 int Alignment = ST->getAlignment();
643 int SVOffset = ST->getSrcValueOffset();
644 DebugLoc dl = ST->getDebugLoc();
645 if (ST->getMemoryVT().isFloatingPoint() ||
646 ST->getMemoryVT().isVector()) {
647 MVT intVT = MVT::getIntegerVT(VT.getSizeInBits());
648 if (TLI.isTypeLegal(intVT)) {
649 // Expand to a bitconvert of the value to the integer type of the
650 // same size, then a (misaligned) int store.
651 // FIXME: Does not handle truncating floating point stores!
652 SDValue Result = DAG.getNode(ISD::BIT_CONVERT, dl, intVT, Val);
653 return DAG.getStore(Chain, dl, Result, Ptr, ST->getSrcValue(),
654 SVOffset, ST->isVolatile(), Alignment);
656 // Do a (aligned) store to a stack slot, then copy from the stack slot
657 // to the final destination using (unaligned) integer loads and stores.
658 MVT StoredVT = ST->getMemoryVT();
660 TLI.getRegisterType(MVT::getIntegerVT(StoredVT.getSizeInBits()));
661 unsigned StoredBytes = StoredVT.getSizeInBits() / 8;
662 unsigned RegBytes = RegVT.getSizeInBits() / 8;
663 unsigned NumRegs = (StoredBytes + RegBytes - 1) / RegBytes;
665 // Make sure the stack slot is also aligned for the register type.
666 SDValue StackPtr = DAG.CreateStackTemporary(StoredVT, RegVT);
668 // Perform the original store, only redirected to the stack slot.
669 SDValue Store = DAG.getTruncStore(Chain, dl,
670 Val, StackPtr, NULL, 0, StoredVT);
671 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
672 SmallVector<SDValue, 8> Stores;
675 // Do all but one copies using the full register width.
676 for (unsigned i = 1; i < NumRegs; i++) {
677 // Load one integer register's worth from the stack slot.
678 SDValue Load = DAG.getLoad(RegVT, dl, Store, StackPtr, NULL, 0);
679 // Store it to the final location. Remember the store.
680 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, Ptr,
681 ST->getSrcValue(), SVOffset + Offset,
683 MinAlign(ST->getAlignment(), Offset)));
684 // Increment the pointers.
686 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
688 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
691 // The last store may be partial. Do a truncating store. On big-endian
692 // machines this requires an extending load from the stack slot to ensure
693 // that the bits are in the right place.
694 MVT MemVT = MVT::getIntegerVT(8 * (StoredBytes - Offset));
696 // Load from the stack slot.
697 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Store, StackPtr,
700 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, Ptr,
701 ST->getSrcValue(), SVOffset + Offset,
702 MemVT, ST->isVolatile(),
703 MinAlign(ST->getAlignment(), Offset)));
704 // The order of the stores doesn't matter - say it with a TokenFactor.
705 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
709 assert(ST->getMemoryVT().isInteger() &&
710 !ST->getMemoryVT().isVector() &&
711 "Unaligned store of unknown type.");
712 // Get the half-size VT
714 (MVT::SimpleValueType)(ST->getMemoryVT().getSimpleVT() - 1);
715 int NumBits = NewStoredVT.getSizeInBits();
716 int IncrementSize = NumBits / 8;
718 // Divide the stored value in two parts.
719 SDValue ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
721 SDValue Hi = DAG.getNode(ISD::SRL, dl, VT, Val, ShiftAmount);
723 // Store the two parts
724 SDValue Store1, Store2;
725 Store1 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Lo:Hi, Ptr,
726 ST->getSrcValue(), SVOffset, NewStoredVT,
727 ST->isVolatile(), Alignment);
728 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
729 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
730 Alignment = MinAlign(Alignment, IncrementSize);
731 Store2 = DAG.getTruncStore(Chain, dl, TLI.isLittleEndian()?Hi:Lo, Ptr,
732 ST->getSrcValue(), SVOffset + IncrementSize,
733 NewStoredVT, ST->isVolatile(), Alignment);
735 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Store1, Store2);
738 /// ExpandUnalignedLoad - Expands an unaligned load to 2 half-size loads.
740 SDValue ExpandUnalignedLoad(LoadSDNode *LD, SelectionDAG &DAG,
741 const TargetLowering &TLI) {
742 int SVOffset = LD->getSrcValueOffset();
743 SDValue Chain = LD->getChain();
744 SDValue Ptr = LD->getBasePtr();
745 MVT VT = LD->getValueType(0);
746 MVT LoadedVT = LD->getMemoryVT();
747 DebugLoc dl = LD->getDebugLoc();
748 if (VT.isFloatingPoint() || VT.isVector()) {
749 MVT intVT = MVT::getIntegerVT(LoadedVT.getSizeInBits());
750 if (TLI.isTypeLegal(intVT)) {
751 // Expand to a (misaligned) integer load of the same size,
752 // then bitconvert to floating point or vector.
753 SDValue newLoad = DAG.getLoad(intVT, dl, Chain, Ptr, LD->getSrcValue(),
754 SVOffset, LD->isVolatile(),
756 SDValue Result = DAG.getNode(ISD::BIT_CONVERT, dl, LoadedVT, newLoad);
757 if (VT.isFloatingPoint() && LoadedVT != VT)
758 Result = DAG.getNode(ISD::FP_EXTEND, dl, VT, Result);
760 SDValue Ops[] = { Result, Chain };
761 return DAG.getMergeValues(Ops, 2, dl);
763 // Copy the value to a (aligned) stack slot using (unaligned) integer
764 // loads and stores, then do a (aligned) load from the stack slot.
765 MVT RegVT = TLI.getRegisterType(intVT);
766 unsigned LoadedBytes = LoadedVT.getSizeInBits() / 8;
767 unsigned RegBytes = RegVT.getSizeInBits() / 8;
768 unsigned NumRegs = (LoadedBytes + RegBytes - 1) / RegBytes;
770 // Make sure the stack slot is also aligned for the register type.
771 SDValue StackBase = DAG.CreateStackTemporary(LoadedVT, RegVT);
773 SDValue Increment = DAG.getConstant(RegBytes, TLI.getPointerTy());
774 SmallVector<SDValue, 8> Stores;
775 SDValue StackPtr = StackBase;
778 // Do all but one copies using the full register width.
779 for (unsigned i = 1; i < NumRegs; i++) {
780 // Load one integer register's worth from the original location.
781 SDValue Load = DAG.getLoad(RegVT, dl, Chain, Ptr, LD->getSrcValue(),
782 SVOffset + Offset, LD->isVolatile(),
783 MinAlign(LD->getAlignment(), Offset));
784 // Follow the load with a store to the stack slot. Remember the store.
785 Stores.push_back(DAG.getStore(Load.getValue(1), dl, Load, StackPtr,
787 // Increment the pointers.
789 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr, Increment);
790 StackPtr = DAG.getNode(ISD::ADD, dl, StackPtr.getValueType(), StackPtr,
794 // The last copy may be partial. Do an extending load.
795 MVT MemVT = MVT::getIntegerVT(8 * (LoadedBytes - Offset));
796 SDValue Load = DAG.getExtLoad(ISD::EXTLOAD, dl, RegVT, Chain, Ptr,
797 LD->getSrcValue(), SVOffset + Offset,
798 MemVT, LD->isVolatile(),
799 MinAlign(LD->getAlignment(), Offset));
800 // Follow the load with a store to the stack slot. Remember the store.
801 // On big-endian machines this requires a truncating store to ensure
802 // that the bits end up in the right place.
803 Stores.push_back(DAG.getTruncStore(Load.getValue(1), dl, Load, StackPtr,
806 // The order of the stores doesn't matter - say it with a TokenFactor.
807 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, &Stores[0],
810 // Finally, perform the original load only redirected to the stack slot.
811 Load = DAG.getExtLoad(LD->getExtensionType(), dl, VT, TF, StackBase,
814 // Callers expect a MERGE_VALUES node.
815 SDValue Ops[] = { Load, TF };
816 return DAG.getMergeValues(Ops, 2, dl);
819 assert(LoadedVT.isInteger() && !LoadedVT.isVector() &&
820 "Unaligned load of unsupported type.");
822 // Compute the new VT that is half the size of the old one. This is an
824 unsigned NumBits = LoadedVT.getSizeInBits();
826 NewLoadedVT = MVT::getIntegerVT(NumBits/2);
829 unsigned Alignment = LD->getAlignment();
830 unsigned IncrementSize = NumBits / 8;
831 ISD::LoadExtType HiExtType = LD->getExtensionType();
833 // If the original load is NON_EXTLOAD, the hi part load must be ZEXTLOAD.
834 if (HiExtType == ISD::NON_EXTLOAD)
835 HiExtType = ISD::ZEXTLOAD;
837 // Load the value in two parts
839 if (TLI.isLittleEndian()) {
840 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr, LD->getSrcValue(),
841 SVOffset, NewLoadedVT, LD->isVolatile(), Alignment);
842 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
843 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
844 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr, LD->getSrcValue(),
845 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
846 MinAlign(Alignment, IncrementSize));
848 Hi = DAG.getExtLoad(HiExtType, dl, VT, Chain, Ptr, LD->getSrcValue(),
849 SVOffset, NewLoadedVT, LD->isVolatile(), Alignment);
850 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
851 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
852 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl, VT, Chain, Ptr, LD->getSrcValue(),
853 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
854 MinAlign(Alignment, IncrementSize));
857 // aggregate the two parts
858 SDValue ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
859 SDValue Result = DAG.getNode(ISD::SHL, dl, VT, Hi, ShiftAmount);
860 Result = DAG.getNode(ISD::OR, dl, VT, Result, Lo);
862 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
865 SDValue Ops[] = { Result, TF };
866 return DAG.getMergeValues(Ops, 2, dl);
869 /// UnrollVectorOp - We know that the given vector has a legal type, however
870 /// the operation it performs is not legal and is an operation that we have
871 /// no way of lowering. "Unroll" the vector, splitting out the scalars and
872 /// operating on each element individually.
873 SDValue SelectionDAGLegalize::UnrollVectorOp(SDValue Op) {
874 MVT VT = Op.getValueType();
875 assert(isTypeLegal(VT) &&
876 "Caller should expand or promote operands that are not legal!");
877 assert(Op.getNode()->getNumValues() == 1 &&
878 "Can't unroll a vector with multiple results!");
879 unsigned NE = VT.getVectorNumElements();
880 MVT EltVT = VT.getVectorElementType();
881 DebugLoc dl = Op.getDebugLoc();
883 SmallVector<SDValue, 8> Scalars;
884 SmallVector<SDValue, 4> Operands(Op.getNumOperands());
885 for (unsigned i = 0; i != NE; ++i) {
886 for (unsigned j = 0; j != Op.getNumOperands(); ++j) {
887 SDValue Operand = Op.getOperand(j);
888 MVT OperandVT = Operand.getValueType();
889 if (OperandVT.isVector()) {
890 // A vector operand; extract a single element.
891 MVT OperandEltVT = OperandVT.getVectorElementType();
892 Operands[j] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
895 DAG.getConstant(i, MVT::i32));
897 // A scalar operand; just use it as is.
898 Operands[j] = Operand;
902 switch (Op.getOpcode()) {
904 Scalars.push_back(DAG.getNode(Op.getOpcode(), dl, EltVT,
905 &Operands[0], Operands.size()));
912 Scalars.push_back(DAG.getNode(Op.getOpcode(), dl, EltVT, Operands[0],
913 DAG.getShiftAmountOperand(Operands[1])));
918 return DAG.getNode(ISD::BUILD_VECTOR, dl, VT, &Scalars[0], Scalars.size());
921 /// GetFPLibCall - Return the right libcall for the given floating point type.
922 static RTLIB::Libcall GetFPLibCall(MVT VT,
923 RTLIB::Libcall Call_F32,
924 RTLIB::Libcall Call_F64,
925 RTLIB::Libcall Call_F80,
926 RTLIB::Libcall Call_PPCF128) {
928 VT == MVT::f32 ? Call_F32 :
929 VT == MVT::f64 ? Call_F64 :
930 VT == MVT::f80 ? Call_F80 :
931 VT == MVT::ppcf128 ? Call_PPCF128 :
932 RTLIB::UNKNOWN_LIBCALL;
935 /// PerformInsertVectorEltInMemory - Some target cannot handle a variable
936 /// insertion index for the INSERT_VECTOR_ELT instruction. In this case, it
937 /// is necessary to spill the vector being inserted into to memory, perform
938 /// the insert there, and then read the result back.
939 SDValue SelectionDAGLegalize::
940 PerformInsertVectorEltInMemory(SDValue Vec, SDValue Val, SDValue Idx,
946 // If the target doesn't support this, we have to spill the input vector
947 // to a temporary stack slot, update the element, then reload it. This is
948 // badness. We could also load the value into a vector register (either
949 // with a "move to register" or "extload into register" instruction, then
950 // permute it into place, if the idx is a constant and if the idx is
951 // supported by the target.
952 MVT VT = Tmp1.getValueType();
953 MVT EltVT = VT.getVectorElementType();
954 MVT IdxVT = Tmp3.getValueType();
955 MVT PtrVT = TLI.getPointerTy();
956 SDValue StackPtr = DAG.CreateStackTemporary(VT);
958 int SPFI = cast<FrameIndexSDNode>(StackPtr.getNode())->getIndex();
961 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Tmp1, StackPtr,
962 PseudoSourceValue::getFixedStack(SPFI), 0);
964 // Truncate or zero extend offset to target pointer type.
965 unsigned CastOpc = IdxVT.bitsGT(PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
966 Tmp3 = DAG.getNode(CastOpc, dl, PtrVT, Tmp3);
967 // Add the offset to the index.
968 unsigned EltSize = EltVT.getSizeInBits()/8;
969 Tmp3 = DAG.getNode(ISD::MUL, dl, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
970 SDValue StackPtr2 = DAG.getNode(ISD::ADD, dl, IdxVT, Tmp3, StackPtr);
971 // Store the scalar value.
972 Ch = DAG.getTruncStore(Ch, dl, Tmp2, StackPtr2,
973 PseudoSourceValue::getFixedStack(SPFI), 0, EltVT);
974 // Load the updated vector.
975 return DAG.getLoad(VT, dl, Ch, StackPtr,
976 PseudoSourceValue::getFixedStack(SPFI), 0);
980 /// LegalizeOp - We know that the specified value has a legal type, and
981 /// that its operands are legal. Now ensure that the operation itself
982 /// is legal, recursively ensuring that the operands' operations remain
984 SDValue SelectionDAGLegalize::LegalizeOp(SDValue Op) {
985 if (Op.getOpcode() == ISD::TargetConstant) // Allow illegal target nodes.
988 assert(isTypeLegal(Op.getValueType()) &&
989 "Caller should expand or promote operands that are not legal!");
990 SDNode *Node = Op.getNode();
991 DebugLoc dl = Node->getDebugLoc();
993 // If this operation defines any values that cannot be represented in a
994 // register on this target, make sure to expand or promote them.
995 if (Node->getNumValues() > 1) {
996 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
997 if (getTypeAction(Node->getValueType(i)) != Legal) {
998 HandleOp(Op.getValue(i));
999 assert(LegalizedNodes.count(Op) &&
1000 "Handling didn't add legal operands!");
1001 return LegalizedNodes[Op];
1005 // Note that LegalizeOp may be reentered even from single-use nodes, which
1006 // means that we always must cache transformed nodes.
1007 DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
1008 if (I != LegalizedNodes.end()) return I->second;
1010 SDValue Tmp1, Tmp2, Tmp3, Tmp4;
1011 SDValue Result = Op;
1012 bool isCustom = false;
1014 switch (Node->getOpcode()) {
1015 case ISD::FrameIndex:
1016 case ISD::EntryToken:
1018 case ISD::BasicBlock:
1019 case ISD::TargetFrameIndex:
1020 case ISD::TargetJumpTable:
1021 case ISD::TargetConstant:
1022 case ISD::TargetConstantFP:
1023 case ISD::TargetConstantPool:
1024 case ISD::TargetGlobalAddress:
1025 case ISD::TargetGlobalTLSAddress:
1026 case ISD::TargetExternalSymbol:
1027 case ISD::VALUETYPE:
1029 case ISD::MEMOPERAND:
1031 case ISD::ARG_FLAGS:
1032 // Primitives must all be legal.
1033 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
1034 "This must be legal!");
1037 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
1038 // If this is a target node, legalize it by legalizing the operands then
1039 // passing it through.
1040 SmallVector<SDValue, 8> Ops;
1041 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
1042 Ops.push_back(LegalizeOp(Node->getOperand(i)));
1044 Result = DAG.UpdateNodeOperands(Result.getValue(0), &Ops[0], Ops.size());
1046 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
1047 AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
1048 return Result.getValue(Op.getResNo());
1050 // Otherwise this is an unhandled builtin node. splat.
1052 cerr << "NODE: "; Node->dump(&DAG); cerr << "\n";
1054 assert(0 && "Do not know how to legalize this operator!");
1056 case ISD::GLOBAL_OFFSET_TABLE:
1057 case ISD::GlobalAddress:
1058 case ISD::GlobalTLSAddress:
1059 case ISD::ExternalSymbol:
1060 case ISD::ConstantPool:
1061 case ISD::JumpTable: // Nothing to do.
1062 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
1063 default: assert(0 && "This action is not supported yet!");
1064 case TargetLowering::Custom:
1065 Tmp1 = TLI.LowerOperation(Op, DAG);
1066 if (Tmp1.getNode()) Result = Tmp1;
1067 // FALLTHROUGH if the target doesn't want to lower this op after all.
1068 case TargetLowering::Legal:
1072 case ISD::FRAMEADDR:
1073 case ISD::RETURNADDR:
1074 // The only option for these nodes is to custom lower them. If the target
1075 // does not custom lower them, then return zero.
1076 Tmp1 = TLI.LowerOperation(Op, DAG);
1080 Result = DAG.getConstant(0, TLI.getPointerTy());
1082 case ISD::FRAME_TO_ARGS_OFFSET: {
1083 MVT VT = Node->getValueType(0);
1084 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1085 default: assert(0 && "This action is not supported yet!");
1086 case TargetLowering::Custom:
1087 Result = TLI.LowerOperation(Op, DAG);
1088 if (Result.getNode()) break;
1090 case TargetLowering::Legal:
1091 Result = DAG.getConstant(0, VT);
1096 case ISD::EXCEPTIONADDR: {
1097 Tmp1 = LegalizeOp(Node->getOperand(0));
1098 MVT VT = Node->getValueType(0);
1099 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1100 default: assert(0 && "This action is not supported yet!");
1101 case TargetLowering::Expand: {
1102 unsigned Reg = TLI.getExceptionAddressRegister();
1103 Result = DAG.getCopyFromReg(Tmp1, dl, Reg, VT);
1106 case TargetLowering::Custom:
1107 Result = TLI.LowerOperation(Op, DAG);
1108 if (Result.getNode()) break;
1110 case TargetLowering::Legal: {
1111 SDValue Ops[] = { DAG.getConstant(0, VT), Tmp1 };
1112 Result = DAG.getMergeValues(Ops, 2, dl);
1117 if (Result.getNode()->getNumValues() == 1) break;
1119 assert(Result.getNode()->getNumValues() == 2 &&
1120 "Cannot return more than two values!");
1122 // Since we produced two values, make sure to remember that we
1123 // legalized both of them.
1124 Tmp1 = LegalizeOp(Result);
1125 Tmp2 = LegalizeOp(Result.getValue(1));
1126 AddLegalizedOperand(Op.getValue(0), Tmp1);
1127 AddLegalizedOperand(Op.getValue(1), Tmp2);
1128 return Op.getResNo() ? Tmp2 : Tmp1;
1129 case ISD::EHSELECTION: {
1130 Tmp1 = LegalizeOp(Node->getOperand(0));
1131 Tmp2 = LegalizeOp(Node->getOperand(1));
1132 MVT VT = Node->getValueType(0);
1133 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1134 default: assert(0 && "This action is not supported yet!");
1135 case TargetLowering::Expand: {
1136 unsigned Reg = TLI.getExceptionSelectorRegister();
1137 Result = DAG.getCopyFromReg(Tmp2, dl, Reg, VT);
1140 case TargetLowering::Custom:
1141 Result = TLI.LowerOperation(Op, DAG);
1142 if (Result.getNode()) break;
1144 case TargetLowering::Legal: {
1145 SDValue Ops[] = { DAG.getConstant(0, VT), Tmp2 };
1146 Result = DAG.getMergeValues(Ops, 2, dl);
1151 if (Result.getNode()->getNumValues() == 1) break;
1153 assert(Result.getNode()->getNumValues() == 2 &&
1154 "Cannot return more than two values!");
1156 // Since we produced two values, make sure to remember that we
1157 // legalized both of them.
1158 Tmp1 = LegalizeOp(Result);
1159 Tmp2 = LegalizeOp(Result.getValue(1));
1160 AddLegalizedOperand(Op.getValue(0), Tmp1);
1161 AddLegalizedOperand(Op.getValue(1), Tmp2);
1162 return Op.getResNo() ? Tmp2 : Tmp1;
1163 case ISD::EH_RETURN: {
1164 MVT VT = Node->getValueType(0);
1165 // The only "good" option for this node is to custom lower it.
1166 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1167 default: assert(0 && "This action is not supported at all!");
1168 case TargetLowering::Custom:
1169 Result = TLI.LowerOperation(Op, DAG);
1170 if (Result.getNode()) break;
1172 case TargetLowering::Legal:
1173 // Target does not know, how to lower this, lower to noop
1174 Result = LegalizeOp(Node->getOperand(0));
1179 case ISD::AssertSext:
1180 case ISD::AssertZext:
1181 Tmp1 = LegalizeOp(Node->getOperand(0));
1182 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1184 case ISD::MERGE_VALUES:
1185 // Legalize eliminates MERGE_VALUES nodes.
1186 Result = Node->getOperand(Op.getResNo());
1188 case ISD::CopyFromReg:
1189 Tmp1 = LegalizeOp(Node->getOperand(0));
1190 Result = Op.getValue(0);
1191 if (Node->getNumValues() == 2) {
1192 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1194 assert(Node->getNumValues() == 3 && "Invalid copyfromreg!");
1195 if (Node->getNumOperands() == 3) {
1196 Tmp2 = LegalizeOp(Node->getOperand(2));
1197 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
1199 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1201 AddLegalizedOperand(Op.getValue(2), Result.getValue(2));
1203 // Since CopyFromReg produces two values, make sure to remember that we
1204 // legalized both of them.
1205 AddLegalizedOperand(Op.getValue(0), Result);
1206 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1207 return Result.getValue(Op.getResNo());
1209 MVT VT = Op.getValueType();
1210 switch (TLI.getOperationAction(ISD::UNDEF, VT)) {
1211 default: assert(0 && "This action is not supported yet!");
1212 case TargetLowering::Expand:
1214 Result = DAG.getConstant(0, VT);
1215 else if (VT.isFloatingPoint())
1216 Result = DAG.getConstantFP(APFloat(APInt(VT.getSizeInBits(), 0)),
1219 assert(0 && "Unknown value type!");
1221 case TargetLowering::Legal:
1227 case ISD::INTRINSIC_W_CHAIN:
1228 case ISD::INTRINSIC_WO_CHAIN:
1229 case ISD::INTRINSIC_VOID: {
1230 SmallVector<SDValue, 8> Ops;
1231 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
1232 Ops.push_back(LegalizeOp(Node->getOperand(i)));
1233 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1235 // Allow the target to custom lower its intrinsics if it wants to.
1236 if (TLI.getOperationAction(Node->getOpcode(), MVT::Other) ==
1237 TargetLowering::Custom) {
1238 Tmp3 = TLI.LowerOperation(Result, DAG);
1239 if (Tmp3.getNode()) Result = Tmp3;
1242 if (Result.getNode()->getNumValues() == 1) break;
1244 // Must have return value and chain result.
1245 assert(Result.getNode()->getNumValues() == 2 &&
1246 "Cannot return more than two values!");
1248 // Since loads produce two values, make sure to remember that we
1249 // legalized both of them.
1250 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
1251 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
1252 return Result.getValue(Op.getResNo());
1255 case ISD::DBG_STOPPOINT:
1256 assert(Node->getNumOperands() == 1 && "Invalid DBG_STOPPOINT node!");
1257 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input chain.
1259 switch (TLI.getOperationAction(ISD::DBG_STOPPOINT, MVT::Other)) {
1260 case TargetLowering::Promote:
1261 default: assert(0 && "This action is not supported yet!");
1262 case TargetLowering::Expand: {
1263 DwarfWriter *DW = DAG.getDwarfWriter();
1264 bool useDEBUG_LOC = TLI.isOperationLegalOrCustom(ISD::DEBUG_LOC,
1266 bool useLABEL = TLI.isOperationLegalOrCustom(ISD::DBG_LABEL, MVT::Other);
1268 const DbgStopPointSDNode *DSP = cast<DbgStopPointSDNode>(Node);
1269 GlobalVariable *CU_GV = cast<GlobalVariable>(DSP->getCompileUnit());
1270 if (DW && (useDEBUG_LOC || useLABEL) && !CU_GV->isDeclaration()) {
1271 DICompileUnit CU(cast<GlobalVariable>(DSP->getCompileUnit()));
1273 unsigned Line = DSP->getLine();
1274 unsigned Col = DSP->getColumn();
1276 if (OptLevel == CodeGenOpt::None) {
1277 // A bit self-referential to have DebugLoc on Debug_Loc nodes, but it
1278 // won't hurt anything.
1280 SDValue Ops[] = { Tmp1, DAG.getConstant(Line, MVT::i32),
1281 DAG.getConstant(Col, MVT::i32),
1282 DAG.getSrcValue(CU.getGV()) };
1283 Result = DAG.getNode(ISD::DEBUG_LOC, dl, MVT::Other, Ops, 4);
1285 unsigned ID = DW->RecordSourceLine(Line, Col, CU);
1286 Result = DAG.getLabel(ISD::DBG_LABEL, dl, Tmp1, ID);
1289 Result = Tmp1; // chain
1292 Result = Tmp1; // chain
1296 case TargetLowering::Custom:
1297 Result = TLI.LowerOperation(Op, DAG);
1298 if (Result.getNode())
1300 case TargetLowering::Legal: {
1301 LegalizeAction Action = getTypeAction(Node->getOperand(1).getValueType());
1302 if (Action == Legal && Tmp1 == Node->getOperand(0))
1305 SmallVector<SDValue, 8> Ops;
1306 Ops.push_back(Tmp1);
1307 if (Action == Legal) {
1308 Ops.push_back(Node->getOperand(1)); // line # must be legal.
1309 Ops.push_back(Node->getOperand(2)); // col # must be legal.
1311 // Otherwise promote them.
1312 Ops.push_back(PromoteOp(Node->getOperand(1)));
1313 Ops.push_back(PromoteOp(Node->getOperand(2)));
1315 Ops.push_back(Node->getOperand(3)); // filename must be legal.
1316 Ops.push_back(Node->getOperand(4)); // working dir # must be legal.
1317 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1324 assert(Node->getNumOperands() == 3 && "Invalid DECLARE node!");
1325 switch (TLI.getOperationAction(ISD::DECLARE, MVT::Other)) {
1326 default: assert(0 && "This action is not supported yet!");
1327 case TargetLowering::Legal:
1328 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1329 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the address.
1330 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the variable.
1331 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1333 case TargetLowering::Expand:
1334 Result = LegalizeOp(Node->getOperand(0));
1339 case ISD::DEBUG_LOC:
1340 assert(Node->getNumOperands() == 4 && "Invalid DEBUG_LOC node!");
1341 switch (TLI.getOperationAction(ISD::DEBUG_LOC, MVT::Other)) {
1342 default: assert(0 && "This action is not supported yet!");
1343 case TargetLowering::Legal: {
1344 LegalizeAction Action = getTypeAction(Node->getOperand(1).getValueType());
1345 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1346 if (Action == Legal && Tmp1 == Node->getOperand(0))
1348 if (Action == Legal) {
1349 Tmp2 = Node->getOperand(1);
1350 Tmp3 = Node->getOperand(2);
1351 Tmp4 = Node->getOperand(3);
1353 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the line #.
1354 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the col #.
1355 Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize the source file id.
1357 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4);
1363 case ISD::DBG_LABEL:
1365 assert(Node->getNumOperands() == 1 && "Invalid LABEL node!");
1366 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
1367 default: assert(0 && "This action is not supported yet!");
1368 case TargetLowering::Legal:
1369 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1370 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1372 case TargetLowering::Expand:
1373 Result = LegalizeOp(Node->getOperand(0));
1379 assert(Node->getNumOperands() == 4 && "Invalid Prefetch node!");
1380 switch (TLI.getOperationAction(ISD::PREFETCH, MVT::Other)) {
1381 default: assert(0 && "This action is not supported yet!");
1382 case TargetLowering::Legal:
1383 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1384 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the address.
1385 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the rw specifier.
1386 Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize locality specifier.
1387 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4);
1389 case TargetLowering::Expand:
1391 Result = LegalizeOp(Node->getOperand(0));
1396 case ISD::MEMBARRIER: {
1397 assert(Node->getNumOperands() == 6 && "Invalid MemBarrier node!");
1398 switch (TLI.getOperationAction(ISD::MEMBARRIER, MVT::Other)) {
1399 default: assert(0 && "This action is not supported yet!");
1400 case TargetLowering::Legal: {
1402 Ops[0] = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1403 for (int x = 1; x < 6; ++x) {
1404 Ops[x] = Node->getOperand(x);
1405 if (!isTypeLegal(Ops[x].getValueType()))
1406 Ops[x] = PromoteOp(Ops[x]);
1408 Result = DAG.UpdateNodeOperands(Result, &Ops[0], 6);
1411 case TargetLowering::Expand:
1412 //There is no libgcc call for this op
1413 Result = Node->getOperand(0); // Noop
1419 case ISD::ATOMIC_CMP_SWAP: {
1420 unsigned int num_operands = 4;
1421 assert(Node->getNumOperands() == num_operands && "Invalid Atomic node!");
1423 for (unsigned int x = 0; x < num_operands; ++x)
1424 Ops[x] = LegalizeOp(Node->getOperand(x));
1425 Result = DAG.UpdateNodeOperands(Result, &Ops[0], num_operands);
1427 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
1428 default: assert(0 && "This action is not supported yet!");
1429 case TargetLowering::Custom:
1430 Result = TLI.LowerOperation(Result, DAG);
1432 case TargetLowering::Legal:
1435 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
1436 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
1437 return Result.getValue(Op.getResNo());
1439 case ISD::ATOMIC_LOAD_ADD:
1440 case ISD::ATOMIC_LOAD_SUB:
1441 case ISD::ATOMIC_LOAD_AND:
1442 case ISD::ATOMIC_LOAD_OR:
1443 case ISD::ATOMIC_LOAD_XOR:
1444 case ISD::ATOMIC_LOAD_NAND:
1445 case ISD::ATOMIC_LOAD_MIN:
1446 case ISD::ATOMIC_LOAD_MAX:
1447 case ISD::ATOMIC_LOAD_UMIN:
1448 case ISD::ATOMIC_LOAD_UMAX:
1449 case ISD::ATOMIC_SWAP: {
1450 unsigned int num_operands = 3;
1451 assert(Node->getNumOperands() == num_operands && "Invalid Atomic node!");
1453 for (unsigned int x = 0; x < num_operands; ++x)
1454 Ops[x] = LegalizeOp(Node->getOperand(x));
1455 Result = DAG.UpdateNodeOperands(Result, &Ops[0], num_operands);
1457 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
1458 default: assert(0 && "This action is not supported yet!");
1459 case TargetLowering::Custom:
1460 Result = TLI.LowerOperation(Result, DAG);
1462 case TargetLowering::Legal:
1465 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
1466 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
1467 return Result.getValue(Op.getResNo());
1469 case ISD::Constant: {
1470 ConstantSDNode *CN = cast<ConstantSDNode>(Node);
1472 TLI.getOperationAction(ISD::Constant, CN->getValueType(0));
1474 // We know we don't need to expand constants here, constants only have one
1475 // value and we check that it is fine above.
1477 if (opAction == TargetLowering::Custom) {
1478 Tmp1 = TLI.LowerOperation(Result, DAG);
1484 case ISD::ConstantFP: {
1485 // Spill FP immediates to the constant pool if the target cannot directly
1486 // codegen them. Targets often have some immediate values that can be
1487 // efficiently generated into an FP register without a load. We explicitly
1488 // leave these constants as ConstantFP nodes for the target to deal with.
1489 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
1491 switch (TLI.getOperationAction(ISD::ConstantFP, CFP->getValueType(0))) {
1492 default: assert(0 && "This action is not supported yet!");
1493 case TargetLowering::Legal:
1495 case TargetLowering::Custom:
1496 Tmp3 = TLI.LowerOperation(Result, DAG);
1497 if (Tmp3.getNode()) {
1502 case TargetLowering::Expand: {
1503 // Check to see if this FP immediate is already legal.
1504 bool isLegal = false;
1505 for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(),
1506 E = TLI.legal_fpimm_end(); I != E; ++I) {
1507 if (CFP->isExactlyValue(*I)) {
1512 // If this is a legal constant, turn it into a TargetConstantFP node.
1515 Result = ExpandConstantFP(CFP, true, DAG, TLI);
1520 case ISD::TokenFactor:
1521 if (Node->getNumOperands() == 2) {
1522 Tmp1 = LegalizeOp(Node->getOperand(0));
1523 Tmp2 = LegalizeOp(Node->getOperand(1));
1524 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1525 } else if (Node->getNumOperands() == 3) {
1526 Tmp1 = LegalizeOp(Node->getOperand(0));
1527 Tmp2 = LegalizeOp(Node->getOperand(1));
1528 Tmp3 = LegalizeOp(Node->getOperand(2));
1529 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1531 SmallVector<SDValue, 8> Ops;
1532 // Legalize the operands.
1533 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
1534 Ops.push_back(LegalizeOp(Node->getOperand(i)));
1535 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1539 case ISD::FORMAL_ARGUMENTS:
1541 // The only option for this is to custom lower it.
1542 Tmp3 = TLI.LowerOperation(Result.getValue(0), DAG);
1543 assert(Tmp3.getNode() && "Target didn't custom lower this node!");
1544 // A call within a calling sequence must be legalized to something
1545 // other than the normal CALLSEQ_END. Violating this gets Legalize
1546 // into an infinite loop.
1547 assert ((!IsLegalizingCall ||
1548 Node->getOpcode() != ISD::CALL ||
1549 Tmp3.getNode()->getOpcode() != ISD::CALLSEQ_END) &&
1550 "Nested CALLSEQ_START..CALLSEQ_END not supported.");
1552 // The number of incoming and outgoing values should match; unless the final
1553 // outgoing value is a flag.
1554 assert((Tmp3.getNode()->getNumValues() == Result.getNode()->getNumValues() ||
1555 (Tmp3.getNode()->getNumValues() == Result.getNode()->getNumValues() + 1 &&
1556 Tmp3.getNode()->getValueType(Tmp3.getNode()->getNumValues() - 1) ==
1558 "Lowering call/formal_arguments produced unexpected # results!");
1560 // Since CALL/FORMAL_ARGUMENTS nodes produce multiple values, make sure to
1561 // remember that we legalized all of them, so it doesn't get relegalized.
1562 for (unsigned i = 0, e = Tmp3.getNode()->getNumValues(); i != e; ++i) {
1563 if (Tmp3.getNode()->getValueType(i) == MVT::Flag)
1565 Tmp1 = LegalizeOp(Tmp3.getValue(i));
1566 if (Op.getResNo() == i)
1568 AddLegalizedOperand(SDValue(Node, i), Tmp1);
1571 case ISD::BUILD_VECTOR:
1572 switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) {
1573 default: assert(0 && "This action is not supported yet!");
1574 case TargetLowering::Custom:
1575 Tmp3 = TLI.LowerOperation(Result, DAG);
1576 if (Tmp3.getNode()) {
1581 case TargetLowering::Expand:
1582 Result = ExpandBUILD_VECTOR(Result.getNode());
1586 case ISD::INSERT_VECTOR_ELT:
1587 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVec
1588 Tmp3 = LegalizeOp(Node->getOperand(2)); // InEltNo
1590 // The type of the value to insert may not be legal, even though the vector
1591 // type is legal. Legalize/Promote accordingly. We do not handle Expand
1593 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1594 default: assert(0 && "Cannot expand insert element operand");
1595 case Legal: Tmp2 = LegalizeOp(Node->getOperand(1)); break;
1596 case Promote: Tmp2 = PromoteOp(Node->getOperand(1)); break;
1598 // FIXME: An alternative would be to check to see if the target is not
1599 // going to custom lower this operation, we could bitcast to half elt
1600 // width and perform two inserts at that width, if that is legal.
1601 Tmp2 = Node->getOperand(1);
1604 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1606 switch (TLI.getOperationAction(ISD::INSERT_VECTOR_ELT,
1607 Node->getValueType(0))) {
1608 default: assert(0 && "This action is not supported yet!");
1609 case TargetLowering::Legal:
1611 case TargetLowering::Custom:
1612 Tmp4 = TLI.LowerOperation(Result, DAG);
1613 if (Tmp4.getNode()) {
1618 case TargetLowering::Promote:
1619 // Fall thru for vector case
1620 case TargetLowering::Expand: {
1621 // If the insert index is a constant, codegen this as a scalar_to_vector,
1622 // then a shuffle that inserts it into the right position in the vector.
1623 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Tmp3)) {
1624 // SCALAR_TO_VECTOR requires that the type of the value being inserted
1625 // match the element type of the vector being created, except for
1626 // integers in which case the inserted value can be over width.
1627 MVT EltVT = Op.getValueType().getVectorElementType();
1628 if (Tmp2.getValueType() == EltVT ||
1629 (EltVT.isInteger() && Tmp2.getValueType().bitsGE(EltVT))) {
1630 SDValue ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl,
1631 Tmp1.getValueType(), Tmp2);
1633 unsigned NumElts = Tmp1.getValueType().getVectorNumElements();
1634 // We generate a shuffle of InVec and ScVec, so the shuffle mask
1635 // should be 0,1,2,3,4,5... with the appropriate element replaced with
1636 // elt 0 of the RHS.
1637 SmallVector<int, 8> ShufOps;
1638 for (unsigned i = 0; i != NumElts; ++i)
1639 ShufOps.push_back(i != InsertPos->getZExtValue() ? i : NumElts);
1641 Result = DAG.getVectorShuffle(Tmp1.getValueType(), dl, Tmp1, ScVec,
1643 Result = LegalizeOp(Result);
1647 Result = PerformInsertVectorEltInMemory(Tmp1, Tmp2, Tmp3, dl);
1652 case ISD::SCALAR_TO_VECTOR:
1653 if (!TLI.isTypeLegal(Node->getOperand(0).getValueType())) {
1654 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
1658 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVal
1659 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1660 switch (TLI.getOperationAction(ISD::SCALAR_TO_VECTOR,
1661 Node->getValueType(0))) {
1662 default: assert(0 && "This action is not supported yet!");
1663 case TargetLowering::Legal:
1665 case TargetLowering::Custom:
1666 Tmp3 = TLI.LowerOperation(Result, DAG);
1667 if (Tmp3.getNode()) {
1672 case TargetLowering::Expand:
1673 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
1677 case ISD::VECTOR_SHUFFLE: {
1678 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input vectors,
1679 Tmp2 = LegalizeOp(Node->getOperand(1)); // but not the shuffle mask.
1680 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1681 MVT VT = Result.getValueType();
1683 // Copy the Mask to a local SmallVector for use with isShuffleMaskLegal.
1684 SmallVector<int, 8> Mask;
1685 cast<ShuffleVectorSDNode>(Result)->getMask(Mask);
1687 // Allow targets to custom lower the SHUFFLEs they support.
1688 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE, VT)) {
1689 default: assert(0 && "Unknown operation action!");
1690 case TargetLowering::Legal:
1691 assert(TLI.isShuffleMaskLegal(Mask, VT) &&
1692 "vector shuffle should not be created if not legal!");
1694 case TargetLowering::Custom:
1695 Tmp3 = TLI.LowerOperation(Result, DAG);
1696 if (Tmp3.getNode()) {
1701 case TargetLowering::Expand: {
1702 MVT EltVT = VT.getVectorElementType();
1703 unsigned NumElems = VT.getVectorNumElements();
1704 SmallVector<SDValue, 8> Ops;
1705 for (unsigned i = 0; i != NumElems; ++i) {
1707 Ops.push_back(DAG.getUNDEF(EltVT));
1710 unsigned Idx = Mask[i];
1712 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Tmp1,
1713 DAG.getIntPtrConstant(Idx)));
1715 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, Tmp2,
1716 DAG.getIntPtrConstant(Idx - NumElems)));
1718 Result = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, &Ops[0], Ops.size());
1721 case TargetLowering::Promote: {
1722 // Change base type to a different vector type.
1723 MVT OVT = Node->getValueType(0);
1724 MVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
1726 // Cast the two input vectors.
1727 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Tmp1);
1728 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Tmp2);
1730 // Convert the shuffle mask to the right # elements.
1731 Result = ShuffleWithNarrowerEltType(NVT, OVT, dl, Tmp1, Tmp2, Mask);
1732 Result = DAG.getNode(ISD::BIT_CONVERT, dl, OVT, Result);
1738 case ISD::EXTRACT_VECTOR_ELT:
1739 Tmp1 = Node->getOperand(0);
1740 Tmp2 = LegalizeOp(Node->getOperand(1));
1741 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1742 Result = ExpandEXTRACT_VECTOR_ELT(Result);
1745 case ISD::EXTRACT_SUBVECTOR:
1746 Tmp1 = Node->getOperand(0);
1747 Tmp2 = LegalizeOp(Node->getOperand(1));
1748 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1749 Result = ExpandEXTRACT_SUBVECTOR(Result);
1752 case ISD::CONCAT_VECTORS: {
1753 // Legalize the operands.
1754 SmallVector<SDValue, 8> Ops;
1755 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
1756 Ops.push_back(LegalizeOp(Node->getOperand(i)));
1757 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1759 switch (TLI.getOperationAction(ISD::CONCAT_VECTORS,
1760 Node->getValueType(0))) {
1761 default: assert(0 && "Unknown operation action!");
1762 case TargetLowering::Legal:
1764 case TargetLowering::Custom:
1765 Tmp3 = TLI.LowerOperation(Result, DAG);
1766 if (Tmp3.getNode()) {
1771 case TargetLowering::Expand: {
1772 // Use extract/insert/build vector for now. We might try to be
1773 // more clever later.
1774 MVT PtrVT = TLI.getPointerTy();
1775 SmallVector<SDValue, 8> Ops;
1776 unsigned NumOperands = Node->getNumOperands();
1777 for (unsigned i=0; i < NumOperands; ++i) {
1778 SDValue SubOp = Node->getOperand(i);
1779 MVT VVT = SubOp.getNode()->getValueType(0);
1780 MVT EltVT = VVT.getVectorElementType();
1781 unsigned NumSubElem = VVT.getVectorNumElements();
1782 for (unsigned j=0; j < NumSubElem; ++j) {
1783 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EltVT, SubOp,
1784 DAG.getConstant(j, PtrVT)));
1787 return LegalizeOp(DAG.getNode(ISD::BUILD_VECTOR, dl,
1788 Node->getValueType(0),
1789 &Ops[0], Ops.size()));
1795 case ISD::CALLSEQ_START: {
1796 SDNode *CallEnd = FindCallEndFromCallStart(Node);
1798 // Recursively Legalize all of the inputs of the call end that do not lead
1799 // to this call start. This ensures that any libcalls that need be inserted
1800 // are inserted *before* the CALLSEQ_START.
1801 IsLegalizingCallArgs = true;
1802 {SmallPtrSet<SDNode*, 32> NodesLeadingTo;
1803 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
1804 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).getNode(), Node,
1807 IsLegalizingCallArgs = false;
1809 // Now that we legalized all of the inputs (which may have inserted
1810 // libcalls) create the new CALLSEQ_START node.
1811 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1813 // Merge in the last call, to ensure that this call start after the last
1815 if (LastCALLSEQ_END.getOpcode() != ISD::EntryToken) {
1816 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
1817 Tmp1, LastCALLSEQ_END);
1818 Tmp1 = LegalizeOp(Tmp1);
1821 // Do not try to legalize the target-specific arguments (#1+).
1822 if (Tmp1 != Node->getOperand(0)) {
1823 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1825 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1828 // Remember that the CALLSEQ_START is legalized.
1829 AddLegalizedOperand(Op.getValue(0), Result);
1830 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
1831 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1833 // Now that the callseq_start and all of the non-call nodes above this call
1834 // sequence have been legalized, legalize the call itself. During this
1835 // process, no libcalls can/will be inserted, guaranteeing that no calls
1837 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
1838 // Note that we are selecting this call!
1839 LastCALLSEQ_END = SDValue(CallEnd, 0);
1840 IsLegalizingCall = true;
1842 // Legalize the call, starting from the CALLSEQ_END.
1843 LegalizeOp(LastCALLSEQ_END);
1844 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
1847 case ISD::CALLSEQ_END:
1848 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
1849 // will cause this node to be legalized as well as handling libcalls right.
1850 if (LastCALLSEQ_END.getNode() != Node) {
1851 LegalizeOp(SDValue(FindCallStartFromCallEnd(Node), 0));
1852 DenseMap<SDValue, SDValue>::iterator I = LegalizedNodes.find(Op);
1853 assert(I != LegalizedNodes.end() &&
1854 "Legalizing the call start should have legalized this node!");
1858 // Otherwise, the call start has been legalized and everything is going
1859 // according to plan. Just legalize ourselves normally here.
1860 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1861 // Do not try to legalize the target-specific arguments (#1+), except for
1862 // an optional flag input.
1863 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
1864 if (Tmp1 != Node->getOperand(0)) {
1865 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1867 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1870 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
1871 if (Tmp1 != Node->getOperand(0) ||
1872 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
1873 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1876 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1879 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
1880 // This finishes up call legalization.
1881 IsLegalizingCall = false;
1883 // If the CALLSEQ_END node has a flag, remember that we legalized it.
1884 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
1885 if (Node->getNumValues() == 2)
1886 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
1887 return Result.getValue(Op.getResNo());
1888 case ISD::DYNAMIC_STACKALLOC: {
1889 MVT VT = Node->getValueType(0);
1890 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1891 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size.
1892 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment.
1893 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1895 Tmp1 = Result.getValue(0);
1896 Tmp2 = Result.getValue(1);
1897 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1898 default: assert(0 && "This action is not supported yet!");
1899 case TargetLowering::Expand: {
1900 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1901 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1902 " not tell us which reg is the stack pointer!");
1903 SDValue Chain = Tmp1.getOperand(0);
1905 // Chain the dynamic stack allocation so that it doesn't modify the stack
1906 // pointer when other instructions are using the stack.
1907 Chain = DAG.getCALLSEQ_START(Chain, DAG.getIntPtrConstant(0, true));
1909 SDValue Size = Tmp2.getOperand(1);
1910 SDValue SP = DAG.getCopyFromReg(Chain, dl, SPReg, VT);
1911 Chain = SP.getValue(1);
1912 unsigned Align = cast<ConstantSDNode>(Tmp3)->getZExtValue();
1913 unsigned StackAlign =
1914 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
1915 if (Align > StackAlign)
1916 SP = DAG.getNode(ISD::AND, dl, VT, SP,
1917 DAG.getConstant(-(uint64_t)Align, VT));
1918 Tmp1 = DAG.getNode(ISD::SUB, dl, VT, SP, Size); // Value
1919 Chain = DAG.getCopyToReg(Chain, dl, SPReg, Tmp1); // Output chain
1921 Tmp2 = DAG.getCALLSEQ_END(Chain, DAG.getIntPtrConstant(0, true),
1922 DAG.getIntPtrConstant(0, true), SDValue());
1924 Tmp1 = LegalizeOp(Tmp1);
1925 Tmp2 = LegalizeOp(Tmp2);
1928 case TargetLowering::Custom:
1929 Tmp3 = TLI.LowerOperation(Tmp1, DAG);
1930 if (Tmp3.getNode()) {
1931 Tmp1 = LegalizeOp(Tmp3);
1932 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1935 case TargetLowering::Legal:
1938 // Since this op produce two values, make sure to remember that we
1939 // legalized both of them.
1940 AddLegalizedOperand(SDValue(Node, 0), Tmp1);
1941 AddLegalizedOperand(SDValue(Node, 1), Tmp2);
1942 return Op.getResNo() ? Tmp2 : Tmp1;
1944 case ISD::INLINEASM: {
1945 SmallVector<SDValue, 8> Ops(Node->op_begin(), Node->op_end());
1946 bool Changed = false;
1947 // Legalize all of the operands of the inline asm, in case they are nodes
1948 // that need to be expanded or something. Note we skip the asm string and
1949 // all of the TargetConstant flags.
1950 SDValue Op = LegalizeOp(Ops[0]);
1951 Changed = Op != Ops[0];
1954 bool HasInFlag = Ops.back().getValueType() == MVT::Flag;
1955 for (unsigned i = 2, e = Ops.size()-HasInFlag; i < e; ) {
1956 unsigned NumVals = InlineAsm::
1957 getNumOperandRegisters(cast<ConstantSDNode>(Ops[i])->getZExtValue());
1958 for (++i; NumVals; ++i, --NumVals) {
1959 SDValue Op = LegalizeOp(Ops[i]);
1968 Op = LegalizeOp(Ops.back());
1969 Changed |= Op != Ops.back();
1974 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1976 // INLINE asm returns a chain and flag, make sure to add both to the map.
1977 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
1978 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
1979 return Result.getValue(Op.getResNo());
1982 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1983 // Ensure that libcalls are emitted before a branch.
1984 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Tmp1, LastCALLSEQ_END);
1985 Tmp1 = LegalizeOp(Tmp1);
1986 LastCALLSEQ_END = DAG.getEntryNode();
1988 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1991 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1992 // Ensure that libcalls are emitted before a branch.
1993 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Tmp1, LastCALLSEQ_END);
1994 Tmp1 = LegalizeOp(Tmp1);
1995 LastCALLSEQ_END = DAG.getEntryNode();
1997 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1998 default: assert(0 && "Indirect target must be legal type (pointer)!");
2000 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
2003 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2006 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2007 // Ensure that libcalls are emitted before a branch.
2008 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Tmp1, LastCALLSEQ_END);
2009 Tmp1 = LegalizeOp(Tmp1);
2010 LastCALLSEQ_END = DAG.getEntryNode();
2012 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the jumptable node.
2013 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2015 switch (TLI.getOperationAction(ISD::BR_JT, MVT::Other)) {
2016 default: assert(0 && "This action is not supported yet!");
2017 case TargetLowering::Legal: break;
2018 case TargetLowering::Custom:
2019 Tmp1 = TLI.LowerOperation(Result, DAG);
2020 if (Tmp1.getNode()) Result = Tmp1;
2022 case TargetLowering::Expand: {
2023 SDValue Chain = Result.getOperand(0);
2024 SDValue Table = Result.getOperand(1);
2025 SDValue Index = Result.getOperand(2);
2027 MVT PTy = TLI.getPointerTy();
2028 MachineFunction &MF = DAG.getMachineFunction();
2029 unsigned EntrySize = MF.getJumpTableInfo()->getEntrySize();
2030 Index= DAG.getNode(ISD::MUL, dl, PTy,
2031 Index, DAG.getConstant(EntrySize, PTy));
2032 SDValue Addr = DAG.getNode(ISD::ADD, dl, PTy, Index, Table);
2034 MVT MemVT = MVT::getIntegerVT(EntrySize * 8);
2035 SDValue LD = DAG.getExtLoad(ISD::SEXTLOAD, dl, PTy, Chain, Addr,
2036 PseudoSourceValue::getJumpTable(), 0, MemVT);
2038 if (TLI.getTargetMachine().getRelocationModel() == Reloc::PIC_) {
2039 // For PIC, the sequence is:
2040 // BRIND(load(Jumptable + index) + RelocBase)
2041 // RelocBase can be JumpTable, GOT or some sort of global base.
2042 Addr = DAG.getNode(ISD::ADD, dl, PTy, Addr,
2043 TLI.getPICJumpTableRelocBase(Table, DAG));
2045 Result = DAG.getNode(ISD::BRIND, dl, MVT::Other, LD.getValue(1), Addr);
2050 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2051 // Ensure that libcalls are emitted before a return.
2052 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Tmp1, LastCALLSEQ_END);
2053 Tmp1 = LegalizeOp(Tmp1);
2054 LastCALLSEQ_END = DAG.getEntryNode();
2056 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2057 case Expand: assert(0 && "It's impossible to expand bools");
2059 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
2062 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition.
2064 // The top bits of the promoted condition are not necessarily zero, ensure
2065 // that the value is properly zero extended.
2066 unsigned BitWidth = Tmp2.getValueSizeInBits();
2067 if (!DAG.MaskedValueIsZero(Tmp2,
2068 APInt::getHighBitsSet(BitWidth, BitWidth-1)))
2069 Tmp2 = DAG.getZeroExtendInReg(Tmp2, dl, MVT::i1);
2074 // Basic block destination (Op#2) is always legal.
2075 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2077 switch (TLI.getOperationAction(ISD::BRCOND, MVT::Other)) {
2078 default: assert(0 && "This action is not supported yet!");
2079 case TargetLowering::Legal: break;
2080 case TargetLowering::Custom:
2081 Tmp1 = TLI.LowerOperation(Result, DAG);
2082 if (Tmp1.getNode()) Result = Tmp1;
2084 case TargetLowering::Expand:
2085 // Expand brcond's setcc into its constituent parts and create a BR_CC
2087 if (Tmp2.getOpcode() == ISD::SETCC) {
2088 Result = DAG.getNode(ISD::BR_CC, dl, MVT::Other,
2089 Tmp1, Tmp2.getOperand(2),
2090 Tmp2.getOperand(0), Tmp2.getOperand(1),
2091 Node->getOperand(2));
2093 Result = DAG.getNode(ISD::BR_CC, dl, MVT::Other, Tmp1,
2094 DAG.getCondCode(ISD::SETNE), Tmp2,
2095 DAG.getConstant(0, Tmp2.getValueType()),
2096 Node->getOperand(2));
2102 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2103 // Ensure that libcalls are emitted before a branch.
2104 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Tmp1, LastCALLSEQ_END);
2105 Tmp1 = LegalizeOp(Tmp1);
2106 Tmp2 = Node->getOperand(2); // LHS
2107 Tmp3 = Node->getOperand(3); // RHS
2108 Tmp4 = Node->getOperand(1); // CC
2110 LegalizeSetCC(TLI.getSetCCResultType(Tmp2.getValueType()),
2111 Tmp2, Tmp3, Tmp4, dl);
2112 LastCALLSEQ_END = DAG.getEntryNode();
2114 // If we didn't get both a LHS and RHS back from LegalizeSetCC,
2115 // the LHS is a legal SETCC itself. In this case, we need to compare
2116 // the result against zero to select between true and false values.
2117 if (Tmp3.getNode() == 0) {
2118 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
2119 Tmp4 = DAG.getCondCode(ISD::SETNE);
2122 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp4, Tmp2, Tmp3,
2123 Node->getOperand(4));
2125 switch (TLI.getOperationAction(ISD::BR_CC, Tmp3.getValueType())) {
2126 default: assert(0 && "Unexpected action for BR_CC!");
2127 case TargetLowering::Legal: break;
2128 case TargetLowering::Custom:
2129 Tmp4 = TLI.LowerOperation(Result, DAG);
2130 if (Tmp4.getNode()) Result = Tmp4;
2135 LoadSDNode *LD = cast<LoadSDNode>(Node);
2136 Tmp1 = LegalizeOp(LD->getChain()); // Legalize the chain.
2137 Tmp2 = LegalizeOp(LD->getBasePtr()); // Legalize the base pointer.
2139 ISD::LoadExtType ExtType = LD->getExtensionType();
2140 if (ExtType == ISD::NON_EXTLOAD) {
2141 MVT VT = Node->getValueType(0);
2142 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
2143 Tmp3 = Result.getValue(0);
2144 Tmp4 = Result.getValue(1);
2146 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
2147 default: assert(0 && "This action is not supported yet!");
2148 case TargetLowering::Legal:
2149 // If this is an unaligned load and the target doesn't support it,
2151 if (!TLI.allowsUnalignedMemoryAccesses()) {
2152 unsigned ABIAlignment = TLI.getTargetData()->
2153 getABITypeAlignment(LD->getMemoryVT().getTypeForMVT());
2154 if (LD->getAlignment() < ABIAlignment){
2155 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.getNode()), DAG,
2157 Tmp3 = Result.getOperand(0);
2158 Tmp4 = Result.getOperand(1);
2159 Tmp3 = LegalizeOp(Tmp3);
2160 Tmp4 = LegalizeOp(Tmp4);
2164 case TargetLowering::Custom:
2165 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
2166 if (Tmp1.getNode()) {
2167 Tmp3 = LegalizeOp(Tmp1);
2168 Tmp4 = LegalizeOp(Tmp1.getValue(1));
2171 case TargetLowering::Promote: {
2172 // Only promote a load of vector type to another.
2173 assert(VT.isVector() && "Cannot promote this load!");
2174 // Change base type to a different vector type.
2175 MVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
2177 Tmp1 = DAG.getLoad(NVT, dl, Tmp1, Tmp2, LD->getSrcValue(),
2178 LD->getSrcValueOffset(),
2179 LD->isVolatile(), LD->getAlignment());
2180 Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, dl, VT, Tmp1));
2181 Tmp4 = LegalizeOp(Tmp1.getValue(1));
2185 // Since loads produce two values, make sure to remember that we
2186 // legalized both of them.
2187 AddLegalizedOperand(SDValue(Node, 0), Tmp3);
2188 AddLegalizedOperand(SDValue(Node, 1), Tmp4);
2189 return Op.getResNo() ? Tmp4 : Tmp3;
2191 MVT SrcVT = LD->getMemoryVT();
2192 unsigned SrcWidth = SrcVT.getSizeInBits();
2193 int SVOffset = LD->getSrcValueOffset();
2194 unsigned Alignment = LD->getAlignment();
2195 bool isVolatile = LD->isVolatile();
2197 if (SrcWidth != SrcVT.getStoreSizeInBits() &&
2198 // Some targets pretend to have an i1 loading operation, and actually
2199 // load an i8. This trick is correct for ZEXTLOAD because the top 7
2200 // bits are guaranteed to be zero; it helps the optimizers understand
2201 // that these bits are zero. It is also useful for EXTLOAD, since it
2202 // tells the optimizers that those bits are undefined. It would be
2203 // nice to have an effective generic way of getting these benefits...
2204 // Until such a way is found, don't insist on promoting i1 here.
2205 (SrcVT != MVT::i1 ||
2206 TLI.getLoadExtAction(ExtType, MVT::i1) == TargetLowering::Promote)) {
2207 // Promote to a byte-sized load if not loading an integral number of
2208 // bytes. For example, promote EXTLOAD:i20 -> EXTLOAD:i24.
2209 unsigned NewWidth = SrcVT.getStoreSizeInBits();
2210 MVT NVT = MVT::getIntegerVT(NewWidth);
2213 // The extra bits are guaranteed to be zero, since we stored them that
2214 // way. A zext load from NVT thus automatically gives zext from SrcVT.
2216 ISD::LoadExtType NewExtType =
2217 ExtType == ISD::ZEXTLOAD ? ISD::ZEXTLOAD : ISD::EXTLOAD;
2219 Result = DAG.getExtLoad(NewExtType, dl, Node->getValueType(0),
2220 Tmp1, Tmp2, LD->getSrcValue(), SVOffset,
2221 NVT, isVolatile, Alignment);
2223 Ch = Result.getValue(1); // The chain.
2225 if (ExtType == ISD::SEXTLOAD)
2226 // Having the top bits zero doesn't help when sign extending.
2227 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
2228 Result.getValueType(),
2229 Result, DAG.getValueType(SrcVT));
2230 else if (ExtType == ISD::ZEXTLOAD || NVT == Result.getValueType())
2231 // All the top bits are guaranteed to be zero - inform the optimizers.
2232 Result = DAG.getNode(ISD::AssertZext, dl,
2233 Result.getValueType(), Result,
2234 DAG.getValueType(SrcVT));
2236 Tmp1 = LegalizeOp(Result);
2237 Tmp2 = LegalizeOp(Ch);
2238 } else if (SrcWidth & (SrcWidth - 1)) {
2239 // If not loading a power-of-2 number of bits, expand as two loads.
2240 assert(SrcVT.isExtended() && !SrcVT.isVector() &&
2241 "Unsupported extload!");
2242 unsigned RoundWidth = 1 << Log2_32(SrcWidth);
2243 assert(RoundWidth < SrcWidth);
2244 unsigned ExtraWidth = SrcWidth - RoundWidth;
2245 assert(ExtraWidth < RoundWidth);
2246 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
2247 "Load size not an integral number of bytes!");
2248 MVT RoundVT = MVT::getIntegerVT(RoundWidth);
2249 MVT ExtraVT = MVT::getIntegerVT(ExtraWidth);
2251 unsigned IncrementSize;
2253 if (TLI.isLittleEndian()) {
2254 // EXTLOAD:i24 -> ZEXTLOAD:i16 | (shl EXTLOAD@+2:i8, 16)
2255 // Load the bottom RoundWidth bits.
2256 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl,
2257 Node->getValueType(0), Tmp1, Tmp2,
2258 LD->getSrcValue(), SVOffset, RoundVT, isVolatile,
2261 // Load the remaining ExtraWidth bits.
2262 IncrementSize = RoundWidth / 8;
2263 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
2264 DAG.getIntPtrConstant(IncrementSize));
2265 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
2266 LD->getSrcValue(), SVOffset + IncrementSize,
2267 ExtraVT, isVolatile,
2268 MinAlign(Alignment, IncrementSize));
2270 // Build a factor node to remember that this load is independent of the
2272 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
2275 // Move the top bits to the right place.
2276 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
2277 DAG.getConstant(RoundWidth, TLI.getShiftAmountTy()));
2279 // Join the hi and lo parts.
2280 Result = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
2282 // Big endian - avoid unaligned loads.
2283 // EXTLOAD:i24 -> (shl EXTLOAD:i16, 8) | ZEXTLOAD@+2:i8
2284 // Load the top RoundWidth bits.
2285 Hi = DAG.getExtLoad(ExtType, dl, Node->getValueType(0), Tmp1, Tmp2,
2286 LD->getSrcValue(), SVOffset, RoundVT, isVolatile,
2289 // Load the remaining ExtraWidth bits.
2290 IncrementSize = RoundWidth / 8;
2291 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
2292 DAG.getIntPtrConstant(IncrementSize));
2293 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, dl,
2294 Node->getValueType(0), Tmp1, Tmp2,
2295 LD->getSrcValue(), SVOffset + IncrementSize,
2296 ExtraVT, isVolatile,
2297 MinAlign(Alignment, IncrementSize));
2299 // Build a factor node to remember that this load is independent of the
2301 Ch = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
2304 // Move the top bits to the right place.
2305 Hi = DAG.getNode(ISD::SHL, dl, Hi.getValueType(), Hi,
2306 DAG.getConstant(ExtraWidth, TLI.getShiftAmountTy()));
2308 // Join the hi and lo parts.
2309 Result = DAG.getNode(ISD::OR, dl, Node->getValueType(0), Lo, Hi);
2312 Tmp1 = LegalizeOp(Result);
2313 Tmp2 = LegalizeOp(Ch);
2315 switch (TLI.getLoadExtAction(ExtType, SrcVT)) {
2316 default: assert(0 && "This action is not supported yet!");
2317 case TargetLowering::Custom:
2320 case TargetLowering::Legal:
2321 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
2322 Tmp1 = Result.getValue(0);
2323 Tmp2 = Result.getValue(1);
2326 Tmp3 = TLI.LowerOperation(Result, DAG);
2327 if (Tmp3.getNode()) {
2328 Tmp1 = LegalizeOp(Tmp3);
2329 Tmp2 = LegalizeOp(Tmp3.getValue(1));
2332 // If this is an unaligned load and the target doesn't support it,
2334 if (!TLI.allowsUnalignedMemoryAccesses()) {
2335 unsigned ABIAlignment = TLI.getTargetData()->
2336 getABITypeAlignment(LD->getMemoryVT().getTypeForMVT());
2337 if (LD->getAlignment() < ABIAlignment){
2338 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.getNode()), DAG,
2340 Tmp1 = Result.getOperand(0);
2341 Tmp2 = Result.getOperand(1);
2342 Tmp1 = LegalizeOp(Tmp1);
2343 Tmp2 = LegalizeOp(Tmp2);
2348 case TargetLowering::Expand:
2349 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
2350 if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) {
2351 SDValue Load = DAG.getLoad(SrcVT, dl, Tmp1, Tmp2, LD->getSrcValue(),
2352 LD->getSrcValueOffset(),
2353 LD->isVolatile(), LD->getAlignment());
2354 Result = DAG.getNode(ISD::FP_EXTEND, dl,
2355 Node->getValueType(0), Load);
2356 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
2357 Tmp2 = LegalizeOp(Load.getValue(1));
2360 assert(ExtType != ISD::EXTLOAD &&"EXTLOAD should always be supported!");
2361 // Turn the unsupported load into an EXTLOAD followed by an explicit
2362 // zero/sign extend inreg.
2363 Result = DAG.getExtLoad(ISD::EXTLOAD, dl, Node->getValueType(0),
2364 Tmp1, Tmp2, LD->getSrcValue(),
2365 LD->getSrcValueOffset(), SrcVT,
2366 LD->isVolatile(), LD->getAlignment());
2368 if (ExtType == ISD::SEXTLOAD)
2369 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl,
2370 Result.getValueType(),
2371 Result, DAG.getValueType(SrcVT));
2373 ValRes = DAG.getZeroExtendInReg(Result, dl, SrcVT);
2374 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
2375 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
2380 // Since loads produce two values, make sure to remember that we legalized
2382 AddLegalizedOperand(SDValue(Node, 0), Tmp1);
2383 AddLegalizedOperand(SDValue(Node, 1), Tmp2);
2384 return Op.getResNo() ? Tmp2 : Tmp1;
2387 case ISD::EXTRACT_ELEMENT: {
2388 MVT OpTy = Node->getOperand(0).getValueType();
2389 switch (getTypeAction(OpTy)) {
2390 default: assert(0 && "EXTRACT_ELEMENT action for type unimplemented!");
2392 if (cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue()) {
2394 Result = DAG.getNode(ISD::SRL, dl, OpTy, Node->getOperand(0),
2395 DAG.getConstant(OpTy.getSizeInBits()/2,
2396 TLI.getShiftAmountTy()));
2397 Result = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0), Result);
2400 Result = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0),
2401 Node->getOperand(0));
2405 // Get both the low and high parts.
2406 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2407 if (cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue())
2408 Result = Tmp2; // 1 -> Hi
2410 Result = Tmp1; // 0 -> Lo
2416 case ISD::CopyToReg:
2417 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2419 assert(isTypeLegal(Node->getOperand(2).getValueType()) &&
2420 "Register type must be legal!");
2421 // Legalize the incoming value (must be a legal type).
2422 Tmp2 = LegalizeOp(Node->getOperand(2));
2423 if (Node->getNumValues() == 1) {
2424 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2);
2426 assert(Node->getNumValues() == 2 && "Unknown CopyToReg");
2427 if (Node->getNumOperands() == 4) {
2428 Tmp3 = LegalizeOp(Node->getOperand(3));
2429 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2,
2432 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
2435 // Since this produces two values, make sure to remember that we legalized
2437 AddLegalizedOperand(SDValue(Node, 0), Result.getValue(0));
2438 AddLegalizedOperand(SDValue(Node, 1), Result.getValue(1));
2444 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2446 // Ensure that libcalls are emitted before a return.
2447 Tmp1 = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Tmp1, LastCALLSEQ_END);
2448 Tmp1 = LegalizeOp(Tmp1);
2449 LastCALLSEQ_END = DAG.getEntryNode();
2451 switch (Node->getNumOperands()) {
2453 Tmp2 = Node->getOperand(1);
2454 Tmp3 = Node->getOperand(2); // Signness
2455 switch (getTypeAction(Tmp2.getValueType())) {
2457 Result = DAG.UpdateNodeOperands(Result, Tmp1, LegalizeOp(Tmp2), Tmp3);
2460 if (!Tmp2.getValueType().isVector()) {
2462 ExpandOp(Tmp2, Lo, Hi);
2464 // Big endian systems want the hi reg first.
2465 if (TLI.isBigEndian())
2469 Result = DAG.getNode(ISD::RET, dl, MVT::Other,
2470 Tmp1, Lo, Tmp3, Hi, Tmp3);
2472 Result = DAG.getNode(ISD::RET, dl, MVT::Other, Tmp1, Lo, Tmp3);
2473 Result = LegalizeOp(Result);
2475 SDNode *InVal = Tmp2.getNode();
2476 int InIx = Tmp2.getResNo();
2477 unsigned NumElems = InVal->getValueType(InIx).getVectorNumElements();
2478 MVT EVT = InVal->getValueType(InIx).getVectorElementType();
2480 // Figure out if there is a simple type corresponding to this Vector
2481 // type. If so, convert to the vector type.
2482 MVT TVT = MVT::getVectorVT(EVT, NumElems);
2483 if (TLI.isTypeLegal(TVT)) {
2484 // Turn this into a return of the vector type.
2485 Tmp2 = LegalizeOp(Tmp2);
2486 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2487 } else if (NumElems == 1) {
2488 // Turn this into a return of the scalar type.
2489 Tmp2 = ScalarizeVectorOp(Tmp2);
2490 Tmp2 = LegalizeOp(Tmp2);
2491 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2493 // FIXME: Returns of gcc generic vectors smaller than a legal type
2494 // should be returned in integer registers!
2496 // The scalarized value type may not be legal, e.g. it might require
2497 // promotion or expansion. Relegalize the return.
2498 Result = LegalizeOp(Result);
2500 // FIXME: Returns of gcc generic vectors larger than a legal vector
2501 // type should be returned by reference!
2503 SplitVectorOp(Tmp2, Lo, Hi);
2504 Result = DAG.getNode(ISD::RET, dl, MVT::Other,
2505 Tmp1, Lo, Tmp3, Hi, Tmp3);
2506 Result = LegalizeOp(Result);
2511 Tmp2 = PromoteOp(Node->getOperand(1));
2512 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2513 Result = LegalizeOp(Result);
2518 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2520 default: { // ret <values>
2521 SmallVector<SDValue, 8> NewValues;
2522 NewValues.push_back(Tmp1);
2523 for (unsigned i = 1, e = Node->getNumOperands(); i < e; i += 2)
2524 switch (getTypeAction(Node->getOperand(i).getValueType())) {
2526 NewValues.push_back(LegalizeOp(Node->getOperand(i)));
2527 NewValues.push_back(Node->getOperand(i+1));
2531 assert(!Node->getOperand(i).getValueType().isExtended() &&
2532 "FIXME: TODO: implement returning non-legal vector types!");
2533 ExpandOp(Node->getOperand(i), Lo, Hi);
2534 NewValues.push_back(Lo);
2535 NewValues.push_back(Node->getOperand(i+1));
2537 NewValues.push_back(Hi);
2538 NewValues.push_back(Node->getOperand(i+1));
2543 assert(0 && "Can't promote multiple return value yet!");
2546 if (NewValues.size() == Node->getNumOperands())
2547 Result = DAG.UpdateNodeOperands(Result, &NewValues[0],NewValues.size());
2549 Result = DAG.getNode(ISD::RET, dl, MVT::Other,
2550 &NewValues[0], NewValues.size());
2555 if (Result.getOpcode() == ISD::RET) {
2556 switch (TLI.getOperationAction(Result.getOpcode(), MVT::Other)) {
2557 default: assert(0 && "This action is not supported yet!");
2558 case TargetLowering::Legal: break;
2559 case TargetLowering::Custom:
2560 Tmp1 = TLI.LowerOperation(Result, DAG);
2561 if (Tmp1.getNode()) Result = Tmp1;
2567 StoreSDNode *ST = cast<StoreSDNode>(Node);
2568 Tmp1 = LegalizeOp(ST->getChain()); // Legalize the chain.
2569 Tmp2 = LegalizeOp(ST->getBasePtr()); // Legalize the pointer.
2570 int SVOffset = ST->getSrcValueOffset();
2571 unsigned Alignment = ST->getAlignment();
2572 bool isVolatile = ST->isVolatile();
2574 if (!ST->isTruncatingStore()) {
2575 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
2576 // FIXME: We shouldn't do this for TargetConstantFP's.
2577 // FIXME: move this to the DAG Combiner! Note that we can't regress due
2578 // to phase ordering between legalized code and the dag combiner. This
2579 // probably means that we need to integrate dag combiner and legalizer
2581 // We generally can't do this one for long doubles.
2582 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(ST->getValue())) {
2583 if (CFP->getValueType(0) == MVT::f32 &&
2584 getTypeAction(MVT::i32) == Legal) {
2585 Tmp3 = DAG.getConstant(CFP->getValueAPF().
2586 bitcastToAPInt().zextOrTrunc(32),
2588 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2589 SVOffset, isVolatile, Alignment);
2591 } else if (CFP->getValueType(0) == MVT::f64) {
2592 // If this target supports 64-bit registers, do a single 64-bit store.
2593 if (getTypeAction(MVT::i64) == Legal) {
2594 Tmp3 = DAG.getConstant(CFP->getValueAPF().bitcastToAPInt().
2595 zextOrTrunc(64), MVT::i64);
2596 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2597 SVOffset, isVolatile, Alignment);
2599 } else if (getTypeAction(MVT::i32) == Legal && !ST->isVolatile()) {
2600 // Otherwise, if the target supports 32-bit registers, use 2 32-bit
2601 // stores. If the target supports neither 32- nor 64-bits, this
2602 // xform is certainly not worth it.
2603 const APInt &IntVal =CFP->getValueAPF().bitcastToAPInt();
2604 SDValue Lo = DAG.getConstant(APInt(IntVal).trunc(32), MVT::i32);
2605 SDValue Hi = DAG.getConstant(IntVal.lshr(32).trunc(32), MVT::i32);
2606 if (TLI.isBigEndian()) std::swap(Lo, Hi);
2608 Lo = DAG.getStore(Tmp1, dl, Lo, Tmp2, ST->getSrcValue(),
2609 SVOffset, isVolatile, Alignment);
2610 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
2611 DAG.getIntPtrConstant(4));
2612 Hi = DAG.getStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(), SVOffset+4,
2613 isVolatile, MinAlign(Alignment, 4U));
2615 Result = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2621 switch (getTypeAction(ST->getMemoryVT())) {
2623 Tmp3 = LegalizeOp(ST->getValue());
2624 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
2627 MVT VT = Tmp3.getValueType();
2628 switch (TLI.getOperationAction(ISD::STORE, VT)) {
2629 default: assert(0 && "This action is not supported yet!");
2630 case TargetLowering::Legal:
2631 // If this is an unaligned store and the target doesn't support it,
2633 if (!TLI.allowsUnalignedMemoryAccesses()) {
2634 unsigned ABIAlignment = TLI.getTargetData()->
2635 getABITypeAlignment(ST->getMemoryVT().getTypeForMVT());
2636 if (ST->getAlignment() < ABIAlignment)
2637 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.getNode()), DAG,
2641 case TargetLowering::Custom:
2642 Tmp1 = TLI.LowerOperation(Result, DAG);
2643 if (Tmp1.getNode()) Result = Tmp1;
2645 case TargetLowering::Promote:
2646 assert(VT.isVector() && "Unknown legal promote case!");
2647 Tmp3 = DAG.getNode(ISD::BIT_CONVERT, dl,
2648 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
2649 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2,
2650 ST->getSrcValue(), SVOffset, isVolatile,
2657 if (!ST->getMemoryVT().isVector()) {
2658 // Truncate the value and store the result.
2659 Tmp3 = PromoteOp(ST->getValue());
2660 Result = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2661 SVOffset, ST->getMemoryVT(),
2662 isVolatile, Alignment);
2665 // Fall thru to expand for vector
2667 unsigned IncrementSize = 0;
2670 // If this is a vector type, then we have to calculate the increment as
2671 // the product of the element size in bytes, and the number of elements
2672 // in the high half of the vector.
2673 if (ST->getValue().getValueType().isVector()) {
2674 SDNode *InVal = ST->getValue().getNode();
2675 int InIx = ST->getValue().getResNo();
2676 MVT InVT = InVal->getValueType(InIx);
2677 unsigned NumElems = InVT.getVectorNumElements();
2678 MVT EVT = InVT.getVectorElementType();
2680 // Figure out if there is a simple type corresponding to this Vector
2681 // type. If so, convert to the vector type.
2682 MVT TVT = MVT::getVectorVT(EVT, NumElems);
2683 if (TLI.isTypeLegal(TVT)) {
2684 // Turn this into a normal store of the vector type.
2685 Tmp3 = LegalizeOp(ST->getValue());
2686 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2687 SVOffset, isVolatile, Alignment);
2688 Result = LegalizeOp(Result);
2690 } else if (NumElems == 1) {
2691 // Turn this into a normal store of the scalar type.
2692 Tmp3 = ScalarizeVectorOp(ST->getValue());
2693 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2694 SVOffset, isVolatile, Alignment);
2695 // The scalarized value type may not be legal, e.g. it might require
2696 // promotion or expansion. Relegalize the scalar store.
2697 Result = LegalizeOp(Result);
2700 // Check if we have widen this node with another value
2701 std::map<SDValue, SDValue>::iterator I =
2702 WidenNodes.find(ST->getValue());
2703 if (I != WidenNodes.end()) {
2704 Result = StoreWidenVectorOp(ST, Tmp1, Tmp2);
2708 SplitVectorOp(ST->getValue(), Lo, Hi);
2709 IncrementSize = Lo.getNode()->getValueType(0).getVectorNumElements() *
2710 EVT.getSizeInBits()/8;
2714 ExpandOp(ST->getValue(), Lo, Hi);
2715 IncrementSize = Hi.getNode() ? Hi.getValueType().getSizeInBits()/8 : 0;
2717 if (Hi.getNode() && TLI.isBigEndian())
2721 Lo = DAG.getStore(Tmp1, dl, Lo, Tmp2, ST->getSrcValue(),
2722 SVOffset, isVolatile, Alignment);
2724 if (Hi.getNode() == NULL) {
2725 // Must be int <-> float one-to-one expansion.
2730 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
2731 DAG.getIntPtrConstant(IncrementSize));
2732 assert(isTypeLegal(Tmp2.getValueType()) &&
2733 "Pointers must be legal!");
2734 SVOffset += IncrementSize;
2735 Alignment = MinAlign(Alignment, IncrementSize);
2736 Hi = DAG.getStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(),
2737 SVOffset, isVolatile, Alignment);
2738 Result = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2743 switch (getTypeAction(ST->getValue().getValueType())) {
2745 Tmp3 = LegalizeOp(ST->getValue());
2748 if (!ST->getValue().getValueType().isVector()) {
2749 // We can promote the value, the truncstore will still take care of it.
2750 Tmp3 = PromoteOp(ST->getValue());
2753 // Vector case falls through to expand
2755 // Just store the low part. This may become a non-trunc store, so make
2756 // sure to use getTruncStore, not UpdateNodeOperands below.
2757 ExpandOp(ST->getValue(), Tmp3, Tmp4);
2758 return DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2759 SVOffset, MVT::i8, isVolatile, Alignment);
2762 MVT StVT = ST->getMemoryVT();
2763 unsigned StWidth = StVT.getSizeInBits();
2765 if (StWidth != StVT.getStoreSizeInBits()) {
2766 // Promote to a byte-sized store with upper bits zero if not
2767 // storing an integral number of bytes. For example, promote
2768 // TRUNCSTORE:i1 X -> TRUNCSTORE:i8 (and X, 1)
2769 MVT NVT = MVT::getIntegerVT(StVT.getStoreSizeInBits());
2770 Tmp3 = DAG.getZeroExtendInReg(Tmp3, dl, StVT);
2771 Result = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2772 SVOffset, NVT, isVolatile, Alignment);
2773 } else if (StWidth & (StWidth - 1)) {
2774 // If not storing a power-of-2 number of bits, expand as two stores.
2775 assert(StVT.isExtended() && !StVT.isVector() &&
2776 "Unsupported truncstore!");
2777 unsigned RoundWidth = 1 << Log2_32(StWidth);
2778 assert(RoundWidth < StWidth);
2779 unsigned ExtraWidth = StWidth - RoundWidth;
2780 assert(ExtraWidth < RoundWidth);
2781 assert(!(RoundWidth % 8) && !(ExtraWidth % 8) &&
2782 "Store size not an integral number of bytes!");
2783 MVT RoundVT = MVT::getIntegerVT(RoundWidth);
2784 MVT ExtraVT = MVT::getIntegerVT(ExtraWidth);
2786 unsigned IncrementSize;
2788 if (TLI.isLittleEndian()) {
2789 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 X, TRUNCSTORE@+2:i8 (srl X, 16)
2790 // Store the bottom RoundWidth bits.
2791 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2793 isVolatile, Alignment);
2795 // Store the remaining ExtraWidth bits.
2796 IncrementSize = RoundWidth / 8;
2797 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
2798 DAG.getIntPtrConstant(IncrementSize));
2799 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
2800 DAG.getConstant(RoundWidth, TLI.getShiftAmountTy()));
2801 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(),
2802 SVOffset + IncrementSize, ExtraVT, isVolatile,
2803 MinAlign(Alignment, IncrementSize));
2805 // Big endian - avoid unaligned stores.
2806 // TRUNCSTORE:i24 X -> TRUNCSTORE:i16 (srl X, 8), TRUNCSTORE@+2:i8 X
2807 // Store the top RoundWidth bits.
2808 Hi = DAG.getNode(ISD::SRL, dl, Tmp3.getValueType(), Tmp3,
2809 DAG.getConstant(ExtraWidth, TLI.getShiftAmountTy()));
2810 Hi = DAG.getTruncStore(Tmp1, dl, Hi, Tmp2, ST->getSrcValue(),
2811 SVOffset, RoundVT, isVolatile, Alignment);
2813 // Store the remaining ExtraWidth bits.
2814 IncrementSize = RoundWidth / 8;
2815 Tmp2 = DAG.getNode(ISD::ADD, dl, Tmp2.getValueType(), Tmp2,
2816 DAG.getIntPtrConstant(IncrementSize));
2817 Lo = DAG.getTruncStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2818 SVOffset + IncrementSize, ExtraVT, isVolatile,
2819 MinAlign(Alignment, IncrementSize));
2822 // The order of the stores doesn't matter.
2823 Result = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo, Hi);
2825 if (Tmp1 != ST->getChain() || Tmp3 != ST->getValue() ||
2826 Tmp2 != ST->getBasePtr())
2827 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
2830 switch (TLI.getTruncStoreAction(ST->getValue().getValueType(), StVT)) {
2831 default: assert(0 && "This action is not supported yet!");
2832 case TargetLowering::Legal:
2833 // If this is an unaligned store and the target doesn't support it,
2835 if (!TLI.allowsUnalignedMemoryAccesses()) {
2836 unsigned ABIAlignment = TLI.getTargetData()->
2837 getABITypeAlignment(ST->getMemoryVT().getTypeForMVT());
2838 if (ST->getAlignment() < ABIAlignment)
2839 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.getNode()), DAG,
2843 case TargetLowering::Custom:
2844 Result = TLI.LowerOperation(Result, DAG);
2847 // TRUNCSTORE:i16 i32 -> STORE i16
2848 assert(isTypeLegal(StVT) && "Do not know how to expand this store!");
2849 Tmp3 = DAG.getNode(ISD::TRUNCATE, dl, StVT, Tmp3);
2850 Result = DAG.getStore(Tmp1, dl, Tmp3, Tmp2, ST->getSrcValue(),
2851 SVOffset, isVolatile, Alignment);
2859 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2860 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
2862 case ISD::STACKSAVE:
2863 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2864 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2865 Tmp1 = Result.getValue(0);
2866 Tmp2 = Result.getValue(1);
2868 switch (TLI.getOperationAction(ISD::STACKSAVE, MVT::Other)) {
2869 default: assert(0 && "This action is not supported yet!");
2870 case TargetLowering::Legal: break;
2871 case TargetLowering::Custom:
2872 Tmp3 = TLI.LowerOperation(Result, DAG);
2873 if (Tmp3.getNode()) {
2874 Tmp1 = LegalizeOp(Tmp3);
2875 Tmp2 = LegalizeOp(Tmp3.getValue(1));
2878 case TargetLowering::Expand:
2879 // Expand to CopyFromReg if the target set
2880 // StackPointerRegisterToSaveRestore.
2881 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2882 Tmp1 = DAG.getCopyFromReg(Result.getOperand(0), dl, SP,
2883 Node->getValueType(0));
2884 Tmp2 = Tmp1.getValue(1);
2886 Tmp1 = DAG.getUNDEF(Node->getValueType(0));
2887 Tmp2 = Node->getOperand(0);
2892 // Since stacksave produce two values, make sure to remember that we
2893 // legalized both of them.
2894 AddLegalizedOperand(SDValue(Node, 0), Tmp1);
2895 AddLegalizedOperand(SDValue(Node, 1), Tmp2);
2896 return Op.getResNo() ? Tmp2 : Tmp1;
2898 case ISD::STACKRESTORE:
2899 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2900 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2901 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2903 switch (TLI.getOperationAction(ISD::STACKRESTORE, MVT::Other)) {
2904 default: assert(0 && "This action is not supported yet!");
2905 case TargetLowering::Legal: break;
2906 case TargetLowering::Custom:
2907 Tmp1 = TLI.LowerOperation(Result, DAG);
2908 if (Tmp1.getNode()) Result = Tmp1;
2910 case TargetLowering::Expand:
2911 // Expand to CopyToReg if the target set
2912 // StackPointerRegisterToSaveRestore.
2913 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2914 Result = DAG.getCopyToReg(Tmp1, dl, SP, Tmp2);
2922 case ISD::READCYCLECOUNTER:
2923 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain
2924 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2925 switch (TLI.getOperationAction(ISD::READCYCLECOUNTER,
2926 Node->getValueType(0))) {
2927 default: assert(0 && "This action is not supported yet!");
2928 case TargetLowering::Legal:
2929 Tmp1 = Result.getValue(0);
2930 Tmp2 = Result.getValue(1);
2932 case TargetLowering::Custom:
2933 Result = TLI.LowerOperation(Result, DAG);
2934 Tmp1 = LegalizeOp(Result.getValue(0));
2935 Tmp2 = LegalizeOp(Result.getValue(1));
2939 // Since rdcc produce two values, make sure to remember that we legalized
2941 AddLegalizedOperand(SDValue(Node, 0), Tmp1);
2942 AddLegalizedOperand(SDValue(Node, 1), Tmp2);
2946 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2947 case Expand: assert(0 && "It's impossible to expand bools");
2949 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition.
2952 assert(!Node->getOperand(0).getValueType().isVector() && "not possible");
2953 Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition.
2954 // Make sure the condition is either zero or one.
2955 unsigned BitWidth = Tmp1.getValueSizeInBits();
2956 if (!DAG.MaskedValueIsZero(Tmp1,
2957 APInt::getHighBitsSet(BitWidth, BitWidth-1)))
2958 Tmp1 = DAG.getZeroExtendInReg(Tmp1, dl, MVT::i1);
2962 Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal
2963 Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal
2965 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2967 switch (TLI.getOperationAction(ISD::SELECT, Tmp2.getValueType())) {
2968 default: assert(0 && "This action is not supported yet!");
2969 case TargetLowering::Legal: break;
2970 case TargetLowering::Custom: {
2971 Tmp1 = TLI.LowerOperation(Result, DAG);
2972 if (Tmp1.getNode()) Result = Tmp1;
2975 case TargetLowering::Expand:
2976 if (Tmp1.getOpcode() == ISD::SETCC) {
2977 Result = DAG.getSelectCC(dl, Tmp1.getOperand(0), Tmp1.getOperand(1),
2979 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
2981 Result = DAG.getSelectCC(dl, Tmp1,
2982 DAG.getConstant(0, Tmp1.getValueType()),
2983 Tmp2, Tmp3, ISD::SETNE);
2986 case TargetLowering::Promote: {
2988 TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType());
2989 unsigned ExtOp, TruncOp;
2990 if (Tmp2.getValueType().isVector()) {
2991 ExtOp = ISD::BIT_CONVERT;
2992 TruncOp = ISD::BIT_CONVERT;
2993 } else if (Tmp2.getValueType().isInteger()) {
2994 ExtOp = ISD::ANY_EXTEND;
2995 TruncOp = ISD::TRUNCATE;
2997 ExtOp = ISD::FP_EXTEND;
2998 TruncOp = ISD::FP_ROUND;
3000 // Promote each of the values to the new type.
3001 Tmp2 = DAG.getNode(ExtOp, dl, NVT, Tmp2);
3002 Tmp3 = DAG.getNode(ExtOp, dl, NVT, Tmp3);
3003 // Perform the larger operation, then round down.
3004 Result = DAG.getNode(ISD::SELECT, dl, NVT, Tmp1, Tmp2, Tmp3);
3005 if (TruncOp != ISD::FP_ROUND)
3006 Result = DAG.getNode(TruncOp, dl, Node->getValueType(0), Result);
3008 Result = DAG.getNode(TruncOp, dl, Node->getValueType(0), Result,
3009 DAG.getIntPtrConstant(0));
3014 case ISD::SELECT_CC: {
3015 Tmp1 = Node->getOperand(0); // LHS
3016 Tmp2 = Node->getOperand(1); // RHS
3017 Tmp3 = LegalizeOp(Node->getOperand(2)); // True
3018 Tmp4 = LegalizeOp(Node->getOperand(3)); // False
3019 SDValue CC = Node->getOperand(4);
3021 LegalizeSetCC(TLI.getSetCCResultType(Tmp1.getValueType()),
3022 Tmp1, Tmp2, CC, dl);
3024 // If we didn't get both a LHS and RHS back from LegalizeSetCC,
3025 // the LHS is a legal SETCC itself. In this case, we need to compare
3026 // the result against zero to select between true and false values.
3027 if (Tmp2.getNode() == 0) {
3028 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
3029 CC = DAG.getCondCode(ISD::SETNE);
3031 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, CC);
3033 // Everything is legal, see if we should expand this op or something.
3034 switch (TLI.getOperationAction(ISD::SELECT_CC, Tmp3.getValueType())) {
3035 default: assert(0 && "This action is not supported yet!");
3036 case TargetLowering::Legal: break;
3037 case TargetLowering::Custom:
3038 Tmp1 = TLI.LowerOperation(Result, DAG);
3039 if (Tmp1.getNode()) Result = Tmp1;
3045 Tmp1 = Node->getOperand(0);
3046 Tmp2 = Node->getOperand(1);
3047 Tmp3 = Node->getOperand(2);
3048 LegalizeSetCC(Node->getValueType(0), Tmp1, Tmp2, Tmp3, dl);
3050 // If we had to Expand the SetCC operands into a SELECT node, then it may
3051 // not always be possible to return a true LHS & RHS. In this case, just
3052 // return the value we legalized, returned in the LHS
3053 if (Tmp2.getNode() == 0) {
3058 switch (TLI.getOperationAction(ISD::SETCC, Tmp1.getValueType())) {
3059 default: assert(0 && "Cannot handle this action for SETCC yet!");
3060 case TargetLowering::Custom:
3063 case TargetLowering::Legal:
3064 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
3066 Tmp4 = TLI.LowerOperation(Result, DAG);
3067 if (Tmp4.getNode()) Result = Tmp4;
3070 case TargetLowering::Promote: {
3071 // First step, figure out the appropriate operation to use.
3072 // Allow SETCC to not be supported for all legal data types
3073 // Mostly this targets FP
3074 MVT NewInTy = Node->getOperand(0).getValueType();
3075 MVT OldVT = NewInTy; OldVT = OldVT;
3077 // Scan for the appropriate larger type to use.
3079 NewInTy = (MVT::SimpleValueType)(NewInTy.getSimpleVT()+1);
3081 assert(NewInTy.isInteger() == OldVT.isInteger() &&
3082 "Fell off of the edge of the integer world");
3083 assert(NewInTy.isFloatingPoint() == OldVT.isFloatingPoint() &&
3084 "Fell off of the edge of the floating point world");
3086 // If the target supports SETCC of this type, use it.
3087 if (TLI.isOperationLegalOrCustom(ISD::SETCC, NewInTy))
3090 if (NewInTy.isInteger())
3091 assert(0 && "Cannot promote Legal Integer SETCC yet");
3093 Tmp1 = DAG.getNode(ISD::FP_EXTEND, dl, NewInTy, Tmp1);
3094 Tmp2 = DAG.getNode(ISD::FP_EXTEND, dl, NewInTy, Tmp2);
3096 Tmp1 = LegalizeOp(Tmp1);
3097 Tmp2 = LegalizeOp(Tmp2);
3098 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
3099 Result = LegalizeOp(Result);
3102 case TargetLowering::Expand:
3103 // Expand a setcc node into a select_cc of the same condition, lhs, and
3104 // rhs that selects between const 1 (true) and const 0 (false).
3105 MVT VT = Node->getValueType(0);
3106 Result = DAG.getNode(ISD::SELECT_CC, dl, VT, Tmp1, Tmp2,
3107 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
3113 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
3114 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
3115 SDValue CC = Node->getOperand(2);
3117 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, CC);
3119 // Everything is legal, see if we should expand this op or something.
3120 switch (TLI.getOperationAction(ISD::VSETCC, Tmp1.getValueType())) {
3121 default: assert(0 && "This action is not supported yet!");
3122 case TargetLowering::Legal: break;
3123 case TargetLowering::Custom:
3124 Tmp1 = TLI.LowerOperation(Result, DAG);
3125 if (Tmp1.getNode()) Result = Tmp1;
3127 case TargetLowering::Expand: {
3128 // Unroll into a nasty set of scalar code for now.
3129 MVT VT = Node->getValueType(0);
3130 unsigned NumElems = VT.getVectorNumElements();
3131 MVT EltVT = VT.getVectorElementType();
3132 MVT TmpEltVT = Tmp1.getValueType().getVectorElementType();
3133 SmallVector<SDValue, 8> Ops(NumElems);
3134 for (unsigned i = 0; i < NumElems; ++i) {
3135 SDValue In1 = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, TmpEltVT,
3136 Tmp1, DAG.getIntPtrConstant(i));
3137 Ops[i] = DAG.getNode(ISD::SETCC, dl, TLI.getSetCCResultType(TmpEltVT),
3138 In1, DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl,
3140 DAG.getIntPtrConstant(i)),
3142 Ops[i] = DAG.getNode(ISD::SELECT, dl, EltVT, Ops[i],
3143 DAG.getConstant(APInt::getAllOnesValue
3144 (EltVT.getSizeInBits()), EltVT),
3145 DAG.getConstant(0, EltVT));
3147 Result = DAG.getNode(ISD::BUILD_VECTOR, dl, VT, &Ops[0], NumElems);
3154 case ISD::SHL_PARTS:
3155 case ISD::SRA_PARTS:
3156 case ISD::SRL_PARTS: {
3157 SmallVector<SDValue, 8> Ops;
3158 bool Changed = false;
3159 unsigned N = Node->getNumOperands();
3160 for (unsigned i = 0; i + 1 < N; ++i) {
3161 Ops.push_back(LegalizeOp(Node->getOperand(i)));
3162 Changed |= Ops.back() != Node->getOperand(i);
3164 Ops.push_back(LegalizeOp(DAG.getShiftAmountOperand(Node->getOperand(N-1))));
3165 Changed |= Ops.back() != Node->getOperand(N-1);
3167 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
3169 switch (TLI.getOperationAction(Node->getOpcode(),
3170 Node->getValueType(0))) {
3171 default: assert(0 && "This action is not supported yet!");
3172 case TargetLowering::Legal: break;
3173 case TargetLowering::Custom:
3174 Tmp1 = TLI.LowerOperation(Result, DAG);
3175 if (Tmp1.getNode()) {
3176 SDValue Tmp2, RetVal(0, 0);
3177 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
3178 Tmp2 = LegalizeOp(Tmp1.getValue(i));
3179 AddLegalizedOperand(SDValue(Node, i), Tmp2);
3180 if (i == Op.getResNo())
3183 assert(RetVal.getNode() && "Illegal result number");
3189 // Since these produce multiple values, make sure to remember that we
3190 // legalized all of them.
3191 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
3192 AddLegalizedOperand(SDValue(Node, i), Result.getValue(i));
3193 return Result.getValue(Op.getResNo());
3215 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
3216 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
3218 if ((Node->getOpcode() == ISD::SHL ||
3219 Node->getOpcode() == ISD::SRL ||
3220 Node->getOpcode() == ISD::SRA) &&
3221 !Node->getValueType(0).isVector())
3222 Tmp2 = DAG.getShiftAmountOperand(Tmp2);
3224 switch (getTypeAction(Tmp2.getValueType())) {
3225 case Expand: assert(0 && "Not possible");
3227 Tmp2 = LegalizeOp(Tmp2); // Legalize the RHS.
3230 Tmp2 = PromoteOp(Tmp2); // Promote the RHS.
3234 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
3236 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3237 default: assert(0 && "BinOp legalize operation not supported");
3238 case TargetLowering::Legal: break;
3239 case TargetLowering::Custom:
3240 Tmp1 = TLI.LowerOperation(Result, DAG);
3241 if (Tmp1.getNode()) {
3245 // Fall through if the custom lower can't deal with the operation
3246 case TargetLowering::Expand: {
3247 MVT VT = Op.getValueType();
3249 // See if multiply or divide can be lowered using two-result operations.
3250 SDVTList VTs = DAG.getVTList(VT, VT);
3251 if (Node->getOpcode() == ISD::MUL) {
3252 // We just need the low half of the multiply; try both the signed
3253 // and unsigned forms. If the target supports both SMUL_LOHI and
3254 // UMUL_LOHI, form a preference by checking which forms of plain
3255 // MULH it supports.
3256 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, VT);
3257 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, VT);
3258 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, VT);
3259 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, VT);
3260 unsigned OpToUse = 0;
3261 if (HasSMUL_LOHI && !HasMULHS) {
3262 OpToUse = ISD::SMUL_LOHI;
3263 } else if (HasUMUL_LOHI && !HasMULHU) {
3264 OpToUse = ISD::UMUL_LOHI;
3265 } else if (HasSMUL_LOHI) {
3266 OpToUse = ISD::SMUL_LOHI;
3267 } else if (HasUMUL_LOHI) {
3268 OpToUse = ISD::UMUL_LOHI;
3271 Result = DAG.getNode(OpToUse, dl, VTs, Tmp1, Tmp2);
3275 if (Node->getOpcode() == ISD::MULHS &&
3276 TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, VT)) {
3277 Result = SDValue(DAG.getNode(ISD::SMUL_LOHI, dl,
3278 VTs, Tmp1, Tmp2).getNode(),
3282 if (Node->getOpcode() == ISD::MULHU &&
3283 TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, VT)) {
3284 Result = SDValue(DAG.getNode(ISD::UMUL_LOHI, dl,
3285 VTs, Tmp1, Tmp2).getNode(),
3289 if (Node->getOpcode() == ISD::SDIV &&
3290 TLI.isOperationLegalOrCustom(ISD::SDIVREM, VT)) {
3291 Result = DAG.getNode(ISD::SDIVREM, dl, VTs, Tmp1, Tmp2);
3294 if (Node->getOpcode() == ISD::UDIV &&
3295 TLI.isOperationLegalOrCustom(ISD::UDIVREM, VT)) {
3296 Result = DAG.getNode(ISD::UDIVREM, dl, VTs, Tmp1, Tmp2);
3299 if (Node->getOpcode() == ISD::SUB &&
3300 TLI.isOperationLegalOrCustom(ISD::ADD, VT) &&
3301 TLI.isOperationLegalOrCustom(ISD::XOR, VT)) {
3302 Tmp2 = DAG.getNode(ISD::XOR, dl, VT, Tmp2,
3303 DAG.getConstant(APInt::getAllOnesValue(VT.getSizeInBits()), VT));
3304 Tmp2 = DAG.getNode(ISD::ADD, dl, VT, Tmp2, DAG.getConstant(1, VT));
3305 Result = DAG.getNode(ISD::ADD, dl, VT, Tmp1, Tmp2);
3309 // Check to see if we have a libcall for this operator.
3310 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
3311 bool isSigned = false;
3312 switch (Node->getOpcode()) {
3315 isSigned = Node->getOpcode() == ISD::SDIV;
3317 LC = (isSigned ? RTLIB::SDIV_I16 : RTLIB::UDIV_I16);
3318 else if (VT == MVT::i32)
3319 LC = (isSigned ? RTLIB::SDIV_I32 : RTLIB::UDIV_I32);
3320 else if (VT == MVT::i64)
3321 LC = (isSigned ? RTLIB::SDIV_I64 : RTLIB::UDIV_I64);
3322 else if (VT == MVT::i128)
3323 LC = (isSigned ? RTLIB::SDIV_I128 : RTLIB::UDIV_I128);
3327 LC = RTLIB::MUL_I16;
3328 else if (VT == MVT::i32)
3329 LC = RTLIB::MUL_I32;
3330 else if (VT == MVT::i64)
3331 LC = RTLIB::MUL_I64;
3332 else if (VT == MVT::i128)
3333 LC = RTLIB::MUL_I128;
3336 LC = GetFPLibCall(VT, RTLIB::POW_F32, RTLIB::POW_F64, RTLIB::POW_F80,
3337 RTLIB::POW_PPCF128);
3340 LC = GetFPLibCall(VT, RTLIB::DIV_F32, RTLIB::DIV_F64, RTLIB::DIV_F80,
3341 RTLIB::DIV_PPCF128);
3345 if (LC != RTLIB::UNKNOWN_LIBCALL) {
3347 Result = ExpandLibCall(LC, Node, isSigned, Dummy);
3351 assert(Node->getValueType(0).isVector() &&
3352 "Cannot expand this binary operator!");
3353 // Expand the operation into a bunch of nasty scalar code.
3354 Result = LegalizeOp(UnrollVectorOp(Op));
3357 case TargetLowering::Promote: {
3358 switch (Node->getOpcode()) {
3359 default: assert(0 && "Do not know how to promote this BinOp!");
3363 MVT OVT = Node->getValueType(0);
3364 MVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
3365 assert(OVT.isVector() && "Cannot promote this BinOp!");
3366 // Bit convert each of the values to the new type.
3367 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Tmp1);
3368 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Tmp2);
3369 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
3370 // Bit convert the result back the original type.
3371 Result = DAG.getNode(ISD::BIT_CONVERT, dl, OVT, Result);
3379 case ISD::SMUL_LOHI:
3380 case ISD::UMUL_LOHI:
3383 // These nodes will only be produced by target-specific lowering, so
3384 // they shouldn't be here if they aren't legal.
3385 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
3386 "This must be legal!");
3388 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
3389 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
3390 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
3393 case ISD::FCOPYSIGN: // FCOPYSIGN does not require LHS/RHS to match type!
3394 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
3395 switch (getTypeAction(Node->getOperand(1).getValueType())) {
3396 case Expand: assert(0 && "Not possible");
3398 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
3401 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
3405 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
3407 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3408 default: assert(0 && "Operation not supported");
3409 case TargetLowering::Custom:
3410 Tmp1 = TLI.LowerOperation(Result, DAG);
3411 if (Tmp1.getNode()) Result = Tmp1;
3413 case TargetLowering::Legal: break;
3414 case TargetLowering::Expand: {
3415 // If this target supports fabs/fneg natively and select is cheap,
3416 // do this efficiently.
3417 if (!TLI.isSelectExpensive() &&
3418 TLI.getOperationAction(ISD::FABS, Tmp1.getValueType()) ==
3419 TargetLowering::Legal &&
3420 TLI.getOperationAction(ISD::FNEG, Tmp1.getValueType()) ==
3421 TargetLowering::Legal) {
3422 // Get the sign bit of the RHS.
3424 Tmp2.getValueType() == MVT::f32 ? MVT::i32 : MVT::i64;
3425 SDValue SignBit = DAG.getNode(ISD::BIT_CONVERT, dl, IVT, Tmp2);
3426 SignBit = DAG.getSetCC(dl, TLI.getSetCCResultType(IVT),
3427 SignBit, DAG.getConstant(0, IVT), ISD::SETLT);
3428 // Get the absolute value of the result.
3429 SDValue AbsVal = DAG.getNode(ISD::FABS, dl, Tmp1.getValueType(), Tmp1);
3430 // Select between the nabs and abs value based on the sign bit of
3432 Result = DAG.getNode(ISD::SELECT, dl, AbsVal.getValueType(), SignBit,
3433 DAG.getNode(ISD::FNEG, dl, AbsVal.getValueType(),
3436 Result = LegalizeOp(Result);
3440 // Otherwise, do bitwise ops!
3442 Node->getValueType(0) == MVT::f32 ? MVT::i32 : MVT::i64;
3443 Result = ExpandFCOPYSIGNToBitwiseOps(Node, NVT, DAG, TLI);
3444 Result = DAG.getNode(ISD::BIT_CONVERT, dl, Node->getValueType(0), Result);
3445 Result = LegalizeOp(Result);
3453 Tmp1 = LegalizeOp(Node->getOperand(0));
3454 Tmp2 = LegalizeOp(Node->getOperand(1));
3455 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
3456 Tmp3 = Result.getValue(0);
3457 Tmp4 = Result.getValue(1);
3459 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3460 default: assert(0 && "This action is not supported yet!");
3461 case TargetLowering::Legal:
3463 case TargetLowering::Custom:
3464 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
3465 if (Tmp1.getNode() != NULL) {
3466 Tmp3 = LegalizeOp(Tmp1);
3467 Tmp4 = LegalizeOp(Tmp1.getValue(1));
3471 // Since this produces two values, make sure to remember that we legalized
3473 AddLegalizedOperand(SDValue(Node, 0), Tmp3);
3474 AddLegalizedOperand(SDValue(Node, 1), Tmp4);
3475 return Op.getResNo() ? Tmp4 : Tmp3;
3479 Tmp1 = LegalizeOp(Node->getOperand(0));
3480 Tmp2 = LegalizeOp(Node->getOperand(1));
3481 Tmp3 = LegalizeOp(Node->getOperand(2));
3482 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
3483 Tmp3 = Result.getValue(0);
3484 Tmp4 = Result.getValue(1);
3486 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3487 default: assert(0 && "This action is not supported yet!");
3488 case TargetLowering::Legal:
3490 case TargetLowering::Custom:
3491 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
3492 if (Tmp1.getNode() != NULL) {
3493 Tmp3 = LegalizeOp(Tmp1);
3494 Tmp4 = LegalizeOp(Tmp1.getValue(1));
3498 // Since this produces two values, make sure to remember that we legalized
3500 AddLegalizedOperand(SDValue(Node, 0), Tmp3);
3501 AddLegalizedOperand(SDValue(Node, 1), Tmp4);
3502 return Op.getResNo() ? Tmp4 : Tmp3;
3504 case ISD::BUILD_PAIR: {
3505 MVT PairTy = Node->getValueType(0);
3506 // TODO: handle the case where the Lo and Hi operands are not of legal type
3507 Tmp1 = LegalizeOp(Node->getOperand(0)); // Lo
3508 Tmp2 = LegalizeOp(Node->getOperand(1)); // Hi
3509 switch (TLI.getOperationAction(ISD::BUILD_PAIR, PairTy)) {
3510 case TargetLowering::Promote:
3511 case TargetLowering::Custom:
3512 assert(0 && "Cannot promote/custom this yet!");
3513 case TargetLowering::Legal:
3514 if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1))
3515 Result = DAG.getNode(ISD::BUILD_PAIR, dl, PairTy, Tmp1, Tmp2);
3517 case TargetLowering::Expand:
3518 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, PairTy, Tmp1);
3519 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, dl, PairTy, Tmp2);
3520 Tmp2 = DAG.getNode(ISD::SHL, dl, PairTy, Tmp2,
3521 DAG.getConstant(PairTy.getSizeInBits()/2,
3522 TLI.getShiftAmountTy()));
3523 Result = DAG.getNode(ISD::OR, dl, PairTy, Tmp1, Tmp2);
3532 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
3533 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
3535 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3536 case TargetLowering::Promote: assert(0 && "Cannot promote this yet!");
3537 case TargetLowering::Custom:
3540 case TargetLowering::Legal:
3541 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
3543 Tmp1 = TLI.LowerOperation(Result, DAG);
3544 if (Tmp1.getNode()) Result = Tmp1;
3547 case TargetLowering::Expand: {
3548 unsigned DivOpc= (Node->getOpcode() == ISD::UREM) ? ISD::UDIV : ISD::SDIV;
3549 bool isSigned = DivOpc == ISD::SDIV;
3550 MVT VT = Node->getValueType(0);
3552 // See if remainder can be lowered using two-result operations.
3553 SDVTList VTs = DAG.getVTList(VT, VT);
3554 if (Node->getOpcode() == ISD::SREM &&
3555 TLI.isOperationLegalOrCustom(ISD::SDIVREM, VT)) {
3556 Result = SDValue(DAG.getNode(ISD::SDIVREM, dl,
3557 VTs, Tmp1, Tmp2).getNode(), 1);
3560 if (Node->getOpcode() == ISD::UREM &&
3561 TLI.isOperationLegalOrCustom(ISD::UDIVREM, VT)) {
3562 Result = SDValue(DAG.getNode(ISD::UDIVREM, dl,
3563 VTs, Tmp1, Tmp2).getNode(), 1);
3567 if (VT.isInteger() &&
3568 TLI.getOperationAction(DivOpc, VT) == TargetLowering::Legal) {
3570 Result = DAG.getNode(DivOpc, dl, VT, Tmp1, Tmp2);
3571 Result = DAG.getNode(ISD::MUL, dl, VT, Result, Tmp2);
3572 Result = DAG.getNode(ISD::SUB, dl, VT, Tmp1, Result);
3576 // Check to see if we have a libcall for this operator.
3577 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
3578 switch (Node->getOpcode()) {
3583 LC = (isSigned ? RTLIB::SREM_I16 : RTLIB::UREM_I16);
3584 else if (VT == MVT::i32)
3585 LC = (isSigned ? RTLIB::SREM_I32 : RTLIB::UREM_I32);
3586 else if (VT == MVT::i64)
3587 LC = (isSigned ? RTLIB::SREM_I64 : RTLIB::UREM_I64);
3588 else if (VT == MVT::i128)
3589 LC = (isSigned ? RTLIB::SREM_I128 : RTLIB::UREM_I128);
3592 // Floating point mod -> fmod libcall.
3593 LC = GetFPLibCall(VT, RTLIB::REM_F32, RTLIB::REM_F64,
3594 RTLIB::REM_F80, RTLIB::REM_PPCF128);
3598 if (LC != RTLIB::UNKNOWN_LIBCALL) {
3600 Result = ExpandLibCall(LC, Node, isSigned, Dummy);
3604 assert(VT.isVector() &&
3605 "Cannot expand this binary operator!");
3606 // Expand the operation into a bunch of nasty scalar code.
3607 Result = LegalizeOp(UnrollVectorOp(Op));
3613 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
3614 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
3616 MVT VT = Node->getValueType(0);
3617 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
3618 default: assert(0 && "This action is not supported yet!");
3619 case TargetLowering::Custom:
3622 case TargetLowering::Legal:
3623 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
3624 Result = Result.getValue(0);
3625 Tmp1 = Result.getValue(1);
3628 Tmp2 = TLI.LowerOperation(Result, DAG);
3629 if (Tmp2.getNode()) {
3630 Result = LegalizeOp(Tmp2);
3631 Tmp1 = LegalizeOp(Tmp2.getValue(1));
3635 case TargetLowering::Expand: {
3636 const Value *V = cast<SrcValueSDNode>(Node->getOperand(2))->getValue();
3637 SDValue VAList = DAG.getLoad(TLI.getPointerTy(), dl, Tmp1, Tmp2, V, 0);
3638 // Increment the pointer, VAList, to the next vaarg
3639 Tmp3 = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), VAList,
3640 DAG.getConstant(TLI.getTargetData()->
3641 getTypeAllocSize(VT.getTypeForMVT()),
3642 TLI.getPointerTy()));
3643 // Store the incremented VAList to the legalized pointer
3644 Tmp3 = DAG.getStore(VAList.getValue(1), dl, Tmp3, Tmp2, V, 0);
3645 // Load the actual argument out of the pointer VAList
3646 Result = DAG.getLoad(VT, dl, Tmp3, VAList, NULL, 0);
3647 Tmp1 = LegalizeOp(Result.getValue(1));
3648 Result = LegalizeOp(Result);
3652 // Since VAARG produces two values, make sure to remember that we
3653 // legalized both of them.
3654 AddLegalizedOperand(SDValue(Node, 0), Result);
3655 AddLegalizedOperand(SDValue(Node, 1), Tmp1);
3656 return Op.getResNo() ? Tmp1 : Result;
3660 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
3661 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the dest pointer.
3662 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the source pointer.
3664 switch (TLI.getOperationAction(ISD::VACOPY, MVT::Other)) {
3665 default: assert(0 && "This action is not supported yet!");
3666 case TargetLowering::Custom:
3669 case TargetLowering::Legal:
3670 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
3671 Node->getOperand(3), Node->getOperand(4));
3673 Tmp1 = TLI.LowerOperation(Result, DAG);
3674 if (Tmp1.getNode()) Result = Tmp1;
3677 case TargetLowering::Expand:
3678 // This defaults to loading a pointer from the input and storing it to the
3679 // output, returning the chain.
3680 const Value *VD = cast<SrcValueSDNode>(Node->getOperand(3))->getValue();
3681 const Value *VS = cast<SrcValueSDNode>(Node->getOperand(4))->getValue();
3682 Tmp4 = DAG.getLoad(TLI.getPointerTy(), dl, Tmp1, Tmp3, VS, 0);
3683 Result = DAG.getStore(Tmp4.getValue(1), dl, Tmp4, Tmp2, VD, 0);
3689 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
3690 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
3692 switch (TLI.getOperationAction(ISD::VAEND, MVT::Other)) {
3693 default: assert(0 && "This action is not supported yet!");
3694 case TargetLowering::Custom:
3697 case TargetLowering::Legal:
3698 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
3700 Tmp1 = TLI.LowerOperation(Tmp1, DAG);
3701 if (Tmp1.getNode()) Result = Tmp1;
3704 case TargetLowering::Expand:
3705 Result = Tmp1; // Default to a no-op, return the chain
3711 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
3712 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
3714 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
3716 switch (TLI.getOperationAction(ISD::VASTART, MVT::Other)) {
3717 default: assert(0 && "This action is not supported yet!");
3718 case TargetLowering::Legal: break;
3719 case TargetLowering::Custom:
3720 Tmp1 = TLI.LowerOperation(Result, DAG);
3721 if (Tmp1.getNode()) Result = Tmp1;
3728 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
3729 Tmp2 = LegalizeOp(DAG.getShiftAmountOperand(Node->getOperand(1))); // RHS
3730 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
3731 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3733 assert(0 && "ROTL/ROTR legalize operation not supported");
3735 case TargetLowering::Legal:
3737 case TargetLowering::Custom:
3738 Tmp1 = TLI.LowerOperation(Result, DAG);
3739 if (Tmp1.getNode()) Result = Tmp1;
3741 case TargetLowering::Promote:
3742 assert(0 && "Do not know how to promote ROTL/ROTR");
3744 case TargetLowering::Expand:
3745 assert(0 && "Do not know how to expand ROTL/ROTR");
3751 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
3752 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3753 case TargetLowering::Custom:
3754 assert(0 && "Cannot custom legalize this yet!");
3755 case TargetLowering::Legal:
3756 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3758 case TargetLowering::Promote: {
3759 MVT OVT = Tmp1.getValueType();
3760 MVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
3761 unsigned DiffBits = NVT.getSizeInBits() - OVT.getSizeInBits();
3763 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Tmp1);
3764 Tmp1 = DAG.getNode(ISD::BSWAP, dl, NVT, Tmp1);
3765 Result = DAG.getNode(ISD::SRL, dl, NVT, Tmp1,
3766 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
3769 case TargetLowering::Expand:
3770 Result = ExpandBSWAP(Tmp1, dl);
3778 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
3779 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3780 case TargetLowering::Custom:
3781 case TargetLowering::Legal:
3782 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3783 if (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0)) ==
3784 TargetLowering::Custom) {
3785 Tmp1 = TLI.LowerOperation(Result, DAG);
3786 if (Tmp1.getNode()) {
3791 case TargetLowering::Promote: {
3792 MVT OVT = Tmp1.getValueType();
3793 MVT NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
3795 // Zero extend the argument.
3796 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Tmp1);
3797 // Perform the larger operation, then subtract if needed.
3798 Tmp1 = DAG.getNode(Node->getOpcode(), dl, Node->getValueType(0), Tmp1);
3799 switch (Node->getOpcode()) {
3804 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
3805 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(Tmp1.getValueType()),
3806 Tmp1, DAG.getConstant(NVT.getSizeInBits(), NVT),
3808 Result = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2,
3809 DAG.getConstant(OVT.getSizeInBits(), NVT), Tmp1);
3812 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
3813 Result = DAG.getNode(ISD::SUB, dl, NVT, Tmp1,
3814 DAG.getConstant(NVT.getSizeInBits() -
3815 OVT.getSizeInBits(), NVT));
3820 case TargetLowering::Expand:
3821 Result = ExpandBitCount(Node->getOpcode(), Tmp1, dl);
3841 case ISD::FNEARBYINT:
3842 Tmp1 = LegalizeOp(Node->getOperand(0));
3843 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3844 case TargetLowering::Promote:
3845 case TargetLowering::Custom:
3848 case TargetLowering::Legal:
3849 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3851 Tmp1 = TLI.LowerOperation(Result, DAG);
3852 if (Tmp1.getNode()) Result = Tmp1;
3855 case TargetLowering::Expand:
3856 switch (Node->getOpcode()) {
3857 default: assert(0 && "Unreachable!");
3859 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
3860 Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0));
3861 Result = DAG.getNode(ISD::FSUB, dl, Node->getValueType(0), Tmp2, Tmp1);
3864 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
3865 MVT VT = Node->getValueType(0);
3866 Tmp2 = DAG.getConstantFP(0.0, VT);
3867 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(Tmp1.getValueType()),
3868 Tmp1, Tmp2, ISD::SETUGT);
3869 Tmp3 = DAG.getNode(ISD::FNEG, dl, VT, Tmp1);
3870 Result = DAG.getNode(ISD::SELECT, dl, VT, Tmp2, Tmp1, Tmp3);
3885 case ISD::FNEARBYINT: {
3886 MVT VT = Node->getValueType(0);
3888 // Expand unsupported unary vector operators by unrolling them.
3889 if (VT.isVector()) {
3890 Result = LegalizeOp(UnrollVectorOp(Op));
3894 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
3895 switch(Node->getOpcode()) {
3897 LC = GetFPLibCall(VT, RTLIB::SQRT_F32, RTLIB::SQRT_F64,
3898 RTLIB::SQRT_F80, RTLIB::SQRT_PPCF128);
3901 LC = GetFPLibCall(VT, RTLIB::SIN_F32, RTLIB::SIN_F64,
3902 RTLIB::SIN_F80, RTLIB::SIN_PPCF128);
3905 LC = GetFPLibCall(VT, RTLIB::COS_F32, RTLIB::COS_F64,
3906 RTLIB::COS_F80, RTLIB::COS_PPCF128);
3909 LC = GetFPLibCall(VT, RTLIB::LOG_F32, RTLIB::LOG_F64,
3910 RTLIB::LOG_F80, RTLIB::LOG_PPCF128);
3913 LC = GetFPLibCall(VT, RTLIB::LOG2_F32, RTLIB::LOG2_F64,
3914 RTLIB::LOG2_F80, RTLIB::LOG2_PPCF128);
3917 LC = GetFPLibCall(VT, RTLIB::LOG10_F32, RTLIB::LOG10_F64,
3918 RTLIB::LOG10_F80, RTLIB::LOG10_PPCF128);
3921 LC = GetFPLibCall(VT, RTLIB::EXP_F32, RTLIB::EXP_F64,
3922 RTLIB::EXP_F80, RTLIB::EXP_PPCF128);
3925 LC = GetFPLibCall(VT, RTLIB::EXP2_F32, RTLIB::EXP2_F64,
3926 RTLIB::EXP2_F80, RTLIB::EXP2_PPCF128);
3929 LC = GetFPLibCall(VT, RTLIB::TRUNC_F32, RTLIB::TRUNC_F64,
3930 RTLIB::TRUNC_F80, RTLIB::TRUNC_PPCF128);
3933 LC = GetFPLibCall(VT, RTLIB::FLOOR_F32, RTLIB::FLOOR_F64,
3934 RTLIB::FLOOR_F80, RTLIB::FLOOR_PPCF128);
3937 LC = GetFPLibCall(VT, RTLIB::CEIL_F32, RTLIB::CEIL_F64,
3938 RTLIB::CEIL_F80, RTLIB::CEIL_PPCF128);
3941 LC = GetFPLibCall(VT, RTLIB::RINT_F32, RTLIB::RINT_F64,
3942 RTLIB::RINT_F80, RTLIB::RINT_PPCF128);
3944 case ISD::FNEARBYINT:
3945 LC = GetFPLibCall(VT, RTLIB::NEARBYINT_F32, RTLIB::NEARBYINT_F64,
3946 RTLIB::NEARBYINT_F80, RTLIB::NEARBYINT_PPCF128);
3949 default: assert(0 && "Unreachable!");
3952 Result = ExpandLibCall(LC, Node, false/*sign irrelevant*/, Dummy);
3960 MVT VT = Node->getValueType(0);
3962 // Expand unsupported unary vector operators by unrolling them.
3963 if (VT.isVector()) {
3964 Result = LegalizeOp(UnrollVectorOp(Op));
3968 // We always lower FPOWI into a libcall. No target support for it yet.
3969 RTLIB::Libcall LC = GetFPLibCall(VT, RTLIB::POWI_F32, RTLIB::POWI_F64,
3970 RTLIB::POWI_F80, RTLIB::POWI_PPCF128);
3972 Result = ExpandLibCall(LC, Node, false/*sign irrelevant*/, Dummy);
3975 case ISD::BIT_CONVERT:
3976 if (!isTypeLegal(Node->getOperand(0).getValueType())) {
3977 Result = EmitStackConvert(Node->getOperand(0), Node->getValueType(0),
3978 Node->getValueType(0), dl);
3979 } else if (Op.getOperand(0).getValueType().isVector()) {
3980 // The input has to be a vector type, we have to either scalarize it, pack
3981 // it, or convert it based on whether the input vector type is legal.
3982 SDNode *InVal = Node->getOperand(0).getNode();
3983 int InIx = Node->getOperand(0).getResNo();
3984 unsigned NumElems = InVal->getValueType(InIx).getVectorNumElements();
3985 MVT EVT = InVal->getValueType(InIx).getVectorElementType();
3987 // Figure out if there is a simple type corresponding to this Vector
3988 // type. If so, convert to the vector type.
3989 MVT TVT = MVT::getVectorVT(EVT, NumElems);
3990 if (TLI.isTypeLegal(TVT)) {
3991 // Turn this into a bit convert of the vector input.
3992 Tmp1 = LegalizeOp(Node->getOperand(0));
3993 Result = DAG.getNode(ISD::BIT_CONVERT, dl, Node->getValueType(0), Tmp1);
3995 } else if (NumElems == 1) {
3996 // Turn this into a bit convert of the scalar input.
3997 Result = DAG.getNode(ISD::BIT_CONVERT, dl, Node->getValueType(0),
3998 ScalarizeVectorOp(Node->getOperand(0)));
4001 // FIXME: UNIMP! Store then reload
4002 assert(0 && "Cast from unsupported vector type not implemented yet!");
4005 switch (TLI.getOperationAction(ISD::BIT_CONVERT,
4006 Node->getOperand(0).getValueType())) {
4007 default: assert(0 && "Unknown operation action!");
4008 case TargetLowering::Expand:
4009 Result = EmitStackConvert(Node->getOperand(0), Node->getValueType(0),
4010 Node->getValueType(0), dl);
4012 case TargetLowering::Legal:
4013 Tmp1 = LegalizeOp(Node->getOperand(0));
4014 Result = DAG.UpdateNodeOperands(Result, Tmp1);
4019 case ISD::CONVERT_RNDSAT: {
4020 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(Node)->getCvtCode();
4022 default: assert(0 && "Unknown cvt code!");
4033 SDValue DTyOp = Node->getOperand(1);
4034 SDValue STyOp = Node->getOperand(2);
4035 SDValue RndOp = Node->getOperand(3);
4036 SDValue SatOp = Node->getOperand(4);
4037 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4038 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
4040 Tmp1 = LegalizeOp(Node->getOperand(0));
4041 Result = DAG.UpdateNodeOperands(Result, Tmp1, DTyOp, STyOp,
4043 if (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0)) ==
4044 TargetLowering::Custom) {
4045 Tmp1 = TLI.LowerOperation(Result, DAG);
4046 if (Tmp1.getNode()) Result = Tmp1;
4050 Result = PromoteOp(Node->getOperand(0));
4051 // For FP, make Op1 a i32
4053 Result = DAG.getConvertRndSat(Op.getValueType(), dl, Result,
4054 DTyOp, STyOp, RndOp, SatOp, CvtCode);
4059 } // end switch CvtCode
4062 // Conversion operators. The source and destination have different types.
4063 case ISD::SINT_TO_FP:
4064 case ISD::UINT_TO_FP: {
4065 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
4066 Result = LegalizeINT_TO_FP(Result, isSigned,
4067 Node->getValueType(0), Node->getOperand(0), dl);
4071 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4073 Tmp1 = LegalizeOp(Node->getOperand(0));
4074 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
4075 default: assert(0 && "Unknown TRUNCATE legalization operation action!");
4076 case TargetLowering::Custom:
4079 case TargetLowering::Legal:
4080 Result = DAG.UpdateNodeOperands(Result, Tmp1);
4082 Tmp1 = TLI.LowerOperation(Result, DAG);
4083 if (Tmp1.getNode()) Result = Tmp1;
4086 case TargetLowering::Expand:
4087 assert(Result.getValueType().isVector() && "must be vector type");
4088 // Unroll the truncate. We should do better.
4089 Result = LegalizeOp(UnrollVectorOp(Result));
4093 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
4095 // Since the result is legal, we should just be able to truncate the low
4096 // part of the source.
4097 Result = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0), Tmp1);
4100 Result = PromoteOp(Node->getOperand(0));
4101 Result = DAG.getNode(ISD::TRUNCATE, dl, Op.getValueType(), Result);
4106 case ISD::FP_TO_SINT:
4107 case ISD::FP_TO_UINT:
4108 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4110 Tmp1 = LegalizeOp(Node->getOperand(0));
4112 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))){
4113 default: assert(0 && "Unknown operation action!");
4114 case TargetLowering::Custom:
4117 case TargetLowering::Legal:
4118 Result = DAG.UpdateNodeOperands(Result, Tmp1);
4120 Tmp1 = TLI.LowerOperation(Result, DAG);
4121 if (Tmp1.getNode()) Result = Tmp1;
4124 case TargetLowering::Promote:
4125 Result = PromoteLegalFP_TO_INT(Tmp1, Node->getValueType(0),
4126 Node->getOpcode() == ISD::FP_TO_SINT,
4129 case TargetLowering::Expand:
4130 if (Node->getOpcode() == ISD::FP_TO_UINT) {
4131 SDValue True, False;
4132 MVT VT = Node->getOperand(0).getValueType();
4133 MVT NVT = Node->getValueType(0);
4134 const uint64_t zero[] = {0, 0};
4135 APFloat apf = APFloat(APInt(VT.getSizeInBits(), 2, zero));
4136 APInt x = APInt::getSignBit(NVT.getSizeInBits());
4137 (void)apf.convertFromAPInt(x, false, APFloat::rmNearestTiesToEven);
4138 Tmp2 = DAG.getConstantFP(apf, VT);
4139 Tmp3 = DAG.getSetCC(dl, TLI.getSetCCResultType(VT),
4140 Node->getOperand(0),
4142 True = DAG.getNode(ISD::FP_TO_SINT, dl, NVT, Node->getOperand(0));
4143 False = DAG.getNode(ISD::FP_TO_SINT, dl, NVT,
4144 DAG.getNode(ISD::FSUB, dl, VT,
4145 Node->getOperand(0), Tmp2));
4146 False = DAG.getNode(ISD::XOR, dl, NVT, False,
4147 DAG.getConstant(x, NVT));
4148 Result = DAG.getNode(ISD::SELECT, dl, NVT, Tmp3, True, False);
4151 assert(0 && "Do not know how to expand FP_TO_SINT yet!");
4157 MVT VT = Op.getValueType();
4158 MVT OVT = Node->getOperand(0).getValueType();
4159 // Convert ppcf128 to i32
4160 if (OVT == MVT::ppcf128 && VT == MVT::i32) {
4161 if (Node->getOpcode() == ISD::FP_TO_SINT) {
4162 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, MVT::ppcf128,
4163 Node->getOperand(0), DAG.getValueType(MVT::f64));
4164 Result = DAG.getNode(ISD::FP_ROUND, dl, MVT::f64, Result,
4165 DAG.getIntPtrConstant(1));
4166 Result = DAG.getNode(ISD::FP_TO_SINT, dl, VT, Result);
4168 const uint64_t TwoE31[] = {0x41e0000000000000LL, 0};
4169 APFloat apf = APFloat(APInt(128, 2, TwoE31));
4170 Tmp2 = DAG.getConstantFP(apf, OVT);
4171 // X>=2^31 ? (int)(X-2^31)+0x80000000 : (int)X
4172 // FIXME: generated code sucks.
4173 Result = DAG.getNode(ISD::SELECT_CC, dl, VT, Node->getOperand(0),
4175 DAG.getNode(ISD::ADD, dl, MVT::i32,
4176 DAG.getNode(ISD::FP_TO_SINT, dl, VT,
4177 DAG.getNode(ISD::FSUB, dl, OVT,
4178 Node->getOperand(0), Tmp2)),
4179 DAG.getConstant(0x80000000, MVT::i32)),
4180 DAG.getNode(ISD::FP_TO_SINT, dl, VT,
4181 Node->getOperand(0)),
4182 DAG.getCondCode(ISD::SETGE));
4186 // Convert f32 / f64 to i32 / i64 / i128.
4187 RTLIB::Libcall LC = (Node->getOpcode() == ISD::FP_TO_SINT) ?
4188 RTLIB::getFPTOSINT(OVT, VT) : RTLIB::getFPTOUINT(OVT, VT);
4189 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpectd fp-to-int conversion!");
4191 Result = ExpandLibCall(LC, Node, false/*sign irrelevant*/, Dummy);
4195 Tmp1 = PromoteOp(Node->getOperand(0));
4196 Result = DAG.UpdateNodeOperands(Result, LegalizeOp(Tmp1));
4197 Result = LegalizeOp(Result);
4202 case ISD::FP_EXTEND: {
4203 MVT DstVT = Op.getValueType();
4204 MVT SrcVT = Op.getOperand(0).getValueType();
4205 if (TLI.getConvertAction(SrcVT, DstVT) == TargetLowering::Expand) {
4206 // The only other way we can lower this is to turn it into a STORE,
4207 // LOAD pair, targetting a temporary location (a stack slot).
4208 Result = EmitStackConvert(Node->getOperand(0), SrcVT, DstVT, dl);
4211 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4212 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
4214 Tmp1 = LegalizeOp(Node->getOperand(0));
4215 Result = DAG.UpdateNodeOperands(Result, Tmp1);
4218 Tmp1 = PromoteOp(Node->getOperand(0));
4219 Result = DAG.getNode(ISD::FP_EXTEND, dl, Op.getValueType(), Tmp1);
4224 case ISD::FP_ROUND: {
4225 MVT DstVT = Op.getValueType();
4226 MVT SrcVT = Op.getOperand(0).getValueType();
4227 if (TLI.getConvertAction(SrcVT, DstVT) == TargetLowering::Expand) {
4228 if (SrcVT == MVT::ppcf128) {
4230 ExpandOp(Node->getOperand(0), Lo, Result);
4231 // Round it the rest of the way (e.g. to f32) if needed.
4232 if (DstVT!=MVT::f64)
4233 Result = DAG.getNode(ISD::FP_ROUND, dl,
4234 DstVT, Result, Op.getOperand(1));
4237 // The only other way we can lower this is to turn it into a STORE,
4238 // LOAD pair, targetting a temporary location (a stack slot).
4239 Result = EmitStackConvert(Node->getOperand(0), DstVT, DstVT, dl);
4242 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4243 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
4245 Tmp1 = LegalizeOp(Node->getOperand(0));
4246 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
4249 Tmp1 = PromoteOp(Node->getOperand(0));
4250 Result = DAG.getNode(ISD::FP_ROUND, dl, Op.getValueType(), Tmp1,
4251 Node->getOperand(1));
4256 case ISD::ANY_EXTEND:
4257 case ISD::ZERO_EXTEND:
4258 case ISD::SIGN_EXTEND:
4259 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4260 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
4262 Tmp1 = LegalizeOp(Node->getOperand(0));
4263 Result = DAG.UpdateNodeOperands(Result, Tmp1);
4264 if (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0)) ==
4265 TargetLowering::Custom) {
4266 Tmp1 = TLI.LowerOperation(Result, DAG);
4267 if (Tmp1.getNode()) Result = Tmp1;
4271 switch (Node->getOpcode()) {
4272 case ISD::ANY_EXTEND:
4273 Tmp1 = PromoteOp(Node->getOperand(0));
4274 Result = DAG.getNode(ISD::ANY_EXTEND, dl, Op.getValueType(), Tmp1);
4276 case ISD::ZERO_EXTEND:
4277 Result = PromoteOp(Node->getOperand(0));
4278 Result = DAG.getNode(ISD::ANY_EXTEND, dl, Op.getValueType(), Result);
4279 Result = DAG.getZeroExtendInReg(Result, dl,
4280 Node->getOperand(0).getValueType());
4282 case ISD::SIGN_EXTEND:
4283 Result = PromoteOp(Node->getOperand(0));
4284 Result = DAG.getNode(ISD::ANY_EXTEND, dl, Op.getValueType(), Result);
4285 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Result.getValueType(),
4287 DAG.getValueType(Node->getOperand(0).getValueType()));
4292 case ISD::FP_ROUND_INREG:
4293 case ISD::SIGN_EXTEND_INREG: {
4294 Tmp1 = LegalizeOp(Node->getOperand(0));
4295 MVT ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
4297 // If this operation is not supported, convert it to a shl/shr or load/store
4299 switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) {
4300 default: assert(0 && "This action not supported for this op yet!");
4301 case TargetLowering::Legal:
4302 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
4304 case TargetLowering::Expand:
4305 // If this is an integer extend and shifts are supported, do that.
4306 if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) {
4307 // NOTE: we could fall back on load/store here too for targets without
4308 // SAR. However, it is doubtful that any exist.
4309 unsigned BitsDiff = Node->getValueType(0).getSizeInBits() -
4310 ExtraVT.getSizeInBits();
4311 SDValue ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy());
4312 Result = DAG.getNode(ISD::SHL, dl, Node->getValueType(0),
4313 Node->getOperand(0), ShiftCst);
4314 Result = DAG.getNode(ISD::SRA, dl, Node->getValueType(0),
4316 } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) {
4317 // The only way we can lower this is to turn it into a TRUNCSTORE,
4318 // EXTLOAD pair, targetting a temporary location (a stack slot).
4320 // NOTE: there is a choice here between constantly creating new stack
4321 // slots and always reusing the same one. We currently always create
4322 // new ones, as reuse may inhibit scheduling.
4323 Result = EmitStackConvert(Node->getOperand(0), ExtraVT,
4324 Node->getValueType(0), dl);
4326 assert(0 && "Unknown op");
4332 case ISD::TRAMPOLINE: {
4334 for (unsigned i = 0; i != 6; ++i)
4335 Ops[i] = LegalizeOp(Node->getOperand(i));
4336 Result = DAG.UpdateNodeOperands(Result, Ops, 6);
4337 // The only option for this node is to custom lower it.
4338 Result = TLI.LowerOperation(Result, DAG);
4339 assert(Result.getNode() && "Should always custom lower!");
4341 // Since trampoline produces two values, make sure to remember that we
4342 // legalized both of them.
4343 Tmp1 = LegalizeOp(Result.getValue(1));
4344 Result = LegalizeOp(Result);
4345 AddLegalizedOperand(SDValue(Node, 0), Result);
4346 AddLegalizedOperand(SDValue(Node, 1), Tmp1);
4347 return Op.getResNo() ? Tmp1 : Result;
4349 case ISD::FLT_ROUNDS_: {
4350 MVT VT = Node->getValueType(0);
4351 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
4352 default: assert(0 && "This action not supported for this op yet!");
4353 case TargetLowering::Custom:
4354 Result = TLI.LowerOperation(Op, DAG);
4355 if (Result.getNode()) break;
4357 case TargetLowering::Legal:
4358 // If this operation is not supported, lower it to constant 1
4359 Result = DAG.getConstant(1, VT);
4365 MVT VT = Node->getValueType(0);
4366 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
4367 default: assert(0 && "This action not supported for this op yet!");
4368 case TargetLowering::Legal:
4369 Tmp1 = LegalizeOp(Node->getOperand(0));
4370 Result = DAG.UpdateNodeOperands(Result, Tmp1);
4372 case TargetLowering::Custom:
4373 Result = TLI.LowerOperation(Op, DAG);
4374 if (Result.getNode()) break;
4376 case TargetLowering::Expand:
4377 // If this operation is not supported, lower it to 'abort()' call
4378 Tmp1 = LegalizeOp(Node->getOperand(0));
4379 TargetLowering::ArgListTy Args;
4380 std::pair<SDValue, SDValue> CallResult =
4381 TLI.LowerCallTo(Tmp1, Type::VoidTy,
4382 false, false, false, false, CallingConv::C, false,
4383 DAG.getExternalSymbol("abort", TLI.getPointerTy()),
4385 Result = CallResult.second;
4393 MVT VT = Node->getValueType(0);
4394 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
4395 default: assert(0 && "This action not supported for this op yet!");
4396 case TargetLowering::Custom:
4397 Result = TLI.LowerOperation(Op, DAG);
4398 if (Result.getNode()) break;
4400 case TargetLowering::Legal: {
4401 SDValue LHS = LegalizeOp(Node->getOperand(0));
4402 SDValue RHS = LegalizeOp(Node->getOperand(1));
4404 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::SADDO ?
4405 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
4407 MVT OType = Node->getValueType(1);
4409 SDValue Zero = DAG.getConstant(0, LHS.getValueType());
4411 // LHSSign -> LHS >= 0
4412 // RHSSign -> RHS >= 0
4413 // SumSign -> Sum >= 0
4416 // Overflow -> (LHSSign == RHSSign) && (LHSSign != SumSign)
4418 // Overflow -> (LHSSign != RHSSign) && (LHSSign != SumSign)
4420 SDValue LHSSign = DAG.getSetCC(dl, OType, LHS, Zero, ISD::SETGE);
4421 SDValue RHSSign = DAG.getSetCC(dl, OType, RHS, Zero, ISD::SETGE);
4422 SDValue SignsMatch = DAG.getSetCC(dl, OType, LHSSign, RHSSign,
4423 Node->getOpcode() == ISD::SADDO ?
4424 ISD::SETEQ : ISD::SETNE);
4426 SDValue SumSign = DAG.getSetCC(dl, OType, Sum, Zero, ISD::SETGE);
4427 SDValue SumSignNE = DAG.getSetCC(dl, OType, LHSSign, SumSign, ISD::SETNE);
4429 SDValue Cmp = DAG.getNode(ISD::AND, dl, OType, SignsMatch, SumSignNE);
4431 MVT ValueVTs[] = { LHS.getValueType(), OType };
4432 SDValue Ops[] = { Sum, Cmp };
4434 Result = DAG.getNode(ISD::MERGE_VALUES, dl,
4435 DAG.getVTList(&ValueVTs[0], 2),
4437 SDNode *RNode = Result.getNode();
4438 DAG.ReplaceAllUsesWith(Node, RNode);
4447 MVT VT = Node->getValueType(0);
4448 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
4449 default: assert(0 && "This action not supported for this op yet!");
4450 case TargetLowering::Custom:
4451 Result = TLI.LowerOperation(Op, DAG);
4452 if (Result.getNode()) break;
4454 case TargetLowering::Legal: {
4455 SDValue LHS = LegalizeOp(Node->getOperand(0));
4456 SDValue RHS = LegalizeOp(Node->getOperand(1));
4458 SDValue Sum = DAG.getNode(Node->getOpcode() == ISD::UADDO ?
4459 ISD::ADD : ISD::SUB, dl, LHS.getValueType(),
4461 MVT OType = Node->getValueType(1);
4462 SDValue Cmp = DAG.getSetCC(dl, OType, Sum, LHS,
4463 Node->getOpcode () == ISD::UADDO ?
4464 ISD::SETULT : ISD::SETUGT);
4466 MVT ValueVTs[] = { LHS.getValueType(), OType };
4467 SDValue Ops[] = { Sum, Cmp };
4469 Result = DAG.getNode(ISD::MERGE_VALUES, dl,
4470 DAG.getVTList(&ValueVTs[0], 2),
4472 SDNode *RNode = Result.getNode();
4473 DAG.ReplaceAllUsesWith(Node, RNode);
4482 MVT VT = Node->getValueType(0);
4483 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
4484 default: assert(0 && "This action is not supported at all!");
4485 case TargetLowering::Custom:
4486 Result = TLI.LowerOperation(Op, DAG);
4487 if (Result.getNode()) break;
4489 case TargetLowering::Legal:
4490 // FIXME: According to Hacker's Delight, this can be implemented in
4491 // target independent lowering, but it would be inefficient, since it
4492 // requires a division + a branch.
4493 assert(0 && "Target independent lowering is not supported for SMULO/UMULO!");
4501 assert(Result.getValueType() == Op.getValueType() &&
4502 "Bad legalization!");
4504 // Make sure that the generated code is itself legal.
4506 Result = LegalizeOp(Result);
4508 // Note that LegalizeOp may be reentered even from single-use nodes, which
4509 // means that we always must cache transformed nodes.
4510 AddLegalizedOperand(Op, Result);
4514 /// PromoteOp - Given an operation that produces a value in an invalid type,
4515 /// promote it to compute the value into a larger type. The produced value will
4516 /// have the correct bits for the low portion of the register, but no guarantee
4517 /// is made about the top bits: it may be zero, sign-extended, or garbage.
4518 SDValue SelectionDAGLegalize::PromoteOp(SDValue Op) {
4519 MVT VT = Op.getValueType();
4520 MVT NVT = TLI.getTypeToTransformTo(VT);
4521 assert(getTypeAction(VT) == Promote &&
4522 "Caller should expand or legalize operands that are not promotable!");
4523 assert(NVT.bitsGT(VT) && NVT.isInteger() == VT.isInteger() &&
4524 "Cannot promote to smaller type!");
4526 SDValue Tmp1, Tmp2, Tmp3;
4528 SDNode *Node = Op.getNode();
4529 DebugLoc dl = Node->getDebugLoc();
4531 DenseMap<SDValue, SDValue>::iterator I = PromotedNodes.find(Op);
4532 if (I != PromotedNodes.end()) return I->second;
4534 switch (Node->getOpcode()) {
4535 case ISD::CopyFromReg:
4536 assert(0 && "CopyFromReg must be legal!");
4539 cerr << "NODE: "; Node->dump(&DAG); cerr << "\n";
4541 assert(0 && "Do not know how to promote this operator!");
4544 Result = DAG.getUNDEF(NVT);
4548 Result = DAG.getNode(ISD::SIGN_EXTEND, dl, NVT, Op);
4550 Result = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Op);
4551 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?");
4553 case ISD::ConstantFP:
4554 Result = DAG.getNode(ISD::FP_EXTEND, dl, NVT, Op);
4555 assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?");
4559 MVT VT0 = Node->getOperand(0).getValueType();
4560 assert(isTypeLegal(TLI.getSetCCResultType(VT0))
4561 && "SetCC type is not legal??");
4562 Result = DAG.getNode(ISD::SETCC, dl, TLI.getSetCCResultType(VT0),
4563 Node->getOperand(0), Node->getOperand(1),
4564 Node->getOperand(2));
4568 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4570 Result = LegalizeOp(Node->getOperand(0));
4571 assert(Result.getValueType().bitsGE(NVT) &&
4572 "This truncation doesn't make sense!");
4573 if (Result.getValueType().bitsGT(NVT)) // Truncate to NVT instead of VT
4574 Result = DAG.getNode(ISD::TRUNCATE, dl, NVT, Result);
4577 // The truncation is not required, because we don't guarantee anything
4578 // about high bits anyway.
4579 Result = PromoteOp(Node->getOperand(0));
4582 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
4583 // Truncate the low part of the expanded value to the result type
4584 Result = DAG.getNode(ISD::TRUNCATE, dl, NVT, Tmp1);
4587 case ISD::SIGN_EXTEND:
4588 case ISD::ZERO_EXTEND:
4589 case ISD::ANY_EXTEND:
4590 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4591 case Expand: assert(0 && "BUG: Smaller reg should have been promoted!");
4593 // Input is legal? Just do extend all the way to the larger type.
4594 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Node->getOperand(0));
4597 // Promote the reg if it's smaller.
4598 Result = PromoteOp(Node->getOperand(0));
4599 // The high bits are not guaranteed to be anything. Insert an extend.
4600 if (Node->getOpcode() == ISD::SIGN_EXTEND)
4601 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Result,
4602 DAG.getValueType(Node->getOperand(0).getValueType()));
4603 else if (Node->getOpcode() == ISD::ZERO_EXTEND)
4604 Result = DAG.getZeroExtendInReg(Result, dl,
4605 Node->getOperand(0).getValueType());
4609 case ISD::CONVERT_RNDSAT: {
4610 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(Node)->getCvtCode();
4611 assert ((CvtCode == ISD::CVT_SS || CvtCode == ISD::CVT_SU ||
4612 CvtCode == ISD::CVT_US || CvtCode == ISD::CVT_UU ||
4613 CvtCode == ISD::CVT_SF || CvtCode == ISD::CVT_UF) &&
4614 "can only promote integers");
4615 Result = DAG.getConvertRndSat(NVT, dl, Node->getOperand(0),
4616 Node->getOperand(1), Node->getOperand(2),
4617 Node->getOperand(3), Node->getOperand(4),
4622 case ISD::BIT_CONVERT:
4623 Result = EmitStackConvert(Node->getOperand(0), Node->getValueType(0),
4624 Node->getValueType(0), dl);
4625 Result = PromoteOp(Result);
4628 case ISD::FP_EXTEND:
4629 assert(0 && "Case not implemented. Dynamically dead with 2 FP types!");
4631 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4632 case Expand: assert(0 && "BUG: Cannot expand FP regs!");
4633 case Promote: assert(0 && "Unreachable with 2 FP types!");
4635 if (Node->getConstantOperandVal(1) == 0) {
4636 // Input is legal? Do an FP_ROUND_INREG.
4637 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, NVT, Node->getOperand(0),
4638 DAG.getValueType(VT));
4640 // Just remove the truncate, it isn't affecting the value.
4641 Result = DAG.getNode(ISD::FP_ROUND, dl, NVT, Node->getOperand(0),
4642 Node->getOperand(1));
4647 case ISD::SINT_TO_FP:
4648 case ISD::UINT_TO_FP:
4649 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4651 // No extra round required here.
4652 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Node->getOperand(0));
4656 Result = PromoteOp(Node->getOperand(0));
4657 if (Node->getOpcode() == ISD::SINT_TO_FP)
4658 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Result.getValueType(),
4660 DAG.getValueType(Node->getOperand(0).getValueType()));
4662 Result = DAG.getZeroExtendInReg(Result, dl,
4663 Node->getOperand(0).getValueType());
4664 // No extra round required here.
4665 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Result);
4668 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT,
4669 Node->getOperand(0), dl);
4670 // Round if we cannot tolerate excess precision.
4671 if (NoExcessFPPrecision)
4672 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, NVT, Result,
4673 DAG.getValueType(VT));
4678 case ISD::SIGN_EXTEND_INREG:
4679 Result = PromoteOp(Node->getOperand(0));
4680 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Result,
4681 Node->getOperand(1));
4683 case ISD::FP_TO_SINT:
4684 case ISD::FP_TO_UINT:
4685 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4688 Tmp1 = Node->getOperand(0);
4691 // The input result is prerounded, so we don't have to do anything
4693 Tmp1 = PromoteOp(Node->getOperand(0));
4696 // If we're promoting a UINT to a larger size, check to see if the new node
4697 // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since
4698 // we can use that instead. This allows us to generate better code for
4699 // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not
4700 // legal, such as PowerPC.
4701 if (Node->getOpcode() == ISD::FP_TO_UINT &&
4702 !TLI.isOperationLegalOrCustom(ISD::FP_TO_UINT, NVT) &&
4703 (TLI.isOperationLegalOrCustom(ISD::FP_TO_SINT, NVT) ||
4704 TLI.getOperationAction(ISD::FP_TO_SINT, NVT)==TargetLowering::Custom)){
4705 Result = DAG.getNode(ISD::FP_TO_SINT, dl, NVT, Tmp1);
4707 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
4713 Tmp1 = PromoteOp(Node->getOperand(0));
4714 assert(Tmp1.getValueType() == NVT);
4715 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
4716 // NOTE: we do not have to do any extra rounding here for
4717 // NoExcessFPPrecision, because we know the input will have the appropriate
4718 // precision, and these operations don't modify precision at all.
4733 case ISD::FNEARBYINT:
4734 Tmp1 = PromoteOp(Node->getOperand(0));
4735 assert(Tmp1.getValueType() == NVT);
4736 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
4737 if (NoExcessFPPrecision)
4738 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, NVT, Result,
4739 DAG.getValueType(VT));
4744 // Promote f32 pow(i) to f64 pow(i). Note that this could insert a libcall
4745 // directly as well, which may be better.
4746 Tmp1 = PromoteOp(Node->getOperand(0));
4747 Tmp2 = Node->getOperand(1);
4748 if (Node->getOpcode() == ISD::FPOW)
4749 Tmp2 = PromoteOp(Tmp2);
4750 assert(Tmp1.getValueType() == NVT);
4751 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
4752 if (NoExcessFPPrecision)
4753 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, NVT, Result,
4754 DAG.getValueType(VT));
4758 case ISD::ATOMIC_CMP_SWAP: {
4759 AtomicSDNode* AtomNode = cast<AtomicSDNode>(Node);
4760 Tmp2 = PromoteOp(Node->getOperand(2));
4761 Tmp3 = PromoteOp(Node->getOperand(3));
4762 Result = DAG.getAtomic(Node->getOpcode(), dl, AtomNode->getMemoryVT(),
4763 AtomNode->getChain(),
4764 AtomNode->getBasePtr(), Tmp2, Tmp3,
4765 AtomNode->getSrcValue(),
4766 AtomNode->getAlignment());
4767 // Remember that we legalized the chain.
4768 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
4771 case ISD::ATOMIC_LOAD_ADD:
4772 case ISD::ATOMIC_LOAD_SUB:
4773 case ISD::ATOMIC_LOAD_AND:
4774 case ISD::ATOMIC_LOAD_OR:
4775 case ISD::ATOMIC_LOAD_XOR:
4776 case ISD::ATOMIC_LOAD_NAND:
4777 case ISD::ATOMIC_LOAD_MIN:
4778 case ISD::ATOMIC_LOAD_MAX:
4779 case ISD::ATOMIC_LOAD_UMIN:
4780 case ISD::ATOMIC_LOAD_UMAX:
4781 case ISD::ATOMIC_SWAP: {
4782 AtomicSDNode* AtomNode = cast<AtomicSDNode>(Node);
4783 Tmp2 = PromoteOp(Node->getOperand(2));
4784 Result = DAG.getAtomic(Node->getOpcode(), dl, AtomNode->getMemoryVT(),
4785 AtomNode->getChain(),
4786 AtomNode->getBasePtr(), Tmp2,
4787 AtomNode->getSrcValue(),
4788 AtomNode->getAlignment());
4789 // Remember that we legalized the chain.
4790 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
4800 // The input may have strange things in the top bits of the registers, but
4801 // these operations don't care. They may have weird bits going out, but
4802 // that too is okay if they are integer operations.
4803 Tmp1 = PromoteOp(Node->getOperand(0));
4804 Tmp2 = PromoteOp(Node->getOperand(1));
4805 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
4806 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
4811 Tmp1 = PromoteOp(Node->getOperand(0));
4812 Tmp2 = PromoteOp(Node->getOperand(1));
4813 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
4814 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
4816 // Floating point operations will give excess precision that we may not be
4817 // able to tolerate. If we DO allow excess precision, just leave it,
4818 // otherwise excise it.
4819 // FIXME: Why would we need to round FP ops more than integer ones?
4820 // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C))
4821 if (NoExcessFPPrecision)
4822 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, NVT, Result,
4823 DAG.getValueType(VT));
4828 // These operators require that their input be sign extended.
4829 Tmp1 = PromoteOp(Node->getOperand(0));
4830 Tmp2 = PromoteOp(Node->getOperand(1));
4831 if (NVT.isInteger()) {
4832 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Tmp1,
4833 DAG.getValueType(VT));
4834 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Tmp2,
4835 DAG.getValueType(VT));
4837 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
4839 // Perform FP_ROUND: this is probably overly pessimistic.
4840 if (NVT.isFloatingPoint() && NoExcessFPPrecision)
4841 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, NVT, Result,
4842 DAG.getValueType(VT));
4846 case ISD::FCOPYSIGN:
4847 // These operators require that their input be fp extended.
4848 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4849 case Expand: assert(0 && "not implemented");
4850 case Legal: Tmp1 = LegalizeOp(Node->getOperand(0)); break;
4851 case Promote: Tmp1 = PromoteOp(Node->getOperand(0)); break;
4853 switch (getTypeAction(Node->getOperand(1).getValueType())) {
4854 case Expand: assert(0 && "not implemented");
4855 case Legal: Tmp2 = LegalizeOp(Node->getOperand(1)); break;
4856 case Promote: Tmp2 = PromoteOp(Node->getOperand(1)); break;
4858 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
4860 // Perform FP_ROUND: this is probably overly pessimistic.
4861 if (NoExcessFPPrecision && Node->getOpcode() != ISD::FCOPYSIGN)
4862 Result = DAG.getNode(ISD::FP_ROUND_INREG, dl, NVT, Result,
4863 DAG.getValueType(VT));
4868 // These operators require that their input be zero extended.
4869 Tmp1 = PromoteOp(Node->getOperand(0));
4870 Tmp2 = PromoteOp(Node->getOperand(1));
4871 assert(NVT.isInteger() && "Operators don't apply to FP!");
4872 Tmp1 = DAG.getZeroExtendInReg(Tmp1, dl, VT);
4873 Tmp2 = DAG.getZeroExtendInReg(Tmp2, dl, VT);
4874 Result = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1, Tmp2);
4878 Tmp1 = PromoteOp(Node->getOperand(0));
4879 Result = DAG.getNode(ISD::SHL, dl, NVT, Tmp1, Node->getOperand(1));
4882 // The input value must be properly sign extended.
4883 Tmp1 = PromoteOp(Node->getOperand(0));
4884 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Tmp1,
4885 DAG.getValueType(VT));
4886 Result = DAG.getNode(ISD::SRA, dl, NVT, Tmp1, Node->getOperand(1));
4889 // The input value must be properly zero extended.
4890 Tmp1 = PromoteOp(Node->getOperand(0));
4891 Tmp1 = DAG.getZeroExtendInReg(Tmp1, dl, VT);
4892 Result = DAG.getNode(ISD::SRL, dl, NVT, Tmp1, Node->getOperand(1));
4896 Tmp1 = Node->getOperand(0); // Get the chain.
4897 Tmp2 = Node->getOperand(1); // Get the pointer.
4898 if (TLI.getOperationAction(ISD::VAARG, VT) == TargetLowering::Custom) {
4899 Tmp3 = DAG.getVAArg(VT, dl, Tmp1, Tmp2, Node->getOperand(2));
4900 Result = TLI.LowerOperation(Tmp3, DAG);
4902 const Value *V = cast<SrcValueSDNode>(Node->getOperand(2))->getValue();
4903 SDValue VAList = DAG.getLoad(TLI.getPointerTy(), dl, Tmp1, Tmp2, V, 0);
4904 // Increment the pointer, VAList, to the next vaarg
4905 Tmp3 = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), VAList,
4906 DAG.getConstant(VT.getSizeInBits()/8,
4907 TLI.getPointerTy()));
4908 // Store the incremented VAList to the legalized pointer
4909 Tmp3 = DAG.getStore(VAList.getValue(1), dl, Tmp3, Tmp2, V, 0);
4910 // Load the actual argument out of the pointer VAList
4911 Result = DAG.getExtLoad(ISD::EXTLOAD, dl, NVT, Tmp3, VAList, NULL, 0, VT);
4913 // Remember that we legalized the chain.
4914 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
4918 LoadSDNode *LD = cast<LoadSDNode>(Node);
4919 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(Node)
4920 ? ISD::EXTLOAD : LD->getExtensionType();
4921 Result = DAG.getExtLoad(ExtType, dl, NVT,
4922 LD->getChain(), LD->getBasePtr(),
4923 LD->getSrcValue(), LD->getSrcValueOffset(),
4926 LD->getAlignment());
4927 // Remember that we legalized the chain.
4928 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
4932 Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0
4933 Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1
4935 MVT VT2 = Tmp2.getValueType();
4936 assert(VT2 == Tmp3.getValueType()
4937 && "PromoteOp SELECT: Operands 2 and 3 ValueTypes don't match");
4938 // Ensure that the resulting node is at least the same size as the operands'
4939 // value types, because we cannot assume that TLI.getSetCCValueType() is
4941 Result = DAG.getNode(ISD::SELECT, dl, VT2, Node->getOperand(0), Tmp2, Tmp3);
4944 case ISD::SELECT_CC:
4945 Tmp2 = PromoteOp(Node->getOperand(2)); // True
4946 Tmp3 = PromoteOp(Node->getOperand(3)); // False
4947 Result = DAG.getNode(ISD::SELECT_CC, dl, NVT, Node->getOperand(0),
4948 Node->getOperand(1), Tmp2, Tmp3, Node->getOperand(4));
4951 Tmp1 = Node->getOperand(0);
4952 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Tmp1);
4953 Tmp1 = DAG.getNode(ISD::BSWAP, dl, NVT, Tmp1);
4954 Result = DAG.getNode(ISD::SRL, dl, NVT, Tmp1,
4955 DAG.getConstant(NVT.getSizeInBits() -
4957 TLI.getShiftAmountTy()));
4962 // Zero extend the argument
4963 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Node->getOperand(0));
4964 // Perform the larger operation, then subtract if needed.
4965 Tmp1 = DAG.getNode(Node->getOpcode(), dl, NVT, Tmp1);
4966 switch(Node->getOpcode()) {
4971 // if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
4972 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(Tmp1.getValueType()), Tmp1,
4973 DAG.getConstant(NVT.getSizeInBits(), NVT),
4975 Result = DAG.getNode(ISD::SELECT, dl, NVT, Tmp2,
4976 DAG.getConstant(VT.getSizeInBits(), NVT), Tmp1);
4979 //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
4980 Result = DAG.getNode(ISD::SUB, dl, NVT, Tmp1,
4981 DAG.getConstant(NVT.getSizeInBits() -
4982 VT.getSizeInBits(), NVT));
4986 case ISD::EXTRACT_SUBVECTOR:
4987 Result = PromoteOp(ExpandEXTRACT_SUBVECTOR(Op));
4989 case ISD::EXTRACT_VECTOR_ELT:
4990 Result = PromoteOp(ExpandEXTRACT_VECTOR_ELT(Op));
4994 assert(Result.getNode() && "Didn't set a result!");
4996 // Make sure the result is itself legal.
4997 Result = LegalizeOp(Result);
4999 // Remember that we promoted this!
5000 AddPromotedOperand(Op, Result);
5004 /// ExpandEXTRACT_VECTOR_ELT - Expand an EXTRACT_VECTOR_ELT operation into
5005 /// a legal EXTRACT_VECTOR_ELT operation, scalar code, or memory traffic,
5006 /// based on the vector type. The return type of this matches the element type
5007 /// of the vector, which may not be legal for the target.
5008 SDValue SelectionDAGLegalize::ExpandEXTRACT_VECTOR_ELT(SDValue Op) {
5009 // We know that operand #0 is the Vec vector. If the index is a constant
5010 // or if the invec is a supported hardware type, we can use it. Otherwise,
5011 // lower to a store then an indexed load.
5012 SDValue Vec = Op.getOperand(0);
5013 SDValue Idx = Op.getOperand(1);
5014 DebugLoc dl = Op.getDebugLoc();
5016 MVT TVT = Vec.getValueType();
5017 unsigned NumElems = TVT.getVectorNumElements();
5019 switch (TLI.getOperationAction(ISD::EXTRACT_VECTOR_ELT, TVT)) {
5020 default: assert(0 && "This action is not supported yet!");
5021 case TargetLowering::Custom: {
5022 Vec = LegalizeOp(Vec);
5023 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
5024 SDValue Tmp3 = TLI.LowerOperation(Op, DAG);
5029 case TargetLowering::Legal:
5030 if (isTypeLegal(TVT)) {
5031 Vec = LegalizeOp(Vec);
5032 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
5036 case TargetLowering::Promote:
5037 assert(TVT.isVector() && "not vector type");
5038 // fall thru to expand since vectors are by default are promote
5039 case TargetLowering::Expand:
5043 if (NumElems == 1) {
5044 // This must be an access of the only element. Return it.
5045 Op = ScalarizeVectorOp(Vec);
5046 } else if (!TLI.isTypeLegal(TVT) && isa<ConstantSDNode>(Idx)) {
5047 unsigned NumLoElts = 1 << Log2_32(NumElems-1);
5048 ConstantSDNode *CIdx = cast<ConstantSDNode>(Idx);
5050 SplitVectorOp(Vec, Lo, Hi);
5051 if (CIdx->getZExtValue() < NumLoElts) {
5055 Idx = DAG.getConstant(CIdx->getZExtValue() - NumLoElts,
5056 Idx.getValueType());
5059 // It's now an extract from the appropriate high or low part. Recurse.
5060 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
5061 Op = ExpandEXTRACT_VECTOR_ELT(Op);
5063 // Store the value to a temporary stack slot, then LOAD the scalar
5064 // element back out.
5065 SDValue StackPtr = DAG.CreateStackTemporary(Vec.getValueType());
5066 SDValue Ch = DAG.getStore(DAG.getEntryNode(), dl, Vec, StackPtr, NULL, 0);
5068 // Add the offset to the index.
5069 unsigned EltSize = Op.getValueType().getSizeInBits()/8;
5070 Idx = DAG.getNode(ISD::MUL, dl, Idx.getValueType(), Idx,
5071 DAG.getConstant(EltSize, Idx.getValueType()));
5073 if (Idx.getValueType().bitsGT(TLI.getPointerTy()))
5074 Idx = DAG.getNode(ISD::TRUNCATE, dl, TLI.getPointerTy(), Idx);
5076 Idx = DAG.getNode(ISD::ZERO_EXTEND, dl, TLI.getPointerTy(), Idx);
5078 StackPtr = DAG.getNode(ISD::ADD, dl, Idx.getValueType(), Idx, StackPtr);
5080 Op = DAG.getLoad(Op.getValueType(), dl, Ch, StackPtr, NULL, 0);
5085 /// ExpandEXTRACT_SUBVECTOR - Expand a EXTRACT_SUBVECTOR operation. For now
5086 /// we assume the operation can be split if it is not already legal.
5087 SDValue SelectionDAGLegalize::ExpandEXTRACT_SUBVECTOR(SDValue Op) {
5088 // We know that operand #0 is the Vec vector. For now we assume the index
5089 // is a constant and that the extracted result is a supported hardware type.
5090 SDValue Vec = Op.getOperand(0);
5091 SDValue Idx = LegalizeOp(Op.getOperand(1));
5093 unsigned NumElems = Vec.getValueType().getVectorNumElements();
5095 if (NumElems == Op.getValueType().getVectorNumElements()) {
5096 // This must be an access of the desired vector length. Return it.
5100 ConstantSDNode *CIdx = cast<ConstantSDNode>(Idx);
5102 SplitVectorOp(Vec, Lo, Hi);
5103 if (CIdx->getZExtValue() < NumElems/2) {
5107 Idx = DAG.getConstant(CIdx->getZExtValue() - NumElems/2,
5108 Idx.getValueType());
5111 // It's now an extract from the appropriate high or low part. Recurse.
5112 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
5113 return ExpandEXTRACT_SUBVECTOR(Op);
5116 /// LegalizeSetCCOperands - Attempts to create a legal LHS and RHS for a SETCC
5117 /// with condition CC on the current target. This usually involves legalizing
5118 /// or promoting the arguments. In the case where LHS and RHS must be expanded,
5119 /// there may be no choice but to create a new SetCC node to represent the
5120 /// legalized value of setcc lhs, rhs. In this case, the value is returned in
5121 /// LHS, and the SDValue returned in RHS has a nil SDNode value.
5122 void SelectionDAGLegalize::LegalizeSetCCOperands(SDValue &LHS,
5126 SDValue Tmp1, Tmp2, Tmp3, Result;
5128 switch (getTypeAction(LHS.getValueType())) {
5130 Tmp1 = LegalizeOp(LHS); // LHS
5131 Tmp2 = LegalizeOp(RHS); // RHS
5134 Tmp1 = PromoteOp(LHS); // LHS
5135 Tmp2 = PromoteOp(RHS); // RHS
5137 // If this is an FP compare, the operands have already been extended.
5138 if (LHS.getValueType().isInteger()) {
5139 MVT VT = LHS.getValueType();
5140 MVT NVT = TLI.getTypeToTransformTo(VT);
5142 // Otherwise, we have to insert explicit sign or zero extends. Note
5143 // that we could insert sign extends for ALL conditions, but zero extend
5144 // is cheaper on many machines (an AND instead of two shifts), so prefer
5146 switch (cast<CondCodeSDNode>(CC)->get()) {
5147 default: assert(0 && "Unknown integer comparison!");
5154 // ALL of these operations will work if we either sign or zero extend
5155 // the operands (including the unsigned comparisons!). Zero extend is
5156 // usually a simpler/cheaper operation, so prefer it.
5157 Tmp1 = DAG.getZeroExtendInReg(Tmp1, dl, VT);
5158 Tmp2 = DAG.getZeroExtendInReg(Tmp2, dl, VT);
5164 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Tmp1,
5165 DAG.getValueType(VT));
5166 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Tmp2,
5167 DAG.getValueType(VT));
5168 Tmp1 = LegalizeOp(Tmp1); // Relegalize new nodes.
5169 Tmp2 = LegalizeOp(Tmp2); // Relegalize new nodes.
5175 MVT VT = LHS.getValueType();
5176 if (VT == MVT::f32 || VT == MVT::f64) {
5177 // Expand into one or more soft-fp libcall(s).
5178 RTLIB::Libcall LC1 = RTLIB::UNKNOWN_LIBCALL, LC2 = RTLIB::UNKNOWN_LIBCALL;
5179 switch (cast<CondCodeSDNode>(CC)->get()) {
5182 LC1 = (VT == MVT::f32) ? RTLIB::OEQ_F32 : RTLIB::OEQ_F64;
5186 LC1 = (VT == MVT::f32) ? RTLIB::UNE_F32 : RTLIB::UNE_F64;
5190 LC1 = (VT == MVT::f32) ? RTLIB::OGE_F32 : RTLIB::OGE_F64;
5194 LC1 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
5198 LC1 = (VT == MVT::f32) ? RTLIB::OLE_F32 : RTLIB::OLE_F64;
5202 LC1 = (VT == MVT::f32) ? RTLIB::OGT_F32 : RTLIB::OGT_F64;
5205 LC1 = (VT == MVT::f32) ? RTLIB::UO_F32 : RTLIB::UO_F64;
5208 LC1 = (VT == MVT::f32) ? RTLIB::O_F32 : RTLIB::O_F64;
5211 LC1 = (VT == MVT::f32) ? RTLIB::UO_F32 : RTLIB::UO_F64;
5212 switch (cast<CondCodeSDNode>(CC)->get()) {
5214 // SETONE = SETOLT | SETOGT
5215 LC1 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
5218 LC2 = (VT == MVT::f32) ? RTLIB::OGT_F32 : RTLIB::OGT_F64;
5221 LC2 = (VT == MVT::f32) ? RTLIB::OGE_F32 : RTLIB::OGE_F64;
5224 LC2 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
5227 LC2 = (VT == MVT::f32) ? RTLIB::OLE_F32 : RTLIB::OLE_F64;
5230 LC2 = (VT == MVT::f32) ? RTLIB::OEQ_F32 : RTLIB::OEQ_F64;
5232 default: assert(0 && "Unsupported FP setcc!");
5237 SDValue Ops[2] = { LHS, RHS };
5238 Tmp1 = ExpandLibCall(LC1, DAG.getMergeValues(Ops, 2, dl).getNode(),
5239 false /*sign irrelevant*/, Dummy);
5240 Tmp2 = DAG.getConstant(0, MVT::i32);
5241 CC = DAG.getCondCode(TLI.getCmpLibcallCC(LC1));
5242 if (LC2 != RTLIB::UNKNOWN_LIBCALL) {
5243 Tmp1 = DAG.getNode(ISD::SETCC, dl,
5244 TLI.getSetCCResultType(Tmp1.getValueType()),
5246 LHS = ExpandLibCall(LC2, DAG.getMergeValues(Ops, 2, dl).getNode(),
5247 false /*sign irrelevant*/, Dummy);
5248 Tmp2 = DAG.getNode(ISD::SETCC, dl,
5249 TLI.getSetCCResultType(LHS.getValueType()), LHS,
5250 Tmp2, DAG.getCondCode(TLI.getCmpLibcallCC(LC2)));
5251 Tmp1 = DAG.getNode(ISD::OR, dl, Tmp1.getValueType(), Tmp1, Tmp2);
5254 LHS = LegalizeOp(Tmp1);
5259 SDValue LHSLo, LHSHi, RHSLo, RHSHi;
5260 ExpandOp(LHS, LHSLo, LHSHi);
5261 ExpandOp(RHS, RHSLo, RHSHi);
5262 ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get();
5264 if (VT==MVT::ppcf128) {
5265 // FIXME: This generated code sucks. We want to generate
5266 // FCMPU crN, hi1, hi2
5268 // FCMPU crN, lo1, lo2
5269 // The following can be improved, but not that much.
5270 Tmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()),
5271 LHSHi, RHSHi, ISD::SETOEQ);
5272 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSLo.getValueType()),
5273 LHSLo, RHSLo, CCCode);
5274 Tmp3 = DAG.getNode(ISD::AND, dl, Tmp1.getValueType(), Tmp1, Tmp2);
5275 Tmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()),
5276 LHSHi, RHSHi, ISD::SETUNE);
5277 Tmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()),
5278 LHSHi, RHSHi, CCCode);
5279 Tmp1 = DAG.getNode(ISD::AND, dl, Tmp1.getValueType(), Tmp1, Tmp2);
5280 Tmp1 = DAG.getNode(ISD::OR, dl, Tmp1.getValueType(), Tmp1, Tmp3);
5289 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo))
5290 if (RHSCST->isAllOnesValue()) {
5291 // Comparison to -1.
5292 Tmp1 = DAG.getNode(ISD::AND, dl,LHSLo.getValueType(), LHSLo, LHSHi);
5297 Tmp1 = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSLo, RHSLo);
5298 Tmp2 = DAG.getNode(ISD::XOR, dl, LHSLo.getValueType(), LHSHi, RHSHi);
5299 Tmp1 = DAG.getNode(ISD::OR, dl, Tmp1.getValueType(), Tmp1, Tmp2);
5300 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
5303 // If this is a comparison of the sign bit, just look at the top part.
5305 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(RHS))
5306 if ((cast<CondCodeSDNode>(CC)->get() == ISD::SETLT &&
5307 CST->isNullValue()) || // X < 0
5308 (cast<CondCodeSDNode>(CC)->get() == ISD::SETGT &&
5309 CST->isAllOnesValue())) { // X > -1
5315 // FIXME: This generated code sucks.
5316 ISD::CondCode LowCC;
5318 default: assert(0 && "Unknown integer setcc!");
5320 case ISD::SETULT: LowCC = ISD::SETULT; break;
5322 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
5324 case ISD::SETULE: LowCC = ISD::SETULE; break;
5326 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
5329 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
5330 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
5331 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
5333 // NOTE: on targets without efficient SELECT of bools, we can always use
5334 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
5335 TargetLowering::DAGCombinerInfo DagCombineInfo(DAG, false, true, NULL);
5336 Tmp1 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSLo.getValueType()),
5337 LHSLo, RHSLo, LowCC, false, DagCombineInfo, dl);
5338 if (!Tmp1.getNode())
5339 Tmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(LHSLo.getValueType()),
5340 LHSLo, RHSLo, LowCC);
5341 Tmp2 = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()),
5342 LHSHi, RHSHi, CCCode, false, DagCombineInfo, dl);
5343 if (!Tmp2.getNode())
5344 Tmp2 = DAG.getNode(ISD::SETCC, dl,
5345 TLI.getSetCCResultType(LHSHi.getValueType()),
5348 ConstantSDNode *Tmp1C = dyn_cast<ConstantSDNode>(Tmp1.getNode());
5349 ConstantSDNode *Tmp2C = dyn_cast<ConstantSDNode>(Tmp2.getNode());
5350 if ((Tmp1C && Tmp1C->isNullValue()) ||
5351 (Tmp2C && Tmp2C->isNullValue() &&
5352 (CCCode == ISD::SETLE || CCCode == ISD::SETGE ||
5353 CCCode == ISD::SETUGE || CCCode == ISD::SETULE)) ||
5354 (Tmp2C && Tmp2C->getAPIntValue() == 1 &&
5355 (CCCode == ISD::SETLT || CCCode == ISD::SETGT ||
5356 CCCode == ISD::SETUGT || CCCode == ISD::SETULT))) {
5357 // low part is known false, returns high part.
5358 // For LE / GE, if high part is known false, ignore the low part.
5359 // For LT / GT, if high part is known true, ignore the low part.
5363 Result = TLI.SimplifySetCC(TLI.getSetCCResultType(LHSHi.getValueType()),
5364 LHSHi, RHSHi, ISD::SETEQ, false,
5365 DagCombineInfo, dl);
5366 if (!Result.getNode())
5367 Result=DAG.getSetCC(dl, TLI.getSetCCResultType(LHSHi.getValueType()),
5368 LHSHi, RHSHi, ISD::SETEQ);
5369 Result = LegalizeOp(DAG.getNode(ISD::SELECT, dl, Tmp1.getValueType(),
5370 Result, Tmp1, Tmp2));
5381 /// LegalizeSetCCCondCode - Legalize a SETCC with given LHS and RHS and
5382 /// condition code CC on the current target. This routine assumes LHS and rHS
5383 /// have already been legalized by LegalizeSetCCOperands. It expands SETCC with
5384 /// illegal condition code into AND / OR of multiple SETCC values.
5385 void SelectionDAGLegalize::LegalizeSetCCCondCode(MVT VT,
5386 SDValue &LHS, SDValue &RHS,
5389 MVT OpVT = LHS.getValueType();
5390 ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get();
5391 switch (TLI.getCondCodeAction(CCCode, OpVT)) {
5392 default: assert(0 && "Unknown condition code action!");
5393 case TargetLowering::Legal:
5396 case TargetLowering::Expand: {
5397 ISD::CondCode CC1 = ISD::SETCC_INVALID, CC2 = ISD::SETCC_INVALID;
5400 default: assert(0 && "Don't know how to expand this condition!"); abort();
5401 case ISD::SETOEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETO; Opc = ISD::AND; break;
5402 case ISD::SETOGT: CC1 = ISD::SETGT; CC2 = ISD::SETO; Opc = ISD::AND; break;
5403 case ISD::SETOGE: CC1 = ISD::SETGE; CC2 = ISD::SETO; Opc = ISD::AND; break;
5404 case ISD::SETOLT: CC1 = ISD::SETLT; CC2 = ISD::SETO; Opc = ISD::AND; break;
5405 case ISD::SETOLE: CC1 = ISD::SETLE; CC2 = ISD::SETO; Opc = ISD::AND; break;
5406 case ISD::SETONE: CC1 = ISD::SETNE; CC2 = ISD::SETO; Opc = ISD::AND; break;
5407 case ISD::SETUEQ: CC1 = ISD::SETEQ; CC2 = ISD::SETUO; Opc = ISD::OR; break;
5408 case ISD::SETUGT: CC1 = ISD::SETGT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
5409 case ISD::SETUGE: CC1 = ISD::SETGE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
5410 case ISD::SETULT: CC1 = ISD::SETLT; CC2 = ISD::SETUO; Opc = ISD::OR; break;
5411 case ISD::SETULE: CC1 = ISD::SETLE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
5412 case ISD::SETUNE: CC1 = ISD::SETNE; CC2 = ISD::SETUO; Opc = ISD::OR; break;
5413 // FIXME: Implement more expansions.
5416 SDValue SetCC1 = DAG.getSetCC(dl, VT, LHS, RHS, CC1);
5417 SDValue SetCC2 = DAG.getSetCC(dl, VT, LHS, RHS, CC2);
5418 LHS = DAG.getNode(Opc, dl, VT, SetCC1, SetCC2);
5426 /// EmitStackConvert - Emit a store/load combination to the stack. This stores
5427 /// SrcOp to a stack slot of type SlotVT, truncating it if needed. It then does
5428 /// a load from the stack slot to DestVT, extending it if needed.
5429 /// The resultant code need not be legal.
5430 SDValue SelectionDAGLegalize::EmitStackConvert(SDValue SrcOp,
5434 // Create the stack frame object.
5436 TLI.getTargetData()->getPrefTypeAlignment(SrcOp.getValueType().
5438 SDValue FIPtr = DAG.CreateStackTemporary(SlotVT, SrcAlign);
5440 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(FIPtr);
5441 int SPFI = StackPtrFI->getIndex();
5442 const Value *SV = PseudoSourceValue::getFixedStack(SPFI);
5444 unsigned SrcSize = SrcOp.getValueType().getSizeInBits();
5445 unsigned SlotSize = SlotVT.getSizeInBits();
5446 unsigned DestSize = DestVT.getSizeInBits();
5447 unsigned DestAlign =
5448 TLI.getTargetData()->getPrefTypeAlignment(DestVT.getTypeForMVT());
5450 // Emit a store to the stack slot. Use a truncstore if the input value is
5451 // later than DestVT.
5454 if (SrcSize > SlotSize)
5455 Store = DAG.getTruncStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
5456 SV, 0, SlotVT, false, SrcAlign);
5458 assert(SrcSize == SlotSize && "Invalid store");
5459 Store = DAG.getStore(DAG.getEntryNode(), dl, SrcOp, FIPtr,
5460 SV, 0, false, SrcAlign);
5463 // Result is a load from the stack slot.
5464 if (SlotSize == DestSize)
5465 return DAG.getLoad(DestVT, dl, Store, FIPtr, SV, 0, false, DestAlign);
5467 assert(SlotSize < DestSize && "Unknown extension!");
5468 return DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT, Store, FIPtr, SV, 0, SlotVT,
5472 SDValue SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
5473 DebugLoc dl = Node->getDebugLoc();
5474 // Create a vector sized/aligned stack slot, store the value to element #0,
5475 // then load the whole vector back out.
5476 SDValue StackPtr = DAG.CreateStackTemporary(Node->getValueType(0));
5478 FrameIndexSDNode *StackPtrFI = cast<FrameIndexSDNode>(StackPtr);
5479 int SPFI = StackPtrFI->getIndex();
5481 SDValue Ch = DAG.getTruncStore(DAG.getEntryNode(), dl, Node->getOperand(0),
5483 PseudoSourceValue::getFixedStack(SPFI), 0,
5484 Node->getValueType(0).getVectorElementType());
5485 return DAG.getLoad(Node->getValueType(0), dl, Ch, StackPtr,
5486 PseudoSourceValue::getFixedStack(SPFI), 0);
5490 /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
5491 /// support the operation, but do support the resultant vector type.
5492 SDValue SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
5493 unsigned NumElems = Node->getNumOperands();
5494 SDValue SplatValue = Node->getOperand(0);
5495 DebugLoc dl = Node->getDebugLoc();
5496 MVT VT = Node->getValueType(0);
5497 MVT OpVT = SplatValue.getValueType();
5498 MVT EltVT = VT.getVectorElementType();
5500 // If the only non-undef value is the low element, turn this into a
5501 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
5502 bool isOnlyLowElement = true;
5504 // FIXME: it would be far nicer to change this into map<SDValue,uint64_t>
5505 // and use a bitmask instead of a list of elements.
5506 // FIXME: this doesn't treat <0, u, 0, u> for example, as a splat.
5507 std::map<SDValue, std::vector<unsigned> > Values;
5508 Values[SplatValue].push_back(0);
5509 bool isConstant = true;
5510 if (!isa<ConstantFPSDNode>(SplatValue) && !isa<ConstantSDNode>(SplatValue) &&
5511 SplatValue.getOpcode() != ISD::UNDEF)
5514 for (unsigned i = 1; i < NumElems; ++i) {
5515 SDValue V = Node->getOperand(i);
5516 Values[V].push_back(i);
5517 if (V.getOpcode() != ISD::UNDEF)
5518 isOnlyLowElement = false;
5519 if (SplatValue != V)
5520 SplatValue = SDValue(0, 0);
5522 // If this isn't a constant element or an undef, we can't use a constant
5524 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V) &&
5525 V.getOpcode() != ISD::UNDEF)
5529 if (isOnlyLowElement) {
5530 // If the low element is an undef too, then this whole things is an undef.
5531 if (Node->getOperand(0).getOpcode() == ISD::UNDEF)
5532 return DAG.getUNDEF(VT);
5533 // Otherwise, turn this into a scalar_to_vector node.
5534 return DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Node->getOperand(0));
5537 // If all elements are constants, create a load from the constant pool.
5539 std::vector<Constant*> CV;
5540 for (unsigned i = 0, e = NumElems; i != e; ++i) {
5541 if (ConstantFPSDNode *V =
5542 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
5543 CV.push_back(const_cast<ConstantFP *>(V->getConstantFPValue()));
5544 } else if (ConstantSDNode *V =
5545 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
5546 CV.push_back(const_cast<ConstantInt *>(V->getConstantIntValue()));
5548 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
5549 const Type *OpNTy = OpVT.getTypeForMVT();
5550 CV.push_back(UndefValue::get(OpNTy));
5553 Constant *CP = ConstantVector::get(CV);
5554 SDValue CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
5555 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
5556 return DAG.getLoad(VT, dl, DAG.getEntryNode(), CPIdx,
5557 PseudoSourceValue::getConstantPool(), 0,
5561 if (SplatValue.getNode()) { // Splat of one value?
5562 // Build the shuffle constant vector: <0, 0, 0, 0>
5563 SmallVector<int, 8> ZeroVec(NumElems, 0);
5565 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
5566 if (TLI.isShuffleMaskLegal(ZeroVec, Node->getValueType(0))) {
5567 // Get the splatted value into the low element of a vector register.
5569 DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, SplatValue);
5571 // Return shuffle(LowValVec, undef, <0,0,0,0>)
5572 return DAG.getVectorShuffle(VT, dl, LowValVec, DAG.getUNDEF(VT),
5577 // If there are only two unique elements, we may be able to turn this into a
5579 if (Values.size() == 2) {
5580 // Get the two values in deterministic order.
5581 SDValue Val1 = Node->getOperand(1);
5583 std::map<SDValue, std::vector<unsigned> >::iterator MI = Values.begin();
5584 if (MI->first != Val1)
5587 Val2 = (++MI)->first;
5589 // If Val1 is an undef, make sure it ends up as Val2, to ensure that our
5590 // vector shuffle has the undef vector on the RHS.
5591 if (Val1.getOpcode() == ISD::UNDEF)
5592 std::swap(Val1, Val2);
5594 // Build the shuffle constant vector: e.g. <0, 4, 0, 4>
5595 SmallVector<int, 8> ShuffleMask(NumElems, -1);
5597 // Set elements of the shuffle mask for Val1.
5598 std::vector<unsigned> &Val1Elts = Values[Val1];
5599 for (unsigned i = 0, e = Val1Elts.size(); i != e; ++i)
5600 ShuffleMask[Val1Elts[i]] = 0;
5602 // Set elements of the shuffle mask for Val2.
5603 std::vector<unsigned> &Val2Elts = Values[Val2];
5604 for (unsigned i = 0, e = Val2Elts.size(); i != e; ++i)
5605 if (Val2.getOpcode() != ISD::UNDEF)
5606 ShuffleMask[Val2Elts[i]] = NumElems;
5608 // If the target supports SCALAR_TO_VECTOR and this shuffle mask, use it.
5609 if (TLI.isOperationLegalOrCustom(ISD::SCALAR_TO_VECTOR, VT) &&
5610 TLI.isShuffleMaskLegal(ShuffleMask, VT)) {
5611 Val1 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Val1);
5612 Val2 = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VT, Val2);
5613 return DAG.getVectorShuffle(VT, dl, Val1, Val2, &ShuffleMask[0]);
5617 // Otherwise, we can't handle this case efficiently. Allocate a sufficiently
5618 // aligned object on the stack, store each element into it, then load
5619 // the result as a vector.
5620 // Create the stack frame object.
5621 SDValue FIPtr = DAG.CreateStackTemporary(VT);
5622 int FI = cast<FrameIndexSDNode>(FIPtr.getNode())->getIndex();
5623 const Value *SV = PseudoSourceValue::getFixedStack(FI);
5625 // Emit a store of each element to the stack slot.
5626 SmallVector<SDValue, 8> Stores;
5627 unsigned TypeByteSize = OpVT.getSizeInBits() / 8;
5628 // Store (in the right endianness) the elements to memory.
5629 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
5630 // Ignore undef elements.
5631 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
5633 unsigned Offset = TypeByteSize*i;
5635 SDValue Idx = DAG.getConstant(Offset, FIPtr.getValueType());
5636 Idx = DAG.getNode(ISD::ADD, dl, FIPtr.getValueType(), FIPtr, Idx);
5638 Stores.push_back(DAG.getStore(DAG.getEntryNode(), dl, Node->getOperand(i),
5643 if (!Stores.empty()) // Not all undef elements?
5644 StoreChain = DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
5645 &Stores[0], Stores.size());
5647 StoreChain = DAG.getEntryNode();
5649 // Result is a load from the stack slot.
5650 return DAG.getLoad(VT, dl, StoreChain, FIPtr, SV, 0);
5653 void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp,
5654 SDValue Op, SDValue Amt,
5655 SDValue &Lo, SDValue &Hi,
5657 // Expand the subcomponents.
5659 ExpandOp(Op, LHSL, LHSH);
5661 SDValue Ops[] = { LHSL, LHSH, Amt };
5662 MVT VT = LHSL.getValueType();
5663 Lo = DAG.getNode(NodeOp, dl, DAG.getVTList(VT, VT), Ops, 3);
5664 Hi = Lo.getValue(1);
5668 /// ExpandShift - Try to find a clever way to expand this shift operation out to
5669 /// smaller elements. If we can't find a way that is more efficient than a
5670 /// libcall on this target, return false. Otherwise, return true with the
5671 /// low-parts expanded into Lo and Hi.
5672 bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDValue Op, SDValue Amt,
5673 SDValue &Lo, SDValue &Hi,
5675 assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) &&
5676 "This is not a shift!");
5678 MVT NVT = TLI.getTypeToTransformTo(Op.getValueType());
5679 SDValue ShAmt = LegalizeOp(Amt);
5680 MVT ShTy = ShAmt.getValueType();
5681 unsigned ShBits = ShTy.getSizeInBits();
5682 unsigned VTBits = Op.getValueType().getSizeInBits();
5683 unsigned NVTBits = NVT.getSizeInBits();
5685 // Handle the case when Amt is an immediate.
5686 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.getNode())) {
5687 unsigned Cst = CN->getZExtValue();
5688 // Expand the incoming operand to be shifted, so that we have its parts
5690 ExpandOp(Op, InL, InH);
5694 Lo = DAG.getConstant(0, NVT);
5695 Hi = DAG.getConstant(0, NVT);
5696 } else if (Cst > NVTBits) {
5697 Lo = DAG.getConstant(0, NVT);
5698 Hi = DAG.getNode(ISD::SHL, dl,
5699 NVT, InL, DAG.getConstant(Cst-NVTBits, ShTy));
5700 } else if (Cst == NVTBits) {
5701 Lo = DAG.getConstant(0, NVT);
5704 Lo = DAG.getNode(ISD::SHL, dl, NVT, InL, DAG.getConstant(Cst, ShTy));
5705 Hi = DAG.getNode(ISD::OR, dl, NVT,
5706 DAG.getNode(ISD::SHL, dl, NVT, InH, DAG.getConstant(Cst, ShTy)),
5707 DAG.getNode(ISD::SRL, dl, NVT, InL,
5708 DAG.getConstant(NVTBits-Cst, ShTy)));
5713 Lo = DAG.getConstant(0, NVT);
5714 Hi = DAG.getConstant(0, NVT);
5715 } else if (Cst > NVTBits) {
5716 Lo = DAG.getNode(ISD::SRL, dl, NVT,
5717 InH, DAG.getConstant(Cst-NVTBits, ShTy));
5718 Hi = DAG.getConstant(0, NVT);
5719 } else if (Cst == NVTBits) {
5721 Hi = DAG.getConstant(0, NVT);
5723 Lo = DAG.getNode(ISD::OR, dl, NVT,
5724 DAG.getNode(ISD::SRL, dl, NVT, InL, DAG.getConstant(Cst, ShTy)),
5725 DAG.getNode(ISD::SHL, dl, NVT, InH,
5726 DAG.getConstant(NVTBits-Cst, ShTy)));
5727 Hi = DAG.getNode(ISD::SRL, dl, NVT, InH, DAG.getConstant(Cst, ShTy));
5732 Hi = Lo = DAG.getNode(ISD::SRA, dl, NVT, InH,
5733 DAG.getConstant(NVTBits-1, ShTy));
5734 } else if (Cst > NVTBits) {
5735 Lo = DAG.getNode(ISD::SRA, dl, NVT, InH,
5736 DAG.getConstant(Cst-NVTBits, ShTy));
5737 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH,
5738 DAG.getConstant(NVTBits-1, ShTy));
5739 } else if (Cst == NVTBits) {
5741 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH,
5742 DAG.getConstant(NVTBits-1, ShTy));
5744 Lo = DAG.getNode(ISD::OR, dl, NVT,
5745 DAG.getNode(ISD::SRL, dl, NVT, InL, DAG.getConstant(Cst, ShTy)),
5746 DAG.getNode(ISD::SHL, dl,
5747 NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
5748 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, DAG.getConstant(Cst, ShTy));
5754 // Okay, the shift amount isn't constant. However, if we can tell that it is
5755 // >= 32 or < 32, we can still simplify it, without knowing the actual value.
5756 APInt Mask = APInt::getHighBitsSet(ShBits, ShBits - Log2_32(NVTBits));
5757 APInt KnownZero, KnownOne;
5758 DAG.ComputeMaskedBits(Amt, Mask, KnownZero, KnownOne);
5760 // If we know that if any of the high bits of the shift amount are one, then
5761 // we can do this as a couple of simple shifts.
5762 if (KnownOne.intersects(Mask)) {
5763 // Mask out the high bit, which we know is set.
5764 Amt = DAG.getNode(ISD::AND, dl, Amt.getValueType(), Amt,
5765 DAG.getConstant(~Mask, Amt.getValueType()));
5767 // Expand the incoming operand to be shifted, so that we have its parts
5769 ExpandOp(Op, InL, InH);
5772 Lo = DAG.getConstant(0, NVT); // Low part is zero.
5773 Hi = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt); // High part from Lo part.
5776 Hi = DAG.getConstant(0, NVT); // Hi part is zero.
5777 Lo = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt); // Lo part from Hi part.
5780 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, // Sign extend high part.
5781 DAG.getConstant(NVTBits-1, Amt.getValueType()));
5782 Lo = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt); // Lo part from Hi part.
5787 // If we know that the high bits of the shift amount are all zero, then we can
5788 // do this as a couple of simple shifts.
5789 if ((KnownZero & Mask) == Mask) {
5791 SDValue Amt2 = DAG.getNode(ISD::SUB, dl, Amt.getValueType(),
5792 DAG.getConstant(NVTBits, Amt.getValueType()),
5795 // Expand the incoming operand to be shifted, so that we have its parts
5797 ExpandOp(Op, InL, InH);
5800 Lo = DAG.getNode(ISD::SHL, dl, NVT, InL, Amt);
5801 Hi = DAG.getNode(ISD::OR, dl, NVT,
5802 DAG.getNode(ISD::SHL, dl, NVT, InH, Amt),
5803 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt2));
5806 Hi = DAG.getNode(ISD::SRL, dl, NVT, InH, Amt);
5807 Lo = DAG.getNode(ISD::OR, dl, NVT,
5808 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt),
5809 DAG.getNode(ISD::SHL, dl, NVT, InH, Amt2));
5812 Hi = DAG.getNode(ISD::SRA, dl, NVT, InH, Amt);
5813 Lo = DAG.getNode(ISD::OR, dl, NVT,
5814 DAG.getNode(ISD::SRL, dl, NVT, InL, Amt),
5815 DAG.getNode(ISD::SHL, dl, NVT, InH, Amt2));
5824 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
5825 // does not fit into a register, return the lo part and set the hi part to the
5826 // by-reg argument. If it does fit into a single register, return the result
5827 // and leave the Hi part unset.
5828 SDValue SelectionDAGLegalize::ExpandLibCall(RTLIB::Libcall LC, SDNode *Node,
5829 bool isSigned, SDValue &Hi) {
5830 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
5831 // The input chain to this libcall is the entry node of the function.
5832 // Legalizing the call will automatically add the previous call to the
5834 SDValue InChain = DAG.getEntryNode();
5836 TargetLowering::ArgListTy Args;
5837 TargetLowering::ArgListEntry Entry;
5838 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
5839 MVT ArgVT = Node->getOperand(i).getValueType();
5840 const Type *ArgTy = ArgVT.getTypeForMVT();
5841 Entry.Node = Node->getOperand(i); Entry.Ty = ArgTy;
5842 Entry.isSExt = isSigned;
5843 Entry.isZExt = !isSigned;
5844 Args.push_back(Entry);
5846 SDValue Callee = DAG.getExternalSymbol(TLI.getLibcallName(LC),
5847 TLI.getPointerTy());
5849 // Splice the libcall in wherever FindInputOutputChains tells us to.
5850 const Type *RetTy = Node->getValueType(0).getTypeForMVT();
5851 std::pair<SDValue, SDValue> CallInfo =
5852 TLI.LowerCallTo(InChain, RetTy, isSigned, !isSigned, false, false,
5853 CallingConv::C, false, Callee, Args, DAG,
5854 Node->getDebugLoc());
5856 // Legalize the call sequence, starting with the chain. This will advance
5857 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
5858 // was added by LowerCallTo (guaranteeing proper serialization of calls).
5859 LegalizeOp(CallInfo.second);
5861 switch (getTypeAction(CallInfo.first.getValueType())) {
5862 default: assert(0 && "Unknown thing");
5864 Result = CallInfo.first;
5867 ExpandOp(CallInfo.first, Result, Hi);
5873 /// LegalizeINT_TO_FP - Legalize a [US]INT_TO_FP operation.
5875 SDValue SelectionDAGLegalize::
5876 LegalizeINT_TO_FP(SDValue Result, bool isSigned, MVT DestTy, SDValue Op,
5878 bool isCustom = false;
5880 switch (getTypeAction(Op.getValueType())) {
5882 switch (TLI.getOperationAction(isSigned ? ISD::SINT_TO_FP : ISD::UINT_TO_FP,
5883 Op.getValueType())) {
5884 default: assert(0 && "Unknown operation action!");
5885 case TargetLowering::Custom:
5888 case TargetLowering::Legal:
5889 Tmp1 = LegalizeOp(Op);
5890 if (Result.getNode())
5891 Result = DAG.UpdateNodeOperands(Result, Tmp1);
5893 Result = DAG.getNode(isSigned ? ISD::SINT_TO_FP : ISD::UINT_TO_FP, dl,
5896 Tmp1 = TLI.LowerOperation(Result, DAG);
5897 if (Tmp1.getNode()) Result = Tmp1;
5900 case TargetLowering::Expand:
5901 Result = ExpandLegalINT_TO_FP(isSigned, LegalizeOp(Op), DestTy, dl);
5903 case TargetLowering::Promote:
5904 Result = PromoteLegalINT_TO_FP(LegalizeOp(Op), DestTy, isSigned, dl);
5909 Result = ExpandIntToFP(isSigned, DestTy, Op, dl) ;
5912 Tmp1 = PromoteOp(Op);
5914 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Tmp1.getValueType(),
5915 Tmp1, DAG.getValueType(Op.getValueType()));
5917 Tmp1 = DAG.getZeroExtendInReg(Tmp1, dl, Op.getValueType());
5919 if (Result.getNode())
5920 Result = DAG.UpdateNodeOperands(Result, Tmp1);
5922 Result = DAG.getNode(isSigned ? ISD::SINT_TO_FP : ISD::UINT_TO_FP, dl,
5924 Result = LegalizeOp(Result); // The 'op' is not necessarily legal!
5930 /// ExpandIntToFP - Expand a [US]INT_TO_FP operation.
5932 SDValue SelectionDAGLegalize::
5933 ExpandIntToFP(bool isSigned, MVT DestTy, SDValue Source, DebugLoc dl) {
5934 MVT SourceVT = Source.getValueType();
5935 bool ExpandSource = getTypeAction(SourceVT) == Expand;
5937 // Expand unsupported int-to-fp vector casts by unrolling them.
5938 if (DestTy.isVector()) {
5940 return LegalizeOp(UnrollVectorOp(Source));
5941 MVT DestEltTy = DestTy.getVectorElementType();
5942 if (DestTy.getVectorNumElements() == 1) {
5943 SDValue Scalar = ScalarizeVectorOp(Source);
5944 SDValue Result = LegalizeINT_TO_FP(SDValue(), isSigned,
5945 DestEltTy, Scalar, dl);
5946 return DAG.getNode(ISD::BUILD_VECTOR, dl, DestTy, Result);
5949 SplitVectorOp(Source, Lo, Hi);
5950 MVT SplitDestTy = MVT::getVectorVT(DestEltTy,
5951 DestTy.getVectorNumElements() / 2);
5952 SDValue LoResult = LegalizeINT_TO_FP(SDValue(), isSigned, SplitDestTy,
5954 SDValue HiResult = LegalizeINT_TO_FP(SDValue(), isSigned, SplitDestTy,
5956 return LegalizeOp(DAG.getNode(ISD::CONCAT_VECTORS, dl, DestTy, LoResult,
5960 // Special case for i32 source to take advantage of UINTTOFP_I32_F32, etc.
5961 if (!isSigned && SourceVT != MVT::i32) {
5962 // The integer value loaded will be incorrectly if the 'sign bit' of the
5963 // incoming integer is set. To handle this, we dynamically test to see if
5964 // it is set, and, if so, add a fudge factor.
5968 ExpandOp(Source, Lo, Hi);
5969 Source = DAG.getNode(ISD::BUILD_PAIR, dl, SourceVT, Lo, Hi);
5971 // The comparison for the sign bit will use the entire operand.
5975 // Check to see if the target has a custom way to lower this. If so, use
5976 // it. (Note we've already expanded the operand in this case.)
5977 switch (TLI.getOperationAction(ISD::UINT_TO_FP, SourceVT)) {
5978 default: assert(0 && "This action not implemented for this operation!");
5979 case TargetLowering::Legal:
5980 case TargetLowering::Expand:
5981 break; // This case is handled below.
5982 case TargetLowering::Custom: {
5983 SDValue NV = TLI.LowerOperation(DAG.getNode(ISD::UINT_TO_FP, dl, DestTy,
5986 return LegalizeOp(NV);
5987 break; // The target decided this was legal after all
5991 // If this is unsigned, and not supported, first perform the conversion to
5992 // signed, then adjust the result if the sign bit is set.
5993 SDValue SignedConv = ExpandIntToFP(true, DestTy, Source, dl);
5995 SDValue SignSet = DAG.getSetCC(dl,
5996 TLI.getSetCCResultType(Hi.getValueType()),
5997 Hi, DAG.getConstant(0, Hi.getValueType()),
5999 SDValue Zero = DAG.getIntPtrConstant(0), Four = DAG.getIntPtrConstant(4);
6000 SDValue CstOffset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(),
6001 SignSet, Four, Zero);
6002 uint64_t FF = 0x5f800000ULL;
6003 if (TLI.isLittleEndian()) FF <<= 32;
6004 Constant *FudgeFactor = ConstantInt::get(Type::Int64Ty, FF);
6006 SDValue CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
6007 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
6008 CPIdx = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), CPIdx, CstOffset);
6009 Alignment = std::min(Alignment, 4u);
6011 if (DestTy == MVT::f32)
6012 FudgeInReg = DAG.getLoad(MVT::f32, dl, DAG.getEntryNode(), CPIdx,
6013 PseudoSourceValue::getConstantPool(), 0,
6015 else if (DestTy.bitsGT(MVT::f32))
6016 // FIXME: Avoid the extend by construction the right constantpool?
6017 FudgeInReg = DAG.getExtLoad(ISD::EXTLOAD, dl, DestTy, DAG.getEntryNode(),
6019 PseudoSourceValue::getConstantPool(), 0,
6020 MVT::f32, false, Alignment);
6022 assert(0 && "Unexpected conversion");
6024 MVT SCVT = SignedConv.getValueType();
6025 if (SCVT != DestTy) {
6026 // Destination type needs to be expanded as well. The FADD now we are
6027 // constructing will be expanded into a libcall.
6028 if (SCVT.getSizeInBits() != DestTy.getSizeInBits()) {
6029 assert(SCVT.getSizeInBits() * 2 == DestTy.getSizeInBits());
6030 SignedConv = DAG.getNode(ISD::BUILD_PAIR, dl, DestTy,
6031 SignedConv, SignedConv.getValue(1));
6033 SignedConv = DAG.getNode(ISD::BIT_CONVERT, dl, DestTy, SignedConv);
6035 return DAG.getNode(ISD::FADD, dl, DestTy, SignedConv, FudgeInReg);
6038 // Check to see if the target has a custom way to lower this. If so, use it.
6039 switch (TLI.getOperationAction(ISD::SINT_TO_FP, SourceVT)) {
6040 default: assert(0 && "This action not implemented for this operation!");
6041 case TargetLowering::Legal:
6042 case TargetLowering::Expand:
6043 break; // This case is handled below.
6044 case TargetLowering::Custom: {
6045 SDValue NV = TLI.LowerOperation(DAG.getNode(ISD::SINT_TO_FP, dl, DestTy,
6048 return LegalizeOp(NV);
6049 break; // The target decided this was legal after all
6053 // Expand the source, then glue it back together for the call. We must expand
6054 // the source in case it is shared (this pass of legalize must traverse it).
6056 SDValue SrcLo, SrcHi;
6057 ExpandOp(Source, SrcLo, SrcHi);
6058 Source = DAG.getNode(ISD::BUILD_PAIR, dl, SourceVT, SrcLo, SrcHi);
6061 RTLIB::Libcall LC = isSigned ?
6062 RTLIB::getSINTTOFP(SourceVT, DestTy) :
6063 RTLIB::getUINTTOFP(SourceVT, DestTy);
6064 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unknown int value type");
6066 Source = DAG.getNode(ISD::SINT_TO_FP, dl, DestTy, Source);
6068 SDValue Result = ExpandLibCall(LC, Source.getNode(), isSigned, HiPart);
6069 if (Result.getValueType() != DestTy && HiPart.getNode())
6070 Result = DAG.getNode(ISD::BUILD_PAIR, dl, DestTy, Result, HiPart);
6074 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
6075 /// INT_TO_FP operation of the specified operand when the target requests that
6076 /// we expand it. At this point, we know that the result and operand types are
6077 /// legal for the target.
6078 SDValue SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
6082 if (Op0.getValueType() == MVT::i32) {
6083 // simple 32-bit [signed|unsigned] integer to float/double expansion
6085 // Get the stack frame index of a 8 byte buffer.
6086 SDValue StackSlot = DAG.CreateStackTemporary(MVT::f64);
6088 // word offset constant for Hi/Lo address computation
6089 SDValue WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
6090 // set up Hi and Lo (into buffer) address based on endian
6091 SDValue Hi = StackSlot;
6092 SDValue Lo = DAG.getNode(ISD::ADD, dl,
6093 TLI.getPointerTy(), StackSlot, WordOff);
6094 if (TLI.isLittleEndian())
6097 // if signed map to unsigned space
6100 // constant used to invert sign bit (signed to unsigned mapping)
6101 SDValue SignBit = DAG.getConstant(0x80000000u, MVT::i32);
6102 Op0Mapped = DAG.getNode(ISD::XOR, dl, MVT::i32, Op0, SignBit);
6106 // store the lo of the constructed double - based on integer input
6107 SDValue Store1 = DAG.getStore(DAG.getEntryNode(), dl,
6108 Op0Mapped, Lo, NULL, 0);
6109 // initial hi portion of constructed double
6110 SDValue InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
6111 // store the hi of the constructed double - biased exponent
6112 SDValue Store2=DAG.getStore(Store1, dl, InitialHi, Hi, NULL, 0);
6113 // load the constructed double
6114 SDValue Load = DAG.getLoad(MVT::f64, dl, Store2, StackSlot, NULL, 0);
6115 // FP constant to bias correct the final result
6116 SDValue Bias = DAG.getConstantFP(isSigned ?
6117 BitsToDouble(0x4330000080000000ULL) :
6118 BitsToDouble(0x4330000000000000ULL),
6120 // subtract the bias
6121 SDValue Sub = DAG.getNode(ISD::FSUB, dl, MVT::f64, Load, Bias);
6124 // handle final rounding
6125 if (DestVT == MVT::f64) {
6128 } else if (DestVT.bitsLT(MVT::f64)) {
6129 Result = DAG.getNode(ISD::FP_ROUND, dl, DestVT, Sub,
6130 DAG.getIntPtrConstant(0));
6131 } else if (DestVT.bitsGT(MVT::f64)) {
6132 Result = DAG.getNode(ISD::FP_EXTEND, dl, DestVT, Sub);
6136 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
6137 SDValue Tmp1 = DAG.getNode(ISD::SINT_TO_FP, dl, DestVT, Op0);
6139 SDValue SignSet = DAG.getSetCC(dl, TLI.getSetCCResultType(Op0.getValueType()),
6140 Op0, DAG.getConstant(0, Op0.getValueType()),
6142 SDValue Zero = DAG.getIntPtrConstant(0), Four = DAG.getIntPtrConstant(4);
6143 SDValue CstOffset = DAG.getNode(ISD::SELECT, dl, Zero.getValueType(),
6144 SignSet, Four, Zero);
6146 // If the sign bit of the integer is set, the large number will be treated
6147 // as a negative number. To counteract this, the dynamic code adds an
6148 // offset depending on the data type.
6150 switch (Op0.getValueType().getSimpleVT()) {
6151 default: assert(0 && "Unsupported integer type!");
6152 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
6153 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
6154 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
6155 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
6157 if (TLI.isLittleEndian()) FF <<= 32;
6158 Constant *FudgeFactor = ConstantInt::get(Type::Int64Ty, FF);
6160 SDValue CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
6161 unsigned Alignment = cast<ConstantPoolSDNode>(CPIdx)->getAlignment();
6162 CPIdx = DAG.getNode(ISD::ADD, dl, TLI.getPointerTy(), CPIdx, CstOffset);
6163 Alignment = std::min(Alignment, 4u);
6165 if (DestVT == MVT::f32)
6166 FudgeInReg = DAG.getLoad(MVT::f32, dl, DAG.getEntryNode(), CPIdx,
6167 PseudoSourceValue::getConstantPool(), 0,
6171 LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, dl, DestVT,
6172 DAG.getEntryNode(), CPIdx,
6173 PseudoSourceValue::getConstantPool(), 0,
6174 MVT::f32, false, Alignment));
6177 return DAG.getNode(ISD::FADD, dl, DestVT, Tmp1, FudgeInReg);
6180 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
6181 /// *INT_TO_FP operation of the specified operand when the target requests that
6182 /// we promote it. At this point, we know that the result and operand types are
6183 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
6184 /// operation that takes a larger input.
6185 SDValue SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDValue LegalOp,
6189 // First step, figure out the appropriate *INT_TO_FP operation to use.
6190 MVT NewInTy = LegalOp.getValueType();
6192 unsigned OpToUse = 0;
6194 // Scan for the appropriate larger type to use.
6196 NewInTy = (MVT::SimpleValueType)(NewInTy.getSimpleVT()+1);
6197 assert(NewInTy.isInteger() && "Ran out of possibilities!");
6199 // If the target supports SINT_TO_FP of this type, use it.
6200 switch (TLI.getOperationAction(ISD::SINT_TO_FP, NewInTy)) {
6202 case TargetLowering::Legal:
6203 if (!TLI.isTypeLegal(NewInTy))
6204 break; // Can't use this datatype.
6206 case TargetLowering::Custom:
6207 OpToUse = ISD::SINT_TO_FP;
6211 if (isSigned) continue;
6213 // If the target supports UINT_TO_FP of this type, use it.
6214 switch (TLI.getOperationAction(ISD::UINT_TO_FP, NewInTy)) {
6216 case TargetLowering::Legal:
6217 if (!TLI.isTypeLegal(NewInTy))
6218 break; // Can't use this datatype.
6220 case TargetLowering::Custom:
6221 OpToUse = ISD::UINT_TO_FP;
6226 // Otherwise, try a larger type.
6229 // Okay, we found the operation and type to use. Zero extend our input to the
6230 // desired type then run the operation on it.
6231 return DAG.getNode(OpToUse, dl, DestVT,
6232 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
6233 dl, NewInTy, LegalOp));
6236 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
6237 /// FP_TO_*INT operation of the specified operand when the target requests that
6238 /// we promote it. At this point, we know that the result and operand types are
6239 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
6240 /// operation that returns a larger result.
6241 SDValue SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDValue LegalOp,
6245 // First step, figure out the appropriate FP_TO*INT operation to use.
6246 MVT NewOutTy = DestVT;
6248 unsigned OpToUse = 0;
6250 // Scan for the appropriate larger type to use.
6252 NewOutTy = (MVT::SimpleValueType)(NewOutTy.getSimpleVT()+1);
6253 assert(NewOutTy.isInteger() && "Ran out of possibilities!");
6255 // If the target supports FP_TO_SINT returning this type, use it.
6256 switch (TLI.getOperationAction(ISD::FP_TO_SINT, NewOutTy)) {
6258 case TargetLowering::Legal:
6259 if (!TLI.isTypeLegal(NewOutTy))
6260 break; // Can't use this datatype.
6262 case TargetLowering::Custom:
6263 OpToUse = ISD::FP_TO_SINT;
6268 // If the target supports FP_TO_UINT of this type, use it.
6269 switch (TLI.getOperationAction(ISD::FP_TO_UINT, NewOutTy)) {
6271 case TargetLowering::Legal:
6272 if (!TLI.isTypeLegal(NewOutTy))
6273 break; // Can't use this datatype.
6275 case TargetLowering::Custom:
6276 OpToUse = ISD::FP_TO_UINT;
6281 // Otherwise, try a larger type.
6285 // Okay, we found the operation and type to use.
6286 SDValue Operation = DAG.getNode(OpToUse, dl, NewOutTy, LegalOp);
6288 // If the operation produces an invalid type, it must be custom lowered. Use
6289 // the target lowering hooks to expand it. Just keep the low part of the
6290 // expanded operation, we know that we're truncating anyway.
6291 if (getTypeAction(NewOutTy) == Expand) {
6292 SmallVector<SDValue, 2> Results;
6293 TLI.ReplaceNodeResults(Operation.getNode(), Results, DAG);
6294 assert(Results.size() == 1 && "Incorrect FP_TO_XINT lowering!");
6295 Operation = Results[0];
6298 // Truncate the result of the extended FP_TO_*INT operation to the desired
6300 return DAG.getNode(ISD::TRUNCATE, dl, DestVT, Operation);
6303 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
6305 SDValue SelectionDAGLegalize::ExpandBSWAP(SDValue Op, DebugLoc dl) {
6306 MVT VT = Op.getValueType();
6307 MVT SHVT = TLI.getShiftAmountTy();
6308 SDValue Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
6309 switch (VT.getSimpleVT()) {
6310 default: assert(0 && "Unhandled Expand type in BSWAP!"); abort();
6312 Tmp2 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
6313 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
6314 return DAG.getNode(ISD::OR, dl, VT, Tmp1, Tmp2);
6316 Tmp4 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
6317 Tmp3 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
6318 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
6319 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
6320 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
6321 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(0xFF00, VT));
6322 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
6323 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
6324 return DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
6326 Tmp8 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(56, SHVT));
6327 Tmp7 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(40, SHVT));
6328 Tmp6 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(24, SHVT));
6329 Tmp5 = DAG.getNode(ISD::SHL, dl, VT, Op, DAG.getConstant(8, SHVT));
6330 Tmp4 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(8, SHVT));
6331 Tmp3 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(24, SHVT));
6332 Tmp2 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(40, SHVT));
6333 Tmp1 = DAG.getNode(ISD::SRL, dl, VT, Op, DAG.getConstant(56, SHVT));
6334 Tmp7 = DAG.getNode(ISD::AND, dl, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
6335 Tmp6 = DAG.getNode(ISD::AND, dl, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
6336 Tmp5 = DAG.getNode(ISD::AND, dl, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
6337 Tmp4 = DAG.getNode(ISD::AND, dl, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
6338 Tmp3 = DAG.getNode(ISD::AND, dl, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
6339 Tmp2 = DAG.getNode(ISD::AND, dl, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
6340 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp7);
6341 Tmp6 = DAG.getNode(ISD::OR, dl, VT, Tmp6, Tmp5);
6342 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp3);
6343 Tmp2 = DAG.getNode(ISD::OR, dl, VT, Tmp2, Tmp1);
6344 Tmp8 = DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp6);
6345 Tmp4 = DAG.getNode(ISD::OR, dl, VT, Tmp4, Tmp2);
6346 return DAG.getNode(ISD::OR, dl, VT, Tmp8, Tmp4);
6350 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
6352 SDValue SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDValue Op,
6355 default: assert(0 && "Cannot expand this yet!");
6357 static const uint64_t mask[6] = {
6358 0x5555555555555555ULL, 0x3333333333333333ULL,
6359 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
6360 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
6362 MVT VT = Op.getValueType();
6363 MVT ShVT = TLI.getShiftAmountTy();
6364 unsigned len = VT.getSizeInBits();
6365 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
6366 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
6367 unsigned EltSize = VT.isVector() ?
6368 VT.getVectorElementType().getSizeInBits() : len;
6369 SDValue Tmp2 = DAG.getConstant(APInt(EltSize, mask[i]), VT);
6370 SDValue Tmp3 = DAG.getConstant(1ULL << i, ShVT);
6371 Op = DAG.getNode(ISD::ADD, dl, VT,
6372 DAG.getNode(ISD::AND, dl, VT, Op, Tmp2),
6373 DAG.getNode(ISD::AND, dl, VT,
6374 DAG.getNode(ISD::SRL, dl, VT, Op, Tmp3),
6380 // for now, we do this:
6381 // x = x | (x >> 1);
6382 // x = x | (x >> 2);
6384 // x = x | (x >>16);
6385 // x = x | (x >>32); // for 64-bit input
6386 // return popcount(~x);
6388 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
6389 MVT VT = Op.getValueType();
6390 MVT ShVT = TLI.getShiftAmountTy();
6391 unsigned len = VT.getSizeInBits();
6392 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
6393 SDValue Tmp3 = DAG.getConstant(1ULL << i, ShVT);
6394 Op = DAG.getNode(ISD::OR, dl, VT, Op,
6395 DAG.getNode(ISD::SRL, dl, VT, Op, Tmp3));
6397 Op = DAG.getNOT(dl, Op, VT);
6398 return DAG.getNode(ISD::CTPOP, dl, VT, Op);
6401 // for now, we use: { return popcount(~x & (x - 1)); }
6402 // unless the target has ctlz but not ctpop, in which case we use:
6403 // { return 32 - nlz(~x & (x-1)); }
6404 // see also http://www.hackersdelight.org/HDcode/ntz.cc
6405 MVT VT = Op.getValueType();
6406 SDValue Tmp3 = DAG.getNode(ISD::AND, dl, VT,
6407 DAG.getNOT(dl, Op, VT),
6408 DAG.getNode(ISD::SUB, dl, VT, Op,
6409 DAG.getConstant(1, VT)));
6410 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
6411 if (!TLI.isOperationLegalOrCustom(ISD::CTPOP, VT) &&
6412 TLI.isOperationLegalOrCustom(ISD::CTLZ, VT))
6413 return DAG.getNode(ISD::SUB, dl, VT,
6414 DAG.getConstant(VT.getSizeInBits(), VT),
6415 DAG.getNode(ISD::CTLZ, dl, VT, Tmp3));
6416 return DAG.getNode(ISD::CTPOP, dl, VT, Tmp3);
6421 /// ExpandOp - Expand the specified SDValue into its two component pieces
6422 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the
6423 /// LegalizedNodes map is filled in for any results that are not expanded, the
6424 /// ExpandedNodes map is filled in for any results that are expanded, and the
6425 /// Lo/Hi values are returned.
6426 void SelectionDAGLegalize::ExpandOp(SDValue Op, SDValue &Lo, SDValue &Hi){
6427 MVT VT = Op.getValueType();
6428 MVT NVT = TLI.getTypeToTransformTo(VT);
6429 SDNode *Node = Op.getNode();
6430 DebugLoc dl = Node->getDebugLoc();
6431 assert(getTypeAction(VT) == Expand && "Not an expanded type!");
6432 assert(((NVT.isInteger() && NVT.bitsLT(VT)) || VT.isFloatingPoint() ||
6433 VT.isVector()) && "Cannot expand to FP value or to larger int value!");
6435 // See if we already expanded it.
6436 DenseMap<SDValue, std::pair<SDValue, SDValue> >::iterator I
6437 = ExpandedNodes.find(Op);
6438 if (I != ExpandedNodes.end()) {
6439 Lo = I->second.first;
6440 Hi = I->second.second;
6444 switch (Node->getOpcode()) {
6445 case ISD::CopyFromReg:
6446 assert(0 && "CopyFromReg must be legal!");
6447 case ISD::FP_ROUND_INREG:
6448 if (VT == MVT::ppcf128 &&
6449 TLI.getOperationAction(ISD::FP_ROUND_INREG, VT) ==
6450 TargetLowering::Custom) {
6451 SDValue SrcLo, SrcHi, Src;
6452 ExpandOp(Op.getOperand(0), SrcLo, SrcHi);
6453 Src = DAG.getNode(ISD::BUILD_PAIR, dl, VT, SrcLo, SrcHi);
6455 TLI.LowerOperation(DAG.getNode(ISD::FP_ROUND_INREG, dl, VT, Src,
6456 Op.getOperand(1)), DAG);
6457 assert(Result.getNode()->getOpcode() == ISD::BUILD_PAIR);
6458 Lo = Result.getNode()->getOperand(0);
6459 Hi = Result.getNode()->getOperand(1);
6465 cerr << "NODE: "; Node->dump(&DAG); cerr << "\n";
6467 assert(0 && "Do not know how to expand this operator!");
6469 case ISD::EXTRACT_ELEMENT:
6470 ExpandOp(Node->getOperand(0), Lo, Hi);
6471 if (cast<ConstantSDNode>(Node->getOperand(1))->getZExtValue())
6472 return ExpandOp(Hi, Lo, Hi);
6473 return ExpandOp(Lo, Lo, Hi);
6474 case ISD::EXTRACT_VECTOR_ELT:
6475 // ExpandEXTRACT_VECTOR_ELT tolerates invalid result types.
6476 Lo = ExpandEXTRACT_VECTOR_ELT(Op);
6477 return ExpandOp(Lo, Lo, Hi);
6479 Lo = DAG.getUNDEF(NVT);
6480 Hi = DAG.getUNDEF(NVT);
6482 case ISD::Constant: {
6483 unsigned NVTBits = NVT.getSizeInBits();
6484 const APInt &Cst = cast<ConstantSDNode>(Node)->getAPIntValue();
6485 Lo = DAG.getConstant(APInt(Cst).trunc(NVTBits), NVT);
6486 Hi = DAG.getConstant(Cst.lshr(NVTBits).trunc(NVTBits), NVT);
6489 case ISD::ConstantFP: {
6490 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
6491 if (CFP->getValueType(0) == MVT::ppcf128) {
6492 APInt api = CFP->getValueAPF().bitcastToAPInt();
6493 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &api.getRawData()[1])),
6495 Hi = DAG.getConstantFP(APFloat(APInt(64, 1, &api.getRawData()[0])),
6499 Lo = ExpandConstantFP(CFP, false, DAG, TLI);
6500 if (getTypeAction(Lo.getValueType()) == Expand)
6501 ExpandOp(Lo, Lo, Hi);
6504 case ISD::BUILD_PAIR:
6505 // Return the operands.
6506 Lo = Node->getOperand(0);
6507 Hi = Node->getOperand(1);
6510 case ISD::MERGE_VALUES:
6511 if (Node->getNumValues() == 1) {
6512 ExpandOp(Op.getOperand(0), Lo, Hi);
6515 // FIXME: For now only expand i64,chain = MERGE_VALUES (x, y)
6516 assert(Op.getResNo() == 0 && Node->getNumValues() == 2 &&
6517 Op.getValue(1).getValueType() == MVT::Other &&
6518 "unhandled MERGE_VALUES");
6519 ExpandOp(Op.getOperand(0), Lo, Hi);
6520 // Remember that we legalized the chain.
6521 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Op.getOperand(1)));
6524 case ISD::SIGN_EXTEND_INREG:
6525 ExpandOp(Node->getOperand(0), Lo, Hi);
6526 // sext_inreg the low part if needed.
6527 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, NVT, Lo, Node->getOperand(1));
6529 // The high part gets the sign extension from the lo-part. This handles
6530 // things like sextinreg V:i64 from i8.
6531 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
6532 DAG.getConstant(NVT.getSizeInBits()-1,
6533 TLI.getShiftAmountTy()));
6537 ExpandOp(Node->getOperand(0), Lo, Hi);
6538 SDValue TempLo = DAG.getNode(ISD::BSWAP, dl, NVT, Hi);
6539 Hi = DAG.getNode(ISD::BSWAP, dl, NVT, Lo);
6545 ExpandOp(Node->getOperand(0), Lo, Hi);
6546 Lo = DAG.getNode(ISD::ADD, dl, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L)
6547 DAG.getNode(ISD::CTPOP, dl, NVT, Lo),
6548 DAG.getNode(ISD::CTPOP, dl, NVT, Hi));
6549 Hi = DAG.getConstant(0, NVT);
6553 // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32)
6554 ExpandOp(Node->getOperand(0), Lo, Hi);
6555 SDValue BitsC = DAG.getConstant(NVT.getSizeInBits(), NVT);
6556 SDValue HLZ = DAG.getNode(ISD::CTLZ, dl, NVT, Hi);
6557 SDValue TopNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), HLZ,
6559 SDValue LowPart = DAG.getNode(ISD::CTLZ, dl, NVT, Lo);
6560 LowPart = DAG.getNode(ISD::ADD, dl, NVT, LowPart, BitsC);
6562 Lo = DAG.getNode(ISD::SELECT, dl, NVT, TopNotZero, HLZ, LowPart);
6563 Hi = DAG.getConstant(0, NVT);
6568 // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32)
6569 ExpandOp(Node->getOperand(0), Lo, Hi);
6570 SDValue BitsC = DAG.getConstant(NVT.getSizeInBits(), NVT);
6571 SDValue LTZ = DAG.getNode(ISD::CTTZ, dl, NVT, Lo);
6572 SDValue BotNotZero = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT), LTZ,
6574 SDValue HiPart = DAG.getNode(ISD::CTTZ, dl, NVT, Hi);
6575 HiPart = DAG.getNode(ISD::ADD, dl, NVT, HiPart, BitsC);
6577 Lo = DAG.getNode(ISD::SELECT, dl, NVT, BotNotZero, LTZ, HiPart);
6578 Hi = DAG.getConstant(0, NVT);
6583 SDValue Ch = Node->getOperand(0); // Legalize the chain.
6584 SDValue Ptr = Node->getOperand(1); // Legalize the pointer.
6585 Lo = DAG.getVAArg(NVT, dl, Ch, Ptr, Node->getOperand(2));
6586 Hi = DAG.getVAArg(NVT, dl, Lo.getValue(1), Ptr, Node->getOperand(2));
6588 // Remember that we legalized the chain.
6589 Hi = LegalizeOp(Hi);
6590 AddLegalizedOperand(Op.getValue(1), Hi.getValue(1));
6591 if (TLI.isBigEndian())
6597 LoadSDNode *LD = cast<LoadSDNode>(Node);
6598 SDValue Ch = LD->getChain(); // Legalize the chain.
6599 SDValue Ptr = LD->getBasePtr(); // Legalize the pointer.
6600 ISD::LoadExtType ExtType = LD->getExtensionType();
6601 const Value *SV = LD->getSrcValue();
6602 int SVOffset = LD->getSrcValueOffset();
6603 unsigned Alignment = LD->getAlignment();
6604 bool isVolatile = LD->isVolatile();
6606 if (ExtType == ISD::NON_EXTLOAD) {
6607 Lo = DAG.getLoad(NVT, dl, Ch, Ptr, SV, SVOffset,
6608 isVolatile, Alignment);
6609 if (VT == MVT::f32 || VT == MVT::f64) {
6610 // f32->i32 or f64->i64 one to one expansion.
6611 // Remember that we legalized the chain.
6612 AddLegalizedOperand(SDValue(Node, 1), LegalizeOp(Lo.getValue(1)));
6613 // Recursively expand the new load.
6614 if (getTypeAction(NVT) == Expand)
6615 ExpandOp(Lo, Lo, Hi);
6619 // Increment the pointer to the other half.
6620 unsigned IncrementSize = Lo.getValueType().getSizeInBits()/8;
6621 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
6622 DAG.getIntPtrConstant(IncrementSize));
6623 SVOffset += IncrementSize;
6624 Alignment = MinAlign(Alignment, IncrementSize);
6625 Hi = DAG.getLoad(NVT, dl, Ch, Ptr, SV, SVOffset,
6626 isVolatile, Alignment);
6628 // Build a factor node to remember that this load is independent of the
6630 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
6633 // Remember that we legalized the chain.
6634 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
6635 if (TLI.isBigEndian())
6638 MVT EVT = LD->getMemoryVT();
6640 if ((VT == MVT::f64 && EVT == MVT::f32) ||
6641 (VT == MVT::ppcf128 && (EVT==MVT::f64 || EVT==MVT::f32))) {
6642 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
6643 SDValue Load = DAG.getLoad(EVT, dl, Ch, Ptr, SV,
6644 SVOffset, isVolatile, Alignment);
6645 // Remember that we legalized the chain.
6646 AddLegalizedOperand(SDValue(Node, 1), LegalizeOp(Load.getValue(1)));
6647 ExpandOp(DAG.getNode(ISD::FP_EXTEND, dl, VT, Load), Lo, Hi);
6652 Lo = DAG.getLoad(NVT, dl, Ch, Ptr, SV,
6653 SVOffset, isVolatile, Alignment);
6655 Lo = DAG.getExtLoad(ExtType, dl, NVT, Ch, Ptr, SV,
6656 SVOffset, EVT, isVolatile,
6659 // Remember that we legalized the chain.
6660 AddLegalizedOperand(SDValue(Node, 1), LegalizeOp(Lo.getValue(1)));
6662 if (ExtType == ISD::SEXTLOAD) {
6663 // The high part is obtained by SRA'ing all but one of the bits of the
6665 unsigned LoSize = Lo.getValueType().getSizeInBits();
6666 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
6667 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
6668 } else if (ExtType == ISD::ZEXTLOAD) {
6669 // The high part is just a zero.
6670 Hi = DAG.getConstant(0, NVT);
6671 } else /* if (ExtType == ISD::EXTLOAD) */ {
6672 // The high part is undefined.
6673 Hi = DAG.getUNDEF(NVT);
6680 case ISD::XOR: { // Simple logical operators -> two trivial pieces.
6681 SDValue LL, LH, RL, RH;
6682 ExpandOp(Node->getOperand(0), LL, LH);
6683 ExpandOp(Node->getOperand(1), RL, RH);
6684 Lo = DAG.getNode(Node->getOpcode(), dl, NVT, LL, RL);
6685 Hi = DAG.getNode(Node->getOpcode(), dl, NVT, LH, RH);
6689 SDValue LL, LH, RL, RH;
6690 ExpandOp(Node->getOperand(1), LL, LH);
6691 ExpandOp(Node->getOperand(2), RL, RH);
6692 if (getTypeAction(NVT) == Expand)
6693 NVT = TLI.getTypeToExpandTo(NVT);
6694 Lo = DAG.getNode(ISD::SELECT, dl, NVT, Node->getOperand(0), LL, RL);
6696 Hi = DAG.getNode(ISD::SELECT, dl, NVT, Node->getOperand(0), LH, RH);
6699 case ISD::SELECT_CC: {
6700 SDValue TL, TH, FL, FH;
6701 ExpandOp(Node->getOperand(2), TL, TH);
6702 ExpandOp(Node->getOperand(3), FL, FH);
6703 if (getTypeAction(NVT) == Expand)
6704 NVT = TLI.getTypeToExpandTo(NVT);
6705 Lo = DAG.getNode(ISD::SELECT_CC, dl, NVT, Node->getOperand(0),
6706 Node->getOperand(1), TL, FL, Node->getOperand(4));
6708 Hi = DAG.getNode(ISD::SELECT_CC, dl, NVT, Node->getOperand(0),
6709 Node->getOperand(1), TH, FH, Node->getOperand(4));
6712 case ISD::ANY_EXTEND:
6713 // The low part is any extension of the input (which degenerates to a copy).
6714 Lo = DAG.getNode(ISD::ANY_EXTEND, dl, NVT, Node->getOperand(0));
6715 // The high part is undefined.
6716 Hi = DAG.getUNDEF(NVT);
6718 case ISD::SIGN_EXTEND: {
6719 // The low part is just a sign extension of the input (which degenerates to
6721 Lo = DAG.getNode(ISD::SIGN_EXTEND, dl, NVT, Node->getOperand(0));
6723 // The high part is obtained by SRA'ing all but one of the bits of the lo
6725 unsigned LoSize = Lo.getValueType().getSizeInBits();
6726 Hi = DAG.getNode(ISD::SRA, dl, NVT, Lo,
6727 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
6730 case ISD::ZERO_EXTEND:
6731 // The low part is just a zero extension of the input (which degenerates to
6733 Lo = DAG.getNode(ISD::ZERO_EXTEND, dl, NVT, Node->getOperand(0));
6735 // The high part is just a zero.
6736 Hi = DAG.getConstant(0, NVT);
6739 case ISD::TRUNCATE: {
6740 // The input value must be larger than this value. Expand *it*.
6742 ExpandOp(Node->getOperand(0), NewLo, Hi);
6744 // The low part is now either the right size, or it is closer. If not the
6745 // right size, make an illegal truncate so we recursively expand it.
6746 if (NewLo.getValueType() != Node->getValueType(0))
6747 NewLo = DAG.getNode(ISD::TRUNCATE, dl, Node->getValueType(0), NewLo);
6748 ExpandOp(NewLo, Lo, Hi);
6752 case ISD::BIT_CONVERT: {
6754 if (TLI.getOperationAction(ISD::BIT_CONVERT, VT) == TargetLowering::Custom){
6755 // If the target wants to, allow it to lower this itself.
6756 switch (getTypeAction(Node->getOperand(0).getValueType())) {
6757 case Expand: assert(0 && "cannot expand FP!");
6758 case Legal: Tmp = LegalizeOp(Node->getOperand(0)); break;
6759 case Promote: Tmp = PromoteOp (Node->getOperand(0)); break;
6761 Tmp = TLI.LowerOperation(DAG.getNode(ISD::BIT_CONVERT, dl, VT, Tmp), DAG);
6764 // f32 / f64 must be expanded to i32 / i64.
6765 if (VT == MVT::f32 || VT == MVT::f64) {
6766 Lo = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(0));
6767 if (getTypeAction(NVT) == Expand)
6768 ExpandOp(Lo, Lo, Hi);
6772 // If source operand will be expanded to the same type as VT, i.e.
6773 // i64 <- f64, i32 <- f32, expand the source operand instead.
6774 MVT VT0 = Node->getOperand(0).getValueType();
6775 if (getTypeAction(VT0) == Expand && TLI.getTypeToTransformTo(VT0) == VT) {
6776 ExpandOp(Node->getOperand(0), Lo, Hi);
6780 // Turn this into a load/store pair by default.
6781 if (Tmp.getNode() == 0)
6782 Tmp = EmitStackConvert(Node->getOperand(0), VT, VT, dl);
6784 ExpandOp(Tmp, Lo, Hi);
6788 case ISD::READCYCLECOUNTER: {
6789 assert(TLI.getOperationAction(ISD::READCYCLECOUNTER, VT) ==
6790 TargetLowering::Custom &&
6791 "Must custom expand ReadCycleCounter");
6792 SDValue Tmp = TLI.LowerOperation(Op, DAG);
6793 assert(Tmp.getNode() && "Node must be custom expanded!");
6794 ExpandOp(Tmp.getValue(0), Lo, Hi);
6795 AddLegalizedOperand(SDValue(Node, 1), // Remember we legalized the chain.
6796 LegalizeOp(Tmp.getValue(1)));
6800 case ISD::ATOMIC_CMP_SWAP: {
6801 // This operation does not need a loop.
6802 SDValue Tmp = TLI.LowerOperation(Op, DAG);
6803 assert(Tmp.getNode() && "Node must be custom expanded!");
6804 ExpandOp(Tmp.getValue(0), Lo, Hi);
6805 AddLegalizedOperand(SDValue(Node, 1), // Remember we legalized the chain.
6806 LegalizeOp(Tmp.getValue(1)));
6810 case ISD::ATOMIC_LOAD_ADD:
6811 case ISD::ATOMIC_LOAD_SUB:
6812 case ISD::ATOMIC_LOAD_AND:
6813 case ISD::ATOMIC_LOAD_OR:
6814 case ISD::ATOMIC_LOAD_XOR:
6815 case ISD::ATOMIC_LOAD_NAND:
6816 case ISD::ATOMIC_SWAP: {
6817 // These operations require a loop to be generated. We can't do that yet,
6818 // so substitute a target-dependent pseudo and expand that later.
6819 SDValue In2Lo, In2Hi, In2;
6820 ExpandOp(Op.getOperand(2), In2Lo, In2Hi);
6821 In2 = DAG.getNode(ISD::BUILD_PAIR, dl, VT, In2Lo, In2Hi);
6822 AtomicSDNode* Anode = cast<AtomicSDNode>(Node);
6824 DAG.getAtomic(Op.getOpcode(), dl, Anode->getMemoryVT(),
6825 Op.getOperand(0), Op.getOperand(1), In2,
6826 Anode->getSrcValue(), Anode->getAlignment());
6827 SDValue Result = TLI.LowerOperation(Replace, DAG);
6828 ExpandOp(Result.getValue(0), Lo, Hi);
6829 // Remember that we legalized the chain.
6830 AddLegalizedOperand(SDValue(Node, 1), LegalizeOp(Result.getValue(1)));
6834 // These operators cannot be expanded directly, emit them as calls to
6835 // library functions.
6836 case ISD::FP_TO_SINT: {
6837 if (TLI.getOperationAction(ISD::FP_TO_SINT, VT) == TargetLowering::Custom) {
6839 switch (getTypeAction(Node->getOperand(0).getValueType())) {
6840 case Expand: assert(0 && "cannot expand FP!");
6841 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
6842 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
6845 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_SINT, dl, VT, Op), DAG);
6847 // Now that the custom expander is done, expand the result, which is still
6850 ExpandOp(Op, Lo, Hi);
6855 RTLIB::Libcall LC = RTLIB::getFPTOSINT(Node->getOperand(0).getValueType(),
6857 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected uint-to-fp conversion!");
6858 Lo = ExpandLibCall(LC, Node, false/*sign irrelevant*/, Hi);
6862 case ISD::FP_TO_UINT: {
6863 if (TLI.getOperationAction(ISD::FP_TO_UINT, VT) == TargetLowering::Custom) {
6865 switch (getTypeAction(Node->getOperand(0).getValueType())) {
6866 case Expand: assert(0 && "cannot expand FP!");
6867 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
6868 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
6871 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_UINT, dl, VT, Op), DAG);
6873 // Now that the custom expander is done, expand the result.
6875 ExpandOp(Op, Lo, Hi);
6880 RTLIB::Libcall LC = RTLIB::getFPTOUINT(Node->getOperand(0).getValueType(),
6882 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unexpected fp-to-uint conversion!");
6883 Lo = ExpandLibCall(LC, Node, false/*sign irrelevant*/, Hi);
6888 // If the target wants custom lowering, do so.
6889 SDValue ShiftAmt = LegalizeOp(Node->getOperand(1));
6890 if (TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Custom) {
6891 SDValue Op = DAG.getNode(ISD::SHL, dl, VT, Node->getOperand(0), ShiftAmt);
6892 Op = TLI.LowerOperation(Op, DAG);
6894 // Now that the custom expander is done, expand the result, which is
6896 ExpandOp(Op, Lo, Hi);
6901 // If ADDC/ADDE are supported and if the shift amount is a constant 1, emit
6902 // this X << 1 as X+X.
6903 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(ShiftAmt)) {
6904 if (ShAmt->getAPIntValue() == 1 &&
6905 TLI.isOperationLegalOrCustom(ISD::ADDC, NVT) &&
6906 TLI.isOperationLegalOrCustom(ISD::ADDE, NVT)) {
6907 SDValue LoOps[2], HiOps[3];
6908 ExpandOp(Node->getOperand(0), LoOps[0], HiOps[0]);
6909 SDVTList VTList = DAG.getVTList(LoOps[0].getValueType(), MVT::Flag);
6910 LoOps[1] = LoOps[0];
6911 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
6913 HiOps[1] = HiOps[0];
6914 HiOps[2] = Lo.getValue(1);
6915 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
6920 // If we can emit an efficient shift operation, do so now.
6921 if (ExpandShift(ISD::SHL, Node->getOperand(0), ShiftAmt, Lo, Hi, dl))
6924 // If this target supports SHL_PARTS, use it.
6925 TargetLowering::LegalizeAction Action =
6926 TLI.getOperationAction(ISD::SHL_PARTS, NVT);
6927 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
6928 Action == TargetLowering::Custom) {
6929 ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0),
6930 ShiftAmt, Lo, Hi, dl);
6934 // Otherwise, emit a libcall.
6935 Lo = ExpandLibCall(RTLIB::SHL_I64, Node, false/*left shift=unsigned*/, Hi);
6940 // If the target wants custom lowering, do so.
6941 SDValue ShiftAmt = LegalizeOp(Node->getOperand(1));
6942 if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Custom) {
6943 SDValue Op = DAG.getNode(ISD::SRA, dl, VT, Node->getOperand(0), ShiftAmt);
6944 Op = TLI.LowerOperation(Op, DAG);
6946 // Now that the custom expander is done, expand the result, which is
6948 ExpandOp(Op, Lo, Hi);
6953 // If we can emit an efficient shift operation, do so now.
6954 if (ExpandShift(ISD::SRA, Node->getOperand(0), ShiftAmt, Lo, Hi, dl))
6957 // If this target supports SRA_PARTS, use it.
6958 TargetLowering::LegalizeAction Action =
6959 TLI.getOperationAction(ISD::SRA_PARTS, NVT);
6960 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
6961 Action == TargetLowering::Custom) {
6962 ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0),
6963 ShiftAmt, Lo, Hi, dl);
6967 // Otherwise, emit a libcall.
6968 Lo = ExpandLibCall(RTLIB::SRA_I64, Node, true/*ashr is signed*/, Hi);
6973 // If the target wants custom lowering, do so.
6974 SDValue ShiftAmt = LegalizeOp(Node->getOperand(1));
6975 if (TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Custom) {
6976 SDValue Op = DAG.getNode(ISD::SRL, dl, VT, Node->getOperand(0), ShiftAmt);
6977 Op = TLI.LowerOperation(Op, DAG);
6979 // Now that the custom expander is done, expand the result, which is
6981 ExpandOp(Op, Lo, Hi);
6986 // If we can emit an efficient shift operation, do so now.
6987 if (ExpandShift(ISD::SRL, Node->getOperand(0), ShiftAmt, Lo, Hi, dl))
6990 // If this target supports SRL_PARTS, use it.
6991 TargetLowering::LegalizeAction Action =
6992 TLI.getOperationAction(ISD::SRL_PARTS, NVT);
6993 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
6994 Action == TargetLowering::Custom) {
6995 ExpandShiftParts(ISD::SRL_PARTS,
6996 Node->getOperand(0), ShiftAmt, Lo, Hi, dl);
7000 // Otherwise, emit a libcall.
7001 Lo = ExpandLibCall(RTLIB::SRL_I64, Node, false/*lshr is unsigned*/, Hi);
7007 // If the target wants to custom expand this, let them.
7008 if (TLI.getOperationAction(Node->getOpcode(), VT) ==
7009 TargetLowering::Custom) {
7010 SDValue Result = TLI.LowerOperation(Op, DAG);
7011 if (Result.getNode()) {
7012 ExpandOp(Result, Lo, Hi);
7016 // Expand the subcomponents.
7017 SDValue LHSL, LHSH, RHSL, RHSH;
7018 ExpandOp(Node->getOperand(0), LHSL, LHSH);
7019 ExpandOp(Node->getOperand(1), RHSL, RHSH);
7020 SDValue LoOps[2], HiOps[3];
7026 //cascaded check to see if any smaller size has a a carry flag.
7027 unsigned OpV = Node->getOpcode() == ISD::ADD ? ISD::ADDC : ISD::SUBC;
7028 bool hasCarry = false;
7029 for (unsigned BitSize = NVT.getSizeInBits(); BitSize != 0; BitSize /= 2) {
7030 MVT AVT = MVT::getIntegerVT(BitSize);
7031 if (TLI.isOperationLegalOrCustom(OpV, AVT)) {
7038 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
7039 if (Node->getOpcode() == ISD::ADD) {
7040 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
7041 HiOps[2] = Lo.getValue(1);
7042 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
7044 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
7045 HiOps[2] = Lo.getValue(1);
7046 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
7050 if (Node->getOpcode() == ISD::ADD) {
7051 Lo = DAG.getNode(ISD::ADD, dl, NVT, LoOps, 2);
7052 Hi = DAG.getNode(ISD::ADD, dl, NVT, HiOps, 2);
7053 SDValue Cmp1 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT),
7054 Lo, LoOps[0], ISD::SETULT);
7055 SDValue Carry1 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp1,
7056 DAG.getConstant(1, NVT),
7057 DAG.getConstant(0, NVT));
7058 SDValue Cmp2 = DAG.getSetCC(dl, TLI.getSetCCResultType(NVT),
7059 Lo, LoOps[1], ISD::SETULT);
7060 SDValue Carry2 = DAG.getNode(ISD::SELECT, dl, NVT, Cmp2,
7061 DAG.getConstant(1, NVT),
7063 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, Carry2);
7065 Lo = DAG.getNode(ISD::SUB, dl, NVT, LoOps, 2);
7066 Hi = DAG.getNode(ISD::SUB, dl, NVT, HiOps, 2);
7067 SDValue Cmp = DAG.getSetCC(dl, NVT, LoOps[0], LoOps[1], ISD::SETULT);
7068 SDValue Borrow = DAG.getNode(ISD::SELECT, dl, NVT, Cmp,
7069 DAG.getConstant(1, NVT),
7070 DAG.getConstant(0, NVT));
7071 Hi = DAG.getNode(ISD::SUB, dl, NVT, Hi, Borrow);
7079 // Expand the subcomponents.
7080 SDValue LHSL, LHSH, RHSL, RHSH;
7081 ExpandOp(Node->getOperand(0), LHSL, LHSH);
7082 ExpandOp(Node->getOperand(1), RHSL, RHSH);
7083 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
7084 SDValue LoOps[2] = { LHSL, RHSL };
7085 SDValue HiOps[3] = { LHSH, RHSH };
7087 if (Node->getOpcode() == ISD::ADDC) {
7088 Lo = DAG.getNode(ISD::ADDC, dl, VTList, LoOps, 2);
7089 HiOps[2] = Lo.getValue(1);
7090 Hi = DAG.getNode(ISD::ADDE, dl, VTList, HiOps, 3);
7092 Lo = DAG.getNode(ISD::SUBC, dl, VTList, LoOps, 2);
7093 HiOps[2] = Lo.getValue(1);
7094 Hi = DAG.getNode(ISD::SUBE, dl, VTList, HiOps, 3);
7096 // Remember that we legalized the flag.
7097 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Hi.getValue(1)));
7102 // Expand the subcomponents.
7103 SDValue LHSL, LHSH, RHSL, RHSH;
7104 ExpandOp(Node->getOperand(0), LHSL, LHSH);
7105 ExpandOp(Node->getOperand(1), RHSL, RHSH);
7106 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
7107 SDValue LoOps[3] = { LHSL, RHSL, Node->getOperand(2) };
7108 SDValue HiOps[3] = { LHSH, RHSH };
7110 Lo = DAG.getNode(Node->getOpcode(), dl, VTList, LoOps, 3);
7111 HiOps[2] = Lo.getValue(1);
7112 Hi = DAG.getNode(Node->getOpcode(), dl, VTList, HiOps, 3);
7114 // Remember that we legalized the flag.
7115 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Hi.getValue(1)));
7119 // If the target wants to custom expand this, let them.
7120 if (TLI.getOperationAction(ISD::MUL, VT) == TargetLowering::Custom) {
7121 SDValue New = TLI.LowerOperation(Op, DAG);
7122 if (New.getNode()) {
7123 ExpandOp(New, Lo, Hi);
7128 bool HasMULHS = TLI.isOperationLegalOrCustom(ISD::MULHS, NVT);
7129 bool HasMULHU = TLI.isOperationLegalOrCustom(ISD::MULHU, NVT);
7130 bool HasSMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::SMUL_LOHI, NVT);
7131 bool HasUMUL_LOHI = TLI.isOperationLegalOrCustom(ISD::UMUL_LOHI, NVT);
7132 if (HasMULHU || HasMULHS || HasUMUL_LOHI || HasSMUL_LOHI) {
7133 SDValue LL, LH, RL, RH;
7134 ExpandOp(Node->getOperand(0), LL, LH);
7135 ExpandOp(Node->getOperand(1), RL, RH);
7136 unsigned OuterBitSize = Op.getValueSizeInBits();
7137 unsigned InnerBitSize = RH.getValueSizeInBits();
7138 unsigned LHSSB = DAG.ComputeNumSignBits(Op.getOperand(0));
7139 unsigned RHSSB = DAG.ComputeNumSignBits(Op.getOperand(1));
7140 APInt HighMask = APInt::getHighBitsSet(OuterBitSize, InnerBitSize);
7141 if (DAG.MaskedValueIsZero(Node->getOperand(0), HighMask) &&
7142 DAG.MaskedValueIsZero(Node->getOperand(1), HighMask)) {
7143 // The inputs are both zero-extended.
7145 // We can emit a umul_lohi.
7146 Lo = DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
7147 Hi = SDValue(Lo.getNode(), 1);
7151 // We can emit a mulhu+mul.
7152 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
7153 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
7157 if (LHSSB > InnerBitSize && RHSSB > InnerBitSize) {
7158 // The input values are both sign-extended.
7160 // We can emit a smul_lohi.
7161 Lo = DAG.getNode(ISD::SMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
7162 Hi = SDValue(Lo.getNode(), 1);
7166 // We can emit a mulhs+mul.
7167 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
7168 Hi = DAG.getNode(ISD::MULHS, dl, NVT, LL, RL);
7173 // Lo,Hi = umul LHS, RHS.
7174 SDValue UMulLOHI = DAG.getNode(ISD::UMUL_LOHI, dl,
7175 DAG.getVTList(NVT, NVT), LL, RL);
7177 Hi = UMulLOHI.getValue(1);
7178 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
7179 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
7180 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
7181 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
7185 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
7186 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, RL);
7187 RH = DAG.getNode(ISD::MUL, dl, NVT, LL, RH);
7188 LH = DAG.getNode(ISD::MUL, dl, NVT, LH, RL);
7189 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, RH);
7190 Hi = DAG.getNode(ISD::ADD, dl, NVT, Hi, LH);
7195 // If nothing else, we can make a libcall.
7196 Lo = ExpandLibCall(RTLIB::MUL_I64, Node, false/*sign irrelevant*/, Hi);
7200 Lo = ExpandLibCall(RTLIB::SDIV_I64, Node, true, Hi);
7203 Lo = ExpandLibCall(RTLIB::UDIV_I64, Node, true, Hi);
7206 Lo = ExpandLibCall(RTLIB::SREM_I64, Node, true, Hi);
7209 Lo = ExpandLibCall(RTLIB::UREM_I64, Node, true, Hi);
7213 Lo = ExpandLibCall(GetFPLibCall(VT, RTLIB::ADD_F32,
7216 RTLIB::ADD_PPCF128),
7220 Lo = ExpandLibCall(GetFPLibCall(VT, RTLIB::SUB_F32,
7223 RTLIB::SUB_PPCF128),
7227 Lo = ExpandLibCall(GetFPLibCall(VT, RTLIB::MUL_F32,
7230 RTLIB::MUL_PPCF128),
7234 Lo = ExpandLibCall(GetFPLibCall(VT, RTLIB::DIV_F32,
7237 RTLIB::DIV_PPCF128),
7240 case ISD::FP_EXTEND: {
7241 if (VT == MVT::ppcf128) {
7242 assert(Node->getOperand(0).getValueType()==MVT::f32 ||
7243 Node->getOperand(0).getValueType()==MVT::f64);
7244 const uint64_t zero = 0;
7245 if (Node->getOperand(0).getValueType()==MVT::f32)
7246 Hi = DAG.getNode(ISD::FP_EXTEND, dl, MVT::f64, Node->getOperand(0));
7248 Hi = Node->getOperand(0);
7249 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &zero)), MVT::f64);
7252 RTLIB::Libcall LC = RTLIB::getFPEXT(Node->getOperand(0).getValueType(), VT);
7253 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported FP_EXTEND!");
7254 Lo = ExpandLibCall(LC, Node, true, Hi);
7257 case ISD::FP_ROUND: {
7258 RTLIB::Libcall LC = RTLIB::getFPROUND(Node->getOperand(0).getValueType(),
7260 assert(LC != RTLIB::UNKNOWN_LIBCALL && "Unsupported FP_ROUND!");
7261 Lo = ExpandLibCall(LC, Node, true, Hi);
7276 case ISD::FNEARBYINT:
7279 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
7280 switch(Node->getOpcode()) {
7282 LC = GetFPLibCall(VT, RTLIB::SQRT_F32, RTLIB::SQRT_F64,
7283 RTLIB::SQRT_F80, RTLIB::SQRT_PPCF128);
7286 LC = GetFPLibCall(VT, RTLIB::SIN_F32, RTLIB::SIN_F64,
7287 RTLIB::SIN_F80, RTLIB::SIN_PPCF128);
7290 LC = GetFPLibCall(VT, RTLIB::COS_F32, RTLIB::COS_F64,
7291 RTLIB::COS_F80, RTLIB::COS_PPCF128);
7294 LC = GetFPLibCall(VT, RTLIB::LOG_F32, RTLIB::LOG_F64,
7295 RTLIB::LOG_F80, RTLIB::LOG_PPCF128);
7298 LC = GetFPLibCall(VT, RTLIB::LOG2_F32, RTLIB::LOG2_F64,
7299 RTLIB::LOG2_F80, RTLIB::LOG2_PPCF128);
7302 LC = GetFPLibCall(VT, RTLIB::LOG10_F32, RTLIB::LOG10_F64,
7303 RTLIB::LOG10_F80, RTLIB::LOG10_PPCF128);
7306 LC = GetFPLibCall(VT, RTLIB::EXP_F32, RTLIB::EXP_F64,
7307 RTLIB::EXP_F80, RTLIB::EXP_PPCF128);
7310 LC = GetFPLibCall(VT, RTLIB::EXP2_F32, RTLIB::EXP2_F64,
7311 RTLIB::EXP2_F80, RTLIB::EXP2_PPCF128);
7314 LC = GetFPLibCall(VT, RTLIB::TRUNC_F32, RTLIB::TRUNC_F64,
7315 RTLIB::TRUNC_F80, RTLIB::TRUNC_PPCF128);
7318 LC = GetFPLibCall(VT, RTLIB::FLOOR_F32, RTLIB::FLOOR_F64,
7319 RTLIB::FLOOR_F80, RTLIB::FLOOR_PPCF128);
7322 LC = GetFPLibCall(VT, RTLIB::CEIL_F32, RTLIB::CEIL_F64,
7323 RTLIB::CEIL_F80, RTLIB::CEIL_PPCF128);
7326 LC = GetFPLibCall(VT, RTLIB::RINT_F32, RTLIB::RINT_F64,
7327 RTLIB::RINT_F80, RTLIB::RINT_PPCF128);
7329 case ISD::FNEARBYINT:
7330 LC = GetFPLibCall(VT, RTLIB::NEARBYINT_F32, RTLIB::NEARBYINT_F64,
7331 RTLIB::NEARBYINT_F80, RTLIB::NEARBYINT_PPCF128);
7334 LC = GetFPLibCall(VT, RTLIB::POW_F32, RTLIB::POW_F64, RTLIB::POW_F80,
7335 RTLIB::POW_PPCF128);
7338 LC = GetFPLibCall(VT, RTLIB::POWI_F32, RTLIB::POWI_F64, RTLIB::POWI_F80,
7339 RTLIB::POWI_PPCF128);
7341 default: assert(0 && "Unreachable!");
7343 Lo = ExpandLibCall(LC, Node, false, Hi);
7347 if (VT == MVT::ppcf128) {
7349 ExpandOp(Node->getOperand(0), Lo, Tmp);
7350 Hi = DAG.getNode(ISD::FABS, dl, NVT, Tmp);
7351 // lo = hi==fabs(hi) ? lo : -lo;
7352 Lo = DAG.getNode(ISD::SELECT_CC, dl, NVT, Hi, Tmp,
7353 Lo, DAG.getNode(ISD::FNEG, dl, NVT, Lo),
7354 DAG.getCondCode(ISD::SETEQ));
7357 SDValue Mask = (VT == MVT::f64)
7358 ? DAG.getConstantFP(BitsToDouble(~(1ULL << 63)), VT)
7359 : DAG.getConstantFP(BitsToFloat(~(1U << 31)), VT);
7360 Mask = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Mask);
7361 Lo = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(0));
7362 Lo = DAG.getNode(ISD::AND, dl, NVT, Lo, Mask);
7363 if (getTypeAction(NVT) == Expand)
7364 ExpandOp(Lo, Lo, Hi);
7368 if (VT == MVT::ppcf128) {
7369 ExpandOp(Node->getOperand(0), Lo, Hi);
7370 Lo = DAG.getNode(ISD::FNEG, dl, MVT::f64, Lo);
7371 Hi = DAG.getNode(ISD::FNEG, dl, MVT::f64, Hi);
7374 SDValue Mask = (VT == MVT::f64)
7375 ? DAG.getConstantFP(BitsToDouble(1ULL << 63), VT)
7376 : DAG.getConstantFP(BitsToFloat(1U << 31), VT);
7377 Mask = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Mask);
7378 Lo = DAG.getNode(ISD::BIT_CONVERT, dl, NVT, Node->getOperand(0));
7379 Lo = DAG.getNode(ISD::XOR, dl, NVT, Lo, Mask);
7380 if (getTypeAction(NVT) == Expand)
7381 ExpandOp(Lo, Lo, Hi);
7384 case ISD::FCOPYSIGN: {
7385 Lo = ExpandFCOPYSIGNToBitwiseOps(Node, NVT, DAG, TLI);
7386 if (getTypeAction(NVT) == Expand)
7387 ExpandOp(Lo, Lo, Hi);
7390 case ISD::SINT_TO_FP:
7391 case ISD::UINT_TO_FP: {
7392 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
7393 MVT SrcVT = Node->getOperand(0).getValueType();
7395 // Promote the operand if needed. Do this before checking for
7396 // ppcf128 so conversions of i16 and i8 work.
7397 if (getTypeAction(SrcVT) == Promote) {
7398 SDValue Tmp = PromoteOp(Node->getOperand(0));
7400 ? DAG.getNode(ISD::SIGN_EXTEND_INREG, dl, Tmp.getValueType(), Tmp,
7401 DAG.getValueType(SrcVT))
7402 : DAG.getZeroExtendInReg(Tmp, dl, SrcVT);
7403 Node = DAG.UpdateNodeOperands(Op, Tmp).getNode();
7404 SrcVT = Node->getOperand(0).getValueType();
7407 if (VT == MVT::ppcf128 && SrcVT == MVT::i32) {
7408 static const uint64_t zero = 0;
7410 Hi = LegalizeOp(DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f64,
7411 Node->getOperand(0)));
7412 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &zero)), MVT::f64);
7414 static const uint64_t TwoE32[] = { 0x41f0000000000000LL, 0 };
7415 Hi = LegalizeOp(DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f64,
7416 Node->getOperand(0)));
7417 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &zero)), MVT::f64);
7418 Hi = DAG.getNode(ISD::BUILD_PAIR, dl, VT, Lo, Hi);
7419 // X>=0 ? {(f64)x, 0} : {(f64)x, 0} + 2^32
7420 ExpandOp(DAG.getNode(ISD::SELECT_CC, dl,
7421 MVT::ppcf128, Node->getOperand(0),
7422 DAG.getConstant(0, MVT::i32),
7423 DAG.getNode(ISD::FADD, dl, MVT::ppcf128, Hi,
7425 (APFloat(APInt(128, 2, TwoE32)),
7428 DAG.getCondCode(ISD::SETLT)),
7433 if (VT == MVT::ppcf128 && SrcVT == MVT::i64 && !isSigned) {
7434 // si64->ppcf128 done by libcall, below
7435 static const uint64_t TwoE64[] = { 0x43f0000000000000LL, 0 };
7436 ExpandOp(DAG.getNode(ISD::SINT_TO_FP, dl, MVT::ppcf128,
7437 Node->getOperand(0)), Lo, Hi);
7438 Hi = DAG.getNode(ISD::BUILD_PAIR, dl, VT, Lo, Hi);
7439 // x>=0 ? (ppcf128)(i64)x : (ppcf128)(i64)x + 2^64
7440 ExpandOp(DAG.getNode(ISD::SELECT_CC, dl, MVT::ppcf128,
7441 Node->getOperand(0),
7442 DAG.getConstant(0, MVT::i64),
7443 DAG.getNode(ISD::FADD, dl, MVT::ppcf128, Hi,
7445 (APFloat(APInt(128, 2, TwoE64)),
7448 DAG.getCondCode(ISD::SETLT)),
7453 Lo = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, VT,
7454 Node->getOperand(0), dl);
7455 if (getTypeAction(Lo.getValueType()) == Expand)
7456 // float to i32 etc. can be 'expanded' to a single node.
7457 ExpandOp(Lo, Lo, Hi);
7462 // Make sure the resultant values have been legalized themselves, unless this
7463 // is a type that requires multi-step expansion.
7464 if (getTypeAction(NVT) != Expand && NVT != MVT::isVoid) {
7465 Lo = LegalizeOp(Lo);
7467 // Don't legalize the high part if it is expanded to a single node.
7468 Hi = LegalizeOp(Hi);
7471 // Remember in a map if the values will be reused later.
7473 ExpandedNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
7474 assert(isNew && "Value already expanded?!?");
7478 /// SplitVectorOp - Given an operand of vector type, break it down into
7479 /// two smaller values, still of vector type.
7480 void SelectionDAGLegalize::SplitVectorOp(SDValue Op, SDValue &Lo,
7482 assert(Op.getValueType().isVector() && "Cannot split non-vector type!");
7483 SDNode *Node = Op.getNode();
7484 DebugLoc dl = Node->getDebugLoc();
7485 unsigned NumElements = Op.getValueType().getVectorNumElements();
7486 assert(NumElements > 1 && "Cannot split a single element vector!");
7488 MVT NewEltVT = Op.getValueType().getVectorElementType();
7490 unsigned NewNumElts_Lo = 1 << Log2_32(NumElements-1);
7491 unsigned NewNumElts_Hi = NumElements - NewNumElts_Lo;
7493 MVT NewVT_Lo = MVT::getVectorVT(NewEltVT, NewNumElts_Lo);
7494 MVT NewVT_Hi = MVT::getVectorVT(NewEltVT, NewNumElts_Hi);
7496 // See if we already split it.
7497 std::map<SDValue, std::pair<SDValue, SDValue> >::iterator I
7498 = SplitNodes.find(Op);
7499 if (I != SplitNodes.end()) {
7500 Lo = I->second.first;
7501 Hi = I->second.second;
7505 switch (Node->getOpcode()) {
7510 assert(0 && "Unhandled operation in SplitVectorOp!");
7512 Lo = DAG.getUNDEF(NewVT_Lo);
7513 Hi = DAG.getUNDEF(NewVT_Hi);
7515 case ISD::BUILD_PAIR:
7516 Lo = Node->getOperand(0);
7517 Hi = Node->getOperand(1);
7519 case ISD::INSERT_VECTOR_ELT: {
7520 if (ConstantSDNode *Idx = dyn_cast<ConstantSDNode>(Node->getOperand(2))) {
7521 SplitVectorOp(Node->getOperand(0), Lo, Hi);
7522 unsigned Index = Idx->getZExtValue();
7523 SDValue ScalarOp = Node->getOperand(1);
7524 if (Index < NewNumElts_Lo)
7525 Lo = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, NewVT_Lo, Lo, ScalarOp,
7526 DAG.getIntPtrConstant(Index));
7528 Hi = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, NewVT_Hi, Hi, ScalarOp,
7529 DAG.getIntPtrConstant(Index - NewNumElts_Lo));
7532 SDValue Tmp = PerformInsertVectorEltInMemory(Node->getOperand(0),
7533 Node->getOperand(1),
7534 Node->getOperand(2), dl);
7535 SplitVectorOp(Tmp, Lo, Hi);
7538 case ISD::VECTOR_SHUFFLE: {
7539 // Build the low part.
7540 SDValue Mask = Node->getOperand(2);
7541 SmallVector<SDValue, 8> Ops;
7542 MVT PtrVT = TLI.getPointerTy();
7544 // Insert all of the elements from the input that are needed. We use
7545 // buildvector of extractelement here because the input vectors will have
7546 // to be legalized, so this makes the code simpler.
7547 for (unsigned i = 0; i != NewNumElts_Lo; ++i) {
7548 SDValue IdxNode = Mask.getOperand(i);
7549 if (IdxNode.getOpcode() == ISD::UNDEF) {
7550 Ops.push_back(DAG.getUNDEF(NewEltVT));
7553 unsigned Idx = cast<ConstantSDNode>(IdxNode)->getZExtValue();
7554 SDValue InVec = Node->getOperand(0);
7555 if (Idx >= NumElements) {
7556 InVec = Node->getOperand(1);
7559 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NewEltVT, InVec,
7560 DAG.getConstant(Idx, PtrVT)));
7562 Lo = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT_Lo, &Ops[0], Ops.size());
7565 for (unsigned i = NewNumElts_Lo; i != NumElements; ++i) {
7566 SDValue IdxNode = Mask.getOperand(i);
7567 if (IdxNode.getOpcode() == ISD::UNDEF) {
7568 Ops.push_back(DAG.getUNDEF(NewEltVT));
7571 unsigned Idx = cast<ConstantSDNode>(IdxNode)->getZExtValue();
7572 SDValue InVec = Node->getOperand(0);
7573 if (Idx >= NumElements) {
7574 InVec = Node->getOperand(1);
7577 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NewEltVT, InVec,
7578 DAG.getConstant(Idx, PtrVT)));
7580 Hi = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT_Hi, &Ops[0], Ops.size());
7583 case ISD::BUILD_VECTOR: {
7584 SmallVector<SDValue, 8> LoOps(Node->op_begin(),
7585 Node->op_begin()+NewNumElts_Lo);
7586 Lo = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT_Lo, &LoOps[0], LoOps.size());
7588 SmallVector<SDValue, 8> HiOps(Node->op_begin()+NewNumElts_Lo,
7590 Hi = DAG.getNode(ISD::BUILD_VECTOR, dl, NewVT_Hi, &HiOps[0], HiOps.size());
7593 case ISD::CONCAT_VECTORS: {
7594 // FIXME: Handle non-power-of-two vectors?
7595 unsigned NewNumSubvectors = Node->getNumOperands() / 2;
7596 if (NewNumSubvectors == 1) {
7597 Lo = Node->getOperand(0);
7598 Hi = Node->getOperand(1);
7600 SmallVector<SDValue, 8> LoOps(Node->op_begin(),
7601 Node->op_begin()+NewNumSubvectors);
7602 Lo = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewVT_Lo,
7603 &LoOps[0], LoOps.size());
7605 SmallVector<SDValue, 8> HiOps(Node->op_begin()+NewNumSubvectors,
7607 Hi = DAG.getNode(ISD::CONCAT_VECTORS, dl, NewVT_Hi,
7608 &HiOps[0], HiOps.size());
7612 case ISD::EXTRACT_SUBVECTOR: {
7613 SDValue Vec = Op.getOperand(0);
7614 SDValue Idx = Op.getOperand(1);
7615 MVT IdxVT = Idx.getValueType();
7617 Lo = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, NewVT_Lo, Vec, Idx);
7618 ConstantSDNode *CIdx = dyn_cast<ConstantSDNode>(Idx);
7620 Hi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, NewVT_Hi, Vec,
7621 DAG.getConstant(CIdx->getZExtValue() + NewNumElts_Lo,
7624 Idx = DAG.getNode(ISD::ADD, dl, IdxVT, Idx,
7625 DAG.getConstant(NewNumElts_Lo, IdxVT));
7626 Hi = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, NewVT_Hi, Vec, Idx);
7631 SDValue Cond = Node->getOperand(0);
7633 SDValue LL, LH, RL, RH;
7634 SplitVectorOp(Node->getOperand(1), LL, LH);
7635 SplitVectorOp(Node->getOperand(2), RL, RH);
7637 if (Cond.getValueType().isVector()) {
7638 // Handle a vector merge.
7640 SplitVectorOp(Cond, CL, CH);
7641 Lo = DAG.getNode(Node->getOpcode(), dl, NewVT_Lo, CL, LL, RL);
7642 Hi = DAG.getNode(Node->getOpcode(), dl, NewVT_Hi, CH, LH, RH);
7644 // Handle a simple select with vector operands.
7645 Lo = DAG.getNode(Node->getOpcode(), dl, NewVT_Lo, Cond, LL, RL);
7646 Hi = DAG.getNode(Node->getOpcode(), dl, NewVT_Hi, Cond, LH, RH);
7650 case ISD::SELECT_CC: {
7651 SDValue CondLHS = Node->getOperand(0);
7652 SDValue CondRHS = Node->getOperand(1);
7653 SDValue CondCode = Node->getOperand(4);
7655 SDValue LL, LH, RL, RH;
7656 SplitVectorOp(Node->getOperand(2), LL, LH);
7657 SplitVectorOp(Node->getOperand(3), RL, RH);
7659 // Handle a simple select with vector operands.
7660 Lo = DAG.getNode(ISD::SELECT_CC, dl, NewVT_Lo, CondLHS, CondRHS,
7662 Hi = DAG.getNode(ISD::SELECT_CC, dl, NewVT_Hi, CondLHS, CondRHS,
7667 SDValue LL, LH, RL, RH;
7668 SplitVectorOp(Node->getOperand(0), LL, LH);
7669 SplitVectorOp(Node->getOperand(1), RL, RH);
7670 Lo = DAG.getNode(ISD::VSETCC, dl, NewVT_Lo, LL, RL, Node->getOperand(2));
7671 Hi = DAG.getNode(ISD::VSETCC, dl, NewVT_Hi, LH, RH, Node->getOperand(2));
7693 SDValue LL, LH, RL, RH;
7694 SplitVectorOp(Node->getOperand(0), LL, LH);
7695 SplitVectorOp(Node->getOperand(1), RL, RH);
7697 Lo = DAG.getNode(Node->getOpcode(), dl, NewVT_Lo, LL, RL);
7698 Hi = DAG.getNode(Node->getOpcode(), dl, NewVT_Hi, LH, RH);
7704 SplitVectorOp(Node->getOperand(0), L, H);
7706 Lo = DAG.getNode(Node->getOpcode(), dl, NewVT_Lo, L, Node->getOperand(1));
7707 Hi = DAG.getNode(Node->getOpcode(), dl, NewVT_Hi, H, Node->getOperand(1));
7723 case ISD::FP_TO_SINT:
7724 case ISD::FP_TO_UINT:
7725 case ISD::SINT_TO_FP:
7726 case ISD::UINT_TO_FP:
7728 case ISD::ANY_EXTEND:
7729 case ISD::SIGN_EXTEND:
7730 case ISD::ZERO_EXTEND:
7731 case ISD::FP_EXTEND: {
7733 SplitVectorOp(Node->getOperand(0), L, H);
7735 Lo = DAG.getNode(Node->getOpcode(), dl, NewVT_Lo, L);
7736 Hi = DAG.getNode(Node->getOpcode(), dl, NewVT_Hi, H);
7739 case ISD::CONVERT_RNDSAT: {
7740 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(Node)->getCvtCode();
7742 SplitVectorOp(Node->getOperand(0), L, H);
7743 SDValue DTyOpL = DAG.getValueType(NewVT_Lo);
7744 SDValue DTyOpH = DAG.getValueType(NewVT_Hi);
7745 SDValue STyOpL = DAG.getValueType(L.getValueType());
7746 SDValue STyOpH = DAG.getValueType(H.getValueType());
7748 SDValue RndOp = Node->getOperand(3);
7749 SDValue SatOp = Node->getOperand(4);
7751 Lo = DAG.getConvertRndSat(NewVT_Lo, dl, L, DTyOpL, STyOpL,
7752 RndOp, SatOp, CvtCode);
7753 Hi = DAG.getConvertRndSat(NewVT_Hi, dl, H, DTyOpH, STyOpH,
7754 RndOp, SatOp, CvtCode);
7758 LoadSDNode *LD = cast<LoadSDNode>(Node);
7759 SDValue Ch = LD->getChain();
7760 SDValue Ptr = LD->getBasePtr();
7761 ISD::LoadExtType ExtType = LD->getExtensionType();
7762 const Value *SV = LD->getSrcValue();
7763 int SVOffset = LD->getSrcValueOffset();
7764 MVT MemoryVT = LD->getMemoryVT();
7765 unsigned Alignment = LD->getAlignment();
7766 bool isVolatile = LD->isVolatile();
7768 assert(LD->isUnindexed() && "Indexed vector loads are not supported yet!");
7769 SDValue Offset = DAG.getUNDEF(Ptr.getValueType());
7771 MVT MemNewEltVT = MemoryVT.getVectorElementType();
7772 MVT MemNewVT_Lo = MVT::getVectorVT(MemNewEltVT, NewNumElts_Lo);
7773 MVT MemNewVT_Hi = MVT::getVectorVT(MemNewEltVT, NewNumElts_Hi);
7775 Lo = DAG.getLoad(ISD::UNINDEXED, dl, ExtType,
7776 NewVT_Lo, Ch, Ptr, Offset,
7777 SV, SVOffset, MemNewVT_Lo, isVolatile, Alignment);
7778 unsigned IncrementSize = NewNumElts_Lo * MemNewEltVT.getSizeInBits()/8;
7779 Ptr = DAG.getNode(ISD::ADD, dl, Ptr.getValueType(), Ptr,
7780 DAG.getIntPtrConstant(IncrementSize));
7781 SVOffset += IncrementSize;
7782 Alignment = MinAlign(Alignment, IncrementSize);
7783 Hi = DAG.getLoad(ISD::UNINDEXED, dl, ExtType,
7784 NewVT_Hi, Ch, Ptr, Offset,
7785 SV, SVOffset, MemNewVT_Hi, isVolatile, Alignment);
7787 // Build a factor node to remember that this load is independent of the
7789 SDValue TF = DAG.getNode(ISD::TokenFactor, dl, MVT::Other, Lo.getValue(1),
7792 // Remember that we legalized the chain.
7793 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
7796 case ISD::BIT_CONVERT: {
7797 // We know the result is a vector. The input may be either a vector or a
7799 SDValue InOp = Node->getOperand(0);
7800 if (!InOp.getValueType().isVector() ||
7801 InOp.getValueType().getVectorNumElements() == 1) {
7802 // The input is a scalar or single-element vector.
7803 // Lower to a store/load so that it can be split.
7804 // FIXME: this could be improved probably.
7805 unsigned LdAlign = TLI.getTargetData()->
7806 getPrefTypeAlignment(Op.getValueType().getTypeForMVT());
7807 SDValue Ptr = DAG.CreateStackTemporary(InOp.getValueType(), LdAlign);
7808 int FI = cast<FrameIndexSDNode>(Ptr.getNode())->getIndex();
7810 SDValue St = DAG.getStore(DAG.getEntryNode(), dl,
7812 PseudoSourceValue::getFixedStack(FI), 0);
7813 InOp = DAG.getLoad(Op.getValueType(), dl, St, Ptr,
7814 PseudoSourceValue::getFixedStack(FI), 0);
7816 // Split the vector and convert each of the pieces now.
7817 SplitVectorOp(InOp, Lo, Hi);
7818 Lo = DAG.getNode(ISD::BIT_CONVERT, dl, NewVT_Lo, Lo);
7819 Hi = DAG.getNode(ISD::BIT_CONVERT, dl, NewVT_Hi, Hi);
7824 // Remember in a map if the values will be reused later.
7826 SplitNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
7827 assert(isNew && "Value already split?!?");
7832 /// ScalarizeVectorOp - Given an operand of single-element vector type
7833 /// (e.g. v1f32), convert it into the equivalent operation that returns a
7834 /// scalar (e.g. f32) value.
7835 SDValue SelectionDAGLegalize::ScalarizeVectorOp(SDValue Op) {
7836 assert(Op.getValueType().isVector() && "Bad ScalarizeVectorOp invocation!");
7837 SDNode *Node = Op.getNode();
7838 DebugLoc dl = Node->getDebugLoc();
7839 MVT NewVT = Op.getValueType().getVectorElementType();
7840 assert(Op.getValueType().getVectorNumElements() == 1);
7842 // See if we already scalarized it.
7843 std::map<SDValue, SDValue>::iterator I = ScalarizedNodes.find(Op);
7844 if (I != ScalarizedNodes.end()) return I->second;
7847 switch (Node->getOpcode()) {
7850 Node->dump(&DAG); cerr << "\n";
7852 assert(0 && "Unknown vector operation in ScalarizeVectorOp!");
7869 Result = DAG.getNode(Node->getOpcode(), dl,
7871 ScalarizeVectorOp(Node->getOperand(0)),
7872 ScalarizeVectorOp(Node->getOperand(1)));
7884 case ISD::FP_TO_SINT:
7885 case ISD::FP_TO_UINT:
7886 case ISD::SINT_TO_FP:
7887 case ISD::UINT_TO_FP:
7888 case ISD::SIGN_EXTEND:
7889 case ISD::ZERO_EXTEND:
7890 case ISD::ANY_EXTEND:
7892 case ISD::FP_EXTEND:
7893 Result = DAG.getNode(Node->getOpcode(), dl,
7895 ScalarizeVectorOp(Node->getOperand(0)));
7897 case ISD::CONVERT_RNDSAT: {
7898 SDValue Op0 = ScalarizeVectorOp(Node->getOperand(0));
7899 Result = DAG.getConvertRndSat(NewVT, dl, Op0,
7900 DAG.getValueType(NewVT),
7901 DAG.getValueType(Op0.getValueType()),
7902 Node->getOperand(3),
7903 Node->getOperand(4),
7904 cast<CvtRndSatSDNode>(Node)->getCvtCode());
7909 Result = DAG.getNode(Node->getOpcode(), dl,
7911 ScalarizeVectorOp(Node->getOperand(0)),
7912 Node->getOperand(1));
7915 LoadSDNode *LD = cast<LoadSDNode>(Node);
7916 SDValue Ch = LegalizeOp(LD->getChain()); // Legalize the chain.
7917 SDValue Ptr = LegalizeOp(LD->getBasePtr()); // Legalize the pointer.
7918 ISD::LoadExtType ExtType = LD->getExtensionType();
7919 const Value *SV = LD->getSrcValue();
7920 int SVOffset = LD->getSrcValueOffset();
7921 MVT MemoryVT = LD->getMemoryVT();
7922 unsigned Alignment = LD->getAlignment();
7923 bool isVolatile = LD->isVolatile();
7925 assert(LD->isUnindexed() && "Indexed vector loads are not supported yet!");
7926 SDValue Offset = DAG.getUNDEF(Ptr.getValueType());
7928 Result = DAG.getLoad(ISD::UNINDEXED, dl, ExtType,
7929 NewVT, Ch, Ptr, Offset, SV, SVOffset,
7930 MemoryVT.getVectorElementType(),
7931 isVolatile, Alignment);
7933 // Remember that we legalized the chain.
7934 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
7937 case ISD::BUILD_VECTOR:
7938 Result = Node->getOperand(0);
7940 case ISD::INSERT_VECTOR_ELT:
7941 // Returning the inserted scalar element.
7942 Result = Node->getOperand(1);
7944 case ISD::CONCAT_VECTORS:
7945 assert(Node->getOperand(0).getValueType() == NewVT &&
7946 "Concat of non-legal vectors not yet supported!");
7947 Result = Node->getOperand(0);
7949 case ISD::VECTOR_SHUFFLE: {
7950 // Figure out if the scalar is the LHS or RHS and return it.
7951 SDValue EltNum = Node->getOperand(2).getOperand(0);
7952 if (cast<ConstantSDNode>(EltNum)->getZExtValue())
7953 Result = ScalarizeVectorOp(Node->getOperand(1));
7955 Result = ScalarizeVectorOp(Node->getOperand(0));
7958 case ISD::EXTRACT_SUBVECTOR:
7959 Result = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, NewVT,
7960 Node->getOperand(0), Node->getOperand(1));
7962 case ISD::BIT_CONVERT: {
7963 SDValue Op0 = Op.getOperand(0);
7964 if (Op0.getValueType().isVector() &&
7965 Op0.getValueType().getVectorNumElements() == 1)
7966 Op0 = ScalarizeVectorOp(Op0);
7967 Result = DAG.getNode(ISD::BIT_CONVERT, dl, NewVT, Op0);
7971 Result = DAG.getNode(ISD::SELECT, dl, NewVT, Op.getOperand(0),
7972 ScalarizeVectorOp(Op.getOperand(1)),
7973 ScalarizeVectorOp(Op.getOperand(2)));
7975 case ISD::SELECT_CC:
7976 Result = DAG.getNode(ISD::SELECT_CC, dl, NewVT, Node->getOperand(0),
7977 Node->getOperand(1),
7978 ScalarizeVectorOp(Op.getOperand(2)),
7979 ScalarizeVectorOp(Op.getOperand(3)),
7980 Node->getOperand(4));
7983 SDValue Op0 = ScalarizeVectorOp(Op.getOperand(0));
7984 SDValue Op1 = ScalarizeVectorOp(Op.getOperand(1));
7985 Result = DAG.getNode(ISD::SETCC, dl,
7986 TLI.getSetCCResultType(Op0.getValueType()),
7987 Op0, Op1, Op.getOperand(2));
7988 Result = DAG.getNode(ISD::SELECT, dl, NewVT, Result,
7989 DAG.getConstant(-1ULL, NewVT),
7990 DAG.getConstant(0ULL, NewVT));
7995 if (TLI.isTypeLegal(NewVT))
7996 Result = LegalizeOp(Result);
7997 bool isNew = ScalarizedNodes.insert(std::make_pair(Op, Result)).second;
7998 assert(isNew && "Value already scalarized?");
8004 SDValue SelectionDAGLegalize::WidenVectorOp(SDValue Op, MVT WidenVT) {
8005 std::map<SDValue, SDValue>::iterator I = WidenNodes.find(Op);
8006 if (I != WidenNodes.end()) return I->second;
8008 MVT VT = Op.getValueType();
8009 assert(VT.isVector() && "Cannot widen non-vector type!");
8012 SDNode *Node = Op.getNode();
8013 DebugLoc dl = Node->getDebugLoc();
8014 MVT EVT = VT.getVectorElementType();
8016 unsigned NumElts = VT.getVectorNumElements();
8017 unsigned NewNumElts = WidenVT.getVectorNumElements();
8018 assert(NewNumElts > NumElts && "Cannot widen to smaller type!");
8019 assert(NewNumElts < 17);
8021 // When widen is called, it is assumed that it is more efficient to use a
8022 // wide type. The default action is to widen to operation to a wider legal
8023 // vector type and then do the operation if it is legal by calling LegalizeOp
8024 // again. If there is no vector equivalent, we will unroll the operation, do
8025 // it, and rebuild the vector. If most of the operations are vectorizible to
8026 // the legal type, the resulting code will be more efficient. If this is not
8027 // the case, the resulting code will preform badly as we end up generating
8028 // code to pack/unpack the results. It is the function that calls widen
8029 // that is responsible for seeing this doesn't happen.
8030 switch (Node->getOpcode()) {
8035 assert(0 && "Unexpected operation in WidenVectorOp!");
8037 case ISD::CopyFromReg:
8038 assert(0 && "CopyFromReg doesn't need widening!");
8040 case ISD::ConstantFP:
8041 // To build a vector of these elements, clients should call BuildVector
8042 // and with each element instead of creating a node with a vector type
8043 assert(0 && "Unexpected operation in WidenVectorOp!");
8045 // Variable Arguments with vector types doesn't make any sense to me
8046 assert(0 && "Unexpected operation in WidenVectorOp!");
8049 Result = DAG.getUNDEF(WidenVT);
8051 case ISD::BUILD_VECTOR: {
8052 // Build a vector with undefined for the new nodes
8053 SDValueVector NewOps(Node->op_begin(), Node->op_end());
8054 for (unsigned i = NumElts; i < NewNumElts; ++i) {
8055 NewOps.push_back(DAG.getUNDEF(EVT));
8057 Result = DAG.getNode(ISD::BUILD_VECTOR, dl, WidenVT,
8058 &NewOps[0], NewOps.size());
8061 case ISD::INSERT_VECTOR_ELT: {
8062 SDValue Tmp1 = WidenVectorOp(Node->getOperand(0), WidenVT);
8063 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, WidenVT, Tmp1,
8064 Node->getOperand(1), Node->getOperand(2));
8067 case ISD::VECTOR_SHUFFLE: {
8068 SDValue Tmp1 = WidenVectorOp(Node->getOperand(0), WidenVT);
8069 SDValue Tmp2 = WidenVectorOp(Node->getOperand(1), WidenVT);
8070 ShuffleVectorSDNode *SVOp = cast<ShuffleVectorSDNode>(Node);
8071 SmallVector<int, 8> NewMask;
8072 for (unsigned i = 0; i < NumElts; ++i) {
8073 int Idx = SVOp->getMaskElt(i);
8074 if (Idx < (int)NumElts)
8075 NewMask.push_back(Idx);
8077 NewMask.push_back(Idx + NewNumElts - NumElts);
8079 for (unsigned i = NumElts; i < NewNumElts; ++i)
8080 NewMask.push_back(-1);
8082 Result = DAG.getVectorShuffle(WidenVT, dl, Tmp1, Tmp2, &NewMask[0]);
8086 // If the load widen returns true, we can use a single load for the
8087 // vector. Otherwise, it is returning a token factor for multiple
8090 if (LoadWidenVectorOp(Result, TFOp, Op, WidenVT))
8091 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TFOp.getValue(1)));
8093 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TFOp.getValue(0)));
8097 case ISD::BIT_CONVERT: {
8098 SDValue Tmp1 = Node->getOperand(0);
8099 // Converts between two different types so we need to determine
8100 // the correct widen type for the input operand.
8101 MVT InVT = Tmp1.getValueType();
8102 unsigned WidenSize = WidenVT.getSizeInBits();
8103 if (InVT.isVector()) {
8104 MVT InEltVT = InVT.getVectorElementType();
8105 unsigned InEltSize = InEltVT.getSizeInBits();
8106 assert(WidenSize % InEltSize == 0 &&
8107 "can not widen bit convert that are not multiple of element type");
8108 MVT NewInWidenVT = MVT::getVectorVT(InEltVT, WidenSize / InEltSize);
8109 Tmp1 = WidenVectorOp(Tmp1, NewInWidenVT);
8110 assert(Tmp1.getValueType().getSizeInBits() == WidenVT.getSizeInBits());
8111 Result = DAG.getNode(ISD::BIT_CONVERT, dl, WidenVT, Tmp1);
8113 // If the result size is a multiple of the input size, widen the input
8114 // and then convert.
8115 unsigned InSize = InVT.getSizeInBits();
8116 assert(WidenSize % InSize == 0 &&
8117 "can not widen bit convert that are not multiple of element type");
8118 unsigned NewNumElts = WidenSize / InSize;
8119 SmallVector<SDValue, 16> Ops(NewNumElts);
8120 SDValue UndefVal = DAG.getUNDEF(InVT);
8122 for (unsigned i = 1; i < NewNumElts; ++i)
8125 MVT NewInVT = MVT::getVectorVT(InVT, NewNumElts);
8126 Result = DAG.getNode(ISD::BUILD_VECTOR, dl, NewInVT, &Ops[0], NewNumElts);
8127 Result = DAG.getNode(ISD::BIT_CONVERT, dl, WidenVT, Result);
8132 case ISD::SINT_TO_FP:
8133 case ISD::UINT_TO_FP:
8134 case ISD::FP_TO_SINT:
8135 case ISD::FP_TO_UINT:
8136 case ISD::FP_ROUND: {
8137 SDValue Tmp1 = Node->getOperand(0);
8138 // Converts between two different types so we need to determine
8139 // the correct widen type for the input operand.
8140 MVT TVT = Tmp1.getValueType();
8141 assert(TVT.isVector() && "can not widen non vector type");
8142 MVT TEVT = TVT.getVectorElementType();
8143 MVT TWidenVT = MVT::getVectorVT(TEVT, NewNumElts);
8144 Tmp1 = WidenVectorOp(Tmp1, TWidenVT);
8145 assert(Tmp1.getValueType().getVectorNumElements() == NewNumElts);
8146 Result = DAG.getNode(Node->getOpcode(), dl, WidenVT, Tmp1);
8150 case ISD::FP_EXTEND:
8151 assert(0 && "Case not implemented. Dynamically dead with 2 FP types!");
8153 case ISD::SIGN_EXTEND:
8154 case ISD::ZERO_EXTEND:
8155 case ISD::ANY_EXTEND:
8156 case ISD::SIGN_EXTEND_INREG:
8165 // Unary op widening
8167 Tmp1 = WidenVectorOp(Node->getOperand(0), WidenVT);
8168 assert(Tmp1.getValueType() == WidenVT);
8169 Result = DAG.getNode(Node->getOpcode(), dl, WidenVT, Tmp1);
8172 case ISD::CONVERT_RNDSAT: {
8173 SDValue RndOp = Node->getOperand(3);
8174 SDValue SatOp = Node->getOperand(4);
8175 SDValue SrcOp = Node->getOperand(0);
8177 // Converts between two different types so we need to determine
8178 // the correct widen type for the input operand.
8179 MVT SVT = SrcOp.getValueType();
8180 assert(SVT.isVector() && "can not widen non vector type");
8181 MVT SEVT = SVT.getVectorElementType();
8182 MVT SWidenVT = MVT::getVectorVT(SEVT, NewNumElts);
8184 SrcOp = WidenVectorOp(SrcOp, SWidenVT);
8185 assert(SrcOp.getValueType() == WidenVT);
8186 SDValue DTyOp = DAG.getValueType(WidenVT);
8187 SDValue STyOp = DAG.getValueType(SrcOp.getValueType());
8188 ISD::CvtCode CvtCode = cast<CvtRndSatSDNode>(Node)->getCvtCode();
8190 Result = DAG.getConvertRndSat(WidenVT, dl, SrcOp, DTyOp, STyOp,
8191 RndOp, SatOp, CvtCode);
8211 case ISD::FCOPYSIGN:
8215 // Binary op widening
8216 SDValue Tmp1 = WidenVectorOp(Node->getOperand(0), WidenVT);
8217 SDValue Tmp2 = WidenVectorOp(Node->getOperand(1), WidenVT);
8218 assert(Tmp1.getValueType() == WidenVT && Tmp2.getValueType() == WidenVT);
8219 Result = DAG.getNode(Node->getOpcode(), dl, WidenVT, Tmp1, Tmp2);
8226 SDValue Tmp1 = WidenVectorOp(Node->getOperand(0), WidenVT);
8227 assert(Tmp1.getValueType() == WidenVT);
8228 SDValue ShOp = Node->getOperand(1);
8229 MVT ShVT = ShOp.getValueType();
8230 MVT NewShVT = MVT::getVectorVT(ShVT.getVectorElementType(),
8231 WidenVT.getVectorNumElements());
8232 ShOp = WidenVectorOp(ShOp, NewShVT);
8233 assert(ShOp.getValueType() == NewShVT);
8234 Result = DAG.getNode(Node->getOpcode(), dl, WidenVT, Tmp1, ShOp);
8238 case ISD::EXTRACT_VECTOR_ELT: {
8239 SDValue Tmp1 = WidenVectorOp(Node->getOperand(0), WidenVT);
8240 assert(Tmp1.getValueType() == WidenVT);
8241 Result = DAG.getNode(Node->getOpcode(), dl, EVT, Tmp1, Node->getOperand(1));
8244 case ISD::CONCAT_VECTORS: {
8245 // We concurrently support only widen on a multiple of the incoming vector.
8246 // We could widen on a multiple of the incoming operand if necessary.
8247 unsigned NumConcat = NewNumElts / NumElts;
8248 assert(NewNumElts % NumElts == 0 && "Can widen only a multiple of vector");
8249 SDValue UndefVal = DAG.getUNDEF(VT);
8250 SmallVector<SDValue, 8> MOps;
8252 for (unsigned i = 1; i != NumConcat; ++i) {
8253 MOps.push_back(UndefVal);
8255 Result = LegalizeOp(DAG.getNode(ISD::CONCAT_VECTORS, dl, WidenVT,
8256 &MOps[0], MOps.size()));
8259 case ISD::EXTRACT_SUBVECTOR: {
8260 SDValue Tmp1 = Node->getOperand(0);
8261 SDValue Idx = Node->getOperand(1);
8262 ConstantSDNode *CIdx = dyn_cast<ConstantSDNode>(Idx);
8263 if (CIdx && CIdx->getZExtValue() == 0) {
8264 // Since we are access the start of the vector, the incoming
8265 // vector type might be the proper.
8266 MVT Tmp1VT = Tmp1.getValueType();
8267 if (Tmp1VT == WidenVT)
8270 unsigned Tmp1VTNumElts = Tmp1VT.getVectorNumElements();
8271 if (Tmp1VTNumElts < NewNumElts)
8272 Result = WidenVectorOp(Tmp1, WidenVT);
8274 Result = DAG.getNode(ISD::EXTRACT_SUBVECTOR, dl, WidenVT, Tmp1, Idx);
8276 } else if (NewNumElts % NumElts == 0) {
8277 // Widen the extracted subvector.
8278 unsigned NumConcat = NewNumElts / NumElts;
8279 SDValue UndefVal = DAG.getUNDEF(VT);
8280 SmallVector<SDValue, 8> MOps;
8282 for (unsigned i = 1; i != NumConcat; ++i) {
8283 MOps.push_back(UndefVal);
8285 Result = LegalizeOp(DAG.getNode(ISD::CONCAT_VECTORS, dl, WidenVT,
8286 &MOps[0], MOps.size()));
8288 assert(0 && "can not widen extract subvector");
8289 // This could be implemented using insert and build vector but I would
8290 // like to see when this happens.
8296 // Determine new condition widen type and widen
8297 SDValue Cond1 = Node->getOperand(0);
8298 MVT CondVT = Cond1.getValueType();
8299 assert(CondVT.isVector() && "can not widen non vector type");
8300 MVT CondEVT = CondVT.getVectorElementType();
8301 MVT CondWidenVT = MVT::getVectorVT(CondEVT, NewNumElts);
8302 Cond1 = WidenVectorOp(Cond1, CondWidenVT);
8303 assert(Cond1.getValueType() == CondWidenVT && "Condition not widen");
8305 SDValue Tmp1 = WidenVectorOp(Node->getOperand(1), WidenVT);
8306 SDValue Tmp2 = WidenVectorOp(Node->getOperand(2), WidenVT);
8307 assert(Tmp1.getValueType() == WidenVT && Tmp2.getValueType() == WidenVT);
8308 Result = DAG.getNode(Node->getOpcode(), dl, WidenVT, Cond1, Tmp1, Tmp2);
8312 case ISD::SELECT_CC: {
8313 // Determine new condition widen type and widen
8314 SDValue Cond1 = Node->getOperand(0);
8315 SDValue Cond2 = Node->getOperand(1);
8316 MVT CondVT = Cond1.getValueType();
8317 assert(CondVT.isVector() && "can not widen non vector type");
8318 assert(CondVT == Cond2.getValueType() && "mismatch lhs/rhs");
8319 MVT CondEVT = CondVT.getVectorElementType();
8320 MVT CondWidenVT = MVT::getVectorVT(CondEVT, NewNumElts);
8321 Cond1 = WidenVectorOp(Cond1, CondWidenVT);
8322 Cond2 = WidenVectorOp(Cond2, CondWidenVT);
8323 assert(Cond1.getValueType() == CondWidenVT &&
8324 Cond2.getValueType() == CondWidenVT && "condition not widen");
8326 SDValue Tmp1 = WidenVectorOp(Node->getOperand(2), WidenVT);
8327 SDValue Tmp2 = WidenVectorOp(Node->getOperand(3), WidenVT);
8328 assert(Tmp1.getValueType() == WidenVT && Tmp2.getValueType() == WidenVT &&
8329 "operands not widen");
8330 Result = DAG.getNode(Node->getOpcode(), dl, WidenVT, Cond1, Cond2, Tmp1,
8331 Tmp2, Node->getOperand(4));
8335 // Determine widen for the operand
8336 SDValue Tmp1 = Node->getOperand(0);
8337 MVT TmpVT = Tmp1.getValueType();
8338 assert(TmpVT.isVector() && "can not widen non vector type");
8339 MVT TmpEVT = TmpVT.getVectorElementType();
8340 MVT TmpWidenVT = MVT::getVectorVT(TmpEVT, NewNumElts);
8341 Tmp1 = WidenVectorOp(Tmp1, TmpWidenVT);
8342 SDValue Tmp2 = WidenVectorOp(Node->getOperand(1), TmpWidenVT);
8343 Result = DAG.getNode(Node->getOpcode(), dl, WidenVT, Tmp1, Tmp2,
8344 Node->getOperand(2));
8347 case ISD::ATOMIC_CMP_SWAP:
8348 case ISD::ATOMIC_LOAD_ADD:
8349 case ISD::ATOMIC_LOAD_SUB:
8350 case ISD::ATOMIC_LOAD_AND:
8351 case ISD::ATOMIC_LOAD_OR:
8352 case ISD::ATOMIC_LOAD_XOR:
8353 case ISD::ATOMIC_LOAD_NAND:
8354 case ISD::ATOMIC_LOAD_MIN:
8355 case ISD::ATOMIC_LOAD_MAX:
8356 case ISD::ATOMIC_LOAD_UMIN:
8357 case ISD::ATOMIC_LOAD_UMAX:
8358 case ISD::ATOMIC_SWAP: {
8359 // For now, we assume that using vectors for these operations don't make
8360 // much sense so we just split it. We return an empty result
8362 SplitVectorOp(Op, X, Y);
8367 } // end switch (Node->getOpcode())
8369 assert(Result.getNode() && "Didn't set a result!");
8371 Result = LegalizeOp(Result);
8373 AddWidenedOperand(Op, Result);
8377 // Utility function to find a legal vector type and its associated element
8378 // type from a preferred width and whose vector type must be the same size
8380 // TLI: Target lowering used to determine legal types
8381 // Width: Preferred width of element type
8382 // VVT: Vector value type whose size we must match.
8383 // Returns VecEVT and EVT - the vector type and its associated element type
8384 static void FindWidenVecType(const TargetLowering &TLI, unsigned Width, MVT VVT,
8385 MVT& EVT, MVT& VecEVT) {
8386 // We start with the preferred width, make it a power of 2 and see if
8387 // we can find a vector type of that width. If not, we reduce it by
8388 // another power of 2. If we have widen the type, a vector of bytes should
8390 assert(TLI.isTypeLegal(VVT));
8391 unsigned EWidth = Width + 1;
8394 EWidth = (1 << Log2_32(EWidth-1));
8395 EVT = MVT::getIntegerVT(EWidth);
8396 unsigned NumEVT = VVT.getSizeInBits()/EWidth;
8397 VecEVT = MVT::getVectorVT(EVT, NumEVT);
8398 } while (!TLI.isTypeLegal(VecEVT) ||
8399 VVT.getSizeInBits() != VecEVT.getSizeInBits());
8402 SDValue SelectionDAGLegalize::genWidenVectorLoads(SDValueVector& LdChain,
8412 // We assume that we have good rules to handle loading power of two loads so
8413 // we break down the operations to power of 2 loads. The strategy is to
8414 // load the largest power of 2 that we can easily transform to a legal vector
8415 // and then insert into that vector, and the cast the result into the legal
8416 // vector that we want. This avoids unnecessary stack converts.
8417 // TODO: If the Ldwidth is legal, alignment is the same as the LdWidth, and
8418 // the load is nonvolatile, we an use a wider load for the value.
8419 // Find a vector length we can load a large chunk
8422 FindWidenVecType(TLI, LdWidth, ResType, EVT, VecEVT);
8423 EVTWidth = EVT.getSizeInBits();
8425 SDValue LdOp = DAG.getLoad(EVT, dl, Chain, BasePtr, SV, SVOffset,
8426 isVolatile, Alignment);
8427 SDValue VecOp = DAG.getNode(ISD::SCALAR_TO_VECTOR, dl, VecEVT, LdOp);
8428 LdChain.push_back(LdOp.getValue(1));
8430 // Check if we can load the element with one instruction
8431 if (LdWidth == EVTWidth) {
8432 return DAG.getNode(ISD::BIT_CONVERT, dl, ResType, VecOp);
8435 // The vector element order is endianness dependent.
8437 LdWidth -= EVTWidth;
8438 unsigned Offset = 0;
8440 while (LdWidth > 0) {
8441 unsigned Increment = EVTWidth / 8;
8442 Offset += Increment;
8443 BasePtr = DAG.getNode(ISD::ADD, dl, BasePtr.getValueType(), BasePtr,
8444 DAG.getIntPtrConstant(Increment));
8446 if (LdWidth < EVTWidth) {
8447 // Our current type we are using is too large, use a smaller size by
8448 // using a smaller power of 2
8449 unsigned oEVTWidth = EVTWidth;
8450 FindWidenVecType(TLI, LdWidth, ResType, EVT, VecEVT);
8451 EVTWidth = EVT.getSizeInBits();
8452 // Readjust position and vector position based on new load type
8453 Idx = Idx * (oEVTWidth/EVTWidth);
8454 VecOp = DAG.getNode(ISD::BIT_CONVERT, dl, VecEVT, VecOp);
8457 SDValue LdOp = DAG.getLoad(EVT, dl, Chain, BasePtr, SV,
8458 SVOffset+Offset, isVolatile,
8459 MinAlign(Alignment, Offset));
8460 LdChain.push_back(LdOp.getValue(1));
8461 VecOp = DAG.getNode(ISD::INSERT_VECTOR_ELT, dl, VecEVT, VecOp, LdOp,
8462 DAG.getIntPtrConstant(Idx++));
8464 LdWidth -= EVTWidth;
8467 return DAG.getNode(ISD::BIT_CONVERT, dl, ResType, VecOp);
8470 bool SelectionDAGLegalize::LoadWidenVectorOp(SDValue& Result,
8474 // TODO: Add support for ConcatVec and the ability to load many vector
8475 // types (e.g., v4i8). This will not work when a vector register
8476 // to memory mapping is strange (e.g., vector elements are not
8477 // stored in some sequential order).
8479 // It must be true that the widen vector type is bigger than where
8480 // we need to load from.
8481 LoadSDNode *LD = cast<LoadSDNode>(Op.getNode());
8482 MVT LdVT = LD->getMemoryVT();
8483 DebugLoc dl = LD->getDebugLoc();
8484 assert(LdVT.isVector() && NVT.isVector());
8485 assert(LdVT.getVectorElementType() == NVT.getVectorElementType());
8488 SDValue Chain = LD->getChain();
8489 SDValue BasePtr = LD->getBasePtr();
8490 int SVOffset = LD->getSrcValueOffset();
8491 unsigned Alignment = LD->getAlignment();
8492 bool isVolatile = LD->isVolatile();
8493 const Value *SV = LD->getSrcValue();
8494 unsigned int LdWidth = LdVT.getSizeInBits();
8496 // Load value as a large register
8497 SDValueVector LdChain;
8498 Result = genWidenVectorLoads(LdChain, Chain, BasePtr, SV, SVOffset,
8499 Alignment, isVolatile, LdWidth, NVT, dl);
8501 if (LdChain.size() == 1) {
8506 TFOp=DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
8507 &LdChain[0], LdChain.size());
8513 void SelectionDAGLegalize::genWidenVectorStores(SDValueVector& StChain,
8523 // Breaks the stores into a series of power of 2 width stores. For any
8524 // width, we convert the vector to the vector of element size that we
8525 // want to store. This avoids requiring a stack convert.
8527 // Find a width of the element type we can store with
8528 MVT VVT = ValOp.getValueType();
8531 FindWidenVecType(TLI, StWidth, VVT, EVT, VecEVT);
8532 EVTWidth = EVT.getSizeInBits();
8534 SDValue VecOp = DAG.getNode(ISD::BIT_CONVERT, dl, VecEVT, ValOp);
8535 SDValue EOp = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EVT, VecOp,
8536 DAG.getIntPtrConstant(0));
8537 SDValue StOp = DAG.getStore(Chain, dl, EOp, BasePtr, SV, SVOffset,
8538 isVolatile, Alignment);
8539 StChain.push_back(StOp);
8541 // Check if we are done
8542 if (StWidth == EVTWidth) {
8547 StWidth -= EVTWidth;
8548 unsigned Offset = 0;
8550 while (StWidth > 0) {
8551 unsigned Increment = EVTWidth / 8;
8552 Offset += Increment;
8553 BasePtr = DAG.getNode(ISD::ADD, dl, BasePtr.getValueType(), BasePtr,
8554 DAG.getIntPtrConstant(Increment));
8556 if (StWidth < EVTWidth) {
8557 // Our current type we are using is too large, use a smaller size by
8558 // using a smaller power of 2
8559 unsigned oEVTWidth = EVTWidth;
8560 FindWidenVecType(TLI, StWidth, VVT, EVT, VecEVT);
8561 EVTWidth = EVT.getSizeInBits();
8562 // Readjust position and vector position based on new load type
8563 Idx = Idx * (oEVTWidth/EVTWidth);
8564 VecOp = DAG.getNode(ISD::BIT_CONVERT, dl, VecEVT, VecOp);
8567 EOp = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, dl, EVT, VecOp,
8568 DAG.getIntPtrConstant(Idx++));
8569 StChain.push_back(DAG.getStore(Chain, dl, EOp, BasePtr, SV,
8570 SVOffset + Offset, isVolatile,
8571 MinAlign(Alignment, Offset)));
8572 StWidth -= EVTWidth;
8577 SDValue SelectionDAGLegalize::StoreWidenVectorOp(StoreSDNode *ST,
8580 // TODO: It might be cleaner if we can use SplitVector and have more legal
8581 // vector types that can be stored into memory (e.g., v4xi8 can
8582 // be stored as a word). This will not work when a vector register
8583 // to memory mapping is strange (e.g., vector elements are not
8584 // stored in some sequential order).
8586 MVT StVT = ST->getMemoryVT();
8587 SDValue ValOp = ST->getValue();
8588 DebugLoc dl = ST->getDebugLoc();
8590 // Check if we have widen this node with another value
8591 std::map<SDValue, SDValue>::iterator I = WidenNodes.find(ValOp);
8592 if (I != WidenNodes.end())
8595 MVT VVT = ValOp.getValueType();
8597 // It must be true that we the widen vector type is bigger than where
8598 // we need to store.
8599 assert(StVT.isVector() && VVT.isVector());
8600 assert(StVT.bitsLT(VVT));
8601 assert(StVT.getVectorElementType() == VVT.getVectorElementType());
8604 SDValueVector StChain;
8605 genWidenVectorStores(StChain, Chain, BasePtr, ST->getSrcValue(),
8606 ST->getSrcValueOffset(), ST->getAlignment(),
8607 ST->isVolatile(), ValOp, StVT.getSizeInBits(), dl);
8608 if (StChain.size() == 1)
8611 return DAG.getNode(ISD::TokenFactor, dl, MVT::Other,
8612 &StChain[0], StChain.size());
8616 // SelectionDAG::Legalize - This is the entry point for the file.
8618 void SelectionDAG::Legalize(bool TypesNeedLegalizing,
8619 CodeGenOpt::Level OptLevel) {
8620 /// run - This is the main entry point to this class.
8622 SelectionDAGLegalize(*this, TypesNeedLegalizing, OptLevel).LegalizeDAG();