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/TargetLowering.h"
19 #include "llvm/Target/TargetData.h"
20 #include "llvm/Target/TargetMachine.h"
21 #include "llvm/Target/TargetOptions.h"
22 #include "llvm/CallingConv.h"
23 #include "llvm/Constants.h"
24 #include "llvm/DerivedTypes.h"
25 #include "llvm/Support/MathExtras.h"
26 #include "llvm/Support/CommandLine.h"
27 #include "llvm/Support/Compiler.h"
28 #include "llvm/ADT/DenseMap.h"
29 #include "llvm/ADT/SmallVector.h"
30 #include "llvm/ADT/SmallPtrSet.h"
36 ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
37 cl::desc("Pop up a window to show dags before legalize"));
39 static const bool ViewLegalizeDAGs = 0;
44 struct DenseMapKeyInfo<SDOperand> {
45 static inline SDOperand getEmptyKey() { return SDOperand((SDNode*)-1, -1U); }
46 static inline SDOperand getTombstoneKey() { return SDOperand((SDNode*)-1, 0);}
47 static unsigned getHashValue(const SDOperand &Val) {
48 return DenseMapKeyInfo<void*>::getHashValue(Val.Val) + Val.ResNo;
50 static bool isPod() { return true; }
54 //===----------------------------------------------------------------------===//
55 /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
56 /// hacks on it until the target machine can handle it. This involves
57 /// eliminating value sizes the machine cannot handle (promoting small sizes to
58 /// large sizes or splitting up large values into small values) as well as
59 /// eliminating operations the machine cannot handle.
61 /// This code also does a small amount of optimization and recognition of idioms
62 /// as part of its processing. For example, if a target does not support a
63 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
64 /// will attempt merge setcc and brc instructions into brcc's.
67 class VISIBILITY_HIDDEN SelectionDAGLegalize {
71 // Libcall insertion helpers.
73 /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been
74 /// legalized. We use this to ensure that calls are properly serialized
75 /// against each other, including inserted libcalls.
76 SDOperand LastCALLSEQ_END;
78 /// IsLegalizingCall - This member is used *only* for purposes of providing
79 /// helpful assertions that a libcall isn't created while another call is
80 /// being legalized (which could lead to non-serialized call sequences).
81 bool IsLegalizingCall;
84 Legal, // The target natively supports this operation.
85 Promote, // This operation should be executed in a larger type.
86 Expand // Try to expand this to other ops, otherwise use a libcall.
89 /// ValueTypeActions - This is a bitvector that contains two bits for each
90 /// value type, where the two bits correspond to the LegalizeAction enum.
91 /// This can be queried with "getTypeAction(VT)".
92 TargetLowering::ValueTypeActionImpl ValueTypeActions;
94 /// LegalizedNodes - For nodes that are of legal width, and that have more
95 /// than one use, this map indicates what regularized operand to use. This
96 /// allows us to avoid legalizing the same thing more than once.
97 DenseMap<SDOperand, SDOperand> LegalizedNodes;
99 /// PromotedNodes - For nodes that are below legal width, and that have more
100 /// than one use, this map indicates what promoted value to use. This allows
101 /// us to avoid promoting the same thing more than once.
102 DenseMap<SDOperand, SDOperand> PromotedNodes;
104 /// ExpandedNodes - For nodes that need to be expanded this map indicates
105 /// which which operands are the expanded version of the input. This allows
106 /// us to avoid expanding the same node more than once.
107 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes;
109 /// SplitNodes - For vector nodes that need to be split, this map indicates
110 /// which which operands are the split version of the input. This allows us
111 /// to avoid splitting the same node more than once.
112 std::map<SDOperand, std::pair<SDOperand, SDOperand> > SplitNodes;
114 /// PackedNodes - For nodes that need to be packed from MVT::Vector types to
115 /// concrete vector types, this contains the mapping of ones we have already
116 /// processed to the result.
117 std::map<SDOperand, SDOperand> PackedNodes;
119 void AddLegalizedOperand(SDOperand From, SDOperand To) {
120 LegalizedNodes.insert(std::make_pair(From, To));
121 // If someone requests legalization of the new node, return itself.
123 LegalizedNodes.insert(std::make_pair(To, To));
125 void AddPromotedOperand(SDOperand From, SDOperand To) {
126 bool isNew = PromotedNodes.insert(std::make_pair(From, To));
127 assert(isNew && "Got into the map somehow?");
128 // If someone requests legalization of the new node, return itself.
129 LegalizedNodes.insert(std::make_pair(To, To));
134 SelectionDAGLegalize(SelectionDAG &DAG);
136 /// getTypeAction - Return how we should legalize values of this type, either
137 /// it is already legal or we need to expand it into multiple registers of
138 /// smaller integer type, or we need to promote it to a larger type.
139 LegalizeAction getTypeAction(MVT::ValueType VT) const {
140 return (LegalizeAction)ValueTypeActions.getTypeAction(VT);
143 /// isTypeLegal - Return true if this type is legal on this target.
145 bool isTypeLegal(MVT::ValueType VT) const {
146 return getTypeAction(VT) == Legal;
152 /// HandleOp - Legalize, Promote, Expand or Pack the specified operand as
153 /// appropriate for its type.
154 void HandleOp(SDOperand Op);
156 /// LegalizeOp - We know that the specified value has a legal type.
157 /// Recursively ensure that the operands have legal types, then return the
159 SDOperand LegalizeOp(SDOperand O);
161 /// PromoteOp - Given an operation that produces a value in an invalid type,
162 /// promote it to compute the value into a larger type. The produced value
163 /// will have the correct bits for the low portion of the register, but no
164 /// guarantee is made about the top bits: it may be zero, sign-extended, or
166 SDOperand PromoteOp(SDOperand O);
168 /// ExpandOp - Expand the specified SDOperand into its two component pieces
169 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this,
170 /// the LegalizeNodes map is filled in for any results that are not expanded,
171 /// the ExpandedNodes map is filled in for any results that are expanded, and
172 /// the Lo/Hi values are returned. This applies to integer types and Vector
174 void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
176 /// SplitVectorOp - Given an operand of MVT::Vector type, break it down into
177 /// two smaller values of MVT::Vector type.
178 void SplitVectorOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
180 /// PackVectorOp - Given an operand of MVT::Vector type, convert it into the
181 /// equivalent operation that returns a packed value (e.g. MVT::V4F32). When
182 /// this is called, we know that PackedVT is the right type for the result and
183 /// we know that this type is legal for the target.
184 SDOperand PackVectorOp(SDOperand O, MVT::ValueType PackedVT);
186 /// isShuffleLegal - Return true if a vector shuffle is legal with the
187 /// specified mask and type. Targets can specify exactly which masks they
188 /// support and the code generator is tasked with not creating illegal masks.
190 /// Note that this will also return true for shuffles that are promoted to a
193 /// If this is a legal shuffle, this method returns the (possibly promoted)
194 /// build_vector Mask. If it's not a legal shuffle, it returns null.
195 SDNode *isShuffleLegal(MVT::ValueType VT, SDOperand Mask) const;
197 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
198 SmallPtrSet<SDNode*, 32> &NodesLeadingTo);
200 void LegalizeSetCCOperands(SDOperand &LHS, SDOperand &RHS, SDOperand &CC);
202 SDOperand CreateStackTemporary(MVT::ValueType VT);
204 SDOperand ExpandLibCall(const char *Name, SDNode *Node, bool isSigned,
206 SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy,
209 SDOperand ExpandBIT_CONVERT(MVT::ValueType DestVT, SDOperand SrcOp);
210 SDOperand ExpandBUILD_VECTOR(SDNode *Node);
211 SDOperand ExpandSCALAR_TO_VECTOR(SDNode *Node);
212 SDOperand ExpandLegalINT_TO_FP(bool isSigned,
214 MVT::ValueType DestVT);
215 SDOperand PromoteLegalINT_TO_FP(SDOperand LegalOp, MVT::ValueType DestVT,
217 SDOperand PromoteLegalFP_TO_INT(SDOperand LegalOp, MVT::ValueType DestVT,
220 SDOperand ExpandBSWAP(SDOperand Op);
221 SDOperand ExpandBitCount(unsigned Opc, SDOperand Op);
222 bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt,
223 SDOperand &Lo, SDOperand &Hi);
224 void ExpandShiftParts(unsigned NodeOp, SDOperand Op, SDOperand Amt,
225 SDOperand &Lo, SDOperand &Hi);
227 SDOperand LowerVEXTRACT_VECTOR_ELT(SDOperand Op);
228 SDOperand ExpandEXTRACT_VECTOR_ELT(SDOperand Op);
230 SDOperand getIntPtrConstant(uint64_t Val) {
231 return DAG.getConstant(Val, TLI.getPointerTy());
236 /// isVectorShuffleLegal - Return true if a vector shuffle is legal with the
237 /// specified mask and type. Targets can specify exactly which masks they
238 /// support and the code generator is tasked with not creating illegal masks.
240 /// Note that this will also return true for shuffles that are promoted to a
242 SDNode *SelectionDAGLegalize::isShuffleLegal(MVT::ValueType VT,
243 SDOperand Mask) const {
244 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE, VT)) {
246 case TargetLowering::Legal:
247 case TargetLowering::Custom:
249 case TargetLowering::Promote: {
250 // If this is promoted to a different type, convert the shuffle mask and
251 // ask if it is legal in the promoted type!
252 MVT::ValueType NVT = TLI.getTypeToPromoteTo(ISD::VECTOR_SHUFFLE, VT);
254 // If we changed # elements, change the shuffle mask.
255 unsigned NumEltsGrowth =
256 MVT::getVectorNumElements(NVT) / MVT::getVectorNumElements(VT);
257 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
258 if (NumEltsGrowth > 1) {
259 // Renumber the elements.
260 SmallVector<SDOperand, 8> Ops;
261 for (unsigned i = 0, e = Mask.getNumOperands(); i != e; ++i) {
262 SDOperand InOp = Mask.getOperand(i);
263 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
264 if (InOp.getOpcode() == ISD::UNDEF)
265 Ops.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
267 unsigned InEltNo = cast<ConstantSDNode>(InOp)->getValue();
268 Ops.push_back(DAG.getConstant(InEltNo*NumEltsGrowth+j, MVT::i32));
272 Mask = DAG.getNode(ISD::BUILD_VECTOR, NVT, &Ops[0], Ops.size());
278 return TLI.isShuffleMaskLegal(Mask, VT) ? Mask.Val : 0;
281 /// getScalarizedOpcode - Return the scalar opcode that corresponds to the
282 /// specified vector opcode.
283 static unsigned getScalarizedOpcode(unsigned VecOp, MVT::ValueType VT) {
285 default: assert(0 && "Don't know how to scalarize this opcode!");
286 case ISD::VADD: return MVT::isInteger(VT) ? ISD::ADD : ISD::FADD;
287 case ISD::VSUB: return MVT::isInteger(VT) ? ISD::SUB : ISD::FSUB;
288 case ISD::VMUL: return MVT::isInteger(VT) ? ISD::MUL : ISD::FMUL;
289 case ISD::VSDIV: return MVT::isInteger(VT) ? ISD::SDIV: ISD::FDIV;
290 case ISD::VUDIV: return MVT::isInteger(VT) ? ISD::UDIV: ISD::FDIV;
291 case ISD::VAND: return MVT::isInteger(VT) ? ISD::AND : 0;
292 case ISD::VOR: return MVT::isInteger(VT) ? ISD::OR : 0;
293 case ISD::VXOR: return MVT::isInteger(VT) ? ISD::XOR : 0;
297 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
298 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
299 ValueTypeActions(TLI.getValueTypeActions()) {
300 assert(MVT::LAST_VALUETYPE <= 32 &&
301 "Too many value types for ValueTypeActions to hold!");
304 /// ComputeTopDownOrdering - Add the specified node to the Order list if it has
305 /// not been visited yet and if all of its operands have already been visited.
306 static void ComputeTopDownOrdering(SDNode *N, SmallVector<SDNode*, 64> &Order,
307 DenseMap<SDNode*, unsigned> &Visited) {
308 if (++Visited[N] != N->getNumOperands())
309 return; // Haven't visited all operands yet
313 if (N->hasOneUse()) { // Tail recurse in common case.
314 ComputeTopDownOrdering(*N->use_begin(), Order, Visited);
318 // Now that we have N in, add anything that uses it if all of their operands
320 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); UI != E;++UI)
321 ComputeTopDownOrdering(*UI, Order, Visited);
325 void SelectionDAGLegalize::LegalizeDAG() {
326 LastCALLSEQ_END = DAG.getEntryNode();
327 IsLegalizingCall = false;
329 // The legalize process is inherently a bottom-up recursive process (users
330 // legalize their uses before themselves). Given infinite stack space, we
331 // could just start legalizing on the root and traverse the whole graph. In
332 // practice however, this causes us to run out of stack space on large basic
333 // blocks. To avoid this problem, compute an ordering of the nodes where each
334 // node is only legalized after all of its operands are legalized.
335 DenseMap<SDNode*, unsigned> Visited;
336 SmallVector<SDNode*, 64> Order;
338 // Compute ordering from all of the leaves in the graphs, those (like the
339 // entry node) that have no operands.
340 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
341 E = DAG.allnodes_end(); I != E; ++I) {
342 if (I->getNumOperands() == 0) {
344 ComputeTopDownOrdering(I, Order, Visited);
348 assert(Order.size() == Visited.size() &&
350 (unsigned)std::distance(DAG.allnodes_begin(), DAG.allnodes_end()) &&
351 "Error: DAG is cyclic!");
354 for (unsigned i = 0, e = Order.size(); i != e; ++i)
355 HandleOp(SDOperand(Order[i], 0));
357 // Finally, it's possible the root changed. Get the new root.
358 SDOperand OldRoot = DAG.getRoot();
359 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
360 DAG.setRoot(LegalizedNodes[OldRoot]);
362 ExpandedNodes.clear();
363 LegalizedNodes.clear();
364 PromotedNodes.clear();
368 // Remove dead nodes now.
369 DAG.RemoveDeadNodes();
373 /// FindCallEndFromCallStart - Given a chained node that is part of a call
374 /// sequence, find the CALLSEQ_END node that terminates the call sequence.
375 static SDNode *FindCallEndFromCallStart(SDNode *Node) {
376 if (Node->getOpcode() == ISD::CALLSEQ_END)
378 if (Node->use_empty())
379 return 0; // No CallSeqEnd
381 // The chain is usually at the end.
382 SDOperand TheChain(Node, Node->getNumValues()-1);
383 if (TheChain.getValueType() != MVT::Other) {
384 // Sometimes it's at the beginning.
385 TheChain = SDOperand(Node, 0);
386 if (TheChain.getValueType() != MVT::Other) {
387 // Otherwise, hunt for it.
388 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
389 if (Node->getValueType(i) == MVT::Other) {
390 TheChain = SDOperand(Node, i);
394 // Otherwise, we walked into a node without a chain.
395 if (TheChain.getValueType() != MVT::Other)
400 for (SDNode::use_iterator UI = Node->use_begin(),
401 E = Node->use_end(); UI != E; ++UI) {
403 // Make sure to only follow users of our token chain.
405 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
406 if (User->getOperand(i) == TheChain)
407 if (SDNode *Result = FindCallEndFromCallStart(User))
413 /// FindCallStartFromCallEnd - Given a chained node that is part of a call
414 /// sequence, find the CALLSEQ_START node that initiates the call sequence.
415 static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
416 assert(Node && "Didn't find callseq_start for a call??");
417 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
419 assert(Node->getOperand(0).getValueType() == MVT::Other &&
420 "Node doesn't have a token chain argument!");
421 return FindCallStartFromCallEnd(Node->getOperand(0).Val);
424 /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
425 /// see if any uses can reach Dest. If no dest operands can get to dest,
426 /// legalize them, legalize ourself, and return false, otherwise, return true.
428 /// Keep track of the nodes we fine that actually do lead to Dest in
429 /// NodesLeadingTo. This avoids retraversing them exponential number of times.
431 bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
432 SmallPtrSet<SDNode*, 32> &NodesLeadingTo) {
433 if (N == Dest) return true; // N certainly leads to Dest :)
435 // If we've already processed this node and it does lead to Dest, there is no
436 // need to reprocess it.
437 if (NodesLeadingTo.count(N)) return true;
439 // If the first result of this node has been already legalized, then it cannot
441 switch (getTypeAction(N->getValueType(0))) {
443 if (LegalizedNodes.count(SDOperand(N, 0))) return false;
446 if (PromotedNodes.count(SDOperand(N, 0))) return false;
449 if (ExpandedNodes.count(SDOperand(N, 0))) return false;
453 // Okay, this node has not already been legalized. Check and legalize all
454 // operands. If none lead to Dest, then we can legalize this node.
455 bool OperandsLeadToDest = false;
456 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
457 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
458 LegalizeAllNodesNotLeadingTo(N->getOperand(i).Val, Dest, NodesLeadingTo);
460 if (OperandsLeadToDest) {
461 NodesLeadingTo.insert(N);
465 // Okay, this node looks safe, legalize it and return false.
466 HandleOp(SDOperand(N, 0));
470 /// HandleOp - Legalize, Promote, Expand or Pack the specified operand as
471 /// appropriate for its type.
472 void SelectionDAGLegalize::HandleOp(SDOperand Op) {
473 switch (getTypeAction(Op.getValueType())) {
474 default: assert(0 && "Bad type action!");
475 case Legal: LegalizeOp(Op); break;
476 case Promote: PromoteOp(Op); break;
478 if (Op.getValueType() != MVT::Vector) {
483 unsigned NumOps = N->getNumOperands();
484 unsigned NumElements =
485 cast<ConstantSDNode>(N->getOperand(NumOps-2))->getValue();
486 MVT::ValueType EVT = cast<VTSDNode>(N->getOperand(NumOps-1))->getVT();
487 MVT::ValueType PackedVT = getVectorType(EVT, NumElements);
488 if (PackedVT != MVT::Other && TLI.isTypeLegal(PackedVT)) {
489 // In the common case, this is a legal vector type, convert it to the
490 // packed operation and type now.
491 PackVectorOp(Op, PackedVT);
492 } else if (NumElements == 1) {
493 // Otherwise, if this is a single element vector, convert it to a
495 PackVectorOp(Op, EVT);
497 // Otherwise, this is a multiple element vector that isn't supported.
498 // Split it in half and legalize both parts.
500 SplitVectorOp(Op, X, Y);
507 /// ExpandConstantFP - Expands the ConstantFP node to an integer constant or
508 /// a load from the constant pool.
509 static SDOperand ExpandConstantFP(ConstantFPSDNode *CFP, bool UseCP,
510 SelectionDAG &DAG, TargetLowering &TLI) {
513 // If a FP immediate is precise when represented as a float and if the
514 // target can do an extending load from float to double, we put it into
515 // the constant pool as a float, even if it's is statically typed as a
517 MVT::ValueType VT = CFP->getValueType(0);
518 bool isDouble = VT == MVT::f64;
519 ConstantFP *LLVMC = ConstantFP::get(isDouble ? Type::DoubleTy :
520 Type::FloatTy, CFP->getValue());
522 double Val = LLVMC->getValue();
524 ? DAG.getConstant(DoubleToBits(Val), MVT::i64)
525 : DAG.getConstant(FloatToBits(Val), MVT::i32);
528 if (isDouble && CFP->isExactlyValue((float)CFP->getValue()) &&
529 // Only do this if the target has a native EXTLOAD instruction from f32.
530 TLI.isLoadXLegal(ISD::EXTLOAD, MVT::f32)) {
531 LLVMC = cast<ConstantFP>(ConstantExpr::getFPTrunc(LLVMC,Type::FloatTy));
536 SDOperand CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
538 return DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
539 CPIdx, NULL, 0, MVT::f32);
541 return DAG.getLoad(VT, DAG.getEntryNode(), CPIdx, NULL, 0);
546 /// ExpandFCOPYSIGNToBitwiseOps - Expands fcopysign to a series of bitwise
549 SDOperand ExpandFCOPYSIGNToBitwiseOps(SDNode *Node, MVT::ValueType NVT,
550 SelectionDAG &DAG, TargetLowering &TLI) {
551 MVT::ValueType VT = Node->getValueType(0);
552 MVT::ValueType SrcVT = Node->getOperand(1).getValueType();
553 MVT::ValueType SrcNVT = (SrcVT == MVT::f64) ? MVT::i64 : MVT::i32;
555 // First get the sign bit of second operand.
556 SDOperand Mask1 = (SrcVT == MVT::f64)
557 ? DAG.getConstantFP(BitsToDouble(1ULL << 63), SrcVT)
558 : DAG.getConstantFP(BitsToFloat(1U << 31), SrcVT);
559 Mask1 = DAG.getNode(ISD::BIT_CONVERT, SrcNVT, Mask1);
560 SDOperand SignBit= DAG.getNode(ISD::BIT_CONVERT, SrcNVT, Node->getOperand(1));
561 SignBit = DAG.getNode(ISD::AND, SrcNVT, SignBit, Mask1);
562 // Shift right or sign-extend it if the two operands have different types.
563 int SizeDiff = MVT::getSizeInBits(SrcNVT) - MVT::getSizeInBits(NVT);
565 SignBit = DAG.getNode(ISD::SRL, SrcNVT, SignBit,
566 DAG.getConstant(SizeDiff, TLI.getShiftAmountTy()));
567 SignBit = DAG.getNode(ISD::TRUNCATE, NVT, SignBit);
568 } else if (SizeDiff < 0)
569 SignBit = DAG.getNode(ISD::SIGN_EXTEND, NVT, SignBit);
571 // Clear the sign bit of first operand.
572 SDOperand Mask2 = (VT == MVT::f64)
573 ? DAG.getConstantFP(BitsToDouble(~(1ULL << 63)), VT)
574 : DAG.getConstantFP(BitsToFloat(~(1U << 31)), VT);
575 Mask2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Mask2);
576 SDOperand Result = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
577 Result = DAG.getNode(ISD::AND, NVT, Result, Mask2);
579 // Or the value with the sign bit.
580 Result = DAG.getNode(ISD::OR, NVT, Result, SignBit);
585 /// LegalizeOp - We know that the specified value has a legal type.
586 /// Recursively ensure that the operands have legal types, then return the
588 SDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) {
589 assert(isTypeLegal(Op.getValueType()) &&
590 "Caller should expand or promote operands that are not legal!");
591 SDNode *Node = Op.Val;
593 // If this operation defines any values that cannot be represented in a
594 // register on this target, make sure to expand or promote them.
595 if (Node->getNumValues() > 1) {
596 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
597 if (getTypeAction(Node->getValueType(i)) != Legal) {
598 HandleOp(Op.getValue(i));
599 assert(LegalizedNodes.count(Op) &&
600 "Handling didn't add legal operands!");
601 return LegalizedNodes[Op];
605 // Note that LegalizeOp may be reentered even from single-use nodes, which
606 // means that we always must cache transformed nodes.
607 DenseMap<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
608 if (I != LegalizedNodes.end()) return I->second;
610 SDOperand Tmp1, Tmp2, Tmp3, Tmp4;
611 SDOperand Result = Op;
612 bool isCustom = false;
614 switch (Node->getOpcode()) {
615 case ISD::FrameIndex:
616 case ISD::EntryToken:
618 case ISD::BasicBlock:
619 case ISD::TargetFrameIndex:
620 case ISD::TargetJumpTable:
621 case ISD::TargetConstant:
622 case ISD::TargetConstantFP:
623 case ISD::TargetConstantPool:
624 case ISD::TargetGlobalAddress:
625 case ISD::TargetExternalSymbol:
630 case ISD::GLOBAL_OFFSET_TABLE:
631 // Primitives must all be legal.
632 assert(TLI.isOperationLegal(Node->getValueType(0), Node->getValueType(0)) &&
633 "This must be legal!");
636 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
637 // If this is a target node, legalize it by legalizing the operands then
638 // passing it through.
639 SmallVector<SDOperand, 8> Ops;
640 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
641 Ops.push_back(LegalizeOp(Node->getOperand(i)));
643 Result = DAG.UpdateNodeOperands(Result.getValue(0), &Ops[0], Ops.size());
645 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
646 AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
647 return Result.getValue(Op.ResNo);
649 // Otherwise this is an unhandled builtin node. splat.
651 cerr << "NODE: "; Node->dump(); cerr << "\n";
653 assert(0 && "Do not know how to legalize this operator!");
655 case ISD::GlobalAddress:
656 case ISD::ExternalSymbol:
657 case ISD::ConstantPool:
658 case ISD::JumpTable: // Nothing to do.
659 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
660 default: assert(0 && "This action is not supported yet!");
661 case TargetLowering::Custom:
662 Tmp1 = TLI.LowerOperation(Op, DAG);
663 if (Tmp1.Val) Result = Tmp1;
664 // FALLTHROUGH if the target doesn't want to lower this op after all.
665 case TargetLowering::Legal:
670 case ISD::RETURNADDR:
671 // The only option for these nodes is to custom lower them. If the target
672 // does not custom lower them, then return zero.
673 Tmp1 = TLI.LowerOperation(Op, DAG);
677 Result = DAG.getConstant(0, TLI.getPointerTy());
679 case ISD::EXCEPTIONADDR: {
680 Tmp1 = LegalizeOp(Node->getOperand(0));
681 MVT::ValueType VT = Node->getValueType(0);
682 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
683 default: assert(0 && "This action is not supported yet!");
684 case TargetLowering::Expand: {
685 unsigned Reg = TLI.getExceptionAddressRegister();
686 Result = DAG.getCopyFromReg(Tmp1, Reg, VT).getValue(Op.ResNo);
689 case TargetLowering::Custom:
690 Result = TLI.LowerOperation(Op, DAG);
691 if (Result.Val) break;
693 case TargetLowering::Legal:
694 Result = DAG.getNode(ISD::MERGE_VALUES, VT, DAG.getConstant(0, VT), Tmp1).
700 case ISD::EHSELECTION: {
701 Tmp1 = LegalizeOp(Node->getOperand(0));
702 Tmp2 = LegalizeOp(Node->getOperand(1));
703 MVT::ValueType VT = Node->getValueType(0);
704 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
705 default: assert(0 && "This action is not supported yet!");
706 case TargetLowering::Expand: {
707 unsigned Reg = TLI.getExceptionSelectorRegister();
708 Result = DAG.getCopyFromReg(Tmp2, Reg, VT).getValue(Op.ResNo);
711 case TargetLowering::Custom:
712 Result = TLI.LowerOperation(Op, DAG);
713 if (Result.Val) break;
715 case TargetLowering::Legal:
716 Result = DAG.getNode(ISD::MERGE_VALUES, VT, DAG.getConstant(0, VT), Tmp2).
722 case ISD::AssertSext:
723 case ISD::AssertZext:
724 Tmp1 = LegalizeOp(Node->getOperand(0));
725 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
727 case ISD::MERGE_VALUES:
728 // Legalize eliminates MERGE_VALUES nodes.
729 Result = Node->getOperand(Op.ResNo);
731 case ISD::CopyFromReg:
732 Tmp1 = LegalizeOp(Node->getOperand(0));
733 Result = Op.getValue(0);
734 if (Node->getNumValues() == 2) {
735 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
737 assert(Node->getNumValues() == 3 && "Invalid copyfromreg!");
738 if (Node->getNumOperands() == 3) {
739 Tmp2 = LegalizeOp(Node->getOperand(2));
740 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
742 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
744 AddLegalizedOperand(Op.getValue(2), Result.getValue(2));
746 // Since CopyFromReg produces two values, make sure to remember that we
747 // legalized both of them.
748 AddLegalizedOperand(Op.getValue(0), Result);
749 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
750 return Result.getValue(Op.ResNo);
752 MVT::ValueType VT = Op.getValueType();
753 switch (TLI.getOperationAction(ISD::UNDEF, VT)) {
754 default: assert(0 && "This action is not supported yet!");
755 case TargetLowering::Expand:
756 if (MVT::isInteger(VT))
757 Result = DAG.getConstant(0, VT);
758 else if (MVT::isFloatingPoint(VT))
759 Result = DAG.getConstantFP(0, VT);
761 assert(0 && "Unknown value type!");
763 case TargetLowering::Legal:
769 case ISD::INTRINSIC_W_CHAIN:
770 case ISD::INTRINSIC_WO_CHAIN:
771 case ISD::INTRINSIC_VOID: {
772 SmallVector<SDOperand, 8> Ops;
773 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
774 Ops.push_back(LegalizeOp(Node->getOperand(i)));
775 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
777 // Allow the target to custom lower its intrinsics if it wants to.
778 if (TLI.getOperationAction(Node->getOpcode(), MVT::Other) ==
779 TargetLowering::Custom) {
780 Tmp3 = TLI.LowerOperation(Result, DAG);
781 if (Tmp3.Val) Result = Tmp3;
784 if (Result.Val->getNumValues() == 1) break;
786 // Must have return value and chain result.
787 assert(Result.Val->getNumValues() == 2 &&
788 "Cannot return more than two values!");
790 // Since loads produce two values, make sure to remember that we
791 // legalized both of them.
792 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
793 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
794 return Result.getValue(Op.ResNo);
798 assert(Node->getNumOperands() == 5 && "Invalid LOCATION node!");
799 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input chain.
801 switch (TLI.getOperationAction(ISD::LOCATION, MVT::Other)) {
802 case TargetLowering::Promote:
803 default: assert(0 && "This action is not supported yet!");
804 case TargetLowering::Expand: {
805 MachineModuleInfo *MMI = DAG.getMachineModuleInfo();
806 bool useDEBUG_LOC = TLI.isOperationLegal(ISD::DEBUG_LOC, MVT::Other);
807 bool useLABEL = TLI.isOperationLegal(ISD::LABEL, MVT::Other);
809 if (MMI && (useDEBUG_LOC || useLABEL)) {
810 const std::string &FName =
811 cast<StringSDNode>(Node->getOperand(3))->getValue();
812 const std::string &DirName =
813 cast<StringSDNode>(Node->getOperand(4))->getValue();
814 unsigned SrcFile = MMI->RecordSource(DirName, FName);
816 SmallVector<SDOperand, 8> Ops;
817 Ops.push_back(Tmp1); // chain
818 SDOperand LineOp = Node->getOperand(1);
819 SDOperand ColOp = Node->getOperand(2);
822 Ops.push_back(LineOp); // line #
823 Ops.push_back(ColOp); // col #
824 Ops.push_back(DAG.getConstant(SrcFile, MVT::i32)); // source file id
825 Result = DAG.getNode(ISD::DEBUG_LOC, MVT::Other, &Ops[0], Ops.size());
827 unsigned Line = cast<ConstantSDNode>(LineOp)->getValue();
828 unsigned Col = cast<ConstantSDNode>(ColOp)->getValue();
829 unsigned ID = MMI->RecordLabel(Line, Col, SrcFile);
830 Ops.push_back(DAG.getConstant(ID, MVT::i32));
831 Result = DAG.getNode(ISD::LABEL, MVT::Other,&Ops[0],Ops.size());
834 Result = Tmp1; // chain
838 case TargetLowering::Legal:
839 if (Tmp1 != Node->getOperand(0) ||
840 getTypeAction(Node->getOperand(1).getValueType()) == Promote) {
841 SmallVector<SDOperand, 8> Ops;
843 if (getTypeAction(Node->getOperand(1).getValueType()) == Legal) {
844 Ops.push_back(Node->getOperand(1)); // line # must be legal.
845 Ops.push_back(Node->getOperand(2)); // col # must be legal.
847 // Otherwise promote them.
848 Ops.push_back(PromoteOp(Node->getOperand(1)));
849 Ops.push_back(PromoteOp(Node->getOperand(2)));
851 Ops.push_back(Node->getOperand(3)); // filename must be legal.
852 Ops.push_back(Node->getOperand(4)); // working dir # must be legal.
853 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
860 assert(Node->getNumOperands() == 4 && "Invalid DEBUG_LOC node!");
861 switch (TLI.getOperationAction(ISD::DEBUG_LOC, MVT::Other)) {
862 default: assert(0 && "This action is not supported yet!");
863 case TargetLowering::Legal:
864 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
865 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the line #.
866 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the col #.
867 Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize the source file id.
868 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4);
874 assert(Node->getNumOperands() == 2 && "Invalid LABEL node!");
875 switch (TLI.getOperationAction(ISD::LABEL, MVT::Other)) {
876 default: assert(0 && "This action is not supported yet!");
877 case TargetLowering::Legal:
878 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
879 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the label id.
880 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
882 case TargetLowering::Expand:
883 Result = LegalizeOp(Node->getOperand(0));
889 // We know we don't need to expand constants here, constants only have one
890 // value and we check that it is fine above.
892 // FIXME: Maybe we should handle things like targets that don't support full
893 // 32-bit immediates?
895 case ISD::ConstantFP: {
896 // Spill FP immediates to the constant pool if the target cannot directly
897 // codegen them. Targets often have some immediate values that can be
898 // efficiently generated into an FP register without a load. We explicitly
899 // leave these constants as ConstantFP nodes for the target to deal with.
900 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
902 // Check to see if this FP immediate is already legal.
903 bool isLegal = false;
904 for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(),
905 E = TLI.legal_fpimm_end(); I != E; ++I)
906 if (CFP->isExactlyValue(*I)) {
911 // If this is a legal constant, turn it into a TargetConstantFP node.
913 Result = DAG.getTargetConstantFP(CFP->getValue(), CFP->getValueType(0));
917 switch (TLI.getOperationAction(ISD::ConstantFP, CFP->getValueType(0))) {
918 default: assert(0 && "This action is not supported yet!");
919 case TargetLowering::Custom:
920 Tmp3 = TLI.LowerOperation(Result, DAG);
926 case TargetLowering::Expand:
927 Result = ExpandConstantFP(CFP, true, DAG, TLI);
931 case ISD::TokenFactor:
932 if (Node->getNumOperands() == 2) {
933 Tmp1 = LegalizeOp(Node->getOperand(0));
934 Tmp2 = LegalizeOp(Node->getOperand(1));
935 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
936 } else if (Node->getNumOperands() == 3) {
937 Tmp1 = LegalizeOp(Node->getOperand(0));
938 Tmp2 = LegalizeOp(Node->getOperand(1));
939 Tmp3 = LegalizeOp(Node->getOperand(2));
940 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
942 SmallVector<SDOperand, 8> Ops;
943 // Legalize the operands.
944 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
945 Ops.push_back(LegalizeOp(Node->getOperand(i)));
946 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
950 case ISD::FORMAL_ARGUMENTS:
952 // The only option for this is to custom lower it.
953 Tmp3 = TLI.LowerOperation(Result.getValue(0), DAG);
954 assert(Tmp3.Val && "Target didn't custom lower this node!");
955 assert(Tmp3.Val->getNumValues() == Result.Val->getNumValues() &&
956 "Lowering call/formal_arguments produced unexpected # results!");
958 // Since CALL/FORMAL_ARGUMENTS nodes produce multiple values, make sure to
959 // remember that we legalized all of them, so it doesn't get relegalized.
960 for (unsigned i = 0, e = Tmp3.Val->getNumValues(); i != e; ++i) {
961 Tmp1 = LegalizeOp(Tmp3.getValue(i));
964 AddLegalizedOperand(SDOperand(Node, i), Tmp1);
968 case ISD::BUILD_VECTOR:
969 switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) {
970 default: assert(0 && "This action is not supported yet!");
971 case TargetLowering::Custom:
972 Tmp3 = TLI.LowerOperation(Result, DAG);
978 case TargetLowering::Expand:
979 Result = ExpandBUILD_VECTOR(Result.Val);
983 case ISD::INSERT_VECTOR_ELT:
984 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVec
985 Tmp2 = LegalizeOp(Node->getOperand(1)); // InVal
986 Tmp3 = LegalizeOp(Node->getOperand(2)); // InEltNo
987 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
989 switch (TLI.getOperationAction(ISD::INSERT_VECTOR_ELT,
990 Node->getValueType(0))) {
991 default: assert(0 && "This action is not supported yet!");
992 case TargetLowering::Legal:
994 case TargetLowering::Custom:
995 Tmp3 = TLI.LowerOperation(Result, DAG);
1001 case TargetLowering::Expand: {
1002 // If the insert index is a constant, codegen this as a scalar_to_vector,
1003 // then a shuffle that inserts it into the right position in the vector.
1004 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Tmp3)) {
1005 SDOperand ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR,
1006 Tmp1.getValueType(), Tmp2);
1008 unsigned NumElts = MVT::getVectorNumElements(Tmp1.getValueType());
1009 MVT::ValueType ShufMaskVT = MVT::getIntVectorWithNumElements(NumElts);
1010 MVT::ValueType ShufMaskEltVT = MVT::getVectorBaseType(ShufMaskVT);
1012 // We generate a shuffle of InVec and ScVec, so the shuffle mask should
1013 // be 0,1,2,3,4,5... with the appropriate element replaced with elt 0 of
1015 SmallVector<SDOperand, 8> ShufOps;
1016 for (unsigned i = 0; i != NumElts; ++i) {
1017 if (i != InsertPos->getValue())
1018 ShufOps.push_back(DAG.getConstant(i, ShufMaskEltVT));
1020 ShufOps.push_back(DAG.getConstant(NumElts, ShufMaskEltVT));
1022 SDOperand ShufMask = DAG.getNode(ISD::BUILD_VECTOR, ShufMaskVT,
1023 &ShufOps[0], ShufOps.size());
1025 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, Tmp1.getValueType(),
1026 Tmp1, ScVec, ShufMask);
1027 Result = LegalizeOp(Result);
1031 // If the target doesn't support this, we have to spill the input vector
1032 // to a temporary stack slot, update the element, then reload it. This is
1033 // badness. We could also load the value into a vector register (either
1034 // with a "move to register" or "extload into register" instruction, then
1035 // permute it into place, if the idx is a constant and if the idx is
1036 // supported by the target.
1037 MVT::ValueType VT = Tmp1.getValueType();
1038 MVT::ValueType EltVT = Tmp2.getValueType();
1039 MVT::ValueType IdxVT = Tmp3.getValueType();
1040 MVT::ValueType PtrVT = TLI.getPointerTy();
1041 SDOperand StackPtr = CreateStackTemporary(VT);
1042 // Store the vector.
1043 SDOperand Ch = DAG.getStore(DAG.getEntryNode(), Tmp1, StackPtr, NULL, 0);
1045 // Truncate or zero extend offset to target pointer type.
1046 unsigned CastOpc = (IdxVT > PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
1047 Tmp3 = DAG.getNode(CastOpc, PtrVT, Tmp3);
1048 // Add the offset to the index.
1049 unsigned EltSize = MVT::getSizeInBits(EltVT)/8;
1050 Tmp3 = DAG.getNode(ISD::MUL, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
1051 SDOperand StackPtr2 = DAG.getNode(ISD::ADD, IdxVT, Tmp3, StackPtr);
1052 // Store the scalar value.
1053 Ch = DAG.getStore(Ch, Tmp2, StackPtr2, NULL, 0);
1054 // Load the updated vector.
1055 Result = DAG.getLoad(VT, Ch, StackPtr, NULL, 0);
1060 case ISD::SCALAR_TO_VECTOR:
1061 if (!TLI.isTypeLegal(Node->getOperand(0).getValueType())) {
1062 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
1066 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVal
1067 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1068 switch (TLI.getOperationAction(ISD::SCALAR_TO_VECTOR,
1069 Node->getValueType(0))) {
1070 default: assert(0 && "This action is not supported yet!");
1071 case TargetLowering::Legal:
1073 case TargetLowering::Custom:
1074 Tmp3 = TLI.LowerOperation(Result, DAG);
1080 case TargetLowering::Expand:
1081 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
1085 case ISD::VECTOR_SHUFFLE:
1086 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input vectors,
1087 Tmp2 = LegalizeOp(Node->getOperand(1)); // but not the shuffle mask.
1088 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1090 // Allow targets to custom lower the SHUFFLEs they support.
1091 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE,Result.getValueType())) {
1092 default: assert(0 && "Unknown operation action!");
1093 case TargetLowering::Legal:
1094 assert(isShuffleLegal(Result.getValueType(), Node->getOperand(2)) &&
1095 "vector shuffle should not be created if not legal!");
1097 case TargetLowering::Custom:
1098 Tmp3 = TLI.LowerOperation(Result, DAG);
1104 case TargetLowering::Expand: {
1105 MVT::ValueType VT = Node->getValueType(0);
1106 MVT::ValueType EltVT = MVT::getVectorBaseType(VT);
1107 MVT::ValueType PtrVT = TLI.getPointerTy();
1108 SDOperand Mask = Node->getOperand(2);
1109 unsigned NumElems = Mask.getNumOperands();
1110 SmallVector<SDOperand,8> Ops;
1111 for (unsigned i = 0; i != NumElems; ++i) {
1112 SDOperand Arg = Mask.getOperand(i);
1113 if (Arg.getOpcode() == ISD::UNDEF) {
1114 Ops.push_back(DAG.getNode(ISD::UNDEF, EltVT));
1116 assert(isa<ConstantSDNode>(Arg) && "Invalid VECTOR_SHUFFLE mask!");
1117 unsigned Idx = cast<ConstantSDNode>(Arg)->getValue();
1119 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1,
1120 DAG.getConstant(Idx, PtrVT)));
1122 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2,
1123 DAG.getConstant(Idx - NumElems, PtrVT)));
1126 Result = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
1129 case TargetLowering::Promote: {
1130 // Change base type to a different vector type.
1131 MVT::ValueType OVT = Node->getValueType(0);
1132 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
1134 // Cast the two input vectors.
1135 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
1136 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
1138 // Convert the shuffle mask to the right # elements.
1139 Tmp3 = SDOperand(isShuffleLegal(OVT, Node->getOperand(2)), 0);
1140 assert(Tmp3.Val && "Shuffle not legal?");
1141 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NVT, Tmp1, Tmp2, Tmp3);
1142 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
1148 case ISD::EXTRACT_VECTOR_ELT:
1149 Tmp1 = LegalizeOp(Node->getOperand(0));
1150 Tmp2 = LegalizeOp(Node->getOperand(1));
1151 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1153 switch (TLI.getOperationAction(ISD::EXTRACT_VECTOR_ELT,
1154 Tmp1.getValueType())) {
1155 default: assert(0 && "This action is not supported yet!");
1156 case TargetLowering::Legal:
1158 case TargetLowering::Custom:
1159 Tmp3 = TLI.LowerOperation(Result, DAG);
1165 case TargetLowering::Expand:
1166 Result = ExpandEXTRACT_VECTOR_ELT(Result);
1171 case ISD::VEXTRACT_VECTOR_ELT:
1172 Result = LegalizeOp(LowerVEXTRACT_VECTOR_ELT(Op));
1175 case ISD::CALLSEQ_START: {
1176 SDNode *CallEnd = FindCallEndFromCallStart(Node);
1178 // Recursively Legalize all of the inputs of the call end that do not lead
1179 // to this call start. This ensures that any libcalls that need be inserted
1180 // are inserted *before* the CALLSEQ_START.
1181 {SmallPtrSet<SDNode*, 32> NodesLeadingTo;
1182 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
1183 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).Val, Node,
1187 // Now that we legalized all of the inputs (which may have inserted
1188 // libcalls) create the new CALLSEQ_START node.
1189 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1191 // Merge in the last call, to ensure that this call start after the last
1193 if (LastCALLSEQ_END.getOpcode() != ISD::EntryToken) {
1194 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1195 Tmp1 = LegalizeOp(Tmp1);
1198 // Do not try to legalize the target-specific arguments (#1+).
1199 if (Tmp1 != Node->getOperand(0)) {
1200 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1202 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1205 // Remember that the CALLSEQ_START is legalized.
1206 AddLegalizedOperand(Op.getValue(0), Result);
1207 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
1208 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1210 // Now that the callseq_start and all of the non-call nodes above this call
1211 // sequence have been legalized, legalize the call itself. During this
1212 // process, no libcalls can/will be inserted, guaranteeing that no calls
1214 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
1215 SDOperand InCallSEQ = LastCALLSEQ_END;
1216 // Note that we are selecting this call!
1217 LastCALLSEQ_END = SDOperand(CallEnd, 0);
1218 IsLegalizingCall = true;
1220 // Legalize the call, starting from the CALLSEQ_END.
1221 LegalizeOp(LastCALLSEQ_END);
1222 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
1225 case ISD::CALLSEQ_END:
1226 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
1227 // will cause this node to be legalized as well as handling libcalls right.
1228 if (LastCALLSEQ_END.Val != Node) {
1229 LegalizeOp(SDOperand(FindCallStartFromCallEnd(Node), 0));
1230 DenseMap<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
1231 assert(I != LegalizedNodes.end() &&
1232 "Legalizing the call start should have legalized this node!");
1236 // Otherwise, the call start has been legalized and everything is going
1237 // according to plan. Just legalize ourselves normally here.
1238 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1239 // Do not try to legalize the target-specific arguments (#1+), except for
1240 // an optional flag input.
1241 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
1242 if (Tmp1 != Node->getOperand(0)) {
1243 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1245 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1248 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
1249 if (Tmp1 != Node->getOperand(0) ||
1250 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
1251 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1254 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1257 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
1258 // This finishes up call legalization.
1259 IsLegalizingCall = false;
1261 // If the CALLSEQ_END node has a flag, remember that we legalized it.
1262 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1263 if (Node->getNumValues() == 2)
1264 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1265 return Result.getValue(Op.ResNo);
1266 case ISD::DYNAMIC_STACKALLOC: {
1267 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1268 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size.
1269 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment.
1270 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1272 Tmp1 = Result.getValue(0);
1273 Tmp2 = Result.getValue(1);
1274 switch (TLI.getOperationAction(Node->getOpcode(),
1275 Node->getValueType(0))) {
1276 default: assert(0 && "This action is not supported yet!");
1277 case TargetLowering::Expand: {
1278 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1279 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1280 " not tell us which reg is the stack pointer!");
1281 SDOperand Chain = Tmp1.getOperand(0);
1282 SDOperand Size = Tmp2.getOperand(1);
1283 SDOperand SP = DAG.getCopyFromReg(Chain, SPReg, Node->getValueType(0));
1284 Tmp1 = DAG.getNode(ISD::SUB, Node->getValueType(0), SP, Size); // Value
1285 Tmp2 = DAG.getCopyToReg(SP.getValue(1), SPReg, Tmp1); // Output chain
1286 Tmp1 = LegalizeOp(Tmp1);
1287 Tmp2 = LegalizeOp(Tmp2);
1290 case TargetLowering::Custom:
1291 Tmp3 = TLI.LowerOperation(Tmp1, DAG);
1293 Tmp1 = LegalizeOp(Tmp3);
1294 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1297 case TargetLowering::Legal:
1300 // Since this op produce two values, make sure to remember that we
1301 // legalized both of them.
1302 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1303 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1304 return Op.ResNo ? Tmp2 : Tmp1;
1306 case ISD::INLINEASM: {
1307 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
1308 bool Changed = false;
1309 // Legalize all of the operands of the inline asm, in case they are nodes
1310 // that need to be expanded or something. Note we skip the asm string and
1311 // all of the TargetConstant flags.
1312 SDOperand Op = LegalizeOp(Ops[0]);
1313 Changed = Op != Ops[0];
1316 bool HasInFlag = Ops.back().getValueType() == MVT::Flag;
1317 for (unsigned i = 2, e = Ops.size()-HasInFlag; i < e; ) {
1318 unsigned NumVals = cast<ConstantSDNode>(Ops[i])->getValue() >> 3;
1319 for (++i; NumVals; ++i, --NumVals) {
1320 SDOperand Op = LegalizeOp(Ops[i]);
1329 Op = LegalizeOp(Ops.back());
1330 Changed |= Op != Ops.back();
1335 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
1337 // INLINE asm returns a chain and flag, make sure to add both to the map.
1338 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1339 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1340 return Result.getValue(Op.ResNo);
1343 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1344 // Ensure that libcalls are emitted before a branch.
1345 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1346 Tmp1 = LegalizeOp(Tmp1);
1347 LastCALLSEQ_END = DAG.getEntryNode();
1349 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1352 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1353 // Ensure that libcalls are emitted before a branch.
1354 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1355 Tmp1 = LegalizeOp(Tmp1);
1356 LastCALLSEQ_END = DAG.getEntryNode();
1358 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1359 default: assert(0 && "Indirect target must be legal type (pointer)!");
1361 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1364 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1367 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1368 // Ensure that libcalls are emitted before a branch.
1369 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1370 Tmp1 = LegalizeOp(Tmp1);
1371 LastCALLSEQ_END = DAG.getEntryNode();
1373 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the jumptable node.
1374 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1376 switch (TLI.getOperationAction(ISD::BR_JT, MVT::Other)) {
1377 default: assert(0 && "This action is not supported yet!");
1378 case TargetLowering::Legal: break;
1379 case TargetLowering::Custom:
1380 Tmp1 = TLI.LowerOperation(Result, DAG);
1381 if (Tmp1.Val) Result = Tmp1;
1383 case TargetLowering::Expand: {
1384 SDOperand Chain = Result.getOperand(0);
1385 SDOperand Table = Result.getOperand(1);
1386 SDOperand Index = Result.getOperand(2);
1388 MVT::ValueType PTy = TLI.getPointerTy();
1389 MachineFunction &MF = DAG.getMachineFunction();
1390 unsigned EntrySize = MF.getJumpTableInfo()->getEntrySize();
1391 Index= DAG.getNode(ISD::MUL, PTy, Index, DAG.getConstant(EntrySize, PTy));
1392 SDOperand Addr = DAG.getNode(ISD::ADD, PTy, Index, Table);
1395 switch (EntrySize) {
1396 default: assert(0 && "Size of jump table not supported yet."); break;
1397 case 4: LD = DAG.getLoad(MVT::i32, Chain, Addr, NULL, 0); break;
1398 case 8: LD = DAG.getLoad(MVT::i64, Chain, Addr, NULL, 0); break;
1401 if (TLI.getTargetMachine().getRelocationModel() == Reloc::PIC_) {
1402 // For PIC, the sequence is:
1403 // BRIND(load(Jumptable + index) + RelocBase)
1404 // RelocBase is the JumpTable on PPC and X86, GOT on Alpha
1406 if (TLI.usesGlobalOffsetTable())
1407 Reloc = DAG.getNode(ISD::GLOBAL_OFFSET_TABLE, PTy);
1410 Addr = (PTy != MVT::i32) ? DAG.getNode(ISD::SIGN_EXTEND, PTy, LD) : LD;
1411 Addr = DAG.getNode(ISD::ADD, PTy, Addr, Reloc);
1412 Result = DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), Addr);
1414 Result = DAG.getNode(ISD::BRIND, MVT::Other, LD.getValue(1), LD);
1420 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1421 // Ensure that libcalls are emitted before a return.
1422 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1423 Tmp1 = LegalizeOp(Tmp1);
1424 LastCALLSEQ_END = DAG.getEntryNode();
1426 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1427 case Expand: assert(0 && "It's impossible to expand bools");
1429 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1432 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition.
1434 // The top bits of the promoted condition are not necessarily zero, ensure
1435 // that the value is properly zero extended.
1436 if (!TLI.MaskedValueIsZero(Tmp2,
1437 MVT::getIntVTBitMask(Tmp2.getValueType())^1))
1438 Tmp2 = DAG.getZeroExtendInReg(Tmp2, MVT::i1);
1442 // Basic block destination (Op#2) is always legal.
1443 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1445 switch (TLI.getOperationAction(ISD::BRCOND, MVT::Other)) {
1446 default: assert(0 && "This action is not supported yet!");
1447 case TargetLowering::Legal: break;
1448 case TargetLowering::Custom:
1449 Tmp1 = TLI.LowerOperation(Result, DAG);
1450 if (Tmp1.Val) Result = Tmp1;
1452 case TargetLowering::Expand:
1453 // Expand brcond's setcc into its constituent parts and create a BR_CC
1455 if (Tmp2.getOpcode() == ISD::SETCC) {
1456 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1, Tmp2.getOperand(2),
1457 Tmp2.getOperand(0), Tmp2.getOperand(1),
1458 Node->getOperand(2));
1460 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1,
1461 DAG.getCondCode(ISD::SETNE), Tmp2,
1462 DAG.getConstant(0, Tmp2.getValueType()),
1463 Node->getOperand(2));
1469 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1470 // Ensure that libcalls are emitted before a branch.
1471 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1472 Tmp1 = LegalizeOp(Tmp1);
1473 Tmp2 = Node->getOperand(2); // LHS
1474 Tmp3 = Node->getOperand(3); // RHS
1475 Tmp4 = Node->getOperand(1); // CC
1477 LegalizeSetCCOperands(Tmp2, Tmp3, Tmp4);
1478 LastCALLSEQ_END = DAG.getEntryNode();
1480 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1481 // the LHS is a legal SETCC itself. In this case, we need to compare
1482 // the result against zero to select between true and false values.
1483 if (Tmp3.Val == 0) {
1484 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
1485 Tmp4 = DAG.getCondCode(ISD::SETNE);
1488 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp4, Tmp2, Tmp3,
1489 Node->getOperand(4));
1491 switch (TLI.getOperationAction(ISD::BR_CC, Tmp3.getValueType())) {
1492 default: assert(0 && "Unexpected action for BR_CC!");
1493 case TargetLowering::Legal: break;
1494 case TargetLowering::Custom:
1495 Tmp4 = TLI.LowerOperation(Result, DAG);
1496 if (Tmp4.Val) Result = Tmp4;
1501 LoadSDNode *LD = cast<LoadSDNode>(Node);
1502 Tmp1 = LegalizeOp(LD->getChain()); // Legalize the chain.
1503 Tmp2 = LegalizeOp(LD->getBasePtr()); // Legalize the base pointer.
1505 ISD::LoadExtType ExtType = LD->getExtensionType();
1506 if (ExtType == ISD::NON_EXTLOAD) {
1507 MVT::ValueType VT = Node->getValueType(0);
1508 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1509 Tmp3 = Result.getValue(0);
1510 Tmp4 = Result.getValue(1);
1512 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1513 default: assert(0 && "This action is not supported yet!");
1514 case TargetLowering::Legal: break;
1515 case TargetLowering::Custom:
1516 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
1518 Tmp3 = LegalizeOp(Tmp1);
1519 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1522 case TargetLowering::Promote: {
1523 // Only promote a load of vector type to another.
1524 assert(MVT::isVector(VT) && "Cannot promote this load!");
1525 // Change base type to a different vector type.
1526 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
1528 Tmp1 = DAG.getLoad(NVT, Tmp1, Tmp2, LD->getSrcValue(),
1529 LD->getSrcValueOffset());
1530 Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp1));
1531 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1535 // Since loads produce two values, make sure to remember that we
1536 // legalized both of them.
1537 AddLegalizedOperand(SDOperand(Node, 0), Tmp3);
1538 AddLegalizedOperand(SDOperand(Node, 1), Tmp4);
1539 return Op.ResNo ? Tmp4 : Tmp3;
1541 MVT::ValueType SrcVT = LD->getLoadedVT();
1542 switch (TLI.getLoadXAction(ExtType, SrcVT)) {
1543 default: assert(0 && "This action is not supported yet!");
1544 case TargetLowering::Promote:
1545 assert(SrcVT == MVT::i1 &&
1546 "Can only promote extending LOAD from i1 -> i8!");
1547 Result = DAG.getExtLoad(ExtType, Node->getValueType(0), Tmp1, Tmp2,
1548 LD->getSrcValue(), LD->getSrcValueOffset(),
1550 Tmp1 = Result.getValue(0);
1551 Tmp2 = Result.getValue(1);
1553 case TargetLowering::Custom:
1556 case TargetLowering::Legal:
1557 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, LD->getOffset());
1558 Tmp1 = Result.getValue(0);
1559 Tmp2 = Result.getValue(1);
1562 Tmp3 = TLI.LowerOperation(Result, DAG);
1564 Tmp1 = LegalizeOp(Tmp3);
1565 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1569 case TargetLowering::Expand:
1570 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
1571 if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) {
1572 SDOperand Load = DAG.getLoad(SrcVT, Tmp1, Tmp2, LD->getSrcValue(),
1573 LD->getSrcValueOffset());
1574 Result = DAG.getNode(ISD::FP_EXTEND, Node->getValueType(0), Load);
1575 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
1576 Tmp2 = LegalizeOp(Load.getValue(1));
1579 assert(ExtType != ISD::EXTLOAD &&"EXTLOAD should always be supported!");
1580 // Turn the unsupported load into an EXTLOAD followed by an explicit
1581 // zero/sign extend inreg.
1582 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
1583 Tmp1, Tmp2, LD->getSrcValue(),
1584 LD->getSrcValueOffset(), SrcVT);
1586 if (ExtType == ISD::SEXTLOAD)
1587 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
1588 Result, DAG.getValueType(SrcVT));
1590 ValRes = DAG.getZeroExtendInReg(Result, SrcVT);
1591 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
1592 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
1595 // Since loads produce two values, make sure to remember that we legalized
1597 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1598 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1599 return Op.ResNo ? Tmp2 : Tmp1;
1602 case ISD::EXTRACT_ELEMENT: {
1603 MVT::ValueType OpTy = Node->getOperand(0).getValueType();
1604 switch (getTypeAction(OpTy)) {
1605 default: assert(0 && "EXTRACT_ELEMENT action for type unimplemented!");
1607 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) {
1609 Result = DAG.getNode(ISD::SRL, OpTy, Node->getOperand(0),
1610 DAG.getConstant(MVT::getSizeInBits(OpTy)/2,
1611 TLI.getShiftAmountTy()));
1612 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Result);
1615 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0),
1616 Node->getOperand(0));
1620 // Get both the low and high parts.
1621 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
1622 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue())
1623 Result = Tmp2; // 1 -> Hi
1625 Result = Tmp1; // 0 -> Lo
1631 case ISD::CopyToReg:
1632 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1634 assert(isTypeLegal(Node->getOperand(2).getValueType()) &&
1635 "Register type must be legal!");
1636 // Legalize the incoming value (must be a legal type).
1637 Tmp2 = LegalizeOp(Node->getOperand(2));
1638 if (Node->getNumValues() == 1) {
1639 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2);
1641 assert(Node->getNumValues() == 2 && "Unknown CopyToReg");
1642 if (Node->getNumOperands() == 4) {
1643 Tmp3 = LegalizeOp(Node->getOperand(3));
1644 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2,
1647 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
1650 // Since this produces two values, make sure to remember that we legalized
1652 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1653 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1659 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1661 // Ensure that libcalls are emitted before a return.
1662 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1663 Tmp1 = LegalizeOp(Tmp1);
1664 LastCALLSEQ_END = DAG.getEntryNode();
1666 switch (Node->getNumOperands()) {
1668 Tmp2 = Node->getOperand(1);
1669 Tmp3 = Node->getOperand(2); // Signness
1670 switch (getTypeAction(Tmp2.getValueType())) {
1672 Result = DAG.UpdateNodeOperands(Result, Tmp1, LegalizeOp(Tmp2), Tmp3);
1675 if (Tmp2.getValueType() != MVT::Vector) {
1677 ExpandOp(Tmp2, Lo, Hi);
1679 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi,Tmp3);
1681 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3);
1682 Result = LegalizeOp(Result);
1684 SDNode *InVal = Tmp2.Val;
1686 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
1687 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
1689 // Figure out if there is a Packed type corresponding to this Vector
1690 // type. If so, convert to the vector type.
1691 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
1692 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
1693 // Turn this into a return of the vector type.
1694 Tmp2 = PackVectorOp(Tmp2, TVT);
1695 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1696 } else if (NumElems == 1) {
1697 // Turn this into a return of the scalar type.
1698 Tmp2 = PackVectorOp(Tmp2, EVT);
1699 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1701 // FIXME: Returns of gcc generic vectors smaller than a legal type
1702 // should be returned in integer registers!
1704 // The scalarized value type may not be legal, e.g. it might require
1705 // promotion or expansion. Relegalize the return.
1706 Result = LegalizeOp(Result);
1708 // FIXME: Returns of gcc generic vectors larger than a legal vector
1709 // type should be returned by reference!
1711 SplitVectorOp(Tmp2, Lo, Hi);
1712 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi,Tmp3);
1713 Result = LegalizeOp(Result);
1718 Tmp2 = PromoteOp(Node->getOperand(1));
1719 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1720 Result = LegalizeOp(Result);
1725 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1727 default: { // ret <values>
1728 SmallVector<SDOperand, 8> NewValues;
1729 NewValues.push_back(Tmp1);
1730 for (unsigned i = 1, e = Node->getNumOperands(); i < e; i += 2)
1731 switch (getTypeAction(Node->getOperand(i).getValueType())) {
1733 NewValues.push_back(LegalizeOp(Node->getOperand(i)));
1734 NewValues.push_back(Node->getOperand(i+1));
1738 assert(Node->getOperand(i).getValueType() != MVT::Vector &&
1739 "FIXME: TODO: implement returning non-legal vector types!");
1740 ExpandOp(Node->getOperand(i), Lo, Hi);
1741 NewValues.push_back(Lo);
1742 NewValues.push_back(Node->getOperand(i+1));
1744 NewValues.push_back(Hi);
1745 NewValues.push_back(Node->getOperand(i+1));
1750 assert(0 && "Can't promote multiple return value yet!");
1753 if (NewValues.size() == Node->getNumOperands())
1754 Result = DAG.UpdateNodeOperands(Result, &NewValues[0],NewValues.size());
1756 Result = DAG.getNode(ISD::RET, MVT::Other,
1757 &NewValues[0], NewValues.size());
1762 if (Result.getOpcode() == ISD::RET) {
1763 switch (TLI.getOperationAction(Result.getOpcode(), MVT::Other)) {
1764 default: assert(0 && "This action is not supported yet!");
1765 case TargetLowering::Legal: break;
1766 case TargetLowering::Custom:
1767 Tmp1 = TLI.LowerOperation(Result, DAG);
1768 if (Tmp1.Val) Result = Tmp1;
1774 StoreSDNode *ST = cast<StoreSDNode>(Node);
1775 Tmp1 = LegalizeOp(ST->getChain()); // Legalize the chain.
1776 Tmp2 = LegalizeOp(ST->getBasePtr()); // Legalize the pointer.
1778 if (!ST->isTruncatingStore()) {
1779 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
1780 // FIXME: We shouldn't do this for TargetConstantFP's.
1781 // FIXME: move this to the DAG Combiner! Note that we can't regress due
1782 // to phase ordering between legalized code and the dag combiner. This
1783 // probably means that we need to integrate dag combiner and legalizer
1785 if (ConstantFPSDNode *CFP = dyn_cast<ConstantFPSDNode>(ST->getValue())) {
1786 if (CFP->getValueType(0) == MVT::f32) {
1787 Tmp3 = DAG.getConstant(FloatToBits(CFP->getValue()), MVT::i32);
1789 assert(CFP->getValueType(0) == MVT::f64 && "Unknown FP type!");
1790 Tmp3 = DAG.getConstant(DoubleToBits(CFP->getValue()), MVT::i64);
1792 Result = DAG.getStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
1793 ST->getSrcValueOffset());
1797 switch (getTypeAction(ST->getStoredVT())) {
1799 Tmp3 = LegalizeOp(ST->getValue());
1800 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1803 MVT::ValueType VT = Tmp3.getValueType();
1804 switch (TLI.getOperationAction(ISD::STORE, VT)) {
1805 default: assert(0 && "This action is not supported yet!");
1806 case TargetLowering::Legal: break;
1807 case TargetLowering::Custom:
1808 Tmp1 = TLI.LowerOperation(Result, DAG);
1809 if (Tmp1.Val) Result = Tmp1;
1811 case TargetLowering::Promote:
1812 assert(MVT::isVector(VT) && "Unknown legal promote case!");
1813 Tmp3 = DAG.getNode(ISD::BIT_CONVERT,
1814 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
1815 Result = DAG.getStore(Tmp1, Tmp3, Tmp2,
1816 ST->getSrcValue(), ST->getSrcValueOffset());
1822 // Truncate the value and store the result.
1823 Tmp3 = PromoteOp(ST->getValue());
1824 Result = DAG.getTruncStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
1825 ST->getSrcValueOffset(), ST->getStoredVT());
1829 unsigned IncrementSize = 0;
1832 // If this is a vector type, then we have to calculate the increment as
1833 // the product of the element size in bytes, and the number of elements
1834 // in the high half of the vector.
1835 if (ST->getValue().getValueType() == MVT::Vector) {
1836 SDNode *InVal = ST->getValue().Val;
1838 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
1839 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
1841 // Figure out if there is a Packed type corresponding to this Vector
1842 // type. If so, convert to the vector type.
1843 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
1844 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
1845 // Turn this into a normal store of the vector type.
1846 Tmp3 = PackVectorOp(Node->getOperand(1), TVT);
1847 Result = DAG.getStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
1848 ST->getSrcValueOffset());
1849 Result = LegalizeOp(Result);
1851 } else if (NumElems == 1) {
1852 // Turn this into a normal store of the scalar type.
1853 Tmp3 = PackVectorOp(Node->getOperand(1), EVT);
1854 Result = DAG.getStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
1855 ST->getSrcValueOffset());
1856 // The scalarized value type may not be legal, e.g. it might require
1857 // promotion or expansion. Relegalize the scalar store.
1858 Result = LegalizeOp(Result);
1861 SplitVectorOp(Node->getOperand(1), Lo, Hi);
1862 IncrementSize = NumElems/2 * MVT::getSizeInBits(EVT)/8;
1865 ExpandOp(Node->getOperand(1), Lo, Hi);
1866 IncrementSize = Hi.Val ? MVT::getSizeInBits(Hi.getValueType())/8 : 0;
1868 if (!TLI.isLittleEndian())
1872 Lo = DAG.getStore(Tmp1, Lo, Tmp2, ST->getSrcValue(),
1873 ST->getSrcValueOffset());
1875 if (Hi.Val == NULL) {
1876 // Must be int <-> float one-to-one expansion.
1881 Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2,
1882 getIntPtrConstant(IncrementSize));
1883 assert(isTypeLegal(Tmp2.getValueType()) &&
1884 "Pointers must be legal!");
1885 // FIXME: This sets the srcvalue of both halves to be the same, which is
1887 Hi = DAG.getStore(Tmp1, Hi, Tmp2, ST->getSrcValue(),
1888 ST->getSrcValueOffset());
1889 Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi);
1894 assert(isTypeLegal(ST->getValue().getValueType()) &&
1895 "Cannot handle illegal TRUNCSTORE yet!");
1896 Tmp3 = LegalizeOp(ST->getValue());
1898 // The only promote case we handle is TRUNCSTORE:i1 X into
1899 // -> TRUNCSTORE:i8 (and X, 1)
1900 if (ST->getStoredVT() == MVT::i1 &&
1901 TLI.getStoreXAction(MVT::i1) == TargetLowering::Promote) {
1902 // Promote the bool to a mask then store.
1903 Tmp3 = DAG.getNode(ISD::AND, Tmp3.getValueType(), Tmp3,
1904 DAG.getConstant(1, Tmp3.getValueType()));
1905 Result = DAG.getTruncStore(Tmp1, Tmp3, Tmp2, ST->getSrcValue(),
1906 ST->getSrcValueOffset(), MVT::i8);
1907 } else if (Tmp1 != ST->getChain() || Tmp3 != ST->getValue() ||
1908 Tmp2 != ST->getBasePtr()) {
1909 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1913 MVT::ValueType StVT = cast<StoreSDNode>(Result.Val)->getStoredVT();
1914 switch (TLI.getStoreXAction(StVT)) {
1915 default: assert(0 && "This action is not supported yet!");
1916 case TargetLowering::Legal: break;
1917 case TargetLowering::Custom:
1918 Tmp1 = TLI.LowerOperation(Result, DAG);
1919 if (Tmp1.Val) Result = Tmp1;
1926 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1927 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1929 case ISD::STACKSAVE:
1930 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1931 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1932 Tmp1 = Result.getValue(0);
1933 Tmp2 = Result.getValue(1);
1935 switch (TLI.getOperationAction(ISD::STACKSAVE, MVT::Other)) {
1936 default: assert(0 && "This action is not supported yet!");
1937 case TargetLowering::Legal: break;
1938 case TargetLowering::Custom:
1939 Tmp3 = TLI.LowerOperation(Result, DAG);
1941 Tmp1 = LegalizeOp(Tmp3);
1942 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1945 case TargetLowering::Expand:
1946 // Expand to CopyFromReg if the target set
1947 // StackPointerRegisterToSaveRestore.
1948 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
1949 Tmp1 = DAG.getCopyFromReg(Result.getOperand(0), SP,
1950 Node->getValueType(0));
1951 Tmp2 = Tmp1.getValue(1);
1953 Tmp1 = DAG.getNode(ISD::UNDEF, Node->getValueType(0));
1954 Tmp2 = Node->getOperand(0);
1959 // Since stacksave produce two values, make sure to remember that we
1960 // legalized both of them.
1961 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1962 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1963 return Op.ResNo ? Tmp2 : Tmp1;
1965 case ISD::STACKRESTORE:
1966 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1967 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1968 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1970 switch (TLI.getOperationAction(ISD::STACKRESTORE, MVT::Other)) {
1971 default: assert(0 && "This action is not supported yet!");
1972 case TargetLowering::Legal: break;
1973 case TargetLowering::Custom:
1974 Tmp1 = TLI.LowerOperation(Result, DAG);
1975 if (Tmp1.Val) Result = Tmp1;
1977 case TargetLowering::Expand:
1978 // Expand to CopyToReg if the target set
1979 // StackPointerRegisterToSaveRestore.
1980 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
1981 Result = DAG.getCopyToReg(Tmp1, SP, Tmp2);
1989 case ISD::READCYCLECOUNTER:
1990 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain
1991 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1992 switch (TLI.getOperationAction(ISD::READCYCLECOUNTER,
1993 Node->getValueType(0))) {
1994 default: assert(0 && "This action is not supported yet!");
1995 case TargetLowering::Legal:
1996 Tmp1 = Result.getValue(0);
1997 Tmp2 = Result.getValue(1);
1999 case TargetLowering::Custom:
2000 Result = TLI.LowerOperation(Result, DAG);
2001 Tmp1 = LegalizeOp(Result.getValue(0));
2002 Tmp2 = LegalizeOp(Result.getValue(1));
2006 // Since rdcc produce two values, make sure to remember that we legalized
2008 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
2009 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
2013 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2014 case Expand: assert(0 && "It's impossible to expand bools");
2016 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition.
2019 Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition.
2020 // Make sure the condition is either zero or one.
2021 if (!TLI.MaskedValueIsZero(Tmp1,
2022 MVT::getIntVTBitMask(Tmp1.getValueType())^1))
2023 Tmp1 = DAG.getZeroExtendInReg(Tmp1, MVT::i1);
2026 Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal
2027 Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal
2029 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2031 switch (TLI.getOperationAction(ISD::SELECT, Tmp2.getValueType())) {
2032 default: assert(0 && "This action is not supported yet!");
2033 case TargetLowering::Legal: break;
2034 case TargetLowering::Custom: {
2035 Tmp1 = TLI.LowerOperation(Result, DAG);
2036 if (Tmp1.Val) Result = Tmp1;
2039 case TargetLowering::Expand:
2040 if (Tmp1.getOpcode() == ISD::SETCC) {
2041 Result = DAG.getSelectCC(Tmp1.getOperand(0), Tmp1.getOperand(1),
2043 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
2045 Result = DAG.getSelectCC(Tmp1,
2046 DAG.getConstant(0, Tmp1.getValueType()),
2047 Tmp2, Tmp3, ISD::SETNE);
2050 case TargetLowering::Promote: {
2051 MVT::ValueType NVT =
2052 TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType());
2053 unsigned ExtOp, TruncOp;
2054 if (MVT::isVector(Tmp2.getValueType())) {
2055 ExtOp = ISD::BIT_CONVERT;
2056 TruncOp = ISD::BIT_CONVERT;
2057 } else if (MVT::isInteger(Tmp2.getValueType())) {
2058 ExtOp = ISD::ANY_EXTEND;
2059 TruncOp = ISD::TRUNCATE;
2061 ExtOp = ISD::FP_EXTEND;
2062 TruncOp = ISD::FP_ROUND;
2064 // Promote each of the values to the new type.
2065 Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2);
2066 Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3);
2067 // Perform the larger operation, then round down.
2068 Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3);
2069 Result = DAG.getNode(TruncOp, Node->getValueType(0), Result);
2074 case ISD::SELECT_CC: {
2075 Tmp1 = Node->getOperand(0); // LHS
2076 Tmp2 = Node->getOperand(1); // RHS
2077 Tmp3 = LegalizeOp(Node->getOperand(2)); // True
2078 Tmp4 = LegalizeOp(Node->getOperand(3)); // False
2079 SDOperand CC = Node->getOperand(4);
2081 LegalizeSetCCOperands(Tmp1, Tmp2, CC);
2083 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
2084 // the LHS is a legal SETCC itself. In this case, we need to compare
2085 // the result against zero to select between true and false values.
2086 if (Tmp2.Val == 0) {
2087 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
2088 CC = DAG.getCondCode(ISD::SETNE);
2090 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, CC);
2092 // Everything is legal, see if we should expand this op or something.
2093 switch (TLI.getOperationAction(ISD::SELECT_CC, Tmp3.getValueType())) {
2094 default: assert(0 && "This action is not supported yet!");
2095 case TargetLowering::Legal: break;
2096 case TargetLowering::Custom:
2097 Tmp1 = TLI.LowerOperation(Result, DAG);
2098 if (Tmp1.Val) Result = Tmp1;
2104 Tmp1 = Node->getOperand(0);
2105 Tmp2 = Node->getOperand(1);
2106 Tmp3 = Node->getOperand(2);
2107 LegalizeSetCCOperands(Tmp1, Tmp2, Tmp3);
2109 // If we had to Expand the SetCC operands into a SELECT node, then it may
2110 // not always be possible to return a true LHS & RHS. In this case, just
2111 // return the value we legalized, returned in the LHS
2112 if (Tmp2.Val == 0) {
2117 switch (TLI.getOperationAction(ISD::SETCC, Tmp1.getValueType())) {
2118 default: assert(0 && "Cannot handle this action for SETCC yet!");
2119 case TargetLowering::Custom:
2122 case TargetLowering::Legal:
2123 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2125 Tmp4 = TLI.LowerOperation(Result, DAG);
2126 if (Tmp4.Val) Result = Tmp4;
2129 case TargetLowering::Promote: {
2130 // First step, figure out the appropriate operation to use.
2131 // Allow SETCC to not be supported for all legal data types
2132 // Mostly this targets FP
2133 MVT::ValueType NewInTy = Node->getOperand(0).getValueType();
2134 MVT::ValueType OldVT = NewInTy; OldVT = OldVT;
2136 // Scan for the appropriate larger type to use.
2138 NewInTy = (MVT::ValueType)(NewInTy+1);
2140 assert(MVT::isInteger(NewInTy) == MVT::isInteger(OldVT) &&
2141 "Fell off of the edge of the integer world");
2142 assert(MVT::isFloatingPoint(NewInTy) == MVT::isFloatingPoint(OldVT) &&
2143 "Fell off of the edge of the floating point world");
2145 // If the target supports SETCC of this type, use it.
2146 if (TLI.isOperationLegal(ISD::SETCC, NewInTy))
2149 if (MVT::isInteger(NewInTy))
2150 assert(0 && "Cannot promote Legal Integer SETCC yet");
2152 Tmp1 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp1);
2153 Tmp2 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp2);
2155 Tmp1 = LegalizeOp(Tmp1);
2156 Tmp2 = LegalizeOp(Tmp2);
2157 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2158 Result = LegalizeOp(Result);
2161 case TargetLowering::Expand:
2162 // Expand a setcc node into a select_cc of the same condition, lhs, and
2163 // rhs that selects between const 1 (true) and const 0 (false).
2164 MVT::ValueType VT = Node->getValueType(0);
2165 Result = DAG.getNode(ISD::SELECT_CC, VT, Tmp1, Tmp2,
2166 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
2173 case ISD::MEMMOVE: {
2174 Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain
2175 Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer
2177 if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte
2178 switch (getTypeAction(Node->getOperand(2).getValueType())) {
2179 case Expand: assert(0 && "Cannot expand a byte!");
2181 Tmp3 = LegalizeOp(Node->getOperand(2));
2184 Tmp3 = PromoteOp(Node->getOperand(2));
2188 Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer,
2192 switch (getTypeAction(Node->getOperand(3).getValueType())) {
2194 // Length is too big, just take the lo-part of the length.
2196 ExpandOp(Node->getOperand(3), Tmp4, HiPart);
2200 Tmp4 = LegalizeOp(Node->getOperand(3));
2203 Tmp4 = PromoteOp(Node->getOperand(3));
2208 switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint
2209 case Expand: assert(0 && "Cannot expand this yet!");
2211 Tmp5 = LegalizeOp(Node->getOperand(4));
2214 Tmp5 = PromoteOp(Node->getOperand(4));
2218 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
2219 default: assert(0 && "This action not implemented for this operation!");
2220 case TargetLowering::Custom:
2223 case TargetLowering::Legal:
2224 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, Tmp5);
2226 Tmp1 = TLI.LowerOperation(Result, DAG);
2227 if (Tmp1.Val) Result = Tmp1;
2230 case TargetLowering::Expand: {
2231 // Otherwise, the target does not support this operation. Lower the
2232 // operation to an explicit libcall as appropriate.
2233 MVT::ValueType IntPtr = TLI.getPointerTy();
2234 const Type *IntPtrTy = TLI.getTargetData()->getIntPtrType();
2235 TargetLowering::ArgListTy Args;
2236 TargetLowering::ArgListEntry Entry;
2238 const char *FnName = 0;
2239 if (Node->getOpcode() == ISD::MEMSET) {
2240 Entry.Node = Tmp2; Entry.isSigned = false; Entry.Ty = IntPtrTy;
2241 Entry.isInReg = false; Entry.isSRet = false;
2242 Args.push_back(Entry);
2243 // Extend the (previously legalized) ubyte argument to be an int value
2245 if (Tmp3.getValueType() > MVT::i32)
2246 Tmp3 = DAG.getNode(ISD::TRUNCATE, MVT::i32, Tmp3);
2248 Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3);
2249 Entry.Node = Tmp3; Entry.Ty = Type::Int32Ty; Entry.isSigned = true;
2250 Entry.isInReg = false; Entry.isSRet = false;
2251 Args.push_back(Entry);
2252 Entry.Node = Tmp4; Entry.Ty = IntPtrTy; Entry.isSigned = false;
2253 Args.push_back(Entry);
2256 } else if (Node->getOpcode() == ISD::MEMCPY ||
2257 Node->getOpcode() == ISD::MEMMOVE) {
2258 Entry.Ty = IntPtrTy;
2259 Entry.isSigned = false; Entry.isInReg = false; Entry.isSRet = false;
2260 Entry.Node = Tmp2; Args.push_back(Entry);
2261 Entry.Node = Tmp3; Args.push_back(Entry);
2262 Entry.Node = Tmp4; Args.push_back(Entry);
2263 FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy";
2265 assert(0 && "Unknown op!");
2268 std::pair<SDOperand,SDOperand> CallResult =
2269 TLI.LowerCallTo(Tmp1, Type::VoidTy, false, false, CallingConv::C, false,
2270 DAG.getExternalSymbol(FnName, IntPtr), Args, DAG);
2271 Result = CallResult.second;
2278 case ISD::SHL_PARTS:
2279 case ISD::SRA_PARTS:
2280 case ISD::SRL_PARTS: {
2281 SmallVector<SDOperand, 8> Ops;
2282 bool Changed = false;
2283 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
2284 Ops.push_back(LegalizeOp(Node->getOperand(i)));
2285 Changed |= Ops.back() != Node->getOperand(i);
2288 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
2290 switch (TLI.getOperationAction(Node->getOpcode(),
2291 Node->getValueType(0))) {
2292 default: assert(0 && "This action is not supported yet!");
2293 case TargetLowering::Legal: break;
2294 case TargetLowering::Custom:
2295 Tmp1 = TLI.LowerOperation(Result, DAG);
2297 SDOperand Tmp2, RetVal(0, 0);
2298 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
2299 Tmp2 = LegalizeOp(Tmp1.getValue(i));
2300 AddLegalizedOperand(SDOperand(Node, i), Tmp2);
2304 assert(RetVal.Val && "Illegal result number");
2310 // Since these produce multiple values, make sure to remember that we
2311 // legalized all of them.
2312 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
2313 AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i));
2314 return Result.getValue(Op.ResNo);
2335 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2336 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2337 case Expand: assert(0 && "Not possible");
2339 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2342 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2346 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2348 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2349 default: assert(0 && "BinOp legalize operation not supported");
2350 case TargetLowering::Legal: break;
2351 case TargetLowering::Custom:
2352 Tmp1 = TLI.LowerOperation(Result, DAG);
2353 if (Tmp1.Val) Result = Tmp1;
2355 case TargetLowering::Expand: {
2356 if (Node->getValueType(0) == MVT::i32) {
2357 switch (Node->getOpcode()) {
2358 default: assert(0 && "Do not know how to expand this integer BinOp!");
2361 RTLIB::Libcall LC = Node->getOpcode() == ISD::UDIV
2362 ? RTLIB::UDIV_I32 : RTLIB::SDIV_I32;
2364 bool isSigned = Node->getOpcode() == ISD::SDIV;
2365 Result = ExpandLibCall(TLI.getLibcallName(LC), Node, isSigned, Dummy);
2370 assert(MVT::isVector(Node->getValueType(0)) &&
2371 "Cannot expand this binary operator!");
2372 // Expand the operation into a bunch of nasty scalar code.
2373 SmallVector<SDOperand, 8> Ops;
2374 MVT::ValueType EltVT = MVT::getVectorBaseType(Node->getValueType(0));
2375 MVT::ValueType PtrVT = TLI.getPointerTy();
2376 for (unsigned i = 0, e = MVT::getVectorNumElements(Node->getValueType(0));
2378 SDOperand Idx = DAG.getConstant(i, PtrVT);
2379 SDOperand LHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1, Idx);
2380 SDOperand RHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2, Idx);
2381 Ops.push_back(DAG.getNode(Node->getOpcode(), EltVT, LHS, RHS));
2383 Result = DAG.getNode(ISD::BUILD_VECTOR, Node->getValueType(0),
2384 &Ops[0], Ops.size());
2387 case TargetLowering::Promote: {
2388 switch (Node->getOpcode()) {
2389 default: assert(0 && "Do not know how to promote this BinOp!");
2393 MVT::ValueType OVT = Node->getValueType(0);
2394 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2395 assert(MVT::isVector(OVT) && "Cannot promote this BinOp!");
2396 // Bit convert each of the values to the new type.
2397 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
2398 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
2399 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2400 // Bit convert the result back the original type.
2401 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
2409 case ISD::FCOPYSIGN: // FCOPYSIGN does not require LHS/RHS to match type!
2410 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2411 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2412 case Expand: assert(0 && "Not possible");
2414 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2417 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2421 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2423 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2424 default: assert(0 && "Operation not supported");
2425 case TargetLowering::Custom:
2426 Tmp1 = TLI.LowerOperation(Result, DAG);
2427 if (Tmp1.Val) Result = Tmp1;
2429 case TargetLowering::Legal: break;
2430 case TargetLowering::Expand: {
2431 // If this target supports fabs/fneg natively and select is cheap,
2432 // do this efficiently.
2433 if (!TLI.isSelectExpensive() &&
2434 TLI.getOperationAction(ISD::FABS, Tmp1.getValueType()) ==
2435 TargetLowering::Legal &&
2436 TLI.getOperationAction(ISD::FNEG, Tmp1.getValueType()) ==
2437 TargetLowering::Legal) {
2438 // Get the sign bit of the RHS.
2439 MVT::ValueType IVT =
2440 Tmp2.getValueType() == MVT::f32 ? MVT::i32 : MVT::i64;
2441 SDOperand SignBit = DAG.getNode(ISD::BIT_CONVERT, IVT, Tmp2);
2442 SignBit = DAG.getSetCC(TLI.getSetCCResultTy(),
2443 SignBit, DAG.getConstant(0, IVT), ISD::SETLT);
2444 // Get the absolute value of the result.
2445 SDOperand AbsVal = DAG.getNode(ISD::FABS, Tmp1.getValueType(), Tmp1);
2446 // Select between the nabs and abs value based on the sign bit of
2448 Result = DAG.getNode(ISD::SELECT, AbsVal.getValueType(), SignBit,
2449 DAG.getNode(ISD::FNEG, AbsVal.getValueType(),
2452 Result = LegalizeOp(Result);
2456 // Otherwise, do bitwise ops!
2457 MVT::ValueType NVT =
2458 Node->getValueType(0) == MVT::f32 ? MVT::i32 : MVT::i64;
2459 Result = ExpandFCOPYSIGNToBitwiseOps(Node, NVT, DAG, TLI);
2460 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0), Result);
2461 Result = LegalizeOp(Result);
2469 Tmp1 = LegalizeOp(Node->getOperand(0));
2470 Tmp2 = LegalizeOp(Node->getOperand(1));
2471 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2472 // Since this produces two values, make sure to remember that we legalized
2474 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2475 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2480 Tmp1 = LegalizeOp(Node->getOperand(0));
2481 Tmp2 = LegalizeOp(Node->getOperand(1));
2482 Tmp3 = LegalizeOp(Node->getOperand(2));
2483 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2484 // Since this produces two values, make sure to remember that we legalized
2486 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2487 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2490 case ISD::BUILD_PAIR: {
2491 MVT::ValueType PairTy = Node->getValueType(0);
2492 // TODO: handle the case where the Lo and Hi operands are not of legal type
2493 Tmp1 = LegalizeOp(Node->getOperand(0)); // Lo
2494 Tmp2 = LegalizeOp(Node->getOperand(1)); // Hi
2495 switch (TLI.getOperationAction(ISD::BUILD_PAIR, PairTy)) {
2496 case TargetLowering::Promote:
2497 case TargetLowering::Custom:
2498 assert(0 && "Cannot promote/custom this yet!");
2499 case TargetLowering::Legal:
2500 if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1))
2501 Result = DAG.getNode(ISD::BUILD_PAIR, PairTy, Tmp1, Tmp2);
2503 case TargetLowering::Expand:
2504 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, PairTy, Tmp1);
2505 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, PairTy, Tmp2);
2506 Tmp2 = DAG.getNode(ISD::SHL, PairTy, Tmp2,
2507 DAG.getConstant(MVT::getSizeInBits(PairTy)/2,
2508 TLI.getShiftAmountTy()));
2509 Result = DAG.getNode(ISD::OR, PairTy, Tmp1, Tmp2);
2518 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2519 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
2521 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2522 case TargetLowering::Promote: assert(0 && "Cannot promote this yet!");
2523 case TargetLowering::Custom:
2526 case TargetLowering::Legal:
2527 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2529 Tmp1 = TLI.LowerOperation(Result, DAG);
2530 if (Tmp1.Val) Result = Tmp1;
2533 case TargetLowering::Expand:
2534 unsigned DivOpc= (Node->getOpcode() == ISD::UREM) ? ISD::UDIV : ISD::SDIV;
2535 bool isSigned = DivOpc == ISD::SDIV;
2536 if (MVT::isInteger(Node->getValueType(0))) {
2537 if (TLI.getOperationAction(DivOpc, Node->getValueType(0)) ==
2538 TargetLowering::Legal) {
2540 MVT::ValueType VT = Node->getValueType(0);
2541 Result = DAG.getNode(DivOpc, VT, Tmp1, Tmp2);
2542 Result = DAG.getNode(ISD::MUL, VT, Result, Tmp2);
2543 Result = DAG.getNode(ISD::SUB, VT, Tmp1, Result);
2545 assert(Node->getValueType(0) == MVT::i32 &&
2546 "Cannot expand this binary operator!");
2547 RTLIB::Libcall LC = Node->getOpcode() == ISD::UREM
2548 ? RTLIB::UREM_I32 : RTLIB::SREM_I32;
2550 Result = ExpandLibCall(TLI.getLibcallName(LC), Node, isSigned, Dummy);
2553 // Floating point mod -> fmod libcall.
2554 RTLIB::Libcall LC = Node->getValueType(0) == MVT::f32
2555 ? RTLIB::REM_F32 : RTLIB::REM_F64;
2557 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
2558 false/*sign irrelevant*/, Dummy);
2564 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2565 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2567 MVT::ValueType VT = Node->getValueType(0);
2568 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
2569 default: assert(0 && "This action is not supported yet!");
2570 case TargetLowering::Custom:
2573 case TargetLowering::Legal:
2574 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2575 Result = Result.getValue(0);
2576 Tmp1 = Result.getValue(1);
2579 Tmp2 = TLI.LowerOperation(Result, DAG);
2581 Result = LegalizeOp(Tmp2);
2582 Tmp1 = LegalizeOp(Tmp2.getValue(1));
2586 case TargetLowering::Expand: {
2587 SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2));
2588 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
2589 SV->getValue(), SV->getOffset());
2590 // Increment the pointer, VAList, to the next vaarg
2591 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
2592 DAG.getConstant(MVT::getSizeInBits(VT)/8,
2593 TLI.getPointerTy()));
2594 // Store the incremented VAList to the legalized pointer
2595 Tmp3 = DAG.getStore(VAList.getValue(1), Tmp3, Tmp2, SV->getValue(),
2597 // Load the actual argument out of the pointer VAList
2598 Result = DAG.getLoad(VT, Tmp3, VAList, NULL, 0);
2599 Tmp1 = LegalizeOp(Result.getValue(1));
2600 Result = LegalizeOp(Result);
2604 // Since VAARG produces two values, make sure to remember that we
2605 // legalized both of them.
2606 AddLegalizedOperand(SDOperand(Node, 0), Result);
2607 AddLegalizedOperand(SDOperand(Node, 1), Tmp1);
2608 return Op.ResNo ? Tmp1 : Result;
2612 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2613 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the dest pointer.
2614 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the source pointer.
2616 switch (TLI.getOperationAction(ISD::VACOPY, MVT::Other)) {
2617 default: assert(0 && "This action is not supported yet!");
2618 case TargetLowering::Custom:
2621 case TargetLowering::Legal:
2622 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
2623 Node->getOperand(3), Node->getOperand(4));
2625 Tmp1 = TLI.LowerOperation(Result, DAG);
2626 if (Tmp1.Val) Result = Tmp1;
2629 case TargetLowering::Expand:
2630 // This defaults to loading a pointer from the input and storing it to the
2631 // output, returning the chain.
2632 SrcValueSDNode *SVD = cast<SrcValueSDNode>(Node->getOperand(3));
2633 SrcValueSDNode *SVS = cast<SrcValueSDNode>(Node->getOperand(4));
2634 Tmp4 = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp3, SVD->getValue(),
2636 Result = DAG.getStore(Tmp4.getValue(1), Tmp4, Tmp2, SVS->getValue(),
2643 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2644 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2646 switch (TLI.getOperationAction(ISD::VAEND, MVT::Other)) {
2647 default: assert(0 && "This action is not supported yet!");
2648 case TargetLowering::Custom:
2651 case TargetLowering::Legal:
2652 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2654 Tmp1 = TLI.LowerOperation(Tmp1, DAG);
2655 if (Tmp1.Val) Result = Tmp1;
2658 case TargetLowering::Expand:
2659 Result = Tmp1; // Default to a no-op, return the chain
2665 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2666 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2668 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2670 switch (TLI.getOperationAction(ISD::VASTART, MVT::Other)) {
2671 default: assert(0 && "This action is not supported yet!");
2672 case TargetLowering::Legal: break;
2673 case TargetLowering::Custom:
2674 Tmp1 = TLI.LowerOperation(Result, DAG);
2675 if (Tmp1.Val) Result = Tmp1;
2682 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2683 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
2685 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
2686 "Cannot handle this yet!");
2687 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2691 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
2692 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2693 case TargetLowering::Custom:
2694 assert(0 && "Cannot custom legalize this yet!");
2695 case TargetLowering::Legal:
2696 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2698 case TargetLowering::Promote: {
2699 MVT::ValueType OVT = Tmp1.getValueType();
2700 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2701 unsigned DiffBits = getSizeInBits(NVT) - getSizeInBits(OVT);
2703 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2704 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
2705 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
2706 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
2709 case TargetLowering::Expand:
2710 Result = ExpandBSWAP(Tmp1);
2718 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
2719 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2720 case TargetLowering::Custom: assert(0 && "Cannot custom handle this yet!");
2721 case TargetLowering::Legal:
2722 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2724 case TargetLowering::Promote: {
2725 MVT::ValueType OVT = Tmp1.getValueType();
2726 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2728 // Zero extend the argument.
2729 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2730 // Perform the larger operation, then subtract if needed.
2731 Tmp1 = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1);
2732 switch (Node->getOpcode()) {
2737 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
2738 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
2739 DAG.getConstant(getSizeInBits(NVT), NVT),
2741 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
2742 DAG.getConstant(getSizeInBits(OVT),NVT), Tmp1);
2745 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
2746 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
2747 DAG.getConstant(getSizeInBits(NVT) -
2748 getSizeInBits(OVT), NVT));
2753 case TargetLowering::Expand:
2754 Result = ExpandBitCount(Node->getOpcode(), Tmp1);
2765 Tmp1 = LegalizeOp(Node->getOperand(0));
2766 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2767 case TargetLowering::Promote:
2768 case TargetLowering::Custom:
2771 case TargetLowering::Legal:
2772 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2774 Tmp1 = TLI.LowerOperation(Result, DAG);
2775 if (Tmp1.Val) Result = Tmp1;
2778 case TargetLowering::Expand:
2779 switch (Node->getOpcode()) {
2780 default: assert(0 && "Unreachable!");
2782 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
2783 Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0));
2784 Result = DAG.getNode(ISD::FSUB, Node->getValueType(0), Tmp2, Tmp1);
2787 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
2788 MVT::ValueType VT = Node->getValueType(0);
2789 Tmp2 = DAG.getConstantFP(0.0, VT);
2790 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, Tmp2, ISD::SETUGT);
2791 Tmp3 = DAG.getNode(ISD::FNEG, VT, Tmp1);
2792 Result = DAG.getNode(ISD::SELECT, VT, Tmp2, Tmp1, Tmp3);
2798 MVT::ValueType VT = Node->getValueType(0);
2799 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2800 switch(Node->getOpcode()) {
2802 LC = VT == MVT::f32 ? RTLIB::SQRT_F32 : RTLIB::SQRT_F64;
2805 LC = VT == MVT::f32 ? RTLIB::SIN_F32 : RTLIB::SIN_F64;
2808 LC = VT == MVT::f32 ? RTLIB::COS_F32 : RTLIB::COS_F64;
2810 default: assert(0 && "Unreachable!");
2813 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
2814 false/*sign irrelevant*/, Dummy);
2822 // We always lower FPOWI into a libcall. No target support it yet.
2823 RTLIB::Libcall LC = Node->getValueType(0) == MVT::f32
2824 ? RTLIB::POWI_F32 : RTLIB::POWI_F64;
2826 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
2827 false/*sign irrelevant*/, Dummy);
2830 case ISD::BIT_CONVERT:
2831 if (!isTypeLegal(Node->getOperand(0).getValueType())) {
2832 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2834 switch (TLI.getOperationAction(ISD::BIT_CONVERT,
2835 Node->getOperand(0).getValueType())) {
2836 default: assert(0 && "Unknown operation action!");
2837 case TargetLowering::Expand:
2838 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2840 case TargetLowering::Legal:
2841 Tmp1 = LegalizeOp(Node->getOperand(0));
2842 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2847 case ISD::VBIT_CONVERT: {
2848 assert(Op.getOperand(0).getValueType() == MVT::Vector &&
2849 "Can only have VBIT_CONVERT where input or output is MVT::Vector!");
2851 // The input has to be a vector type, we have to either scalarize it, pack
2852 // it, or convert it based on whether the input vector type is legal.
2853 SDNode *InVal = Node->getOperand(0).Val;
2855 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
2856 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
2858 // Figure out if there is a Packed type corresponding to this Vector
2859 // type. If so, convert to the vector type.
2860 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
2861 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
2862 // Turn this into a bit convert of the packed input.
2863 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
2864 PackVectorOp(Node->getOperand(0), TVT));
2866 } else if (NumElems == 1) {
2867 // Turn this into a bit convert of the scalar input.
2868 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
2869 PackVectorOp(Node->getOperand(0), EVT));
2872 // FIXME: UNIMP! Store then reload
2873 assert(0 && "Cast from unsupported vector type not implemented yet!");
2877 // Conversion operators. The source and destination have different types.
2878 case ISD::SINT_TO_FP:
2879 case ISD::UINT_TO_FP: {
2880 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
2881 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2883 switch (TLI.getOperationAction(Node->getOpcode(),
2884 Node->getOperand(0).getValueType())) {
2885 default: assert(0 && "Unknown operation action!");
2886 case TargetLowering::Custom:
2889 case TargetLowering::Legal:
2890 Tmp1 = LegalizeOp(Node->getOperand(0));
2891 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2893 Tmp1 = TLI.LowerOperation(Result, DAG);
2894 if (Tmp1.Val) Result = Tmp1;
2897 case TargetLowering::Expand:
2898 Result = ExpandLegalINT_TO_FP(isSigned,
2899 LegalizeOp(Node->getOperand(0)),
2900 Node->getValueType(0));
2902 case TargetLowering::Promote:
2903 Result = PromoteLegalINT_TO_FP(LegalizeOp(Node->getOperand(0)),
2904 Node->getValueType(0),
2910 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP,
2911 Node->getValueType(0), Node->getOperand(0));
2914 Tmp1 = PromoteOp(Node->getOperand(0));
2916 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp1.getValueType(),
2917 Tmp1, DAG.getValueType(Node->getOperand(0).getValueType()));
2919 Tmp1 = DAG.getZeroExtendInReg(Tmp1,
2920 Node->getOperand(0).getValueType());
2922 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2923 Result = LegalizeOp(Result); // The 'op' is not necessarily legal!
2929 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2931 Tmp1 = LegalizeOp(Node->getOperand(0));
2932 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2935 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2937 // Since the result is legal, we should just be able to truncate the low
2938 // part of the source.
2939 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1);
2942 Result = PromoteOp(Node->getOperand(0));
2943 Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result);
2948 case ISD::FP_TO_SINT:
2949 case ISD::FP_TO_UINT:
2950 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2952 Tmp1 = LegalizeOp(Node->getOperand(0));
2954 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))){
2955 default: assert(0 && "Unknown operation action!");
2956 case TargetLowering::Custom:
2959 case TargetLowering::Legal:
2960 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2962 Tmp1 = TLI.LowerOperation(Result, DAG);
2963 if (Tmp1.Val) Result = Tmp1;
2966 case TargetLowering::Promote:
2967 Result = PromoteLegalFP_TO_INT(Tmp1, Node->getValueType(0),
2968 Node->getOpcode() == ISD::FP_TO_SINT);
2970 case TargetLowering::Expand:
2971 if (Node->getOpcode() == ISD::FP_TO_UINT) {
2972 SDOperand True, False;
2973 MVT::ValueType VT = Node->getOperand(0).getValueType();
2974 MVT::ValueType NVT = Node->getValueType(0);
2975 unsigned ShiftAmt = MVT::getSizeInBits(Node->getValueType(0))-1;
2976 Tmp2 = DAG.getConstantFP((double)(1ULL << ShiftAmt), VT);
2977 Tmp3 = DAG.getSetCC(TLI.getSetCCResultTy(),
2978 Node->getOperand(0), Tmp2, ISD::SETLT);
2979 True = DAG.getNode(ISD::FP_TO_SINT, NVT, Node->getOperand(0));
2980 False = DAG.getNode(ISD::FP_TO_SINT, NVT,
2981 DAG.getNode(ISD::FSUB, VT, Node->getOperand(0),
2983 False = DAG.getNode(ISD::XOR, NVT, False,
2984 DAG.getConstant(1ULL << ShiftAmt, NVT));
2985 Result = DAG.getNode(ISD::SELECT, NVT, Tmp3, True, False);
2988 assert(0 && "Do not know how to expand FP_TO_SINT yet!");
2994 // Convert f32 / f64 to i32 / i64.
2995 MVT::ValueType VT = Op.getValueType();
2996 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
2997 switch (Node->getOpcode()) {
2998 case ISD::FP_TO_SINT:
2999 if (Node->getOperand(0).getValueType() == MVT::f32)
3000 LC = (VT == MVT::i32)
3001 ? RTLIB::FPTOSINT_F32_I32 : RTLIB::FPTOSINT_F32_I64;
3003 LC = (VT == MVT::i32)
3004 ? RTLIB::FPTOSINT_F64_I32 : RTLIB::FPTOSINT_F64_I64;
3006 case ISD::FP_TO_UINT:
3007 if (Node->getOperand(0).getValueType() == MVT::f32)
3008 LC = (VT == MVT::i32)
3009 ? RTLIB::FPTOUINT_F32_I32 : RTLIB::FPTOSINT_F32_I64;
3011 LC = (VT == MVT::i32)
3012 ? RTLIB::FPTOUINT_F64_I32 : RTLIB::FPTOSINT_F64_I64;
3014 default: assert(0 && "Unreachable!");
3017 Result = ExpandLibCall(TLI.getLibcallName(LC), Node,
3018 false/*sign irrelevant*/, Dummy);
3022 Tmp1 = PromoteOp(Node->getOperand(0));
3023 Result = DAG.UpdateNodeOperands(Result, LegalizeOp(Tmp1));
3024 Result = LegalizeOp(Result);
3029 case ISD::ANY_EXTEND:
3030 case ISD::ZERO_EXTEND:
3031 case ISD::SIGN_EXTEND:
3032 case ISD::FP_EXTEND:
3034 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3035 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
3037 Tmp1 = LegalizeOp(Node->getOperand(0));
3038 Result = DAG.UpdateNodeOperands(Result, Tmp1);
3041 switch (Node->getOpcode()) {
3042 case ISD::ANY_EXTEND:
3043 Tmp1 = PromoteOp(Node->getOperand(0));
3044 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Tmp1);
3046 case ISD::ZERO_EXTEND:
3047 Result = PromoteOp(Node->getOperand(0));
3048 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
3049 Result = DAG.getZeroExtendInReg(Result,
3050 Node->getOperand(0).getValueType());
3052 case ISD::SIGN_EXTEND:
3053 Result = PromoteOp(Node->getOperand(0));
3054 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
3055 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
3057 DAG.getValueType(Node->getOperand(0).getValueType()));
3059 case ISD::FP_EXTEND:
3060 Result = PromoteOp(Node->getOperand(0));
3061 if (Result.getValueType() != Op.getValueType())
3062 // Dynamically dead while we have only 2 FP types.
3063 Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result);
3066 Result = PromoteOp(Node->getOperand(0));
3067 Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result);
3072 case ISD::FP_ROUND_INREG:
3073 case ISD::SIGN_EXTEND_INREG: {
3074 Tmp1 = LegalizeOp(Node->getOperand(0));
3075 MVT::ValueType ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
3077 // If this operation is not supported, convert it to a shl/shr or load/store
3079 switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) {
3080 default: assert(0 && "This action not supported for this op yet!");
3081 case TargetLowering::Legal:
3082 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
3084 case TargetLowering::Expand:
3085 // If this is an integer extend and shifts are supported, do that.
3086 if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) {
3087 // NOTE: we could fall back on load/store here too for targets without
3088 // SAR. However, it is doubtful that any exist.
3089 unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) -
3090 MVT::getSizeInBits(ExtraVT);
3091 SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy());
3092 Result = DAG.getNode(ISD::SHL, Node->getValueType(0),
3093 Node->getOperand(0), ShiftCst);
3094 Result = DAG.getNode(ISD::SRA, Node->getValueType(0),
3096 } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) {
3097 // The only way we can lower this is to turn it into a TRUNCSTORE,
3098 // EXTLOAD pair, targetting a temporary location (a stack slot).
3100 // NOTE: there is a choice here between constantly creating new stack
3101 // slots and always reusing the same one. We currently always create
3102 // new ones, as reuse may inhibit scheduling.
3103 const Type *Ty = MVT::getTypeForValueType(ExtraVT);
3104 unsigned TySize = (unsigned)TLI.getTargetData()->getTypeSize(Ty);
3105 unsigned Align = TLI.getTargetData()->getPrefTypeAlignment(Ty);
3106 MachineFunction &MF = DAG.getMachineFunction();
3108 MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align);
3109 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
3110 Result = DAG.getTruncStore(DAG.getEntryNode(), Node->getOperand(0),
3111 StackSlot, NULL, 0, ExtraVT);
3112 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
3113 Result, StackSlot, NULL, 0, ExtraVT);
3115 assert(0 && "Unknown op");
3123 assert(Result.getValueType() == Op.getValueType() &&
3124 "Bad legalization!");
3126 // Make sure that the generated code is itself legal.
3128 Result = LegalizeOp(Result);
3130 // Note that LegalizeOp may be reentered even from single-use nodes, which
3131 // means that we always must cache transformed nodes.
3132 AddLegalizedOperand(Op, Result);
3136 /// PromoteOp - Given an operation that produces a value in an invalid type,
3137 /// promote it to compute the value into a larger type. The produced value will
3138 /// have the correct bits for the low portion of the register, but no guarantee
3139 /// is made about the top bits: it may be zero, sign-extended, or garbage.
3140 SDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) {
3141 MVT::ValueType VT = Op.getValueType();
3142 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
3143 assert(getTypeAction(VT) == Promote &&
3144 "Caller should expand or legalize operands that are not promotable!");
3145 assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) &&
3146 "Cannot promote to smaller type!");
3148 SDOperand Tmp1, Tmp2, Tmp3;
3150 SDNode *Node = Op.Val;
3152 DenseMap<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op);
3153 if (I != PromotedNodes.end()) return I->second;
3155 switch (Node->getOpcode()) {
3156 case ISD::CopyFromReg:
3157 assert(0 && "CopyFromReg must be legal!");
3160 cerr << "NODE: "; Node->dump(); cerr << "\n";
3162 assert(0 && "Do not know how to promote this operator!");
3165 Result = DAG.getNode(ISD::UNDEF, NVT);
3169 Result = DAG.getNode(ISD::SIGN_EXTEND, NVT, Op);
3171 Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op);
3172 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?");
3174 case ISD::ConstantFP:
3175 Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op);
3176 assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?");
3180 assert(isTypeLegal(TLI.getSetCCResultTy()) && "SetCC type is not legal??");
3181 Result = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(),Node->getOperand(0),
3182 Node->getOperand(1), Node->getOperand(2));
3186 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3188 Result = LegalizeOp(Node->getOperand(0));
3189 assert(Result.getValueType() >= NVT &&
3190 "This truncation doesn't make sense!");
3191 if (Result.getValueType() > NVT) // Truncate to NVT instead of VT
3192 Result = DAG.getNode(ISD::TRUNCATE, NVT, Result);
3195 // The truncation is not required, because we don't guarantee anything
3196 // about high bits anyway.
3197 Result = PromoteOp(Node->getOperand(0));
3200 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
3201 // Truncate the low part of the expanded value to the result type
3202 Result = DAG.getNode(ISD::TRUNCATE, NVT, Tmp1);
3205 case ISD::SIGN_EXTEND:
3206 case ISD::ZERO_EXTEND:
3207 case ISD::ANY_EXTEND:
3208 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3209 case Expand: assert(0 && "BUG: Smaller reg should have been promoted!");
3211 // Input is legal? Just do extend all the way to the larger type.
3212 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
3215 // Promote the reg if it's smaller.
3216 Result = PromoteOp(Node->getOperand(0));
3217 // The high bits are not guaranteed to be anything. Insert an extend.
3218 if (Node->getOpcode() == ISD::SIGN_EXTEND)
3219 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
3220 DAG.getValueType(Node->getOperand(0).getValueType()));
3221 else if (Node->getOpcode() == ISD::ZERO_EXTEND)
3222 Result = DAG.getZeroExtendInReg(Result,
3223 Node->getOperand(0).getValueType());
3227 case ISD::BIT_CONVERT:
3228 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
3229 Result = PromoteOp(Result);
3232 case ISD::FP_EXTEND:
3233 assert(0 && "Case not implemented. Dynamically dead with 2 FP types!");
3235 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3236 case Expand: assert(0 && "BUG: Cannot expand FP regs!");
3237 case Promote: assert(0 && "Unreachable with 2 FP types!");
3239 // Input is legal? Do an FP_ROUND_INREG.
3240 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Node->getOperand(0),
3241 DAG.getValueType(VT));
3246 case ISD::SINT_TO_FP:
3247 case ISD::UINT_TO_FP:
3248 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3250 // No extra round required here.
3251 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
3255 Result = PromoteOp(Node->getOperand(0));
3256 if (Node->getOpcode() == ISD::SINT_TO_FP)
3257 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
3259 DAG.getValueType(Node->getOperand(0).getValueType()));
3261 Result = DAG.getZeroExtendInReg(Result,
3262 Node->getOperand(0).getValueType());
3263 // No extra round required here.
3264 Result = DAG.getNode(Node->getOpcode(), NVT, Result);
3267 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT,
3268 Node->getOperand(0));
3269 // Round if we cannot tolerate excess precision.
3270 if (NoExcessFPPrecision)
3271 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3272 DAG.getValueType(VT));
3277 case ISD::SIGN_EXTEND_INREG:
3278 Result = PromoteOp(Node->getOperand(0));
3279 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
3280 Node->getOperand(1));
3282 case ISD::FP_TO_SINT:
3283 case ISD::FP_TO_UINT:
3284 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3287 Tmp1 = Node->getOperand(0);
3290 // The input result is prerounded, so we don't have to do anything
3292 Tmp1 = PromoteOp(Node->getOperand(0));
3295 // If we're promoting a UINT to a larger size, check to see if the new node
3296 // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since
3297 // we can use that instead. This allows us to generate better code for
3298 // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not
3299 // legal, such as PowerPC.
3300 if (Node->getOpcode() == ISD::FP_TO_UINT &&
3301 !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) &&
3302 (TLI.isOperationLegal(ISD::FP_TO_SINT, NVT) ||
3303 TLI.getOperationAction(ISD::FP_TO_SINT, NVT)==TargetLowering::Custom)){
3304 Result = DAG.getNode(ISD::FP_TO_SINT, NVT, Tmp1);
3306 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3312 Tmp1 = PromoteOp(Node->getOperand(0));
3313 assert(Tmp1.getValueType() == NVT);
3314 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3315 // NOTE: we do not have to do any extra rounding here for
3316 // NoExcessFPPrecision, because we know the input will have the appropriate
3317 // precision, and these operations don't modify precision at all.
3323 Tmp1 = PromoteOp(Node->getOperand(0));
3324 assert(Tmp1.getValueType() == NVT);
3325 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3326 if (NoExcessFPPrecision)
3327 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3328 DAG.getValueType(VT));
3332 // Promote f32 powi to f64 powi. Note that this could insert a libcall
3333 // directly as well, which may be better.
3334 Tmp1 = PromoteOp(Node->getOperand(0));
3335 assert(Tmp1.getValueType() == NVT);
3336 Result = DAG.getNode(ISD::FPOWI, NVT, Tmp1, Node->getOperand(1));
3337 if (NoExcessFPPrecision)
3338 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3339 DAG.getValueType(VT));
3349 // The input may have strange things in the top bits of the registers, but
3350 // these operations don't care. They may have weird bits going out, but
3351 // that too is okay if they are integer operations.
3352 Tmp1 = PromoteOp(Node->getOperand(0));
3353 Tmp2 = PromoteOp(Node->getOperand(1));
3354 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3355 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3360 Tmp1 = PromoteOp(Node->getOperand(0));
3361 Tmp2 = PromoteOp(Node->getOperand(1));
3362 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3363 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3365 // Floating point operations will give excess precision that we may not be
3366 // able to tolerate. If we DO allow excess precision, just leave it,
3367 // otherwise excise it.
3368 // FIXME: Why would we need to round FP ops more than integer ones?
3369 // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C))
3370 if (NoExcessFPPrecision)
3371 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3372 DAG.getValueType(VT));
3377 // These operators require that their input be sign extended.
3378 Tmp1 = PromoteOp(Node->getOperand(0));
3379 Tmp2 = PromoteOp(Node->getOperand(1));
3380 if (MVT::isInteger(NVT)) {
3381 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3382 DAG.getValueType(VT));
3383 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
3384 DAG.getValueType(VT));
3386 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3388 // Perform FP_ROUND: this is probably overly pessimistic.
3389 if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision)
3390 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3391 DAG.getValueType(VT));
3395 case ISD::FCOPYSIGN:
3396 // These operators require that their input be fp extended.
3397 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3399 Tmp1 = LegalizeOp(Node->getOperand(0));
3402 Tmp1 = PromoteOp(Node->getOperand(0));
3405 assert(0 && "not implemented");
3407 switch (getTypeAction(Node->getOperand(1).getValueType())) {
3409 Tmp2 = LegalizeOp(Node->getOperand(1));
3412 Tmp2 = PromoteOp(Node->getOperand(1));
3415 assert(0 && "not implemented");
3417 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3419 // Perform FP_ROUND: this is probably overly pessimistic.
3420 if (NoExcessFPPrecision && Node->getOpcode() != ISD::FCOPYSIGN)
3421 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3422 DAG.getValueType(VT));
3427 // These operators require that their input be zero extended.
3428 Tmp1 = PromoteOp(Node->getOperand(0));
3429 Tmp2 = PromoteOp(Node->getOperand(1));
3430 assert(MVT::isInteger(NVT) && "Operators don't apply to FP!");
3431 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3432 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
3433 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3437 Tmp1 = PromoteOp(Node->getOperand(0));
3438 Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Node->getOperand(1));
3441 // The input value must be properly sign extended.
3442 Tmp1 = PromoteOp(Node->getOperand(0));
3443 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3444 DAG.getValueType(VT));
3445 Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Node->getOperand(1));
3448 // The input value must be properly zero extended.
3449 Tmp1 = PromoteOp(Node->getOperand(0));
3450 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3451 Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Node->getOperand(1));
3455 Tmp1 = Node->getOperand(0); // Get the chain.
3456 Tmp2 = Node->getOperand(1); // Get the pointer.
3457 if (TLI.getOperationAction(ISD::VAARG, VT) == TargetLowering::Custom) {
3458 Tmp3 = DAG.getVAArg(VT, Tmp1, Tmp2, Node->getOperand(2));
3459 Result = TLI.CustomPromoteOperation(Tmp3, DAG);
3461 SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2));
3462 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
3463 SV->getValue(), SV->getOffset());
3464 // Increment the pointer, VAList, to the next vaarg
3465 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
3466 DAG.getConstant(MVT::getSizeInBits(VT)/8,
3467 TLI.getPointerTy()));
3468 // Store the incremented VAList to the legalized pointer
3469 Tmp3 = DAG.getStore(VAList.getValue(1), Tmp3, Tmp2, SV->getValue(),
3471 // Load the actual argument out of the pointer VAList
3472 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Tmp3, VAList, NULL, 0, VT);
3474 // Remember that we legalized the chain.
3475 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
3479 LoadSDNode *LD = cast<LoadSDNode>(Node);
3480 ISD::LoadExtType ExtType = ISD::isNON_EXTLoad(Node)
3481 ? ISD::EXTLOAD : LD->getExtensionType();
3482 Result = DAG.getExtLoad(ExtType, NVT,
3483 LD->getChain(), LD->getBasePtr(),
3484 LD->getSrcValue(), LD->getSrcValueOffset(),
3486 // Remember that we legalized the chain.
3487 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
3491 Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0
3492 Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1
3493 Result = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), Tmp2, Tmp3);
3495 case ISD::SELECT_CC:
3496 Tmp2 = PromoteOp(Node->getOperand(2)); // True
3497 Tmp3 = PromoteOp(Node->getOperand(3)); // False
3498 Result = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
3499 Node->getOperand(1), Tmp2, Tmp3, Node->getOperand(4));
3502 Tmp1 = Node->getOperand(0);
3503 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
3504 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
3505 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
3506 DAG.getConstant(getSizeInBits(NVT) - getSizeInBits(VT),
3507 TLI.getShiftAmountTy()));
3512 // Zero extend the argument
3513 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
3514 // Perform the larger operation, then subtract if needed.
3515 Tmp1 = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3516 switch(Node->getOpcode()) {
3521 // if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
3522 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
3523 DAG.getConstant(getSizeInBits(NVT), NVT), ISD::SETEQ);
3524 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
3525 DAG.getConstant(getSizeInBits(VT), NVT), Tmp1);
3528 //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
3529 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
3530 DAG.getConstant(getSizeInBits(NVT) -
3531 getSizeInBits(VT), NVT));
3535 case ISD::VEXTRACT_VECTOR_ELT:
3536 Result = PromoteOp(LowerVEXTRACT_VECTOR_ELT(Op));
3538 case ISD::EXTRACT_VECTOR_ELT:
3539 Result = PromoteOp(ExpandEXTRACT_VECTOR_ELT(Op));
3543 assert(Result.Val && "Didn't set a result!");
3545 // Make sure the result is itself legal.
3546 Result = LegalizeOp(Result);
3548 // Remember that we promoted this!
3549 AddPromotedOperand(Op, Result);
3553 /// LowerVEXTRACT_VECTOR_ELT - Lower a VEXTRACT_VECTOR_ELT operation into a
3554 /// EXTRACT_VECTOR_ELT operation, to memory operations, or to scalar code based
3555 /// on the vector type. The return type of this matches the element type of the
3556 /// vector, which may not be legal for the target.
3557 SDOperand SelectionDAGLegalize::LowerVEXTRACT_VECTOR_ELT(SDOperand Op) {
3558 // We know that operand #0 is the Vec vector. If the index is a constant
3559 // or if the invec is a supported hardware type, we can use it. Otherwise,
3560 // lower to a store then an indexed load.
3561 SDOperand Vec = Op.getOperand(0);
3562 SDOperand Idx = LegalizeOp(Op.getOperand(1));
3564 SDNode *InVal = Vec.Val;
3565 unsigned NumElems = cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
3566 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
3568 // Figure out if there is a Packed type corresponding to this Vector
3569 // type. If so, convert to the vector type.
3570 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
3571 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
3572 // Turn this into a packed extract_vector_elt operation.
3573 Vec = PackVectorOp(Vec, TVT);
3574 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, Op.getValueType(), Vec, Idx);
3575 } else if (NumElems == 1) {
3576 // This must be an access of the only element. Return it.
3577 return PackVectorOp(Vec, EVT);
3578 } else if (ConstantSDNode *CIdx = dyn_cast<ConstantSDNode>(Idx)) {
3580 SplitVectorOp(Vec, Lo, Hi);
3581 if (CIdx->getValue() < NumElems/2) {
3585 Idx = DAG.getConstant(CIdx->getValue() - NumElems/2, Idx.getValueType());
3588 // It's now an extract from the appropriate high or low part. Recurse.
3589 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
3590 return LowerVEXTRACT_VECTOR_ELT(Op);
3592 // Variable index case for extract element.
3593 // FIXME: IMPLEMENT STORE/LOAD lowering. Need alignment of stack slot!!
3594 assert(0 && "unimp!");
3599 /// ExpandEXTRACT_VECTOR_ELT - Expand an EXTRACT_VECTOR_ELT operation into
3601 SDOperand SelectionDAGLegalize::ExpandEXTRACT_VECTOR_ELT(SDOperand Op) {
3602 SDOperand Vector = Op.getOperand(0);
3603 SDOperand Idx = Op.getOperand(1);
3605 // If the target doesn't support this, store the value to a temporary
3606 // stack slot, then LOAD the scalar element back out.
3607 SDOperand StackPtr = CreateStackTemporary(Vector.getValueType());
3608 SDOperand Ch = DAG.getStore(DAG.getEntryNode(), Vector, StackPtr, NULL, 0);
3610 // Add the offset to the index.
3611 unsigned EltSize = MVT::getSizeInBits(Op.getValueType())/8;
3612 Idx = DAG.getNode(ISD::MUL, Idx.getValueType(), Idx,
3613 DAG.getConstant(EltSize, Idx.getValueType()));
3614 StackPtr = DAG.getNode(ISD::ADD, Idx.getValueType(), Idx, StackPtr);
3616 return DAG.getLoad(Op.getValueType(), Ch, StackPtr, NULL, 0);
3620 /// LegalizeSetCCOperands - Attempts to create a legal LHS and RHS for a SETCC
3621 /// with condition CC on the current target. This usually involves legalizing
3622 /// or promoting the arguments. In the case where LHS and RHS must be expanded,
3623 /// there may be no choice but to create a new SetCC node to represent the
3624 /// legalized value of setcc lhs, rhs. In this case, the value is returned in
3625 /// LHS, and the SDOperand returned in RHS has a nil SDNode value.
3626 void SelectionDAGLegalize::LegalizeSetCCOperands(SDOperand &LHS,
3629 SDOperand Tmp1, Tmp2, Result;
3631 switch (getTypeAction(LHS.getValueType())) {
3633 Tmp1 = LegalizeOp(LHS); // LHS
3634 Tmp2 = LegalizeOp(RHS); // RHS
3637 Tmp1 = PromoteOp(LHS); // LHS
3638 Tmp2 = PromoteOp(RHS); // RHS
3640 // If this is an FP compare, the operands have already been extended.
3641 if (MVT::isInteger(LHS.getValueType())) {
3642 MVT::ValueType VT = LHS.getValueType();
3643 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
3645 // Otherwise, we have to insert explicit sign or zero extends. Note
3646 // that we could insert sign extends for ALL conditions, but zero extend
3647 // is cheaper on many machines (an AND instead of two shifts), so prefer
3649 switch (cast<CondCodeSDNode>(CC)->get()) {
3650 default: assert(0 && "Unknown integer comparison!");
3657 // ALL of these operations will work if we either sign or zero extend
3658 // the operands (including the unsigned comparisons!). Zero extend is
3659 // usually a simpler/cheaper operation, so prefer it.
3660 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3661 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
3667 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3668 DAG.getValueType(VT));
3669 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
3670 DAG.getValueType(VT));
3676 MVT::ValueType VT = LHS.getValueType();
3677 if (VT == MVT::f32 || VT == MVT::f64) {
3678 // Expand into one or more soft-fp libcall(s).
3679 RTLIB::Libcall LC1, LC2 = RTLIB::UNKNOWN_LIBCALL;
3680 switch (cast<CondCodeSDNode>(CC)->get()) {
3683 LC1 = (VT == MVT::f32) ? RTLIB::OEQ_F32 : RTLIB::OEQ_F64;
3687 LC1 = (VT == MVT::f32) ? RTLIB::UNE_F32 : RTLIB::UNE_F64;
3691 LC1 = (VT == MVT::f32) ? RTLIB::OGE_F32 : RTLIB::OGE_F64;
3695 LC1 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
3699 LC1 = (VT == MVT::f32) ? RTLIB::OLE_F32 : RTLIB::OLE_F64;
3703 LC1 = (VT == MVT::f32) ? RTLIB::OGT_F32 : RTLIB::OGT_F64;
3706 LC1 = (VT == MVT::f32) ? RTLIB::UO_F32 : RTLIB::UO_F64;
3709 LC1 = (VT == MVT::f32) ? RTLIB::O_F32 : RTLIB::O_F64;
3712 LC1 = (VT == MVT::f32) ? RTLIB::UO_F32 : RTLIB::UO_F64;
3713 switch (cast<CondCodeSDNode>(CC)->get()) {
3715 // SETONE = SETOLT | SETOGT
3716 LC1 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
3719 LC2 = (VT == MVT::f32) ? RTLIB::OGT_F32 : RTLIB::OGT_F64;
3722 LC2 = (VT == MVT::f32) ? RTLIB::OGE_F32 : RTLIB::OGE_F64;
3725 LC2 = (VT == MVT::f32) ? RTLIB::OLT_F32 : RTLIB::OLT_F64;
3728 LC2 = (VT == MVT::f32) ? RTLIB::OLE_F32 : RTLIB::OLE_F64;
3731 LC2 = (VT == MVT::f32) ? RTLIB::OEQ_F32 : RTLIB::OEQ_F64;
3733 default: assert(0 && "Unsupported FP setcc!");
3738 Tmp1 = ExpandLibCall(TLI.getLibcallName(LC1),
3739 DAG.getNode(ISD::MERGE_VALUES, VT, LHS, RHS).Val,
3740 false /*sign irrelevant*/, Dummy);
3741 Tmp2 = DAG.getConstant(0, MVT::i32);
3742 CC = DAG.getCondCode(TLI.getCmpLibcallCC(LC1));
3743 if (LC2 != RTLIB::UNKNOWN_LIBCALL) {
3744 Tmp1 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), Tmp1, Tmp2, CC);
3745 LHS = ExpandLibCall(TLI.getLibcallName(LC2),
3746 DAG.getNode(ISD::MERGE_VALUES, VT, LHS, RHS).Val,
3747 false /*sign irrelevant*/, Dummy);
3748 Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHS, Tmp2,
3749 DAG.getCondCode(TLI.getCmpLibcallCC(LC2)));
3750 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2);
3758 SDOperand LHSLo, LHSHi, RHSLo, RHSHi;
3759 ExpandOp(LHS, LHSLo, LHSHi);
3760 ExpandOp(RHS, RHSLo, RHSHi);
3761 switch (cast<CondCodeSDNode>(CC)->get()) {
3765 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo))
3766 if (RHSCST->isAllOnesValue()) {
3767 // Comparison to -1.
3768 Tmp1 = DAG.getNode(ISD::AND, LHSLo.getValueType(), LHSLo, LHSHi);
3773 Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo);
3774 Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi);
3775 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2);
3776 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
3779 // If this is a comparison of the sign bit, just look at the top part.
3781 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(RHS))
3782 if ((cast<CondCodeSDNode>(CC)->get() == ISD::SETLT &&
3783 CST->getValue() == 0) || // X < 0
3784 (cast<CondCodeSDNode>(CC)->get() == ISD::SETGT &&
3785 CST->isAllOnesValue())) { // X > -1
3791 // FIXME: This generated code sucks.
3792 ISD::CondCode LowCC;
3793 ISD::CondCode CCCode = cast<CondCodeSDNode>(CC)->get();
3795 default: assert(0 && "Unknown integer setcc!");
3797 case ISD::SETULT: LowCC = ISD::SETULT; break;
3799 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
3801 case ISD::SETULE: LowCC = ISD::SETULE; break;
3803 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
3806 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
3807 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
3808 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
3810 // NOTE: on targets without efficient SELECT of bools, we can always use
3811 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
3812 TargetLowering::DAGCombinerInfo DagCombineInfo(DAG, false, true, NULL);
3813 Tmp1 = TLI.SimplifySetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC,
3814 false, DagCombineInfo);
3816 Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC);
3817 Tmp2 = TLI.SimplifySetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi,
3818 CCCode, false, DagCombineInfo);
3820 Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHSHi, RHSHi, CC);
3822 ConstantSDNode *Tmp1C = dyn_cast<ConstantSDNode>(Tmp1.Val);
3823 ConstantSDNode *Tmp2C = dyn_cast<ConstantSDNode>(Tmp2.Val);
3824 if ((Tmp1C && Tmp1C->getValue() == 0) ||
3825 (Tmp2C && Tmp2C->getValue() == 0 &&
3826 (CCCode == ISD::SETLE || CCCode == ISD::SETGE ||
3827 CCCode == ISD::SETUGE || CCCode == ISD::SETULE)) ||
3828 (Tmp2C && Tmp2C->getValue() == 1 &&
3829 (CCCode == ISD::SETLT || CCCode == ISD::SETGT ||
3830 CCCode == ISD::SETUGT || CCCode == ISD::SETULT))) {
3831 // low part is known false, returns high part.
3832 // For LE / GE, if high part is known false, ignore the low part.
3833 // For LT / GT, if high part is known true, ignore the low part.
3837 Result = TLI.SimplifySetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi,
3838 ISD::SETEQ, false, DagCombineInfo);
3840 Result=DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETEQ);
3841 Result = LegalizeOp(DAG.getNode(ISD::SELECT, Tmp1.getValueType(),
3842 Result, Tmp1, Tmp2));
3853 /// ExpandBIT_CONVERT - Expand a BIT_CONVERT node into a store/load combination.
3854 /// The resultant code need not be legal. Note that SrcOp is the input operand
3855 /// to the BIT_CONVERT, not the BIT_CONVERT node itself.
3856 SDOperand SelectionDAGLegalize::ExpandBIT_CONVERT(MVT::ValueType DestVT,
3858 // Create the stack frame object.
3859 SDOperand FIPtr = CreateStackTemporary(DestVT);
3861 // Emit a store to the stack slot.
3862 SDOperand Store = DAG.getStore(DAG.getEntryNode(), SrcOp, FIPtr, NULL, 0);
3863 // Result is a load from the stack slot.
3864 return DAG.getLoad(DestVT, Store, FIPtr, NULL, 0);
3867 SDOperand SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
3868 // Create a vector sized/aligned stack slot, store the value to element #0,
3869 // then load the whole vector back out.
3870 SDOperand StackPtr = CreateStackTemporary(Node->getValueType(0));
3871 SDOperand Ch = DAG.getStore(DAG.getEntryNode(), Node->getOperand(0), StackPtr,
3873 return DAG.getLoad(Node->getValueType(0), Ch, StackPtr, NULL, 0);
3877 /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
3878 /// support the operation, but do support the resultant packed vector type.
3879 SDOperand SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
3881 // If the only non-undef value is the low element, turn this into a
3882 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
3883 unsigned NumElems = Node->getNumOperands();
3884 bool isOnlyLowElement = true;
3885 SDOperand SplatValue = Node->getOperand(0);
3886 std::map<SDOperand, std::vector<unsigned> > Values;
3887 Values[SplatValue].push_back(0);
3888 bool isConstant = true;
3889 if (!isa<ConstantFPSDNode>(SplatValue) && !isa<ConstantSDNode>(SplatValue) &&
3890 SplatValue.getOpcode() != ISD::UNDEF)
3893 for (unsigned i = 1; i < NumElems; ++i) {
3894 SDOperand V = Node->getOperand(i);
3895 Values[V].push_back(i);
3896 if (V.getOpcode() != ISD::UNDEF)
3897 isOnlyLowElement = false;
3898 if (SplatValue != V)
3899 SplatValue = SDOperand(0,0);
3901 // If this isn't a constant element or an undef, we can't use a constant
3903 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V) &&
3904 V.getOpcode() != ISD::UNDEF)
3908 if (isOnlyLowElement) {
3909 // If the low element is an undef too, then this whole things is an undef.
3910 if (Node->getOperand(0).getOpcode() == ISD::UNDEF)
3911 return DAG.getNode(ISD::UNDEF, Node->getValueType(0));
3912 // Otherwise, turn this into a scalar_to_vector node.
3913 return DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
3914 Node->getOperand(0));
3917 // If all elements are constants, create a load from the constant pool.
3919 MVT::ValueType VT = Node->getValueType(0);
3921 MVT::getTypeForValueType(Node->getOperand(0).getValueType());
3922 std::vector<Constant*> CV;
3923 for (unsigned i = 0, e = NumElems; i != e; ++i) {
3924 if (ConstantFPSDNode *V =
3925 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
3926 CV.push_back(ConstantFP::get(OpNTy, V->getValue()));
3927 } else if (ConstantSDNode *V =
3928 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
3929 CV.push_back(ConstantInt::get(OpNTy, V->getValue()));
3931 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
3932 CV.push_back(UndefValue::get(OpNTy));
3935 Constant *CP = ConstantVector::get(CV);
3936 SDOperand CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
3937 return DAG.getLoad(VT, DAG.getEntryNode(), CPIdx, NULL, 0);
3940 if (SplatValue.Val) { // Splat of one value?
3941 // Build the shuffle constant vector: <0, 0, 0, 0>
3942 MVT::ValueType MaskVT =
3943 MVT::getIntVectorWithNumElements(NumElems);
3944 SDOperand Zero = DAG.getConstant(0, MVT::getVectorBaseType(MaskVT));
3945 std::vector<SDOperand> ZeroVec(NumElems, Zero);
3946 SDOperand SplatMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT,
3947 &ZeroVec[0], ZeroVec.size());
3949 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
3950 if (isShuffleLegal(Node->getValueType(0), SplatMask)) {
3951 // Get the splatted value into the low element of a vector register.
3952 SDOperand LowValVec =
3953 DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0), SplatValue);
3955 // Return shuffle(LowValVec, undef, <0,0,0,0>)
3956 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0), LowValVec,
3957 DAG.getNode(ISD::UNDEF, Node->getValueType(0)),
3962 // If there are only two unique elements, we may be able to turn this into a
3964 if (Values.size() == 2) {
3965 // Build the shuffle constant vector: e.g. <0, 4, 0, 4>
3966 MVT::ValueType MaskVT =
3967 MVT::getIntVectorWithNumElements(NumElems);
3968 std::vector<SDOperand> MaskVec(NumElems);
3970 for (std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
3971 E = Values.end(); I != E; ++I) {
3972 for (std::vector<unsigned>::iterator II = I->second.begin(),
3973 EE = I->second.end(); II != EE; ++II)
3974 MaskVec[*II] = DAG.getConstant(i, MVT::getVectorBaseType(MaskVT));
3977 SDOperand ShuffleMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT,
3978 &MaskVec[0], MaskVec.size());
3980 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
3981 if (TLI.isOperationLegal(ISD::SCALAR_TO_VECTOR, Node->getValueType(0)) &&
3982 isShuffleLegal(Node->getValueType(0), ShuffleMask)) {
3983 SmallVector<SDOperand, 8> Ops;
3984 for(std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
3985 E = Values.end(); I != E; ++I) {
3986 SDOperand Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
3990 Ops.push_back(ShuffleMask);
3992 // Return shuffle(LoValVec, HiValVec, <0,1,0,1>)
3993 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0),
3994 &Ops[0], Ops.size());
3998 // Otherwise, we can't handle this case efficiently. Allocate a sufficiently
3999 // aligned object on the stack, store each element into it, then load
4000 // the result as a vector.
4001 MVT::ValueType VT = Node->getValueType(0);
4002 // Create the stack frame object.
4003 SDOperand FIPtr = CreateStackTemporary(VT);
4005 // Emit a store of each element to the stack slot.
4006 SmallVector<SDOperand, 8> Stores;
4007 unsigned TypeByteSize =
4008 MVT::getSizeInBits(Node->getOperand(0).getValueType())/8;
4009 // Store (in the right endianness) the elements to memory.
4010 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
4011 // Ignore undef elements.
4012 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
4014 unsigned Offset = TypeByteSize*i;
4016 SDOperand Idx = DAG.getConstant(Offset, FIPtr.getValueType());
4017 Idx = DAG.getNode(ISD::ADD, FIPtr.getValueType(), FIPtr, Idx);
4019 Stores.push_back(DAG.getStore(DAG.getEntryNode(), Node->getOperand(i), Idx,
4023 SDOperand StoreChain;
4024 if (!Stores.empty()) // Not all undef elements?
4025 StoreChain = DAG.getNode(ISD::TokenFactor, MVT::Other,
4026 &Stores[0], Stores.size());
4028 StoreChain = DAG.getEntryNode();
4030 // Result is a load from the stack slot.
4031 return DAG.getLoad(VT, StoreChain, FIPtr, NULL, 0);
4034 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
4035 /// specified value type.
4036 SDOperand SelectionDAGLegalize::CreateStackTemporary(MVT::ValueType VT) {
4037 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
4038 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
4039 const Type *Ty = MVT::getTypeForValueType(VT);
4040 unsigned StackAlign = (unsigned)TLI.getTargetData()->getPrefTypeAlignment(Ty);
4041 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, StackAlign);
4042 return DAG.getFrameIndex(FrameIdx, TLI.getPointerTy());
4045 void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp,
4046 SDOperand Op, SDOperand Amt,
4047 SDOperand &Lo, SDOperand &Hi) {
4048 // Expand the subcomponents.
4049 SDOperand LHSL, LHSH;
4050 ExpandOp(Op, LHSL, LHSH);
4052 SDOperand Ops[] = { LHSL, LHSH, Amt };
4053 MVT::ValueType VT = LHSL.getValueType();
4054 Lo = DAG.getNode(NodeOp, DAG.getNodeValueTypes(VT, VT), 2, Ops, 3);
4055 Hi = Lo.getValue(1);
4059 /// ExpandShift - Try to find a clever way to expand this shift operation out to
4060 /// smaller elements. If we can't find a way that is more efficient than a
4061 /// libcall on this target, return false. Otherwise, return true with the
4062 /// low-parts expanded into Lo and Hi.
4063 bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt,
4064 SDOperand &Lo, SDOperand &Hi) {
4065 assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) &&
4066 "This is not a shift!");
4068 MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType());
4069 SDOperand ShAmt = LegalizeOp(Amt);
4070 MVT::ValueType ShTy = ShAmt.getValueType();
4071 unsigned VTBits = MVT::getSizeInBits(Op.getValueType());
4072 unsigned NVTBits = MVT::getSizeInBits(NVT);
4074 // Handle the case when Amt is an immediate. Other cases are currently broken
4075 // and are disabled.
4076 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.Val)) {
4077 unsigned Cst = CN->getValue();
4078 // Expand the incoming operand to be shifted, so that we have its parts
4080 ExpandOp(Op, InL, InH);
4084 Lo = DAG.getConstant(0, NVT);
4085 Hi = DAG.getConstant(0, NVT);
4086 } else if (Cst > NVTBits) {
4087 Lo = DAG.getConstant(0, NVT);
4088 Hi = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst-NVTBits,ShTy));
4089 } else if (Cst == NVTBits) {
4090 Lo = DAG.getConstant(0, NVT);
4093 Lo = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst, ShTy));
4094 Hi = DAG.getNode(ISD::OR, NVT,
4095 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(Cst, ShTy)),
4096 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(NVTBits-Cst, ShTy)));
4101 Lo = DAG.getConstant(0, NVT);
4102 Hi = DAG.getConstant(0, NVT);
4103 } else if (Cst > NVTBits) {
4104 Lo = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst-NVTBits,ShTy));
4105 Hi = DAG.getConstant(0, NVT);
4106 } else if (Cst == NVTBits) {
4108 Hi = DAG.getConstant(0, NVT);
4110 Lo = DAG.getNode(ISD::OR, NVT,
4111 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
4112 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
4113 Hi = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst, ShTy));
4118 Hi = Lo = DAG.getNode(ISD::SRA, NVT, InH,
4119 DAG.getConstant(NVTBits-1, ShTy));
4120 } else if (Cst > NVTBits) {
4121 Lo = DAG.getNode(ISD::SRA, NVT, InH,
4122 DAG.getConstant(Cst-NVTBits, ShTy));
4123 Hi = DAG.getNode(ISD::SRA, NVT, InH,
4124 DAG.getConstant(NVTBits-1, ShTy));
4125 } else if (Cst == NVTBits) {
4127 Hi = DAG.getNode(ISD::SRA, NVT, InH,
4128 DAG.getConstant(NVTBits-1, ShTy));
4130 Lo = DAG.getNode(ISD::OR, NVT,
4131 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
4132 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
4133 Hi = DAG.getNode(ISD::SRA, NVT, InH, DAG.getConstant(Cst, ShTy));
4139 // Okay, the shift amount isn't constant. However, if we can tell that it is
4140 // >= 32 or < 32, we can still simplify it, without knowing the actual value.
4141 uint64_t Mask = NVTBits, KnownZero, KnownOne;
4142 TLI.ComputeMaskedBits(Amt, Mask, KnownZero, KnownOne);
4144 // If we know that the high bit of the shift amount is one, then we can do
4145 // this as a couple of simple shifts.
4146 if (KnownOne & Mask) {
4147 // Mask out the high bit, which we know is set.
4148 Amt = DAG.getNode(ISD::AND, Amt.getValueType(), Amt,
4149 DAG.getConstant(NVTBits-1, Amt.getValueType()));
4151 // Expand the incoming operand to be shifted, so that we have its parts
4153 ExpandOp(Op, InL, InH);
4156 Lo = DAG.getConstant(0, NVT); // Low part is zero.
4157 Hi = DAG.getNode(ISD::SHL, NVT, InL, Amt); // High part from Lo part.
4160 Hi = DAG.getConstant(0, NVT); // Hi part is zero.
4161 Lo = DAG.getNode(ISD::SRL, NVT, InH, Amt); // Lo part from Hi part.
4164 Hi = DAG.getNode(ISD::SRA, NVT, InH, // Sign extend high part.
4165 DAG.getConstant(NVTBits-1, Amt.getValueType()));
4166 Lo = DAG.getNode(ISD::SRA, NVT, InH, Amt); // Lo part from Hi part.
4171 // If we know that the high bit of the shift amount is zero, then we can do
4172 // this as a couple of simple shifts.
4173 if (KnownZero & Mask) {
4175 SDOperand Amt2 = DAG.getNode(ISD::SUB, Amt.getValueType(),
4176 DAG.getConstant(NVTBits, Amt.getValueType()),
4179 // Expand the incoming operand to be shifted, so that we have its parts
4181 ExpandOp(Op, InL, InH);
4184 Lo = DAG.getNode(ISD::SHL, NVT, InL, Amt);
4185 Hi = DAG.getNode(ISD::OR, NVT,
4186 DAG.getNode(ISD::SHL, NVT, InH, Amt),
4187 DAG.getNode(ISD::SRL, NVT, InL, Amt2));
4190 Hi = DAG.getNode(ISD::SRL, NVT, InH, Amt);
4191 Lo = DAG.getNode(ISD::OR, NVT,
4192 DAG.getNode(ISD::SRL, NVT, InL, Amt),
4193 DAG.getNode(ISD::SHL, NVT, InH, Amt2));
4196 Hi = DAG.getNode(ISD::SRA, NVT, InH, Amt);
4197 Lo = DAG.getNode(ISD::OR, NVT,
4198 DAG.getNode(ISD::SRL, NVT, InL, Amt),
4199 DAG.getNode(ISD::SHL, NVT, InH, Amt2));
4208 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
4209 // does not fit into a register, return the lo part and set the hi part to the
4210 // by-reg argument. If it does fit into a single register, return the result
4211 // and leave the Hi part unset.
4212 SDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node,
4213 bool isSigned, SDOperand &Hi) {
4214 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
4215 // The input chain to this libcall is the entry node of the function.
4216 // Legalizing the call will automatically add the previous call to the
4218 SDOperand InChain = DAG.getEntryNode();
4220 TargetLowering::ArgListTy Args;
4221 TargetLowering::ArgListEntry Entry;
4222 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
4223 MVT::ValueType ArgVT = Node->getOperand(i).getValueType();
4224 const Type *ArgTy = MVT::getTypeForValueType(ArgVT);
4225 Entry.Node = Node->getOperand(i); Entry.Ty = ArgTy;
4226 Entry.isSigned = isSigned; Entry.isInReg = false; Entry.isSRet = false;
4227 Args.push_back(Entry);
4229 SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy());
4231 // Splice the libcall in wherever FindInputOutputChains tells us to.
4232 const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0));
4233 std::pair<SDOperand,SDOperand> CallInfo =
4234 TLI.LowerCallTo(InChain, RetTy, isSigned, false, CallingConv::C, false,
4237 // Legalize the call sequence, starting with the chain. This will advance
4238 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
4239 // was added by LowerCallTo (guaranteeing proper serialization of calls).
4240 LegalizeOp(CallInfo.second);
4242 switch (getTypeAction(CallInfo.first.getValueType())) {
4243 default: assert(0 && "Unknown thing");
4245 Result = CallInfo.first;
4248 ExpandOp(CallInfo.first, Result, Hi);
4255 /// ExpandIntToFP - Expand a [US]INT_TO_FP operation, assuming that the
4256 /// destination type is legal.
4257 SDOperand SelectionDAGLegalize::
4258 ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) {
4259 assert(isTypeLegal(DestTy) && "Destination type is not legal!");
4260 assert(getTypeAction(Source.getValueType()) == Expand &&
4261 "This is not an expansion!");
4262 assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!");
4265 assert(Source.getValueType() == MVT::i64 &&
4266 "This only works for 64-bit -> FP");
4267 // The 64-bit value loaded will be incorrectly if the 'sign bit' of the
4268 // incoming integer is set. To handle this, we dynamically test to see if
4269 // it is set, and, if so, add a fudge factor.
4271 ExpandOp(Source, Lo, Hi);
4273 // If this is unsigned, and not supported, first perform the conversion to
4274 // signed, then adjust the result if the sign bit is set.
4275 SDOperand SignedConv = ExpandIntToFP(true, DestTy,
4276 DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), Lo, Hi));
4278 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Hi,
4279 DAG.getConstant(0, Hi.getValueType()),
4281 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
4282 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
4283 SignSet, Four, Zero);
4284 uint64_t FF = 0x5f800000ULL;
4285 if (TLI.isLittleEndian()) FF <<= 32;
4286 static Constant *FudgeFactor = ConstantInt::get(Type::Int64Ty, FF);
4288 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
4289 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
4290 SDOperand FudgeInReg;
4291 if (DestTy == MVT::f32)
4292 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx, NULL, 0);
4294 assert(DestTy == MVT::f64 && "Unexpected conversion");
4295 FudgeInReg = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
4296 CPIdx, NULL, 0, MVT::f32);
4298 return DAG.getNode(ISD::FADD, DestTy, SignedConv, FudgeInReg);
4301 // Check to see if the target has a custom way to lower this. If so, use it.
4302 switch (TLI.getOperationAction(ISD::SINT_TO_FP, Source.getValueType())) {
4303 default: assert(0 && "This action not implemented for this operation!");
4304 case TargetLowering::Legal:
4305 case TargetLowering::Expand:
4306 break; // This case is handled below.
4307 case TargetLowering::Custom: {
4308 SDOperand NV = TLI.LowerOperation(DAG.getNode(ISD::SINT_TO_FP, DestTy,
4311 return LegalizeOp(NV);
4312 break; // The target decided this was legal after all
4316 // Expand the source, then glue it back together for the call. We must expand
4317 // the source in case it is shared (this pass of legalize must traverse it).
4318 SDOperand SrcLo, SrcHi;
4319 ExpandOp(Source, SrcLo, SrcHi);
4320 Source = DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), SrcLo, SrcHi);
4323 if (DestTy == MVT::f32)
4324 LC = RTLIB::SINTTOFP_I64_F32;
4326 assert(DestTy == MVT::f64 && "Unknown fp value type!");
4327 LC = RTLIB::SINTTOFP_I64_F64;
4330 Source = DAG.getNode(ISD::SINT_TO_FP, DestTy, Source);
4331 SDOperand UnusedHiPart;
4332 return ExpandLibCall(TLI.getLibcallName(LC), Source.Val, isSigned,
4336 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
4337 /// INT_TO_FP operation of the specified operand when the target requests that
4338 /// we expand it. At this point, we know that the result and operand types are
4339 /// legal for the target.
4340 SDOperand SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
4342 MVT::ValueType DestVT) {
4343 if (Op0.getValueType() == MVT::i32) {
4344 // simple 32-bit [signed|unsigned] integer to float/double expansion
4346 // get the stack frame index of a 8 byte buffer, pessimistically aligned
4347 MachineFunction &MF = DAG.getMachineFunction();
4348 const Type *F64Type = MVT::getTypeForValueType(MVT::f64);
4349 unsigned StackAlign =
4350 (unsigned)TLI.getTargetData()->getPrefTypeAlignment(F64Type);
4351 int SSFI = MF.getFrameInfo()->CreateStackObject(8, StackAlign);
4352 // get address of 8 byte buffer
4353 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
4354 // word offset constant for Hi/Lo address computation
4355 SDOperand WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
4356 // set up Hi and Lo (into buffer) address based on endian
4357 SDOperand Hi = StackSlot;
4358 SDOperand Lo = DAG.getNode(ISD::ADD, TLI.getPointerTy(), StackSlot,WordOff);
4359 if (TLI.isLittleEndian())
4362 // if signed map to unsigned space
4363 SDOperand Op0Mapped;
4365 // constant used to invert sign bit (signed to unsigned mapping)
4366 SDOperand SignBit = DAG.getConstant(0x80000000u, MVT::i32);
4367 Op0Mapped = DAG.getNode(ISD::XOR, MVT::i32, Op0, SignBit);
4371 // store the lo of the constructed double - based on integer input
4372 SDOperand Store1 = DAG.getStore(DAG.getEntryNode(),
4373 Op0Mapped, Lo, NULL, 0);
4374 // initial hi portion of constructed double
4375 SDOperand InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
4376 // store the hi of the constructed double - biased exponent
4377 SDOperand Store2=DAG.getStore(Store1, InitialHi, Hi, NULL, 0);
4378 // load the constructed double
4379 SDOperand Load = DAG.getLoad(MVT::f64, Store2, StackSlot, NULL, 0);
4380 // FP constant to bias correct the final result
4381 SDOperand Bias = DAG.getConstantFP(isSigned ?
4382 BitsToDouble(0x4330000080000000ULL)
4383 : BitsToDouble(0x4330000000000000ULL),
4385 // subtract the bias
4386 SDOperand Sub = DAG.getNode(ISD::FSUB, MVT::f64, Load, Bias);
4389 // handle final rounding
4390 if (DestVT == MVT::f64) {
4394 // if f32 then cast to f32
4395 Result = DAG.getNode(ISD::FP_ROUND, MVT::f32, Sub);
4399 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
4400 SDOperand Tmp1 = DAG.getNode(ISD::SINT_TO_FP, DestVT, Op0);
4402 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Op0,
4403 DAG.getConstant(0, Op0.getValueType()),
4405 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
4406 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
4407 SignSet, Four, Zero);
4409 // If the sign bit of the integer is set, the large number will be treated
4410 // as a negative number. To counteract this, the dynamic code adds an
4411 // offset depending on the data type.
4413 switch (Op0.getValueType()) {
4414 default: assert(0 && "Unsupported integer type!");
4415 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
4416 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
4417 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
4418 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
4420 if (TLI.isLittleEndian()) FF <<= 32;
4421 static Constant *FudgeFactor = ConstantInt::get(Type::Int64Ty, FF);
4423 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
4424 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
4425 SDOperand FudgeInReg;
4426 if (DestVT == MVT::f32)
4427 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx, NULL, 0);
4429 assert(DestVT == MVT::f64 && "Unexpected conversion");
4430 FudgeInReg = LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, MVT::f64,
4431 DAG.getEntryNode(), CPIdx,
4432 NULL, 0, MVT::f32));
4435 return DAG.getNode(ISD::FADD, DestVT, Tmp1, FudgeInReg);
4438 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
4439 /// *INT_TO_FP operation of the specified operand when the target requests that
4440 /// we promote it. At this point, we know that the result and operand types are
4441 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
4442 /// operation that takes a larger input.
4443 SDOperand SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDOperand LegalOp,
4444 MVT::ValueType DestVT,
4446 // First step, figure out the appropriate *INT_TO_FP operation to use.
4447 MVT::ValueType NewInTy = LegalOp.getValueType();
4449 unsigned OpToUse = 0;
4451 // Scan for the appropriate larger type to use.
4453 NewInTy = (MVT::ValueType)(NewInTy+1);
4454 assert(MVT::isInteger(NewInTy) && "Ran out of possibilities!");
4456 // If the target supports SINT_TO_FP of this type, use it.
4457 switch (TLI.getOperationAction(ISD::SINT_TO_FP, NewInTy)) {
4459 case TargetLowering::Legal:
4460 if (!TLI.isTypeLegal(NewInTy))
4461 break; // Can't use this datatype.
4463 case TargetLowering::Custom:
4464 OpToUse = ISD::SINT_TO_FP;
4468 if (isSigned) continue;
4470 // If the target supports UINT_TO_FP of this type, use it.
4471 switch (TLI.getOperationAction(ISD::UINT_TO_FP, NewInTy)) {
4473 case TargetLowering::Legal:
4474 if (!TLI.isTypeLegal(NewInTy))
4475 break; // Can't use this datatype.
4477 case TargetLowering::Custom:
4478 OpToUse = ISD::UINT_TO_FP;
4483 // Otherwise, try a larger type.
4486 // Okay, we found the operation and type to use. Zero extend our input to the
4487 // desired type then run the operation on it.
4488 return DAG.getNode(OpToUse, DestVT,
4489 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
4493 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
4494 /// FP_TO_*INT operation of the specified operand when the target requests that
4495 /// we promote it. At this point, we know that the result and operand types are
4496 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
4497 /// operation that returns a larger result.
4498 SDOperand SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDOperand LegalOp,
4499 MVT::ValueType DestVT,
4501 // First step, figure out the appropriate FP_TO*INT operation to use.
4502 MVT::ValueType NewOutTy = DestVT;
4504 unsigned OpToUse = 0;
4506 // Scan for the appropriate larger type to use.
4508 NewOutTy = (MVT::ValueType)(NewOutTy+1);
4509 assert(MVT::isInteger(NewOutTy) && "Ran out of possibilities!");
4511 // If the target supports FP_TO_SINT returning this type, use it.
4512 switch (TLI.getOperationAction(ISD::FP_TO_SINT, NewOutTy)) {
4514 case TargetLowering::Legal:
4515 if (!TLI.isTypeLegal(NewOutTy))
4516 break; // Can't use this datatype.
4518 case TargetLowering::Custom:
4519 OpToUse = ISD::FP_TO_SINT;
4524 // If the target supports FP_TO_UINT of this type, use it.
4525 switch (TLI.getOperationAction(ISD::FP_TO_UINT, NewOutTy)) {
4527 case TargetLowering::Legal:
4528 if (!TLI.isTypeLegal(NewOutTy))
4529 break; // Can't use this datatype.
4531 case TargetLowering::Custom:
4532 OpToUse = ISD::FP_TO_UINT;
4537 // Otherwise, try a larger type.
4540 // Okay, we found the operation and type to use. Truncate the result of the
4541 // extended FP_TO_*INT operation to the desired size.
4542 return DAG.getNode(ISD::TRUNCATE, DestVT,
4543 DAG.getNode(OpToUse, NewOutTy, LegalOp));
4546 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
4548 SDOperand SelectionDAGLegalize::ExpandBSWAP(SDOperand Op) {
4549 MVT::ValueType VT = Op.getValueType();
4550 MVT::ValueType SHVT = TLI.getShiftAmountTy();
4551 SDOperand Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
4553 default: assert(0 && "Unhandled Expand type in BSWAP!"); abort();
4555 Tmp2 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4556 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4557 return DAG.getNode(ISD::OR, VT, Tmp1, Tmp2);
4559 Tmp4 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
4560 Tmp3 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4561 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4562 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
4563 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
4564 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(0xFF00, VT));
4565 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
4566 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
4567 return DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
4569 Tmp8 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(56, SHVT));
4570 Tmp7 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(40, SHVT));
4571 Tmp6 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
4572 Tmp5 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4573 Tmp4 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4574 Tmp3 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
4575 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(40, SHVT));
4576 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(56, SHVT));
4577 Tmp7 = DAG.getNode(ISD::AND, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
4578 Tmp6 = DAG.getNode(ISD::AND, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
4579 Tmp5 = DAG.getNode(ISD::AND, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
4580 Tmp4 = DAG.getNode(ISD::AND, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
4581 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
4582 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
4583 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp7);
4584 Tmp6 = DAG.getNode(ISD::OR, VT, Tmp6, Tmp5);
4585 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
4586 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
4587 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp6);
4588 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
4589 return DAG.getNode(ISD::OR, VT, Tmp8, Tmp4);
4593 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
4595 SDOperand SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDOperand Op) {
4597 default: assert(0 && "Cannot expand this yet!");
4599 static const uint64_t mask[6] = {
4600 0x5555555555555555ULL, 0x3333333333333333ULL,
4601 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
4602 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
4604 MVT::ValueType VT = Op.getValueType();
4605 MVT::ValueType ShVT = TLI.getShiftAmountTy();
4606 unsigned len = getSizeInBits(VT);
4607 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
4608 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
4609 SDOperand Tmp2 = DAG.getConstant(mask[i], VT);
4610 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
4611 Op = DAG.getNode(ISD::ADD, VT, DAG.getNode(ISD::AND, VT, Op, Tmp2),
4612 DAG.getNode(ISD::AND, VT,
4613 DAG.getNode(ISD::SRL, VT, Op, Tmp3),Tmp2));
4618 // for now, we do this:
4619 // x = x | (x >> 1);
4620 // x = x | (x >> 2);
4622 // x = x | (x >>16);
4623 // x = x | (x >>32); // for 64-bit input
4624 // return popcount(~x);
4626 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
4627 MVT::ValueType VT = Op.getValueType();
4628 MVT::ValueType ShVT = TLI.getShiftAmountTy();
4629 unsigned len = getSizeInBits(VT);
4630 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
4631 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
4632 Op = DAG.getNode(ISD::OR, VT, Op, DAG.getNode(ISD::SRL, VT, Op, Tmp3));
4634 Op = DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(~0ULL, VT));
4635 return DAG.getNode(ISD::CTPOP, VT, Op);
4638 // for now, we use: { return popcount(~x & (x - 1)); }
4639 // unless the target has ctlz but not ctpop, in which case we use:
4640 // { return 32 - nlz(~x & (x-1)); }
4641 // see also http://www.hackersdelight.org/HDcode/ntz.cc
4642 MVT::ValueType VT = Op.getValueType();
4643 SDOperand Tmp2 = DAG.getConstant(~0ULL, VT);
4644 SDOperand Tmp3 = DAG.getNode(ISD::AND, VT,
4645 DAG.getNode(ISD::XOR, VT, Op, Tmp2),
4646 DAG.getNode(ISD::SUB, VT, Op, DAG.getConstant(1, VT)));
4647 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
4648 if (!TLI.isOperationLegal(ISD::CTPOP, VT) &&
4649 TLI.isOperationLegal(ISD::CTLZ, VT))
4650 return DAG.getNode(ISD::SUB, VT,
4651 DAG.getConstant(getSizeInBits(VT), VT),
4652 DAG.getNode(ISD::CTLZ, VT, Tmp3));
4653 return DAG.getNode(ISD::CTPOP, VT, Tmp3);
4658 /// ExpandOp - Expand the specified SDOperand into its two component pieces
4659 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the
4660 /// LegalizeNodes map is filled in for any results that are not expanded, the
4661 /// ExpandedNodes map is filled in for any results that are expanded, and the
4662 /// Lo/Hi values are returned.
4663 void SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){
4664 MVT::ValueType VT = Op.getValueType();
4665 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
4666 SDNode *Node = Op.Val;
4667 assert(getTypeAction(VT) == Expand && "Not an expanded type!");
4668 assert(((MVT::isInteger(NVT) && NVT < VT) || MVT::isFloatingPoint(VT) ||
4669 VT == MVT::Vector) &&
4670 "Cannot expand to FP value or to larger int value!");
4672 // See if we already expanded it.
4673 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
4674 = ExpandedNodes.find(Op);
4675 if (I != ExpandedNodes.end()) {
4676 Lo = I->second.first;
4677 Hi = I->second.second;
4681 switch (Node->getOpcode()) {
4682 case ISD::CopyFromReg:
4683 assert(0 && "CopyFromReg must be legal!");
4686 cerr << "NODE: "; Node->dump(); cerr << "\n";
4688 assert(0 && "Do not know how to expand this operator!");
4691 NVT = TLI.getTypeToExpandTo(VT);
4692 Lo = DAG.getNode(ISD::UNDEF, NVT);
4693 Hi = DAG.getNode(ISD::UNDEF, NVT);
4695 case ISD::Constant: {
4696 uint64_t Cst = cast<ConstantSDNode>(Node)->getValue();
4697 Lo = DAG.getConstant(Cst, NVT);
4698 Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT);
4701 case ISD::ConstantFP: {
4702 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
4703 Lo = ExpandConstantFP(CFP, false, DAG, TLI);
4704 if (getTypeAction(Lo.getValueType()) == Expand)
4705 ExpandOp(Lo, Lo, Hi);
4708 case ISD::BUILD_PAIR:
4709 // Return the operands.
4710 Lo = Node->getOperand(0);
4711 Hi = Node->getOperand(1);
4714 case ISD::SIGN_EXTEND_INREG:
4715 ExpandOp(Node->getOperand(0), Lo, Hi);
4716 // sext_inreg the low part if needed.
4717 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Lo, Node->getOperand(1));
4719 // The high part gets the sign extension from the lo-part. This handles
4720 // things like sextinreg V:i64 from i8.
4721 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
4722 DAG.getConstant(MVT::getSizeInBits(NVT)-1,
4723 TLI.getShiftAmountTy()));
4727 ExpandOp(Node->getOperand(0), Lo, Hi);
4728 SDOperand TempLo = DAG.getNode(ISD::BSWAP, NVT, Hi);
4729 Hi = DAG.getNode(ISD::BSWAP, NVT, Lo);
4735 ExpandOp(Node->getOperand(0), Lo, Hi);
4736 Lo = DAG.getNode(ISD::ADD, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L)
4737 DAG.getNode(ISD::CTPOP, NVT, Lo),
4738 DAG.getNode(ISD::CTPOP, NVT, Hi));
4739 Hi = DAG.getConstant(0, NVT);
4743 // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32)
4744 ExpandOp(Node->getOperand(0), Lo, Hi);
4745 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
4746 SDOperand HLZ = DAG.getNode(ISD::CTLZ, NVT, Hi);
4747 SDOperand TopNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), HLZ, BitsC,
4749 SDOperand LowPart = DAG.getNode(ISD::CTLZ, NVT, Lo);
4750 LowPart = DAG.getNode(ISD::ADD, NVT, LowPart, BitsC);
4752 Lo = DAG.getNode(ISD::SELECT, NVT, TopNotZero, HLZ, LowPart);
4753 Hi = DAG.getConstant(0, NVT);
4758 // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32)
4759 ExpandOp(Node->getOperand(0), Lo, Hi);
4760 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
4761 SDOperand LTZ = DAG.getNode(ISD::CTTZ, NVT, Lo);
4762 SDOperand BotNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), LTZ, BitsC,
4764 SDOperand HiPart = DAG.getNode(ISD::CTTZ, NVT, Hi);
4765 HiPart = DAG.getNode(ISD::ADD, NVT, HiPart, BitsC);
4767 Lo = DAG.getNode(ISD::SELECT, NVT, BotNotZero, LTZ, HiPart);
4768 Hi = DAG.getConstant(0, NVT);
4773 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
4774 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
4775 Lo = DAG.getVAArg(NVT, Ch, Ptr, Node->getOperand(2));
4776 Hi = DAG.getVAArg(NVT, Lo.getValue(1), Ptr, Node->getOperand(2));
4778 // Remember that we legalized the chain.
4779 Hi = LegalizeOp(Hi);
4780 AddLegalizedOperand(Op.getValue(1), Hi.getValue(1));
4781 if (!TLI.isLittleEndian())
4787 LoadSDNode *LD = cast<LoadSDNode>(Node);
4788 SDOperand Ch = LD->getChain(); // Legalize the chain.
4789 SDOperand Ptr = LD->getBasePtr(); // Legalize the pointer.
4790 ISD::LoadExtType ExtType = LD->getExtensionType();
4792 if (ExtType == ISD::NON_EXTLOAD) {
4793 Lo = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(),LD->getSrcValueOffset());
4794 if (VT == MVT::f32 || VT == MVT::f64) {
4795 // f32->i32 or f64->i64 one to one expansion.
4796 // Remember that we legalized the chain.
4797 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
4798 // Recursively expand the new load.
4799 if (getTypeAction(NVT) == Expand)
4800 ExpandOp(Lo, Lo, Hi);
4804 // Increment the pointer to the other half.
4805 unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8;
4806 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
4807 getIntPtrConstant(IncrementSize));
4808 // FIXME: This creates a bogus srcvalue!
4809 Hi = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(),LD->getSrcValueOffset());
4811 // Build a factor node to remember that this load is independent of the
4813 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
4816 // Remember that we legalized the chain.
4817 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
4818 if (!TLI.isLittleEndian())
4821 MVT::ValueType EVT = LD->getLoadedVT();
4823 if (VT == MVT::f64 && EVT == MVT::f32) {
4824 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
4825 SDOperand Load = DAG.getLoad(EVT, Ch, Ptr, LD->getSrcValue(),
4826 LD->getSrcValueOffset());
4827 // Remember that we legalized the chain.
4828 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Load.getValue(1)));
4829 ExpandOp(DAG.getNode(ISD::FP_EXTEND, VT, Load), Lo, Hi);
4834 Lo = DAG.getLoad(NVT, Ch, Ptr, LD->getSrcValue(),
4835 LD->getSrcValueOffset());
4837 Lo = DAG.getExtLoad(ExtType, NVT, Ch, Ptr, LD->getSrcValue(),
4838 LD->getSrcValueOffset(), EVT);
4840 // Remember that we legalized the chain.
4841 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
4843 if (ExtType == ISD::SEXTLOAD) {
4844 // The high part is obtained by SRA'ing all but one of the bits of the
4846 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
4847 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
4848 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
4849 } else if (ExtType == ISD::ZEXTLOAD) {
4850 // The high part is just a zero.
4851 Hi = DAG.getConstant(0, NVT);
4852 } else /* if (ExtType == ISD::EXTLOAD) */ {
4853 // The high part is undefined.
4854 Hi = DAG.getNode(ISD::UNDEF, NVT);
4861 case ISD::XOR: { // Simple logical operators -> two trivial pieces.
4862 SDOperand LL, LH, RL, RH;
4863 ExpandOp(Node->getOperand(0), LL, LH);
4864 ExpandOp(Node->getOperand(1), RL, RH);
4865 Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL);
4866 Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH);
4870 SDOperand LL, LH, RL, RH;
4871 ExpandOp(Node->getOperand(1), LL, LH);
4872 ExpandOp(Node->getOperand(2), RL, RH);
4873 if (getTypeAction(NVT) == Expand)
4874 NVT = TLI.getTypeToExpandTo(NVT);
4875 Lo = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LL, RL);
4877 Hi = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LH, RH);
4880 case ISD::SELECT_CC: {
4881 SDOperand TL, TH, FL, FH;
4882 ExpandOp(Node->getOperand(2), TL, TH);
4883 ExpandOp(Node->getOperand(3), FL, FH);
4884 if (getTypeAction(NVT) == Expand)
4885 NVT = TLI.getTypeToExpandTo(NVT);
4886 Lo = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
4887 Node->getOperand(1), TL, FL, Node->getOperand(4));
4889 Hi = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
4890 Node->getOperand(1), TH, FH, Node->getOperand(4));
4893 case ISD::ANY_EXTEND:
4894 // The low part is any extension of the input (which degenerates to a copy).
4895 Lo = DAG.getNode(ISD::ANY_EXTEND, NVT, Node->getOperand(0));
4896 // The high part is undefined.
4897 Hi = DAG.getNode(ISD::UNDEF, NVT);
4899 case ISD::SIGN_EXTEND: {
4900 // The low part is just a sign extension of the input (which degenerates to
4902 Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, Node->getOperand(0));
4904 // The high part is obtained by SRA'ing all but one of the bits of the lo
4906 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
4907 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
4908 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
4911 case ISD::ZERO_EXTEND:
4912 // The low part is just a zero extension of the input (which degenerates to
4914 Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
4916 // The high part is just a zero.
4917 Hi = DAG.getConstant(0, NVT);
4920 case ISD::TRUNCATE: {
4921 // The input value must be larger than this value. Expand *it*.
4923 ExpandOp(Node->getOperand(0), NewLo, Hi);
4925 // The low part is now either the right size, or it is closer. If not the
4926 // right size, make an illegal truncate so we recursively expand it.
4927 if (NewLo.getValueType() != Node->getValueType(0))
4928 NewLo = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), NewLo);
4929 ExpandOp(NewLo, Lo, Hi);
4933 case ISD::BIT_CONVERT: {
4935 if (TLI.getOperationAction(ISD::BIT_CONVERT, VT) == TargetLowering::Custom){
4936 // If the target wants to, allow it to lower this itself.
4937 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4938 case Expand: assert(0 && "cannot expand FP!");
4939 case Legal: Tmp = LegalizeOp(Node->getOperand(0)); break;
4940 case Promote: Tmp = PromoteOp (Node->getOperand(0)); break;
4942 Tmp = TLI.LowerOperation(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp), DAG);
4945 // f32 / f64 must be expanded to i32 / i64.
4946 if (VT == MVT::f32 || VT == MVT::f64) {
4947 Lo = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
4948 if (getTypeAction(NVT) == Expand)
4949 ExpandOp(Lo, Lo, Hi);
4953 // If source operand will be expanded to the same type as VT, i.e.
4954 // i64 <- f64, i32 <- f32, expand the source operand instead.
4955 MVT::ValueType VT0 = Node->getOperand(0).getValueType();
4956 if (getTypeAction(VT0) == Expand && TLI.getTypeToTransformTo(VT0) == VT) {
4957 ExpandOp(Node->getOperand(0), Lo, Hi);
4961 // Turn this into a load/store pair by default.
4963 Tmp = ExpandBIT_CONVERT(VT, Node->getOperand(0));
4965 ExpandOp(Tmp, Lo, Hi);
4969 case ISD::READCYCLECOUNTER:
4970 assert(TLI.getOperationAction(ISD::READCYCLECOUNTER, VT) ==
4971 TargetLowering::Custom &&
4972 "Must custom expand ReadCycleCounter");
4973 Lo = TLI.LowerOperation(Op, DAG);
4974 assert(Lo.Val && "Node must be custom expanded!");
4975 Hi = Lo.getValue(1);
4976 AddLegalizedOperand(SDOperand(Node, 1), // Remember we legalized the chain.
4977 LegalizeOp(Lo.getValue(2)));
4980 // These operators cannot be expanded directly, emit them as calls to
4981 // library functions.
4982 case ISD::FP_TO_SINT: {
4983 if (TLI.getOperationAction(ISD::FP_TO_SINT, VT) == TargetLowering::Custom) {
4985 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4986 case Expand: assert(0 && "cannot expand FP!");
4987 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
4988 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
4991 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_SINT, VT, Op), DAG);
4993 // Now that the custom expander is done, expand the result, which is still
4996 ExpandOp(Op, Lo, Hi);
5002 if (Node->getOperand(0).getValueType() == MVT::f32)
5003 LC = RTLIB::FPTOSINT_F32_I64;
5005 LC = RTLIB::FPTOSINT_F64_I64;
5006 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node,
5007 false/*sign irrelevant*/, Hi);
5011 case ISD::FP_TO_UINT: {
5012 if (TLI.getOperationAction(ISD::FP_TO_UINT, VT) == TargetLowering::Custom) {
5014 switch (getTypeAction(Node->getOperand(0).getValueType())) {
5015 case Expand: assert(0 && "cannot expand FP!");
5016 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
5017 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
5020 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_UINT, VT, Op), DAG);
5022 // Now that the custom expander is done, expand the result.
5024 ExpandOp(Op, Lo, Hi);
5030 if (Node->getOperand(0).getValueType() == MVT::f32)
5031 LC = RTLIB::FPTOUINT_F32_I64;
5033 LC = RTLIB::FPTOUINT_F64_I64;
5034 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node,
5035 false/*sign irrelevant*/, Hi);
5040 // If the target wants custom lowering, do so.
5041 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
5042 if (TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Custom) {
5043 SDOperand Op = DAG.getNode(ISD::SHL, VT, Node->getOperand(0), ShiftAmt);
5044 Op = TLI.LowerOperation(Op, DAG);
5046 // Now that the custom expander is done, expand the result, which is
5048 ExpandOp(Op, Lo, Hi);
5053 // If ADDC/ADDE are supported and if the shift amount is a constant 1, emit
5054 // this X << 1 as X+X.
5055 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(ShiftAmt)) {
5056 if (ShAmt->getValue() == 1 && TLI.isOperationLegal(ISD::ADDC, NVT) &&
5057 TLI.isOperationLegal(ISD::ADDE, NVT)) {
5058 SDOperand LoOps[2], HiOps[3];
5059 ExpandOp(Node->getOperand(0), LoOps[0], HiOps[0]);
5060 SDVTList VTList = DAG.getVTList(LoOps[0].getValueType(), MVT::Flag);
5061 LoOps[1] = LoOps[0];
5062 Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2);
5064 HiOps[1] = HiOps[0];
5065 HiOps[2] = Lo.getValue(1);
5066 Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3);
5071 // If we can emit an efficient shift operation, do so now.
5072 if (ExpandShift(ISD::SHL, Node->getOperand(0), ShiftAmt, Lo, Hi))
5075 // If this target supports SHL_PARTS, use it.
5076 TargetLowering::LegalizeAction Action =
5077 TLI.getOperationAction(ISD::SHL_PARTS, NVT);
5078 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
5079 Action == TargetLowering::Custom) {
5080 ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
5084 // Otherwise, emit a libcall.
5085 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SHL_I64), Node,
5086 false/*left shift=unsigned*/, Hi);
5091 // If the target wants custom lowering, do so.
5092 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
5093 if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Custom) {
5094 SDOperand Op = DAG.getNode(ISD::SRA, VT, Node->getOperand(0), ShiftAmt);
5095 Op = TLI.LowerOperation(Op, DAG);
5097 // Now that the custom expander is done, expand the result, which is
5099 ExpandOp(Op, Lo, Hi);
5104 // If we can emit an efficient shift operation, do so now.
5105 if (ExpandShift(ISD::SRA, Node->getOperand(0), ShiftAmt, Lo, Hi))
5108 // If this target supports SRA_PARTS, use it.
5109 TargetLowering::LegalizeAction Action =
5110 TLI.getOperationAction(ISD::SRA_PARTS, NVT);
5111 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
5112 Action == TargetLowering::Custom) {
5113 ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
5117 // Otherwise, emit a libcall.
5118 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SRA_I64), Node,
5119 true/*ashr is signed*/, Hi);
5124 // If the target wants custom lowering, do so.
5125 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
5126 if (TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Custom) {
5127 SDOperand Op = DAG.getNode(ISD::SRL, VT, Node->getOperand(0), ShiftAmt);
5128 Op = TLI.LowerOperation(Op, DAG);
5130 // Now that the custom expander is done, expand the result, which is
5132 ExpandOp(Op, Lo, Hi);
5137 // If we can emit an efficient shift operation, do so now.
5138 if (ExpandShift(ISD::SRL, Node->getOperand(0), ShiftAmt, Lo, Hi))
5141 // If this target supports SRL_PARTS, use it.
5142 TargetLowering::LegalizeAction Action =
5143 TLI.getOperationAction(ISD::SRL_PARTS, NVT);
5144 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
5145 Action == TargetLowering::Custom) {
5146 ExpandShiftParts(ISD::SRL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
5150 // Otherwise, emit a libcall.
5151 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SRL_I64), Node,
5152 false/*lshr is unsigned*/, Hi);
5158 // If the target wants to custom expand this, let them.
5159 if (TLI.getOperationAction(Node->getOpcode(), VT) ==
5160 TargetLowering::Custom) {
5161 Op = TLI.LowerOperation(Op, DAG);
5163 ExpandOp(Op, Lo, Hi);
5168 // Expand the subcomponents.
5169 SDOperand LHSL, LHSH, RHSL, RHSH;
5170 ExpandOp(Node->getOperand(0), LHSL, LHSH);
5171 ExpandOp(Node->getOperand(1), RHSL, RHSH);
5172 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
5173 SDOperand LoOps[2], HiOps[3];
5178 if (Node->getOpcode() == ISD::ADD) {
5179 Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2);
5180 HiOps[2] = Lo.getValue(1);
5181 Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3);
5183 Lo = DAG.getNode(ISD::SUBC, VTList, LoOps, 2);
5184 HiOps[2] = Lo.getValue(1);
5185 Hi = DAG.getNode(ISD::SUBE, VTList, HiOps, 3);
5190 // If the target wants to custom expand this, let them.
5191 if (TLI.getOperationAction(ISD::MUL, VT) == TargetLowering::Custom) {
5192 SDOperand New = TLI.LowerOperation(Op, DAG);
5194 ExpandOp(New, Lo, Hi);
5199 bool HasMULHS = TLI.isOperationLegal(ISD::MULHS, NVT);
5200 bool HasMULHU = TLI.isOperationLegal(ISD::MULHU, NVT);
5201 if (HasMULHS || HasMULHU) {
5202 SDOperand LL, LH, RL, RH;
5203 ExpandOp(Node->getOperand(0), LL, LH);
5204 ExpandOp(Node->getOperand(1), RL, RH);
5205 unsigned SH = MVT::getSizeInBits(RH.getValueType())-1;
5206 // FIXME: Move this to the dag combiner.
5207 // MULHS implicitly sign extends its inputs. Check to see if ExpandOp
5208 // extended the sign bit of the low half through the upper half, and if so
5209 // emit a MULHS instead of the alternate sequence that is valid for any
5210 // i64 x i64 multiply.
5212 // is RH an extension of the sign bit of RL?
5213 RH.getOpcode() == ISD::SRA && RH.getOperand(0) == RL &&
5214 RH.getOperand(1).getOpcode() == ISD::Constant &&
5215 cast<ConstantSDNode>(RH.getOperand(1))->getValue() == SH &&
5216 // is LH an extension of the sign bit of LL?
5217 LH.getOpcode() == ISD::SRA && LH.getOperand(0) == LL &&
5218 LH.getOperand(1).getOpcode() == ISD::Constant &&
5219 cast<ConstantSDNode>(LH.getOperand(1))->getValue() == SH) {
5221 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
5223 Hi = DAG.getNode(ISD::MULHS, NVT, LL, RL);
5225 } else if (HasMULHU) {
5227 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
5230 Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL);
5231 RH = DAG.getNode(ISD::MUL, NVT, LL, RH);
5232 LH = DAG.getNode(ISD::MUL, NVT, LH, RL);
5233 Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH);
5234 Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH);
5239 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::MUL_I64), Node,
5240 false/*sign irrelevant*/, Hi);
5244 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SDIV_I64), Node, true, Hi);
5247 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::UDIV_I64), Node, true, Hi);
5250 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::SREM_I64), Node, true, Hi);
5253 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::UREM_I64), Node, true, Hi);
5257 Lo = ExpandLibCall(TLI.getLibcallName((VT == MVT::f32)
5258 ? RTLIB::ADD_F32 : RTLIB::ADD_F64),
5262 Lo = ExpandLibCall(TLI.getLibcallName((VT == MVT::f32)
5263 ? RTLIB::SUB_F32 : RTLIB::SUB_F64),
5267 Lo = ExpandLibCall(TLI.getLibcallName((VT == MVT::f32)
5268 ? RTLIB::MUL_F32 : RTLIB::MUL_F64),
5272 Lo = ExpandLibCall(TLI.getLibcallName((VT == MVT::f32)
5273 ? RTLIB::DIV_F32 : RTLIB::DIV_F64),
5276 case ISD::FP_EXTEND:
5277 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::FPEXT_F32_F64), Node, true,Hi);
5280 Lo = ExpandLibCall(TLI.getLibcallName(RTLIB::FPROUND_F64_F32),Node,true,Hi);
5285 RTLIB::Libcall LC = RTLIB::UNKNOWN_LIBCALL;
5286 switch(Node->getOpcode()) {
5288 LC = (VT == MVT::f32) ? RTLIB::SQRT_F32 : RTLIB::SQRT_F64;
5291 LC = (VT == MVT::f32) ? RTLIB::SIN_F32 : RTLIB::SIN_F64;
5294 LC = (VT == MVT::f32) ? RTLIB::COS_F32 : RTLIB::COS_F64;
5296 default: assert(0 && "Unreachable!");
5298 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node, false, Hi);
5302 SDOperand Mask = (VT == MVT::f64)
5303 ? DAG.getConstantFP(BitsToDouble(~(1ULL << 63)), VT)
5304 : DAG.getConstantFP(BitsToFloat(~(1U << 31)), VT);
5305 Mask = DAG.getNode(ISD::BIT_CONVERT, NVT, Mask);
5306 Lo = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
5307 Lo = DAG.getNode(ISD::AND, NVT, Lo, Mask);
5308 if (getTypeAction(NVT) == Expand)
5309 ExpandOp(Lo, Lo, Hi);
5313 SDOperand Mask = (VT == MVT::f64)
5314 ? DAG.getConstantFP(BitsToDouble(1ULL << 63), VT)
5315 : DAG.getConstantFP(BitsToFloat(1U << 31), VT);
5316 Mask = DAG.getNode(ISD::BIT_CONVERT, NVT, Mask);
5317 Lo = DAG.getNode(ISD::BIT_CONVERT, NVT, Node->getOperand(0));
5318 Lo = DAG.getNode(ISD::XOR, NVT, Lo, Mask);
5319 if (getTypeAction(NVT) == Expand)
5320 ExpandOp(Lo, Lo, Hi);
5323 case ISD::FCOPYSIGN: {
5324 Lo = ExpandFCOPYSIGNToBitwiseOps(Node, NVT, DAG, TLI);
5325 if (getTypeAction(NVT) == Expand)
5326 ExpandOp(Lo, Lo, Hi);
5329 case ISD::SINT_TO_FP:
5330 case ISD::UINT_TO_FP: {
5331 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
5332 MVT::ValueType SrcVT = Node->getOperand(0).getValueType();
5334 if (Node->getOperand(0).getValueType() == MVT::i64) {
5336 LC = isSigned ? RTLIB::SINTTOFP_I64_F32 : RTLIB::UINTTOFP_I64_F32;
5338 LC = isSigned ? RTLIB::SINTTOFP_I64_F64 : RTLIB::UINTTOFP_I64_F64;
5341 LC = isSigned ? RTLIB::SINTTOFP_I32_F32 : RTLIB::UINTTOFP_I32_F32;
5343 LC = isSigned ? RTLIB::SINTTOFP_I32_F64 : RTLIB::UINTTOFP_I32_F64;
5346 // Promote the operand if needed.
5347 if (getTypeAction(SrcVT) == Promote) {
5348 SDOperand Tmp = PromoteOp(Node->getOperand(0));
5350 ? DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp.getValueType(), Tmp,
5351 DAG.getValueType(SrcVT))
5352 : DAG.getZeroExtendInReg(Tmp, SrcVT);
5353 Node = DAG.UpdateNodeOperands(Op, Tmp).Val;
5355 Lo = ExpandLibCall(TLI.getLibcallName(LC), Node, isSigned, Hi);
5360 // Make sure the resultant values have been legalized themselves, unless this
5361 // is a type that requires multi-step expansion.
5362 if (getTypeAction(NVT) != Expand && NVT != MVT::isVoid) {
5363 Lo = LegalizeOp(Lo);
5365 // Don't legalize the high part if it is expanded to a single node.
5366 Hi = LegalizeOp(Hi);
5369 // Remember in a map if the values will be reused later.
5370 bool isNew = ExpandedNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi)));
5371 assert(isNew && "Value already expanded?!?");
5374 /// SplitVectorOp - Given an operand of MVT::Vector type, break it down into
5375 /// two smaller values of MVT::Vector type.
5376 void SelectionDAGLegalize::SplitVectorOp(SDOperand Op, SDOperand &Lo,
5378 assert(Op.getValueType() == MVT::Vector && "Cannot split non-vector type!");
5379 SDNode *Node = Op.Val;
5380 unsigned NumElements = cast<ConstantSDNode>(*(Node->op_end()-2))->getValue();
5381 assert(NumElements > 1 && "Cannot split a single element vector!");
5382 unsigned NewNumElts = NumElements/2;
5383 SDOperand NewNumEltsNode = DAG.getConstant(NewNumElts, MVT::i32);
5384 SDOperand TypeNode = *(Node->op_end()-1);
5386 // See if we already split it.
5387 std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
5388 = SplitNodes.find(Op);
5389 if (I != SplitNodes.end()) {
5390 Lo = I->second.first;
5391 Hi = I->second.second;
5395 switch (Node->getOpcode()) {
5400 assert(0 && "Unhandled operation in SplitVectorOp!");
5401 case ISD::VBUILD_VECTOR: {
5402 SmallVector<SDOperand, 8> LoOps(Node->op_begin(),
5403 Node->op_begin()+NewNumElts);
5404 LoOps.push_back(NewNumEltsNode);
5405 LoOps.push_back(TypeNode);
5406 Lo = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &LoOps[0], LoOps.size());
5408 SmallVector<SDOperand, 8> HiOps(Node->op_begin()+NewNumElts,
5410 HiOps.push_back(NewNumEltsNode);
5411 HiOps.push_back(TypeNode);
5412 Hi = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &HiOps[0], HiOps.size());
5423 SDOperand LL, LH, RL, RH;
5424 SplitVectorOp(Node->getOperand(0), LL, LH);
5425 SplitVectorOp(Node->getOperand(1), RL, RH);
5427 Lo = DAG.getNode(Node->getOpcode(), MVT::Vector, LL, RL,
5428 NewNumEltsNode, TypeNode);
5429 Hi = DAG.getNode(Node->getOpcode(), MVT::Vector, LH, RH,
5430 NewNumEltsNode, TypeNode);
5434 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
5435 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
5436 MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT();
5438 Lo = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2));
5439 unsigned IncrementSize = NewNumElts * MVT::getSizeInBits(EVT)/8;
5440 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
5441 getIntPtrConstant(IncrementSize));
5442 // FIXME: This creates a bogus srcvalue!
5443 Hi = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2));
5445 // Build a factor node to remember that this load is independent of the
5447 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
5450 // Remember that we legalized the chain.
5451 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
5454 case ISD::VBIT_CONVERT: {
5455 // We know the result is a vector. The input may be either a vector or a
5457 if (Op.getOperand(0).getValueType() != MVT::Vector) {
5458 // Lower to a store/load. FIXME: this could be improved probably.
5459 SDOperand Ptr = CreateStackTemporary(Op.getOperand(0).getValueType());
5461 SDOperand St = DAG.getStore(DAG.getEntryNode(),
5462 Op.getOperand(0), Ptr, NULL, 0);
5463 MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT();
5464 St = DAG.getVecLoad(NumElements, EVT, St, Ptr, DAG.getSrcValue(0));
5465 SplitVectorOp(St, Lo, Hi);
5467 // If the input is a vector type, we have to either scalarize it, pack it
5468 // or convert it based on whether the input vector type is legal.
5469 SDNode *InVal = Node->getOperand(0).Val;
5471 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
5472 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
5474 // If the input is from a single element vector, scalarize the vector,
5475 // then treat like a scalar.
5476 if (NumElems == 1) {
5477 SDOperand Scalar = PackVectorOp(Op.getOperand(0), EVT);
5478 Scalar = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Scalar,
5479 Op.getOperand(1), Op.getOperand(2));
5480 SplitVectorOp(Scalar, Lo, Hi);
5482 // Split the input vector.
5483 SplitVectorOp(Op.getOperand(0), Lo, Hi);
5485 // Convert each of the pieces now.
5486 Lo = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Lo,
5487 NewNumEltsNode, TypeNode);
5488 Hi = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Hi,
5489 NewNumEltsNode, TypeNode);
5496 // Remember in a map if the values will be reused later.
5498 SplitNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
5499 assert(isNew && "Value already expanded?!?");
5503 /// PackVectorOp - Given an operand of MVT::Vector type, convert it into the
5504 /// equivalent operation that returns a scalar (e.g. F32) or packed value
5505 /// (e.g. MVT::V4F32). When this is called, we know that PackedVT is the right
5506 /// type for the result.
5507 SDOperand SelectionDAGLegalize::PackVectorOp(SDOperand Op,
5508 MVT::ValueType NewVT) {
5509 assert(Op.getValueType() == MVT::Vector && "Bad PackVectorOp invocation!");
5510 SDNode *Node = Op.Val;
5512 // See if we already packed it.
5513 std::map<SDOperand, SDOperand>::iterator I = PackedNodes.find(Op);
5514 if (I != PackedNodes.end()) return I->second;
5517 switch (Node->getOpcode()) {
5520 Node->dump(); cerr << "\n";
5522 assert(0 && "Unknown vector operation in PackVectorOp!");
5531 Result = DAG.getNode(getScalarizedOpcode(Node->getOpcode(), NewVT),
5533 PackVectorOp(Node->getOperand(0), NewVT),
5534 PackVectorOp(Node->getOperand(1), NewVT));
5537 SDOperand Ch = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
5538 SDOperand Ptr = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
5540 SrcValueSDNode *SV = cast<SrcValueSDNode>(Node->getOperand(2));
5541 Result = DAG.getLoad(NewVT, Ch, Ptr, SV->getValue(), SV->getOffset());
5543 // Remember that we legalized the chain.
5544 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
5547 case ISD::VBUILD_VECTOR:
5548 if (Node->getOperand(0).getValueType() == NewVT) {
5549 // Returning a scalar?
5550 Result = Node->getOperand(0);
5552 // Returning a BUILD_VECTOR?
5554 // If all elements of the build_vector are undefs, return an undef.
5555 bool AllUndef = true;
5556 for (unsigned i = 0, e = Node->getNumOperands()-2; i != e; ++i)
5557 if (Node->getOperand(i).getOpcode() != ISD::UNDEF) {
5562 Result = DAG.getNode(ISD::UNDEF, NewVT);
5564 Result = DAG.getNode(ISD::BUILD_VECTOR, NewVT, Node->op_begin(),
5565 Node->getNumOperands()-2);
5569 case ISD::VINSERT_VECTOR_ELT:
5570 if (!MVT::isVector(NewVT)) {
5571 // Returning a scalar? Must be the inserted element.
5572 Result = Node->getOperand(1);
5574 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, NewVT,
5575 PackVectorOp(Node->getOperand(0), NewVT),
5576 Node->getOperand(1), Node->getOperand(2));
5579 case ISD::VVECTOR_SHUFFLE:
5580 if (!MVT::isVector(NewVT)) {
5581 // Returning a scalar? Figure out if it is the LHS or RHS and return it.
5582 SDOperand EltNum = Node->getOperand(2).getOperand(0);
5583 if (cast<ConstantSDNode>(EltNum)->getValue())
5584 Result = PackVectorOp(Node->getOperand(1), NewVT);
5586 Result = PackVectorOp(Node->getOperand(0), NewVT);
5588 // Otherwise, return a VECTOR_SHUFFLE node. First convert the index
5589 // vector from a VBUILD_VECTOR to a BUILD_VECTOR.
5590 std::vector<SDOperand> BuildVecIdx(Node->getOperand(2).Val->op_begin(),
5591 Node->getOperand(2).Val->op_end()-2);
5592 MVT::ValueType BVT = MVT::getIntVectorWithNumElements(BuildVecIdx.size());
5593 SDOperand BV = DAG.getNode(ISD::BUILD_VECTOR, BVT,
5594 Node->getOperand(2).Val->op_begin(),
5595 Node->getOperand(2).Val->getNumOperands()-2);
5597 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NewVT,
5598 PackVectorOp(Node->getOperand(0), NewVT),
5599 PackVectorOp(Node->getOperand(1), NewVT), BV);
5602 case ISD::VBIT_CONVERT:
5603 if (Op.getOperand(0).getValueType() != MVT::Vector)
5604 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT, Op.getOperand(0));
5606 // If the input is a vector type, we have to either scalarize it, pack it
5607 // or convert it based on whether the input vector type is legal.
5608 SDNode *InVal = Node->getOperand(0).Val;
5610 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
5611 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
5613 // Figure out if there is a Packed type corresponding to this Vector
5614 // type. If so, convert to the vector type.
5615 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
5616 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
5617 // Turn this into a bit convert of the packed input.
5618 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT,
5619 PackVectorOp(Node->getOperand(0), TVT));
5621 } else if (NumElems == 1) {
5622 // Turn this into a bit convert of the scalar input.
5623 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT,
5624 PackVectorOp(Node->getOperand(0), EVT));
5628 assert(0 && "Cast from unsupported vector type not implemented yet!");
5633 Result = DAG.getNode(ISD::SELECT, NewVT, Op.getOperand(0),
5634 PackVectorOp(Op.getOperand(1), NewVT),
5635 PackVectorOp(Op.getOperand(2), NewVT));
5639 if (TLI.isTypeLegal(NewVT))
5640 Result = LegalizeOp(Result);
5641 bool isNew = PackedNodes.insert(std::make_pair(Op, Result)).second;
5642 assert(isNew && "Value already packed?");
5647 // SelectionDAG::Legalize - This is the entry point for the file.
5649 void SelectionDAG::Legalize() {
5650 if (ViewLegalizeDAGs) viewGraph();
5652 /// run - This is the main entry point to this class.
5654 SelectionDAGLegalize(*this).LegalizeDAG();