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/Target/TargetLowering.h"
18 #include "llvm/Target/TargetData.h"
19 #include "llvm/Target/TargetOptions.h"
20 #include "llvm/CallingConv.h"
21 #include "llvm/Constants.h"
22 #include "llvm/Support/MathExtras.h"
23 #include "llvm/Support/CommandLine.h"
30 ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
31 cl::desc("Pop up a window to show dags before legalize"));
33 static const bool ViewLegalizeDAGs = 0;
36 //===----------------------------------------------------------------------===//
37 /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
38 /// hacks on it until the target machine can handle it. This involves
39 /// eliminating value sizes the machine cannot handle (promoting small sizes to
40 /// large sizes or splitting up large values into small values) as well as
41 /// eliminating operations the machine cannot handle.
43 /// This code also does a small amount of optimization and recognition of idioms
44 /// as part of its processing. For example, if a target does not support a
45 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
46 /// will attempt merge setcc and brc instructions into brcc's.
49 class SelectionDAGLegalize {
53 // Libcall insertion helpers.
55 /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been
56 /// legalized. We use this to ensure that calls are properly serialized
57 /// against each other, including inserted libcalls.
58 SDOperand LastCALLSEQ_END;
60 /// IsLegalizingCall - This member is used *only* for purposes of providing
61 /// helpful assertions that a libcall isn't created while another call is
62 /// being legalized (which could lead to non-serialized call sequences).
63 bool IsLegalizingCall;
66 Legal, // The target natively supports this operation.
67 Promote, // This operation should be executed in a larger type.
68 Expand, // Try to expand this to other ops, otherwise use a libcall.
71 /// ValueTypeActions - This is a bitvector that contains two bits for each
72 /// value type, where the two bits correspond to the LegalizeAction enum.
73 /// This can be queried with "getTypeAction(VT)".
74 TargetLowering::ValueTypeActionImpl ValueTypeActions;
76 /// LegalizedNodes - For nodes that are of legal width, and that have more
77 /// than one use, this map indicates what regularized operand to use. This
78 /// allows us to avoid legalizing the same thing more than once.
79 std::map<SDOperand, SDOperand> LegalizedNodes;
81 /// PromotedNodes - For nodes that are below legal width, and that have more
82 /// than one use, this map indicates what promoted value to use. This allows
83 /// us to avoid promoting the same thing more than once.
84 std::map<SDOperand, SDOperand> PromotedNodes;
86 /// ExpandedNodes - For nodes that need to be expanded this map indicates
87 /// which which operands are the expanded version of the input. This allows
88 /// us to avoid expanding the same node more than once.
89 std::map<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes;
91 /// SplitNodes - For vector nodes that need to be split, this map indicates
92 /// which which operands are the split version of the input. This allows us
93 /// to avoid splitting the same node more than once.
94 std::map<SDOperand, std::pair<SDOperand, SDOperand> > SplitNodes;
96 /// PackedNodes - For nodes that need to be packed from MVT::Vector types to
97 /// concrete packed types, this contains the mapping of ones we have already
98 /// processed to the result.
99 std::map<SDOperand, SDOperand> PackedNodes;
101 void AddLegalizedOperand(SDOperand From, SDOperand To) {
102 LegalizedNodes.insert(std::make_pair(From, To));
103 // If someone requests legalization of the new node, return itself.
105 LegalizedNodes.insert(std::make_pair(To, To));
107 void AddPromotedOperand(SDOperand From, SDOperand To) {
108 bool isNew = PromotedNodes.insert(std::make_pair(From, To)).second;
109 assert(isNew && "Got into the map somehow?");
110 // If someone requests legalization of the new node, return itself.
111 LegalizedNodes.insert(std::make_pair(To, To));
116 SelectionDAGLegalize(SelectionDAG &DAG);
118 /// getTypeAction - Return how we should legalize values of this type, either
119 /// it is already legal or we need to expand it into multiple registers of
120 /// smaller integer type, or we need to promote it to a larger type.
121 LegalizeAction getTypeAction(MVT::ValueType VT) const {
122 return (LegalizeAction)ValueTypeActions.getTypeAction(VT);
125 /// isTypeLegal - Return true if this type is legal on this target.
127 bool isTypeLegal(MVT::ValueType VT) const {
128 return getTypeAction(VT) == Legal;
134 /// HandleOp - Legalize, Promote, Expand or Pack the specified operand as
135 /// appropriate for its type.
136 void HandleOp(SDOperand Op);
138 /// LegalizeOp - We know that the specified value has a legal type.
139 /// Recursively ensure that the operands have legal types, then return the
141 SDOperand LegalizeOp(SDOperand O);
143 /// PromoteOp - Given an operation that produces a value in an invalid type,
144 /// promote it to compute the value into a larger type. The produced value
145 /// will have the correct bits for the low portion of the register, but no
146 /// guarantee is made about the top bits: it may be zero, sign-extended, or
148 SDOperand PromoteOp(SDOperand O);
150 /// ExpandOp - Expand the specified SDOperand into its two component pieces
151 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this,
152 /// the LegalizeNodes map is filled in for any results that are not expanded,
153 /// the ExpandedNodes map is filled in for any results that are expanded, and
154 /// the Lo/Hi values are returned. This applies to integer types and Vector
156 void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
158 /// SplitVectorOp - Given an operand of MVT::Vector type, break it down into
159 /// two smaller values of MVT::Vector type.
160 void SplitVectorOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
162 /// PackVectorOp - Given an operand of MVT::Vector type, convert it into the
163 /// equivalent operation that returns a packed value (e.g. MVT::V4F32). When
164 /// this is called, we know that PackedVT is the right type for the result and
165 /// we know that this type is legal for the target.
166 SDOperand PackVectorOp(SDOperand O, MVT::ValueType PackedVT);
168 /// isShuffleLegal - Return true if a vector shuffle is legal with the
169 /// specified mask and type. Targets can specify exactly which masks they
170 /// support and the code generator is tasked with not creating illegal masks.
172 /// Note that this will also return true for shuffles that are promoted to a
175 /// If this is a legal shuffle, this method returns the (possibly promoted)
176 /// build_vector Mask. If it's not a legal shuffle, it returns null.
177 SDNode *isShuffleLegal(MVT::ValueType VT, SDOperand Mask) const;
179 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest);
181 void LegalizeSetCCOperands(SDOperand &LHS, SDOperand &RHS, SDOperand &CC);
183 SDOperand CreateStackTemporary(MVT::ValueType VT);
185 SDOperand ExpandLibCall(const char *Name, SDNode *Node,
187 SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy,
190 SDOperand ExpandBIT_CONVERT(MVT::ValueType DestVT, SDOperand SrcOp);
191 SDOperand ExpandBUILD_VECTOR(SDNode *Node);
192 SDOperand ExpandSCALAR_TO_VECTOR(SDNode *Node);
193 SDOperand ExpandLegalINT_TO_FP(bool isSigned,
195 MVT::ValueType DestVT);
196 SDOperand PromoteLegalINT_TO_FP(SDOperand LegalOp, MVT::ValueType DestVT,
198 SDOperand PromoteLegalFP_TO_INT(SDOperand LegalOp, MVT::ValueType DestVT,
201 SDOperand ExpandBSWAP(SDOperand Op);
202 SDOperand ExpandBitCount(unsigned Opc, SDOperand Op);
203 bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt,
204 SDOperand &Lo, SDOperand &Hi);
205 void ExpandShiftParts(unsigned NodeOp, SDOperand Op, SDOperand Amt,
206 SDOperand &Lo, SDOperand &Hi);
208 SDOperand LowerVEXTRACT_VECTOR_ELT(SDOperand Op);
209 SDOperand ExpandEXTRACT_VECTOR_ELT(SDOperand Op);
211 SDOperand getIntPtrConstant(uint64_t Val) {
212 return DAG.getConstant(Val, TLI.getPointerTy());
217 /// isVectorShuffleLegal - Return true if a vector shuffle is legal with the
218 /// specified mask and type. Targets can specify exactly which masks they
219 /// support and the code generator is tasked with not creating illegal masks.
221 /// Note that this will also return true for shuffles that are promoted to a
223 SDNode *SelectionDAGLegalize::isShuffleLegal(MVT::ValueType VT,
224 SDOperand Mask) const {
225 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE, VT)) {
227 case TargetLowering::Legal:
228 case TargetLowering::Custom:
230 case TargetLowering::Promote: {
231 // If this is promoted to a different type, convert the shuffle mask and
232 // ask if it is legal in the promoted type!
233 MVT::ValueType NVT = TLI.getTypeToPromoteTo(ISD::VECTOR_SHUFFLE, VT);
235 // If we changed # elements, change the shuffle mask.
236 unsigned NumEltsGrowth =
237 MVT::getVectorNumElements(NVT) / MVT::getVectorNumElements(VT);
238 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
239 if (NumEltsGrowth > 1) {
240 // Renumber the elements.
241 std::vector<SDOperand> Ops;
242 for (unsigned i = 0, e = Mask.getNumOperands(); i != e; ++i) {
243 SDOperand InOp = Mask.getOperand(i);
244 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
245 if (InOp.getOpcode() == ISD::UNDEF)
246 Ops.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
248 unsigned InEltNo = cast<ConstantSDNode>(InOp)->getValue();
249 Ops.push_back(DAG.getConstant(InEltNo*NumEltsGrowth+j, MVT::i32));
253 Mask = DAG.getNode(ISD::BUILD_VECTOR, NVT, Ops);
259 return TLI.isShuffleMaskLegal(Mask, VT) ? Mask.Val : 0;
262 /// getScalarizedOpcode - Return the scalar opcode that corresponds to the
263 /// specified vector opcode.
264 static unsigned getScalarizedOpcode(unsigned VecOp, MVT::ValueType VT) {
266 default: assert(0 && "Don't know how to scalarize this opcode!");
267 case ISD::VADD: return MVT::isInteger(VT) ? ISD::ADD : ISD::FADD;
268 case ISD::VSUB: return MVT::isInteger(VT) ? ISD::SUB : ISD::FSUB;
269 case ISD::VMUL: return MVT::isInteger(VT) ? ISD::MUL : ISD::FMUL;
270 case ISD::VSDIV: return MVT::isInteger(VT) ? ISD::SDIV: ISD::FDIV;
271 case ISD::VUDIV: return MVT::isInteger(VT) ? ISD::UDIV: ISD::FDIV;
272 case ISD::VAND: return MVT::isInteger(VT) ? ISD::AND : 0;
273 case ISD::VOR: return MVT::isInteger(VT) ? ISD::OR : 0;
274 case ISD::VXOR: return MVT::isInteger(VT) ? ISD::XOR : 0;
278 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
279 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
280 ValueTypeActions(TLI.getValueTypeActions()) {
281 assert(MVT::LAST_VALUETYPE <= 32 &&
282 "Too many value types for ValueTypeActions to hold!");
285 /// ComputeTopDownOrdering - Add the specified node to the Order list if it has
286 /// not been visited yet and if all of its operands have already been visited.
287 static void ComputeTopDownOrdering(SDNode *N, std::vector<SDNode*> &Order,
288 std::map<SDNode*, unsigned> &Visited) {
289 if (++Visited[N] != N->getNumOperands())
290 return; // Haven't visited all operands yet
294 if (N->hasOneUse()) { // Tail recurse in common case.
295 ComputeTopDownOrdering(*N->use_begin(), Order, Visited);
299 // Now that we have N in, add anything that uses it if all of their operands
301 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); UI != E;++UI)
302 ComputeTopDownOrdering(*UI, Order, Visited);
306 void SelectionDAGLegalize::LegalizeDAG() {
307 LastCALLSEQ_END = DAG.getEntryNode();
308 IsLegalizingCall = false;
310 // The legalize process is inherently a bottom-up recursive process (users
311 // legalize their uses before themselves). Given infinite stack space, we
312 // could just start legalizing on the root and traverse the whole graph. In
313 // practice however, this causes us to run out of stack space on large basic
314 // blocks. To avoid this problem, compute an ordering of the nodes where each
315 // node is only legalized after all of its operands are legalized.
316 std::map<SDNode*, unsigned> Visited;
317 std::vector<SDNode*> Order;
319 // Compute ordering from all of the leaves in the graphs, those (like the
320 // entry node) that have no operands.
321 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
322 E = DAG.allnodes_end(); I != E; ++I) {
323 if (I->getNumOperands() == 0) {
325 ComputeTopDownOrdering(I, Order, Visited);
329 assert(Order.size() == Visited.size() &&
331 (unsigned)std::distance(DAG.allnodes_begin(), DAG.allnodes_end()) &&
332 "Error: DAG is cyclic!");
335 for (unsigned i = 0, e = Order.size(); i != e; ++i)
336 HandleOp(SDOperand(Order[i], 0));
338 // Finally, it's possible the root changed. Get the new root.
339 SDOperand OldRoot = DAG.getRoot();
340 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
341 DAG.setRoot(LegalizedNodes[OldRoot]);
343 ExpandedNodes.clear();
344 LegalizedNodes.clear();
345 PromotedNodes.clear();
349 // Remove dead nodes now.
350 DAG.RemoveDeadNodes(OldRoot.Val);
354 /// FindCallEndFromCallStart - Given a chained node that is part of a call
355 /// sequence, find the CALLSEQ_END node that terminates the call sequence.
356 static SDNode *FindCallEndFromCallStart(SDNode *Node) {
357 if (Node->getOpcode() == ISD::CALLSEQ_END)
359 if (Node->use_empty())
360 return 0; // No CallSeqEnd
362 // The chain is usually at the end.
363 SDOperand TheChain(Node, Node->getNumValues()-1);
364 if (TheChain.getValueType() != MVT::Other) {
365 // Sometimes it's at the beginning.
366 TheChain = SDOperand(Node, 0);
367 if (TheChain.getValueType() != MVT::Other) {
368 // Otherwise, hunt for it.
369 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
370 if (Node->getValueType(i) == MVT::Other) {
371 TheChain = SDOperand(Node, i);
375 // Otherwise, we walked into a node without a chain.
376 if (TheChain.getValueType() != MVT::Other)
381 for (SDNode::use_iterator UI = Node->use_begin(),
382 E = Node->use_end(); UI != E; ++UI) {
384 // Make sure to only follow users of our token chain.
386 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
387 if (User->getOperand(i) == TheChain)
388 if (SDNode *Result = FindCallEndFromCallStart(User))
394 /// FindCallStartFromCallEnd - Given a chained node that is part of a call
395 /// sequence, find the CALLSEQ_START node that initiates the call sequence.
396 static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
397 assert(Node && "Didn't find callseq_start for a call??");
398 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
400 assert(Node->getOperand(0).getValueType() == MVT::Other &&
401 "Node doesn't have a token chain argument!");
402 return FindCallStartFromCallEnd(Node->getOperand(0).Val);
405 /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
406 /// see if any uses can reach Dest. If no dest operands can get to dest,
407 /// legalize them, legalize ourself, and return false, otherwise, return true.
408 bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N,
410 if (N == Dest) return true; // N certainly leads to Dest :)
412 // If the first result of this node has been already legalized, then it cannot
414 switch (getTypeAction(N->getValueType(0))) {
416 if (LegalizedNodes.count(SDOperand(N, 0))) return false;
419 if (PromotedNodes.count(SDOperand(N, 0))) return false;
422 if (ExpandedNodes.count(SDOperand(N, 0))) return false;
426 // Okay, this node has not already been legalized. Check and legalize all
427 // operands. If none lead to Dest, then we can legalize this node.
428 bool OperandsLeadToDest = false;
429 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
430 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
431 LegalizeAllNodesNotLeadingTo(N->getOperand(i).Val, Dest);
433 if (OperandsLeadToDest) return true;
435 // Okay, this node looks safe, legalize it and return false.
436 HandleOp(SDOperand(N, 0));
440 /// HandleOp - Legalize, Promote, Expand or Pack the specified operand as
441 /// appropriate for its type.
442 void SelectionDAGLegalize::HandleOp(SDOperand Op) {
443 switch (getTypeAction(Op.getValueType())) {
444 default: assert(0 && "Bad type action!");
445 case Legal: LegalizeOp(Op); break;
446 case Promote: PromoteOp(Op); break;
448 if (Op.getValueType() != MVT::Vector) {
453 unsigned NumOps = N->getNumOperands();
454 unsigned NumElements =
455 cast<ConstantSDNode>(N->getOperand(NumOps-2))->getValue();
456 MVT::ValueType EVT = cast<VTSDNode>(N->getOperand(NumOps-1))->getVT();
457 MVT::ValueType PackedVT = getVectorType(EVT, NumElements);
458 if (PackedVT != MVT::Other && TLI.isTypeLegal(PackedVT)) {
459 // In the common case, this is a legal vector type, convert it to the
460 // packed operation and type now.
461 PackVectorOp(Op, PackedVT);
462 } else if (NumElements == 1) {
463 // Otherwise, if this is a single element vector, convert it to a
465 PackVectorOp(Op, EVT);
467 // Otherwise, this is a multiple element vector that isn't supported.
468 // Split it in half and legalize both parts.
470 SplitVectorOp(Op, X, Y);
478 /// LegalizeOp - We know that the specified value has a legal type.
479 /// Recursively ensure that the operands have legal types, then return the
481 SDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) {
482 assert(isTypeLegal(Op.getValueType()) &&
483 "Caller should expand or promote operands that are not legal!");
484 SDNode *Node = Op.Val;
486 // If this operation defines any values that cannot be represented in a
487 // register on this target, make sure to expand or promote them.
488 if (Node->getNumValues() > 1) {
489 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
490 if (getTypeAction(Node->getValueType(i)) != Legal) {
491 HandleOp(Op.getValue(i));
492 assert(LegalizedNodes.count(Op) &&
493 "Handling didn't add legal operands!");
494 return LegalizedNodes[Op];
498 // Note that LegalizeOp may be reentered even from single-use nodes, which
499 // means that we always must cache transformed nodes.
500 std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
501 if (I != LegalizedNodes.end()) return I->second;
503 SDOperand Tmp1, Tmp2, Tmp3, Tmp4;
504 SDOperand Result = Op;
505 bool isCustom = false;
507 switch (Node->getOpcode()) {
508 case ISD::FrameIndex:
509 case ISD::EntryToken:
511 case ISD::BasicBlock:
512 case ISD::TargetFrameIndex:
513 case ISD::TargetJumpTable:
514 case ISD::TargetConstant:
515 case ISD::TargetConstantFP:
516 case ISD::TargetConstantPool:
517 case ISD::TargetGlobalAddress:
518 case ISD::TargetExternalSymbol:
523 // Primitives must all be legal.
524 assert(TLI.isOperationLegal(Node->getValueType(0), Node->getValueType(0)) &&
525 "This must be legal!");
528 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
529 // If this is a target node, legalize it by legalizing the operands then
530 // passing it through.
531 std::vector<SDOperand> Ops;
532 bool Changed = false;
533 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
534 Ops.push_back(LegalizeOp(Node->getOperand(i)));
535 Changed = Changed || Node->getOperand(i) != Ops.back();
538 if (Node->getNumValues() == 1)
539 Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Ops);
541 std::vector<MVT::ValueType> VTs(Node->value_begin(),
543 Result = DAG.getNode(Node->getOpcode(), VTs, Ops);
546 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
547 AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
548 return Result.getValue(Op.ResNo);
550 // Otherwise this is an unhandled builtin node. splat.
551 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
552 assert(0 && "Do not know how to legalize this operator!");
554 case ISD::GlobalAddress:
555 case ISD::ExternalSymbol:
556 case ISD::ConstantPool:
557 case ISD::JumpTable: // Nothing to do.
558 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
559 default: assert(0 && "This action is not supported yet!");
560 case TargetLowering::Custom:
561 Tmp1 = TLI.LowerOperation(Op, DAG);
562 if (Tmp1.Val) Result = Tmp1;
563 // FALLTHROUGH if the target doesn't want to lower this op after all.
564 case TargetLowering::Legal:
568 case ISD::AssertSext:
569 case ISD::AssertZext:
570 Tmp1 = LegalizeOp(Node->getOperand(0));
571 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
573 case ISD::MERGE_VALUES:
574 // Legalize eliminates MERGE_VALUES nodes.
575 Result = Node->getOperand(Op.ResNo);
577 case ISD::CopyFromReg:
578 Tmp1 = LegalizeOp(Node->getOperand(0));
579 Result = Op.getValue(0);
580 if (Node->getNumValues() == 2) {
581 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
583 assert(Node->getNumValues() == 3 && "Invalid copyfromreg!");
584 if (Node->getNumOperands() == 3) {
585 Tmp2 = LegalizeOp(Node->getOperand(2));
586 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
588 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
590 AddLegalizedOperand(Op.getValue(2), Result.getValue(2));
592 // Since CopyFromReg produces two values, make sure to remember that we
593 // legalized both of them.
594 AddLegalizedOperand(Op.getValue(0), Result);
595 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
596 return Result.getValue(Op.ResNo);
598 MVT::ValueType VT = Op.getValueType();
599 switch (TLI.getOperationAction(ISD::UNDEF, VT)) {
600 default: assert(0 && "This action is not supported yet!");
601 case TargetLowering::Expand:
602 if (MVT::isInteger(VT))
603 Result = DAG.getConstant(0, VT);
604 else if (MVT::isFloatingPoint(VT))
605 Result = DAG.getConstantFP(0, VT);
607 assert(0 && "Unknown value type!");
609 case TargetLowering::Legal:
615 case ISD::INTRINSIC_W_CHAIN:
616 case ISD::INTRINSIC_WO_CHAIN:
617 case ISD::INTRINSIC_VOID: {
618 std::vector<SDOperand> Ops;
619 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
620 Ops.push_back(LegalizeOp(Node->getOperand(i)));
621 Result = DAG.UpdateNodeOperands(Result, Ops);
623 // Allow the target to custom lower its intrinsics if it wants to.
624 if (TLI.getOperationAction(Node->getOpcode(), MVT::Other) ==
625 TargetLowering::Custom) {
626 Tmp3 = TLI.LowerOperation(Result, DAG);
627 if (Tmp3.Val) Result = Tmp3;
630 if (Result.Val->getNumValues() == 1) break;
632 // Must have return value and chain result.
633 assert(Result.Val->getNumValues() == 2 &&
634 "Cannot return more than two values!");
636 // Since loads produce two values, make sure to remember that we
637 // legalized both of them.
638 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
639 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
640 return Result.getValue(Op.ResNo);
644 assert(Node->getNumOperands() == 5 && "Invalid LOCATION node!");
645 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input chain.
647 switch (TLI.getOperationAction(ISD::LOCATION, MVT::Other)) {
648 case TargetLowering::Promote:
649 default: assert(0 && "This action is not supported yet!");
650 case TargetLowering::Expand: {
651 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
652 bool useDEBUG_LOC = TLI.isOperationLegal(ISD::DEBUG_LOC, MVT::Other);
653 bool useDEBUG_LABEL = TLI.isOperationLegal(ISD::DEBUG_LABEL, MVT::Other);
655 if (DebugInfo && (useDEBUG_LOC || useDEBUG_LABEL)) {
656 const std::string &FName =
657 cast<StringSDNode>(Node->getOperand(3))->getValue();
658 const std::string &DirName =
659 cast<StringSDNode>(Node->getOperand(4))->getValue();
660 unsigned SrcFile = DebugInfo->RecordSource(DirName, FName);
662 std::vector<SDOperand> Ops;
663 Ops.push_back(Tmp1); // chain
664 SDOperand LineOp = Node->getOperand(1);
665 SDOperand ColOp = Node->getOperand(2);
668 Ops.push_back(LineOp); // line #
669 Ops.push_back(ColOp); // col #
670 Ops.push_back(DAG.getConstant(SrcFile, MVT::i32)); // source file id
671 Result = DAG.getNode(ISD::DEBUG_LOC, MVT::Other, Ops);
673 unsigned Line = cast<ConstantSDNode>(LineOp)->getValue();
674 unsigned Col = cast<ConstantSDNode>(ColOp)->getValue();
675 unsigned ID = DebugInfo->RecordLabel(Line, Col, SrcFile);
676 Ops.push_back(DAG.getConstant(ID, MVT::i32));
677 Result = DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops);
680 Result = Tmp1; // chain
684 case TargetLowering::Legal:
685 if (Tmp1 != Node->getOperand(0) ||
686 getTypeAction(Node->getOperand(1).getValueType()) == Promote) {
687 std::vector<SDOperand> Ops;
689 if (getTypeAction(Node->getOperand(1).getValueType()) == Legal) {
690 Ops.push_back(Node->getOperand(1)); // line # must be legal.
691 Ops.push_back(Node->getOperand(2)); // col # must be legal.
693 // Otherwise promote them.
694 Ops.push_back(PromoteOp(Node->getOperand(1)));
695 Ops.push_back(PromoteOp(Node->getOperand(2)));
697 Ops.push_back(Node->getOperand(3)); // filename must be legal.
698 Ops.push_back(Node->getOperand(4)); // working dir # must be legal.
699 Result = DAG.UpdateNodeOperands(Result, Ops);
706 assert(Node->getNumOperands() == 4 && "Invalid DEBUG_LOC node!");
707 switch (TLI.getOperationAction(ISD::DEBUG_LOC, MVT::Other)) {
708 default: assert(0 && "This action is not supported yet!");
709 case TargetLowering::Legal:
710 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
711 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the line #.
712 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the col #.
713 Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize the source file id.
714 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4);
719 case ISD::DEBUG_LABEL:
720 assert(Node->getNumOperands() == 2 && "Invalid DEBUG_LABEL node!");
721 switch (TLI.getOperationAction(ISD::DEBUG_LABEL, MVT::Other)) {
722 default: assert(0 && "This action is not supported yet!");
723 case TargetLowering::Legal:
724 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
725 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the label id.
726 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
732 // We know we don't need to expand constants here, constants only have one
733 // value and we check that it is fine above.
735 // FIXME: Maybe we should handle things like targets that don't support full
736 // 32-bit immediates?
738 case ISD::ConstantFP: {
739 // Spill FP immediates to the constant pool if the target cannot directly
740 // codegen them. Targets often have some immediate values that can be
741 // efficiently generated into an FP register without a load. We explicitly
742 // leave these constants as ConstantFP nodes for the target to deal with.
743 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
745 // Check to see if this FP immediate is already legal.
746 bool isLegal = false;
747 for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(),
748 E = TLI.legal_fpimm_end(); I != E; ++I)
749 if (CFP->isExactlyValue(*I)) {
754 // If this is a legal constant, turn it into a TargetConstantFP node.
756 Result = DAG.getTargetConstantFP(CFP->getValue(), CFP->getValueType(0));
760 switch (TLI.getOperationAction(ISD::ConstantFP, CFP->getValueType(0))) {
761 default: assert(0 && "This action is not supported yet!");
762 case TargetLowering::Custom:
763 Tmp3 = TLI.LowerOperation(Result, DAG);
769 case TargetLowering::Expand:
770 // Otherwise we need to spill the constant to memory.
773 // If a FP immediate is precise when represented as a float and if the
774 // target can do an extending load from float to double, we put it into
775 // the constant pool as a float, even if it's is statically typed as a
777 MVT::ValueType VT = CFP->getValueType(0);
778 bool isDouble = VT == MVT::f64;
779 ConstantFP *LLVMC = ConstantFP::get(isDouble ? Type::DoubleTy :
780 Type::FloatTy, CFP->getValue());
781 if (isDouble && CFP->isExactlyValue((float)CFP->getValue()) &&
782 // Only do this if the target has a native EXTLOAD instruction from
784 TLI.isOperationLegal(ISD::EXTLOAD, MVT::f32)) {
785 LLVMC = cast<ConstantFP>(ConstantExpr::getCast(LLVMC, Type::FloatTy));
790 SDOperand CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
792 Result = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
793 CPIdx, DAG.getSrcValue(NULL), MVT::f32);
795 Result = DAG.getLoad(VT, DAG.getEntryNode(), CPIdx,
796 DAG.getSrcValue(NULL));
801 case ISD::TokenFactor:
802 if (Node->getNumOperands() == 2) {
803 Tmp1 = LegalizeOp(Node->getOperand(0));
804 Tmp2 = LegalizeOp(Node->getOperand(1));
805 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
806 } else if (Node->getNumOperands() == 3) {
807 Tmp1 = LegalizeOp(Node->getOperand(0));
808 Tmp2 = LegalizeOp(Node->getOperand(1));
809 Tmp3 = LegalizeOp(Node->getOperand(2));
810 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
812 std::vector<SDOperand> Ops;
813 // Legalize the operands.
814 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
815 Ops.push_back(LegalizeOp(Node->getOperand(i)));
816 Result = DAG.UpdateNodeOperands(Result, Ops);
820 case ISD::FORMAL_ARGUMENTS:
821 // The only option for this is to custom lower it.
822 Result = TLI.LowerOperation(Result, DAG);
823 assert(Result.Val && "Target didn't custom lower ISD::FORMAL_ARGUMENTS!");
826 case ISD::BUILD_VECTOR:
827 switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) {
828 default: assert(0 && "This action is not supported yet!");
829 case TargetLowering::Custom:
830 Tmp3 = TLI.LowerOperation(Result, DAG);
836 case TargetLowering::Expand:
837 Result = ExpandBUILD_VECTOR(Result.Val);
841 case ISD::INSERT_VECTOR_ELT:
842 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVec
843 Tmp2 = LegalizeOp(Node->getOperand(1)); // InVal
844 Tmp3 = LegalizeOp(Node->getOperand(2)); // InEltNo
845 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
847 switch (TLI.getOperationAction(ISD::INSERT_VECTOR_ELT,
848 Node->getValueType(0))) {
849 default: assert(0 && "This action is not supported yet!");
850 case TargetLowering::Legal:
852 case TargetLowering::Custom:
853 Tmp3 = TLI.LowerOperation(Result, DAG);
859 case TargetLowering::Expand: {
860 // If the insert index is a constant, codegen this as a scalar_to_vector,
861 // then a shuffle that inserts it into the right position in the vector.
862 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Tmp3)) {
863 SDOperand ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR,
864 Tmp1.getValueType(), Tmp2);
866 unsigned NumElts = MVT::getVectorNumElements(Tmp1.getValueType());
867 MVT::ValueType ShufMaskVT = MVT::getIntVectorWithNumElements(NumElts);
868 MVT::ValueType ShufMaskEltVT = MVT::getVectorBaseType(ShufMaskVT);
870 // We generate a shuffle of InVec and ScVec, so the shuffle mask should
871 // be 0,1,2,3,4,5... with the appropriate element replaced with elt 0 of
873 std::vector<SDOperand> ShufOps;
874 for (unsigned i = 0; i != NumElts; ++i) {
875 if (i != InsertPos->getValue())
876 ShufOps.push_back(DAG.getConstant(i, ShufMaskEltVT));
878 ShufOps.push_back(DAG.getConstant(NumElts, ShufMaskEltVT));
880 SDOperand ShufMask = DAG.getNode(ISD::BUILD_VECTOR, ShufMaskVT,ShufOps);
882 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, Tmp1.getValueType(),
883 Tmp1, ScVec, ShufMask);
884 Result = LegalizeOp(Result);
888 // If the target doesn't support this, we have to spill the input vector
889 // to a temporary stack slot, update the element, then reload it. This is
890 // badness. We could also load the value into a vector register (either
891 // with a "move to register" or "extload into register" instruction, then
892 // permute it into place, if the idx is a constant and if the idx is
893 // supported by the target.
894 MVT::ValueType VT = Tmp1.getValueType();
895 MVT::ValueType EltVT = Tmp2.getValueType();
896 MVT::ValueType IdxVT = Tmp3.getValueType();
897 MVT::ValueType PtrVT = TLI.getPointerTy();
898 SDOperand StackPtr = CreateStackTemporary(VT);
900 SDOperand Ch = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
901 Tmp1, StackPtr, DAG.getSrcValue(NULL));
903 // Truncate or zero extend offset to target pointer type.
904 unsigned CastOpc = (IdxVT > PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
905 Tmp3 = DAG.getNode(CastOpc, PtrVT, Tmp3);
906 // Add the offset to the index.
907 unsigned EltSize = MVT::getSizeInBits(EltVT)/8;
908 Tmp3 = DAG.getNode(ISD::MUL, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
909 SDOperand StackPtr2 = DAG.getNode(ISD::ADD, IdxVT, Tmp3, StackPtr);
910 // Store the scalar value.
911 Ch = DAG.getNode(ISD::STORE, MVT::Other, Ch,
912 Tmp2, StackPtr2, DAG.getSrcValue(NULL));
913 // Load the updated vector.
914 Result = DAG.getLoad(VT, Ch, StackPtr, DAG.getSrcValue(NULL));
919 case ISD::SCALAR_TO_VECTOR:
920 if (!TLI.isTypeLegal(Node->getOperand(0).getValueType())) {
921 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
925 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVal
926 Result = DAG.UpdateNodeOperands(Result, Tmp1);
927 switch (TLI.getOperationAction(ISD::SCALAR_TO_VECTOR,
928 Node->getValueType(0))) {
929 default: assert(0 && "This action is not supported yet!");
930 case TargetLowering::Legal:
932 case TargetLowering::Custom:
933 Tmp3 = TLI.LowerOperation(Result, DAG);
939 case TargetLowering::Expand:
940 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
944 case ISD::VECTOR_SHUFFLE:
945 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input vectors,
946 Tmp2 = LegalizeOp(Node->getOperand(1)); // but not the shuffle mask.
947 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
949 // Allow targets to custom lower the SHUFFLEs they support.
950 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE,Result.getValueType())) {
951 default: assert(0 && "Unknown operation action!");
952 case TargetLowering::Legal:
953 assert(isShuffleLegal(Result.getValueType(), Node->getOperand(2)) &&
954 "vector shuffle should not be created if not legal!");
956 case TargetLowering::Custom:
957 Tmp3 = TLI.LowerOperation(Result, DAG);
963 case TargetLowering::Expand: {
964 MVT::ValueType VT = Node->getValueType(0);
965 MVT::ValueType EltVT = MVT::getVectorBaseType(VT);
966 MVT::ValueType PtrVT = TLI.getPointerTy();
967 SDOperand Mask = Node->getOperand(2);
968 unsigned NumElems = Mask.getNumOperands();
969 std::vector<SDOperand> Ops;
970 for (unsigned i = 0; i != NumElems; ++i) {
971 SDOperand Arg = Mask.getOperand(i);
972 if (Arg.getOpcode() == ISD::UNDEF) {
973 Ops.push_back(DAG.getNode(ISD::UNDEF, EltVT));
975 assert(isa<ConstantSDNode>(Arg) && "Invalid VECTOR_SHUFFLE mask!");
976 unsigned Idx = cast<ConstantSDNode>(Arg)->getValue();
978 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1,
979 DAG.getConstant(Idx, PtrVT)));
981 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2,
982 DAG.getConstant(Idx - NumElems, PtrVT)));
985 Result = DAG.getNode(ISD::BUILD_VECTOR, VT, Ops);
988 case TargetLowering::Promote: {
989 // Change base type to a different vector type.
990 MVT::ValueType OVT = Node->getValueType(0);
991 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
993 // Cast the two input vectors.
994 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
995 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
997 // Convert the shuffle mask to the right # elements.
998 Tmp3 = SDOperand(isShuffleLegal(OVT, Node->getOperand(2)), 0);
999 assert(Tmp3.Val && "Shuffle not legal?");
1000 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NVT, Tmp1, Tmp2, Tmp3);
1001 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
1007 case ISD::EXTRACT_VECTOR_ELT:
1008 Tmp1 = LegalizeOp(Node->getOperand(0));
1009 Tmp2 = LegalizeOp(Node->getOperand(1));
1010 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1012 switch (TLI.getOperationAction(ISD::EXTRACT_VECTOR_ELT,
1013 Tmp1.getValueType())) {
1014 default: assert(0 && "This action is not supported yet!");
1015 case TargetLowering::Legal:
1017 case TargetLowering::Custom:
1018 Tmp3 = TLI.LowerOperation(Result, DAG);
1024 case TargetLowering::Expand:
1025 Result = ExpandEXTRACT_VECTOR_ELT(Result);
1030 case ISD::VEXTRACT_VECTOR_ELT:
1031 Result = LegalizeOp(LowerVEXTRACT_VECTOR_ELT(Op));
1034 case ISD::CALLSEQ_START: {
1035 SDNode *CallEnd = FindCallEndFromCallStart(Node);
1037 // Recursively Legalize all of the inputs of the call end that do not lead
1038 // to this call start. This ensures that any libcalls that need be inserted
1039 // are inserted *before* the CALLSEQ_START.
1040 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
1041 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).Val, Node);
1043 // Now that we legalized all of the inputs (which may have inserted
1044 // libcalls) create the new CALLSEQ_START node.
1045 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1047 // Merge in the last call, to ensure that this call start after the last
1049 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1050 Tmp1 = LegalizeOp(Tmp1);
1052 // Do not try to legalize the target-specific arguments (#1+).
1053 if (Tmp1 != Node->getOperand(0)) {
1054 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
1056 Result = DAG.UpdateNodeOperands(Result, Ops);
1059 // Remember that the CALLSEQ_START is legalized.
1060 AddLegalizedOperand(Op.getValue(0), Result);
1061 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
1062 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1064 // Now that the callseq_start and all of the non-call nodes above this call
1065 // sequence have been legalized, legalize the call itself. During this
1066 // process, no libcalls can/will be inserted, guaranteeing that no calls
1068 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
1069 SDOperand InCallSEQ = LastCALLSEQ_END;
1070 // Note that we are selecting this call!
1071 LastCALLSEQ_END = SDOperand(CallEnd, 0);
1072 IsLegalizingCall = true;
1074 // Legalize the call, starting from the CALLSEQ_END.
1075 LegalizeOp(LastCALLSEQ_END);
1076 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
1079 case ISD::CALLSEQ_END:
1080 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
1081 // will cause this node to be legalized as well as handling libcalls right.
1082 if (LastCALLSEQ_END.Val != Node) {
1083 LegalizeOp(SDOperand(FindCallStartFromCallEnd(Node), 0));
1084 std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
1085 assert(I != LegalizedNodes.end() &&
1086 "Legalizing the call start should have legalized this node!");
1090 // Otherwise, the call start has been legalized and everything is going
1091 // according to plan. Just legalize ourselves normally here.
1092 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1093 // Do not try to legalize the target-specific arguments (#1+), except for
1094 // an optional flag input.
1095 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
1096 if (Tmp1 != Node->getOperand(0)) {
1097 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
1099 Result = DAG.UpdateNodeOperands(Result, Ops);
1102 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
1103 if (Tmp1 != Node->getOperand(0) ||
1104 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
1105 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
1108 Result = DAG.UpdateNodeOperands(Result, Ops);
1111 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
1112 // This finishes up call legalization.
1113 IsLegalizingCall = false;
1115 // If the CALLSEQ_END node has a flag, remember that we legalized it.
1116 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1117 if (Node->getNumValues() == 2)
1118 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1119 return Result.getValue(Op.ResNo);
1120 case ISD::DYNAMIC_STACKALLOC: {
1121 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1122 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size.
1123 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment.
1124 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1126 Tmp1 = Result.getValue(0);
1127 Tmp2 = Result.getValue(1);
1128 switch (TLI.getOperationAction(Node->getOpcode(),
1129 Node->getValueType(0))) {
1130 default: assert(0 && "This action is not supported yet!");
1131 case TargetLowering::Expand: {
1132 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1133 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1134 " not tell us which reg is the stack pointer!");
1135 SDOperand Chain = Tmp1.getOperand(0);
1136 SDOperand Size = Tmp2.getOperand(1);
1137 SDOperand SP = DAG.getCopyFromReg(Chain, SPReg, Node->getValueType(0));
1138 Tmp1 = DAG.getNode(ISD::SUB, Node->getValueType(0), SP, Size); // Value
1139 Tmp2 = DAG.getCopyToReg(SP.getValue(1), SPReg, Tmp1); // Output chain
1140 Tmp1 = LegalizeOp(Tmp1);
1141 Tmp2 = LegalizeOp(Tmp2);
1144 case TargetLowering::Custom:
1145 Tmp3 = TLI.LowerOperation(Tmp1, DAG);
1147 Tmp1 = LegalizeOp(Tmp3);
1148 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1151 case TargetLowering::Legal:
1154 // Since this op produce two values, make sure to remember that we
1155 // legalized both of them.
1156 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1157 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1158 return Op.ResNo ? Tmp2 : Tmp1;
1160 case ISD::INLINEASM:
1161 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize Chain.
1162 Tmp2 = Node->getOperand(Node->getNumOperands()-1);
1163 if (Tmp2.getValueType() == MVT::Flag) // Legalize Flag if it exists.
1164 Tmp2 = Tmp3 = SDOperand(0, 0);
1166 Tmp3 = LegalizeOp(Tmp2);
1168 if (Tmp1 != Node->getOperand(0) || Tmp2 != Tmp3) {
1169 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
1171 if (Tmp3.Val) Ops.back() = Tmp3;
1172 Result = DAG.UpdateNodeOperands(Result, Ops);
1175 // INLINE asm returns a chain and flag, make sure to add both to the map.
1176 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1177 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1178 return Result.getValue(Op.ResNo);
1180 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1181 // Ensure that libcalls are emitted before a branch.
1182 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1183 Tmp1 = LegalizeOp(Tmp1);
1184 LastCALLSEQ_END = DAG.getEntryNode();
1186 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1189 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1190 // Ensure that libcalls are emitted before a branch.
1191 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1192 Tmp1 = LegalizeOp(Tmp1);
1193 LastCALLSEQ_END = DAG.getEntryNode();
1195 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1196 default: assert(0 && "Indirect target must be legal type (pointer)!");
1198 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1201 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1204 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1205 // Ensure that libcalls are emitted before a return.
1206 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1207 Tmp1 = LegalizeOp(Tmp1);
1208 LastCALLSEQ_END = DAG.getEntryNode();
1210 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1211 case Expand: assert(0 && "It's impossible to expand bools");
1213 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1216 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition.
1220 // Basic block destination (Op#2) is always legal.
1221 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1223 switch (TLI.getOperationAction(ISD::BRCOND, MVT::Other)) {
1224 default: assert(0 && "This action is not supported yet!");
1225 case TargetLowering::Legal: break;
1226 case TargetLowering::Custom:
1227 Tmp1 = TLI.LowerOperation(Result, DAG);
1228 if (Tmp1.Val) Result = Tmp1;
1230 case TargetLowering::Expand:
1231 // Expand brcond's setcc into its constituent parts and create a BR_CC
1233 if (Tmp2.getOpcode() == ISD::SETCC) {
1234 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1, Tmp2.getOperand(2),
1235 Tmp2.getOperand(0), Tmp2.getOperand(1),
1236 Node->getOperand(2));
1238 // Make sure the condition is either zero or one. It may have been
1239 // promoted from something else.
1240 unsigned NumBits = MVT::getSizeInBits(Tmp2.getValueType());
1241 if (!TLI.MaskedValueIsZero(Tmp2, (~0ULL >> (64-NumBits))^1))
1242 Tmp2 = DAG.getZeroExtendInReg(Tmp2, MVT::i1);
1244 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1,
1245 DAG.getCondCode(ISD::SETNE), Tmp2,
1246 DAG.getConstant(0, Tmp2.getValueType()),
1247 Node->getOperand(2));
1253 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1254 // Ensure that libcalls are emitted before a branch.
1255 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1256 Tmp1 = LegalizeOp(Tmp1);
1257 LastCALLSEQ_END = DAG.getEntryNode();
1259 Tmp2 = Node->getOperand(2); // LHS
1260 Tmp3 = Node->getOperand(3); // RHS
1261 Tmp4 = Node->getOperand(1); // CC
1263 LegalizeSetCCOperands(Tmp2, Tmp3, Tmp4);
1265 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1266 // the LHS is a legal SETCC itself. In this case, we need to compare
1267 // the result against zero to select between true and false values.
1268 if (Tmp3.Val == 0) {
1269 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
1270 Tmp4 = DAG.getCondCode(ISD::SETNE);
1273 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp4, Tmp2, Tmp3,
1274 Node->getOperand(4));
1276 switch (TLI.getOperationAction(ISD::BR_CC, Tmp3.getValueType())) {
1277 default: assert(0 && "Unexpected action for BR_CC!");
1278 case TargetLowering::Legal: break;
1279 case TargetLowering::Custom:
1280 Tmp4 = TLI.LowerOperation(Result, DAG);
1281 if (Tmp4.Val) Result = Tmp4;
1286 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1287 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1289 MVT::ValueType VT = Node->getValueType(0);
1290 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1291 Tmp3 = Result.getValue(0);
1292 Tmp4 = Result.getValue(1);
1294 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1295 default: assert(0 && "This action is not supported yet!");
1296 case TargetLowering::Legal: break;
1297 case TargetLowering::Custom:
1298 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
1300 Tmp3 = LegalizeOp(Tmp1);
1301 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1304 case TargetLowering::Promote: {
1305 // Only promote a load of vector type to another.
1306 assert(MVT::isVector(VT) && "Cannot promote this load!");
1307 // Change base type to a different vector type.
1308 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
1310 Tmp1 = DAG.getLoad(NVT, Tmp1, Tmp2, Node->getOperand(2));
1311 Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp1));
1312 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1316 // Since loads produce two values, make sure to remember that we
1317 // legalized both of them.
1318 AddLegalizedOperand(SDOperand(Node, 0), Tmp3);
1319 AddLegalizedOperand(SDOperand(Node, 1), Tmp4);
1320 return Op.ResNo ? Tmp4 : Tmp3;
1324 case ISD::ZEXTLOAD: {
1325 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1326 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1328 MVT::ValueType SrcVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
1329 switch (TLI.getOperationAction(Node->getOpcode(), SrcVT)) {
1330 default: assert(0 && "This action is not supported yet!");
1331 case TargetLowering::Promote:
1332 assert(SrcVT == MVT::i1 && "Can only promote EXTLOAD from i1 -> i8!");
1333 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2),
1334 DAG.getValueType(MVT::i8));
1335 Tmp1 = Result.getValue(0);
1336 Tmp2 = Result.getValue(1);
1338 case TargetLowering::Custom:
1341 case TargetLowering::Legal:
1342 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2),
1343 Node->getOperand(3));
1344 Tmp1 = Result.getValue(0);
1345 Tmp2 = Result.getValue(1);
1348 Tmp3 = TLI.LowerOperation(Tmp3, DAG);
1350 Tmp1 = LegalizeOp(Tmp3);
1351 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1355 case TargetLowering::Expand:
1356 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
1357 if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) {
1358 SDOperand Load = DAG.getLoad(SrcVT, Tmp1, Tmp2, Node->getOperand(2));
1359 Result = DAG.getNode(ISD::FP_EXTEND, Node->getValueType(0), Load);
1360 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
1361 Tmp2 = LegalizeOp(Load.getValue(1));
1364 assert(Node->getOpcode() != ISD::EXTLOAD &&
1365 "EXTLOAD should always be supported!");
1366 // Turn the unsupported load into an EXTLOAD followed by an explicit
1367 // zero/sign extend inreg.
1368 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
1369 Tmp1, Tmp2, Node->getOperand(2), SrcVT);
1371 if (Node->getOpcode() == ISD::SEXTLOAD)
1372 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
1373 Result, DAG.getValueType(SrcVT));
1375 ValRes = DAG.getZeroExtendInReg(Result, SrcVT);
1376 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
1377 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
1380 // Since loads produce two values, make sure to remember that we legalized
1382 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1383 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1384 return Op.ResNo ? Tmp2 : Tmp1;
1386 case ISD::EXTRACT_ELEMENT: {
1387 MVT::ValueType OpTy = Node->getOperand(0).getValueType();
1388 switch (getTypeAction(OpTy)) {
1389 default: assert(0 && "EXTRACT_ELEMENT action for type unimplemented!");
1391 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) {
1393 Result = DAG.getNode(ISD::SRL, OpTy, Node->getOperand(0),
1394 DAG.getConstant(MVT::getSizeInBits(OpTy)/2,
1395 TLI.getShiftAmountTy()));
1396 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Result);
1399 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0),
1400 Node->getOperand(0));
1404 // Get both the low and high parts.
1405 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
1406 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue())
1407 Result = Tmp2; // 1 -> Hi
1409 Result = Tmp1; // 0 -> Lo
1415 case ISD::CopyToReg:
1416 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1418 assert(isTypeLegal(Node->getOperand(2).getValueType()) &&
1419 "Register type must be legal!");
1420 // Legalize the incoming value (must be a legal type).
1421 Tmp2 = LegalizeOp(Node->getOperand(2));
1422 if (Node->getNumValues() == 1) {
1423 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2);
1425 assert(Node->getNumValues() == 2 && "Unknown CopyToReg");
1426 if (Node->getNumOperands() == 4) {
1427 Tmp3 = LegalizeOp(Node->getOperand(3));
1428 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2,
1431 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
1434 // Since this produces two values, make sure to remember that we legalized
1436 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1437 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1443 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1445 // Ensure that libcalls are emitted before a return.
1446 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1447 Tmp1 = LegalizeOp(Tmp1);
1448 LastCALLSEQ_END = DAG.getEntryNode();
1450 switch (Node->getNumOperands()) {
1452 Tmp2 = Node->getOperand(1);
1453 switch (getTypeAction(Tmp2.getValueType())) {
1455 Result = DAG.UpdateNodeOperands(Result, Tmp1, LegalizeOp(Tmp2));
1458 if (Tmp2.getValueType() != MVT::Vector) {
1460 ExpandOp(Tmp2, Lo, Hi);
1461 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Hi);
1463 SDNode *InVal = Tmp2.Val;
1465 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
1466 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
1468 // Figure out if there is a Packed type corresponding to this Vector
1469 // type. If so, convert to the packed type.
1470 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
1471 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
1472 // Turn this into a return of the packed type.
1473 Tmp2 = PackVectorOp(Tmp2, TVT);
1474 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1475 } else if (NumElems == 1) {
1476 // Turn this into a return of the scalar type.
1477 Tmp2 = PackVectorOp(Tmp2, EVT);
1478 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1480 // FIXME: Returns of gcc generic vectors smaller than a legal type
1481 // should be returned in integer registers!
1483 // The scalarized value type may not be legal, e.g. it might require
1484 // promotion or expansion. Relegalize the return.
1485 Result = LegalizeOp(Result);
1487 // FIXME: Returns of gcc generic vectors larger than a legal vector
1488 // type should be returned by reference!
1490 SplitVectorOp(Tmp2, Lo, Hi);
1491 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Hi);
1492 Result = LegalizeOp(Result);
1497 Tmp2 = PromoteOp(Node->getOperand(1));
1498 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1499 Result = LegalizeOp(Result);
1504 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1506 default: { // ret <values>
1507 std::vector<SDOperand> NewValues;
1508 NewValues.push_back(Tmp1);
1509 for (unsigned i = 1, e = Node->getNumOperands(); i != e; ++i)
1510 switch (getTypeAction(Node->getOperand(i).getValueType())) {
1512 NewValues.push_back(LegalizeOp(Node->getOperand(i)));
1516 assert(Node->getOperand(i).getValueType() != MVT::Vector &&
1517 "FIXME: TODO: implement returning non-legal vector types!");
1518 ExpandOp(Node->getOperand(i), Lo, Hi);
1519 NewValues.push_back(Lo);
1520 NewValues.push_back(Hi);
1524 assert(0 && "Can't promote multiple return value yet!");
1527 if (NewValues.size() == Node->getNumOperands())
1528 Result = DAG.UpdateNodeOperands(Result, NewValues);
1530 Result = DAG.getNode(ISD::RET, MVT::Other, NewValues);
1535 if (Result.getOpcode() == ISD::RET) {
1536 switch (TLI.getOperationAction(Result.getOpcode(), MVT::Other)) {
1537 default: assert(0 && "This action is not supported yet!");
1538 case TargetLowering::Legal: break;
1539 case TargetLowering::Custom:
1540 Tmp1 = TLI.LowerOperation(Result, DAG);
1541 if (Tmp1.Val) Result = Tmp1;
1547 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1548 Tmp2 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer.
1550 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
1551 // FIXME: We shouldn't do this for TargetConstantFP's.
1552 // FIXME: move this to the DAG Combiner!
1553 if (ConstantFPSDNode *CFP =dyn_cast<ConstantFPSDNode>(Node->getOperand(1))){
1554 if (CFP->getValueType(0) == MVT::f32) {
1555 Tmp3 = DAG.getConstant(FloatToBits(CFP->getValue()), MVT::i32);
1557 assert(CFP->getValueType(0) == MVT::f64 && "Unknown FP type!");
1558 Tmp3 = DAG.getConstant(DoubleToBits(CFP->getValue()), MVT::i64);
1560 Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Tmp3, Tmp2,
1561 Node->getOperand(3));
1565 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1567 Tmp3 = LegalizeOp(Node->getOperand(1));
1568 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1569 Node->getOperand(3));
1571 MVT::ValueType VT = Tmp3.getValueType();
1572 switch (TLI.getOperationAction(ISD::STORE, VT)) {
1573 default: assert(0 && "This action is not supported yet!");
1574 case TargetLowering::Legal: break;
1575 case TargetLowering::Custom:
1576 Tmp1 = TLI.LowerOperation(Result, DAG);
1577 if (Tmp1.Val) Result = Tmp1;
1579 case TargetLowering::Promote:
1580 assert(MVT::isVector(VT) && "Unknown legal promote case!");
1581 Tmp3 = DAG.getNode(ISD::BIT_CONVERT,
1582 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
1583 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1584 Node->getOperand(3));
1590 // Truncate the value and store the result.
1591 Tmp3 = PromoteOp(Node->getOperand(1));
1592 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp3, Tmp2,
1593 Node->getOperand(3),
1594 DAG.getValueType(Node->getOperand(1).getValueType()));
1598 unsigned IncrementSize = 0;
1601 // If this is a vector type, then we have to calculate the increment as
1602 // the product of the element size in bytes, and the number of elements
1603 // in the high half of the vector.
1604 if (Node->getOperand(1).getValueType() == MVT::Vector) {
1605 SDNode *InVal = Node->getOperand(1).Val;
1607 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
1608 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
1610 // Figure out if there is a Packed type corresponding to this Vector
1611 // type. If so, convert to the packed type.
1612 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
1613 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
1614 // Turn this into a normal store of the packed type.
1615 Tmp3 = PackVectorOp(Node->getOperand(1), TVT);
1616 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1617 Node->getOperand(3));
1618 Result = LegalizeOp(Result);
1620 } else if (NumElems == 1) {
1621 // Turn this into a normal store of the scalar type.
1622 Tmp3 = PackVectorOp(Node->getOperand(1), EVT);
1623 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1624 Node->getOperand(3));
1625 // The scalarized value type may not be legal, e.g. it might require
1626 // promotion or expansion. Relegalize the scalar store.
1627 Result = LegalizeOp(Result);
1630 SplitVectorOp(Node->getOperand(1), Lo, Hi);
1631 IncrementSize = NumElems/2 * MVT::getSizeInBits(EVT)/8;
1634 ExpandOp(Node->getOperand(1), Lo, Hi);
1635 IncrementSize = MVT::getSizeInBits(Hi.getValueType())/8;
1637 if (!TLI.isLittleEndian())
1641 Lo = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Lo, Tmp2,
1642 Node->getOperand(3));
1643 Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2,
1644 getIntPtrConstant(IncrementSize));
1645 assert(isTypeLegal(Tmp2.getValueType()) &&
1646 "Pointers must be legal!");
1647 // FIXME: This sets the srcvalue of both halves to be the same, which is
1649 Hi = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Hi, Tmp2,
1650 Node->getOperand(3));
1651 Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi);
1657 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1658 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1660 case ISD::STACKSAVE:
1661 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1662 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1663 Tmp1 = Result.getValue(0);
1664 Tmp2 = Result.getValue(1);
1666 switch (TLI.getOperationAction(ISD::STACKSAVE, MVT::Other)) {
1667 default: assert(0 && "This action is not supported yet!");
1668 case TargetLowering::Legal: break;
1669 case TargetLowering::Custom:
1670 Tmp3 = TLI.LowerOperation(Result, DAG);
1672 Tmp1 = LegalizeOp(Tmp3);
1673 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1676 case TargetLowering::Expand:
1677 // Expand to CopyFromReg if the target set
1678 // StackPointerRegisterToSaveRestore.
1679 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
1680 Tmp1 = DAG.getCopyFromReg(Result.getOperand(0), SP,
1681 Node->getValueType(0));
1682 Tmp2 = Tmp1.getValue(1);
1684 Tmp1 = DAG.getNode(ISD::UNDEF, Node->getValueType(0));
1685 Tmp2 = Node->getOperand(0);
1690 // Since stacksave produce two values, make sure to remember that we
1691 // legalized both of them.
1692 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1693 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1694 return Op.ResNo ? Tmp2 : Tmp1;
1696 case ISD::STACKRESTORE:
1697 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1698 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1699 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1701 switch (TLI.getOperationAction(ISD::STACKRESTORE, MVT::Other)) {
1702 default: assert(0 && "This action is not supported yet!");
1703 case TargetLowering::Legal: break;
1704 case TargetLowering::Custom:
1705 Tmp1 = TLI.LowerOperation(Result, DAG);
1706 if (Tmp1.Val) Result = Tmp1;
1708 case TargetLowering::Expand:
1709 // Expand to CopyToReg if the target set
1710 // StackPointerRegisterToSaveRestore.
1711 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
1712 Result = DAG.getCopyToReg(Tmp1, SP, Tmp2);
1720 case ISD::READCYCLECOUNTER:
1721 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain
1722 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1724 // Since rdcc produce two values, make sure to remember that we legalized
1726 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1727 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1730 case ISD::TRUNCSTORE: {
1731 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1732 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer.
1734 assert(isTypeLegal(Node->getOperand(1).getValueType()) &&
1735 "Cannot handle illegal TRUNCSTORE yet!");
1736 Tmp2 = LegalizeOp(Node->getOperand(1));
1738 // The only promote case we handle is TRUNCSTORE:i1 X into
1739 // -> TRUNCSTORE:i8 (and X, 1)
1740 if (cast<VTSDNode>(Node->getOperand(4))->getVT() == MVT::i1 &&
1741 TLI.getOperationAction(ISD::TRUNCSTORE, MVT::i1) ==
1742 TargetLowering::Promote) {
1743 // Promote the bool to a mask then store.
1744 Tmp2 = DAG.getNode(ISD::AND, Tmp2.getValueType(), Tmp2,
1745 DAG.getConstant(1, Tmp2.getValueType()));
1746 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp2, Tmp3,
1747 Node->getOperand(3), DAG.getValueType(MVT::i8));
1749 } else if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) ||
1750 Tmp3 != Node->getOperand(2)) {
1751 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
1752 Node->getOperand(3), Node->getOperand(4));
1755 MVT::ValueType StVT = cast<VTSDNode>(Result.Val->getOperand(4))->getVT();
1756 switch (TLI.getOperationAction(Result.Val->getOpcode(), StVT)) {
1757 default: assert(0 && "This action is not supported yet!");
1758 case TargetLowering::Legal: break;
1759 case TargetLowering::Custom:
1760 Tmp1 = TLI.LowerOperation(Result, DAG);
1761 if (Tmp1.Val) Result = Tmp1;
1767 switch (getTypeAction(Node->getOperand(0).getValueType())) {
1768 case Expand: assert(0 && "It's impossible to expand bools");
1770 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition.
1773 Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition.
1776 Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal
1777 Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal
1779 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1781 switch (TLI.getOperationAction(ISD::SELECT, Tmp2.getValueType())) {
1782 default: assert(0 && "This action is not supported yet!");
1783 case TargetLowering::Legal: break;
1784 case TargetLowering::Custom: {
1785 Tmp1 = TLI.LowerOperation(Result, DAG);
1786 if (Tmp1.Val) Result = Tmp1;
1789 case TargetLowering::Expand:
1790 if (Tmp1.getOpcode() == ISD::SETCC) {
1791 Result = DAG.getSelectCC(Tmp1.getOperand(0), Tmp1.getOperand(1),
1793 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
1795 // Make sure the condition is either zero or one. It may have been
1796 // promoted from something else.
1797 unsigned NumBits = MVT::getSizeInBits(Tmp1.getValueType());
1798 if (!TLI.MaskedValueIsZero(Tmp1, (~0ULL >> (64-NumBits))^1))
1799 Tmp1 = DAG.getZeroExtendInReg(Tmp1, MVT::i1);
1800 Result = DAG.getSelectCC(Tmp1,
1801 DAG.getConstant(0, Tmp1.getValueType()),
1802 Tmp2, Tmp3, ISD::SETNE);
1805 case TargetLowering::Promote: {
1806 MVT::ValueType NVT =
1807 TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType());
1808 unsigned ExtOp, TruncOp;
1809 if (MVT::isVector(Tmp2.getValueType())) {
1810 ExtOp = ISD::BIT_CONVERT;
1811 TruncOp = ISD::BIT_CONVERT;
1812 } else if (MVT::isInteger(Tmp2.getValueType())) {
1813 ExtOp = ISD::ANY_EXTEND;
1814 TruncOp = ISD::TRUNCATE;
1816 ExtOp = ISD::FP_EXTEND;
1817 TruncOp = ISD::FP_ROUND;
1819 // Promote each of the values to the new type.
1820 Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2);
1821 Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3);
1822 // Perform the larger operation, then round down.
1823 Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3);
1824 Result = DAG.getNode(TruncOp, Node->getValueType(0), Result);
1829 case ISD::SELECT_CC: {
1830 Tmp1 = Node->getOperand(0); // LHS
1831 Tmp2 = Node->getOperand(1); // RHS
1832 Tmp3 = LegalizeOp(Node->getOperand(2)); // True
1833 Tmp4 = LegalizeOp(Node->getOperand(3)); // False
1834 SDOperand CC = Node->getOperand(4);
1836 LegalizeSetCCOperands(Tmp1, Tmp2, CC);
1838 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1839 // the LHS is a legal SETCC itself. In this case, we need to compare
1840 // the result against zero to select between true and false values.
1841 if (Tmp2.Val == 0) {
1842 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
1843 CC = DAG.getCondCode(ISD::SETNE);
1845 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, CC);
1847 // Everything is legal, see if we should expand this op or something.
1848 switch (TLI.getOperationAction(ISD::SELECT_CC, Tmp3.getValueType())) {
1849 default: assert(0 && "This action is not supported yet!");
1850 case TargetLowering::Legal: break;
1851 case TargetLowering::Custom:
1852 Tmp1 = TLI.LowerOperation(Result, DAG);
1853 if (Tmp1.Val) Result = Tmp1;
1859 Tmp1 = Node->getOperand(0);
1860 Tmp2 = Node->getOperand(1);
1861 Tmp3 = Node->getOperand(2);
1862 LegalizeSetCCOperands(Tmp1, Tmp2, Tmp3);
1864 // If we had to Expand the SetCC operands into a SELECT node, then it may
1865 // not always be possible to return a true LHS & RHS. In this case, just
1866 // return the value we legalized, returned in the LHS
1867 if (Tmp2.Val == 0) {
1872 switch (TLI.getOperationAction(ISD::SETCC, Tmp1.getValueType())) {
1873 default: assert(0 && "Cannot handle this action for SETCC yet!");
1874 case TargetLowering::Custom:
1877 case TargetLowering::Legal:
1878 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1880 Tmp3 = TLI.LowerOperation(Result, DAG);
1881 if (Tmp3.Val) Result = Tmp3;
1884 case TargetLowering::Promote: {
1885 // First step, figure out the appropriate operation to use.
1886 // Allow SETCC to not be supported for all legal data types
1887 // Mostly this targets FP
1888 MVT::ValueType NewInTy = Node->getOperand(0).getValueType();
1889 MVT::ValueType OldVT = NewInTy;
1891 // Scan for the appropriate larger type to use.
1893 NewInTy = (MVT::ValueType)(NewInTy+1);
1895 assert(MVT::isInteger(NewInTy) == MVT::isInteger(OldVT) &&
1896 "Fell off of the edge of the integer world");
1897 assert(MVT::isFloatingPoint(NewInTy) == MVT::isFloatingPoint(OldVT) &&
1898 "Fell off of the edge of the floating point world");
1900 // If the target supports SETCC of this type, use it.
1901 if (TLI.isOperationLegal(ISD::SETCC, NewInTy))
1904 if (MVT::isInteger(NewInTy))
1905 assert(0 && "Cannot promote Legal Integer SETCC yet");
1907 Tmp1 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp1);
1908 Tmp2 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp2);
1910 Tmp1 = LegalizeOp(Tmp1);
1911 Tmp2 = LegalizeOp(Tmp2);
1912 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1913 Result = LegalizeOp(Result);
1916 case TargetLowering::Expand:
1917 // Expand a setcc node into a select_cc of the same condition, lhs, and
1918 // rhs that selects between const 1 (true) and const 0 (false).
1919 MVT::ValueType VT = Node->getValueType(0);
1920 Result = DAG.getNode(ISD::SELECT_CC, VT, Tmp1, Tmp2,
1921 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
1922 Node->getOperand(2));
1928 case ISD::MEMMOVE: {
1929 Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain
1930 Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer
1932 if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte
1933 switch (getTypeAction(Node->getOperand(2).getValueType())) {
1934 case Expand: assert(0 && "Cannot expand a byte!");
1936 Tmp3 = LegalizeOp(Node->getOperand(2));
1939 Tmp3 = PromoteOp(Node->getOperand(2));
1943 Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer,
1947 switch (getTypeAction(Node->getOperand(3).getValueType())) {
1949 // Length is too big, just take the lo-part of the length.
1951 ExpandOp(Node->getOperand(3), HiPart, Tmp4);
1955 Tmp4 = LegalizeOp(Node->getOperand(3));
1958 Tmp4 = PromoteOp(Node->getOperand(3));
1963 switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint
1964 case Expand: assert(0 && "Cannot expand this yet!");
1966 Tmp5 = LegalizeOp(Node->getOperand(4));
1969 Tmp5 = PromoteOp(Node->getOperand(4));
1973 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
1974 default: assert(0 && "This action not implemented for this operation!");
1975 case TargetLowering::Custom:
1978 case TargetLowering::Legal:
1979 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, Tmp5);
1981 Tmp1 = TLI.LowerOperation(Result, DAG);
1982 if (Tmp1.Val) Result = Tmp1;
1985 case TargetLowering::Expand: {
1986 // Otherwise, the target does not support this operation. Lower the
1987 // operation to an explicit libcall as appropriate.
1988 MVT::ValueType IntPtr = TLI.getPointerTy();
1989 const Type *IntPtrTy = TLI.getTargetData().getIntPtrType();
1990 std::vector<std::pair<SDOperand, const Type*> > Args;
1992 const char *FnName = 0;
1993 if (Node->getOpcode() == ISD::MEMSET) {
1994 Args.push_back(std::make_pair(Tmp2, IntPtrTy));
1995 // Extend the (previously legalized) ubyte argument to be an int value
1997 if (Tmp3.getValueType() > MVT::i32)
1998 Tmp3 = DAG.getNode(ISD::TRUNCATE, MVT::i32, Tmp3);
2000 Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3);
2001 Args.push_back(std::make_pair(Tmp3, Type::IntTy));
2002 Args.push_back(std::make_pair(Tmp4, IntPtrTy));
2005 } else if (Node->getOpcode() == ISD::MEMCPY ||
2006 Node->getOpcode() == ISD::MEMMOVE) {
2007 Args.push_back(std::make_pair(Tmp2, IntPtrTy));
2008 Args.push_back(std::make_pair(Tmp3, IntPtrTy));
2009 Args.push_back(std::make_pair(Tmp4, IntPtrTy));
2010 FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy";
2012 assert(0 && "Unknown op!");
2015 std::pair<SDOperand,SDOperand> CallResult =
2016 TLI.LowerCallTo(Tmp1, Type::VoidTy, false, CallingConv::C, false,
2017 DAG.getExternalSymbol(FnName, IntPtr), Args, DAG);
2018 Result = CallResult.second;
2025 case ISD::SHL_PARTS:
2026 case ISD::SRA_PARTS:
2027 case ISD::SRL_PARTS: {
2028 std::vector<SDOperand> Ops;
2029 bool Changed = false;
2030 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
2031 Ops.push_back(LegalizeOp(Node->getOperand(i)));
2032 Changed |= Ops.back() != Node->getOperand(i);
2035 Result = DAG.UpdateNodeOperands(Result, Ops);
2037 switch (TLI.getOperationAction(Node->getOpcode(),
2038 Node->getValueType(0))) {
2039 default: assert(0 && "This action is not supported yet!");
2040 case TargetLowering::Legal: break;
2041 case TargetLowering::Custom:
2042 Tmp1 = TLI.LowerOperation(Result, DAG);
2044 SDOperand Tmp2, RetVal(0, 0);
2045 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
2046 Tmp2 = LegalizeOp(Tmp1.getValue(i));
2047 AddLegalizedOperand(SDOperand(Node, i), Tmp2);
2051 assert(RetVal.Val && "Illegal result number");
2057 // Since these produce multiple values, make sure to remember that we
2058 // legalized all of them.
2059 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
2060 AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i));
2061 return Result.getValue(Op.ResNo);
2082 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2083 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2084 case Expand: assert(0 && "Not possible");
2086 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2089 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2093 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2095 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2096 default: assert(0 && "BinOp legalize operation not supported");
2097 case TargetLowering::Legal: break;
2098 case TargetLowering::Custom:
2099 Tmp1 = TLI.LowerOperation(Result, DAG);
2100 if (Tmp1.Val) Result = Tmp1;
2102 case TargetLowering::Expand: {
2103 assert(MVT::isVector(Node->getValueType(0)) &&
2104 "Cannot expand this binary operator!");
2105 // Expand the operation into a bunch of nasty scalar code.
2106 std::vector<SDOperand> Ops;
2107 MVT::ValueType EltVT = MVT::getVectorBaseType(Node->getValueType(0));
2108 MVT::ValueType PtrVT = TLI.getPointerTy();
2109 for (unsigned i = 0, e = MVT::getVectorNumElements(Node->getValueType(0));
2111 SDOperand Idx = DAG.getConstant(i, PtrVT);
2112 SDOperand LHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1, Idx);
2113 SDOperand RHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2, Idx);
2114 Ops.push_back(DAG.getNode(Node->getOpcode(), EltVT, LHS, RHS));
2116 Result = DAG.getNode(ISD::BUILD_VECTOR, Node->getValueType(0), Ops);
2119 case TargetLowering::Promote: {
2120 switch (Node->getOpcode()) {
2121 default: assert(0 && "Do not know how to promote this BinOp!");
2125 MVT::ValueType OVT = Node->getValueType(0);
2126 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2127 assert(MVT::isVector(OVT) && "Cannot promote this BinOp!");
2128 // Bit convert each of the values to the new type.
2129 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
2130 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
2131 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2132 // Bit convert the result back the original type.
2133 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
2141 case ISD::FCOPYSIGN: // FCOPYSIGN does not require LHS/RHS to match type!
2142 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2143 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2144 case Expand: assert(0 && "Not possible");
2146 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2149 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2153 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2155 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2156 default: assert(0 && "Operation not supported");
2157 case TargetLowering::Custom:
2158 Tmp1 = TLI.LowerOperation(Result, DAG);
2159 if (Tmp1.Val) Result = Tmp1;
2161 case TargetLowering::Legal: break;
2162 case TargetLowering::Expand:
2163 // If this target supports fabs/fneg natively, do this efficiently.
2164 if (TLI.isOperationLegal(ISD::FABS, Tmp1.getValueType()) &&
2165 TLI.isOperationLegal(ISD::FNEG, Tmp1.getValueType())) {
2166 // Get the sign bit of the RHS.
2167 MVT::ValueType IVT =
2168 Tmp2.getValueType() == MVT::f32 ? MVT::i32 : MVT::i64;
2169 SDOperand SignBit = DAG.getNode(ISD::BIT_CONVERT, IVT, Tmp2);
2170 SignBit = DAG.getSetCC(TLI.getSetCCResultTy(),
2171 SignBit, DAG.getConstant(0, IVT), ISD::SETLT);
2172 // Get the absolute value of the result.
2173 SDOperand AbsVal = DAG.getNode(ISD::FABS, Tmp1.getValueType(), Tmp1);
2174 // Select between the nabs and abs value based on the sign bit of
2176 Result = DAG.getNode(ISD::SELECT, AbsVal.getValueType(), SignBit,
2177 DAG.getNode(ISD::FNEG, AbsVal.getValueType(),
2180 Result = LegalizeOp(Result);
2184 // Otherwise, do bitwise ops!
2186 // copysign -> copysignf/copysign libcall.
2188 if (Node->getValueType(0) == MVT::f32) {
2189 FnName = "copysignf";
2190 if (Tmp2.getValueType() != MVT::f32) // Force operands to match type.
2191 Result = DAG.UpdateNodeOperands(Result, Tmp1,
2192 DAG.getNode(ISD::FP_ROUND, MVT::f32, Tmp2));
2194 FnName = "copysign";
2195 if (Tmp2.getValueType() != MVT::f64) // Force operands to match type.
2196 Result = DAG.UpdateNodeOperands(Result, Tmp1,
2197 DAG.getNode(ISD::FP_EXTEND, MVT::f64, Tmp2));
2200 Result = ExpandLibCall(FnName, Node, Dummy);
2207 Tmp1 = LegalizeOp(Node->getOperand(0));
2208 Tmp2 = LegalizeOp(Node->getOperand(1));
2209 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2210 // Since this produces two values, make sure to remember that we legalized
2212 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2213 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2218 Tmp1 = LegalizeOp(Node->getOperand(0));
2219 Tmp2 = LegalizeOp(Node->getOperand(1));
2220 Tmp3 = LegalizeOp(Node->getOperand(2));
2221 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2222 // Since this produces two values, make sure to remember that we legalized
2224 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2225 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2228 case ISD::BUILD_PAIR: {
2229 MVT::ValueType PairTy = Node->getValueType(0);
2230 // TODO: handle the case where the Lo and Hi operands are not of legal type
2231 Tmp1 = LegalizeOp(Node->getOperand(0)); // Lo
2232 Tmp2 = LegalizeOp(Node->getOperand(1)); // Hi
2233 switch (TLI.getOperationAction(ISD::BUILD_PAIR, PairTy)) {
2234 case TargetLowering::Promote:
2235 case TargetLowering::Custom:
2236 assert(0 && "Cannot promote/custom this yet!");
2237 case TargetLowering::Legal:
2238 if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1))
2239 Result = DAG.getNode(ISD::BUILD_PAIR, PairTy, Tmp1, Tmp2);
2241 case TargetLowering::Expand:
2242 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, PairTy, Tmp1);
2243 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, PairTy, Tmp2);
2244 Tmp2 = DAG.getNode(ISD::SHL, PairTy, Tmp2,
2245 DAG.getConstant(MVT::getSizeInBits(PairTy)/2,
2246 TLI.getShiftAmountTy()));
2247 Result = DAG.getNode(ISD::OR, PairTy, Tmp1, Tmp2);
2256 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2257 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
2259 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2260 case TargetLowering::Promote: assert(0 && "Cannot promote this yet!");
2261 case TargetLowering::Custom:
2264 case TargetLowering::Legal:
2265 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2267 Tmp1 = TLI.LowerOperation(Result, DAG);
2268 if (Tmp1.Val) Result = Tmp1;
2271 case TargetLowering::Expand:
2272 if (MVT::isInteger(Node->getValueType(0))) {
2274 MVT::ValueType VT = Node->getValueType(0);
2275 unsigned Opc = Node->getOpcode() == ISD::UREM ? ISD::UDIV : ISD::SDIV;
2276 Result = DAG.getNode(Opc, VT, Tmp1, Tmp2);
2277 Result = DAG.getNode(ISD::MUL, VT, Result, Tmp2);
2278 Result = DAG.getNode(ISD::SUB, VT, Tmp1, Result);
2280 // Floating point mod -> fmod libcall.
2281 const char *FnName = Node->getValueType(0) == MVT::f32 ? "fmodf":"fmod";
2283 Result = ExpandLibCall(FnName, Node, Dummy);
2289 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2290 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2292 MVT::ValueType VT = Node->getValueType(0);
2293 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
2294 default: assert(0 && "This action is not supported yet!");
2295 case TargetLowering::Custom:
2298 case TargetLowering::Legal:
2299 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2300 Result = Result.getValue(0);
2301 Tmp1 = Result.getValue(1);
2304 Tmp2 = TLI.LowerOperation(Result, DAG);
2306 Result = LegalizeOp(Tmp2);
2307 Tmp1 = LegalizeOp(Tmp2.getValue(1));
2311 case TargetLowering::Expand: {
2312 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
2313 Node->getOperand(2));
2314 // Increment the pointer, VAList, to the next vaarg
2315 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
2316 DAG.getConstant(MVT::getSizeInBits(VT)/8,
2317 TLI.getPointerTy()));
2318 // Store the incremented VAList to the legalized pointer
2319 Tmp3 = DAG.getNode(ISD::STORE, MVT::Other, VAList.getValue(1), Tmp3, Tmp2,
2320 Node->getOperand(2));
2321 // Load the actual argument out of the pointer VAList
2322 Result = DAG.getLoad(VT, Tmp3, VAList, DAG.getSrcValue(0));
2323 Tmp1 = LegalizeOp(Result.getValue(1));
2324 Result = LegalizeOp(Result);
2328 // Since VAARG produces two values, make sure to remember that we
2329 // legalized both of them.
2330 AddLegalizedOperand(SDOperand(Node, 0), Result);
2331 AddLegalizedOperand(SDOperand(Node, 1), Tmp1);
2332 return Op.ResNo ? Tmp1 : Result;
2336 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2337 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the dest pointer.
2338 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the source pointer.
2340 switch (TLI.getOperationAction(ISD::VACOPY, MVT::Other)) {
2341 default: assert(0 && "This action is not supported yet!");
2342 case TargetLowering::Custom:
2345 case TargetLowering::Legal:
2346 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
2347 Node->getOperand(3), Node->getOperand(4));
2349 Tmp1 = TLI.LowerOperation(Result, DAG);
2350 if (Tmp1.Val) Result = Tmp1;
2353 case TargetLowering::Expand:
2354 // This defaults to loading a pointer from the input and storing it to the
2355 // output, returning the chain.
2356 Tmp4 = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp3, Node->getOperand(3));
2357 Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp4.getValue(1), Tmp4, Tmp2,
2358 Node->getOperand(4));
2364 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2365 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2367 switch (TLI.getOperationAction(ISD::VAEND, MVT::Other)) {
2368 default: assert(0 && "This action is not supported yet!");
2369 case TargetLowering::Custom:
2372 case TargetLowering::Legal:
2373 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2375 Tmp1 = TLI.LowerOperation(Tmp1, DAG);
2376 if (Tmp1.Val) Result = Tmp1;
2379 case TargetLowering::Expand:
2380 Result = Tmp1; // Default to a no-op, return the chain
2386 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2387 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2389 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2391 switch (TLI.getOperationAction(ISD::VASTART, MVT::Other)) {
2392 default: assert(0 && "This action is not supported yet!");
2393 case TargetLowering::Legal: break;
2394 case TargetLowering::Custom:
2395 Tmp1 = TLI.LowerOperation(Result, DAG);
2396 if (Tmp1.Val) Result = Tmp1;
2403 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2404 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
2406 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
2407 "Cannot handle this yet!");
2408 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2412 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
2413 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2414 case TargetLowering::Custom:
2415 assert(0 && "Cannot custom legalize this yet!");
2416 case TargetLowering::Legal:
2417 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2419 case TargetLowering::Promote: {
2420 MVT::ValueType OVT = Tmp1.getValueType();
2421 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2422 unsigned DiffBits = getSizeInBits(NVT) - getSizeInBits(OVT);
2424 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2425 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
2426 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
2427 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
2430 case TargetLowering::Expand:
2431 Result = ExpandBSWAP(Tmp1);
2439 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
2440 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2441 case TargetLowering::Custom: assert(0 && "Cannot custom handle this yet!");
2442 case TargetLowering::Legal:
2443 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2445 case TargetLowering::Promote: {
2446 MVT::ValueType OVT = Tmp1.getValueType();
2447 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2449 // Zero extend the argument.
2450 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2451 // Perform the larger operation, then subtract if needed.
2452 Tmp1 = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1);
2453 switch (Node->getOpcode()) {
2458 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
2459 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
2460 DAG.getConstant(getSizeInBits(NVT), NVT),
2462 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
2463 DAG.getConstant(getSizeInBits(OVT),NVT), Tmp1);
2466 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
2467 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
2468 DAG.getConstant(getSizeInBits(NVT) -
2469 getSizeInBits(OVT), NVT));
2474 case TargetLowering::Expand:
2475 Result = ExpandBitCount(Node->getOpcode(), Tmp1);
2486 Tmp1 = LegalizeOp(Node->getOperand(0));
2487 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2488 case TargetLowering::Promote:
2489 case TargetLowering::Custom:
2492 case TargetLowering::Legal:
2493 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2495 Tmp1 = TLI.LowerOperation(Result, DAG);
2496 if (Tmp1.Val) Result = Tmp1;
2499 case TargetLowering::Expand:
2500 switch (Node->getOpcode()) {
2501 default: assert(0 && "Unreachable!");
2503 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
2504 Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0));
2505 Result = DAG.getNode(ISD::FSUB, Node->getValueType(0), Tmp2, Tmp1);
2508 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
2509 MVT::ValueType VT = Node->getValueType(0);
2510 Tmp2 = DAG.getConstantFP(0.0, VT);
2511 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, Tmp2, ISD::SETUGT);
2512 Tmp3 = DAG.getNode(ISD::FNEG, VT, Tmp1);
2513 Result = DAG.getNode(ISD::SELECT, VT, Tmp2, Tmp1, Tmp3);
2519 MVT::ValueType VT = Node->getValueType(0);
2520 const char *FnName = 0;
2521 switch(Node->getOpcode()) {
2522 case ISD::FSQRT: FnName = VT == MVT::f32 ? "sqrtf" : "sqrt"; break;
2523 case ISD::FSIN: FnName = VT == MVT::f32 ? "sinf" : "sin"; break;
2524 case ISD::FCOS: FnName = VT == MVT::f32 ? "cosf" : "cos"; break;
2525 default: assert(0 && "Unreachable!");
2528 Result = ExpandLibCall(FnName, Node, Dummy);
2536 case ISD::BIT_CONVERT:
2537 if (!isTypeLegal(Node->getOperand(0).getValueType())) {
2538 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2540 switch (TLI.getOperationAction(ISD::BIT_CONVERT,
2541 Node->getOperand(0).getValueType())) {
2542 default: assert(0 && "Unknown operation action!");
2543 case TargetLowering::Expand:
2544 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2546 case TargetLowering::Legal:
2547 Tmp1 = LegalizeOp(Node->getOperand(0));
2548 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2553 case ISD::VBIT_CONVERT: {
2554 assert(Op.getOperand(0).getValueType() == MVT::Vector &&
2555 "Can only have VBIT_CONVERT where input or output is MVT::Vector!");
2557 // The input has to be a vector type, we have to either scalarize it, pack
2558 // it, or convert it based on whether the input vector type is legal.
2559 SDNode *InVal = Node->getOperand(0).Val;
2561 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
2562 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
2564 // Figure out if there is a Packed type corresponding to this Vector
2565 // type. If so, convert to the packed type.
2566 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
2567 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
2568 // Turn this into a bit convert of the packed input.
2569 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
2570 PackVectorOp(Node->getOperand(0), TVT));
2572 } else if (NumElems == 1) {
2573 // Turn this into a bit convert of the scalar input.
2574 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
2575 PackVectorOp(Node->getOperand(0), EVT));
2578 // FIXME: UNIMP! Store then reload
2579 assert(0 && "Cast from unsupported vector type not implemented yet!");
2583 // Conversion operators. The source and destination have different types.
2584 case ISD::SINT_TO_FP:
2585 case ISD::UINT_TO_FP: {
2586 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
2587 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2589 switch (TLI.getOperationAction(Node->getOpcode(),
2590 Node->getOperand(0).getValueType())) {
2591 default: assert(0 && "Unknown operation action!");
2592 case TargetLowering::Custom:
2595 case TargetLowering::Legal:
2596 Tmp1 = LegalizeOp(Node->getOperand(0));
2597 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2599 Tmp1 = TLI.LowerOperation(Result, DAG);
2600 if (Tmp1.Val) Result = Tmp1;
2603 case TargetLowering::Expand:
2604 Result = ExpandLegalINT_TO_FP(isSigned,
2605 LegalizeOp(Node->getOperand(0)),
2606 Node->getValueType(0));
2608 case TargetLowering::Promote:
2609 Result = PromoteLegalINT_TO_FP(LegalizeOp(Node->getOperand(0)),
2610 Node->getValueType(0),
2616 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP,
2617 Node->getValueType(0), Node->getOperand(0));
2620 Tmp1 = PromoteOp(Node->getOperand(0));
2622 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp1.getValueType(),
2623 Tmp1, DAG.getValueType(Node->getOperand(0).getValueType()));
2625 Tmp1 = DAG.getZeroExtendInReg(Tmp1,
2626 Node->getOperand(0).getValueType());
2628 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2629 Result = LegalizeOp(Result); // The 'op' is not necessarily legal!
2635 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2637 Tmp1 = LegalizeOp(Node->getOperand(0));
2638 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2641 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2643 // Since the result is legal, we should just be able to truncate the low
2644 // part of the source.
2645 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1);
2648 Result = PromoteOp(Node->getOperand(0));
2649 Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result);
2654 case ISD::FP_TO_SINT:
2655 case ISD::FP_TO_UINT:
2656 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2658 Tmp1 = LegalizeOp(Node->getOperand(0));
2660 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))){
2661 default: assert(0 && "Unknown operation action!");
2662 case TargetLowering::Custom:
2665 case TargetLowering::Legal:
2666 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2668 Tmp1 = TLI.LowerOperation(Result, DAG);
2669 if (Tmp1.Val) Result = Tmp1;
2672 case TargetLowering::Promote:
2673 Result = PromoteLegalFP_TO_INT(Tmp1, Node->getValueType(0),
2674 Node->getOpcode() == ISD::FP_TO_SINT);
2676 case TargetLowering::Expand:
2677 if (Node->getOpcode() == ISD::FP_TO_UINT) {
2678 SDOperand True, False;
2679 MVT::ValueType VT = Node->getOperand(0).getValueType();
2680 MVT::ValueType NVT = Node->getValueType(0);
2681 unsigned ShiftAmt = MVT::getSizeInBits(Node->getValueType(0))-1;
2682 Tmp2 = DAG.getConstantFP((double)(1ULL << ShiftAmt), VT);
2683 Tmp3 = DAG.getSetCC(TLI.getSetCCResultTy(),
2684 Node->getOperand(0), Tmp2, ISD::SETLT);
2685 True = DAG.getNode(ISD::FP_TO_SINT, NVT, Node->getOperand(0));
2686 False = DAG.getNode(ISD::FP_TO_SINT, NVT,
2687 DAG.getNode(ISD::FSUB, VT, Node->getOperand(0),
2689 False = DAG.getNode(ISD::XOR, NVT, False,
2690 DAG.getConstant(1ULL << ShiftAmt, NVT));
2691 Result = DAG.getNode(ISD::SELECT, NVT, Tmp3, True, False);
2694 assert(0 && "Do not know how to expand FP_TO_SINT yet!");
2700 assert(0 && "Shouldn't need to expand other operators here!");
2702 Tmp1 = PromoteOp(Node->getOperand(0));
2703 Result = DAG.UpdateNodeOperands(Result, LegalizeOp(Tmp1));
2704 Result = LegalizeOp(Result);
2709 case ISD::ANY_EXTEND:
2710 case ISD::ZERO_EXTEND:
2711 case ISD::SIGN_EXTEND:
2712 case ISD::FP_EXTEND:
2714 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2715 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
2717 Tmp1 = LegalizeOp(Node->getOperand(0));
2718 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2721 switch (Node->getOpcode()) {
2722 case ISD::ANY_EXTEND:
2723 Tmp1 = PromoteOp(Node->getOperand(0));
2724 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Tmp1);
2726 case ISD::ZERO_EXTEND:
2727 Result = PromoteOp(Node->getOperand(0));
2728 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
2729 Result = DAG.getZeroExtendInReg(Result,
2730 Node->getOperand(0).getValueType());
2732 case ISD::SIGN_EXTEND:
2733 Result = PromoteOp(Node->getOperand(0));
2734 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
2735 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
2737 DAG.getValueType(Node->getOperand(0).getValueType()));
2739 case ISD::FP_EXTEND:
2740 Result = PromoteOp(Node->getOperand(0));
2741 if (Result.getValueType() != Op.getValueType())
2742 // Dynamically dead while we have only 2 FP types.
2743 Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result);
2746 Result = PromoteOp(Node->getOperand(0));
2747 Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result);
2752 case ISD::FP_ROUND_INREG:
2753 case ISD::SIGN_EXTEND_INREG: {
2754 Tmp1 = LegalizeOp(Node->getOperand(0));
2755 MVT::ValueType ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2757 // If this operation is not supported, convert it to a shl/shr or load/store
2759 switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) {
2760 default: assert(0 && "This action not supported for this op yet!");
2761 case TargetLowering::Legal:
2762 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
2764 case TargetLowering::Expand:
2765 // If this is an integer extend and shifts are supported, do that.
2766 if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) {
2767 // NOTE: we could fall back on load/store here too for targets without
2768 // SAR. However, it is doubtful that any exist.
2769 unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) -
2770 MVT::getSizeInBits(ExtraVT);
2771 SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy());
2772 Result = DAG.getNode(ISD::SHL, Node->getValueType(0),
2773 Node->getOperand(0), ShiftCst);
2774 Result = DAG.getNode(ISD::SRA, Node->getValueType(0),
2776 } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) {
2777 // The only way we can lower this is to turn it into a STORETRUNC,
2778 // EXTLOAD pair, targetting a temporary location (a stack slot).
2780 // NOTE: there is a choice here between constantly creating new stack
2781 // slots and always reusing the same one. We currently always create
2782 // new ones, as reuse may inhibit scheduling.
2783 const Type *Ty = MVT::getTypeForValueType(ExtraVT);
2784 unsigned TySize = (unsigned)TLI.getTargetData().getTypeSize(Ty);
2785 unsigned Align = TLI.getTargetData().getTypeAlignment(Ty);
2786 MachineFunction &MF = DAG.getMachineFunction();
2788 MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align);
2789 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
2790 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, DAG.getEntryNode(),
2791 Node->getOperand(0), StackSlot,
2792 DAG.getSrcValue(NULL), DAG.getValueType(ExtraVT));
2793 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
2794 Result, StackSlot, DAG.getSrcValue(NULL),
2797 assert(0 && "Unknown op");
2805 assert(Result.getValueType() == Op.getValueType() &&
2806 "Bad legalization!");
2808 // Make sure that the generated code is itself legal.
2810 Result = LegalizeOp(Result);
2812 // Note that LegalizeOp may be reentered even from single-use nodes, which
2813 // means that we always must cache transformed nodes.
2814 AddLegalizedOperand(Op, Result);
2818 /// PromoteOp - Given an operation that produces a value in an invalid type,
2819 /// promote it to compute the value into a larger type. The produced value will
2820 /// have the correct bits for the low portion of the register, but no guarantee
2821 /// is made about the top bits: it may be zero, sign-extended, or garbage.
2822 SDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) {
2823 MVT::ValueType VT = Op.getValueType();
2824 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
2825 assert(getTypeAction(VT) == Promote &&
2826 "Caller should expand or legalize operands that are not promotable!");
2827 assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) &&
2828 "Cannot promote to smaller type!");
2830 SDOperand Tmp1, Tmp2, Tmp3;
2832 SDNode *Node = Op.Val;
2834 std::map<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op);
2835 if (I != PromotedNodes.end()) return I->second;
2837 switch (Node->getOpcode()) {
2838 case ISD::CopyFromReg:
2839 assert(0 && "CopyFromReg must be legal!");
2841 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
2842 assert(0 && "Do not know how to promote this operator!");
2845 Result = DAG.getNode(ISD::UNDEF, NVT);
2849 Result = DAG.getNode(ISD::SIGN_EXTEND, NVT, Op);
2851 Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op);
2852 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?");
2854 case ISD::ConstantFP:
2855 Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op);
2856 assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?");
2860 assert(isTypeLegal(TLI.getSetCCResultTy()) && "SetCC type is not legal??");
2861 Result = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(),Node->getOperand(0),
2862 Node->getOperand(1), Node->getOperand(2));
2866 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2868 Result = LegalizeOp(Node->getOperand(0));
2869 assert(Result.getValueType() >= NVT &&
2870 "This truncation doesn't make sense!");
2871 if (Result.getValueType() > NVT) // Truncate to NVT instead of VT
2872 Result = DAG.getNode(ISD::TRUNCATE, NVT, Result);
2875 // The truncation is not required, because we don't guarantee anything
2876 // about high bits anyway.
2877 Result = PromoteOp(Node->getOperand(0));
2880 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2881 // Truncate the low part of the expanded value to the result type
2882 Result = DAG.getNode(ISD::TRUNCATE, NVT, Tmp1);
2885 case ISD::SIGN_EXTEND:
2886 case ISD::ZERO_EXTEND:
2887 case ISD::ANY_EXTEND:
2888 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2889 case Expand: assert(0 && "BUG: Smaller reg should have been promoted!");
2891 // Input is legal? Just do extend all the way to the larger type.
2892 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
2895 // Promote the reg if it's smaller.
2896 Result = PromoteOp(Node->getOperand(0));
2897 // The high bits are not guaranteed to be anything. Insert an extend.
2898 if (Node->getOpcode() == ISD::SIGN_EXTEND)
2899 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
2900 DAG.getValueType(Node->getOperand(0).getValueType()));
2901 else if (Node->getOpcode() == ISD::ZERO_EXTEND)
2902 Result = DAG.getZeroExtendInReg(Result,
2903 Node->getOperand(0).getValueType());
2907 case ISD::BIT_CONVERT:
2908 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2909 Result = PromoteOp(Result);
2912 case ISD::FP_EXTEND:
2913 assert(0 && "Case not implemented. Dynamically dead with 2 FP types!");
2915 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2916 case Expand: assert(0 && "BUG: Cannot expand FP regs!");
2917 case Promote: assert(0 && "Unreachable with 2 FP types!");
2919 // Input is legal? Do an FP_ROUND_INREG.
2920 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Node->getOperand(0),
2921 DAG.getValueType(VT));
2926 case ISD::SINT_TO_FP:
2927 case ISD::UINT_TO_FP:
2928 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2930 // No extra round required here.
2931 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
2935 Result = PromoteOp(Node->getOperand(0));
2936 if (Node->getOpcode() == ISD::SINT_TO_FP)
2937 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
2939 DAG.getValueType(Node->getOperand(0).getValueType()));
2941 Result = DAG.getZeroExtendInReg(Result,
2942 Node->getOperand(0).getValueType());
2943 // No extra round required here.
2944 Result = DAG.getNode(Node->getOpcode(), NVT, Result);
2947 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT,
2948 Node->getOperand(0));
2949 // Round if we cannot tolerate excess precision.
2950 if (NoExcessFPPrecision)
2951 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
2952 DAG.getValueType(VT));
2957 case ISD::SIGN_EXTEND_INREG:
2958 Result = PromoteOp(Node->getOperand(0));
2959 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
2960 Node->getOperand(1));
2962 case ISD::FP_TO_SINT:
2963 case ISD::FP_TO_UINT:
2964 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2966 Tmp1 = Node->getOperand(0);
2969 // The input result is prerounded, so we don't have to do anything
2971 Tmp1 = PromoteOp(Node->getOperand(0));
2974 assert(0 && "not implemented");
2976 // If we're promoting a UINT to a larger size, check to see if the new node
2977 // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since
2978 // we can use that instead. This allows us to generate better code for
2979 // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not
2980 // legal, such as PowerPC.
2981 if (Node->getOpcode() == ISD::FP_TO_UINT &&
2982 !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) &&
2983 (TLI.isOperationLegal(ISD::FP_TO_SINT, NVT) ||
2984 TLI.getOperationAction(ISD::FP_TO_SINT, NVT)==TargetLowering::Custom)){
2985 Result = DAG.getNode(ISD::FP_TO_SINT, NVT, Tmp1);
2987 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
2993 Tmp1 = PromoteOp(Node->getOperand(0));
2994 assert(Tmp1.getValueType() == NVT);
2995 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
2996 // NOTE: we do not have to do any extra rounding here for
2997 // NoExcessFPPrecision, because we know the input will have the appropriate
2998 // precision, and these operations don't modify precision at all.
3004 Tmp1 = PromoteOp(Node->getOperand(0));
3005 assert(Tmp1.getValueType() == NVT);
3006 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3007 if (NoExcessFPPrecision)
3008 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3009 DAG.getValueType(VT));
3015 // The input may have strange things in the top bits of the registers, but
3016 // these operations don't care. They may have weird bits going out, but
3017 // that too is okay if they are integer operations.
3018 Tmp1 = PromoteOp(Node->getOperand(0));
3019 Tmp2 = PromoteOp(Node->getOperand(1));
3020 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3021 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3026 // The input may have strange things in the top bits of the registers, but
3027 // these operations don't care. They may have weird bits going out, but
3028 // that too is okay if they are integer operations.
3029 Tmp1 = PromoteOp(Node->getOperand(0));
3030 Tmp2 = PromoteOp(Node->getOperand(1));
3031 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3032 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3037 Tmp1 = PromoteOp(Node->getOperand(0));
3038 Tmp2 = PromoteOp(Node->getOperand(1));
3039 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3040 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3042 // Floating point operations will give excess precision that we may not be
3043 // able to tolerate. If we DO allow excess precision, just leave it,
3044 // otherwise excise it.
3045 // FIXME: Why would we need to round FP ops more than integer ones?
3046 // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C))
3047 if (NoExcessFPPrecision)
3048 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3049 DAG.getValueType(VT));
3054 // These operators require that their input be sign extended.
3055 Tmp1 = PromoteOp(Node->getOperand(0));
3056 Tmp2 = PromoteOp(Node->getOperand(1));
3057 if (MVT::isInteger(NVT)) {
3058 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3059 DAG.getValueType(VT));
3060 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
3061 DAG.getValueType(VT));
3063 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3065 // Perform FP_ROUND: this is probably overly pessimistic.
3066 if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision)
3067 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3068 DAG.getValueType(VT));
3072 case ISD::FCOPYSIGN:
3073 // These operators require that their input be fp extended.
3074 Tmp1 = PromoteOp(Node->getOperand(0));
3075 Tmp2 = PromoteOp(Node->getOperand(1));
3076 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3078 // Perform FP_ROUND: this is probably overly pessimistic.
3079 if (NoExcessFPPrecision && Node->getOpcode() != ISD::FCOPYSIGN)
3080 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3081 DAG.getValueType(VT));
3086 // These operators require that their input be zero extended.
3087 Tmp1 = PromoteOp(Node->getOperand(0));
3088 Tmp2 = PromoteOp(Node->getOperand(1));
3089 assert(MVT::isInteger(NVT) && "Operators don't apply to FP!");
3090 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3091 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
3092 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3096 Tmp1 = PromoteOp(Node->getOperand(0));
3097 Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Node->getOperand(1));
3100 // The input value must be properly sign extended.
3101 Tmp1 = PromoteOp(Node->getOperand(0));
3102 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3103 DAG.getValueType(VT));
3104 Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Node->getOperand(1));
3107 // The input value must be properly zero extended.
3108 Tmp1 = PromoteOp(Node->getOperand(0));
3109 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3110 Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Node->getOperand(1));
3114 Tmp1 = Node->getOperand(0); // Get the chain.
3115 Tmp2 = Node->getOperand(1); // Get the pointer.
3116 if (TLI.getOperationAction(ISD::VAARG, VT) == TargetLowering::Custom) {
3117 Tmp3 = DAG.getVAArg(VT, Tmp1, Tmp2, Node->getOperand(2));
3118 Result = TLI.CustomPromoteOperation(Tmp3, DAG);
3120 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
3121 Node->getOperand(2));
3122 // Increment the pointer, VAList, to the next vaarg
3123 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
3124 DAG.getConstant(MVT::getSizeInBits(VT)/8,
3125 TLI.getPointerTy()));
3126 // Store the incremented VAList to the legalized pointer
3127 Tmp3 = DAG.getNode(ISD::STORE, MVT::Other, VAList.getValue(1), Tmp3, Tmp2,
3128 Node->getOperand(2));
3129 // Load the actual argument out of the pointer VAList
3130 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Tmp3, VAList,
3131 DAG.getSrcValue(0), VT);
3133 // Remember that we legalized the chain.
3134 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
3138 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Node->getOperand(0),
3139 Node->getOperand(1), Node->getOperand(2), VT);
3140 // Remember that we legalized the chain.
3141 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
3146 Result = DAG.getExtLoad(Node->getOpcode(), NVT, Node->getOperand(0),
3147 Node->getOperand(1), Node->getOperand(2),
3148 cast<VTSDNode>(Node->getOperand(3))->getVT());
3149 // Remember that we legalized the chain.
3150 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
3153 Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0
3154 Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1
3155 Result = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), Tmp2, Tmp3);
3157 case ISD::SELECT_CC:
3158 Tmp2 = PromoteOp(Node->getOperand(2)); // True
3159 Tmp3 = PromoteOp(Node->getOperand(3)); // False
3160 Result = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
3161 Node->getOperand(1), Tmp2, Tmp3, Node->getOperand(4));
3164 Tmp1 = Node->getOperand(0);
3165 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
3166 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
3167 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
3168 DAG.getConstant(getSizeInBits(NVT) - getSizeInBits(VT),
3169 TLI.getShiftAmountTy()));
3174 // Zero extend the argument
3175 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
3176 // Perform the larger operation, then subtract if needed.
3177 Tmp1 = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3178 switch(Node->getOpcode()) {
3183 // if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
3184 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
3185 DAG.getConstant(getSizeInBits(NVT), NVT), ISD::SETEQ);
3186 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
3187 DAG.getConstant(getSizeInBits(VT), NVT), Tmp1);
3190 //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
3191 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
3192 DAG.getConstant(getSizeInBits(NVT) -
3193 getSizeInBits(VT), NVT));
3197 case ISD::VEXTRACT_VECTOR_ELT:
3198 Result = PromoteOp(LowerVEXTRACT_VECTOR_ELT(Op));
3200 case ISD::EXTRACT_VECTOR_ELT:
3201 Result = PromoteOp(ExpandEXTRACT_VECTOR_ELT(Op));
3205 assert(Result.Val && "Didn't set a result!");
3207 // Make sure the result is itself legal.
3208 Result = LegalizeOp(Result);
3210 // Remember that we promoted this!
3211 AddPromotedOperand(Op, Result);
3215 /// LowerVEXTRACT_VECTOR_ELT - Lower a VEXTRACT_VECTOR_ELT operation into a
3216 /// EXTRACT_VECTOR_ELT operation, to memory operations, or to scalar code based
3217 /// on the vector type. The return type of this matches the element type of the
3218 /// vector, which may not be legal for the target.
3219 SDOperand SelectionDAGLegalize::LowerVEXTRACT_VECTOR_ELT(SDOperand Op) {
3220 // We know that operand #0 is the Vec vector. If the index is a constant
3221 // or if the invec is a supported hardware type, we can use it. Otherwise,
3222 // lower to a store then an indexed load.
3223 SDOperand Vec = Op.getOperand(0);
3224 SDOperand Idx = LegalizeOp(Op.getOperand(1));
3226 SDNode *InVal = Vec.Val;
3227 unsigned NumElems = cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
3228 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
3230 // Figure out if there is a Packed type corresponding to this Vector
3231 // type. If so, convert to the packed type.
3232 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
3233 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
3234 // Turn this into a packed extract_vector_elt operation.
3235 Vec = PackVectorOp(Vec, TVT);
3236 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, Op.getValueType(), Vec, Idx);
3237 } else if (NumElems == 1) {
3238 // This must be an access of the only element. Return it.
3239 return PackVectorOp(Vec, EVT);
3240 } else if (ConstantSDNode *CIdx = dyn_cast<ConstantSDNode>(Idx)) {
3242 SplitVectorOp(Vec, Lo, Hi);
3243 if (CIdx->getValue() < NumElems/2) {
3247 Idx = DAG.getConstant(CIdx->getValue() - NumElems/2, Idx.getValueType());
3250 // It's now an extract from the appropriate high or low part. Recurse.
3251 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
3252 return LowerVEXTRACT_VECTOR_ELT(Op);
3254 // Variable index case for extract element.
3255 // FIXME: IMPLEMENT STORE/LOAD lowering. Need alignment of stack slot!!
3256 assert(0 && "unimp!");
3261 /// ExpandEXTRACT_VECTOR_ELT - Expand an EXTRACT_VECTOR_ELT operation into
3263 SDOperand SelectionDAGLegalize::ExpandEXTRACT_VECTOR_ELT(SDOperand Op) {
3264 SDOperand Vector = Op.getOperand(0);
3265 SDOperand Idx = Op.getOperand(1);
3267 // If the target doesn't support this, store the value to a temporary
3268 // stack slot, then LOAD the scalar element back out.
3269 SDOperand StackPtr = CreateStackTemporary(Vector.getValueType());
3270 SDOperand Ch = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3271 Vector, StackPtr, DAG.getSrcValue(NULL));
3273 // Add the offset to the index.
3274 unsigned EltSize = MVT::getSizeInBits(Op.getValueType())/8;
3275 Idx = DAG.getNode(ISD::MUL, Idx.getValueType(), Idx,
3276 DAG.getConstant(EltSize, Idx.getValueType()));
3277 StackPtr = DAG.getNode(ISD::ADD, Idx.getValueType(), Idx, StackPtr);
3279 return DAG.getLoad(Op.getValueType(), Ch, StackPtr, DAG.getSrcValue(NULL));
3283 /// LegalizeSetCCOperands - Attempts to create a legal LHS and RHS for a SETCC
3284 /// with condition CC on the current target. This usually involves legalizing
3285 /// or promoting the arguments. In the case where LHS and RHS must be expanded,
3286 /// there may be no choice but to create a new SetCC node to represent the
3287 /// legalized value of setcc lhs, rhs. In this case, the value is returned in
3288 /// LHS, and the SDOperand returned in RHS has a nil SDNode value.
3289 void SelectionDAGLegalize::LegalizeSetCCOperands(SDOperand &LHS,
3292 SDOperand Tmp1, Tmp2, Result;
3294 switch (getTypeAction(LHS.getValueType())) {
3296 Tmp1 = LegalizeOp(LHS); // LHS
3297 Tmp2 = LegalizeOp(RHS); // RHS
3300 Tmp1 = PromoteOp(LHS); // LHS
3301 Tmp2 = PromoteOp(RHS); // RHS
3303 // If this is an FP compare, the operands have already been extended.
3304 if (MVT::isInteger(LHS.getValueType())) {
3305 MVT::ValueType VT = LHS.getValueType();
3306 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
3308 // Otherwise, we have to insert explicit sign or zero extends. Note
3309 // that we could insert sign extends for ALL conditions, but zero extend
3310 // is cheaper on many machines (an AND instead of two shifts), so prefer
3312 switch (cast<CondCodeSDNode>(CC)->get()) {
3313 default: assert(0 && "Unknown integer comparison!");
3320 // ALL of these operations will work if we either sign or zero extend
3321 // the operands (including the unsigned comparisons!). Zero extend is
3322 // usually a simpler/cheaper operation, so prefer it.
3323 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3324 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
3330 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3331 DAG.getValueType(VT));
3332 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
3333 DAG.getValueType(VT));
3339 SDOperand LHSLo, LHSHi, RHSLo, RHSHi;
3340 ExpandOp(LHS, LHSLo, LHSHi);
3341 ExpandOp(RHS, RHSLo, RHSHi);
3342 switch (cast<CondCodeSDNode>(CC)->get()) {
3346 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo))
3347 if (RHSCST->isAllOnesValue()) {
3348 // Comparison to -1.
3349 Tmp1 = DAG.getNode(ISD::AND, LHSLo.getValueType(), LHSLo, LHSHi);
3354 Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo);
3355 Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi);
3356 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2);
3357 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
3360 // If this is a comparison of the sign bit, just look at the top part.
3362 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(RHS))
3363 if ((cast<CondCodeSDNode>(CC)->get() == ISD::SETLT &&
3364 CST->getValue() == 0) || // X < 0
3365 (cast<CondCodeSDNode>(CC)->get() == ISD::SETGT &&
3366 CST->isAllOnesValue())) { // X > -1
3372 // FIXME: This generated code sucks.
3373 ISD::CondCode LowCC;
3374 switch (cast<CondCodeSDNode>(CC)->get()) {
3375 default: assert(0 && "Unknown integer setcc!");
3377 case ISD::SETULT: LowCC = ISD::SETULT; break;
3379 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
3381 case ISD::SETULE: LowCC = ISD::SETULE; break;
3383 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
3386 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
3387 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
3388 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
3390 // NOTE: on targets without efficient SELECT of bools, we can always use
3391 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
3392 Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC);
3393 Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHSHi, RHSHi, CC);
3394 Result = DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETEQ);
3395 Result = LegalizeOp(DAG.getNode(ISD::SELECT, Tmp1.getValueType(),
3396 Result, Tmp1, Tmp2));
3405 /// ExpandBIT_CONVERT - Expand a BIT_CONVERT node into a store/load combination.
3406 /// The resultant code need not be legal. Note that SrcOp is the input operand
3407 /// to the BIT_CONVERT, not the BIT_CONVERT node itself.
3408 SDOperand SelectionDAGLegalize::ExpandBIT_CONVERT(MVT::ValueType DestVT,
3410 // Create the stack frame object.
3411 SDOperand FIPtr = CreateStackTemporary(DestVT);
3413 // Emit a store to the stack slot.
3414 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3415 SrcOp, FIPtr, DAG.getSrcValue(NULL));
3416 // Result is a load from the stack slot.
3417 return DAG.getLoad(DestVT, Store, FIPtr, DAG.getSrcValue(0));
3420 SDOperand SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
3421 // Create a vector sized/aligned stack slot, store the value to element #0,
3422 // then load the whole vector back out.
3423 SDOperand StackPtr = CreateStackTemporary(Node->getValueType(0));
3424 SDOperand Ch = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3425 Node->getOperand(0), StackPtr,
3426 DAG.getSrcValue(NULL));
3427 return DAG.getLoad(Node->getValueType(0), Ch, StackPtr,DAG.getSrcValue(NULL));
3431 /// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
3432 /// support the operation, but do support the resultant packed vector type.
3433 SDOperand SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
3435 // If the only non-undef value is the low element, turn this into a
3436 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
3437 unsigned NumElems = Node->getNumOperands();
3438 bool isOnlyLowElement = true;
3439 SDOperand SplatValue = Node->getOperand(0);
3440 std::map<SDOperand, std::vector<unsigned> > Values;
3441 Values[SplatValue].push_back(0);
3442 bool isConstant = true;
3443 if (!isa<ConstantFPSDNode>(SplatValue) && !isa<ConstantSDNode>(SplatValue) &&
3444 SplatValue.getOpcode() != ISD::UNDEF)
3447 for (unsigned i = 1; i < NumElems; ++i) {
3448 SDOperand V = Node->getOperand(i);
3449 Values[V].push_back(i);
3450 if (V.getOpcode() != ISD::UNDEF)
3451 isOnlyLowElement = false;
3452 if (SplatValue != V)
3453 SplatValue = SDOperand(0,0);
3455 // If this isn't a constant element or an undef, we can't use a constant
3457 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V) &&
3458 V.getOpcode() != ISD::UNDEF)
3462 if (isOnlyLowElement) {
3463 // If the low element is an undef too, then this whole things is an undef.
3464 if (Node->getOperand(0).getOpcode() == ISD::UNDEF)
3465 return DAG.getNode(ISD::UNDEF, Node->getValueType(0));
3466 // Otherwise, turn this into a scalar_to_vector node.
3467 return DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
3468 Node->getOperand(0));
3471 // If all elements are constants, create a load from the constant pool.
3473 MVT::ValueType VT = Node->getValueType(0);
3475 MVT::getTypeForValueType(Node->getOperand(0).getValueType());
3476 std::vector<Constant*> CV;
3477 for (unsigned i = 0, e = NumElems; i != e; ++i) {
3478 if (ConstantFPSDNode *V =
3479 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
3480 CV.push_back(ConstantFP::get(OpNTy, V->getValue()));
3481 } else if (ConstantSDNode *V =
3482 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
3483 CV.push_back(ConstantUInt::get(OpNTy, V->getValue()));
3485 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
3486 CV.push_back(UndefValue::get(OpNTy));
3489 Constant *CP = ConstantPacked::get(CV);
3490 SDOperand CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
3491 return DAG.getLoad(VT, DAG.getEntryNode(), CPIdx,
3492 DAG.getSrcValue(NULL));
3495 if (SplatValue.Val) { // Splat of one value?
3496 // Build the shuffle constant vector: <0, 0, 0, 0>
3497 MVT::ValueType MaskVT =
3498 MVT::getIntVectorWithNumElements(NumElems);
3499 SDOperand Zero = DAG.getConstant(0, MVT::getVectorBaseType(MaskVT));
3500 std::vector<SDOperand> ZeroVec(NumElems, Zero);
3501 SDOperand SplatMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT, ZeroVec);
3503 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
3504 if (isShuffleLegal(Node->getValueType(0), SplatMask)) {
3505 // Get the splatted value into the low element of a vector register.
3506 SDOperand LowValVec =
3507 DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0), SplatValue);
3509 // Return shuffle(LowValVec, undef, <0,0,0,0>)
3510 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0), LowValVec,
3511 DAG.getNode(ISD::UNDEF, Node->getValueType(0)),
3516 // If there are only two unique elements, we may be able to turn this into a
3518 if (Values.size() == 2) {
3519 // Build the shuffle constant vector: e.g. <0, 4, 0, 4>
3520 MVT::ValueType MaskVT =
3521 MVT::getIntVectorWithNumElements(NumElems);
3522 std::vector<SDOperand> MaskVec(NumElems);
3524 for (std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
3525 E = Values.end(); I != E; ++I) {
3526 for (std::vector<unsigned>::iterator II = I->second.begin(),
3527 EE = I->second.end(); II != EE; ++II)
3528 MaskVec[*II] = DAG.getConstant(i, MVT::getVectorBaseType(MaskVT));
3531 SDOperand ShuffleMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT, MaskVec);
3533 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
3534 if (TLI.isOperationLegal(ISD::SCALAR_TO_VECTOR, Node->getValueType(0)) &&
3535 isShuffleLegal(Node->getValueType(0), ShuffleMask)) {
3536 std::vector<SDOperand> Ops;
3537 for(std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
3538 E = Values.end(); I != E; ++I) {
3539 SDOperand Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
3543 Ops.push_back(ShuffleMask);
3545 // Return shuffle(LoValVec, HiValVec, <0,1,0,1>)
3546 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0), Ops);
3550 // Otherwise, we can't handle this case efficiently. Allocate a sufficiently
3551 // aligned object on the stack, store each element into it, then load
3552 // the result as a vector.
3553 MVT::ValueType VT = Node->getValueType(0);
3554 // Create the stack frame object.
3555 SDOperand FIPtr = CreateStackTemporary(VT);
3557 // Emit a store of each element to the stack slot.
3558 std::vector<SDOperand> Stores;
3559 unsigned TypeByteSize =
3560 MVT::getSizeInBits(Node->getOperand(0).getValueType())/8;
3561 unsigned VectorSize = MVT::getSizeInBits(VT)/8;
3562 // Store (in the right endianness) the elements to memory.
3563 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
3564 // Ignore undef elements.
3565 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
3567 unsigned Offset = TypeByteSize*i;
3569 SDOperand Idx = DAG.getConstant(Offset, FIPtr.getValueType());
3570 Idx = DAG.getNode(ISD::ADD, FIPtr.getValueType(), FIPtr, Idx);
3572 Stores.push_back(DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3573 Node->getOperand(i), Idx,
3574 DAG.getSrcValue(NULL)));
3577 SDOperand StoreChain;
3578 if (!Stores.empty()) // Not all undef elements?
3579 StoreChain = DAG.getNode(ISD::TokenFactor, MVT::Other, Stores);
3581 StoreChain = DAG.getEntryNode();
3583 // Result is a load from the stack slot.
3584 return DAG.getLoad(VT, StoreChain, FIPtr, DAG.getSrcValue(0));
3587 /// CreateStackTemporary - Create a stack temporary, suitable for holding the
3588 /// specified value type.
3589 SDOperand SelectionDAGLegalize::CreateStackTemporary(MVT::ValueType VT) {
3590 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
3591 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
3592 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, ByteSize);
3593 return DAG.getFrameIndex(FrameIdx, TLI.getPointerTy());
3596 void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp,
3597 SDOperand Op, SDOperand Amt,
3598 SDOperand &Lo, SDOperand &Hi) {
3599 // Expand the subcomponents.
3600 SDOperand LHSL, LHSH;
3601 ExpandOp(Op, LHSL, LHSH);
3603 std::vector<SDOperand> Ops;
3604 Ops.push_back(LHSL);
3605 Ops.push_back(LHSH);
3607 std::vector<MVT::ValueType> VTs(2, LHSL.getValueType());
3608 Lo = DAG.getNode(NodeOp, VTs, Ops);
3609 Hi = Lo.getValue(1);
3613 /// ExpandShift - Try to find a clever way to expand this shift operation out to
3614 /// smaller elements. If we can't find a way that is more efficient than a
3615 /// libcall on this target, return false. Otherwise, return true with the
3616 /// low-parts expanded into Lo and Hi.
3617 bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt,
3618 SDOperand &Lo, SDOperand &Hi) {
3619 assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) &&
3620 "This is not a shift!");
3622 MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType());
3623 SDOperand ShAmt = LegalizeOp(Amt);
3624 MVT::ValueType ShTy = ShAmt.getValueType();
3625 unsigned VTBits = MVT::getSizeInBits(Op.getValueType());
3626 unsigned NVTBits = MVT::getSizeInBits(NVT);
3628 // Handle the case when Amt is an immediate. Other cases are currently broken
3629 // and are disabled.
3630 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.Val)) {
3631 unsigned Cst = CN->getValue();
3632 // Expand the incoming operand to be shifted, so that we have its parts
3634 ExpandOp(Op, InL, InH);
3638 Lo = DAG.getConstant(0, NVT);
3639 Hi = DAG.getConstant(0, NVT);
3640 } else if (Cst > NVTBits) {
3641 Lo = DAG.getConstant(0, NVT);
3642 Hi = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst-NVTBits,ShTy));
3643 } else if (Cst == NVTBits) {
3644 Lo = DAG.getConstant(0, NVT);
3647 Lo = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst, ShTy));
3648 Hi = DAG.getNode(ISD::OR, NVT,
3649 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(Cst, ShTy)),
3650 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(NVTBits-Cst, ShTy)));
3655 Lo = DAG.getConstant(0, NVT);
3656 Hi = DAG.getConstant(0, NVT);
3657 } else if (Cst > NVTBits) {
3658 Lo = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst-NVTBits,ShTy));
3659 Hi = DAG.getConstant(0, NVT);
3660 } else if (Cst == NVTBits) {
3662 Hi = DAG.getConstant(0, NVT);
3664 Lo = DAG.getNode(ISD::OR, NVT,
3665 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
3666 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
3667 Hi = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst, ShTy));
3672 Hi = Lo = DAG.getNode(ISD::SRA, NVT, InH,
3673 DAG.getConstant(NVTBits-1, ShTy));
3674 } else if (Cst > NVTBits) {
3675 Lo = DAG.getNode(ISD::SRA, NVT, InH,
3676 DAG.getConstant(Cst-NVTBits, ShTy));
3677 Hi = DAG.getNode(ISD::SRA, NVT, InH,
3678 DAG.getConstant(NVTBits-1, ShTy));
3679 } else if (Cst == NVTBits) {
3681 Hi = DAG.getNode(ISD::SRA, NVT, InH,
3682 DAG.getConstant(NVTBits-1, ShTy));
3684 Lo = DAG.getNode(ISD::OR, NVT,
3685 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
3686 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
3687 Hi = DAG.getNode(ISD::SRA, NVT, InH, DAG.getConstant(Cst, ShTy));
3696 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
3697 // does not fit into a register, return the lo part and set the hi part to the
3698 // by-reg argument. If it does fit into a single register, return the result
3699 // and leave the Hi part unset.
3700 SDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node,
3702 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
3703 // The input chain to this libcall is the entry node of the function.
3704 // Legalizing the call will automatically add the previous call to the
3706 SDOperand InChain = DAG.getEntryNode();
3708 TargetLowering::ArgListTy Args;
3709 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
3710 MVT::ValueType ArgVT = Node->getOperand(i).getValueType();
3711 const Type *ArgTy = MVT::getTypeForValueType(ArgVT);
3712 Args.push_back(std::make_pair(Node->getOperand(i), ArgTy));
3714 SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy());
3716 // Splice the libcall in wherever FindInputOutputChains tells us to.
3717 const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0));
3718 std::pair<SDOperand,SDOperand> CallInfo =
3719 TLI.LowerCallTo(InChain, RetTy, false, CallingConv::C, false,
3722 // Legalize the call sequence, starting with the chain. This will advance
3723 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
3724 // was added by LowerCallTo (guaranteeing proper serialization of calls).
3725 LegalizeOp(CallInfo.second);
3727 switch (getTypeAction(CallInfo.first.getValueType())) {
3728 default: assert(0 && "Unknown thing");
3730 Result = CallInfo.first;
3733 ExpandOp(CallInfo.first, Result, Hi);
3740 /// ExpandIntToFP - Expand a [US]INT_TO_FP operation, assuming that the
3741 /// destination type is legal.
3742 SDOperand SelectionDAGLegalize::
3743 ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) {
3744 assert(isTypeLegal(DestTy) && "Destination type is not legal!");
3745 assert(getTypeAction(Source.getValueType()) == Expand &&
3746 "This is not an expansion!");
3747 assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!");
3750 assert(Source.getValueType() == MVT::i64 &&
3751 "This only works for 64-bit -> FP");
3752 // The 64-bit value loaded will be incorrectly if the 'sign bit' of the
3753 // incoming integer is set. To handle this, we dynamically test to see if
3754 // it is set, and, if so, add a fudge factor.
3756 ExpandOp(Source, Lo, Hi);
3758 // If this is unsigned, and not supported, first perform the conversion to
3759 // signed, then adjust the result if the sign bit is set.
3760 SDOperand SignedConv = ExpandIntToFP(true, DestTy,
3761 DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), Lo, Hi));
3763 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Hi,
3764 DAG.getConstant(0, Hi.getValueType()),
3766 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
3767 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
3768 SignSet, Four, Zero);
3769 uint64_t FF = 0x5f800000ULL;
3770 if (TLI.isLittleEndian()) FF <<= 32;
3771 static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF);
3773 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
3774 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
3775 SDOperand FudgeInReg;
3776 if (DestTy == MVT::f32)
3777 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx,
3778 DAG.getSrcValue(NULL));
3780 assert(DestTy == MVT::f64 && "Unexpected conversion");
3781 FudgeInReg = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
3782 CPIdx, DAG.getSrcValue(NULL), MVT::f32);
3784 return DAG.getNode(ISD::FADD, DestTy, SignedConv, FudgeInReg);
3787 // Check to see if the target has a custom way to lower this. If so, use it.
3788 switch (TLI.getOperationAction(ISD::SINT_TO_FP, Source.getValueType())) {
3789 default: assert(0 && "This action not implemented for this operation!");
3790 case TargetLowering::Legal:
3791 case TargetLowering::Expand:
3792 break; // This case is handled below.
3793 case TargetLowering::Custom: {
3794 SDOperand NV = TLI.LowerOperation(DAG.getNode(ISD::SINT_TO_FP, DestTy,
3797 return LegalizeOp(NV);
3798 break; // The target decided this was legal after all
3802 // Expand the source, then glue it back together for the call. We must expand
3803 // the source in case it is shared (this pass of legalize must traverse it).
3804 SDOperand SrcLo, SrcHi;
3805 ExpandOp(Source, SrcLo, SrcHi);
3806 Source = DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), SrcLo, SrcHi);
3808 const char *FnName = 0;
3809 if (DestTy == MVT::f32)
3810 FnName = "__floatdisf";
3812 assert(DestTy == MVT::f64 && "Unknown fp value type!");
3813 FnName = "__floatdidf";
3816 Source = DAG.getNode(ISD::SINT_TO_FP, DestTy, Source);
3817 SDOperand UnusedHiPart;
3818 return ExpandLibCall(FnName, Source.Val, UnusedHiPart);
3821 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
3822 /// INT_TO_FP operation of the specified operand when the target requests that
3823 /// we expand it. At this point, we know that the result and operand types are
3824 /// legal for the target.
3825 SDOperand SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
3827 MVT::ValueType DestVT) {
3828 if (Op0.getValueType() == MVT::i32) {
3829 // simple 32-bit [signed|unsigned] integer to float/double expansion
3831 // get the stack frame index of a 8 byte buffer
3832 MachineFunction &MF = DAG.getMachineFunction();
3833 int SSFI = MF.getFrameInfo()->CreateStackObject(8, 8);
3834 // get address of 8 byte buffer
3835 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
3836 // word offset constant for Hi/Lo address computation
3837 SDOperand WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
3838 // set up Hi and Lo (into buffer) address based on endian
3839 SDOperand Hi = StackSlot;
3840 SDOperand Lo = DAG.getNode(ISD::ADD, TLI.getPointerTy(), StackSlot,WordOff);
3841 if (TLI.isLittleEndian())
3844 // if signed map to unsigned space
3845 SDOperand Op0Mapped;
3847 // constant used to invert sign bit (signed to unsigned mapping)
3848 SDOperand SignBit = DAG.getConstant(0x80000000u, MVT::i32);
3849 Op0Mapped = DAG.getNode(ISD::XOR, MVT::i32, Op0, SignBit);
3853 // store the lo of the constructed double - based on integer input
3854 SDOperand Store1 = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3855 Op0Mapped, Lo, DAG.getSrcValue(NULL));
3856 // initial hi portion of constructed double
3857 SDOperand InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
3858 // store the hi of the constructed double - biased exponent
3859 SDOperand Store2 = DAG.getNode(ISD::STORE, MVT::Other, Store1,
3860 InitialHi, Hi, DAG.getSrcValue(NULL));
3861 // load the constructed double
3862 SDOperand Load = DAG.getLoad(MVT::f64, Store2, StackSlot,
3863 DAG.getSrcValue(NULL));
3864 // FP constant to bias correct the final result
3865 SDOperand Bias = DAG.getConstantFP(isSigned ?
3866 BitsToDouble(0x4330000080000000ULL)
3867 : BitsToDouble(0x4330000000000000ULL),
3869 // subtract the bias
3870 SDOperand Sub = DAG.getNode(ISD::FSUB, MVT::f64, Load, Bias);
3873 // handle final rounding
3874 if (DestVT == MVT::f64) {
3878 // if f32 then cast to f32
3879 Result = DAG.getNode(ISD::FP_ROUND, MVT::f32, Sub);
3883 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
3884 SDOperand Tmp1 = DAG.getNode(ISD::SINT_TO_FP, DestVT, Op0);
3886 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Op0,
3887 DAG.getConstant(0, Op0.getValueType()),
3889 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
3890 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
3891 SignSet, Four, Zero);
3893 // If the sign bit of the integer is set, the large number will be treated
3894 // as a negative number. To counteract this, the dynamic code adds an
3895 // offset depending on the data type.
3897 switch (Op0.getValueType()) {
3898 default: assert(0 && "Unsupported integer type!");
3899 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
3900 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
3901 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
3902 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
3904 if (TLI.isLittleEndian()) FF <<= 32;
3905 static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF);
3907 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
3908 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
3909 SDOperand FudgeInReg;
3910 if (DestVT == MVT::f32)
3911 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx,
3912 DAG.getSrcValue(NULL));
3914 assert(DestVT == MVT::f64 && "Unexpected conversion");
3915 FudgeInReg = LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, MVT::f64,
3916 DAG.getEntryNode(), CPIdx,
3917 DAG.getSrcValue(NULL), MVT::f32));
3920 return DAG.getNode(ISD::FADD, DestVT, Tmp1, FudgeInReg);
3923 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
3924 /// *INT_TO_FP operation of the specified operand when the target requests that
3925 /// we promote it. At this point, we know that the result and operand types are
3926 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
3927 /// operation that takes a larger input.
3928 SDOperand SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDOperand LegalOp,
3929 MVT::ValueType DestVT,
3931 // First step, figure out the appropriate *INT_TO_FP operation to use.
3932 MVT::ValueType NewInTy = LegalOp.getValueType();
3934 unsigned OpToUse = 0;
3936 // Scan for the appropriate larger type to use.
3938 NewInTy = (MVT::ValueType)(NewInTy+1);
3939 assert(MVT::isInteger(NewInTy) && "Ran out of possibilities!");
3941 // If the target supports SINT_TO_FP of this type, use it.
3942 switch (TLI.getOperationAction(ISD::SINT_TO_FP, NewInTy)) {
3944 case TargetLowering::Legal:
3945 if (!TLI.isTypeLegal(NewInTy))
3946 break; // Can't use this datatype.
3948 case TargetLowering::Custom:
3949 OpToUse = ISD::SINT_TO_FP;
3953 if (isSigned) continue;
3955 // If the target supports UINT_TO_FP of this type, use it.
3956 switch (TLI.getOperationAction(ISD::UINT_TO_FP, NewInTy)) {
3958 case TargetLowering::Legal:
3959 if (!TLI.isTypeLegal(NewInTy))
3960 break; // Can't use this datatype.
3962 case TargetLowering::Custom:
3963 OpToUse = ISD::UINT_TO_FP;
3968 // Otherwise, try a larger type.
3971 // Okay, we found the operation and type to use. Zero extend our input to the
3972 // desired type then run the operation on it.
3973 return DAG.getNode(OpToUse, DestVT,
3974 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
3978 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
3979 /// FP_TO_*INT operation of the specified operand when the target requests that
3980 /// we promote it. At this point, we know that the result and operand types are
3981 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
3982 /// operation that returns a larger result.
3983 SDOperand SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDOperand LegalOp,
3984 MVT::ValueType DestVT,
3986 // First step, figure out the appropriate FP_TO*INT operation to use.
3987 MVT::ValueType NewOutTy = DestVT;
3989 unsigned OpToUse = 0;
3991 // Scan for the appropriate larger type to use.
3993 NewOutTy = (MVT::ValueType)(NewOutTy+1);
3994 assert(MVT::isInteger(NewOutTy) && "Ran out of possibilities!");
3996 // If the target supports FP_TO_SINT returning this type, use it.
3997 switch (TLI.getOperationAction(ISD::FP_TO_SINT, NewOutTy)) {
3999 case TargetLowering::Legal:
4000 if (!TLI.isTypeLegal(NewOutTy))
4001 break; // Can't use this datatype.
4003 case TargetLowering::Custom:
4004 OpToUse = ISD::FP_TO_SINT;
4009 // If the target supports FP_TO_UINT of this type, use it.
4010 switch (TLI.getOperationAction(ISD::FP_TO_UINT, NewOutTy)) {
4012 case TargetLowering::Legal:
4013 if (!TLI.isTypeLegal(NewOutTy))
4014 break; // Can't use this datatype.
4016 case TargetLowering::Custom:
4017 OpToUse = ISD::FP_TO_UINT;
4022 // Otherwise, try a larger type.
4025 // Okay, we found the operation and type to use. Truncate the result of the
4026 // extended FP_TO_*INT operation to the desired size.
4027 return DAG.getNode(ISD::TRUNCATE, DestVT,
4028 DAG.getNode(OpToUse, NewOutTy, LegalOp));
4031 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
4033 SDOperand SelectionDAGLegalize::ExpandBSWAP(SDOperand Op) {
4034 MVT::ValueType VT = Op.getValueType();
4035 MVT::ValueType SHVT = TLI.getShiftAmountTy();
4036 SDOperand Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
4038 default: assert(0 && "Unhandled Expand type in BSWAP!"); abort();
4040 Tmp2 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4041 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4042 return DAG.getNode(ISD::OR, VT, Tmp1, Tmp2);
4044 Tmp4 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
4045 Tmp3 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4046 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4047 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
4048 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
4049 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(0xFF00, VT));
4050 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
4051 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
4052 return DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
4054 Tmp8 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(56, SHVT));
4055 Tmp7 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(40, SHVT));
4056 Tmp6 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
4057 Tmp5 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4058 Tmp4 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4059 Tmp3 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
4060 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(40, SHVT));
4061 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(56, SHVT));
4062 Tmp7 = DAG.getNode(ISD::AND, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
4063 Tmp6 = DAG.getNode(ISD::AND, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
4064 Tmp5 = DAG.getNode(ISD::AND, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
4065 Tmp4 = DAG.getNode(ISD::AND, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
4066 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
4067 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
4068 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp7);
4069 Tmp6 = DAG.getNode(ISD::OR, VT, Tmp6, Tmp5);
4070 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
4071 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
4072 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp6);
4073 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
4074 return DAG.getNode(ISD::OR, VT, Tmp8, Tmp4);
4078 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
4080 SDOperand SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDOperand Op) {
4082 default: assert(0 && "Cannot expand this yet!");
4084 static const uint64_t mask[6] = {
4085 0x5555555555555555ULL, 0x3333333333333333ULL,
4086 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
4087 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
4089 MVT::ValueType VT = Op.getValueType();
4090 MVT::ValueType ShVT = TLI.getShiftAmountTy();
4091 unsigned len = getSizeInBits(VT);
4092 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
4093 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
4094 SDOperand Tmp2 = DAG.getConstant(mask[i], VT);
4095 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
4096 Op = DAG.getNode(ISD::ADD, VT, DAG.getNode(ISD::AND, VT, Op, Tmp2),
4097 DAG.getNode(ISD::AND, VT,
4098 DAG.getNode(ISD::SRL, VT, Op, Tmp3),Tmp2));
4103 // for now, we do this:
4104 // x = x | (x >> 1);
4105 // x = x | (x >> 2);
4107 // x = x | (x >>16);
4108 // x = x | (x >>32); // for 64-bit input
4109 // return popcount(~x);
4111 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
4112 MVT::ValueType VT = Op.getValueType();
4113 MVT::ValueType ShVT = TLI.getShiftAmountTy();
4114 unsigned len = getSizeInBits(VT);
4115 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
4116 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
4117 Op = DAG.getNode(ISD::OR, VT, Op, DAG.getNode(ISD::SRL, VT, Op, Tmp3));
4119 Op = DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(~0ULL, VT));
4120 return DAG.getNode(ISD::CTPOP, VT, Op);
4123 // for now, we use: { return popcount(~x & (x - 1)); }
4124 // unless the target has ctlz but not ctpop, in which case we use:
4125 // { return 32 - nlz(~x & (x-1)); }
4126 // see also http://www.hackersdelight.org/HDcode/ntz.cc
4127 MVT::ValueType VT = Op.getValueType();
4128 SDOperand Tmp2 = DAG.getConstant(~0ULL, VT);
4129 SDOperand Tmp3 = DAG.getNode(ISD::AND, VT,
4130 DAG.getNode(ISD::XOR, VT, Op, Tmp2),
4131 DAG.getNode(ISD::SUB, VT, Op, DAG.getConstant(1, VT)));
4132 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
4133 if (!TLI.isOperationLegal(ISD::CTPOP, VT) &&
4134 TLI.isOperationLegal(ISD::CTLZ, VT))
4135 return DAG.getNode(ISD::SUB, VT,
4136 DAG.getConstant(getSizeInBits(VT), VT),
4137 DAG.getNode(ISD::CTLZ, VT, Tmp3));
4138 return DAG.getNode(ISD::CTPOP, VT, Tmp3);
4143 /// ExpandOp - Expand the specified SDOperand into its two component pieces
4144 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the
4145 /// LegalizeNodes map is filled in for any results that are not expanded, the
4146 /// ExpandedNodes map is filled in for any results that are expanded, and the
4147 /// Lo/Hi values are returned.
4148 void SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){
4149 MVT::ValueType VT = Op.getValueType();
4150 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
4151 SDNode *Node = Op.Val;
4152 assert(getTypeAction(VT) == Expand && "Not an expanded type!");
4153 assert((MVT::isInteger(VT) || VT == MVT::Vector) &&
4154 "Cannot expand FP values!");
4155 assert(((MVT::isInteger(NVT) && NVT < VT) || VT == MVT::Vector) &&
4156 "Cannot expand to FP value or to larger int value!");
4158 // See if we already expanded it.
4159 std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
4160 = ExpandedNodes.find(Op);
4161 if (I != ExpandedNodes.end()) {
4162 Lo = I->second.first;
4163 Hi = I->second.second;
4167 switch (Node->getOpcode()) {
4168 case ISD::CopyFromReg:
4169 assert(0 && "CopyFromReg must be legal!");
4171 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
4172 assert(0 && "Do not know how to expand this operator!");
4175 Lo = DAG.getNode(ISD::UNDEF, NVT);
4176 Hi = DAG.getNode(ISD::UNDEF, NVT);
4178 case ISD::Constant: {
4179 uint64_t Cst = cast<ConstantSDNode>(Node)->getValue();
4180 Lo = DAG.getConstant(Cst, NVT);
4181 Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT);
4184 case ISD::BUILD_PAIR:
4185 // Return the operands.
4186 Lo = Node->getOperand(0);
4187 Hi = Node->getOperand(1);
4190 case ISD::SIGN_EXTEND_INREG:
4191 ExpandOp(Node->getOperand(0), Lo, Hi);
4192 // Sign extend the lo-part.
4193 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
4194 DAG.getConstant(MVT::getSizeInBits(NVT)-1,
4195 TLI.getShiftAmountTy()));
4196 // sext_inreg the low part if needed.
4197 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Lo, Node->getOperand(1));
4201 ExpandOp(Node->getOperand(0), Lo, Hi);
4202 SDOperand TempLo = DAG.getNode(ISD::BSWAP, NVT, Hi);
4203 Hi = DAG.getNode(ISD::BSWAP, NVT, Lo);
4209 ExpandOp(Node->getOperand(0), Lo, Hi);
4210 Lo = DAG.getNode(ISD::ADD, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L)
4211 DAG.getNode(ISD::CTPOP, NVT, Lo),
4212 DAG.getNode(ISD::CTPOP, NVT, Hi));
4213 Hi = DAG.getConstant(0, NVT);
4217 // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32)
4218 ExpandOp(Node->getOperand(0), Lo, Hi);
4219 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
4220 SDOperand HLZ = DAG.getNode(ISD::CTLZ, NVT, Hi);
4221 SDOperand TopNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), HLZ, BitsC,
4223 SDOperand LowPart = DAG.getNode(ISD::CTLZ, NVT, Lo);
4224 LowPart = DAG.getNode(ISD::ADD, NVT, LowPart, BitsC);
4226 Lo = DAG.getNode(ISD::SELECT, NVT, TopNotZero, HLZ, LowPart);
4227 Hi = DAG.getConstant(0, NVT);
4232 // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32)
4233 ExpandOp(Node->getOperand(0), Lo, Hi);
4234 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
4235 SDOperand LTZ = DAG.getNode(ISD::CTTZ, NVT, Lo);
4236 SDOperand BotNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), LTZ, BitsC,
4238 SDOperand HiPart = DAG.getNode(ISD::CTTZ, NVT, Hi);
4239 HiPart = DAG.getNode(ISD::ADD, NVT, HiPart, BitsC);
4241 Lo = DAG.getNode(ISD::SELECT, NVT, BotNotZero, LTZ, HiPart);
4242 Hi = DAG.getConstant(0, NVT);
4247 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
4248 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
4249 Lo = DAG.getVAArg(NVT, Ch, Ptr, Node->getOperand(2));
4250 Hi = DAG.getVAArg(NVT, Lo.getValue(1), Ptr, Node->getOperand(2));
4252 // Remember that we legalized the chain.
4253 Hi = LegalizeOp(Hi);
4254 AddLegalizedOperand(Op.getValue(1), Hi.getValue(1));
4255 if (!TLI.isLittleEndian())
4261 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
4262 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
4263 Lo = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2));
4265 // Increment the pointer to the other half.
4266 unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8;
4267 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
4268 getIntPtrConstant(IncrementSize));
4269 // FIXME: This creates a bogus srcvalue!
4270 Hi = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2));
4272 // Build a factor node to remember that this load is independent of the
4274 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
4277 // Remember that we legalized the chain.
4278 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
4279 if (!TLI.isLittleEndian())
4285 case ISD::XOR: { // Simple logical operators -> two trivial pieces.
4286 SDOperand LL, LH, RL, RH;
4287 ExpandOp(Node->getOperand(0), LL, LH);
4288 ExpandOp(Node->getOperand(1), RL, RH);
4289 Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL);
4290 Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH);
4294 SDOperand LL, LH, RL, RH;
4295 ExpandOp(Node->getOperand(1), LL, LH);
4296 ExpandOp(Node->getOperand(2), RL, RH);
4297 Lo = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LL, RL);
4298 Hi = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LH, RH);
4301 case ISD::SELECT_CC: {
4302 SDOperand TL, TH, FL, FH;
4303 ExpandOp(Node->getOperand(2), TL, TH);
4304 ExpandOp(Node->getOperand(3), FL, FH);
4305 Lo = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
4306 Node->getOperand(1), TL, FL, Node->getOperand(4));
4307 Hi = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
4308 Node->getOperand(1), TH, FH, Node->getOperand(4));
4311 case ISD::SEXTLOAD: {
4312 SDOperand Chain = Node->getOperand(0);
4313 SDOperand Ptr = Node->getOperand(1);
4314 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
4317 Lo = DAG.getLoad(NVT, Chain, Ptr, Node->getOperand(2));
4319 Lo = DAG.getExtLoad(ISD::SEXTLOAD, NVT, Chain, Ptr, Node->getOperand(2),
4322 // Remember that we legalized the chain.
4323 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
4325 // The high part is obtained by SRA'ing all but one of the bits of the lo
4327 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
4328 Hi = DAG.getNode(ISD::SRA, NVT, Lo, DAG.getConstant(LoSize-1,
4329 TLI.getShiftAmountTy()));
4332 case ISD::ZEXTLOAD: {
4333 SDOperand Chain = Node->getOperand(0);
4334 SDOperand Ptr = Node->getOperand(1);
4335 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
4338 Lo = DAG.getLoad(NVT, Chain, Ptr, Node->getOperand(2));
4340 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, NVT, Chain, Ptr, Node->getOperand(2),
4343 // Remember that we legalized the chain.
4344 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
4346 // The high part is just a zero.
4347 Hi = DAG.getConstant(0, NVT);
4350 case ISD::EXTLOAD: {
4351 SDOperand Chain = Node->getOperand(0);
4352 SDOperand Ptr = Node->getOperand(1);
4353 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
4356 Lo = DAG.getLoad(NVT, Chain, Ptr, Node->getOperand(2));
4358 Lo = DAG.getExtLoad(ISD::EXTLOAD, NVT, Chain, Ptr, Node->getOperand(2),
4361 // Remember that we legalized the chain.
4362 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
4364 // The high part is undefined.
4365 Hi = DAG.getNode(ISD::UNDEF, NVT);
4368 case ISD::ANY_EXTEND:
4369 // The low part is any extension of the input (which degenerates to a copy).
4370 Lo = DAG.getNode(ISD::ANY_EXTEND, NVT, Node->getOperand(0));
4371 // The high part is undefined.
4372 Hi = DAG.getNode(ISD::UNDEF, NVT);
4374 case ISD::SIGN_EXTEND: {
4375 // The low part is just a sign extension of the input (which degenerates to
4377 Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, Node->getOperand(0));
4379 // The high part is obtained by SRA'ing all but one of the bits of the lo
4381 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
4382 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
4383 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
4386 case ISD::ZERO_EXTEND:
4387 // The low part is just a zero extension of the input (which degenerates to
4389 Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
4391 // The high part is just a zero.
4392 Hi = DAG.getConstant(0, NVT);
4395 case ISD::BIT_CONVERT: {
4396 SDOperand Tmp = ExpandBIT_CONVERT(Node->getValueType(0),
4397 Node->getOperand(0));
4398 ExpandOp(Tmp, Lo, Hi);
4402 case ISD::READCYCLECOUNTER:
4403 assert(TLI.getOperationAction(ISD::READCYCLECOUNTER, VT) ==
4404 TargetLowering::Custom &&
4405 "Must custom expand ReadCycleCounter");
4406 Lo = TLI.LowerOperation(Op, DAG);
4407 assert(Lo.Val && "Node must be custom expanded!");
4408 Hi = Lo.getValue(1);
4409 AddLegalizedOperand(SDOperand(Node, 1), // Remember we legalized the chain.
4410 LegalizeOp(Lo.getValue(2)));
4413 // These operators cannot be expanded directly, emit them as calls to
4414 // library functions.
4415 case ISD::FP_TO_SINT:
4416 if (TLI.getOperationAction(ISD::FP_TO_SINT, VT) == TargetLowering::Custom) {
4418 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4419 case Expand: assert(0 && "cannot expand FP!");
4420 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
4421 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
4424 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_SINT, VT, Op), DAG);
4426 // Now that the custom expander is done, expand the result, which is still
4429 ExpandOp(Op, Lo, Hi);
4434 if (Node->getOperand(0).getValueType() == MVT::f32)
4435 Lo = ExpandLibCall("__fixsfdi", Node, Hi);
4437 Lo = ExpandLibCall("__fixdfdi", Node, Hi);
4440 case ISD::FP_TO_UINT:
4441 if (TLI.getOperationAction(ISD::FP_TO_UINT, VT) == TargetLowering::Custom) {
4443 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4444 case Expand: assert(0 && "cannot expand FP!");
4445 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
4446 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
4449 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_UINT, VT, Op), DAG);
4451 // Now that the custom expander is done, expand the result.
4453 ExpandOp(Op, Lo, Hi);
4458 if (Node->getOperand(0).getValueType() == MVT::f32)
4459 Lo = ExpandLibCall("__fixunssfdi", Node, Hi);
4461 Lo = ExpandLibCall("__fixunsdfdi", Node, Hi);
4465 // If the target wants custom lowering, do so.
4466 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
4467 if (TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Custom) {
4468 SDOperand Op = DAG.getNode(ISD::SHL, VT, Node->getOperand(0), ShiftAmt);
4469 Op = TLI.LowerOperation(Op, DAG);
4471 // Now that the custom expander is done, expand the result, which is
4473 ExpandOp(Op, Lo, Hi);
4478 // If we can emit an efficient shift operation, do so now.
4479 if (ExpandShift(ISD::SHL, Node->getOperand(0), ShiftAmt, Lo, Hi))
4482 // If this target supports SHL_PARTS, use it.
4483 TargetLowering::LegalizeAction Action =
4484 TLI.getOperationAction(ISD::SHL_PARTS, NVT);
4485 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
4486 Action == TargetLowering::Custom) {
4487 ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
4491 // Otherwise, emit a libcall.
4492 Lo = ExpandLibCall("__ashldi3", Node, Hi);
4497 // If the target wants custom lowering, do so.
4498 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
4499 if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Custom) {
4500 SDOperand Op = DAG.getNode(ISD::SRA, VT, Node->getOperand(0), ShiftAmt);
4501 Op = TLI.LowerOperation(Op, DAG);
4503 // Now that the custom expander is done, expand the result, which is
4505 ExpandOp(Op, Lo, Hi);
4510 // If we can emit an efficient shift operation, do so now.
4511 if (ExpandShift(ISD::SRA, Node->getOperand(0), ShiftAmt, Lo, Hi))
4514 // If this target supports SRA_PARTS, use it.
4515 TargetLowering::LegalizeAction Action =
4516 TLI.getOperationAction(ISD::SRA_PARTS, NVT);
4517 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
4518 Action == TargetLowering::Custom) {
4519 ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
4523 // Otherwise, emit a libcall.
4524 Lo = ExpandLibCall("__ashrdi3", Node, Hi);
4529 // If the target wants custom lowering, do so.
4530 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
4531 if (TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Custom) {
4532 SDOperand Op = DAG.getNode(ISD::SRL, VT, Node->getOperand(0), ShiftAmt);
4533 Op = TLI.LowerOperation(Op, DAG);
4535 // Now that the custom expander is done, expand the result, which is
4537 ExpandOp(Op, Lo, Hi);
4542 // If we can emit an efficient shift operation, do so now.
4543 if (ExpandShift(ISD::SRL, Node->getOperand(0), ShiftAmt, Lo, Hi))
4546 // If this target supports SRL_PARTS, use it.
4547 TargetLowering::LegalizeAction Action =
4548 TLI.getOperationAction(ISD::SRL_PARTS, NVT);
4549 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
4550 Action == TargetLowering::Custom) {
4551 ExpandShiftParts(ISD::SRL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
4555 // Otherwise, emit a libcall.
4556 Lo = ExpandLibCall("__lshrdi3", Node, Hi);
4562 // If the target wants to custom expand this, let them.
4563 if (TLI.getOperationAction(Node->getOpcode(), VT) ==
4564 TargetLowering::Custom) {
4565 Op = TLI.LowerOperation(Op, DAG);
4567 ExpandOp(Op, Lo, Hi);
4572 // Expand the subcomponents.
4573 SDOperand LHSL, LHSH, RHSL, RHSH;
4574 ExpandOp(Node->getOperand(0), LHSL, LHSH);
4575 ExpandOp(Node->getOperand(1), RHSL, RHSH);
4576 std::vector<MVT::ValueType> VTs;
4577 std::vector<SDOperand> LoOps, HiOps;
4578 VTs.push_back(LHSL.getValueType());
4579 VTs.push_back(MVT::Flag);
4580 LoOps.push_back(LHSL);
4581 LoOps.push_back(RHSL);
4582 HiOps.push_back(LHSH);
4583 HiOps.push_back(RHSH);
4584 if (Node->getOpcode() == ISD::ADD) {
4585 Lo = DAG.getNode(ISD::ADDC, VTs, LoOps);
4586 HiOps.push_back(Lo.getValue(1));
4587 Hi = DAG.getNode(ISD::ADDE, VTs, HiOps);
4589 Lo = DAG.getNode(ISD::SUBC, VTs, LoOps);
4590 HiOps.push_back(Lo.getValue(1));
4591 Hi = DAG.getNode(ISD::SUBE, VTs, HiOps);
4596 if (TLI.isOperationLegal(ISD::MULHU, NVT)) {
4597 SDOperand LL, LH, RL, RH;
4598 ExpandOp(Node->getOperand(0), LL, LH);
4599 ExpandOp(Node->getOperand(1), RL, RH);
4600 unsigned SH = MVT::getSizeInBits(RH.getValueType())-1;
4601 // MULHS implicitly sign extends its inputs. Check to see if ExpandOp
4602 // extended the sign bit of the low half through the upper half, and if so
4603 // emit a MULHS instead of the alternate sequence that is valid for any
4604 // i64 x i64 multiply.
4605 if (TLI.isOperationLegal(ISD::MULHS, NVT) &&
4606 // is RH an extension of the sign bit of RL?
4607 RH.getOpcode() == ISD::SRA && RH.getOperand(0) == RL &&
4608 RH.getOperand(1).getOpcode() == ISD::Constant &&
4609 cast<ConstantSDNode>(RH.getOperand(1))->getValue() == SH &&
4610 // is LH an extension of the sign bit of LL?
4611 LH.getOpcode() == ISD::SRA && LH.getOperand(0) == LL &&
4612 LH.getOperand(1).getOpcode() == ISD::Constant &&
4613 cast<ConstantSDNode>(LH.getOperand(1))->getValue() == SH) {
4614 Hi = DAG.getNode(ISD::MULHS, NVT, LL, RL);
4616 Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL);
4617 RH = DAG.getNode(ISD::MUL, NVT, LL, RH);
4618 LH = DAG.getNode(ISD::MUL, NVT, LH, RL);
4619 Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH);
4620 Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH);
4622 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
4624 Lo = ExpandLibCall("__muldi3" , Node, Hi);
4628 case ISD::SDIV: Lo = ExpandLibCall("__divdi3" , Node, Hi); break;
4629 case ISD::UDIV: Lo = ExpandLibCall("__udivdi3", Node, Hi); break;
4630 case ISD::SREM: Lo = ExpandLibCall("__moddi3" , Node, Hi); break;
4631 case ISD::UREM: Lo = ExpandLibCall("__umoddi3", Node, Hi); break;
4634 // Make sure the resultant values have been legalized themselves, unless this
4635 // is a type that requires multi-step expansion.
4636 if (getTypeAction(NVT) != Expand && NVT != MVT::isVoid) {
4637 Lo = LegalizeOp(Lo);
4638 Hi = LegalizeOp(Hi);
4641 // Remember in a map if the values will be reused later.
4643 ExpandedNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
4644 assert(isNew && "Value already expanded?!?");
4647 /// SplitVectorOp - Given an operand of MVT::Vector type, break it down into
4648 /// two smaller values of MVT::Vector type.
4649 void SelectionDAGLegalize::SplitVectorOp(SDOperand Op, SDOperand &Lo,
4651 assert(Op.getValueType() == MVT::Vector && "Cannot split non-vector type!");
4652 SDNode *Node = Op.Val;
4653 unsigned NumElements = cast<ConstantSDNode>(*(Node->op_end()-2))->getValue();
4654 assert(NumElements > 1 && "Cannot split a single element vector!");
4655 unsigned NewNumElts = NumElements/2;
4656 SDOperand NewNumEltsNode = DAG.getConstant(NewNumElts, MVT::i32);
4657 SDOperand TypeNode = *(Node->op_end()-1);
4659 // See if we already split it.
4660 std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
4661 = SplitNodes.find(Op);
4662 if (I != SplitNodes.end()) {
4663 Lo = I->second.first;
4664 Hi = I->second.second;
4668 switch (Node->getOpcode()) {
4669 default: Node->dump(); assert(0 && "Unhandled operation in SplitVectorOp!");
4670 case ISD::VBUILD_VECTOR: {
4671 std::vector<SDOperand> LoOps(Node->op_begin(), Node->op_begin()+NewNumElts);
4672 LoOps.push_back(NewNumEltsNode);
4673 LoOps.push_back(TypeNode);
4674 Lo = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, LoOps);
4676 std::vector<SDOperand> HiOps(Node->op_begin()+NewNumElts, Node->op_end()-2);
4677 HiOps.push_back(NewNumEltsNode);
4678 HiOps.push_back(TypeNode);
4679 Hi = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, HiOps);
4690 SDOperand LL, LH, RL, RH;
4691 SplitVectorOp(Node->getOperand(0), LL, LH);
4692 SplitVectorOp(Node->getOperand(1), RL, RH);
4694 Lo = DAG.getNode(Node->getOpcode(), MVT::Vector, LL, RL,
4695 NewNumEltsNode, TypeNode);
4696 Hi = DAG.getNode(Node->getOpcode(), MVT::Vector, LH, RH,
4697 NewNumEltsNode, TypeNode);
4701 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
4702 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
4703 MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT();
4705 Lo = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2));
4706 unsigned IncrementSize = NewNumElts * MVT::getSizeInBits(EVT)/8;
4707 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
4708 getIntPtrConstant(IncrementSize));
4709 // FIXME: This creates a bogus srcvalue!
4710 Hi = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2));
4712 // Build a factor node to remember that this load is independent of the
4714 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
4717 // Remember that we legalized the chain.
4718 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
4721 case ISD::VBIT_CONVERT: {
4722 // We know the result is a vector. The input may be either a vector or a
4724 if (Op.getOperand(0).getValueType() != MVT::Vector) {
4725 // Lower to a store/load. FIXME: this could be improved probably.
4726 SDOperand Ptr = CreateStackTemporary(Op.getOperand(0).getValueType());
4728 SDOperand St = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
4729 Op.getOperand(0), Ptr, DAG.getSrcValue(0));
4730 MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT();
4731 St = DAG.getVecLoad(NumElements, EVT, St, Ptr, DAG.getSrcValue(0));
4732 SplitVectorOp(St, Lo, Hi);
4734 // If the input is a vector type, we have to either scalarize it, pack it
4735 // or convert it based on whether the input vector type is legal.
4736 SDNode *InVal = Node->getOperand(0).Val;
4738 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
4739 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
4741 // If the input is from a single element vector, scalarize the vector,
4742 // then treat like a scalar.
4743 if (NumElems == 1) {
4744 SDOperand Scalar = PackVectorOp(Op.getOperand(0), EVT);
4745 Scalar = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Scalar,
4746 Op.getOperand(1), Op.getOperand(2));
4747 SplitVectorOp(Scalar, Lo, Hi);
4749 // Split the input vector.
4750 SplitVectorOp(Op.getOperand(0), Lo, Hi);
4752 // Convert each of the pieces now.
4753 Lo = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Lo,
4754 NewNumEltsNode, TypeNode);
4755 Hi = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Hi,
4756 NewNumEltsNode, TypeNode);
4763 // Remember in a map if the values will be reused later.
4765 SplitNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
4766 assert(isNew && "Value already expanded?!?");
4770 /// PackVectorOp - Given an operand of MVT::Vector type, convert it into the
4771 /// equivalent operation that returns a scalar (e.g. F32) or packed value
4772 /// (e.g. MVT::V4F32). When this is called, we know that PackedVT is the right
4773 /// type for the result.
4774 SDOperand SelectionDAGLegalize::PackVectorOp(SDOperand Op,
4775 MVT::ValueType NewVT) {
4776 assert(Op.getValueType() == MVT::Vector && "Bad PackVectorOp invocation!");
4777 SDNode *Node = Op.Val;
4779 // See if we already packed it.
4780 std::map<SDOperand, SDOperand>::iterator I = PackedNodes.find(Op);
4781 if (I != PackedNodes.end()) return I->second;
4784 switch (Node->getOpcode()) {
4786 Node->dump(); std::cerr << "\n";
4787 assert(0 && "Unknown vector operation in PackVectorOp!");
4796 Result = DAG.getNode(getScalarizedOpcode(Node->getOpcode(), NewVT),
4798 PackVectorOp(Node->getOperand(0), NewVT),
4799 PackVectorOp(Node->getOperand(1), NewVT));
4802 SDOperand Ch = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
4803 SDOperand Ptr = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
4805 Result = DAG.getLoad(NewVT, Ch, Ptr, Node->getOperand(2));
4807 // Remember that we legalized the chain.
4808 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
4811 case ISD::VBUILD_VECTOR:
4812 if (Node->getOperand(0).getValueType() == NewVT) {
4813 // Returning a scalar?
4814 Result = Node->getOperand(0);
4816 // Returning a BUILD_VECTOR?
4818 // If all elements of the build_vector are undefs, return an undef.
4819 bool AllUndef = true;
4820 for (unsigned i = 0, e = Node->getNumOperands()-2; i != e; ++i)
4821 if (Node->getOperand(i).getOpcode() != ISD::UNDEF) {
4826 Result = DAG.getNode(ISD::UNDEF, NewVT);
4828 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end()-2);
4829 Result = DAG.getNode(ISD::BUILD_VECTOR, NewVT, Ops);
4833 case ISD::VINSERT_VECTOR_ELT:
4834 if (!MVT::isVector(NewVT)) {
4835 // Returning a scalar? Must be the inserted element.
4836 Result = Node->getOperand(1);
4838 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, NewVT,
4839 PackVectorOp(Node->getOperand(0), NewVT),
4840 Node->getOperand(1), Node->getOperand(2));
4843 case ISD::VVECTOR_SHUFFLE:
4844 if (!MVT::isVector(NewVT)) {
4845 // Returning a scalar? Figure out if it is the LHS or RHS and return it.
4846 SDOperand EltNum = Node->getOperand(2).getOperand(0);
4847 if (cast<ConstantSDNode>(EltNum)->getValue())
4848 Result = PackVectorOp(Node->getOperand(1), NewVT);
4850 Result = PackVectorOp(Node->getOperand(0), NewVT);
4852 // Otherwise, return a VECTOR_SHUFFLE node. First convert the index
4853 // vector from a VBUILD_VECTOR to a BUILD_VECTOR.
4854 std::vector<SDOperand> BuildVecIdx(Node->getOperand(2).Val->op_begin(),
4855 Node->getOperand(2).Val->op_end()-2);
4856 MVT::ValueType BVT = MVT::getIntVectorWithNumElements(BuildVecIdx.size());
4857 SDOperand BV = DAG.getNode(ISD::BUILD_VECTOR, BVT, BuildVecIdx);
4859 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NewVT,
4860 PackVectorOp(Node->getOperand(0), NewVT),
4861 PackVectorOp(Node->getOperand(1), NewVT), BV);
4864 case ISD::VBIT_CONVERT:
4865 if (Op.getOperand(0).getValueType() != MVT::Vector)
4866 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT, Op.getOperand(0));
4868 // If the input is a vector type, we have to either scalarize it, pack it
4869 // or convert it based on whether the input vector type is legal.
4870 SDNode *InVal = Node->getOperand(0).Val;
4872 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
4873 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
4875 // Figure out if there is a Packed type corresponding to this Vector
4876 // type. If so, convert to the packed type.
4877 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
4878 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
4879 // Turn this into a bit convert of the packed input.
4880 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT,
4881 PackVectorOp(Node->getOperand(0), TVT));
4883 } else if (NumElems == 1) {
4884 // Turn this into a bit convert of the scalar input.
4885 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT,
4886 PackVectorOp(Node->getOperand(0), EVT));
4890 assert(0 && "Cast from unsupported vector type not implemented yet!");
4895 Result = DAG.getNode(ISD::SELECT, NewVT, Op.getOperand(0),
4896 PackVectorOp(Op.getOperand(1), NewVT),
4897 PackVectorOp(Op.getOperand(2), NewVT));
4901 if (TLI.isTypeLegal(NewVT))
4902 Result = LegalizeOp(Result);
4903 bool isNew = PackedNodes.insert(std::make_pair(Op, Result)).second;
4904 assert(isNew && "Value already packed?");
4909 // SelectionDAG::Legalize - This is the entry point for the file.
4911 void SelectionDAG::Legalize() {
4912 if (ViewLegalizeDAGs) viewGraph();
4914 /// run - This is the main entry point to this class.
4916 SelectionDAGLegalize(*this).LegalizeDAG();