1 //===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source 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/Target/TargetFrameInfo.h"
19 #include "llvm/Target/TargetLowering.h"
20 #include "llvm/Target/TargetData.h"
21 #include "llvm/Target/TargetMachine.h"
22 #include "llvm/Target/TargetOptions.h"
23 #include "llvm/CallingConv.h"
24 #include "llvm/Constants.h"
25 #include "llvm/DerivedTypes.h"
26 #include "llvm/Support/Alignment.h"
27 #include "llvm/Support/CommandLine.h"
28 #include "llvm/Support/Compiler.h"
29 #include "llvm/Support/MathExtras.h"
30 #include "llvm/ADT/DenseMap.h"
31 #include "llvm/ADT/SmallVector.h"
32 #include "llvm/ADT/SmallPtrSet.h"
38 ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
39 cl::desc("Pop up a window to show dags before legalize"));
41 static const bool ViewLegalizeDAGs = 0;
44 //===----------------------------------------------------------------------===//
45 /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
46 /// hacks on it until the target machine can handle it. This involves
47 /// eliminating value sizes the machine cannot handle (promoting small sizes to
48 /// large sizes or splitting up large values into small values) as well as
49 /// eliminating operations the machine cannot handle.
51 /// This code also does a small amount of optimization and recognition of idioms
52 /// as part of its processing. For example, if a target does not support a
53 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
54 /// will attempt merge setcc and brc instructions into brcc's.
57 class VISIBILITY_HIDDEN SelectionDAGLegalize {
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 SDOperand 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;
74 Legal, // The target natively supports this operation.
75 Promote, // This operation should be executed in a larger type.
76 Expand // Try to expand this to other ops, otherwise use a libcall.
79 /// ValueTypeActions - This is a bitvector that contains two bits for each
80 /// value type, where the two bits correspond to the LegalizeAction enum.
81 /// This can be queried with "getTypeAction(VT)".
82 TargetLowering::ValueTypeActionImpl ValueTypeActions;
84 /// LegalizedNodes - For nodes that are of legal width, and that have more
85 /// than one use, this map indicates what regularized operand to use. This
86 /// allows us to avoid legalizing the same thing more than once.
87 DenseMap<SDOperand, SDOperand> LegalizedNodes;
89 /// PromotedNodes - For nodes that are below legal width, and that have more
90 /// than one use, this map indicates what promoted value to use. This allows
91 /// us to avoid promoting the same thing more than once.
92 DenseMap<SDOperand, SDOperand> PromotedNodes;
94 /// ExpandedNodes - For nodes that need to be expanded this map indicates
95 /// which which operands are the expanded version of the input. This allows
96 /// us to avoid expanding the same node more than once.
97 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes;
99 /// SplitNodes - For vector nodes that need to be split, this map indicates
100 /// which which operands are the split version of the input. This allows us
101 /// to avoid splitting the same node more than once.
102 std::map<SDOperand, std::pair<SDOperand, SDOperand> > SplitNodes;
104 /// ScalarizedNodes - For nodes that need to be converted from vector types to
105 /// scalar types, this contains the mapping of ones we have already
106 /// processed to the result.
107 std::map<SDOperand, SDOperand> ScalarizedNodes;
109 void AddLegalizedOperand(SDOperand From, SDOperand To) {
110 LegalizedNodes.insert(std::make_pair(From, To));
111 // If someone requests legalization of the new node, return itself.
113 LegalizedNodes.insert(std::make_pair(To, To));
115 void AddPromotedOperand(SDOperand From, SDOperand To) {
116 bool isNew = PromotedNodes.insert(std::make_pair(From, To));
117 assert(isNew && "Got into the map somehow?");
118 // If someone requests legalization of the new node, return itself.
119 LegalizedNodes.insert(std::make_pair(To, To));
124 SelectionDAGLegalize(SelectionDAG &DAG);
126 /// getTypeAction - Return how we should legalize values of this type, either
127 /// it is already legal or we need to expand it into multiple registers of
128 /// smaller integer type, or we need to promote it to a larger type.
129 LegalizeAction getTypeAction(MVT::ValueType VT) const {
130 return (LegalizeAction)ValueTypeActions.getTypeAction(VT);
133 /// isTypeLegal - Return true if this type is legal on this target.
135 bool isTypeLegal(MVT::ValueType VT) const {
136 return getTypeAction(VT) == Legal;
142 /// HandleOp - Legalize, Promote, or Expand the specified operand as
143 /// appropriate for its type.
144 void HandleOp(SDOperand Op);
146 /// LegalizeOp - We know that the specified value has a legal type.
147 /// Recursively ensure that the operands have legal types, then return the
149 SDOperand LegalizeOp(SDOperand O);
151 /// UnrollVectorOp - We know that the given vector has a legal type, however
152 /// the operation it performs is not legal and is an operation that we have
153 /// no way of lowering. "Unroll" the vector, splitting out the scalars and
154 /// operating on each element individually.
155 SDOperand UnrollVectorOp(SDOperand O);
157 /// PromoteOp - Given an operation that produces a value in an invalid type,
158 /// promote it to compute the value into a larger type. The produced value
159 /// will have the correct bits for the low portion of the register, but no
160 /// guarantee is made about the top bits: it may be zero, sign-extended, or
162 SDOperand PromoteOp(SDOperand O);
164 /// ExpandOp - Expand the specified SDOperand into its two component pieces
165 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this,
166 /// the LegalizeNodes map is filled in for any results that are not expanded,
167 /// the ExpandedNodes map is filled in for any results that are expanded, and
168 /// the Lo/Hi values are returned. This applies to integer types and Vector
170 void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
172 /// SplitVectorOp - Given an operand of vector type, break it down into
173 /// two smaller values.
174 void SplitVectorOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
176 /// ScalarizeVectorOp - Given an operand of single-element vector type
177 /// (e.g. v1f32), convert it into the equivalent operation that returns a
178 /// scalar (e.g. f32) value.
179 SDOperand ScalarizeVectorOp(SDOperand O);
181 /// isShuffleLegal - Return true if a vector shuffle is legal with the
182 /// specified mask and type. Targets can specify exactly which masks they
183 /// support and the code generator is tasked with not creating illegal masks.
185 /// Note that this will also return true for shuffles that are promoted to a
188 /// If this is a legal shuffle, this method returns the (possibly promoted)
189 /// build_vector Mask. If it's not a legal shuffle, it returns null.
190 SDNode *isShuffleLegal(MVT::ValueType VT, SDOperand Mask) const;
192 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
193 SmallPtrSet<SDNode*, 32> &NodesLeadingTo);
195 void LegalizeSetCCOperands(SDOperand &LHS, SDOperand &RHS, SDOperand &CC);
197 SDOperand ExpandLibCall(const char *Name, SDNode *Node, bool isSigned,
199 SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy,
202 SDOperand ExpandBIT_CONVERT(MVT::ValueType DestVT, SDOperand SrcOp);
203 SDOperand ExpandBUILD_VECTOR(SDNode *Node);
204 SDOperand ExpandSCALAR_TO_VECTOR(SDNode *Node);
205 SDOperand ExpandLegalINT_TO_FP(bool isSigned,
207 MVT::ValueType DestVT);
208 SDOperand PromoteLegalINT_TO_FP(SDOperand LegalOp, MVT::ValueType DestVT,
210 SDOperand PromoteLegalFP_TO_INT(SDOperand LegalOp, MVT::ValueType DestVT,
213 SDOperand ExpandBSWAP(SDOperand Op);
214 SDOperand ExpandBitCount(unsigned Opc, SDOperand Op);
215 bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt,
216 SDOperand &Lo, SDOperand &Hi);
217 void ExpandShiftParts(unsigned NodeOp, SDOperand Op, SDOperand Amt,
218 SDOperand &Lo, SDOperand &Hi);
220 SDOperand ExpandEXTRACT_SUBVECTOR(SDOperand Op);
221 SDOperand ExpandEXTRACT_VECTOR_ELT(SDOperand Op);
223 SDOperand getIntPtrConstant(uint64_t Val) {
224 return DAG.getConstant(Val, TLI.getPointerTy());
229 /// isVectorShuffleLegal - Return true if a vector shuffle is legal with the
230 /// specified mask and type. Targets can specify exactly which masks they
231 /// support and the code generator is tasked with not creating illegal masks.
233 /// Note that this will also return true for shuffles that are promoted to a
235 SDNode *SelectionDAGLegalize::isShuffleLegal(MVT::ValueType VT,
236 SDOperand Mask) const {
237 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE, VT)) {
239 case TargetLowering::Legal:
240 case TargetLowering::Custom:
242 case TargetLowering::Promote: {
243 // If this is promoted to a different type, convert the shuffle mask and
244 // ask if it is legal in the promoted type!
245 MVT::ValueType NVT = TLI.getTypeToPromoteTo(ISD::VECTOR_SHUFFLE, VT);
247 // If we changed # elements, change the shuffle mask.
248 unsigned NumEltsGrowth =
249 MVT::getVectorNumElements(NVT) / MVT::getVectorNumElements(VT);
250 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
251 if (NumEltsGrowth > 1) {
252 // Renumber the elements.
253 SmallVector<SDOperand, 8> Ops;
254 for (unsigned i = 0, e = Mask.getNumOperands(); i != e; ++i) {
255 SDOperand InOp = Mask.getOperand(i);
256 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
257 if (InOp.getOpcode() == ISD::UNDEF)
258 Ops.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
260 unsigned InEltNo = cast<ConstantSDNode>(InOp)->getValue();
261 Ops.push_back(DAG.getConstant(InEltNo*NumEltsGrowth+j, MVT::i32));
265 Mask = DAG.getNode(ISD::BUILD_VECTOR, NVT, &Ops[0], Ops.size());
271 return TLI.isShuffleMaskLegal(Mask, VT) ? Mask.Val : 0;
274 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
275 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
276 ValueTypeActions(TLI.getValueTypeActions()) {
277 assert(MVT::LAST_VALUETYPE <= 32 &&
278 "Too many value types for ValueTypeActions to hold!");
281 /// ComputeTopDownOrdering - Compute a top-down ordering of the dag, where Order
282 /// contains all of a nodes operands before it contains the node.
283 static void ComputeTopDownOrdering(SelectionDAG &DAG,
284 SmallVector<SDNode*, 64> &Order) {
286 DenseMap<SDNode*, unsigned> Visited;
287 std::vector<SDNode*> Worklist;
288 Worklist.reserve(128);
290 // Compute ordering from all of the leaves in the graphs, those (like the
291 // entry node) that have no operands.
292 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
293 E = DAG.allnodes_end(); I != E; ++I) {
294 if (I->getNumOperands() == 0) {
296 Worklist.push_back(I);
300 while (!Worklist.empty()) {
301 SDNode *N = Worklist.back();
304 if (++Visited[N] != N->getNumOperands())
305 continue; // Haven't visited all operands yet
309 // Now that we have N in, add anything that uses it if all of their operands
311 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end();
313 Worklist.push_back(*UI);
316 assert(Order.size() == Visited.size() &&
318 (unsigned)std::distance(DAG.allnodes_begin(), DAG.allnodes_end()) &&
319 "Error: DAG is cyclic!");
323 void SelectionDAGLegalize::LegalizeDAG() {
324 LastCALLSEQ_END = DAG.getEntryNode();
325 IsLegalizingCall = false;
327 // The legalize process is inherently a bottom-up recursive process (users
328 // legalize their uses before themselves). Given infinite stack space, we
329 // could just start legalizing on the root and traverse the whole graph. In
330 // practice however, this causes us to run out of stack space on large basic
331 // blocks. To avoid this problem, compute an ordering of the nodes where each
332 // node is only legalized after all of its operands are legalized.
333 SmallVector<SDNode*, 64> Order;
334 ComputeTopDownOrdering(DAG, Order);
336 for (unsigned i = 0, e = Order.size(); i != e; ++i)
337 HandleOp(SDOperand(Order[i], 0));
339 // Finally, it's possible the root changed. Get the new root.
340 SDOperand OldRoot = DAG.getRoot();
341 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
342 DAG.setRoot(LegalizedNodes[OldRoot]);
344 ExpandedNodes.clear();
345 LegalizedNodes.clear();
346 PromotedNodes.clear();
348 ScalarizedNodes.clear();
350 // Remove dead nodes now.
351 DAG.RemoveDeadNodes();
355 /// FindCallEndFromCallStart - Given a chained node that is part of a call
356 /// sequence, find the CALLSEQ_END node that terminates the call sequence.
357 static SDNode *FindCallEndFromCallStart(SDNode *Node) {
358 if (Node->getOpcode() == ISD::CALLSEQ_END)
360 if (Node->use_empty())
361 return 0; // No CallSeqEnd
363 // The chain is usually at the end.
364 SDOperand TheChain(Node, Node->getNumValues()-1);
365 if (TheChain.getValueType() != MVT::Other) {
366 // Sometimes it's at the beginning.
367 TheChain = SDOperand(Node, 0);
368 if (TheChain.getValueType() != MVT::Other) {
369 // Otherwise, hunt for it.
370 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
371 if (Node->getValueType(i) == MVT::Other) {
372 TheChain = SDOperand(Node, i);
376 // Otherwise, we walked into a node without a chain.
377 if (TheChain.getValueType() != MVT::Other)
382 for (SDNode::use_iterator UI = Node->use_begin(),
383 E = Node->use_end(); UI != E; ++UI) {
385 // Make sure to only follow users of our token chain.
387 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
388 if (User->getOperand(i) == TheChain)
389 if (SDNode *Result = FindCallEndFromCallStart(User))
395 /// FindCallStartFromCallEnd - Given a chained node that is part of a call
396 /// sequence, find the CALLSEQ_START node that initiates the call sequence.
397 static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
398 assert(Node && "Didn't find callseq_start for a call??");
399 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
401 assert(Node->getOperand(0).getValueType() == MVT::Other &&
402 "Node doesn't have a token chain argument!");
403 return FindCallStartFromCallEnd(Node->getOperand(0).Val);
406 /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
407 /// see if any uses can reach Dest. If no dest operands can get to dest,
408 /// legalize them, legalize ourself, and return false, otherwise, return true.
410 /// Keep track of the nodes we fine that actually do lead to Dest in
411 /// NodesLeadingTo. This avoids retraversing them exponential number of times.
413 bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
414 SmallPtrSet<SDNode*, 32> &NodesLeadingTo) {
415 if (N == Dest) return true; // N certainly leads to Dest :)
417 // If we've already processed this node and it does lead to Dest, there is no
418 // need to reprocess it.
419 if (NodesLeadingTo.count(N)) return true;
421 // If the first result of this node has been already legalized, then it cannot
423 switch (getTypeAction(N->getValueType(0))) {
425 if (LegalizedNodes.count(SDOperand(N, 0))) return false;
428 if (PromotedNodes.count(SDOperand(N, 0))) return false;
431 if (ExpandedNodes.count(SDOperand(N, 0))) return false;
435 // Okay, this node has not already been legalized. Check and legalize all
436 // operands. If none lead to Dest, then we can legalize this node.
437 bool OperandsLeadToDest = false;
438 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
439 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
440 LegalizeAllNodesNotLeadingTo(N->getOperand(i).Val, Dest, NodesLeadingTo);
442 if (OperandsLeadToDest) {
443 NodesLeadingTo.insert(N);
447 // Okay, this node looks safe, legalize it and return false.
448 HandleOp(SDOperand(N, 0));
452 /// HandleOp - Legalize, Promote, or Expand the specified operand as
453 /// appropriate for its type.
454 void SelectionDAGLegalize::HandleOp(SDOperand Op) {
455 MVT::ValueType VT = Op.getValueType();
456 switch (getTypeAction(VT)) {
457 default: assert(0 && "Bad type action!");
458 case Legal: (void)LegalizeOp(Op); break;
459 case Promote: (void)PromoteOp(Op); break;
461 if (!MVT::isVector(VT)) {
462 // If this is an illegal scalar, expand it into its two component
465 if (Op.getOpcode() == ISD::TargetConstant)
466 break; // Allow illegal target nodes.
468 } else if (MVT::getVectorNumElements(VT) == 1) {
469 // If this is an illegal single element vector, convert it to a
471 (void)ScalarizeVectorOp(Op);
473 // Otherwise, this is an illegal multiple element vector.
474 // Split it in half and legalize both parts.
476 SplitVectorOp(Op, X, Y);
482 /// ExpandConstantFP - Expands the ConstantFP node to an integer constant or
483 /// a load from the constant pool.
484 static SDOperand ExpandConstantFP(ConstantFPSDNode *CFP, bool UseCP,
485 SelectionDAG &DAG, TargetLowering &TLI) {
488 // If a FP immediate is precise when represented as a float and if the
489 // target can do an extending load from float to double, we put it into
490 // the constant pool as a float, even if it's is statically typed as a
492 MVT::ValueType VT = CFP->getValueType(0);
493 bool isDouble = VT == MVT::f64;
494 ConstantFP *LLVMC = ConstantFP::get(MVT::getTypeForValueType(VT),
497 if (VT!=MVT::f64 && VT!=MVT::f32)
498 assert(0 && "Invalid type expansion");
499 return DAG.getConstant(LLVMC->getValueAPF().convertToAPInt().getZExtValue(),
500 isDouble ? MVT::i64 : MVT::i32);
503 if (isDouble && CFP->isValueValidForType(MVT::f32, CFP->getValueAPF()) &&
504 // Only do this if the target has a native EXTLOAD instruction from f32.
505 // Do not try to be clever about long doubles (so far)
506 TLI.isLoadXLegal(ISD::EXTLOAD, MVT::f32)) {
507 LLVMC = cast<ConstantFP>(ConstantExpr::getFPTrunc(LLVMC,Type::FloatTy));
512 SDOperand CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
514 return DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
515 CPIdx, NULL, 0, MVT::f32);
517 return DAG.getLoad(VT, DAG.getEntryNode(), CPIdx, NULL, 0);
522 /// ExpandFCOPYSIGNToBitwiseOps - Expands fcopysign to a series of bitwise
525 SDOperand ExpandFCOPYSIGNToBitwiseOps(SDNode *Node, MVT::ValueType NVT,
526 SelectionDAG &DAG, TargetLowering &TLI) {
527 MVT::ValueType VT = Node->getValueType(0);
528 MVT::ValueType SrcVT = Node->getOperand(1).getValueType();
529 assert((SrcVT == MVT::f32 || SrcVT == MVT::f64) &&
530 "fcopysign expansion only supported for f32 and f64");
531 MVT::ValueType SrcNVT = (SrcVT == MVT::f64) ? MVT::i64 : MVT::i32;
533 // First get the sign bit of second operand.
534 SDOperand Mask1 = (SrcVT == MVT::f64)
535 ? DAG.getConstantFP(BitsToDouble(1ULL << 63), SrcVT)
536 : DAG.getConstantFP(BitsToFloat(1U << 31), SrcVT);
537 Mask1 = DAG.getNode(ISD::BIT_CONVERT, SrcNVT, Mask1);
538 SDOperand SignBit= DAG.getNode(ISD::BIT_CONVERT, SrcNVT, Node->getOperand(1));
539 SignBit = DAG.getNode(ISD::AND, SrcNVT, SignBit, Mask1);
540 // Shift right or sign-extend it if the two operands have different types.
541 int SizeDiff = MVT::getSizeInBits(SrcNVT) - MVT::getSizeInBits(NVT);
543 SignBit = DAG.getNode(ISD::SRL, SrcNVT, SignBit,
544 DAG.getConstant(SizeDiff, TLI.getShiftAmountTy()));
545 SignBit = DAG.getNode(ISD::TRUNCATE, NVT, SignBit);
546 } else if (SizeDiff < 0)
547 SignBit = DAG.getNode(ISD::SIGN_EXTEND, NVT, SignBit);
549 // Clear the sign bit of first operand.
550 SDOperand Mask2 = (VT == MVT::f64)
551 ? DAG.getConstantFP(BitsToDouble(~(1ULL << 63)), VT)
552 : DAG.getConstantFP(BitsToFloat(~(1U << 31)), VT);
553 Mask2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Mask2);
554 SDOperand Result = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
555 Result = DAG.getNode(ISD::AND, NVT, Result, Mask2);
557 // Or the value with the sign bit.
558 Result = DAG.getNode(ISD::OR, NVT, Result, SignBit);
562 /// ExpandUnalignedStore - Expands an unaligned store to 2 half-size stores.
564 SDOperand ExpandUnalignedStore(StoreSDNode *ST, SelectionDAG &DAG,
565 TargetLowering &TLI) {
566 SDOperand Chain = ST->getChain();
567 SDOperand Ptr = ST->getBasePtr();
568 SDOperand Val = ST->getValue();
569 MVT::ValueType VT = Val.getValueType();
570 int Alignment = ST->getAlignment();
571 int SVOffset = ST->getSrcValueOffset();
572 if (MVT::isFloatingPoint(ST->getStoredVT())) {
573 // Expand to a bitconvert of the value to the integer type of the
574 // same size, then a (misaligned) int store.
575 MVT::ValueType intVT;
578 else if (VT==MVT::f32)
581 assert(0 && "Unaligned load of unsupported floating point type");
583 SDOperand Result = DAG.getNode(ISD::BIT_CONVERT, intVT, Val);
584 return DAG.getStore(Chain, Result, Ptr, ST->getSrcValue(),
585 SVOffset, ST->isVolatile(), Alignment);
587 assert(MVT::isInteger(ST->getStoredVT()) &&
588 "Unaligned store of unknown type.");
589 // Get the half-size VT
590 MVT::ValueType NewStoredVT = ST->getStoredVT() - 1;
591 int NumBits = MVT::getSizeInBits(NewStoredVT);
592 int IncrementSize = NumBits / 8;
594 // Divide the stored value in two parts.
595 SDOperand ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
597 SDOperand Hi = DAG.getNode(ISD::SRL, VT, Val, ShiftAmount);
599 // Store the two parts
600 SDOperand Store1, Store2;
601 Store1 = DAG.getTruncStore(Chain, TLI.isLittleEndian()?Lo:Hi, Ptr,
602 ST->getSrcValue(), SVOffset, NewStoredVT,
603 ST->isVolatile(), Alignment);
604 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
605 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
606 Alignment = MinAlign(Alignment, IncrementSize);
607 Store2 = DAG.getTruncStore(Chain, TLI.isLittleEndian()?Hi:Lo, Ptr,
608 ST->getSrcValue(), SVOffset + IncrementSize,
609 NewStoredVT, ST->isVolatile(), Alignment);
611 return DAG.getNode(ISD::TokenFactor, MVT::Other, Store1, Store2);
614 /// ExpandUnalignedLoad - Expands an unaligned load to 2 half-size loads.
616 SDOperand ExpandUnalignedLoad(LoadSDNode *LD, SelectionDAG &DAG,
617 TargetLowering &TLI) {
618 int SVOffset = LD->getSrcValueOffset();
619 SDOperand Chain = LD->getChain();
620 SDOperand Ptr = LD->getBasePtr();
621 MVT::ValueType VT = LD->getValueType(0);
622 MVT::ValueType LoadedVT = LD->getLoadedVT();
623 if (MVT::isFloatingPoint(VT)) {
624 // Expand to a (misaligned) integer load of the same size,
625 // then bitconvert to floating point.
626 MVT::ValueType intVT;
627 if (LoadedVT==MVT::f64)
629 else if (LoadedVT==MVT::f32)
632 assert(0 && "Unaligned load of unsupported floating point type");
634 SDOperand newLoad = DAG.getLoad(intVT, Chain, Ptr, LD->getSrcValue(),
635 SVOffset, LD->isVolatile(),
637 SDOperand Result = DAG.getNode(ISD::BIT_CONVERT, LoadedVT, newLoad);
639 Result = DAG.getNode(ISD::FP_EXTEND, VT, Result);
641 SDOperand Ops[] = { Result, Chain };
642 return DAG.getNode(ISD::MERGE_VALUES, DAG.getVTList(VT, MVT::Other),
645 assert(MVT::isInteger(LoadedVT) && "Unaligned load of unsupported type.");
646 MVT::ValueType NewLoadedVT = LoadedVT - 1;
647 int NumBits = MVT::getSizeInBits(NewLoadedVT);
648 int Alignment = LD->getAlignment();
649 int IncrementSize = NumBits / 8;
650 ISD::LoadExtType HiExtType = LD->getExtensionType();
652 // If the original load is NON_EXTLOAD, the hi part load must be ZEXTLOAD.
653 if (HiExtType == ISD::NON_EXTLOAD)
654 HiExtType = ISD::ZEXTLOAD;
656 // Load the value in two parts
658 if (TLI.isLittleEndian()) {
659 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, VT, Chain, Ptr, LD->getSrcValue(),
660 SVOffset, NewLoadedVT, LD->isVolatile(), Alignment);
661 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
662 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
663 Hi = DAG.getExtLoad(HiExtType, VT, Chain, Ptr, LD->getSrcValue(),
664 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
665 MinAlign(Alignment, IncrementSize));
667 Hi = DAG.getExtLoad(HiExtType, VT, Chain, Ptr, LD->getSrcValue(), SVOffset,
668 NewLoadedVT,LD->isVolatile(), Alignment);
669 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
670 DAG.getConstant(IncrementSize, TLI.getPointerTy()));
671 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, VT, Chain, Ptr, LD->getSrcValue(),
672 SVOffset + IncrementSize, NewLoadedVT, LD->isVolatile(),
673 MinAlign(Alignment, IncrementSize));
676 // aggregate the two parts
677 SDOperand ShiftAmount = DAG.getConstant(NumBits, TLI.getShiftAmountTy());
678 SDOperand Result = DAG.getNode(ISD::SHL, VT, Hi, ShiftAmount);
679 Result = DAG.getNode(ISD::OR, VT, Result, Lo);
681 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
684 SDOperand Ops[] = { Result, TF };
685 return DAG.getNode(ISD::MERGE_VALUES, DAG.getVTList(VT, MVT::Other), Ops, 2);
688 /// UnrollVectorOp - We know that the given vector has a legal type, however
689 /// the operation it performs is not legal and is an operation that we have
690 /// no way of lowering. "Unroll" the vector, splitting out the scalars and
691 /// operating on each element individually.
692 SDOperand SelectionDAGLegalize::UnrollVectorOp(SDOperand Op) {
693 MVT::ValueType VT = Op.getValueType();
694 assert(isTypeLegal(VT) &&
695 "Caller should expand or promote operands that are not legal!");
696 assert(Op.Val->getNumValues() == 1 &&
697 "Can't unroll a vector with multiple results!");
698 unsigned NE = MVT::getVectorNumElements(VT);
699 MVT::ValueType EltVT = MVT::getVectorElementType(VT);
701 SmallVector<SDOperand, 8> Scalars;
702 SmallVector<SDOperand, 4> Operands(Op.getNumOperands());
703 for (unsigned i = 0; i != NE; ++i) {
704 for (unsigned j = 0; j != Op.getNumOperands(); ++j) {
705 SDOperand Operand = Op.getOperand(j);
706 MVT::ValueType OperandVT = Operand.getValueType();
707 if (MVT::isVector(OperandVT)) {
708 // A vector operand; extract a single element.
709 MVT::ValueType OperandEltVT = MVT::getVectorElementType(OperandVT);
710 Operands[j] = DAG.getNode(ISD::EXTRACT_VECTOR_ELT,
713 DAG.getConstant(i, MVT::i32));
715 // A scalar operand; just use it as is.
716 Operands[j] = Operand;
719 Scalars.push_back(DAG.getNode(Op.getOpcode(), EltVT,
720 &Operands[0], Operands.size()));
723 return DAG.getNode(ISD::BUILD_VECTOR, VT, &Scalars[0], Scalars.size());
726 /// LegalizeOp - We know that the specified value has a legal type, and
727 /// that its operands are legal. Now ensure that the operation itself
728 /// is legal, recursively ensuring that the operands' operations remain
730 SDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) {
731 if (Op.getOpcode() == ISD::TargetConstant) // Allow illegal target nodes.
734 assert(isTypeLegal(Op.getValueType()) &&
735 "Caller should expand or promote operands that are not legal!");
736 SDNode *Node = Op.Val;
738 // If this operation defines any values that cannot be represented in a
739 // register on this target, make sure to expand or promote them.
740 if (Node->getNumValues() > 1) {
741 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
742 if (getTypeAction(Node->getValueType(i)) != Legal) {
743 HandleOp(Op.getValue(i));
744 assert(LegalizedNodes.count(Op) &&
745 "Handling didn't add legal operands!");
746 return LegalizedNodes[Op];
750 // Note that LegalizeOp may be reentered even from single-use nodes, which
751 // means that we always must cache transformed nodes.
752 DenseMap<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
753 if (I != LegalizedNodes.end()) return I->second;
755 SDOperand Tmp1, Tmp2, Tmp3, Tmp4;
756 SDOperand Result = Op;
757 bool isCustom = false;
759 switch (Node->getOpcode()) {
760 case ISD::FrameIndex:
761 case ISD::EntryToken:
763 case ISD::BasicBlock:
764 case ISD::TargetFrameIndex:
765 case ISD::TargetJumpTable:
766 case ISD::TargetConstant:
767 case ISD::TargetConstantFP:
768 case ISD::TargetConstantPool:
769 case ISD::TargetGlobalAddress:
770 case ISD::TargetGlobalTLSAddress:
771 case ISD::TargetExternalSymbol:
776 // Primitives must all be legal.
777 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
778 "This must be legal!");
781 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
782 // If this is a target node, legalize it by legalizing the operands then
783 // passing it through.
784 SmallVector<SDOperand, 8> Ops;
785 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
786 Ops.push_back(LegalizeOp(Node->getOperand(i)));
788 Result = DAG.UpdateNodeOperands(Result.getValue(0), &Ops[0], Ops.size());
790 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
791 AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
792 return Result.getValue(Op.ResNo);
794 // Otherwise this is an unhandled builtin node. splat.
796 cerr << "NODE: "; Node->dump(&DAG); cerr << "\n";
798 assert(0 && "Do not know how to legalize this operator!");
800 case ISD::GLOBAL_OFFSET_TABLE:
801 case ISD::GlobalAddress:
802 case ISD::GlobalTLSAddress:
803 case ISD::ExternalSymbol:
804 case ISD::ConstantPool:
805 case ISD::JumpTable: // Nothing to do.
806 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
807 default: assert(0 && "This action is not supported yet!");
808 case TargetLowering::Custom:
809 Tmp1 = TLI.LowerOperation(Op, DAG);
810 if (Tmp1.Val) Result = Tmp1;
811 // FALLTHROUGH if the target doesn't want to lower this op after all.
812 case TargetLowering::Legal:
817 case ISD::RETURNADDR:
818 // The only option for these nodes is to custom lower them. If the target
819 // does not custom lower them, then return zero.
820 Tmp1 = TLI.LowerOperation(Op, DAG);
824 Result = DAG.getConstant(0, TLI.getPointerTy());
826 case ISD::FRAME_TO_ARGS_OFFSET: {
827 MVT::ValueType VT = Node->getValueType(0);
828 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
829 default: assert(0 && "This action is not supported yet!");
830 case TargetLowering::Custom:
831 Result = TLI.LowerOperation(Op, DAG);
832 if (Result.Val) break;
834 case TargetLowering::Legal:
835 Result = DAG.getConstant(0, VT);
840 case ISD::EXCEPTIONADDR: {
841 Tmp1 = LegalizeOp(Node->getOperand(0));
842 MVT::ValueType VT = Node->getValueType(0);
843 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
844 default: assert(0 && "This action is not supported yet!");
845 case TargetLowering::Expand: {
846 unsigned Reg = TLI.getExceptionAddressRegister();
847 Result = DAG.getCopyFromReg(Tmp1, Reg, VT).getValue(Op.ResNo);
850 case TargetLowering::Custom:
851 Result = TLI.LowerOperation(Op, DAG);
852 if (Result.Val) break;
854 case TargetLowering::Legal: {
855 SDOperand Ops[] = { DAG.getConstant(0, VT), Tmp1 };
856 Result = DAG.getNode(ISD::MERGE_VALUES, DAG.getVTList(VT, MVT::Other),
857 Ops, 2).getValue(Op.ResNo);
863 case ISD::EHSELECTION: {
864 Tmp1 = LegalizeOp(Node->getOperand(0));
865 Tmp2 = LegalizeOp(Node->getOperand(1));
866 MVT::ValueType VT = Node->getValueType(0);
867 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
868 default: assert(0 && "This action is not supported yet!");
869 case TargetLowering::Expand: {
870 unsigned Reg = TLI.getExceptionSelectorRegister();
871 Result = DAG.getCopyFromReg(Tmp2, Reg, VT).getValue(Op.ResNo);
874 case TargetLowering::Custom:
875 Result = TLI.LowerOperation(Op, DAG);
876 if (Result.Val) break;
878 case TargetLowering::Legal: {
879 SDOperand Ops[] = { DAG.getConstant(0, VT), Tmp2 };
880 Result = DAG.getNode(ISD::MERGE_VALUES, DAG.getVTList(VT, MVT::Other),
881 Ops, 2).getValue(Op.ResNo);
887 case ISD::EH_RETURN: {
888 MVT::ValueType VT = Node->getValueType(0);
889 // The only "good" option for this node is to custom lower it.
890 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
891 default: assert(0 && "This action is not supported at all!");
892 case TargetLowering::Custom:
893 Result = TLI.LowerOperation(Op, DAG);
894 if (Result.Val) break;
896 case TargetLowering::Legal:
897 // Target does not know, how to lower this, lower to noop
898 Result = LegalizeOp(Node->getOperand(0));
903 case ISD::AssertSext:
904 case ISD::AssertZext:
905 Tmp1 = LegalizeOp(Node->getOperand(0));
906 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
908 case ISD::MERGE_VALUES:
909 // Legalize eliminates MERGE_VALUES nodes.
910 Result = Node->getOperand(Op.ResNo);
912 case ISD::CopyFromReg:
913 Tmp1 = LegalizeOp(Node->getOperand(0));
914 Result = Op.getValue(0);
915 if (Node->getNumValues() == 2) {
916 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
918 assert(Node->getNumValues() == 3 && "Invalid copyfromreg!");
919 if (Node->getNumOperands() == 3) {
920 Tmp2 = LegalizeOp(Node->getOperand(2));
921 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
923 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
925 AddLegalizedOperand(Op.getValue(2), Result.getValue(2));
927 // Since CopyFromReg produces two values, make sure to remember that we
928 // legalized both of them.
929 AddLegalizedOperand(Op.getValue(0), Result);
930 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
931 return Result.getValue(Op.ResNo);
933 MVT::ValueType VT = Op.getValueType();
934 switch (TLI.getOperationAction(ISD::UNDEF, VT)) {
935 default: assert(0 && "This action is not supported yet!");
936 case TargetLowering::Expand:
937 if (MVT::isInteger(VT))
938 Result = DAG.getConstant(0, VT);
939 else if (MVT::isFloatingPoint(VT))
940 Result = DAG.getConstantFP(APFloat(APInt(MVT::getSizeInBits(VT), 0)),
943 assert(0 && "Unknown value type!");
945 case TargetLowering::Legal:
951 case ISD::INTRINSIC_W_CHAIN:
952 case ISD::INTRINSIC_WO_CHAIN:
953 case ISD::INTRINSIC_VOID: {
954 SmallVector<SDOperand, 8> Ops;
955 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
956 Ops.push_back(LegalizeOp(Node->getOperand(i)));
957 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
959 // Allow the target to custom lower its intrinsics if it wants to.
960 if (TLI.getOperationAction(Node->getOpcode(), MVT::Other) ==
961 TargetLowering::Custom) {
962 Tmp3 = TLI.LowerOperation(Result, DAG);
963 if (Tmp3.Val) Result = Tmp3;
966 if (Result.Val->getNumValues() == 1) break;
968 // Must have return value and chain result.
969 assert(Result.Val->getNumValues() == 2 &&
970 "Cannot return more than two values!");
972 // Since loads produce two values, make sure to remember that we
973 // legalized both of them.
974 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
975 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
976 return Result.getValue(Op.ResNo);
980 assert(Node->getNumOperands() == 5 && "Invalid LOCATION node!");
981 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input chain.
983 switch (TLI.getOperationAction(ISD::LOCATION, MVT::Other)) {
984 case TargetLowering::Promote:
985 default: assert(0 && "This action is not supported yet!");
986 case TargetLowering::Expand: {
987 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
988 bool useDEBUG_LOC = TLI.isOperationLegal(ISD::DEBUG_LOC, MVT::Other);
989 bool useLABEL = TLI.isOperationLegal(ISD::LABEL, MVT::Other);
991 if (MMI && (useDEBUG_LOC || useLABEL)) {
992 const std::string &FName =
993 cast<StringSDNode>(Node->getOperand(3))->getValue();
994 const std::string &DirName =
995 cast<StringSDNode>(Node->getOperand(4))->getValue();
996 unsigned SrcFile = MMI->RecordSource(DirName, FName);
998 SmallVector<SDOperand, 8> Ops;
999 Ops.push_back(Tmp1); // chain
1000 SDOperand LineOp = Node->getOperand(1);
1001 SDOperand ColOp = Node->getOperand(2);
1004 Ops.push_back(LineOp); // line #
1005 Ops.push_back(ColOp); // col #
1006 Ops.push_back(DAG.getConstant(SrcFile, MVT::i32)); // source file id
1007 Result = DAG.getNode(ISD::DEBUG_LOC, MVT::Other, &Ops[0], Ops.size());
1009 unsigned Line = cast<ConstantSDNode>(LineOp)->getValue();
1010 unsigned Col = cast<ConstantSDNode>(ColOp)->getValue();
1011 unsigned ID = MMI->RecordLabel(Line, Col, SrcFile);
1012 Ops.push_back(DAG.getConstant(ID, MVT::i32));
1013 Result = DAG.getNode(ISD::LABEL, MVT::Other,&Ops[0],Ops.size());
1016 Result = Tmp1; // chain
1020 case TargetLowering::Legal:
1021 if (Tmp1 != Node->getOperand(0) ||
1022 getTypeAction(Node->getOperand(1).getValueType()) == Promote) {
1023 SmallVector<SDOperand, 8> Ops;
1024 Ops.push_back(Tmp1);
1025 if (getTypeAction(Node->getOperand(1).getValueType()) == Legal) {
1026 Ops.push_back(Node->getOperand(1)); // line # must be legal.
1027 Ops.push_back(Node->getOperand(2)); // col # must be legal.
1029 // Otherwise promote them.
1030 Ops.push_back(PromoteOp(Node->getOperand(1)));
1031 Ops.push_back(PromoteOp(Node->getOperand(2)));
1033 Ops.push_back(Node->getOperand(3)); // filename must be legal.
1034 Ops.push_back(Node->getOperand(4)); // working dir # must be legal.
1035 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1041 case ISD::DEBUG_LOC:
1042 assert(Node->getNumOperands() == 4 && "Invalid DEBUG_LOC node!");
1043 switch (TLI.getOperationAction(ISD::DEBUG_LOC, MVT::Other)) {
1044 default: assert(0 && "This action is not supported yet!");
1045 case TargetLowering::Legal:
1046 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1047 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the line #.
1048 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the col #.
1049 Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize the source file id.
1050 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4);
1056 assert(Node->getNumOperands() == 2 && "Invalid LABEL node!");
1057 switch (TLI.getOperationAction(ISD::LABEL, MVT::Other)) {
1058 default: assert(0 && "This action is not supported yet!");
1059 case TargetLowering::Legal:
1060 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1061 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the label id.
1062 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1064 case TargetLowering::Expand:
1065 Result = LegalizeOp(Node->getOperand(0));
1070 case ISD::Constant: {
1071 ConstantSDNode *CN = cast<ConstantSDNode>(Node);
1073 TLI.getOperationAction(ISD::Constant, CN->getValueType(0));
1075 // We know we don't need to expand constants here, constants only have one
1076 // value and we check that it is fine above.
1078 if (opAction == TargetLowering::Custom) {
1079 Tmp1 = TLI.LowerOperation(Result, DAG);
1085 case ISD::ConstantFP: {
1086 // Spill FP immediates to the constant pool if the target cannot directly
1087 // codegen them. Targets often have some immediate values that can be
1088 // efficiently generated into an FP register without a load. We explicitly
1089 // leave these constants as ConstantFP nodes for the target to deal with.
1090 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
1092 // Check to see if this FP immediate is already legal.
1093 bool isLegal = false;
1094 for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(),
1095 E = TLI.legal_fpimm_end(); I != E; ++I)
1096 if (CFP->isExactlyValue(*I)) {
1101 // If this is a legal constant, turn it into a TargetConstantFP node.
1103 Result = DAG.getTargetConstantFP(CFP->getValueAPF(),
1104 CFP->getValueType(0));
1108 switch (TLI.getOperationAction(ISD::ConstantFP, CFP->getValueType(0))) {
1109 default: assert(0 && "This action is not supported yet!");
1110 case TargetLowering::Custom:
1111 Tmp3 = TLI.LowerOperation(Result, DAG);
1117 case TargetLowering::Expand:
1118 Result = ExpandConstantFP(CFP, true, DAG, TLI);
1122 case ISD::TokenFactor:
1123 if (Node->getNumOperands() == 2) {
1124 Tmp1 = LegalizeOp(Node->getOperand(0));
1125 Tmp2 = LegalizeOp(Node->getOperand(1));
1126 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1127 } else if (Node->getNumOperands() == 3) {
1128 Tmp1 = LegalizeOp(Node->getOperand(0));
1129 Tmp2 = LegalizeOp(Node->getOperand(1));
1130 Tmp3 = LegalizeOp(Node->getOperand(2));
1131 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1133 SmallVector<SDOperand, 8> Ops;
1134 // Legalize the operands.
1135 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
1136 Ops.push_back(LegalizeOp(Node->getOperand(i)));
1137 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1141 case ISD::FORMAL_ARGUMENTS:
1143 // The only option for this is to custom lower it.
1144 Tmp3 = TLI.LowerOperation(Result.getValue(0), DAG);
1145 assert(Tmp3.Val && "Target didn't custom lower this node!");
1146 assert(Tmp3.Val->getNumValues() == Result.Val->getNumValues() &&
1147 "Lowering call/formal_arguments produced unexpected # results!");
1149 // Since CALL/FORMAL_ARGUMENTS nodes produce multiple values, make sure to
1150 // remember that we legalized all of them, so it doesn't get relegalized.
1151 for (unsigned i = 0, e = Tmp3.Val->getNumValues(); i != e; ++i) {
1152 Tmp1 = LegalizeOp(Tmp3.getValue(i));
1155 AddLegalizedOperand(SDOperand(Node, i), Tmp1);
1158 case ISD::EXTRACT_SUBREG: {
1159 Tmp1 = LegalizeOp(Node->getOperand(0));
1160 ConstantSDNode *idx = dyn_cast<ConstantSDNode>(Node->getOperand(1));
1161 assert(idx && "Operand must be a constant");
1162 Tmp2 = DAG.getTargetConstant(idx->getValue(), idx->getValueType(0));
1163 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1166 case ISD::INSERT_SUBREG: {
1167 Tmp1 = LegalizeOp(Node->getOperand(0));
1168 Tmp2 = LegalizeOp(Node->getOperand(1));
1169 ConstantSDNode *idx = dyn_cast<ConstantSDNode>(Node->getOperand(2));
1170 assert(idx && "Operand must be a constant");
1171 Tmp3 = DAG.getTargetConstant(idx->getValue(), idx->getValueType(0));
1172 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1175 case ISD::BUILD_VECTOR:
1176 switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) {
1177 default: assert(0 && "This action is not supported yet!");
1178 case TargetLowering::Custom:
1179 Tmp3 = TLI.LowerOperation(Result, DAG);
1185 case TargetLowering::Expand:
1186 Result = ExpandBUILD_VECTOR(Result.Val);
1190 case ISD::INSERT_VECTOR_ELT:
1191 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVec
1192 Tmp2 = LegalizeOp(Node->getOperand(1)); // InVal
1193 Tmp3 = LegalizeOp(Node->getOperand(2)); // InEltNo
1194 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1196 switch (TLI.getOperationAction(ISD::INSERT_VECTOR_ELT,
1197 Node->getValueType(0))) {
1198 default: assert(0 && "This action is not supported yet!");
1199 case TargetLowering::Legal:
1201 case TargetLowering::Custom:
1202 Tmp3 = TLI.LowerOperation(Result, DAG);
1208 case TargetLowering::Expand: {
1209 // If the insert index is a constant, codegen this as a scalar_to_vector,
1210 // then a shuffle that inserts it into the right position in the vector.
1211 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Tmp3)) {
1212 SDOperand ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR,
1213 Tmp1.getValueType(), Tmp2);
1215 unsigned NumElts = MVT::getVectorNumElements(Tmp1.getValueType());
1216 MVT::ValueType ShufMaskVT = MVT::getIntVectorWithNumElements(NumElts);
1217 MVT::ValueType ShufMaskEltVT = MVT::getVectorElementType(ShufMaskVT);
1219 // We generate a shuffle of InVec and ScVec, so the shuffle mask should
1220 // be 0,1,2,3,4,5... with the appropriate element replaced with elt 0 of
1222 SmallVector<SDOperand, 8> ShufOps;
1223 for (unsigned i = 0; i != NumElts; ++i) {
1224 if (i != InsertPos->getValue())
1225 ShufOps.push_back(DAG.getConstant(i, ShufMaskEltVT));
1227 ShufOps.push_back(DAG.getConstant(NumElts, ShufMaskEltVT));
1229 SDOperand ShufMask = DAG.getNode(ISD::BUILD_VECTOR, ShufMaskVT,
1230 &ShufOps[0], ShufOps.size());
1232 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, Tmp1.getValueType(),
1233 Tmp1, ScVec, ShufMask);
1234 Result = LegalizeOp(Result);
1238 // If the target doesn't support this, we have to spill the input vector
1239 // to a temporary stack slot, update the element, then reload it. This is
1240 // badness. We could also load the value into a vector register (either
1241 // with a "move to register" or "extload into register" instruction, then
1242 // permute it into place, if the idx is a constant and if the idx is
1243 // supported by the target.
1244 MVT::ValueType VT = Tmp1.getValueType();
1245 MVT::ValueType EltVT = Tmp2.getValueType();
1246 MVT::ValueType IdxVT = Tmp3.getValueType();
1247 MVT::ValueType PtrVT = TLI.getPointerTy();
1248 SDOperand StackPtr = DAG.CreateStackTemporary(VT);
1249 // Store the vector.
1250 SDOperand Ch = DAG.getStore(DAG.getEntryNode(), Tmp1, StackPtr, NULL, 0);
1252 // Truncate or zero extend offset to target pointer type.
1253 unsigned CastOpc = (IdxVT > PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
1254 Tmp3 = DAG.getNode(CastOpc, PtrVT, Tmp3);
1255 // Add the offset to the index.
1256 unsigned EltSize = MVT::getSizeInBits(EltVT)/8;
1257 Tmp3 = DAG.getNode(ISD::MUL, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
1258 SDOperand StackPtr2 = DAG.getNode(ISD::ADD, IdxVT, Tmp3, StackPtr);
1259 // Store the scalar value.
1260 Ch = DAG.getStore(Ch, Tmp2, StackPtr2, NULL, 0);
1261 // Load the updated vector.
1262 Result = DAG.getLoad(VT, Ch, StackPtr, NULL, 0);
1267 case ISD::SCALAR_TO_VECTOR:
1268 if (!TLI.isTypeLegal(Node->getOperand(0).getValueType())) {
1269 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
1273 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVal
1274 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1275 switch (TLI.getOperationAction(ISD::SCALAR_TO_VECTOR,
1276 Node->getValueType(0))) {
1277 default: assert(0 && "This action is not supported yet!");
1278 case TargetLowering::Legal:
1280 case TargetLowering::Custom:
1281 Tmp3 = TLI.LowerOperation(Result, DAG);
1287 case TargetLowering::Expand:
1288 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
1292 case ISD::VECTOR_SHUFFLE:
1293 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input vectors,
1294 Tmp2 = LegalizeOp(Node->getOperand(1)); // but not the shuffle mask.
1295 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1297 // Allow targets to custom lower the SHUFFLEs they support.
1298 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE,Result.getValueType())) {
1299 default: assert(0 && "Unknown operation action!");
1300 case TargetLowering::Legal:
1301 assert(isShuffleLegal(Result.getValueType(), Node->getOperand(2)) &&
1302 "vector shuffle should not be created if not legal!");
1304 case TargetLowering::Custom:
1305 Tmp3 = TLI.LowerOperation(Result, DAG);
1311 case TargetLowering::Expand: {
1312 MVT::ValueType VT = Node->getValueType(0);
1313 MVT::ValueType EltVT = MVT::getVectorElementType(VT);
1314 MVT::ValueType PtrVT = TLI.getPointerTy();
1315 SDOperand Mask = Node->getOperand(2);
1316 unsigned NumElems = Mask.getNumOperands();
1317 SmallVector<SDOperand,8> Ops;
1318 for (unsigned i = 0; i != NumElems; ++i) {
1319 SDOperand Arg = Mask.getOperand(i);
1320 if (Arg.getOpcode() == ISD::UNDEF) {
1321 Ops.push_back(DAG.getNode(ISD::UNDEF, EltVT));
1323 assert(isa<ConstantSDNode>(Arg) && "Invalid VECTOR_SHUFFLE mask!");
1324 unsigned Idx = cast<ConstantSDNode>(Arg)->getValue();
1326 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1,
1327 DAG.getConstant(Idx, PtrVT)));
1329 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2,
1330 DAG.getConstant(Idx - NumElems, PtrVT)));
1333 Result = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
1336 case TargetLowering::Promote: {
1337 // Change base type to a different vector type.
1338 MVT::ValueType OVT = Node->getValueType(0);
1339 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
1341 // Cast the two input vectors.
1342 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
1343 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
1345 // Convert the shuffle mask to the right # elements.
1346 Tmp3 = SDOperand(isShuffleLegal(OVT, Node->getOperand(2)), 0);
1347 assert(Tmp3.Val && "Shuffle not legal?");
1348 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NVT, Tmp1, Tmp2, Tmp3);
1349 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
1355 case ISD::EXTRACT_VECTOR_ELT:
1356 Tmp1 = Node->getOperand(0);
1357 Tmp2 = LegalizeOp(Node->getOperand(1));
1358 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1359 Result = ExpandEXTRACT_VECTOR_ELT(Result);
1362 case ISD::EXTRACT_SUBVECTOR:
1363 Tmp1 = Node->getOperand(0);
1364 Tmp2 = LegalizeOp(Node->getOperand(1));
1365 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1366 Result = ExpandEXTRACT_SUBVECTOR(Result);
1369 case ISD::CALLSEQ_START: {
1370 SDNode *CallEnd = FindCallEndFromCallStart(Node);
1372 // Recursively Legalize all of the inputs of the call end that do not lead
1373 // to this call start. This ensures that any libcalls that need be inserted
1374 // are inserted *before* the CALLSEQ_START.
1375 {SmallPtrSet<SDNode*, 32> NodesLeadingTo;
1376 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
1377 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).Val, Node,
1381 // Now that we legalized all of the inputs (which may have inserted
1382 // libcalls) create the new CALLSEQ_START node.
1383 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1385 // Merge in the last call, to ensure that this call start after the last
1387 if (LastCALLSEQ_END.getOpcode() != ISD::EntryToken) {
1388 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1389 Tmp1 = LegalizeOp(Tmp1);
1392 // Do not try to legalize the target-specific arguments (#1+).
1393 if (Tmp1 != Node->getOperand(0)) {
1394 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1396 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1399 // Remember that the CALLSEQ_START is legalized.
1400 AddLegalizedOperand(Op.getValue(0), Result);
1401 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
1402 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1404 // Now that the callseq_start and all of the non-call nodes above this call
1405 // sequence have been legalized, legalize the call itself. During this
1406 // process, no libcalls can/will be inserted, guaranteeing that no calls
1408 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
1409 SDOperand InCallSEQ = LastCALLSEQ_END;
1410 // Note that we are selecting this call!
1411 LastCALLSEQ_END = SDOperand(CallEnd, 0);
1412 IsLegalizingCall = true;
1414 // Legalize the call, starting from the CALLSEQ_END.
1415 LegalizeOp(LastCALLSEQ_END);
1416 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
1419 case ISD::CALLSEQ_END:
1420 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
1421 // will cause this node to be legalized as well as handling libcalls right.
1422 if (LastCALLSEQ_END.Val != Node) {
1423 LegalizeOp(SDOperand(FindCallStartFromCallEnd(Node), 0));
1424 DenseMap<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
1425 assert(I != LegalizedNodes.end() &&
1426 "Legalizing the call start should have legalized this node!");
1430 // Otherwise, the call start has been legalized and everything is going
1431 // according to plan. Just legalize ourselves normally here.
1432 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1433 // Do not try to legalize the target-specific arguments (#1+), except for
1434 // an optional flag input.
1435 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
1436 if (Tmp1 != Node->getOperand(0)) {
1437 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1439 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1442 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
1443 if (Tmp1 != Node->getOperand(0) ||
1444 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
1445 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1448 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1451 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
1452 // This finishes up call legalization.
1453 IsLegalizingCall = false;
1455 // If the CALLSEQ_END node has a flag, remember that we legalized it.
1456 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1457 if (Node->getNumValues() == 2)
1458 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1459 return Result.getValue(Op.ResNo);
1460 case ISD::DYNAMIC_STACKALLOC: {
1461 MVT::ValueType VT = Node->getValueType(0);
1462 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1463 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size.
1464 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment.
1465 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1467 Tmp1 = Result.getValue(0);
1468 Tmp2 = Result.getValue(1);
1469 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1470 default: assert(0 && "This action is not supported yet!");
1471 case TargetLowering::Expand: {
1472 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1473 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1474 " not tell us which reg is the stack pointer!");
1475 SDOperand Chain = Tmp1.getOperand(0);
1476 SDOperand Size = Tmp2.getOperand(1);
1477 SDOperand SP = DAG.getCopyFromReg(Chain, SPReg, VT);
1478 Chain = SP.getValue(1);
1479 unsigned Align = cast<ConstantSDNode>(Tmp3)->getValue();
1480 unsigned StackAlign =
1481 TLI.getTargetMachine().getFrameInfo()->getStackAlignment();
1482 if (Align > StackAlign)
1483 SP = DAG.getNode(ISD::AND, VT, SP,
1484 DAG.getConstant(-(uint64_t)Align, VT));
1485 Tmp1 = DAG.getNode(ISD::SUB, VT, SP, Size); // Value
1486 Tmp2 = DAG.getCopyToReg(Chain, SPReg, Tmp1); // Output chain
1487 Tmp1 = LegalizeOp(Tmp1);
1488 Tmp2 = LegalizeOp(Tmp2);
1491 case TargetLowering::Custom:
1492 Tmp3 = TLI.LowerOperation(Tmp1, DAG);
1494 Tmp1 = LegalizeOp(Tmp3);
1495 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1498 case TargetLowering::Legal:
1501 // Since this op produce two values, make sure to remember that we
1502 // legalized both of them.
1503 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1504 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1505 return Op.ResNo ? Tmp2 : Tmp1;
1507 case ISD::INLINEASM: {
1508 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1509 bool Changed = false;
1510 // Legalize all of the operands of the inline asm, in case they are nodes
1511 // that need to be expanded or something. Note we skip the asm string and
1512 // all of the TargetConstant flags.
1513 SDOperand Op = LegalizeOp(Ops[0]);
1514 Changed = Op != Ops[0];
1517 bool HasInFlag = Ops.back().getValueType() == MVT::Flag;
1518 for (unsigned i = 2, e = Ops.size()-HasInFlag; i < e; ) {
1519 unsigned NumVals = cast<ConstantSDNode>(Ops[i])->getValue() >> 3;
1520 for (++i; NumVals; ++i, --NumVals) {
1521 SDOperand Op = LegalizeOp(Ops[i]);
1530 Op = LegalizeOp(Ops.back());
1531 Changed |= Op != Ops.back();
1536 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1538 // INLINE asm returns a chain and flag, make sure to add both to the map.
1539 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1540 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1541 return Result.getValue(Op.ResNo);
1544 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1545 // Ensure that libcalls are emitted before a branch.
1546 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1547 Tmp1 = LegalizeOp(Tmp1);
1548 LastCALLSEQ_END = DAG.getEntryNode();
1550 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1553 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1554 // Ensure that libcalls are emitted before a branch.
1555 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1556 Tmp1 = LegalizeOp(Tmp1);
1557 LastCALLSEQ_END = DAG.getEntryNode();
1559 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1560 default: assert(0 && "Indirect target must be legal type (pointer)!");
1562 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1565 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1568 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1569 // Ensure that libcalls are emitted before a branch.
1570 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1571 Tmp1 = LegalizeOp(Tmp1);
1572 LastCALLSEQ_END = DAG.getEntryNode();
1574 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the jumptable node.
1575 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1577 switch (TLI.getOperationAction(ISD::BR_JT, MVT::Other)) {
1578 default: assert(0 && "This action is not supported yet!");
1579 case TargetLowering::Legal: break;
1580 case TargetLowering::Custom:
1581 Tmp1 = TLI.LowerOperation(Result, DAG);
1582 if (Tmp1.Val) Result = Tmp1;
1584 case TargetLowering::Expand: {
1585 SDOperand Chain = Result.getOperand(0);
1586 SDOperand Table = Result.getOperand(1);
1587 SDOperand Index = Result.getOperand(2);
1589 MVT::ValueType PTy = TLI.getPointerTy();
1590 MachineFunction &MF = DAG.getMachineFunction();
1591 unsigned EntrySize = MF.getJumpTableInfo()->getEntrySize();
1592 Index= DAG.getNode(ISD::MUL, PTy, Index, DAG.getConstant(EntrySize, PTy));
1593 SDOperand Addr = DAG.getNode(ISD::ADD, PTy, Index, Table);
1596 switch (EntrySize) {
1597 default: assert(0 && "Size of jump table not supported yet."); break;
1598 case 4: LD = DAG.getLoad(MVT::i32, Chain, Addr, NULL, 0); break;
1599 case 8: LD = DAG.getLoad(MVT::i64, Chain, Addr, NULL, 0); break;
1602 if (TLI.getTargetMachine().getRelocationModel() == Reloc::PIC_) {
1603 // For PIC, the sequence is:
1604 // BRIND(load(Jumptable + index) + RelocBase)
1605 // RelocBase is the JumpTable on PPC and X86, GOT on Alpha
1607 if (TLI.usesGlobalOffsetTable())
1608 Reloc = DAG.getNode(ISD::GLOBAL_OFFSET_TABLE, PTy);
1611 Addr = (PTy != MVT::i32) ? DAG.getNode(ISD::SIGN_EXTEND, PTy, LD) : LD;
1612 Addr = DAG.getNode(ISD::ADD, PTy, Addr, Reloc);
1613 Result = DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), Addr);
1615 Result = DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), LD);
1621 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1622 // Ensure that libcalls are emitted before a return.
1623 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1624 Tmp1 = LegalizeOp(Tmp1);
1625 LastCALLSEQ_END = DAG.getEntryNode();
1627 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1628 case Expand: assert(0 && "It's impossible to expand bools");
1630 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1633 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition.
1635 // The top bits of the promoted condition are not necessarily zero, ensure
1636 // that the value is properly zero extended.
1637 if (!DAG.MaskedValueIsZero(Tmp2,
1638 MVT::getIntVTBitMask(Tmp2.getValueType())^1))
1639 Tmp2 = DAG.getZeroExtendInReg(Tmp2, MVT::i1);
1643 // Basic block destination (Op#2) is always legal.
1644 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1646 switch (TLI.getOperationAction(ISD::BRCOND, MVT::Other)) {
1647 default: assert(0 && "This action is not supported yet!");
1648 case TargetLowering::Legal: break;
1649 case TargetLowering::Custom:
1650 Tmp1 = TLI.LowerOperation(Result, DAG);
1651 if (Tmp1.Val) Result = Tmp1;
1653 case TargetLowering::Expand:
1654 // Expand brcond's setcc into its constituent parts and create a BR_CC
1656 if (Tmp2.getOpcode() == ISD::SETCC) {
1657 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1, Tmp2.getOperand(2),
1658 Tmp2.getOperand(0), Tmp2.getOperand(1),
1659 Node->getOperand(2));
1661 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1,
1662 DAG.getCondCode(ISD::SETNE), Tmp2,
1663 DAG.getConstant(0, Tmp2.getValueType()),
1664 Node->getOperand(2));
1670 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1671 // Ensure that libcalls are emitted before a branch.
1672 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1673 Tmp1 = LegalizeOp(Tmp1);
1674 Tmp2 = Node->getOperand(2); // LHS
1675 Tmp3 = Node->getOperand(3); // RHS
1676 Tmp4 = Node->getOperand(1); // CC
1678 LegalizeSetCCOperands(Tmp2, Tmp3, Tmp4);
1679 LastCALLSEQ_END = DAG.getEntryNode();
1681 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1682 // the LHS is a legal SETCC itself. In this case, we need to compare
1683 // the result against zero to select between true and false values.
1684 if (Tmp3.Val == 0) {
1685 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
1686 Tmp4 = DAG.getCondCode(ISD::SETNE);
1689 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp4, Tmp2, Tmp3,
1690 Node->getOperand(4));
1692 switch (TLI.getOperationAction(ISD::BR_CC, Tmp3.getValueType())) {
1693 default: assert(0 && "Unexpected action for BR_CC!");
1694 case TargetLowering::Legal: break;
1695 case TargetLowering::Custom:
1696 Tmp4 = TLI.LowerOperation(Result, DAG);
1697 if (Tmp4.Val) Result = Tmp4;
1702 LoadSDNode *LD = cast<LoadSDNode>(Node);
1703 Tmp1 = LegalizeOp(LD->getChain()); // Legalize the chain.
1704 Tmp2 = LegalizeOp(LD->getBasePtr()); // Legalize the base pointer.
1706 ISD::LoadExtType ExtType = LD->getExtensionType();
1707 if (ExtType == ISD::NON_EXTLOAD) {
1708 MVT::ValueType VT = Node->getValueType(0);
1709 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1710 Tmp3 = Result.getValue(0);
1711 Tmp4 = Result.getValue(1);
1713 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1714 default: assert(0 && "This action is not supported yet!");
1715 case TargetLowering::Legal:
1716 // If this is an unaligned load and the target doesn't support it,
1718 if (!TLI.allowsUnalignedMemoryAccesses()) {
1719 unsigned ABIAlignment = TLI.getTargetData()->
1720 getABITypeAlignment(MVT::getTypeForValueType(LD->getLoadedVT()));
1721 if (LD->getAlignment() < ABIAlignment){
1722 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.Val), DAG,
1724 Tmp3 = Result.getOperand(0);
1725 Tmp4 = Result.getOperand(1);
1726 Tmp3 = LegalizeOp(Tmp3);
1727 Tmp4 = LegalizeOp(Tmp4);
1731 case TargetLowering::Custom:
1732 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
1734 Tmp3 = LegalizeOp(Tmp1);
1735 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1738 case TargetLowering::Promote: {
1739 // Only promote a load of vector type to another.
1740 assert(MVT::isVector(VT) && "Cannot promote this load!");
1741 // Change base type to a different vector type.
1742 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
1744 Tmp1 = DAG.getLoad(NVT, Tmp1, Tmp2, LD->getSrcValue(),
1745 LD->getSrcValueOffset(),
1746 LD->isVolatile(), LD->getAlignment());
1747 Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp1));
1748 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1752 // Since loads produce two values, make sure to remember that we
1753 // legalized both of them.
1754 AddLegalizedOperand(SDOperand(Node, 0), Tmp3);
1755 AddLegalizedOperand(SDOperand(Node, 1), Tmp4);
1756 return Op.ResNo ? Tmp4 : Tmp3;
1758 MVT::ValueType SrcVT = LD->getLoadedVT();
1759 switch (TLI.getLoadXAction(ExtType, SrcVT)) {
1760 default: assert(0 && "This action is not supported yet!");
1761 case TargetLowering::Promote:
1762 assert(SrcVT == MVT::i1 &&
1763 "Can only promote extending LOAD from i1 -> i8!");
1764 Result = DAG.getExtLoad(ExtType, Node->getValueType(0), Tmp1, Tmp2,
1765 LD->getSrcValue(), LD->getSrcValueOffset(),
1766 MVT::i8, LD->isVolatile(), LD->getAlignment());
1767 Tmp1 = Result.getValue(0);
1768 Tmp2 = Result.getValue(1);
1770 case TargetLowering::Custom:
1773 case TargetLowering::Legal:
1774 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1775 Tmp1 = Result.getValue(0);
1776 Tmp2 = Result.getValue(1);
1779 Tmp3 = TLI.LowerOperation(Result, DAG);
1781 Tmp1 = LegalizeOp(Tmp3);
1782 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1785 // If this is an unaligned load and the target doesn't support it,
1787 if (!TLI.allowsUnalignedMemoryAccesses()) {
1788 unsigned ABIAlignment = TLI.getTargetData()->
1789 getABITypeAlignment(MVT::getTypeForValueType(LD->getLoadedVT()));
1790 if (LD->getAlignment() < ABIAlignment){
1791 Result = ExpandUnalignedLoad(cast<LoadSDNode>(Result.Val), DAG,
1793 Tmp1 = Result.getOperand(0);
1794 Tmp2 = Result.getOperand(1);
1795 Tmp1 = LegalizeOp(Tmp1);
1796 Tmp2 = LegalizeOp(Tmp2);
1801 case TargetLowering::Expand:
1802 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
1803 if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) {
1804 SDOperand Load = DAG.getLoad(SrcVT, Tmp1, Tmp2, LD->getSrcValue(),
1805 LD->getSrcValueOffset(),
1806 LD->isVolatile(), LD->getAlignment());
1807 Result = DAG.getNode(ISD::FP_EXTEND, Node->getValueType(0), Load);
1808 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
1809 Tmp2 = LegalizeOp(Load.getValue(1));
1812 assert(ExtType != ISD::EXTLOAD &&"EXTLOAD should always be supported!");
1813 // Turn the unsupported load into an EXTLOAD followed by an explicit
1814 // zero/sign extend inreg.
1815 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
1816 Tmp1, Tmp2, LD->getSrcValue(),
1817 LD->getSrcValueOffset(), SrcVT,
1818 LD->isVolatile(), LD->getAlignment());
1820 if (ExtType == ISD::SEXTLOAD)
1821 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
1822 Result, DAG.getValueType(SrcVT));
1824 ValRes = DAG.getZeroExtendInReg(Result, SrcVT);
1825 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
1826 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
1829 // Since loads produce two values, make sure to remember that we legalized
1831 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1832 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1833 return Op.ResNo ? Tmp2 : Tmp1;
1836 case ISD::EXTRACT_ELEMENT: {
1837 MVT::ValueType OpTy = Node->getOperand(0).getValueType();
1838 switch (getTypeAction(OpTy)) {
1839 default: assert(0 && "EXTRACT_ELEMENT action for type unimplemented!");
1841 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) {
1843 Result = DAG.getNode(ISD::SRL, OpTy, Node->getOperand(0),
1844 DAG.getConstant(MVT::getSizeInBits(OpTy)/2,
1845 TLI.getShiftAmountTy()));
1846 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Result);
1849 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0),
1850 Node->getOperand(0));
1854 // Get both the low and high parts.
1855 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
1856 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue())
1857 Result = Tmp2; // 1 -> Hi
1859 Result = Tmp1; // 0 -> Lo
1865 case ISD::CopyToReg:
1866 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1868 assert(isTypeLegal(Node->getOperand(2).getValueType()) &&
1869 "Register type must be legal!");
1870 // Legalize the incoming value (must be a legal type).
1871 Tmp2 = LegalizeOp(Node->getOperand(2));
1872 if (Node->getNumValues() == 1) {
1873 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2);
1875 assert(Node->getNumValues() == 2 && "Unknown CopyToReg");
1876 if (Node->getNumOperands() == 4) {
1877 Tmp3 = LegalizeOp(Node->getOperand(3));
1878 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2,
1881 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
1884 // Since this produces two values, make sure to remember that we legalized
1886 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1887 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1893 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1895 // Ensure that libcalls are emitted before a return.
1896 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1897 Tmp1 = LegalizeOp(Tmp1);
1898 LastCALLSEQ_END = DAG.getEntryNode();
1900 switch (Node->getNumOperands()) {
1902 Tmp2 = Node->getOperand(1);
1903 Tmp3 = Node->getOperand(2); // Signness
1904 switch (getTypeAction(Tmp2.getValueType())) {
1906 Result = DAG.UpdateNodeOperands(Result, Tmp1, LegalizeOp(Tmp2), Tmp3);
1909 if (!MVT::isVector(Tmp2.getValueType())) {
1911 ExpandOp(Tmp2, Lo, Hi);
1913 // Big endian systems want the hi reg first.
1914 if (!TLI.isLittleEndian())
1918 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi,Tmp3);
1920 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3);
1921 Result = LegalizeOp(Result);
1923 SDNode *InVal = Tmp2.Val;
1924 int InIx = Tmp2.ResNo;
1925 unsigned NumElems = MVT::getVectorNumElements(InVal->getValueType(InIx));
1926 MVT::ValueType EVT = MVT::getVectorElementType(InVal->getValueType(InIx));
1928 // Figure out if there is a simple type corresponding to this Vector
1929 // type. If so, convert to the vector type.
1930 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
1931 if (TLI.isTypeLegal(TVT)) {
1932 // Turn this into a return of the vector type.
1933 Tmp2 = LegalizeOp(Tmp2);
1934 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1935 } else if (NumElems == 1) {
1936 // Turn this into a return of the scalar type.
1937 Tmp2 = ScalarizeVectorOp(Tmp2);
1938 Tmp2 = LegalizeOp(Tmp2);
1939 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1941 // FIXME: Returns of gcc generic vectors smaller than a legal type
1942 // should be returned in integer registers!
1944 // The scalarized value type may not be legal, e.g. it might require
1945 // promotion or expansion. Relegalize the return.
1946 Result = LegalizeOp(Result);
1948 // FIXME: Returns of gcc generic vectors larger than a legal vector
1949 // type should be returned by reference!
1951 SplitVectorOp(Tmp2, Lo, Hi);
1952 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi,Tmp3);
1953 Result = LegalizeOp(Result);
1958 Tmp2 = PromoteOp(Node->getOperand(1));
1959 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1960 Result = LegalizeOp(Result);
1965 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1967 default: { // ret <values>
1968 SmallVector<SDOperand, 8> NewValues;
1969 NewValues.push_back(Tmp1);
1970 for (unsigned i = 1, e = Node->getNumOperands(); i < e; i += 2)
1971 switch (getTypeAction(Node->getOperand(i).getValueType())) {
1973 NewValues.push_back(LegalizeOp(Node->getOperand(i)));
1974 NewValues.push_back(Node->getOperand(i+1));
1978 assert(!MVT::isExtendedVT(Node->getOperand(i).getValueType()) &&
1979 "FIXME: TODO: implement returning non-legal vector types!");
1980 ExpandOp(Node->getOperand(i), Lo, Hi);
1981 NewValues.push_back(Lo);
1982 NewValues.push_back(Node->getOperand(i+1));
1984 NewValues.push_back(Hi);
1985 NewValues.push_back(Node->getOperand(i+1));
1990 assert(0 && "Can't promote multiple return value yet!");
1993 if (NewValues.size() == Node->getNumOperands())
1994 Result = DAG.UpdateNodeOperands(Result, &NewValues[0],NewValues.size());
1996 Result = DAG.getNode(ISD::RET, MVT::Other,
1997 &NewValues[0], NewValues.size());
2002 if (Result.getOpcode() == ISD::RET) {
2003 switch (TLI.getOperationAction(Result.getOpcode(), MVT::Other)) {
2004 default: assert(0 && "This action is not supported yet!");
2005 case TargetLowering::Legal: break;
2006 case TargetLowering::Custom:
2007 Tmp1 = TLI.LowerOperation(Result, DAG);
2008 if (Tmp1.Val) Result = Tmp1;
2014 StoreSDNode *ST = cast<StoreSDNode>(Node);
2015 Tmp1 = LegalizeOp(ST->getChain()); // Legalize the chain.
2016 Tmp2 = LegalizeOp(ST->getBasePtr()); // Legalize the pointer.
2017 int SVOffset = ST->getSrcValueOffset();
2018 unsigned Alignment = ST->getAlignment();
2019 bool isVolatile = ST->isVolatile();
2021 if (!ST->isTruncatingStore()) {
2022 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
2023 // FIXME: We shouldn't do this for TargetConstantFP's.
2024 // FIXME: move this to the DAG Combiner! Note that we can't regress due
2025 // to phase ordering between legalized code and the dag combiner. This
2026 // probably means that we need to integrate dag combiner and legalizer
2028 // We generally can't do this one for long doubles.
2029 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(ST->getValue())) {
2030 if (CFP->getValueType(0) == MVT::f32 &&
2031 getTypeAction(MVT::i32) == Legal) {
2032 Tmp3 = DAG.getConstant((uint32_t)CFP->getValueAPF().
2033 convertToAPInt().getZExtValue(),
2035 Result = DAG.getStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
2036 SVOffset, isVolatile, Alignment);
2038 } else if (CFP->getValueType(0) == MVT::f64) {
2039 // If this target supports 64-bit registers, do a single 64-bit store.
2040 if (getTypeAction(MVT::i64) == Legal) {
2041 Tmp3 = DAG.getConstant(CFP->getValueAPF().convertToAPInt().
2042 getZExtValue(), MVT::i64);
2043 Result = DAG.getStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
2044 SVOffset, isVolatile, Alignment);
2046 } else if (getTypeAction(MVT::i32) == Legal) {
2047 // Otherwise, if the target supports 32-bit registers, use 2 32-bit
2048 // stores. If the target supports neither 32- nor 64-bits, this
2049 // xform is certainly not worth it.
2050 uint64_t IntVal =CFP->getValueAPF().convertToAPInt().getZExtValue();
2051 SDOperand Lo = DAG.getConstant(uint32_t(IntVal), MVT::i32);
2052 SDOperand Hi = DAG.getConstant(uint32_t(IntVal >>32), MVT::i32);
2053 if (!TLI.isLittleEndian()) std::swap(Lo, Hi);
2055 Lo = DAG.getStore(Tmp1, Lo, Tmp2, ST->getSrcValue(),
2056 SVOffset, isVolatile, Alignment);
2057 Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2,
2058 getIntPtrConstant(4));
2059 Hi = DAG.getStore(Tmp1, Hi, Tmp2, ST->getSrcValue(), SVOffset+4,
2060 isVolatile, MinAlign(Alignment, 4U));
2062 Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi);
2068 switch (getTypeAction(ST->getStoredVT())) {
2070 Tmp3 = LegalizeOp(ST->getValue());
2071 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
2074 MVT::ValueType VT = Tmp3.getValueType();
2075 switch (TLI.getOperationAction(ISD::STORE, VT)) {
2076 default: assert(0 && "This action is not supported yet!");
2077 case TargetLowering::Legal:
2078 // If this is an unaligned store and the target doesn't support it,
2080 if (!TLI.allowsUnalignedMemoryAccesses()) {
2081 unsigned ABIAlignment = TLI.getTargetData()->
2082 getABITypeAlignment(MVT::getTypeForValueType(ST->getStoredVT()));
2083 if (ST->getAlignment() < ABIAlignment)
2084 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.Val), DAG,
2088 case TargetLowering::Custom:
2089 Tmp1 = TLI.LowerOperation(Result, DAG);
2090 if (Tmp1.Val) Result = Tmp1;
2092 case TargetLowering::Promote:
2093 assert(MVT::isVector(VT) && "Unknown legal promote case!");
2094 Tmp3 = DAG.getNode(ISD::BIT_CONVERT,
2095 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
2096 Result = DAG.getStore(Tmp1, Tmp3, Tmp2,
2097 ST->getSrcValue(), SVOffset, isVolatile,
2104 // Truncate the value and store the result.
2105 Tmp3 = PromoteOp(ST->getValue());
2106 Result = DAG.getTruncStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
2107 SVOffset, ST->getStoredVT(),
2108 isVolatile, Alignment);
2112 unsigned IncrementSize = 0;
2115 // If this is a vector type, then we have to calculate the increment as
2116 // the product of the element size in bytes, and the number of elements
2117 // in the high half of the vector.
2118 if (MVT::isVector(ST->getValue().getValueType())) {
2119 SDNode *InVal = ST->getValue().Val;
2120 int InIx = ST->getValue().ResNo;
2121 unsigned NumElems = MVT::getVectorNumElements(InVal->getValueType(InIx));
2122 MVT::ValueType EVT = MVT::getVectorElementType(InVal->getValueType(InIx));
2124 // Figure out if there is a simple type corresponding to this Vector
2125 // type. If so, convert to the vector type.
2126 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
2127 if (TLI.isTypeLegal(TVT)) {
2128 // Turn this into a normal store of the vector type.
2129 Tmp3 = LegalizeOp(Node->getOperand(1));
2130 Result = DAG.getStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
2131 SVOffset, isVolatile, Alignment);
2132 Result = LegalizeOp(Result);
2134 } else if (NumElems == 1) {
2135 // Turn this into a normal store of the scalar type.
2136 Tmp3 = ScalarizeVectorOp(Node->getOperand(1));
2137 Result = DAG.getStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
2138 SVOffset, isVolatile, Alignment);
2139 // The scalarized value type may not be legal, e.g. it might require
2140 // promotion or expansion. Relegalize the scalar store.
2141 Result = LegalizeOp(Result);
2144 SplitVectorOp(Node->getOperand(1), Lo, Hi);
2145 IncrementSize = NumElems/2 * MVT::getSizeInBits(EVT)/8;
2148 ExpandOp(Node->getOperand(1), Lo, Hi);
2149 IncrementSize = Hi.Val ? MVT::getSizeInBits(Hi.getValueType())/8 : 0;
2151 if (!TLI.isLittleEndian())
2155 Lo = DAG.getStore(Tmp1, Lo, Tmp2, ST->getSrcValue(),
2156 SVOffset, isVolatile, Alignment);
2158 if (Hi.Val == NULL) {
2159 // Must be int <-> float one-to-one expansion.
2164 Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2,
2165 getIntPtrConstant(IncrementSize));
2166 assert(isTypeLegal(Tmp2.getValueType()) &&
2167 "Pointers must be legal!");
2168 SVOffset += IncrementSize;
2169 Alignment = MinAlign(Alignment, IncrementSize);
2170 Hi = DAG.getStore(Tmp1, Hi, Tmp2, ST->getSrcValue(),
2171 SVOffset, isVolatile, Alignment);
2172 Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi);
2177 assert(isTypeLegal(ST->getValue().getValueType()) &&
2178 "Cannot handle illegal TRUNCSTORE yet!");
2179 Tmp3 = LegalizeOp(ST->getValue());
2181 // The only promote case we handle is TRUNCSTORE:i1 X into
2182 // -> TRUNCSTORE:i8 (and X, 1)
2183 if (ST->getStoredVT() == MVT::i1 &&
2184 TLI.getStoreXAction(MVT::i1) == TargetLowering::Promote) {
2185 // Promote the bool to a mask then store.
2186 Tmp3 = DAG.getNode(ISD::AND, Tmp3.getValueType(), Tmp3,
2187 DAG.getConstant(1, Tmp3.getValueType()));
2188 Result = DAG.getTruncStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
2190 isVolatile, Alignment);
2191 } else if (Tmp1 != ST->getChain() || Tmp3 != ST->getValue() ||
2192 Tmp2 != ST->getBasePtr()) {
2193 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
2197 MVT::ValueType StVT = cast<StoreSDNode>(Result.Val)->getStoredVT();
2198 switch (TLI.getStoreXAction(StVT)) {
2199 default: assert(0 && "This action is not supported yet!");
2200 case TargetLowering::Legal:
2201 // If this is an unaligned store and the target doesn't support it,
2203 if (!TLI.allowsUnalignedMemoryAccesses()) {
2204 unsigned ABIAlignment = TLI.getTargetData()->
2205 getABITypeAlignment(MVT::getTypeForValueType(ST->getStoredVT()));
2206 if (ST->getAlignment() < ABIAlignment)
2207 Result = ExpandUnalignedStore(cast<StoreSDNode>(Result.Val), DAG,
2211 case TargetLowering::Custom:
2212 Tmp1 = TLI.LowerOperation(Result, DAG);
2213 if (Tmp1.Val) Result = Tmp1;
2220 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2221 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
2223 case ISD::STACKSAVE:
2224 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2225 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2226 Tmp1 = Result.getValue(0);
2227 Tmp2 = Result.getValue(1);
2229 switch (TLI.getOperationAction(ISD::STACKSAVE, MVT::Other)) {
2230 default: assert(0 && "This action is not supported yet!");
2231 case TargetLowering::Legal: break;
2232 case TargetLowering::Custom:
2233 Tmp3 = TLI.LowerOperation(Result, DAG);
2235 Tmp1 = LegalizeOp(Tmp3);
2236 Tmp2 = LegalizeOp(Tmp3.getValue(1));
2239 case TargetLowering::Expand:
2240 // Expand to CopyFromReg if the target set
2241 // StackPointerRegisterToSaveRestore.
2242 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2243 Tmp1 = DAG.getCopyFromReg(Result.getOperand(0), SP,
2244 Node->getValueType(0));
2245 Tmp2 = Tmp1.getValue(1);
2247 Tmp1 = DAG.getNode(ISD::UNDEF, Node->getValueType(0));
2248 Tmp2 = Node->getOperand(0);
2253 // Since stacksave produce two values, make sure to remember that we
2254 // legalized both of them.
2255 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
2256 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
2257 return Op.ResNo ? Tmp2 : Tmp1;
2259 case ISD::STACKRESTORE:
2260 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2261 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2262 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2264 switch (TLI.getOperationAction(ISD::STACKRESTORE, MVT::Other)) {
2265 default: assert(0 && "This action is not supported yet!");
2266 case TargetLowering::Legal: break;
2267 case TargetLowering::Custom:
2268 Tmp1 = TLI.LowerOperation(Result, DAG);
2269 if (Tmp1.Val) Result = Tmp1;
2271 case TargetLowering::Expand:
2272 // Expand to CopyToReg if the target set
2273 // StackPointerRegisterToSaveRestore.
2274 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
2275 Result = DAG.getCopyToReg(Tmp1, SP, Tmp2);
2283 case ISD::READCYCLECOUNTER:
2284 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain
2285 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2286 switch (TLI.getOperationAction(ISD::READCYCLECOUNTER,
2287 Node->getValueType(0))) {
2288 default: assert(0 && "This action is not supported yet!");
2289 case TargetLowering::Legal:
2290 Tmp1 = Result.getValue(0);
2291 Tmp2 = Result.getValue(1);
2293 case TargetLowering::Custom:
2294 Result = TLI.LowerOperation(Result, DAG);
2295 Tmp1 = LegalizeOp(Result.getValue(0));
2296 Tmp2 = LegalizeOp(Result.getValue(1));
2300 // Since rdcc produce two values, make sure to remember that we legalized
2302 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
2303 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
2307 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2308 case Expand: assert(0 && "It's impossible to expand bools");
2310 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition.
2313 Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition.
2314 // Make sure the condition is either zero or one.
2315 if (!DAG.MaskedValueIsZero(Tmp1,
2316 MVT::getIntVTBitMask(Tmp1.getValueType())^1))
2317 Tmp1 = DAG.getZeroExtendInReg(Tmp1, MVT::i1);
2320 Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal
2321 Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal
2323 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2325 switch (TLI.getOperationAction(ISD::SELECT, Tmp2.getValueType())) {
2326 default: assert(0 && "This action is not supported yet!");
2327 case TargetLowering::Legal: break;
2328 case TargetLowering::Custom: {
2329 Tmp1 = TLI.LowerOperation(Result, DAG);
2330 if (Tmp1.Val) Result = Tmp1;
2333 case TargetLowering::Expand:
2334 if (Tmp1.getOpcode() == ISD::SETCC) {
2335 Result = DAG.getSelectCC(Tmp1.getOperand(0), Tmp1.getOperand(1),
2337 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
2339 Result = DAG.getSelectCC(Tmp1,
2340 DAG.getConstant(0, Tmp1.getValueType()),
2341 Tmp2, Tmp3, ISD::SETNE);
2344 case TargetLowering::Promote: {
2345 MVT::ValueType NVT =
2346 TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType());
2347 unsigned ExtOp, TruncOp;
2348 if (MVT::isVector(Tmp2.getValueType())) {
2349 ExtOp = ISD::BIT_CONVERT;
2350 TruncOp = ISD::BIT_CONVERT;
2351 } else if (MVT::isInteger(Tmp2.getValueType())) {
2352 ExtOp = ISD::ANY_EXTEND;
2353 TruncOp = ISD::TRUNCATE;
2355 ExtOp = ISD::FP_EXTEND;
2356 TruncOp = ISD::FP_ROUND;
2358 // Promote each of the values to the new type.
2359 Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2);
2360 Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3);
2361 // Perform the larger operation, then round down.
2362 Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3);
2363 Result = DAG.getNode(TruncOp, Node->getValueType(0), Result);
2368 case ISD::SELECT_CC: {
2369 Tmp1 = Node->getOperand(0); // LHS
2370 Tmp2 = Node->getOperand(1); // RHS
2371 Tmp3 = LegalizeOp(Node->getOperand(2)); // True
2372 Tmp4 = LegalizeOp(Node->getOperand(3)); // False
2373 SDOperand CC = Node->getOperand(4);
2375 LegalizeSetCCOperands(Tmp1, Tmp2, CC);
2377 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
2378 // the LHS is a legal SETCC itself. In this case, we need to compare
2379 // the result against zero to select between true and false values.
2380 if (Tmp2.Val == 0) {
2381 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
2382 CC = DAG.getCondCode(ISD::SETNE);
2384 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, CC);
2386 // Everything is legal, see if we should expand this op or something.
2387 switch (TLI.getOperationAction(ISD::SELECT_CC, Tmp3.getValueType())) {
2388 default: assert(0 && "This action is not supported yet!");
2389 case TargetLowering::Legal: break;
2390 case TargetLowering::Custom:
2391 Tmp1 = TLI.LowerOperation(Result, DAG);
2392 if (Tmp1.Val) Result = Tmp1;
2398 Tmp1 = Node->getOperand(0);
2399 Tmp2 = Node->getOperand(1);
2400 Tmp3 = Node->getOperand(2);
2401 LegalizeSetCCOperands(Tmp1, Tmp2, Tmp3);
2403 // If we had to Expand the SetCC operands into a SELECT node, then it may
2404 // not always be possible to return a true LHS & RHS. In this case, just
2405 // return the value we legalized, returned in the LHS
2406 if (Tmp2.Val == 0) {
2411 switch (TLI.getOperationAction(ISD::SETCC, Tmp1.getValueType())) {
2412 default: assert(0 && "Cannot handle this action for SETCC yet!");
2413 case TargetLowering::Custom:
2416 case TargetLowering::Legal:
2417 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2419 Tmp4 = TLI.LowerOperation(Result, DAG);
2420 if (Tmp4.Val) Result = Tmp4;
2423 case TargetLowering::Promote: {
2424 // First step, figure out the appropriate operation to use.
2425 // Allow SETCC to not be supported for all legal data types
2426 // Mostly this targets FP
2427 MVT::ValueType NewInTy = Node->getOperand(0).getValueType();
2428 MVT::ValueType OldVT = NewInTy; OldVT = OldVT;
2430 // Scan for the appropriate larger type to use.
2432 NewInTy = (MVT::ValueType)(NewInTy+1);
2434 assert(MVT::isInteger(NewInTy) == MVT::isInteger(OldVT) &&
2435 "Fell off of the edge of the integer world");
2436 assert(MVT::isFloatingPoint(NewInTy) == MVT::isFloatingPoint(OldVT) &&
2437 "Fell off of the edge of the floating point world");
2439 // If the target supports SETCC of this type, use it.
2440 if (TLI.isOperationLegal(ISD::SETCC, NewInTy))
2443 if (MVT::isInteger(NewInTy))
2444 assert(0 && "Cannot promote Legal Integer SETCC yet");
2446 Tmp1 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp1);
2447 Tmp2 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp2);
2449 Tmp1 = LegalizeOp(Tmp1);
2450 Tmp2 = LegalizeOp(Tmp2);
2451 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2452 Result = LegalizeOp(Result);
2455 case TargetLowering::Expand:
2456 // Expand a setcc node into a select_cc of the same condition, lhs, and
2457 // rhs that selects between const 1 (true) and const 0 (false).
2458 MVT::ValueType VT = Node->getValueType(0);
2459 Result = DAG.getNode(ISD::SELECT_CC, VT, Tmp1, Tmp2,
2460 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
2467 case ISD::MEMMOVE: {
2468 Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain
2469 Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer
2471 if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte
2472 switch (getTypeAction(Node->getOperand(2).getValueType())) {
2473 case Expand: assert(0 && "Cannot expand a byte!");
2475 Tmp3 = LegalizeOp(Node->getOperand(2));
2478 Tmp3 = PromoteOp(Node->getOperand(2));
2482 Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer,
2486 switch (getTypeAction(Node->getOperand(3).getValueType())) {
2488 // Length is too big, just take the lo-part of the length.
2490 ExpandOp(Node->getOperand(3), Tmp4, HiPart);
2494 Tmp4 = LegalizeOp(Node->getOperand(3));
2497 Tmp4 = PromoteOp(Node->getOperand(3));
2502 switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint
2503 case Expand: assert(0 && "Cannot expand this yet!");
2505 Tmp5 = LegalizeOp(Node->getOperand(4));
2508 Tmp5 = PromoteOp(Node->getOperand(4));
2513 switch (getTypeAction(Node->getOperand(5).getValueType())) { // bool
2514 case Expand: assert(0 && "Cannot expand this yet!");
2516 Tmp6 = LegalizeOp(Node->getOperand(5));
2519 Tmp6 = PromoteOp(Node->getOperand(5));
2523 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
2524 default: assert(0 && "This action not implemented for this operation!");
2525 case TargetLowering::Custom:
2528 case TargetLowering::Legal: {
2529 SDOperand Ops[] = { Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6 };
2530 Result = DAG.UpdateNodeOperands(Result, Ops, 6);
2532 Tmp1 = TLI.LowerOperation(Result, DAG);
2533 if (Tmp1.Val) Result = Tmp1;
2537 case TargetLowering::Expand: {
2538 // Otherwise, the target does not support this operation. Lower the
2539 // operation to an explicit libcall as appropriate.
2540 MVT::ValueType IntPtr = TLI.getPointerTy();
2541 const Type *IntPtrTy = TLI.getTargetData()->getIntPtrType();
2542 TargetLowering::ArgListTy Args;
2543 TargetLowering::ArgListEntry Entry;
2545 const char *FnName = 0;
2546 if (Node->getOpcode() == ISD::MEMSET) {
2547 Entry.Node = Tmp2; Entry.Ty = IntPtrTy;
2548 Args.push_back(Entry);
2549 // Extend the (previously legalized) ubyte argument to be an int value
2551 if (Tmp3.getValueType() > MVT::i32)
2552 Tmp3 = DAG.getNode(ISD::TRUNCATE, MVT::i32, Tmp3);
2554 Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3);
2555 Entry.Node = Tmp3; Entry.Ty = Type::Int32Ty; Entry.isSExt = true;
2556 Args.push_back(Entry);
2557 Entry.Node = Tmp4; Entry.Ty = IntPtrTy; Entry.isSExt = false;
2558 Args.push_back(Entry);
2561 } else if (Node->getOpcode() == ISD::MEMCPY ||
2562 Node->getOpcode() == ISD::MEMMOVE) {
2563 Entry.Ty = IntPtrTy;
2564 Entry.Node = Tmp2; Args.push_back(Entry);
2565 Entry.Node = Tmp3; Args.push_back(Entry);
2566 Entry.Node = Tmp4; Args.push_back(Entry);
2567 FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy";
2569 assert(0 && "Unknown op!");
2572 std::pair<SDOperand,SDOperand> CallResult =
2573 TLI.LowerCallTo(Tmp1, Type::VoidTy, false, false, CallingConv::C, false,
2574 DAG.getExternalSymbol(FnName, IntPtr), Args, DAG);
2575 Result = CallResult.second;
2582 case ISD::SHL_PARTS:
2583 case ISD::SRA_PARTS:
2584 case ISD::SRL_PARTS: {
2585 SmallVector<SDOperand, 8> Ops;
2586 bool Changed = false;
2587 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
2588 Ops.push_back(LegalizeOp(Node->getOperand(i)));
2589 Changed |= Ops.back() != Node->getOperand(i);
2592 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
2594 switch (TLI.getOperationAction(Node->getOpcode(),
2595 Node->getValueType(0))) {
2596 default: assert(0 && "This action is not supported yet!");
2597 case TargetLowering::Legal: break;
2598 case TargetLowering::Custom:
2599 Tmp1 = TLI.LowerOperation(Result, DAG);
2601 SDOperand Tmp2, RetVal(0, 0);
2602 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
2603 Tmp2 = LegalizeOp(Tmp1.getValue(i));
2604 AddLegalizedOperand(SDOperand(Node, i), Tmp2);
2608 assert(RetVal.Val && "Illegal result number");
2614 // Since these produce multiple values, make sure to remember that we
2615 // legalized all of them.
2616 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
2617 AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i));
2618 return Result.getValue(Op.ResNo);
2640 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2641 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2642 case Expand: assert(0 && "Not possible");
2644 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2647 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2651 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2653 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2654 default: assert(0 && "BinOp legalize operation not supported");
2655 case TargetLowering::Legal: break;
2656 case TargetLowering::Custom:
2657 Tmp1 = TLI.LowerOperation(Result, DAG);
2658 if (Tmp1.Val) Result = Tmp1;
2660 case TargetLowering::Expand: {
2661 MVT::ValueType VT = Op.getValueType();
2663 // See if multiply or divide can be lowered using two-result operations.
2664 SDVTList VTs = DAG.getVTList(VT, VT);
2665 if (Node->getOpcode() == ISD::MUL) {
2666 // We just need the low half of the multiply; try both the signed
2667 // and unsigned forms. If the target supports both SMUL_LOHI and
2668 // UMUL_LOHI, form a preference by checking which forms of plain
2669 // MULH it supports.
2670 bool HasSMUL_LOHI = TLI.isOperationLegal(ISD::SMUL_LOHI, VT);
2671 bool HasUMUL_LOHI = TLI.isOperationLegal(ISD::UMUL_LOHI, VT);
2672 bool HasMULHS = TLI.isOperationLegal(ISD::MULHS, VT);
2673 bool HasMULHU = TLI.isOperationLegal(ISD::MULHU, VT);
2674 unsigned OpToUse = 0;
2675 if (HasSMUL_LOHI && !HasMULHS) {
2676 OpToUse = ISD::SMUL_LOHI;
2677 } else if (HasUMUL_LOHI && !HasMULHU) {
2678 OpToUse = ISD::UMUL_LOHI;
2679 } else if (HasSMUL_LOHI) {
2680 OpToUse = ISD::SMUL_LOHI;
2681 } else if (HasUMUL_LOHI) {
2682 OpToUse = ISD::UMUL_LOHI;
2685 Result = SDOperand(DAG.getNode(OpToUse, VTs, Tmp1, Tmp2).Val, 0);
2689 if (Node->getOpcode() == ISD::MULHS &&
2690 TLI.isOperationLegal(ISD::SMUL_LOHI, VT)) {
2691 Result = SDOperand(DAG.getNode(ISD::SMUL_LOHI, VTs, Tmp1, Tmp2).Val, 1);
2694 if (Node->getOpcode() == ISD::MULHU &&
2695 TLI.isOperationLegal(ISD::UMUL_LOHI, VT)) {
2696 Result = SDOperand(DAG.getNode(ISD::UMUL_LOHI, VTs, Tmp1, Tmp2).Val, 1);
2699 if (Node->getOpcode() == ISD::SDIV &&
2700 TLI.isOperationLegal(ISD::SDIVREM, VT)) {
2701 Result = SDOperand(DAG.getNode(ISD::SDIVREM, VTs, Tmp1, Tmp2).Val, 0);
2704 if (Node->getOpcode() == ISD::UDIV &&
2705 TLI.isOperationLegal(ISD::UDIVREM, VT)) {
2706 Result = SDOperand(DAG.getNode(ISD::UDIVREM, VTs, Tmp1, Tmp2).Val, 0);
2710 // Check to see if we have a libcall for this operator.
2711 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2712 bool isSigned = false;
2713 switch (Node->getOpcode()) {
2716 if (VT == MVT::i32) {
2717 LC = Node->getOpcode() == ISD::UDIV
2718 ? RTLIB::UDIV_I32 : RTLIB::SDIV_I32;
2719 isSigned = Node->getOpcode() == ISD::SDIV;
2723 LC = VT == MVT::f32 ? RTLIB::POW_F32 :
2724 VT == MVT::f64 ? RTLIB::POW_F64 :
2725 VT == MVT::f80 ? RTLIB::POW_F80 :
2726 VT == MVT::ppcf128 ? RTLIB::POW_PPCF128 :
2727 RTLIB::UNKNOWN_LIBCALL;
2731 if (LC != RTLIB::UNKNOWN_LIBCALL) {
2733 Result = ExpandLibCall(TLI.getLibcallName(LC), Node, isSigned, Dummy);
2737 assert(MVT::isVector(Node->getValueType(0)) &&
2738 "Cannot expand this binary operator!");
2739 // Expand the operation into a bunch of nasty scalar code.
2740 Result = LegalizeOp(UnrollVectorOp(Op));
2743 case TargetLowering::Promote: {
2744 switch (Node->getOpcode()) {
2745 default: assert(0 && "Do not know how to promote this BinOp!");
2749 MVT::ValueType OVT = Node->getValueType(0);
2750 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2751 assert(MVT::isVector(OVT) && "Cannot promote this BinOp!");
2752 // Bit convert each of the values to the new type.
2753 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
2754 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
2755 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2756 // Bit convert the result back the original type.
2757 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
2765 case ISD::SMUL_LOHI:
2766 case ISD::UMUL_LOHI:
2769 // These nodes will only be produced by target-specific lowering, so
2770 // they shouldn't be here if they aren't legal.
2771 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
2772 "This must be legal!");
2774 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2775 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
2776 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2779 case ISD::FCOPYSIGN: // FCOPYSIGN does not require LHS/RHS to match type!
2780 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2781 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2782 case Expand: assert(0 && "Not possible");
2784 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2787 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2791 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2793 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2794 default: assert(0 && "Operation not supported");
2795 case TargetLowering::Custom:
2796 Tmp1 = TLI.LowerOperation(Result, DAG);
2797 if (Tmp1.Val) Result = Tmp1;
2799 case TargetLowering::Legal: break;
2800 case TargetLowering::Expand: {
2801 // If this target supports fabs/fneg natively and select is cheap,
2802 // do this efficiently.
2803 if (!TLI.isSelectExpensive() &&
2804 TLI.getOperationAction(ISD::FABS, Tmp1.getValueType()) ==
2805 TargetLowering::Legal &&
2806 TLI.getOperationAction(ISD::FNEG, Tmp1.getValueType()) ==
2807 TargetLowering::Legal) {
2808 // Get the sign bit of the RHS.
2809 MVT::ValueType IVT =
2810 Tmp2.getValueType() == MVT::f32 ? MVT::i32 : MVT::i64;
2811 SDOperand SignBit = DAG.getNode(ISD::BIT_CONVERT, IVT, Tmp2);
2812 SignBit = DAG.getSetCC(TLI.getSetCCResultTy(),
2813 SignBit, DAG.getConstant(0, IVT), ISD::SETLT);
2814 // Get the absolute value of the result.
2815 SDOperand AbsVal = DAG.getNode(ISD::FABS, Tmp1.getValueType(), Tmp1);
2816 // Select between the nabs and abs value based on the sign bit of
2818 Result = DAG.getNode(ISD::SELECT, AbsVal.getValueType(), SignBit,
2819 DAG.getNode(ISD::FNEG, AbsVal.getValueType(),
2822 Result = LegalizeOp(Result);
2826 // Otherwise, do bitwise ops!
2827 MVT::ValueType NVT =
2828 Node->getValueType(0) == MVT::f32 ? MVT::i32 : MVT::i64;
2829 Result = ExpandFCOPYSIGNToBitwiseOps(Node, NVT, DAG, TLI);
2830 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0), Result);
2831 Result = LegalizeOp(Result);
2839 Tmp1 = LegalizeOp(Node->getOperand(0));
2840 Tmp2 = LegalizeOp(Node->getOperand(1));
2841 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2842 // Since this produces two values, make sure to remember that we legalized
2844 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2845 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2850 Tmp1 = LegalizeOp(Node->getOperand(0));
2851 Tmp2 = LegalizeOp(Node->getOperand(1));
2852 Tmp3 = LegalizeOp(Node->getOperand(2));
2853 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2854 // Since this produces two values, make sure to remember that we legalized
2856 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2857 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2860 case ISD::BUILD_PAIR: {
2861 MVT::ValueType PairTy = Node->getValueType(0);
2862 // TODO: handle the case where the Lo and Hi operands are not of legal type
2863 Tmp1 = LegalizeOp(Node->getOperand(0)); // Lo
2864 Tmp2 = LegalizeOp(Node->getOperand(1)); // Hi
2865 switch (TLI.getOperationAction(ISD::BUILD_PAIR, PairTy)) {
2866 case TargetLowering::Promote:
2867 case TargetLowering::Custom:
2868 assert(0 && "Cannot promote/custom this yet!");
2869 case TargetLowering::Legal:
2870 if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1))
2871 Result = DAG.getNode(ISD::BUILD_PAIR, PairTy, Tmp1, Tmp2);
2873 case TargetLowering::Expand:
2874 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, PairTy, Tmp1);
2875 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, PairTy, Tmp2);
2876 Tmp2 = DAG.getNode(ISD::SHL, PairTy, Tmp2,
2877 DAG.getConstant(MVT::getSizeInBits(PairTy)/2,
2878 TLI.getShiftAmountTy()));
2879 Result = DAG.getNode(ISD::OR, PairTy, Tmp1, Tmp2);
2888 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2889 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
2891 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2892 case TargetLowering::Promote: assert(0 && "Cannot promote this yet!");
2893 case TargetLowering::Custom:
2896 case TargetLowering::Legal:
2897 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2899 Tmp1 = TLI.LowerOperation(Result, DAG);
2900 if (Tmp1.Val) Result = Tmp1;
2903 case TargetLowering::Expand: {
2904 unsigned DivOpc= (Node->getOpcode() == ISD::UREM) ? ISD::UDIV : ISD::SDIV;
2905 bool isSigned = DivOpc == ISD::SDIV;
2906 MVT::ValueType VT = Node->getValueType(0);
2908 // See if remainder can be lowered using two-result operations.
2909 SDVTList VTs = DAG.getVTList(VT, VT);
2910 if (Node->getOpcode() == ISD::SREM &&
2911 TLI.isOperationLegal(ISD::SDIVREM, VT)) {
2912 Result = SDOperand(DAG.getNode(ISD::SDIVREM, VTs, Tmp1, Tmp2).Val, 1);
2915 if (Node->getOpcode() == ISD::UREM &&
2916 TLI.isOperationLegal(ISD::UDIVREM, VT)) {
2917 Result = SDOperand(DAG.getNode(ISD::UDIVREM, VTs, Tmp1, Tmp2).Val, 1);
2921 if (MVT::isInteger(VT)) {
2922 if (TLI.getOperationAction(DivOpc, VT) ==
2923 TargetLowering::Legal) {
2925 Result = DAG.getNode(DivOpc, VT, Tmp1, Tmp2);
2926 Result = DAG.getNode(ISD::MUL, VT, Result, Tmp2);
2927 Result = DAG.getNode(ISD::SUB, VT, Tmp1, Result);
2929 assert(VT == MVT::i32 &&
2930 "Cannot expand this binary operator!");
2931 RTLIB::Libcall LC = Node->getOpcode() == ISD::UREM
2932 ? RTLIB::UREM_I32 : RTLIB::SREM_I32;
2934 Result = ExpandLibCall(TLI.getLibcallName(LC), Node, isSigned, Dummy);
2937 // Floating point mod -> fmod libcall.
2938 RTLIB::Libcall LC = VT == MVT::f32
2939 ? RTLIB::REM_F32 : RTLIB::REM_F64;
2941 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
2942 false/*sign irrelevant*/, Dummy);
2949 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2950 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2952 MVT::ValueType VT = Node->getValueType(0);
2953 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
2954 default: assert(0 && "This action is not supported yet!");
2955 case TargetLowering::Custom:
2958 case TargetLowering::Legal:
2959 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2960 Result = Result.getValue(0);
2961 Tmp1 = Result.getValue(1);
2964 Tmp2 = TLI.LowerOperation(Result, DAG);
2966 Result = LegalizeOp(Tmp2);
2967 Tmp1 = LegalizeOp(Tmp2.getValue(1));
2971 case TargetLowering::Expand: {
2972 SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2));
2973 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
2974 SV->getValue(), SV->getOffset());
2975 // Increment the pointer, VAList, to the next vaarg
2976 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
2977 DAG.getConstant(MVT::getSizeInBits(VT)/8,
2978 TLI.getPointerTy()));
2979 // Store the incremented VAList to the legalized pointer
2980 Tmp3 = DAG.getStore(VAList.getValue(1), Tmp3, Tmp2, SV->getValue(),
2982 // Load the actual argument out of the pointer VAList
2983 Result = DAG.getLoad(VT, Tmp3, VAList, NULL, 0);
2984 Tmp1 = LegalizeOp(Result.getValue(1));
2985 Result = LegalizeOp(Result);
2989 // Since VAARG produces two values, make sure to remember that we
2990 // legalized both of them.
2991 AddLegalizedOperand(SDOperand(Node, 0), Result);
2992 AddLegalizedOperand(SDOperand(Node, 1), Tmp1);
2993 return Op.ResNo ? Tmp1 : Result;
2997 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2998 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the dest pointer.
2999 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the source pointer.
3001 switch (TLI.getOperationAction(ISD::VACOPY, MVT::Other)) {
3002 default: assert(0 && "This action is not supported yet!");
3003 case TargetLowering::Custom:
3006 case TargetLowering::Legal:
3007 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
3008 Node->getOperand(3), Node->getOperand(4));
3010 Tmp1 = TLI.LowerOperation(Result, DAG);
3011 if (Tmp1.Val) Result = Tmp1;
3014 case TargetLowering::Expand:
3015 // This defaults to loading a pointer from the input and storing it to the
3016 // output, returning the chain.
3017 SrcValueSDNode *SVD = cast<SrcValueSDNode>(Node->getOperand(3));
3018 SrcValueSDNode *SVS = cast<SrcValueSDNode>(Node->getOperand(4));
3019 Tmp4 = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp3, SVD->getValue(),
3021 Result = DAG.getStore(Tmp4.getValue(1), Tmp4, Tmp2, SVS->getValue(),
3028 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
3029 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
3031 switch (TLI.getOperationAction(ISD::VAEND, MVT::Other)) {
3032 default: assert(0 && "This action is not supported yet!");
3033 case TargetLowering::Custom:
3036 case TargetLowering::Legal:
3037 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
3039 Tmp1 = TLI.LowerOperation(Tmp1, DAG);
3040 if (Tmp1.Val) Result = Tmp1;
3043 case TargetLowering::Expand:
3044 Result = Tmp1; // Default to a no-op, return the chain
3050 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
3051 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
3053 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
3055 switch (TLI.getOperationAction(ISD::VASTART, MVT::Other)) {
3056 default: assert(0 && "This action is not supported yet!");
3057 case TargetLowering::Legal: break;
3058 case TargetLowering::Custom:
3059 Tmp1 = TLI.LowerOperation(Result, DAG);
3060 if (Tmp1.Val) Result = Tmp1;
3067 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
3068 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
3069 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
3070 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3072 assert(0 && "ROTL/ROTR legalize operation not supported");
3074 case TargetLowering::Legal:
3076 case TargetLowering::Custom:
3077 Tmp1 = TLI.LowerOperation(Result, DAG);
3078 if (Tmp1.Val) Result = Tmp1;
3080 case TargetLowering::Promote:
3081 assert(0 && "Do not know how to promote ROTL/ROTR");
3083 case TargetLowering::Expand:
3084 assert(0 && "Do not know how to expand ROTL/ROTR");
3090 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
3091 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3092 case TargetLowering::Custom:
3093 assert(0 && "Cannot custom legalize this yet!");
3094 case TargetLowering::Legal:
3095 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3097 case TargetLowering::Promote: {
3098 MVT::ValueType OVT = Tmp1.getValueType();
3099 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
3100 unsigned DiffBits = MVT::getSizeInBits(NVT) - MVT::getSizeInBits(OVT);
3102 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
3103 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
3104 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
3105 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
3108 case TargetLowering::Expand:
3109 Result = ExpandBSWAP(Tmp1);
3117 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
3118 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3119 case TargetLowering::Custom:
3120 case TargetLowering::Legal:
3121 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3122 if (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0)) ==
3123 TargetLowering::Custom) {
3124 Tmp1 = TLI.LowerOperation(Result, DAG);
3130 case TargetLowering::Promote: {
3131 MVT::ValueType OVT = Tmp1.getValueType();
3132 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
3134 // Zero extend the argument.
3135 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
3136 // Perform the larger operation, then subtract if needed.
3137 Tmp1 = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1);
3138 switch (Node->getOpcode()) {
3143 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
3144 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
3145 DAG.getConstant(MVT::getSizeInBits(NVT), NVT),
3147 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
3148 DAG.getConstant(MVT::getSizeInBits(OVT),NVT), Tmp1);
3151 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
3152 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
3153 DAG.getConstant(MVT::getSizeInBits(NVT) -
3154 MVT::getSizeInBits(OVT), NVT));
3159 case TargetLowering::Expand:
3160 Result = ExpandBitCount(Node->getOpcode(), Tmp1);
3171 Tmp1 = LegalizeOp(Node->getOperand(0));
3172 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
3173 case TargetLowering::Promote:
3174 case TargetLowering::Custom:
3177 case TargetLowering::Legal:
3178 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3180 Tmp1 = TLI.LowerOperation(Result, DAG);
3181 if (Tmp1.Val) Result = Tmp1;
3184 case TargetLowering::Expand:
3185 switch (Node->getOpcode()) {
3186 default: assert(0 && "Unreachable!");
3188 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
3189 Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0));
3190 Result = DAG.getNode(ISD::FSUB, Node->getValueType(0), Tmp2, Tmp1);
3193 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
3194 MVT::ValueType VT = Node->getValueType(0);
3195 Tmp2 = DAG.getConstantFP(0.0, VT);
3196 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, Tmp2, ISD::SETUGT);
3197 Tmp3 = DAG.getNode(ISD::FNEG, VT, Tmp1);
3198 Result = DAG.getNode(ISD::SELECT, VT, Tmp2, Tmp1, Tmp3);
3204 MVT::ValueType VT = Node->getValueType(0);
3206 // Expand unsupported unary vector operators by unrolling them.
3207 if (MVT::isVector(VT)) {
3208 Result = LegalizeOp(UnrollVectorOp(Op));
3212 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
3213 switch(Node->getOpcode()) {
3215 LC = VT == MVT::f32 ? RTLIB::SQRT_F32 :
3216 VT == MVT::f64 ? RTLIB::SQRT_F64 :
3217 VT == MVT::f80 ? RTLIB::SQRT_F80 :
3218 VT == MVT::ppcf128 ? RTLIB::SQRT_PPCF128 :
3219 RTLIB::UNKNOWN_LIBCALL;
3222 LC = VT == MVT::f32 ? RTLIB::SIN_F32 : RTLIB::SIN_F64;
3225 LC = VT == MVT::f32 ? RTLIB::COS_F32 : RTLIB::COS_F64;
3227 default: assert(0 && "Unreachable!");
3230 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
3231 false/*sign irrelevant*/, Dummy);
3239 MVT::ValueType VT = Node->getValueType(0);
3241 // Expand unsupported unary vector operators by unrolling them.
3242 if (MVT::isVector(VT)) {
3243 Result = LegalizeOp(UnrollVectorOp(Op));
3247 // We always lower FPOWI into a libcall. No target support for it yet.
3249 VT == MVT::f32 ? RTLIB::POWI_F32 :
3250 VT == MVT::f64 ? RTLIB::POWI_F64 :
3251 VT == MVT::f80 ? RTLIB::POWI_F80 :
3252 VT == MVT::ppcf128 ? RTLIB::POWI_PPCF128 :
3253 RTLIB::UNKNOWN_LIBCALL;
3255 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
3256 false/*sign irrelevant*/, Dummy);
3259 case ISD::BIT_CONVERT:
3260 if (!isTypeLegal(Node->getOperand(0).getValueType())) {
3261 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
3262 } else if (MVT::isVector(Op.getOperand(0).getValueType())) {
3263 // The input has to be a vector type, we have to either scalarize it, pack
3264 // it, or convert it based on whether the input vector type is legal.
3265 SDNode *InVal = Node->getOperand(0).Val;
3266 int InIx = Node->getOperand(0).ResNo;
3267 unsigned NumElems = MVT::getVectorNumElements(InVal->getValueType(InIx));
3268 MVT::ValueType EVT = MVT::getVectorElementType(InVal->getValueType(InIx));
3270 // Figure out if there is a simple type corresponding to this Vector
3271 // type. If so, convert to the vector type.
3272 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
3273 if (TLI.isTypeLegal(TVT)) {
3274 // Turn this into a bit convert of the vector input.
3275 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
3276 LegalizeOp(Node->getOperand(0)));
3278 } else if (NumElems == 1) {
3279 // Turn this into a bit convert of the scalar input.
3280 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
3281 ScalarizeVectorOp(Node->getOperand(0)));
3284 // FIXME: UNIMP! Store then reload
3285 assert(0 && "Cast from unsupported vector type not implemented yet!");
3288 switch (TLI.getOperationAction(ISD::BIT_CONVERT,
3289 Node->getOperand(0).getValueType())) {
3290 default: assert(0 && "Unknown operation action!");
3291 case TargetLowering::Expand:
3292 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
3294 case TargetLowering::Legal:
3295 Tmp1 = LegalizeOp(Node->getOperand(0));
3296 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3302 // Conversion operators. The source and destination have different types.
3303 case ISD::SINT_TO_FP:
3304 case ISD::UINT_TO_FP: {
3305 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
3306 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3308 switch (TLI.getOperationAction(Node->getOpcode(),
3309 Node->getOperand(0).getValueType())) {
3310 default: assert(0 && "Unknown operation action!");
3311 case TargetLowering::Custom:
3314 case TargetLowering::Legal:
3315 Tmp1 = LegalizeOp(Node->getOperand(0));
3316 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3318 Tmp1 = TLI.LowerOperation(Result, DAG);
3319 if (Tmp1.Val) Result = Tmp1;
3322 case TargetLowering::Expand:
3323 Result = ExpandLegalINT_TO_FP(isSigned,
3324 LegalizeOp(Node->getOperand(0)),
3325 Node->getValueType(0));
3327 case TargetLowering::Promote:
3328 Result = PromoteLegalINT_TO_FP(LegalizeOp(Node->getOperand(0)),
3329 Node->getValueType(0),
3335 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP,
3336 Node->getValueType(0), Node->getOperand(0));
3339 Tmp1 = PromoteOp(Node->getOperand(0));
3341 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp1.getValueType(),
3342 Tmp1, DAG.getValueType(Node->getOperand(0).getValueType()));
3344 Tmp1 = DAG.getZeroExtendInReg(Tmp1,
3345 Node->getOperand(0).getValueType());
3347 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3348 Result = LegalizeOp(Result); // The 'op' is not necessarily legal!
3354 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3356 Tmp1 = LegalizeOp(Node->getOperand(0));
3357 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3360 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
3362 // Since the result is legal, we should just be able to truncate the low
3363 // part of the source.
3364 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1);
3367 Result = PromoteOp(Node->getOperand(0));
3368 Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result);
3373 case ISD::FP_TO_SINT:
3374 case ISD::FP_TO_UINT:
3375 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3377 Tmp1 = LegalizeOp(Node->getOperand(0));
3379 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))){
3380 default: assert(0 && "Unknown operation action!");
3381 case TargetLowering::Custom:
3384 case TargetLowering::Legal:
3385 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3387 Tmp1 = TLI.LowerOperation(Result, DAG);
3388 if (Tmp1.Val) Result = Tmp1;
3391 case TargetLowering::Promote:
3392 Result = PromoteLegalFP_TO_INT(Tmp1, Node->getValueType(0),
3393 Node->getOpcode() == ISD::FP_TO_SINT);
3395 case TargetLowering::Expand:
3396 if (Node->getOpcode() == ISD::FP_TO_UINT) {
3397 SDOperand True, False;
3398 MVT::ValueType VT = Node->getOperand(0).getValueType();
3399 MVT::ValueType NVT = Node->getValueType(0);
3400 unsigned ShiftAmt = MVT::getSizeInBits(NVT)-1;
3401 const uint64_t zero[] = {0, 0};
3402 APFloat apf = APFloat(APInt(MVT::getSizeInBits(VT), 2, zero));
3403 uint64_t x = 1ULL << ShiftAmt;
3404 (void)apf.convertFromZeroExtendedInteger
3405 (&x, MVT::getSizeInBits(NVT), false, APFloat::rmNearestTiesToEven);
3406 Tmp2 = DAG.getConstantFP(apf, VT);
3407 Tmp3 = DAG.getSetCC(TLI.getSetCCResultTy(),
3408 Node->getOperand(0), Tmp2, ISD::SETLT);
3409 True = DAG.getNode(ISD::FP_TO_SINT, NVT, Node->getOperand(0));
3410 False = DAG.getNode(ISD::FP_TO_SINT, NVT,
3411 DAG.getNode(ISD::FSUB, VT, Node->getOperand(0),
3413 False = DAG.getNode(ISD::XOR, NVT, False,
3414 DAG.getConstant(1ULL << ShiftAmt, NVT));
3415 Result = DAG.getNode(ISD::SELECT, NVT, Tmp3, True, False);
3418 assert(0 && "Do not know how to expand FP_TO_SINT yet!");
3424 MVT::ValueType VT = Op.getValueType();
3425 MVT::ValueType OVT = Node->getOperand(0).getValueType();
3426 // Convert ppcf128 to i32
3427 if (OVT == MVT::ppcf128 && VT == MVT::i32) {
3428 if (Node->getOpcode()==ISD::FP_TO_SINT)
3429 Result = DAG.getNode(ISD::FP_TO_SINT, VT,
3430 DAG.getNode(ISD::FP_ROUND, MVT::f64,
3431 (DAG.getNode(ISD::FP_ROUND_INREG,
3432 MVT::ppcf128, Node->getOperand(0),
3433 DAG.getValueType(MVT::f64)))));
3435 const uint64_t TwoE31[] = {0x41e0000000000000LL, 0};
3436 APFloat apf = APFloat(APInt(128, 2, TwoE31));
3437 Tmp2 = DAG.getConstantFP(apf, OVT);
3438 // X>=2^31 ? (int)(X-2^31)+0x80000000 : (int)X
3439 // FIXME: generated code sucks.
3440 Result = DAG.getNode(ISD::SELECT_CC, VT, Node->getOperand(0), Tmp2,
3441 DAG.getNode(ISD::ADD, MVT::i32,
3442 DAG.getNode(ISD::FP_TO_SINT, VT,
3443 DAG.getNode(ISD::FSUB, OVT,
3444 Node->getOperand(0), Tmp2)),
3445 DAG.getConstant(0x80000000, MVT::i32)),
3446 DAG.getNode(ISD::FP_TO_SINT, VT,
3447 Node->getOperand(0)),
3448 DAG.getCondCode(ISD::SETGE));
3452 // Convert f32 / f64 to i32 / i64.
3453 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
3454 switch (Node->getOpcode()) {
3455 case ISD::FP_TO_SINT: {
3456 if (OVT == MVT::f32)
3457 LC = (VT == MVT::i32)
3458 ? RTLIB::FPTOSINT_F32_I32 : RTLIB::FPTOSINT_F32_I64;
3459 else if (OVT == MVT::f64)
3460 LC = (VT == MVT::i32)
3461 ? RTLIB::FPTOSINT_F64_I32 : RTLIB::FPTOSINT_F64_I64;
3462 else if (OVT == MVT::f80) {
3463 assert(VT == MVT::i64);
3464 LC = RTLIB::FPTOSINT_F80_I64;
3466 else if (OVT == MVT::ppcf128) {
3467 assert(VT == MVT::i64);
3468 LC = RTLIB::FPTOSINT_PPCF128_I64;
3472 case ISD::FP_TO_UINT: {
3473 if (OVT == MVT::f32)
3474 LC = (VT == MVT::i32)
3475 ? RTLIB::FPTOUINT_F32_I32 : RTLIB::FPTOSINT_F32_I64;
3476 else if (OVT == MVT::f64)
3477 LC = (VT == MVT::i32)
3478 ? RTLIB::FPTOUINT_F64_I32 : RTLIB::FPTOSINT_F64_I64;
3479 else if (OVT == MVT::f80) {
3480 LC = (VT == MVT::i32)
3481 ? RTLIB::FPTOUINT_F80_I32 : RTLIB::FPTOUINT_F80_I64;
3483 else if (OVT == MVT::ppcf128) {
3484 assert(VT == MVT::i64);
3485 LC = RTLIB::FPTOUINT_PPCF128_I64;
3489 default: assert(0 && "Unreachable!");
3492 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
3493 false/*sign irrelevant*/, Dummy);
3497 Tmp1 = PromoteOp(Node->getOperand(0));
3498 Result = DAG.UpdateNodeOperands(Result, LegalizeOp(Tmp1));
3499 Result = LegalizeOp(Result);
3504 case ISD::FP_EXTEND:
3505 case ISD::FP_ROUND: {
3506 MVT::ValueType newVT = Op.getValueType();
3507 MVT::ValueType oldVT = Op.getOperand(0).getValueType();
3508 if (TLI.getConvertAction(oldVT, newVT) == TargetLowering::Expand) {
3509 if (Node->getOpcode() == ISD::FP_ROUND && oldVT == MVT::ppcf128) {
3511 ExpandOp(Node->getOperand(0), Lo, Hi);
3512 if (newVT == MVT::f64)
3515 Result = DAG.getNode(ISD::FP_ROUND, newVT, Hi);
3518 // The only other way we can lower this is to turn it into a STORE,
3519 // LOAD pair, targetting a temporary location (a stack slot).
3521 // NOTE: there is a choice here between constantly creating new stack
3522 // slots and always reusing the same one. We currently always create
3523 // new ones, as reuse may inhibit scheduling.
3524 MVT::ValueType slotVT =
3525 (Node->getOpcode() == ISD::FP_EXTEND) ? oldVT : newVT;
3526 const Type *Ty = MVT::getTypeForValueType(slotVT);
3527 uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty);
3528 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty);
3529 MachineFunction &MF = DAG.getMachineFunction();
3531 MF.getFrameInfo()->CreateStackObject(TySize, Align);
3532 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
3533 if (Node->getOpcode() == ISD::FP_EXTEND) {
3534 Result = DAG.getStore(DAG.getEntryNode(), Node->getOperand(0),
3535 StackSlot, NULL, 0);
3536 Result = DAG.getExtLoad(ISD::EXTLOAD, newVT,
3537 Result, StackSlot, NULL, 0, oldVT);
3539 Result = DAG.getTruncStore(DAG.getEntryNode(), Node->getOperand(0),
3540 StackSlot, NULL, 0, newVT);
3541 Result = DAG.getLoad(newVT, Result, StackSlot, NULL, 0);
3548 case ISD::ANY_EXTEND:
3549 case ISD::ZERO_EXTEND:
3550 case ISD::SIGN_EXTEND:
3551 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3552 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
3554 Tmp1 = LegalizeOp(Node->getOperand(0));
3555 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3558 switch (Node->getOpcode()) {
3559 case ISD::ANY_EXTEND:
3560 Tmp1 = PromoteOp(Node->getOperand(0));
3561 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Tmp1);
3563 case ISD::ZERO_EXTEND:
3564 Result = PromoteOp(Node->getOperand(0));
3565 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
3566 Result = DAG.getZeroExtendInReg(Result,
3567 Node->getOperand(0).getValueType());
3569 case ISD::SIGN_EXTEND:
3570 Result = PromoteOp(Node->getOperand(0));
3571 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
3572 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
3574 DAG.getValueType(Node->getOperand(0).getValueType()));
3576 case ISD::FP_EXTEND:
3577 Result = PromoteOp(Node->getOperand(0));
3578 if (Result.getValueType() != Op.getValueType())
3579 // Dynamically dead while we have only 2 FP types.
3580 Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result);
3583 Result = PromoteOp(Node->getOperand(0));
3584 Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result);
3589 case ISD::FP_ROUND_INREG:
3590 case ISD::SIGN_EXTEND_INREG: {
3591 Tmp1 = LegalizeOp(Node->getOperand(0));
3592 MVT::ValueType ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
3594 // If this operation is not supported, convert it to a shl/shr or load/store
3596 switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) {
3597 default: assert(0 && "This action not supported for this op yet!");
3598 case TargetLowering::Legal:
3599 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
3601 case TargetLowering::Expand:
3602 // If this is an integer extend and shifts are supported, do that.
3603 if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) {
3604 // NOTE: we could fall back on load/store here too for targets without
3605 // SAR. However, it is doubtful that any exist.
3606 unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) -
3607 MVT::getSizeInBits(ExtraVT);
3608 SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy());
3609 Result = DAG.getNode(ISD::SHL, Node->getValueType(0),
3610 Node->getOperand(0), ShiftCst);
3611 Result = DAG.getNode(ISD::SRA, Node->getValueType(0),
3613 } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) {
3614 // The only way we can lower this is to turn it into a TRUNCSTORE,
3615 // EXTLOAD pair, targetting a temporary location (a stack slot).
3617 // NOTE: there is a choice here between constantly creating new stack
3618 // slots and always reusing the same one. We currently always create
3619 // new ones, as reuse may inhibit scheduling.
3620 const Type *Ty = MVT::getTypeForValueType(ExtraVT);
3621 uint64_t TySize = TLI.getTargetData()->getTypeSize(Ty);
3622 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty);
3623 MachineFunction &MF = DAG.getMachineFunction();
3625 MF.getFrameInfo()->CreateStackObject(TySize, Align);
3626 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
3627 Result = DAG.getTruncStore(DAG.getEntryNode(), Node->getOperand(0),
3628 StackSlot, NULL, 0, ExtraVT);
3629 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
3630 Result, StackSlot, NULL, 0, ExtraVT);
3632 assert(0 && "Unknown op");
3638 case ISD::TRAMPOLINE: {
3640 for (unsigned i = 0; i != 6; ++i)
3641 Ops[i] = LegalizeOp(Node->getOperand(i));
3642 Result = DAG.UpdateNodeOperands(Result, Ops, 6);
3643 // The only option for this node is to custom lower it.
3644 Result = TLI.LowerOperation(Result, DAG);
3645 assert(Result.Val && "Should always custom lower!");
3647 // Since trampoline produces two values, make sure to remember that we
3648 // legalized both of them.
3649 Tmp1 = LegalizeOp(Result.getValue(1));
3650 Result = LegalizeOp(Result);
3651 AddLegalizedOperand(SDOperand(Node, 0), Result);
3652 AddLegalizedOperand(SDOperand(Node, 1), Tmp1);
3653 return Op.ResNo ? Tmp1 : Result;
3657 assert(Result.getValueType() == Op.getValueType() &&
3658 "Bad legalization!");
3660 // Make sure that the generated code is itself legal.
3662 Result = LegalizeOp(Result);
3664 // Note that LegalizeOp may be reentered even from single-use nodes, which
3665 // means that we always must cache transformed nodes.
3666 AddLegalizedOperand(Op, Result);
3670 /// PromoteOp - Given an operation that produces a value in an invalid type,
3671 /// promote it to compute the value into a larger type. The produced value will
3672 /// have the correct bits for the low portion of the register, but no guarantee
3673 /// is made about the top bits: it may be zero, sign-extended, or garbage.
3674 SDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) {
3675 MVT::ValueType VT = Op.getValueType();
3676 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
3677 assert(getTypeAction(VT) == Promote &&
3678 "Caller should expand or legalize operands that are not promotable!");
3679 assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) &&
3680 "Cannot promote to smaller type!");
3682 SDOperand Tmp1, Tmp2, Tmp3;
3684 SDNode *Node = Op.Val;
3686 DenseMap<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op);
3687 if (I != PromotedNodes.end()) return I->second;
3689 switch (Node->getOpcode()) {
3690 case ISD::CopyFromReg:
3691 assert(0 && "CopyFromReg must be legal!");
3694 cerr << "NODE: "; Node->dump(&DAG); cerr << "\n";
3696 assert(0 && "Do not know how to promote this operator!");
3699 Result = DAG.getNode(ISD::UNDEF, NVT);
3703 Result = DAG.getNode(ISD::SIGN_EXTEND, NVT, Op);
3705 Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op);
3706 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?");
3708 case ISD::ConstantFP:
3709 Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op);
3710 assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?");
3714 assert(isTypeLegal(TLI.getSetCCResultTy()) && "SetCC type is not legal??");
3715 Result = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(),Node->getOperand(0),
3716 Node->getOperand(1), Node->getOperand(2));
3720 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3722 Result = LegalizeOp(Node->getOperand(0));
3723 assert(Result.getValueType() >= NVT &&
3724 "This truncation doesn't make sense!");
3725 if (Result.getValueType() > NVT) // Truncate to NVT instead of VT
3726 Result = DAG.getNode(ISD::TRUNCATE, NVT, Result);
3729 // The truncation is not required, because we don't guarantee anything
3730 // about high bits anyway.
3731 Result = PromoteOp(Node->getOperand(0));
3734 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
3735 // Truncate the low part of the expanded value to the result type
3736 Result = DAG.getNode(ISD::TRUNCATE, NVT, Tmp1);
3739 case ISD::SIGN_EXTEND:
3740 case ISD::ZERO_EXTEND:
3741 case ISD::ANY_EXTEND:
3742 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3743 case Expand: assert(0 && "BUG: Smaller reg should have been promoted!");
3745 // Input is legal? Just do extend all the way to the larger type.
3746 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
3749 // Promote the reg if it's smaller.
3750 Result = PromoteOp(Node->getOperand(0));
3751 // The high bits are not guaranteed to be anything. Insert an extend.
3752 if (Node->getOpcode() == ISD::SIGN_EXTEND)
3753 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
3754 DAG.getValueType(Node->getOperand(0).getValueType()));
3755 else if (Node->getOpcode() == ISD::ZERO_EXTEND)
3756 Result = DAG.getZeroExtendInReg(Result,
3757 Node->getOperand(0).getValueType());
3761 case ISD::BIT_CONVERT:
3762 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
3763 Result = PromoteOp(Result);
3766 case ISD::FP_EXTEND:
3767 assert(0 && "Case not implemented. Dynamically dead with 2 FP types!");
3769 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3770 case Expand: assert(0 && "BUG: Cannot expand FP regs!");
3771 case Promote: assert(0 && "Unreachable with 2 FP types!");
3773 // Input is legal? Do an FP_ROUND_INREG.
3774 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Node->getOperand(0),
3775 DAG.getValueType(VT));
3780 case ISD::SINT_TO_FP:
3781 case ISD::UINT_TO_FP:
3782 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3784 // No extra round required here.
3785 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
3789 Result = PromoteOp(Node->getOperand(0));
3790 if (Node->getOpcode() == ISD::SINT_TO_FP)
3791 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
3793 DAG.getValueType(Node->getOperand(0).getValueType()));
3795 Result = DAG.getZeroExtendInReg(Result,
3796 Node->getOperand(0).getValueType());
3797 // No extra round required here.
3798 Result = DAG.getNode(Node->getOpcode(), NVT, Result);
3801 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT,
3802 Node->getOperand(0));
3803 // Round if we cannot tolerate excess precision.
3804 if (NoExcessFPPrecision)
3805 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3806 DAG.getValueType(VT));
3811 case ISD::SIGN_EXTEND_INREG:
3812 Result = PromoteOp(Node->getOperand(0));
3813 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
3814 Node->getOperand(1));
3816 case ISD::FP_TO_SINT:
3817 case ISD::FP_TO_UINT:
3818 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3821 Tmp1 = Node->getOperand(0);
3824 // The input result is prerounded, so we don't have to do anything
3826 Tmp1 = PromoteOp(Node->getOperand(0));
3829 // If we're promoting a UINT to a larger size, check to see if the new node
3830 // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since
3831 // we can use that instead. This allows us to generate better code for
3832 // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not
3833 // legal, such as PowerPC.
3834 if (Node->getOpcode() == ISD::FP_TO_UINT &&
3835 !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) &&
3836 (TLI.isOperationLegal(ISD::FP_TO_SINT, NVT) ||
3837 TLI.getOperationAction(ISD::FP_TO_SINT, NVT)==TargetLowering::Custom)){
3838 Result = DAG.getNode(ISD::FP_TO_SINT, NVT, Tmp1);
3840 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3846 Tmp1 = PromoteOp(Node->getOperand(0));
3847 assert(Tmp1.getValueType() == NVT);
3848 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3849 // NOTE: we do not have to do any extra rounding here for
3850 // NoExcessFPPrecision, because we know the input will have the appropriate
3851 // precision, and these operations don't modify precision at all.
3857 Tmp1 = PromoteOp(Node->getOperand(0));
3858 assert(Tmp1.getValueType() == NVT);
3859 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3860 if (NoExcessFPPrecision)
3861 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3862 DAG.getValueType(VT));
3866 // Promote f32 powi to f64 powi. Note that this could insert a libcall
3867 // directly as well, which may be better.
3868 Tmp1 = PromoteOp(Node->getOperand(0));
3869 assert(Tmp1.getValueType() == NVT);
3870 Result = DAG.getNode(ISD::FPOWI, NVT, Tmp1, Node->getOperand(1));
3871 if (NoExcessFPPrecision)
3872 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3873 DAG.getValueType(VT));
3883 // The input may have strange things in the top bits of the registers, but
3884 // these operations don't care. They may have weird bits going out, but
3885 // that too is okay if they are integer operations.
3886 Tmp1 = PromoteOp(Node->getOperand(0));
3887 Tmp2 = PromoteOp(Node->getOperand(1));
3888 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3889 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3894 Tmp1 = PromoteOp(Node->getOperand(0));
3895 Tmp2 = PromoteOp(Node->getOperand(1));
3896 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3897 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3899 // Floating point operations will give excess precision that we may not be
3900 // able to tolerate. If we DO allow excess precision, just leave it,
3901 // otherwise excise it.
3902 // FIXME: Why would we need to round FP ops more than integer ones?
3903 // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C))
3904 if (NoExcessFPPrecision)
3905 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3906 DAG.getValueType(VT));
3911 // These operators require that their input be sign extended.
3912 Tmp1 = PromoteOp(Node->getOperand(0));
3913 Tmp2 = PromoteOp(Node->getOperand(1));
3914 if (MVT::isInteger(NVT)) {
3915 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3916 DAG.getValueType(VT));
3917 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
3918 DAG.getValueType(VT));
3920 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3922 // Perform FP_ROUND: this is probably overly pessimistic.
3923 if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision)
3924 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3925 DAG.getValueType(VT));
3929 case ISD::FCOPYSIGN:
3930 // These operators require that their input be fp extended.
3931 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3933 Tmp1 = LegalizeOp(Node->getOperand(0));
3936 Tmp1 = PromoteOp(Node->getOperand(0));
3939 assert(0 && "not implemented");
3941 switch (getTypeAction(Node->getOperand(1).getValueType())) {
3943 Tmp2 = LegalizeOp(Node->getOperand(1));
3946 Tmp2 = PromoteOp(Node->getOperand(1));
3949 assert(0 && "not implemented");
3951 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3953 // Perform FP_ROUND: this is probably overly pessimistic.
3954 if (NoExcessFPPrecision && Node->getOpcode() != ISD::FCOPYSIGN)
3955 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3956 DAG.getValueType(VT));
3961 // These operators require that their input be zero extended.
3962 Tmp1 = PromoteOp(Node->getOperand(0));
3963 Tmp2 = PromoteOp(Node->getOperand(1));
3964 assert(MVT::isInteger(NVT) && "Operators don't apply to FP!");
3965 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3966 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
3967 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3971 Tmp1 = PromoteOp(Node->getOperand(0));
3972 Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Node->getOperand(1));
3975 // The input value must be properly sign extended.
3976 Tmp1 = PromoteOp(Node->getOperand(0));
3977 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3978 DAG.getValueType(VT));
3979 Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Node->getOperand(1));
3982 // The input value must be properly zero extended.
3983 Tmp1 = PromoteOp(Node->getOperand(0));
3984 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3985 Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Node->getOperand(1));
3989 Tmp1 = Node->getOperand(0); // Get the chain.
3990 Tmp2 = Node->getOperand(1); // Get the pointer.
3991 if (TLI.getOperationAction(ISD::VAARG, VT) == TargetLowering::Custom) {
3992 Tmp3 = DAG.getVAArg(VT, Tmp1, Tmp2, Node->getOperand(2));
3993 Result = TLI.CustomPromoteOperation(Tmp3, DAG);
3995 SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2));
3996 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
3997 SV->getValue(), SV->getOffset());
3998 // Increment the pointer, VAList, to the next vaarg
3999 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
4000 DAG.getConstant(MVT::getSizeInBits(VT)/8,
4001 TLI.getPointerTy()));
4002 // Store the incremented VAList to the legalized pointer
4003 Tmp3 = DAG.getStore(VAList.getValue(1), Tmp3, Tmp2, SV->getValue(),
4005 // Load the actual argument out of the pointer VAList
4006 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Tmp3, VAList, NULL, 0, VT);
4008 // Remember that we legalized the chain.
4009 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
4013 LoadSDNode *LD = cast<LoadSDNode>(Node);
4014 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(Node)
4015 ? ISD::EXTLOAD : LD->getExtensionType();
4016 Result = DAG.getExtLoad(ExtType, NVT,
4017 LD->getChain(), LD->getBasePtr(),
4018 LD->getSrcValue(), LD->getSrcValueOffset(),
4021 LD->getAlignment());
4022 // Remember that we legalized the chain.
4023 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
4027 Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0
4028 Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1
4029 Result = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), Tmp2, Tmp3);
4031 case ISD::SELECT_CC:
4032 Tmp2 = PromoteOp(Node->getOperand(2)); // True
4033 Tmp3 = PromoteOp(Node->getOperand(3)); // False
4034 Result = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
4035 Node->getOperand(1), Tmp2, Tmp3, Node->getOperand(4));
4038 Tmp1 = Node->getOperand(0);
4039 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
4040 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
4041 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
4042 DAG.getConstant(MVT::getSizeInBits(NVT) -
4043 MVT::getSizeInBits(VT),
4044 TLI.getShiftAmountTy()));
4049 // Zero extend the argument
4050 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
4051 // Perform the larger operation, then subtract if needed.
4052 Tmp1 = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
4053 switch(Node->getOpcode()) {
4058 // if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
4059 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
4060 DAG.getConstant(MVT::getSizeInBits(NVT), NVT),
4062 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
4063 DAG.getConstant(MVT::getSizeInBits(VT), NVT), Tmp1);
4066 //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
4067 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
4068 DAG.getConstant(MVT::getSizeInBits(NVT) -
4069 MVT::getSizeInBits(VT), NVT));
4073 case ISD::EXTRACT_SUBVECTOR:
4074 Result = PromoteOp(ExpandEXTRACT_SUBVECTOR(Op));
4076 case ISD::EXTRACT_VECTOR_ELT:
4077 Result = PromoteOp(ExpandEXTRACT_VECTOR_ELT(Op));
4081 assert(Result.Val && "Didn't set a result!");
4083 // Make sure the result is itself legal.
4084 Result = LegalizeOp(Result);
4086 // Remember that we promoted this!
4087 AddPromotedOperand(Op, Result);
4091 /// ExpandEXTRACT_VECTOR_ELT - Expand an EXTRACT_VECTOR_ELT operation into
4092 /// a legal EXTRACT_VECTOR_ELT operation, scalar code, or memory traffic,
4093 /// based on the vector type. The return type of this matches the element type
4094 /// of the vector, which may not be legal for the target.
4095 SDOperand SelectionDAGLegalize::ExpandEXTRACT_VECTOR_ELT(SDOperand Op) {
4096 // We know that operand #0 is the Vec vector. If the index is a constant
4097 // or if the invec is a supported hardware type, we can use it. Otherwise,
4098 // lower to a store then an indexed load.
4099 SDOperand Vec = Op.getOperand(0);
4100 SDOperand Idx = Op.getOperand(1);
4102 MVT::ValueType TVT = Vec.getValueType();
4103 unsigned NumElems = MVT::getVectorNumElements(TVT);
4105 switch (TLI.getOperationAction(ISD::EXTRACT_VECTOR_ELT, TVT)) {
4106 default: assert(0 && "This action is not supported yet!");
4107 case TargetLowering::Custom: {
4108 Vec = LegalizeOp(Vec);
4109 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
4110 SDOperand Tmp3 = TLI.LowerOperation(Op, DAG);
4115 case TargetLowering::Legal:
4116 if (isTypeLegal(TVT)) {
4117 Vec = LegalizeOp(Vec);
4118 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
4122 case TargetLowering::Expand:
4126 if (NumElems == 1) {
4127 // This must be an access of the only element. Return it.
4128 Op = ScalarizeVectorOp(Vec);
4129 } else if (!TLI.isTypeLegal(TVT) && isa<ConstantSDNode>(Idx)) {
4130 ConstantSDNode *CIdx = cast<ConstantSDNode>(Idx);
4132 SplitVectorOp(Vec, Lo, Hi);
4133 if (CIdx->getValue() < NumElems/2) {
4137 Idx = DAG.getConstant(CIdx->getValue() - NumElems/2,
4138 Idx.getValueType());
4141 // It's now an extract from the appropriate high or low part. Recurse.
4142 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
4143 Op = ExpandEXTRACT_VECTOR_ELT(Op);
4145 // Store the value to a temporary stack slot, then LOAD the scalar
4146 // element back out.
4147 SDOperand StackPtr = DAG.CreateStackTemporary(Vec.getValueType());
4148 SDOperand Ch = DAG.getStore(DAG.getEntryNode(), Vec, StackPtr, NULL, 0);
4150 // Add the offset to the index.
4151 unsigned EltSize = MVT::getSizeInBits(Op.getValueType())/8;
4152 Idx = DAG.getNode(ISD::MUL, Idx.getValueType(), Idx,
4153 DAG.getConstant(EltSize, Idx.getValueType()));
4155 if (MVT::getSizeInBits(Idx.getValueType()) >
4156 MVT::getSizeInBits(TLI.getPointerTy()))
4157 Idx = DAG.getNode(ISD::TRUNCATE, TLI.getPointerTy(), Idx);
4159 Idx = DAG.getNode(ISD::ZERO_EXTEND, TLI.getPointerTy(), Idx);
4161 StackPtr = DAG.getNode(ISD::ADD, Idx.getValueType(), Idx, StackPtr);
4163 Op = DAG.getLoad(Op.getValueType(), Ch, StackPtr, NULL, 0);
4168 /// ExpandEXTRACT_SUBVECTOR - Expand a EXTRACT_SUBVECTOR operation. For now
4169 /// we assume the operation can be split if it is not already legal.
4170 SDOperand SelectionDAGLegalize::ExpandEXTRACT_SUBVECTOR(SDOperand Op) {
4171 // We know that operand #0 is the Vec vector. For now we assume the index
4172 // is a constant and that the extracted result is a supported hardware type.
4173 SDOperand Vec = Op.getOperand(0);
4174 SDOperand Idx = LegalizeOp(Op.getOperand(1));
4176 unsigned NumElems = MVT::getVectorNumElements(Vec.getValueType());
4178 if (NumElems == MVT::getVectorNumElements(Op.getValueType())) {
4179 // This must be an access of the desired vector length. Return it.
4183 ConstantSDNode *CIdx = cast<ConstantSDNode>(Idx);
4185 SplitVectorOp(Vec, Lo, Hi);
4186 if (CIdx->getValue() < NumElems/2) {
4190 Idx = DAG.getConstant(CIdx->getValue() - NumElems/2, Idx.getValueType());
4193 // It's now an extract from the appropriate high or low part. Recurse.
4194 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
4195 return ExpandEXTRACT_SUBVECTOR(Op);
4198 /// LegalizeSetCCOperands - Attempts to create a legal LHS and RHS for a SETCC
4199 /// with condition CC on the current target. This usually involves legalizing
4200 /// or promoting the arguments. In the case where LHS and RHS must be expanded,
4201 /// there may be no choice but to create a new SetCC node to represent the
4202 /// legalized value of setcc lhs, rhs. In this case, the value is returned in
4203 /// LHS, and the SDOperand returned in RHS has a nil SDNode value.
4204 void SelectionDAGLegalize::LegalizeSetCCOperands(SDOperand &LHS,
4207 SDOperand Tmp1, Tmp2, Tmp3, Result;
4209 switch (getTypeAction(LHS.getValueType())) {
4211 Tmp1 = LegalizeOp(LHS); // LHS
4212 Tmp2 = LegalizeOp(RHS); // RHS
4215 Tmp1 = PromoteOp(LHS); // LHS
4216 Tmp2 = PromoteOp(RHS); // RHS
4218 // If this is an FP compare, the operands have already been extended.
4219 if (MVT::isInteger(LHS.getValueType())) {
4220 MVT::ValueType VT = LHS.getValueType();
4221 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
4223 // Otherwise, we have to insert explicit sign or zero extends. Note
4224 // that we could insert sign extends for ALL conditions, but zero extend
4225 // is cheaper on many machines (an AND instead of two shifts), so prefer
4227 switch (cast<CondCodeSDNode>(CC)->get()) {
4228 default: assert(0 && "Unknown integer comparison!");
4235 // ALL of these operations will work if we either sign or zero extend
4236 // the operands (including the unsigned comparisons!). Zero extend is
4237 // usually a simpler/cheaper operation, so prefer it.
4238 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
4239 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
4245 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
4246 DAG.getValueType(VT));
4247 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
4248 DAG.getValueType(VT));
4254 MVT::ValueType VT = LHS.getValueType();
4255 if (VT == MVT::f32 || VT == MVT::f64) {
4256 // Expand into one or more soft-fp libcall(s).
4257 RTLIB::Libcall LC1, LC2 = RTLIB::UNKNOWN_LIBCALL;
4258 switch (cast<CondCodeSDNode>(CC)->get()) {
4261 LC1 = (VT == MVT::f32) ? RTLIB::OEQ_F32 : RTLIB::OEQ_F64;
4265 LC1 = (VT == MVT::f32) ? RTLIB::UNE_F32 : RTLIB::UNE_F64;
4269 LC1 = (VT == MVT::f32) ? RTLIB::OGE_F32 : RTLIB::OGE_F64;
4273 LC1 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
4277 LC1 = (VT == MVT::f32) ? RTLIB::OLE_F32 : RTLIB::OLE_F64;
4281 LC1 = (VT == MVT::f32) ? RTLIB::OGT_F32 : RTLIB::OGT_F64;
4284 LC1 = (VT == MVT::f32) ? RTLIB::UO_F32 : RTLIB::UO_F64;
4287 LC1 = (VT == MVT::f32) ? RTLIB::O_F32 : RTLIB::O_F64;
4290 LC1 = (VT == MVT::f32) ? RTLIB::UO_F32 : RTLIB::UO_F64;
4291 switch (cast<CondCodeSDNode>(CC)->get()) {
4293 // SETONE = SETOLT | SETOGT
4294 LC1 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
4297 LC2 = (VT == MVT::f32) ? RTLIB::OGT_F32 : RTLIB::OGT_F64;
4300 LC2 = (VT == MVT::f32) ? RTLIB::OGE_F32 : RTLIB::OGE_F64;
4303 LC2 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
4306 LC2 = (VT == MVT::f32) ? RTLIB::OLE_F32 : RTLIB::OLE_F64;
4309 LC2 = (VT == MVT::f32) ? RTLIB::OEQ_F32 : RTLIB::OEQ_F64;
4311 default: assert(0 && "Unsupported FP setcc!");
4316 Tmp1 = ExpandLibCall(TLI.getLibcallName(LC1),
4317 DAG.getNode(ISD::MERGE_VALUES, VT, LHS, RHS).Val,
4318 false /*sign irrelevant*/, Dummy);
4319 Tmp2 = DAG.getConstant(0, MVT::i32);
4320 CC = DAG.getCondCode(TLI.getCmpLibcallCC(LC1));
4321 if (LC2 != RTLIB::UNKNOWN_LIBCALL) {
4322 Tmp1 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), Tmp1, Tmp2, CC);
4323 LHS = ExpandLibCall(TLI.getLibcallName(LC2),
4324 DAG.getNode(ISD::MERGE_VALUES, VT, LHS, RHS).Val,
4325 false /*sign irrelevant*/, Dummy);
4326 Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHS, Tmp2,
4327 DAG.getCondCode(TLI.getCmpLibcallCC(LC2)));
4328 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2);
4336 SDOperand LHSLo, LHSHi, RHSLo, RHSHi;
4337 ExpandOp(LHS, LHSLo, LHSHi);
4338 ExpandOp(RHS, RHSLo, RHSHi);
4339 ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get();
4341 if (VT==MVT::ppcf128) {
4342 // FIXME: This generated code sucks. We want to generate
4343 // FCMP crN, hi1, hi2
4345 // FCMP crN, lo1, lo2
4346 // The following can be improved, but not that much.
4347 Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETEQ);
4348 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, CCCode);
4349 Tmp3 = DAG.getNode(ISD::AND, Tmp1.getValueType(), Tmp1, Tmp2);
4350 Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETNE);
4351 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, CCCode);
4352 Tmp1 = DAG.getNode(ISD::AND, Tmp1.getValueType(), Tmp1, Tmp2);
4353 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp3);
4362 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo))
4363 if (RHSCST->isAllOnesValue()) {
4364 // Comparison to -1.
4365 Tmp1 = DAG.getNode(ISD::AND, LHSLo.getValueType(), LHSLo, LHSHi);
4370 Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo);
4371 Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi);
4372 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2);
4373 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
4376 // If this is a comparison of the sign bit, just look at the top part.
4378 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(RHS))
4379 if ((cast<CondCodeSDNode>(CC)->get() == ISD::SETLT &&
4380 CST->getValue() == 0) || // X < 0
4381 (cast<CondCodeSDNode>(CC)->get() == ISD::SETGT &&
4382 CST->isAllOnesValue())) { // X > -1
4388 // FIXME: This generated code sucks.
4389 ISD::CondCode LowCC;
4391 default: assert(0 && "Unknown integer setcc!");
4393 case ISD::SETULT: LowCC = ISD::SETULT; break;
4395 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
4397 case ISD::SETULE: LowCC = ISD::SETULE; break;
4399 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
4402 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
4403 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
4404 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
4406 // NOTE: on targets without efficient SELECT of bools, we can always use
4407 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
4408 TargetLowering::DAGCombinerInfo DagCombineInfo(DAG, false, true, NULL);
4409 Tmp1 = TLI.SimplifySetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC,
4410 false, DagCombineInfo);
4412 Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC);
4413 Tmp2 = TLI.SimplifySetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi,
4414 CCCode, false, DagCombineInfo);
4416 Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHSHi, RHSHi,CC);
4418 ConstantSDNode *Tmp1C = dyn_cast<ConstantSDNode>(Tmp1.Val);
4419 ConstantSDNode *Tmp2C = dyn_cast<ConstantSDNode>(Tmp2.Val);
4420 if ((Tmp1C && Tmp1C->getValue() == 0) ||
4421 (Tmp2C && Tmp2C->getValue() == 0 &&
4422 (CCCode == ISD::SETLE || CCCode == ISD::SETGE ||
4423 CCCode == ISD::SETUGE || CCCode == ISD::SETULE)) ||
4424 (Tmp2C && Tmp2C->getValue() == 1 &&
4425 (CCCode == ISD::SETLT || CCCode == ISD::SETGT ||
4426 CCCode == ISD::SETUGT || CCCode == ISD::SETULT))) {
4427 // low part is known false, returns high part.
4428 // For LE / GE, if high part is known false, ignore the low part.
4429 // For LT / GT, if high part is known true, ignore the low part.
4433 Result = TLI.SimplifySetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi,
4434 ISD::SETEQ, false, DagCombineInfo);
4436 Result=DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETEQ);
4437 Result = LegalizeOp(DAG.getNode(ISD::SELECT, Tmp1.getValueType(),
4438 Result, Tmp1, Tmp2));
4449 /// ExpandBIT_CONVERT - Expand a BIT_CONVERT node into a store/load combination.
4450 /// The resultant code need not be legal. Note that SrcOp is the input operand
4451 /// to the BIT_CONVERT, not the BIT_CONVERT node itself.
4452 SDOperand SelectionDAGLegalize::ExpandBIT_CONVERT(MVT::ValueType DestVT,
4454 // Create the stack frame object.
4455 SDOperand FIPtr = DAG.CreateStackTemporary(DestVT);
4457 // Emit a store to the stack slot.
4458 SDOperand Store = DAG.getStore(DAG.getEntryNode(), SrcOp, FIPtr, NULL, 0);
4459 // Result is a load from the stack slot.
4460 return DAG.getLoad(DestVT, Store, FIPtr, NULL, 0);
4463 SDOperand SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
4464 // Create a vector sized/aligned stack slot, store the value to element #0,
4465 // then load the whole vector back out.
4466 SDOperand StackPtr = DAG.CreateStackTemporary(Node->getValueType(0));
4467 SDOperand Ch = DAG.getStore(DAG.getEntryNode(), Node->getOperand(0), StackPtr,
4469 return DAG.getLoad(Node->getValueType(0), Ch, StackPtr, NULL, 0);
4473 /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
4474 /// support the operation, but do support the resultant vector type.
4475 SDOperand SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
4477 // If the only non-undef value is the low element, turn this into a
4478 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
4479 unsigned NumElems = Node->getNumOperands();
4480 bool isOnlyLowElement = true;
4481 SDOperand SplatValue = Node->getOperand(0);
4482 std::map<SDOperand, std::vector<unsigned> > Values;
4483 Values[SplatValue].push_back(0);
4484 bool isConstant = true;
4485 if (!isa<ConstantFPSDNode>(SplatValue) && !isa<ConstantSDNode>(SplatValue) &&
4486 SplatValue.getOpcode() != ISD::UNDEF)
4489 for (unsigned i = 1; i < NumElems; ++i) {
4490 SDOperand V = Node->getOperand(i);
4491 Values[V].push_back(i);
4492 if (V.getOpcode() != ISD::UNDEF)
4493 isOnlyLowElement = false;
4494 if (SplatValue != V)
4495 SplatValue = SDOperand(0,0);
4497 // If this isn't a constant element or an undef, we can't use a constant
4499 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V) &&
4500 V.getOpcode() != ISD::UNDEF)
4504 if (isOnlyLowElement) {
4505 // If the low element is an undef too, then this whole things is an undef.
4506 if (Node->getOperand(0).getOpcode() == ISD::UNDEF)
4507 return DAG.getNode(ISD::UNDEF, Node->getValueType(0));
4508 // Otherwise, turn this into a scalar_to_vector node.
4509 return DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
4510 Node->getOperand(0));
4513 // If all elements are constants, create a load from the constant pool.
4515 MVT::ValueType VT = Node->getValueType(0);
4517 MVT::getTypeForValueType(Node->getOperand(0).getValueType());
4518 std::vector<Constant*> CV;
4519 for (unsigned i = 0, e = NumElems; i != e; ++i) {
4520 if (ConstantFPSDNode *V =
4521 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
4522 CV.push_back(ConstantFP::get(OpNTy, V->getValueAPF()));
4523 } else if (ConstantSDNode *V =
4524 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
4525 CV.push_back(ConstantInt::get(OpNTy, V->getValue()));
4527 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
4528 CV.push_back(UndefValue::get(OpNTy));
4531 Constant *CP = ConstantVector::get(CV);
4532 SDOperand CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
4533 return DAG.getLoad(VT, DAG.getEntryNode(), CPIdx, NULL, 0);
4536 if (SplatValue.Val) { // Splat of one value?
4537 // Build the shuffle constant vector: <0, 0, 0, 0>
4538 MVT::ValueType MaskVT =
4539 MVT::getIntVectorWithNumElements(NumElems);
4540 SDOperand Zero = DAG.getConstant(0, MVT::getVectorElementType(MaskVT));
4541 std::vector<SDOperand> ZeroVec(NumElems, Zero);
4542 SDOperand SplatMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT,
4543 &ZeroVec[0], ZeroVec.size());
4545 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
4546 if (isShuffleLegal(Node->getValueType(0), SplatMask)) {
4547 // Get the splatted value into the low element of a vector register.
4548 SDOperand LowValVec =
4549 DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0), SplatValue);
4551 // Return shuffle(LowValVec, undef, <0,0,0,0>)
4552 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0), LowValVec,
4553 DAG.getNode(ISD::UNDEF, Node->getValueType(0)),
4558 // If there are only two unique elements, we may be able to turn this into a
4560 if (Values.size() == 2) {
4561 // Build the shuffle constant vector: e.g. <0, 4, 0, 4>
4562 MVT::ValueType MaskVT =
4563 MVT::getIntVectorWithNumElements(NumElems);
4564 std::vector<SDOperand> MaskVec(NumElems);
4566 for (std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
4567 E = Values.end(); I != E; ++I) {
4568 for (std::vector<unsigned>::iterator II = I->second.begin(),
4569 EE = I->second.end(); II != EE; ++II)
4570 MaskVec[*II] = DAG.getConstant(i, MVT::getVectorElementType(MaskVT));
4573 SDOperand ShuffleMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT,
4574 &MaskVec[0], MaskVec.size());
4576 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
4577 if (TLI.isOperationLegal(ISD::SCALAR_TO_VECTOR, Node->getValueType(0)) &&
4578 isShuffleLegal(Node->getValueType(0), ShuffleMask)) {
4579 SmallVector<SDOperand, 8> Ops;
4580 for(std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
4581 E = Values.end(); I != E; ++I) {
4582 SDOperand Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
4586 Ops.push_back(ShuffleMask);
4588 // Return shuffle(LoValVec, HiValVec, <0,1,0,1>)
4589 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0),
4590 &Ops[0], Ops.size());
4594 // Otherwise, we can't handle this case efficiently. Allocate a sufficiently
4595 // aligned object on the stack, store each element into it, then load
4596 // the result as a vector.
4597 MVT::ValueType VT = Node->getValueType(0);
4598 // Create the stack frame object.
4599 SDOperand FIPtr = DAG.CreateStackTemporary(VT);
4601 // Emit a store of each element to the stack slot.
4602 SmallVector<SDOperand, 8> Stores;
4603 unsigned TypeByteSize =
4604 MVT::getSizeInBits(Node->getOperand(0).getValueType())/8;
4605 // Store (in the right endianness) the elements to memory.
4606 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
4607 // Ignore undef elements.
4608 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
4610 unsigned Offset = TypeByteSize*i;
4612 SDOperand Idx = DAG.getConstant(Offset, FIPtr.getValueType());
4613 Idx = DAG.getNode(ISD::ADD, FIPtr.getValueType(), FIPtr, Idx);
4615 Stores.push_back(DAG.getStore(DAG.getEntryNode(), Node->getOperand(i), Idx,
4619 SDOperand StoreChain;
4620 if (!Stores.empty()) // Not all undef elements?
4621 StoreChain = DAG.getNode(ISD::TokenFactor, MVT::Other,
4622 &Stores[0], Stores.size());
4624 StoreChain = DAG.getEntryNode();
4626 // Result is a load from the stack slot.
4627 return DAG.getLoad(VT, StoreChain, FIPtr, NULL, 0);
4630 void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp,
4631 SDOperand Op, SDOperand Amt,
4632 SDOperand &Lo, SDOperand &Hi) {
4633 // Expand the subcomponents.
4634 SDOperand LHSL, LHSH;
4635 ExpandOp(Op, LHSL, LHSH);
4637 SDOperand Ops[] = { LHSL, LHSH, Amt };
4638 MVT::ValueType VT = LHSL.getValueType();
4639 Lo = DAG.getNode(NodeOp, DAG.getNodeValueTypes(VT, VT), 2, Ops, 3);
4640 Hi = Lo.getValue(1);
4644 /// ExpandShift - Try to find a clever way to expand this shift operation out to
4645 /// smaller elements. If we can't find a way that is more efficient than a
4646 /// libcall on this target, return false. Otherwise, return true with the
4647 /// low-parts expanded into Lo and Hi.
4648 bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt,
4649 SDOperand &Lo, SDOperand &Hi) {
4650 assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) &&
4651 "This is not a shift!");
4653 MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType());
4654 SDOperand ShAmt = LegalizeOp(Amt);
4655 MVT::ValueType ShTy = ShAmt.getValueType();
4656 unsigned VTBits = MVT::getSizeInBits(Op.getValueType());
4657 unsigned NVTBits = MVT::getSizeInBits(NVT);
4659 // Handle the case when Amt is an immediate.
4660 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.Val)) {
4661 unsigned Cst = CN->getValue();
4662 // Expand the incoming operand to be shifted, so that we have its parts
4664 ExpandOp(Op, InL, InH);
4668 Lo = DAG.getConstant(0, NVT);
4669 Hi = DAG.getConstant(0, NVT);
4670 } else if (Cst > NVTBits) {
4671 Lo = DAG.getConstant(0, NVT);
4672 Hi = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst-NVTBits,ShTy));
4673 } else if (Cst == NVTBits) {
4674 Lo = DAG.getConstant(0, NVT);
4677 Lo = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst, ShTy));
4678 Hi = DAG.getNode(ISD::OR, NVT,
4679 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(Cst, ShTy)),
4680 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(NVTBits-Cst, ShTy)));
4685 Lo = DAG.getConstant(0, NVT);
4686 Hi = DAG.getConstant(0, NVT);
4687 } else if (Cst > NVTBits) {
4688 Lo = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst-NVTBits,ShTy));
4689 Hi = DAG.getConstant(0, NVT);
4690 } else if (Cst == NVTBits) {
4692 Hi = DAG.getConstant(0, NVT);
4694 Lo = DAG.getNode(ISD::OR, NVT,
4695 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
4696 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
4697 Hi = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst, ShTy));
4702 Hi = Lo = DAG.getNode(ISD::SRA, NVT, InH,
4703 DAG.getConstant(NVTBits-1, ShTy));
4704 } else if (Cst > NVTBits) {
4705 Lo = DAG.getNode(ISD::SRA, NVT, InH,
4706 DAG.getConstant(Cst-NVTBits, ShTy));
4707 Hi = DAG.getNode(ISD::SRA, NVT, InH,
4708 DAG.getConstant(NVTBits-1, ShTy));
4709 } else if (Cst == NVTBits) {
4711 Hi = DAG.getNode(ISD::SRA, NVT, InH,
4712 DAG.getConstant(NVTBits-1, ShTy));
4714 Lo = DAG.getNode(ISD::OR, NVT,
4715 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
4716 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
4717 Hi = DAG.getNode(ISD::SRA, NVT, InH, DAG.getConstant(Cst, ShTy));
4723 // Okay, the shift amount isn't constant. However, if we can tell that it is
4724 // >= 32 or < 32, we can still simplify it, without knowing the actual value.
4725 uint64_t Mask = NVTBits, KnownZero, KnownOne;
4726 DAG.ComputeMaskedBits(Amt, Mask, KnownZero, KnownOne);
4728 // If we know that the high bit of the shift amount is one, then we can do
4729 // this as a couple of simple shifts.
4730 if (KnownOne & Mask) {
4731 // Mask out the high bit, which we know is set.
4732 Amt = DAG.getNode(ISD::AND, Amt.getValueType(), Amt,
4733 DAG.getConstant(NVTBits-1, Amt.getValueType()));
4735 // Expand the incoming operand to be shifted, so that we have its parts
4737 ExpandOp(Op, InL, InH);
4740 Lo = DAG.getConstant(0, NVT); // Low part is zero.
4741 Hi = DAG.getNode(ISD::SHL, NVT, InL, Amt); // High part from Lo part.
4744 Hi = DAG.getConstant(0, NVT); // Hi part is zero.
4745 Lo = DAG.getNode(ISD::SRL, NVT, InH, Amt); // Lo part from Hi part.
4748 Hi = DAG.getNode(ISD::SRA, NVT, InH, // Sign extend high part.
4749 DAG.getConstant(NVTBits-1, Amt.getValueType()));
4750 Lo = DAG.getNode(ISD::SRA, NVT, InH, Amt); // Lo part from Hi part.
4755 // If we know that the high bit of the shift amount is zero, then we can do
4756 // this as a couple of simple shifts.
4757 if (KnownZero & Mask) {
4759 SDOperand Amt2 = DAG.getNode(ISD::SUB, Amt.getValueType(),
4760 DAG.getConstant(NVTBits, Amt.getValueType()),
4763 // Expand the incoming operand to be shifted, so that we have its parts
4765 ExpandOp(Op, InL, InH);
4768 Lo = DAG.getNode(ISD::SHL, NVT, InL, Amt);
4769 Hi = DAG.getNode(ISD::OR, NVT,
4770 DAG.getNode(ISD::SHL, NVT, InH, Amt),
4771 DAG.getNode(ISD::SRL, NVT, InL, Amt2));
4774 Hi = DAG.getNode(ISD::SRL, NVT, InH, Amt);
4775 Lo = DAG.getNode(ISD::OR, NVT,
4776 DAG.getNode(ISD::SRL, NVT, InL, Amt),
4777 DAG.getNode(ISD::SHL, NVT, InH, Amt2));
4780 Hi = DAG.getNode(ISD::SRA, NVT, InH, Amt);
4781 Lo = DAG.getNode(ISD::OR, NVT,
4782 DAG.getNode(ISD::SRL, NVT, InL, Amt),
4783 DAG.getNode(ISD::SHL, NVT, InH, Amt2));
4792 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
4793 // does not fit into a register, return the lo part and set the hi part to the
4794 // by-reg argument. If it does fit into a single register, return the result
4795 // and leave the Hi part unset.
4796 SDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node,
4797 bool isSigned, SDOperand &Hi) {
4798 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
4799 // The input chain to this libcall is the entry node of the function.
4800 // Legalizing the call will automatically add the previous call to the
4802 SDOperand InChain = DAG.getEntryNode();
4804 TargetLowering::ArgListTy Args;
4805 TargetLowering::ArgListEntry Entry;
4806 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
4807 MVT::ValueType ArgVT = Node->getOperand(i).getValueType();
4808 const Type *ArgTy = MVT::getTypeForValueType(ArgVT);
4809 Entry.Node = Node->getOperand(i); Entry.Ty = ArgTy;
4810 Entry.isSExt = isSigned;
4811 Args.push_back(Entry);
4813 SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy());
4815 // Splice the libcall in wherever FindInputOutputChains tells us to.
4816 const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0));
4817 std::pair<SDOperand,SDOperand> CallInfo =
4818 TLI.LowerCallTo(InChain, RetTy, isSigned, false, CallingConv::C, false,
4821 // Legalize the call sequence, starting with the chain. This will advance
4822 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
4823 // was added by LowerCallTo (guaranteeing proper serialization of calls).
4824 LegalizeOp(CallInfo.second);
4826 switch (getTypeAction(CallInfo.first.getValueType())) {
4827 default: assert(0 && "Unknown thing");
4829 Result = CallInfo.first;
4832 ExpandOp(CallInfo.first, Result, Hi);
4839 /// ExpandIntToFP - Expand a [US]INT_TO_FP operation.
4841 SDOperand SelectionDAGLegalize::
4842 ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) {
4843 assert(getTypeAction(Source.getValueType()) == Expand &&
4844 "This is not an expansion!");
4845 assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!");
4848 assert(Source.getValueType() == MVT::i64 &&
4849 "This only works for 64-bit -> FP");
4850 // The 64-bit value loaded will be incorrectly if the 'sign bit' of the
4851 // incoming integer is set. To handle this, we dynamically test to see if
4852 // it is set, and, if so, add a fudge factor.
4854 ExpandOp(Source, Lo, Hi);
4856 // If this is unsigned, and not supported, first perform the conversion to
4857 // signed, then adjust the result if the sign bit is set.
4858 SDOperand SignedConv = ExpandIntToFP(true, DestTy,
4859 DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), Lo, Hi));
4861 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Hi,
4862 DAG.getConstant(0, Hi.getValueType()),
4864 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
4865 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
4866 SignSet, Four, Zero);
4867 uint64_t FF = 0x5f800000ULL;
4868 if (TLI.isLittleEndian()) FF <<= 32;
4869 static Constant *FudgeFactor = ConstantInt::get(Type::Int64Ty, FF);
4871 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
4872 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
4873 SDOperand FudgeInReg;
4874 if (DestTy == MVT::f32)
4875 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx, NULL, 0);
4876 else if (MVT::getSizeInBits(DestTy) > MVT::getSizeInBits(MVT::f32))
4877 // FIXME: Avoid the extend by construction the right constantpool?
4878 FudgeInReg = DAG.getExtLoad(ISD::EXTLOAD, DestTy, DAG.getEntryNode(),
4879 CPIdx, NULL, 0, MVT::f32);
4881 assert(0 && "Unexpected conversion");
4883 MVT::ValueType SCVT = SignedConv.getValueType();
4884 if (SCVT != DestTy) {
4885 // Destination type needs to be expanded as well. The FADD now we are
4886 // constructing will be expanded into a libcall.
4887 if (MVT::getSizeInBits(SCVT) != MVT::getSizeInBits(DestTy)) {
4888 assert(SCVT == MVT::i32 && DestTy == MVT::f64);
4889 SignedConv = DAG.getNode(ISD::BUILD_PAIR, MVT::i64,
4890 SignedConv, SignedConv.getValue(1));
4892 SignedConv = DAG.getNode(ISD::BIT_CONVERT, DestTy, SignedConv);
4894 return DAG.getNode(ISD::FADD, DestTy, SignedConv, FudgeInReg);
4897 // Check to see if the target has a custom way to lower this. If so, use it.
4898 switch (TLI.getOperationAction(ISD::SINT_TO_FP, Source.getValueType())) {
4899 default: assert(0 && "This action not implemented for this operation!");
4900 case TargetLowering::Legal:
4901 case TargetLowering::Expand:
4902 break; // This case is handled below.
4903 case TargetLowering::Custom: {
4904 SDOperand NV = TLI.LowerOperation(DAG.getNode(ISD::SINT_TO_FP, DestTy,
4907 return LegalizeOp(NV);
4908 break; // The target decided this was legal after all
4912 // Expand the source, then glue it back together for the call. We must expand
4913 // the source in case it is shared (this pass of legalize must traverse it).
4914 SDOperand SrcLo, SrcHi;
4915 ExpandOp(Source, SrcLo, SrcHi);
4916 Source = DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), SrcLo, SrcHi);
4919 if (DestTy == MVT::f32)
4920 LC = RTLIB::SINTTOFP_I64_F32;
4922 assert(DestTy == MVT::f64 && "Unknown fp value type!");
4923 LC = RTLIB::SINTTOFP_I64_F64;
4926 assert(TLI.getLibcallName(LC) && "Don't know how to expand this SINT_TO_FP!");
4927 Source = DAG.getNode(ISD::SINT_TO_FP, DestTy, Source);
4928 SDOperand UnusedHiPart;
4929 return ExpandLibCall(TLI.getLibcallName(LC), Source.Val, isSigned,
4933 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
4934 /// INT_TO_FP operation of the specified operand when the target requests that
4935 /// we expand it. At this point, we know that the result and operand types are
4936 /// legal for the target.
4937 SDOperand SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
4939 MVT::ValueType DestVT) {
4940 if (Op0.getValueType() == MVT::i32) {
4941 // simple 32-bit [signed|unsigned] integer to float/double expansion
4943 // get the stack frame index of a 8 byte buffer, pessimistically aligned
4944 MachineFunction &MF = DAG.getMachineFunction();
4945 const Type *F64Type = MVT::getTypeForValueType(MVT::f64);
4946 unsigned StackAlign =
4947 (unsigned)TLI.getTargetData()->getPrefTypeAlignment(F64Type);
4948 int SSFI = MF.getFrameInfo()->CreateStackObject(8, StackAlign);
4949 // get address of 8 byte buffer
4950 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
4951 // word offset constant for Hi/Lo address computation
4952 SDOperand WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
4953 // set up Hi and Lo (into buffer) address based on endian
4954 SDOperand Hi = StackSlot;
4955 SDOperand Lo = DAG.getNode(ISD::ADD, TLI.getPointerTy(), StackSlot,WordOff);
4956 if (TLI.isLittleEndian())
4959 // if signed map to unsigned space
4960 SDOperand Op0Mapped;
4962 // constant used to invert sign bit (signed to unsigned mapping)
4963 SDOperand SignBit = DAG.getConstant(0x80000000u, MVT::i32);
4964 Op0Mapped = DAG.getNode(ISD::XOR, MVT::i32, Op0, SignBit);
4968 // store the lo of the constructed double - based on integer input
4969 SDOperand Store1 = DAG.getStore(DAG.getEntryNode(),
4970 Op0Mapped, Lo, NULL, 0);
4971 // initial hi portion of constructed double
4972 SDOperand InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
4973 // store the hi of the constructed double - biased exponent
4974 SDOperand Store2=DAG.getStore(Store1, InitialHi, Hi, NULL, 0);
4975 // load the constructed double
4976 SDOperand Load = DAG.getLoad(MVT::f64, Store2, StackSlot, NULL, 0);
4977 // FP constant to bias correct the final result
4978 SDOperand Bias = DAG.getConstantFP(isSigned ?
4979 BitsToDouble(0x4330000080000000ULL)
4980 : BitsToDouble(0x4330000000000000ULL),
4982 // subtract the bias
4983 SDOperand Sub = DAG.getNode(ISD::FSUB, MVT::f64, Load, Bias);
4986 // handle final rounding
4987 if (DestVT == MVT::f64) {
4990 } else if (MVT::getSizeInBits(DestVT) < MVT::getSizeInBits(MVT::f64)) {
4991 Result = DAG.getNode(ISD::FP_ROUND, DestVT, Sub);
4992 } else if (MVT::getSizeInBits(DestVT) > MVT::getSizeInBits(MVT::f64)) {
4993 Result = DAG.getNode(ISD::FP_EXTEND, DestVT, Sub);
4997 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
4998 SDOperand Tmp1 = DAG.getNode(ISD::SINT_TO_FP, DestVT, Op0);
5000 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Op0,
5001 DAG.getConstant(0, Op0.getValueType()),
5003 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
5004 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
5005 SignSet, Four, Zero);
5007 // If the sign bit of the integer is set, the large number will be treated
5008 // as a negative number. To counteract this, the dynamic code adds an
5009 // offset depending on the data type.
5011 switch (Op0.getValueType()) {
5012 default: assert(0 && "Unsupported integer type!");
5013 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
5014 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
5015 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
5016 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
5018 if (TLI.isLittleEndian()) FF <<= 32;
5019 static Constant *FudgeFactor = ConstantInt::get(Type::Int64Ty, FF);
5021 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
5022 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
5023 SDOperand FudgeInReg;
5024 if (DestVT == MVT::f32)
5025 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx, NULL, 0);
5027 FudgeInReg = LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, DestVT,
5028 DAG.getEntryNode(), CPIdx,
5029 NULL, 0, MVT::f32));
5032 return DAG.getNode(ISD::FADD, DestVT, Tmp1, FudgeInReg);
5035 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
5036 /// *INT_TO_FP operation of the specified operand when the target requests that
5037 /// we promote it. At this point, we know that the result and operand types are
5038 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
5039 /// operation that takes a larger input.
5040 SDOperand SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDOperand LegalOp,
5041 MVT::ValueType DestVT,
5043 // First step, figure out the appropriate *INT_TO_FP operation to use.
5044 MVT::ValueType NewInTy = LegalOp.getValueType();
5046 unsigned OpToUse = 0;
5048 // Scan for the appropriate larger type to use.
5050 NewInTy = (MVT::ValueType)(NewInTy+1);
5051 assert(MVT::isInteger(NewInTy) && "Ran out of possibilities!");
5053 // If the target supports SINT_TO_FP of this type, use it.
5054 switch (TLI.getOperationAction(ISD::SINT_TO_FP, NewInTy)) {
5056 case TargetLowering::Legal:
5057 if (!TLI.isTypeLegal(NewInTy))
5058 break; // Can't use this datatype.
5060 case TargetLowering::Custom:
5061 OpToUse = ISD::SINT_TO_FP;
5065 if (isSigned) continue;
5067 // If the target supports UINT_TO_FP of this type, use it.
5068 switch (TLI.getOperationAction(ISD::UINT_TO_FP, NewInTy)) {
5070 case TargetLowering::Legal:
5071 if (!TLI.isTypeLegal(NewInTy))
5072 break; // Can't use this datatype.
5074 case TargetLowering::Custom:
5075 OpToUse = ISD::UINT_TO_FP;
5080 // Otherwise, try a larger type.
5083 // Okay, we found the operation and type to use. Zero extend our input to the
5084 // desired type then run the operation on it.
5085 return DAG.getNode(OpToUse, DestVT,
5086 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
5090 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
5091 /// FP_TO_*INT operation of the specified operand when the target requests that
5092 /// we promote it. At this point, we know that the result and operand types are
5093 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
5094 /// operation that returns a larger result.
5095 SDOperand SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDOperand LegalOp,
5096 MVT::ValueType DestVT,
5098 // First step, figure out the appropriate FP_TO*INT operation to use.
5099 MVT::ValueType NewOutTy = DestVT;
5101 unsigned OpToUse = 0;
5103 // Scan for the appropriate larger type to use.
5105 NewOutTy = (MVT::ValueType)(NewOutTy+1);
5106 assert(MVT::isInteger(NewOutTy) && "Ran out of possibilities!");
5108 // If the target supports FP_TO_SINT returning this type, use it.
5109 switch (TLI.getOperationAction(ISD::FP_TO_SINT, NewOutTy)) {
5111 case TargetLowering::Legal:
5112 if (!TLI.isTypeLegal(NewOutTy))
5113 break; // Can't use this datatype.
5115 case TargetLowering::Custom:
5116 OpToUse = ISD::FP_TO_SINT;
5121 // If the target supports FP_TO_UINT of this type, use it.
5122 switch (TLI.getOperationAction(ISD::FP_TO_UINT, NewOutTy)) {
5124 case TargetLowering::Legal:
5125 if (!TLI.isTypeLegal(NewOutTy))
5126 break; // Can't use this datatype.
5128 case TargetLowering::Custom:
5129 OpToUse = ISD::FP_TO_UINT;
5134 // Otherwise, try a larger type.
5137 // Okay, we found the operation and type to use. Truncate the result of the
5138 // extended FP_TO_*INT operation to the desired size.
5139 return DAG.getNode(ISD::TRUNCATE, DestVT,
5140 DAG.getNode(OpToUse, NewOutTy, LegalOp));
5143 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
5145 SDOperand SelectionDAGLegalize::ExpandBSWAP(SDOperand Op) {
5146 MVT::ValueType VT = Op.getValueType();
5147 MVT::ValueType SHVT = TLI.getShiftAmountTy();
5148 SDOperand Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
5150 default: assert(0 && "Unhandled Expand type in BSWAP!"); abort();
5152 Tmp2 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
5153 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
5154 return DAG.getNode(ISD::OR, VT, Tmp1, Tmp2);
5156 Tmp4 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
5157 Tmp3 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
5158 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
5159 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
5160 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
5161 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(0xFF00, VT));
5162 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
5163 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
5164 return DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
5166 Tmp8 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(56, SHVT));
5167 Tmp7 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(40, SHVT));
5168 Tmp6 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
5169 Tmp5 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
5170 Tmp4 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
5171 Tmp3 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
5172 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(40, SHVT));
5173 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(56, SHVT));
5174 Tmp7 = DAG.getNode(ISD::AND, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
5175 Tmp6 = DAG.getNode(ISD::AND, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
5176 Tmp5 = DAG.getNode(ISD::AND, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
5177 Tmp4 = DAG.getNode(ISD::AND, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
5178 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
5179 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
5180 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp7);
5181 Tmp6 = DAG.getNode(ISD::OR, VT, Tmp6, Tmp5);
5182 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
5183 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
5184 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp6);
5185 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
5186 return DAG.getNode(ISD::OR, VT, Tmp8, Tmp4);
5190 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
5192 SDOperand SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDOperand Op) {
5194 default: assert(0 && "Cannot expand this yet!");
5196 static const uint64_t mask[6] = {
5197 0x5555555555555555ULL, 0x3333333333333333ULL,
5198 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
5199 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
5201 MVT::ValueType VT = Op.getValueType();
5202 MVT::ValueType ShVT = TLI.getShiftAmountTy();
5203 unsigned len = MVT::getSizeInBits(VT);
5204 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
5205 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
5206 SDOperand Tmp2 = DAG.getConstant(mask[i], VT);
5207 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
5208 Op = DAG.getNode(ISD::ADD, VT, DAG.getNode(ISD::AND, VT, Op, Tmp2),
5209 DAG.getNode(ISD::AND, VT,
5210 DAG.getNode(ISD::SRL, VT, Op, Tmp3),Tmp2));
5215 // for now, we do this:
5216 // x = x | (x >> 1);
5217 // x = x | (x >> 2);
5219 // x = x | (x >>16);
5220 // x = x | (x >>32); // for 64-bit input
5221 // return popcount(~x);
5223 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
5224 MVT::ValueType VT = Op.getValueType();
5225 MVT::ValueType ShVT = TLI.getShiftAmountTy();
5226 unsigned len = MVT::getSizeInBits(VT);
5227 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
5228 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
5229 Op = DAG.getNode(ISD::OR, VT, Op, DAG.getNode(ISD::SRL, VT, Op, Tmp3));
5231 Op = DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(~0ULL, VT));
5232 return DAG.getNode(ISD::CTPOP, VT, Op);
5235 // for now, we use: { return popcount(~x & (x - 1)); }
5236 // unless the target has ctlz but not ctpop, in which case we use:
5237 // { return 32 - nlz(~x & (x-1)); }
5238 // see also http://www.hackersdelight.org/HDcode/ntz.cc
5239 MVT::ValueType VT = Op.getValueType();
5240 SDOperand Tmp2 = DAG.getConstant(~0ULL, VT);
5241 SDOperand Tmp3 = DAG.getNode(ISD::AND, VT,
5242 DAG.getNode(ISD::XOR, VT, Op, Tmp2),
5243 DAG.getNode(ISD::SUB, VT, Op, DAG.getConstant(1, VT)));
5244 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
5245 if (!TLI.isOperationLegal(ISD::CTPOP, VT) &&
5246 TLI.isOperationLegal(ISD::CTLZ, VT))
5247 return DAG.getNode(ISD::SUB, VT,
5248 DAG.getConstant(MVT::getSizeInBits(VT), VT),
5249 DAG.getNode(ISD::CTLZ, VT, Tmp3));
5250 return DAG.getNode(ISD::CTPOP, VT, Tmp3);
5255 /// ExpandOp - Expand the specified SDOperand into its two component pieces
5256 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the
5257 /// LegalizeNodes map is filled in for any results that are not expanded, the
5258 /// ExpandedNodes map is filled in for any results that are expanded, and the
5259 /// Lo/Hi values are returned.
5260 void SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){
5261 MVT::ValueType VT = Op.getValueType();
5262 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
5263 SDNode *Node = Op.Val;
5264 assert(getTypeAction(VT) == Expand && "Not an expanded type!");
5265 assert(((MVT::isInteger(NVT) && NVT < VT) || MVT::isFloatingPoint(VT) ||
5266 MVT::isVector(VT)) &&
5267 "Cannot expand to FP value or to larger int value!");
5269 // See if we already expanded it.
5270 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
5271 = ExpandedNodes.find(Op);
5272 if (I != ExpandedNodes.end()) {
5273 Lo = I->second.first;
5274 Hi = I->second.second;
5278 switch (Node->getOpcode()) {
5279 case ISD::CopyFromReg:
5280 assert(0 && "CopyFromReg must be legal!");
5281 case ISD::FP_ROUND_INREG:
5282 if (VT == MVT::ppcf128 &&
5283 TLI.getOperationAction(ISD::FP_ROUND_INREG, VT) ==
5284 TargetLowering::Custom) {
5285 SDOperand SrcLo, SrcHi, Src;
5286 ExpandOp(Op.getOperand(0), SrcLo, SrcHi);
5287 Src = DAG.getNode(ISD::BUILD_PAIR, VT, SrcLo, SrcHi);
5288 SDOperand Result = TLI.LowerOperation(
5289 DAG.getNode(ISD::FP_ROUND_INREG, VT, Src, Op.getOperand(1)), DAG);
5290 assert(Result.Val->getOpcode() == ISD::BUILD_PAIR);
5291 Lo = Result.Val->getOperand(0);
5292 Hi = Result.Val->getOperand(1);
5298 cerr << "NODE: "; Node->dump(&DAG); cerr << "\n";
5300 assert(0 && "Do not know how to expand this operator!");
5302 case ISD::EXTRACT_VECTOR_ELT:
5303 assert(VT==MVT::i64 && "Do not know how to expand this operator!");
5304 // ExpandEXTRACT_VECTOR_ELT tolerates invalid result types.
5305 Lo = ExpandEXTRACT_VECTOR_ELT(Op);
5306 return ExpandOp(Lo, Lo, Hi);
5308 NVT = TLI.getTypeToExpandTo(VT);
5309 Lo = DAG.getNode(ISD::UNDEF, NVT);
5310 Hi = DAG.getNode(ISD::UNDEF, NVT);
5312 case ISD::Constant: {
5313 uint64_t Cst = cast<ConstantSDNode>(Node)->getValue();
5314 Lo = DAG.getConstant(Cst, NVT);
5315 Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT);
5318 case ISD::ConstantFP: {
5319 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
5320 if (CFP->getValueType(0) == MVT::ppcf128) {
5321 APInt api = CFP->getValueAPF().convertToAPInt();
5322 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &api.getRawData()[1])),
5324 Hi = DAG.getConstantFP(APFloat(APInt(64, 1, &api.getRawData()[0])),
5328 Lo = ExpandConstantFP(CFP, false, DAG, TLI);
5329 if (getTypeAction(Lo.getValueType()) == Expand)
5330 ExpandOp(Lo, Lo, Hi);
5333 case ISD::BUILD_PAIR:
5334 // Return the operands.
5335 Lo = Node->getOperand(0);
5336 Hi = Node->getOperand(1);
5339 case ISD::SIGN_EXTEND_INREG:
5340 ExpandOp(Node->getOperand(0), Lo, Hi);
5341 // sext_inreg the low part if needed.
5342 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Lo, Node->getOperand(1));
5344 // The high part gets the sign extension from the lo-part. This handles
5345 // things like sextinreg V:i64 from i8.
5346 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
5347 DAG.getConstant(MVT::getSizeInBits(NVT)-1,
5348 TLI.getShiftAmountTy()));
5352 ExpandOp(Node->getOperand(0), Lo, Hi);
5353 SDOperand TempLo = DAG.getNode(ISD::BSWAP, NVT, Hi);
5354 Hi = DAG.getNode(ISD::BSWAP, NVT, Lo);
5360 ExpandOp(Node->getOperand(0), Lo, Hi);
5361 Lo = DAG.getNode(ISD::ADD, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L)
5362 DAG.getNode(ISD::CTPOP, NVT, Lo),
5363 DAG.getNode(ISD::CTPOP, NVT, Hi));
5364 Hi = DAG.getConstant(0, NVT);
5368 // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32)
5369 ExpandOp(Node->getOperand(0), Lo, Hi);
5370 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
5371 SDOperand HLZ = DAG.getNode(ISD::CTLZ, NVT, Hi);
5372 SDOperand TopNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), HLZ, BitsC,
5374 SDOperand LowPart = DAG.getNode(ISD::CTLZ, NVT, Lo);
5375 LowPart = DAG.getNode(ISD::ADD, NVT, LowPart, BitsC);
5377 Lo = DAG.getNode(ISD::SELECT, NVT, TopNotZero, HLZ, LowPart);
5378 Hi = DAG.getConstant(0, NVT);
5383 // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32)
5384 ExpandOp(Node->getOperand(0), Lo, Hi);
5385 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
5386 SDOperand LTZ = DAG.getNode(ISD::CTTZ, NVT, Lo);
5387 SDOperand BotNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), LTZ, BitsC,
5389 SDOperand HiPart = DAG.getNode(ISD::CTTZ, NVT, Hi);
5390 HiPart = DAG.getNode(ISD::ADD, NVT, HiPart, BitsC);
5392 Lo = DAG.getNode(ISD::SELECT, NVT, BotNotZero, LTZ, HiPart);
5393 Hi = DAG.getConstant(0, NVT);
5398 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
5399 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
5400 Lo = DAG.getVAArg(NVT, Ch, Ptr, Node->getOperand(2));
5401 Hi = DAG.getVAArg(NVT, Lo.getValue(1), Ptr, Node->getOperand(2));
5403 // Remember that we legalized the chain.
5404 Hi = LegalizeOp(Hi);
5405 AddLegalizedOperand(Op.getValue(1), Hi.getValue(1));
5406 if (!TLI.isLittleEndian())
5412 LoadSDNode *LD = cast<LoadSDNode>(Node);
5413 SDOperand Ch = LD->getChain(); // Legalize the chain.
5414 SDOperand Ptr = LD->getBasePtr(); // Legalize the pointer.
5415 ISD::LoadExtType ExtType = LD->getExtensionType();
5416 int SVOffset = LD->getSrcValueOffset();
5417 unsigned Alignment = LD->getAlignment();
5418 bool isVolatile = LD->isVolatile();
5420 if (ExtType == ISD::NON_EXTLOAD) {
5421 Lo = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(), SVOffset,
5422 isVolatile, Alignment);
5423 if (VT == MVT::f32 || VT == MVT::f64) {
5424 // f32->i32 or f64->i64 one to one expansion.
5425 // Remember that we legalized the chain.
5426 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
5427 // Recursively expand the new load.
5428 if (getTypeAction(NVT) == Expand)
5429 ExpandOp(Lo, Lo, Hi);
5433 // Increment the pointer to the other half.
5434 unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8;
5435 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
5436 getIntPtrConstant(IncrementSize));
5437 SVOffset += IncrementSize;
5438 Alignment = MinAlign(Alignment, IncrementSize);
5439 Hi = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(), SVOffset,
5440 isVolatile, Alignment);
5442 // Build a factor node to remember that this load is independent of the
5444 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
5447 // Remember that we legalized the chain.
5448 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
5449 if (!TLI.isLittleEndian())
5452 MVT::ValueType EVT = LD->getLoadedVT();
5454 if ((VT == MVT::f64 && EVT == MVT::f32) ||
5455 (VT == MVT::ppcf128 && (EVT==MVT::f64 || EVT==MVT::f32))) {
5456 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
5457 SDOperand Load = DAG.getLoad(EVT, Ch, Ptr, LD->getSrcValue(),
5458 SVOffset, isVolatile, Alignment);
5459 // Remember that we legalized the chain.
5460 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Load.getValue(1)));
5461 ExpandOp(DAG.getNode(ISD::FP_EXTEND, VT, Load), Lo, Hi);
5466 Lo = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(),
5467 SVOffset, isVolatile, Alignment);
5469 Lo = DAG.getExtLoad(ExtType, NVT, Ch, Ptr, LD->getSrcValue(),
5470 SVOffset, EVT, isVolatile,
5473 // Remember that we legalized the chain.
5474 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
5476 if (ExtType == ISD::SEXTLOAD) {
5477 // The high part is obtained by SRA'ing all but one of the bits of the
5479 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
5480 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
5481 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
5482 } else if (ExtType == ISD::ZEXTLOAD) {
5483 // The high part is just a zero.
5484 Hi = DAG.getConstant(0, NVT);
5485 } else /* if (ExtType == ISD::EXTLOAD) */ {
5486 // The high part is undefined.
5487 Hi = DAG.getNode(ISD::UNDEF, NVT);
5494 case ISD::XOR: { // Simple logical operators -> two trivial pieces.
5495 SDOperand LL, LH, RL, RH;
5496 ExpandOp(Node->getOperand(0), LL, LH);
5497 ExpandOp(Node->getOperand(1), RL, RH);
5498 Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL);
5499 Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH);
5503 SDOperand LL, LH, RL, RH;
5504 ExpandOp(Node->getOperand(1), LL, LH);
5505 ExpandOp(Node->getOperand(2), RL, RH);
5506 if (getTypeAction(NVT) == Expand)
5507 NVT = TLI.getTypeToExpandTo(NVT);
5508 Lo = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LL, RL);
5510 Hi = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LH, RH);
5513 case ISD::SELECT_CC: {
5514 SDOperand TL, TH, FL, FH;
5515 ExpandOp(Node->getOperand(2), TL, TH);
5516 ExpandOp(Node->getOperand(3), FL, FH);
5517 if (getTypeAction(NVT) == Expand)
5518 NVT = TLI.getTypeToExpandTo(NVT);
5519 Lo = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
5520 Node->getOperand(1), TL, FL, Node->getOperand(4));
5522 Hi = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
5523 Node->getOperand(1), TH, FH, Node->getOperand(4));
5526 case ISD::ANY_EXTEND:
5527 // The low part is any extension of the input (which degenerates to a copy).
5528 Lo = DAG.getNode(ISD::ANY_EXTEND, NVT, Node->getOperand(0));
5529 // The high part is undefined.
5530 Hi = DAG.getNode(ISD::UNDEF, NVT);
5532 case ISD::SIGN_EXTEND: {
5533 // The low part is just a sign extension of the input (which degenerates to
5535 Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, Node->getOperand(0));
5537 // The high part is obtained by SRA'ing all but one of the bits of the lo
5539 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
5540 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
5541 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
5544 case ISD::ZERO_EXTEND:
5545 // The low part is just a zero extension of the input (which degenerates to
5547 Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
5549 // The high part is just a zero.
5550 Hi = DAG.getConstant(0, NVT);
5553 case ISD::TRUNCATE: {
5554 // The input value must be larger than this value. Expand *it*.
5556 ExpandOp(Node->getOperand(0), NewLo, Hi);
5558 // The low part is now either the right size, or it is closer. If not the
5559 // right size, make an illegal truncate so we recursively expand it.
5560 if (NewLo.getValueType() != Node->getValueType(0))
5561 NewLo = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), NewLo);
5562 ExpandOp(NewLo, Lo, Hi);
5566 case ISD::BIT_CONVERT: {
5568 if (TLI.getOperationAction(ISD::BIT_CONVERT, VT) == TargetLowering::Custom){
5569 // If the target wants to, allow it to lower this itself.
5570 switch (getTypeAction(Node->getOperand(0).getValueType())) {
5571 case Expand: assert(0 && "cannot expand FP!");
5572 case Legal: Tmp = LegalizeOp(Node->getOperand(0)); break;
5573 case Promote: Tmp = PromoteOp (Node->getOperand(0)); break;
5575 Tmp = TLI.LowerOperation(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp), DAG);
5578 // f32 / f64 must be expanded to i32 / i64.
5579 if (VT == MVT::f32 || VT == MVT::f64) {
5580 Lo = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
5581 if (getTypeAction(NVT) == Expand)
5582 ExpandOp(Lo, Lo, Hi);
5586 // If source operand will be expanded to the same type as VT, i.e.
5587 // i64 <- f64, i32 <- f32, expand the source operand instead.
5588 MVT::ValueType VT0 = Node->getOperand(0).getValueType();
5589 if (getTypeAction(VT0) == Expand && TLI.getTypeToTransformTo(VT0) == VT) {
5590 ExpandOp(Node->getOperand(0), Lo, Hi);
5594 // Turn this into a load/store pair by default.
5596 Tmp = ExpandBIT_CONVERT(VT, Node->getOperand(0));
5598 ExpandOp(Tmp, Lo, Hi);
5602 case ISD::READCYCLECOUNTER:
5603 assert(TLI.getOperationAction(ISD::READCYCLECOUNTER, VT) ==
5604 TargetLowering::Custom &&
5605 "Must custom expand ReadCycleCounter");
5606 Lo = TLI.LowerOperation(Op, DAG);
5607 assert(Lo.Val && "Node must be custom expanded!");
5608 Hi = Lo.getValue(1);
5609 AddLegalizedOperand(SDOperand(Node, 1), // Remember we legalized the chain.
5610 LegalizeOp(Lo.getValue(2)));
5613 // These operators cannot be expanded directly, emit them as calls to
5614 // library functions.
5615 case ISD::FP_TO_SINT: {
5616 if (TLI.getOperationAction(ISD::FP_TO_SINT, VT) == TargetLowering::Custom) {
5618 switch (getTypeAction(Node->getOperand(0).getValueType())) {
5619 case Expand: assert(0 && "cannot expand FP!");
5620 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
5621 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
5624 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_SINT, VT, Op), DAG);
5626 // Now that the custom expander is done, expand the result, which is still
5629 ExpandOp(Op, Lo, Hi);
5634 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
5635 if (Node->getOperand(0).getValueType() == MVT::f32)
5636 LC = RTLIB::FPTOSINT_F32_I64;
5637 else if (Node->getOperand(0).getValueType() == MVT::f64)
5638 LC = RTLIB::FPTOSINT_F64_I64;
5639 else if (Node->getOperand(0).getValueType() == MVT::f80)
5640 LC = RTLIB::FPTOSINT_F80_I64;
5641 else if (Node->getOperand(0).getValueType() == MVT::ppcf128)
5642 LC = RTLIB::FPTOSINT_PPCF128_I64;
5643 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node,
5644 false/*sign irrelevant*/, Hi);
5648 case ISD::FP_TO_UINT: {
5649 if (TLI.getOperationAction(ISD::FP_TO_UINT, VT) == TargetLowering::Custom) {
5651 switch (getTypeAction(Node->getOperand(0).getValueType())) {
5652 case Expand: assert(0 && "cannot expand FP!");
5653 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
5654 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
5657 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_UINT, VT, Op), DAG);
5659 // Now that the custom expander is done, expand the result.
5661 ExpandOp(Op, Lo, Hi);
5666 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
5667 if (Node->getOperand(0).getValueType() == MVT::f32)
5668 LC = RTLIB::FPTOUINT_F32_I64;
5669 else if (Node->getOperand(0).getValueType() == MVT::f64)
5670 LC = RTLIB::FPTOUINT_F64_I64;
5671 else if (Node->getOperand(0).getValueType() == MVT::f80)
5672 LC = RTLIB::FPTOUINT_F80_I64;
5673 else if (Node->getOperand(0).getValueType() == MVT::ppcf128)
5674 LC = RTLIB::FPTOUINT_PPCF128_I64;
5675 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node,
5676 false/*sign irrelevant*/, Hi);
5681 // If the target wants custom lowering, do so.
5682 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
5683 if (TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Custom) {
5684 SDOperand Op = DAG.getNode(ISD::SHL, VT, Node->getOperand(0), ShiftAmt);
5685 Op = TLI.LowerOperation(Op, DAG);
5687 // Now that the custom expander is done, expand the result, which is
5689 ExpandOp(Op, Lo, Hi);
5694 // If ADDC/ADDE are supported and if the shift amount is a constant 1, emit
5695 // this X << 1 as X+X.
5696 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(ShiftAmt)) {
5697 if (ShAmt->getValue() == 1 && TLI.isOperationLegal(ISD::ADDC, NVT) &&
5698 TLI.isOperationLegal(ISD::ADDE, NVT)) {
5699 SDOperand LoOps[2], HiOps[3];
5700 ExpandOp(Node->getOperand(0), LoOps[0], HiOps[0]);
5701 SDVTList VTList = DAG.getVTList(LoOps[0].getValueType(), MVT::Flag);
5702 LoOps[1] = LoOps[0];
5703 Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2);
5705 HiOps[1] = HiOps[0];
5706 HiOps[2] = Lo.getValue(1);
5707 Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3);
5712 // If we can emit an efficient shift operation, do so now.
5713 if (ExpandShift(ISD::SHL, Node->getOperand(0), ShiftAmt, Lo, Hi))
5716 // If this target supports SHL_PARTS, use it.
5717 TargetLowering::LegalizeAction Action =
5718 TLI.getOperationAction(ISD::SHL_PARTS, NVT);
5719 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
5720 Action == TargetLowering::Custom) {
5721 ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
5725 // Otherwise, emit a libcall.
5726 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SHL_I64), Node,
5727 false/*left shift=unsigned*/, Hi);
5732 // If the target wants custom lowering, do so.
5733 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
5734 if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Custom) {
5735 SDOperand Op = DAG.getNode(ISD::SRA, VT, Node->getOperand(0), ShiftAmt);
5736 Op = TLI.LowerOperation(Op, DAG);
5738 // Now that the custom expander is done, expand the result, which is
5740 ExpandOp(Op, Lo, Hi);
5745 // If we can emit an efficient shift operation, do so now.
5746 if (ExpandShift(ISD::SRA, Node->getOperand(0), ShiftAmt, Lo, Hi))
5749 // If this target supports SRA_PARTS, use it.
5750 TargetLowering::LegalizeAction Action =
5751 TLI.getOperationAction(ISD::SRA_PARTS, NVT);
5752 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
5753 Action == TargetLowering::Custom) {
5754 ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
5758 // Otherwise, emit a libcall.
5759 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SRA_I64), Node,
5760 true/*ashr is signed*/, Hi);
5765 // If the target wants custom lowering, do so.
5766 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
5767 if (TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Custom) {
5768 SDOperand Op = DAG.getNode(ISD::SRL, VT, Node->getOperand(0), ShiftAmt);
5769 Op = TLI.LowerOperation(Op, DAG);
5771 // Now that the custom expander is done, expand the result, which is
5773 ExpandOp(Op, Lo, Hi);
5778 // If we can emit an efficient shift operation, do so now.
5779 if (ExpandShift(ISD::SRL, Node->getOperand(0), ShiftAmt, Lo, Hi))
5782 // If this target supports SRL_PARTS, use it.
5783 TargetLowering::LegalizeAction Action =
5784 TLI.getOperationAction(ISD::SRL_PARTS, NVT);
5785 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
5786 Action == TargetLowering::Custom) {
5787 ExpandShiftParts(ISD::SRL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
5791 // Otherwise, emit a libcall.
5792 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SRL_I64), Node,
5793 false/*lshr is unsigned*/, Hi);
5799 // If the target wants to custom expand this, let them.
5800 if (TLI.getOperationAction(Node->getOpcode(), VT) ==
5801 TargetLowering::Custom) {
5802 Op = TLI.LowerOperation(Op, DAG);
5804 ExpandOp(Op, Lo, Hi);
5809 // Expand the subcomponents.
5810 SDOperand LHSL, LHSH, RHSL, RHSH;
5811 ExpandOp(Node->getOperand(0), LHSL, LHSH);
5812 ExpandOp(Node->getOperand(1), RHSL, RHSH);
5813 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
5814 SDOperand LoOps[2], HiOps[3];
5819 if (Node->getOpcode() == ISD::ADD) {
5820 Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2);
5821 HiOps[2] = Lo.getValue(1);
5822 Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3);
5824 Lo = DAG.getNode(ISD::SUBC, VTList, LoOps, 2);
5825 HiOps[2] = Lo.getValue(1);
5826 Hi = DAG.getNode(ISD::SUBE, VTList, HiOps, 3);
5833 // Expand the subcomponents.
5834 SDOperand LHSL, LHSH, RHSL, RHSH;
5835 ExpandOp(Node->getOperand(0), LHSL, LHSH);
5836 ExpandOp(Node->getOperand(1), RHSL, RHSH);
5837 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
5838 SDOperand LoOps[2] = { LHSL, RHSL };
5839 SDOperand HiOps[3] = { LHSH, RHSH };
5841 if (Node->getOpcode() == ISD::ADDC) {
5842 Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2);
5843 HiOps[2] = Lo.getValue(1);
5844 Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3);
5846 Lo = DAG.getNode(ISD::SUBC, VTList, LoOps, 2);
5847 HiOps[2] = Lo.getValue(1);
5848 Hi = DAG.getNode(ISD::SUBE, VTList, HiOps, 3);
5850 // Remember that we legalized the flag.
5851 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Hi.getValue(1)));
5856 // Expand the subcomponents.
5857 SDOperand LHSL, LHSH, RHSL, RHSH;
5858 ExpandOp(Node->getOperand(0), LHSL, LHSH);
5859 ExpandOp(Node->getOperand(1), RHSL, RHSH);
5860 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
5861 SDOperand LoOps[3] = { LHSL, RHSL, Node->getOperand(2) };
5862 SDOperand HiOps[3] = { LHSH, RHSH };
5864 Lo = DAG.getNode(Node->getOpcode(), VTList, LoOps, 3);
5865 HiOps[2] = Lo.getValue(1);
5866 Hi = DAG.getNode(Node->getOpcode(), VTList, HiOps, 3);
5868 // Remember that we legalized the flag.
5869 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Hi.getValue(1)));
5873 // If the target wants to custom expand this, let them.
5874 if (TLI.getOperationAction(ISD::MUL, VT) == TargetLowering::Custom) {
5875 SDOperand New = TLI.LowerOperation(Op, DAG);
5877 ExpandOp(New, Lo, Hi);
5882 bool HasMULHS = TLI.isOperationLegal(ISD::MULHS, NVT);
5883 bool HasMULHU = TLI.isOperationLegal(ISD::MULHU, NVT);
5884 bool HasSMUL_LOHI = TLI.isOperationLegal(ISD::SMUL_LOHI, NVT);
5885 bool HasUMUL_LOHI = TLI.isOperationLegal(ISD::UMUL_LOHI, NVT);
5886 if (HasMULHU || HasMULHS || HasUMUL_LOHI || HasSMUL_LOHI) {
5887 SDOperand LL, LH, RL, RH;
5888 ExpandOp(Node->getOperand(0), LL, LH);
5889 ExpandOp(Node->getOperand(1), RL, RH);
5890 unsigned BitSize = MVT::getSizeInBits(RH.getValueType());
5891 unsigned LHSSB = DAG.ComputeNumSignBits(Op.getOperand(0));
5892 unsigned RHSSB = DAG.ComputeNumSignBits(Op.getOperand(1));
5893 // FIXME: generalize this to handle other bit sizes
5894 if (LHSSB == 32 && RHSSB == 32 &&
5895 DAG.MaskedValueIsZero(Op.getOperand(0), 0xFFFFFFFF00000000ULL) &&
5896 DAG.MaskedValueIsZero(Op.getOperand(1), 0xFFFFFFFF00000000ULL)) {
5897 // The inputs are both zero-extended.
5899 // We can emit a umul_lohi.
5900 Lo = DAG.getNode(ISD::UMUL_LOHI, DAG.getVTList(NVT, NVT), LL, RL);
5901 Hi = SDOperand(Lo.Val, 1);
5905 // We can emit a mulhu+mul.
5906 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
5907 Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL);
5911 if (LHSSB > BitSize && RHSSB > BitSize) {
5912 // The input values are both sign-extended.
5914 // We can emit a smul_lohi.
5915 Lo = DAG.getNode(ISD::SMUL_LOHI, DAG.getVTList(NVT, NVT), LL, RL);
5916 Hi = SDOperand(Lo.Val, 1);
5920 // We can emit a mulhs+mul.
5921 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
5922 Hi = DAG.getNode(ISD::MULHS, NVT, LL, RL);
5927 // Lo,Hi = umul LHS, RHS.
5928 SDOperand UMulLOHI = DAG.getNode(ISD::UMUL_LOHI,
5929 DAG.getVTList(NVT, NVT), LL, RL);
5931 Hi = UMulLOHI.getValue(1);
5932 RH = DAG.getNode(ISD::MUL, NVT, LL, RH);
5933 LH = DAG.getNode(ISD::MUL, NVT, LH, RL);
5934 Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH);
5935 Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH);
5939 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
5940 Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL);
5941 RH = DAG.getNode(ISD::MUL, NVT, LL, RH);
5942 LH = DAG.getNode(ISD::MUL, NVT, LH, RL);
5943 Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH);
5944 Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH);
5949 // If nothing else, we can make a libcall.
5950 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::MUL_I64), Node,
5951 false/*sign irrelevant*/, Hi);
5955 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SDIV_I64), Node, true, Hi);
5958 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::UDIV_I64), Node, true, Hi);
5961 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SREM_I64), Node, true, Hi);
5964 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::UREM_I64), Node, true, Hi);
5968 Lo = ExpandLibCall(TLI.getLibcallName(VT == MVT::f32 ? RTLIB::ADD_F32 :
5969 VT == MVT::f64 ? RTLIB::ADD_F64 :
5970 VT == MVT::ppcf128 ?
5971 RTLIB::ADD_PPCF128 :
5972 RTLIB::UNKNOWN_LIBCALL),
5976 Lo = ExpandLibCall(TLI.getLibcallName(VT == MVT::f32 ? RTLIB::SUB_F32 :
5977 VT == MVT::f64 ? RTLIB::SUB_F64 :
5978 VT == MVT::ppcf128 ?
5979 RTLIB::SUB_PPCF128 :
5980 RTLIB::UNKNOWN_LIBCALL),
5984 Lo = ExpandLibCall(TLI.getLibcallName(VT == MVT::f32 ? RTLIB::MUL_F32 :
5985 VT == MVT::f64 ? RTLIB::MUL_F64 :
5986 VT == MVT::ppcf128 ?
5987 RTLIB::MUL_PPCF128 :
5988 RTLIB::UNKNOWN_LIBCALL),
5992 Lo = ExpandLibCall(TLI.getLibcallName(VT == MVT::f32 ? RTLIB::DIV_F32 :
5993 VT == MVT::f64 ? RTLIB::DIV_F64 :
5994 VT == MVT::ppcf128 ?
5995 RTLIB::DIV_PPCF128 :
5996 RTLIB::UNKNOWN_LIBCALL),
5999 case ISD::FP_EXTEND:
6000 if (VT == MVT::ppcf128) {
6001 assert(Node->getOperand(0).getValueType()==MVT::f32 ||
6002 Node->getOperand(0).getValueType()==MVT::f64);
6003 const uint64_t zero = 0;
6004 if (Node->getOperand(0).getValueType()==MVT::f32)
6005 Hi = DAG.getNode(ISD::FP_EXTEND, MVT::f64, Node->getOperand(0));
6007 Hi = Node->getOperand(0);
6008 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &zero)), MVT::f64);
6011 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::FPEXT_F32_F64), Node, true,Hi);
6014 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::FPROUND_F64_F32),Node,true,Hi);
6017 Lo = ExpandLibCall(TLI.getLibcallName((VT == MVT::f32) ? RTLIB::POWI_F32 :
6018 (VT == MVT::f64) ? RTLIB::POWI_F64 :
6019 (VT == MVT::f80) ? RTLIB::POWI_F80 :
6020 (VT == MVT::ppcf128) ?
6021 RTLIB::POWI_PPCF128 :
6022 RTLIB::UNKNOWN_LIBCALL),
6028 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
6029 switch(Node->getOpcode()) {
6031 LC = (VT == MVT::f32) ? RTLIB::SQRT_F32 :
6032 (VT == MVT::f64) ? RTLIB::SQRT_F64 :
6033 (VT == MVT::f80) ? RTLIB::SQRT_F80 :
6034 (VT == MVT::ppcf128) ? RTLIB::SQRT_PPCF128 :
6035 RTLIB::UNKNOWN_LIBCALL;
6038 LC = (VT == MVT::f32) ? RTLIB::SIN_F32 : RTLIB::SIN_F64;
6041 LC = (VT == MVT::f32) ? RTLIB::COS_F32 : RTLIB::COS_F64;
6043 default: assert(0 && "Unreachable!");
6045 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node, false, Hi);
6049 if (VT == MVT::ppcf128) {
6051 ExpandOp(Node->getOperand(0), Lo, Tmp);
6052 Hi = DAG.getNode(ISD::FABS, NVT, Tmp);
6053 // lo = hi==fabs(hi) ? lo : -lo;
6054 Lo = DAG.getNode(ISD::SELECT_CC, NVT, Hi, Tmp,
6055 Lo, DAG.getNode(ISD::FNEG, NVT, Lo),
6056 DAG.getCondCode(ISD::SETEQ));
6059 SDOperand Mask = (VT == MVT::f64)
6060 ? DAG.getConstantFP(BitsToDouble(~(1ULL << 63)), VT)
6061 : DAG.getConstantFP(BitsToFloat(~(1U << 31)), VT);
6062 Mask = DAG.getNode(ISD::BIT_CONVERT, NVT, Mask);
6063 Lo = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
6064 Lo = DAG.getNode(ISD::AND, NVT, Lo, Mask);
6065 if (getTypeAction(NVT) == Expand)
6066 ExpandOp(Lo, Lo, Hi);
6070 if (VT == MVT::ppcf128) {
6071 ExpandOp(Node->getOperand(0), Lo, Hi);
6072 Lo = DAG.getNode(ISD::FNEG, MVT::f64, Lo);
6073 Hi = DAG.getNode(ISD::FNEG, MVT::f64, Hi);
6076 SDOperand Mask = (VT == MVT::f64)
6077 ? DAG.getConstantFP(BitsToDouble(1ULL << 63), VT)
6078 : DAG.getConstantFP(BitsToFloat(1U << 31), VT);
6079 Mask = DAG.getNode(ISD::BIT_CONVERT, NVT, Mask);
6080 Lo = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
6081 Lo = DAG.getNode(ISD::XOR, NVT, Lo, Mask);
6082 if (getTypeAction(NVT) == Expand)
6083 ExpandOp(Lo, Lo, Hi);
6086 case ISD::FCOPYSIGN: {
6087 Lo = ExpandFCOPYSIGNToBitwiseOps(Node, NVT, DAG, TLI);
6088 if (getTypeAction(NVT) == Expand)
6089 ExpandOp(Lo, Lo, Hi);
6092 case ISD::SINT_TO_FP:
6093 case ISD::UINT_TO_FP: {
6094 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
6095 MVT::ValueType SrcVT = Node->getOperand(0).getValueType();
6096 if (VT == MVT::ppcf128 && SrcVT != MVT::i64) {
6097 static uint64_t zero = 0;
6099 Hi = LegalizeOp(DAG.getNode(ISD::SINT_TO_FP, MVT::f64,
6100 Node->getOperand(0)));
6101 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &zero)), MVT::f64);
6103 static uint64_t TwoE32[] = { 0x41f0000000000000LL, 0 };
6104 Hi = LegalizeOp(DAG.getNode(ISD::SINT_TO_FP, MVT::f64,
6105 Node->getOperand(0)));
6106 Lo = DAG.getConstantFP(APFloat(APInt(64, 1, &zero)), MVT::f64);
6107 Hi = DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi);
6108 // X>=0 ? {(f64)x, 0} : {(f64)x, 0} + 2^32
6109 ExpandOp(DAG.getNode(ISD::SELECT_CC, MVT::ppcf128, Node->getOperand(0),
6110 DAG.getConstant(0, MVT::i32),
6111 DAG.getNode(ISD::FADD, MVT::ppcf128, Hi,
6113 APFloat(APInt(128, 2, TwoE32)),
6116 DAG.getCondCode(ISD::SETLT)),
6121 if (VT == MVT::ppcf128 && SrcVT == MVT::i64 && !isSigned) {
6122 // si64->ppcf128 done by libcall, below
6123 static uint64_t TwoE64[] = { 0x43f0000000000000LL, 0 };
6124 ExpandOp(DAG.getNode(ISD::SINT_TO_FP, MVT::ppcf128, Node->getOperand(0)),
6126 Hi = DAG.getNode(ISD::BUILD_PAIR, VT, Lo, Hi);
6127 // x>=0 ? (ppcf128)(i64)x : (ppcf128)(i64)x + 2^64
6128 ExpandOp(DAG.getNode(ISD::SELECT_CC, MVT::ppcf128, Node->getOperand(0),
6129 DAG.getConstant(0, MVT::i64),
6130 DAG.getNode(ISD::FADD, MVT::ppcf128, Hi,
6132 APFloat(APInt(128, 2, TwoE64)),
6135 DAG.getCondCode(ISD::SETLT)),
6139 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
6140 if (Node->getOperand(0).getValueType() == MVT::i64) {
6142 LC = isSigned ? RTLIB::SINTTOFP_I64_F32 : RTLIB::UINTTOFP_I64_F32;
6143 else if (VT == MVT::f64)
6144 LC = isSigned ? RTLIB::SINTTOFP_I64_F64 : RTLIB::UINTTOFP_I64_F64;
6145 else if (VT == MVT::f80) {
6147 LC = RTLIB::SINTTOFP_I64_F80;
6149 else if (VT == MVT::ppcf128) {
6151 LC = RTLIB::SINTTOFP_I64_PPCF128;
6155 LC = isSigned ? RTLIB::SINTTOFP_I32_F32 : RTLIB::UINTTOFP_I32_F32;
6157 LC = isSigned ? RTLIB::SINTTOFP_I32_F64 : RTLIB::UINTTOFP_I32_F64;
6160 // Promote the operand if needed.
6161 if (getTypeAction(SrcVT) == Promote) {
6162 SDOperand Tmp = PromoteOp(Node->getOperand(0));
6164 ? DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp.getValueType(), Tmp,
6165 DAG.getValueType(SrcVT))
6166 : DAG.getZeroExtendInReg(Tmp, SrcVT);
6167 Node = DAG.UpdateNodeOperands(Op, Tmp).Val;
6170 const char *LibCall = TLI.getLibcallName(LC);
6172 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node, isSigned, Hi);
6174 Lo = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, VT,
6175 Node->getOperand(0));
6176 if (getTypeAction(Lo.getValueType()) == Expand)
6177 ExpandOp(Lo, Lo, Hi);
6183 // Make sure the resultant values have been legalized themselves, unless this
6184 // is a type that requires multi-step expansion.
6185 if (getTypeAction(NVT) != Expand && NVT != MVT::isVoid) {
6186 Lo = LegalizeOp(Lo);
6188 // Don't legalize the high part if it is expanded to a single node.
6189 Hi = LegalizeOp(Hi);
6192 // Remember in a map if the values will be reused later.
6193 bool isNew = ExpandedNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi)));
6194 assert(isNew && "Value already expanded?!?");
6197 /// SplitVectorOp - Given an operand of vector type, break it down into
6198 /// two smaller values, still of vector type.
6199 void SelectionDAGLegalize::SplitVectorOp(SDOperand Op, SDOperand &Lo,
6201 assert(MVT::isVector(Op.getValueType()) && "Cannot split non-vector type!");
6202 SDNode *Node = Op.Val;
6203 unsigned NumElements = MVT::getVectorNumElements(Op.getValueType());
6204 assert(NumElements > 1 && "Cannot split a single element vector!");
6205 unsigned NewNumElts = NumElements/2;
6206 MVT::ValueType NewEltVT = MVT::getVectorElementType(Op.getValueType());
6207 MVT::ValueType NewVT = MVT::getVectorType(NewEltVT, NewNumElts);
6209 // See if we already split it.
6210 std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
6211 = SplitNodes.find(Op);
6212 if (I != SplitNodes.end()) {
6213 Lo = I->second.first;
6214 Hi = I->second.second;
6218 switch (Node->getOpcode()) {
6223 assert(0 && "Unhandled operation in SplitVectorOp!");
6224 case ISD::BUILD_PAIR:
6225 Lo = Node->getOperand(0);
6226 Hi = Node->getOperand(1);
6228 case ISD::INSERT_VECTOR_ELT: {
6229 SplitVectorOp(Node->getOperand(0), Lo, Hi);
6230 unsigned Index = cast<ConstantSDNode>(Node->getOperand(2))->getValue();
6231 SDOperand ScalarOp = Node->getOperand(1);
6232 if (Index < NewNumElts)
6233 Lo = DAG.getNode(ISD::INSERT_VECTOR_ELT, NewVT, Lo, ScalarOp,
6234 DAG.getConstant(Index, TLI.getPointerTy()));
6236 Hi = DAG.getNode(ISD::INSERT_VECTOR_ELT, NewVT, Hi, ScalarOp,
6237 DAG.getConstant(Index - NewNumElts, TLI.getPointerTy()));
6240 case ISD::BUILD_VECTOR: {
6241 SmallVector<SDOperand, 8> LoOps(Node->op_begin(),
6242 Node->op_begin()+NewNumElts);
6243 Lo = DAG.getNode(ISD::BUILD_VECTOR, NewVT, &LoOps[0], LoOps.size());
6245 SmallVector<SDOperand, 8> HiOps(Node->op_begin()+NewNumElts,
6247 Hi = DAG.getNode(ISD::BUILD_VECTOR, NewVT, &HiOps[0], HiOps.size());
6250 case ISD::CONCAT_VECTORS: {
6251 unsigned NewNumSubvectors = Node->getNumOperands() / 2;
6252 if (NewNumSubvectors == 1) {
6253 Lo = Node->getOperand(0);
6254 Hi = Node->getOperand(1);
6256 SmallVector<SDOperand, 8> LoOps(Node->op_begin(),
6257 Node->op_begin()+NewNumSubvectors);
6258 Lo = DAG.getNode(ISD::CONCAT_VECTORS, NewVT, &LoOps[0], LoOps.size());
6260 SmallVector<SDOperand, 8> HiOps(Node->op_begin()+NewNumSubvectors,
6262 Hi = DAG.getNode(ISD::CONCAT_VECTORS, NewVT, &HiOps[0], HiOps.size());
6267 SDOperand Cond = Node->getOperand(0);
6269 SDOperand LL, LH, RL, RH;
6270 SplitVectorOp(Node->getOperand(1), LL, LH);
6271 SplitVectorOp(Node->getOperand(2), RL, RH);
6273 if (MVT::isVector(Cond.getValueType())) {
6274 // Handle a vector merge.
6276 SplitVectorOp(Cond, CL, CH);
6277 Lo = DAG.getNode(Node->getOpcode(), NewVT, CL, LL, RL);
6278 Hi = DAG.getNode(Node->getOpcode(), NewVT, CH, LH, RH);
6280 // Handle a simple select with vector operands.
6281 Lo = DAG.getNode(Node->getOpcode(), NewVT, Cond, LL, RL);
6282 Hi = DAG.getNode(Node->getOpcode(), NewVT, Cond, LH, RH);
6299 SDOperand LL, LH, RL, RH;
6300 SplitVectorOp(Node->getOperand(0), LL, LH);
6301 SplitVectorOp(Node->getOperand(1), RL, RH);
6303 Lo = DAG.getNode(Node->getOpcode(), NewVT, LL, RL);
6304 Hi = DAG.getNode(Node->getOpcode(), NewVT, LH, RH);
6309 SplitVectorOp(Node->getOperand(0), L, H);
6311 Lo = DAG.getNode(Node->getOpcode(), NewVT, L, Node->getOperand(1));
6312 Hi = DAG.getNode(Node->getOpcode(), NewVT, H, Node->getOperand(1));
6324 SplitVectorOp(Node->getOperand(0), L, H);
6326 Lo = DAG.getNode(Node->getOpcode(), NewVT, L);
6327 Hi = DAG.getNode(Node->getOpcode(), NewVT, H);
6331 LoadSDNode *LD = cast<LoadSDNode>(Node);
6332 SDOperand Ch = LD->getChain();
6333 SDOperand Ptr = LD->getBasePtr();
6334 const Value *SV = LD->getSrcValue();
6335 int SVOffset = LD->getSrcValueOffset();
6336 unsigned Alignment = LD->getAlignment();
6337 bool isVolatile = LD->isVolatile();
6339 Lo = DAG.getLoad(NewVT, Ch, Ptr, SV, SVOffset, isVolatile, Alignment);
6340 unsigned IncrementSize = NewNumElts * MVT::getSizeInBits(NewEltVT)/8;
6341 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
6342 getIntPtrConstant(IncrementSize));
6343 SVOffset += IncrementSize;
6344 Alignment = MinAlign(Alignment, IncrementSize);
6345 Hi = DAG.getLoad(NewVT, Ch, Ptr, SV, SVOffset, isVolatile, Alignment);
6347 // Build a factor node to remember that this load is independent of the
6349 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
6352 // Remember that we legalized the chain.
6353 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
6356 case ISD::BIT_CONVERT: {
6357 // We know the result is a vector. The input may be either a vector or a
6359 SDOperand InOp = Node->getOperand(0);
6360 if (!MVT::isVector(InOp.getValueType()) ||
6361 MVT::getVectorNumElements(InOp.getValueType()) == 1) {
6362 // The input is a scalar or single-element vector.
6363 // Lower to a store/load so that it can be split.
6364 // FIXME: this could be improved probably.
6365 SDOperand Ptr = DAG.CreateStackTemporary(InOp.getValueType());
6367 SDOperand St = DAG.getStore(DAG.getEntryNode(),
6368 InOp, Ptr, NULL, 0);
6369 InOp = DAG.getLoad(Op.getValueType(), St, Ptr, NULL, 0);
6371 // Split the vector and convert each of the pieces now.
6372 SplitVectorOp(InOp, Lo, Hi);
6373 Lo = DAG.getNode(ISD::BIT_CONVERT, NewVT, Lo);
6374 Hi = DAG.getNode(ISD::BIT_CONVERT, NewVT, Hi);
6379 // Remember in a map if the values will be reused later.
6381 SplitNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
6382 assert(isNew && "Value already split?!?");
6386 /// ScalarizeVectorOp - Given an operand of single-element vector type
6387 /// (e.g. v1f32), convert it into the equivalent operation that returns a
6388 /// scalar (e.g. f32) value.
6389 SDOperand SelectionDAGLegalize::ScalarizeVectorOp(SDOperand Op) {
6390 assert(MVT::isVector(Op.getValueType()) &&
6391 "Bad ScalarizeVectorOp invocation!");
6392 SDNode *Node = Op.Val;
6393 MVT::ValueType NewVT = MVT::getVectorElementType(Op.getValueType());
6394 assert(MVT::getVectorNumElements(Op.getValueType()) == 1);
6396 // See if we already scalarized it.
6397 std::map<SDOperand, SDOperand>::iterator I = ScalarizedNodes.find(Op);
6398 if (I != ScalarizedNodes.end()) return I->second;
6401 switch (Node->getOpcode()) {
6404 Node->dump(&DAG); cerr << "\n";
6406 assert(0 && "Unknown vector operation in ScalarizeVectorOp!");
6423 Result = DAG.getNode(Node->getOpcode(),
6425 ScalarizeVectorOp(Node->getOperand(0)),
6426 ScalarizeVectorOp(Node->getOperand(1)));
6433 Result = DAG.getNode(Node->getOpcode(),
6435 ScalarizeVectorOp(Node->getOperand(0)));
6438 Result = DAG.getNode(Node->getOpcode(),
6440 ScalarizeVectorOp(Node->getOperand(0)),
6441 Node->getOperand(1));
6444 LoadSDNode *LD = cast<LoadSDNode>(Node);
6445 SDOperand Ch = LegalizeOp(LD->getChain()); // Legalize the chain.
6446 SDOperand Ptr = LegalizeOp(LD->getBasePtr()); // Legalize the pointer.
6448 const Value *SV = LD->getSrcValue();
6449 int SVOffset = LD->getSrcValueOffset();
6450 Result = DAG.getLoad(NewVT, Ch, Ptr, SV, SVOffset,
6451 LD->isVolatile(), LD->getAlignment());
6453 // Remember that we legalized the chain.
6454 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
6457 case ISD::BUILD_VECTOR:
6458 Result = Node->getOperand(0);
6460 case ISD::INSERT_VECTOR_ELT:
6461 // Returning the inserted scalar element.
6462 Result = Node->getOperand(1);
6464 case ISD::CONCAT_VECTORS:
6465 assert(Node->getOperand(0).getValueType() == NewVT &&
6466 "Concat of non-legal vectors not yet supported!");
6467 Result = Node->getOperand(0);
6469 case ISD::VECTOR_SHUFFLE: {
6470 // Figure out if the scalar is the LHS or RHS and return it.
6471 SDOperand EltNum = Node->getOperand(2).getOperand(0);
6472 if (cast<ConstantSDNode>(EltNum)->getValue())
6473 Result = ScalarizeVectorOp(Node->getOperand(1));
6475 Result = ScalarizeVectorOp(Node->getOperand(0));
6478 case ISD::EXTRACT_SUBVECTOR:
6479 Result = Node->getOperand(0);
6480 assert(Result.getValueType() == NewVT);
6482 case ISD::BIT_CONVERT:
6483 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT, Op.getOperand(0));
6486 Result = DAG.getNode(ISD::SELECT, NewVT, Op.getOperand(0),
6487 ScalarizeVectorOp(Op.getOperand(1)),
6488 ScalarizeVectorOp(Op.getOperand(2)));
6492 if (TLI.isTypeLegal(NewVT))
6493 Result = LegalizeOp(Result);
6494 bool isNew = ScalarizedNodes.insert(std::make_pair(Op, Result)).second;
6495 assert(isNew && "Value already scalarized?");
6500 // SelectionDAG::Legalize - This is the entry point for the file.
6502 void SelectionDAG::Legalize() {
6503 if (ViewLegalizeDAGs) viewGraph();
6505 /// run - This is the main entry point to this class.
6507 SelectionDAGLegalize(*this).LegalizeDAG();