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/Support/MathExtras.h"
18 #include "llvm/Target/TargetLowering.h"
19 #include "llvm/Target/TargetData.h"
20 #include "llvm/Target/TargetOptions.h"
21 #include "llvm/CallingConv.h"
22 #include "llvm/Constants.h"
27 //===----------------------------------------------------------------------===//
28 /// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
29 /// hacks on it until the target machine can handle it. This involves
30 /// eliminating value sizes the machine cannot handle (promoting small sizes to
31 /// large sizes or splitting up large values into small values) as well as
32 /// eliminating operations the machine cannot handle.
34 /// This code also does a small amount of optimization and recognition of idioms
35 /// as part of its processing. For example, if a target does not support a
36 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
37 /// will attempt merge setcc and brc instructions into brcc's.
40 class SelectionDAGLegalize {
44 // Libcall insertion helpers.
46 /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been
47 /// legalized. We use this to ensure that calls are properly serialized
48 /// against each other, including inserted libcalls.
49 SDOperand LastCALLSEQ_END;
51 /// IsLegalizingCall - This member is used *only* for purposes of providing
52 /// helpful assertions that a libcall isn't created while another call is
53 /// being legalized (which could lead to non-serialized call sequences).
54 bool IsLegalizingCall;
57 Legal, // The target natively supports this operation.
58 Promote, // This operation should be executed in a larger type.
59 Expand, // Try to expand this to other ops, otherwise use a libcall.
62 /// ValueTypeActions - This is a bitvector that contains two bits for each
63 /// value type, where the two bits correspond to the LegalizeAction enum.
64 /// This can be queried with "getTypeAction(VT)".
65 TargetLowering::ValueTypeActionImpl ValueTypeActions;
67 /// LegalizedNodes - For nodes that are of legal width, and that have more
68 /// than one use, this map indicates what regularized operand to use. This
69 /// allows us to avoid legalizing the same thing more than once.
70 std::map<SDOperand, SDOperand> LegalizedNodes;
72 /// PromotedNodes - For nodes that are below legal width, and that have more
73 /// than one use, this map indicates what promoted value to use. This allows
74 /// us to avoid promoting the same thing more than once.
75 std::map<SDOperand, SDOperand> PromotedNodes;
77 /// ExpandedNodes - For nodes that need to be expanded, and which have more
78 /// than one use, this map indicates which which operands are the expanded
79 /// version of the input. This allows us to avoid expanding the same node
81 std::map<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes;
83 void AddLegalizedOperand(SDOperand From, SDOperand To) {
84 LegalizedNodes.insert(std::make_pair(From, To));
85 // If someone requests legalization of the new node, return itself.
87 LegalizedNodes.insert(std::make_pair(To, To));
89 void AddPromotedOperand(SDOperand From, SDOperand To) {
90 bool isNew = PromotedNodes.insert(std::make_pair(From, To)).second;
91 assert(isNew && "Got into the map somehow?");
92 // If someone requests legalization of the new node, return itself.
93 LegalizedNodes.insert(std::make_pair(To, To));
98 SelectionDAGLegalize(SelectionDAG &DAG);
100 /// getTypeAction - Return how we should legalize values of this type, either
101 /// it is already legal or we need to expand it into multiple registers of
102 /// smaller integer type, or we need to promote it to a larger type.
103 LegalizeAction getTypeAction(MVT::ValueType VT) const {
104 return (LegalizeAction)ValueTypeActions.getTypeAction(VT);
107 /// isTypeLegal - Return true if this type is legal on this target.
109 bool isTypeLegal(MVT::ValueType VT) const {
110 return getTypeAction(VT) == Legal;
117 SDOperand LegalizeOp(SDOperand O);
118 void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
119 SDOperand PromoteOp(SDOperand O);
121 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest);
123 void LegalizeSetCCOperands(SDOperand &LHS, SDOperand &RHS, SDOperand &CC);
125 SDOperand ExpandLibCall(const char *Name, SDNode *Node,
127 SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy,
130 SDOperand ExpandBIT_CONVERT(MVT::ValueType DestVT, SDOperand SrcOp);
131 SDOperand ExpandLegalINT_TO_FP(bool isSigned,
133 MVT::ValueType DestVT);
134 SDOperand PromoteLegalINT_TO_FP(SDOperand LegalOp, MVT::ValueType DestVT,
136 SDOperand PromoteLegalFP_TO_INT(SDOperand LegalOp, MVT::ValueType DestVT,
139 SDOperand ExpandBSWAP(SDOperand Op);
140 SDOperand ExpandBitCount(unsigned Opc, SDOperand Op);
141 bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt,
142 SDOperand &Lo, SDOperand &Hi);
143 void ExpandShiftParts(unsigned NodeOp, SDOperand Op, SDOperand Amt,
144 SDOperand &Lo, SDOperand &Hi);
146 SDOperand getIntPtrConstant(uint64_t Val) {
147 return DAG.getConstant(Val, TLI.getPointerTy());
152 static unsigned getScalarizedOpcode(unsigned VecOp, MVT::ValueType VT) {
154 default: assert(0 && "Don't know how to scalarize this opcode!");
155 case ISD::VADD: return MVT::isInteger(VT) ? ISD::ADD : ISD::FADD;
156 case ISD::VSUB: return MVT::isInteger(VT) ? ISD::SUB : ISD::FSUB;
157 case ISD::VMUL: return MVT::isInteger(VT) ? ISD::MUL : ISD::FMUL;
158 case ISD::VSDIV: return MVT::isInteger(VT) ? ISD::SDIV: ISD::FDIV;
159 case ISD::VUDIV: return MVT::isInteger(VT) ? ISD::UDIV: ISD::FDIV;
160 case ISD::VAND: return MVT::isInteger(VT) ? ISD::AND : 0;
161 case ISD::VOR: return MVT::isInteger(VT) ? ISD::OR : 0;
162 case ISD::VXOR: return MVT::isInteger(VT) ? ISD::XOR : 0;
166 SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
167 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
168 ValueTypeActions(TLI.getValueTypeActions()) {
169 assert(MVT::LAST_VALUETYPE <= 32 &&
170 "Too many value types for ValueTypeActions to hold!");
173 /// ComputeTopDownOrdering - Add the specified node to the Order list if it has
174 /// not been visited yet and if all of its operands have already been visited.
175 static void ComputeTopDownOrdering(SDNode *N, std::vector<SDNode*> &Order,
176 std::map<SDNode*, unsigned> &Visited) {
177 if (++Visited[N] != N->getNumOperands())
178 return; // Haven't visited all operands yet
182 if (N->hasOneUse()) { // Tail recurse in common case.
183 ComputeTopDownOrdering(*N->use_begin(), Order, Visited);
187 // Now that we have N in, add anything that uses it if all of their operands
189 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); UI != E;++UI)
190 ComputeTopDownOrdering(*UI, Order, Visited);
194 void SelectionDAGLegalize::LegalizeDAG() {
195 LastCALLSEQ_END = DAG.getEntryNode();
196 IsLegalizingCall = false;
198 // The legalize process is inherently a bottom-up recursive process (users
199 // legalize their uses before themselves). Given infinite stack space, we
200 // could just start legalizing on the root and traverse the whole graph. In
201 // practice however, this causes us to run out of stack space on large basic
202 // blocks. To avoid this problem, compute an ordering of the nodes where each
203 // node is only legalized after all of its operands are legalized.
204 std::map<SDNode*, unsigned> Visited;
205 std::vector<SDNode*> Order;
207 // Compute ordering from all of the leaves in the graphs, those (like the
208 // entry node) that have no operands.
209 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
210 E = DAG.allnodes_end(); I != E; ++I) {
211 if (I->getNumOperands() == 0) {
213 ComputeTopDownOrdering(I, Order, Visited);
217 assert(Order.size() == Visited.size() &&
219 (unsigned)std::distance(DAG.allnodes_begin(), DAG.allnodes_end()) &&
220 "Error: DAG is cyclic!");
223 for (unsigned i = 0, e = Order.size(); i != e; ++i) {
224 SDNode *N = Order[i];
225 switch (getTypeAction(N->getValueType(0))) {
226 default: assert(0 && "Bad type action!");
228 LegalizeOp(SDOperand(N, 0));
231 PromoteOp(SDOperand(N, 0));
235 ExpandOp(SDOperand(N, 0), X, Y);
241 // Finally, it's possible the root changed. Get the new root.
242 SDOperand OldRoot = DAG.getRoot();
243 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
244 DAG.setRoot(LegalizedNodes[OldRoot]);
246 ExpandedNodes.clear();
247 LegalizedNodes.clear();
248 PromotedNodes.clear();
250 // Remove dead nodes now.
251 DAG.RemoveDeadNodes(OldRoot.Val);
255 /// FindCallEndFromCallStart - Given a chained node that is part of a call
256 /// sequence, find the CALLSEQ_END node that terminates the call sequence.
257 static SDNode *FindCallEndFromCallStart(SDNode *Node) {
258 if (Node->getOpcode() == ISD::CALLSEQ_END)
260 if (Node->use_empty())
261 return 0; // No CallSeqEnd
263 // The chain is usually at the end.
264 SDOperand TheChain(Node, Node->getNumValues()-1);
265 if (TheChain.getValueType() != MVT::Other) {
266 // Sometimes it's at the beginning.
267 TheChain = SDOperand(Node, 0);
268 if (TheChain.getValueType() != MVT::Other) {
269 // Otherwise, hunt for it.
270 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
271 if (Node->getValueType(i) == MVT::Other) {
272 TheChain = SDOperand(Node, i);
276 // Otherwise, we walked into a node without a chain.
277 if (TheChain.getValueType() != MVT::Other)
282 for (SDNode::use_iterator UI = Node->use_begin(),
283 E = Node->use_end(); UI != E; ++UI) {
285 // Make sure to only follow users of our token chain.
287 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
288 if (User->getOperand(i) == TheChain)
289 if (SDNode *Result = FindCallEndFromCallStart(User))
295 /// FindCallStartFromCallEnd - Given a chained node that is part of a call
296 /// sequence, find the CALLSEQ_START node that initiates the call sequence.
297 static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
298 assert(Node && "Didn't find callseq_start for a call??");
299 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
301 assert(Node->getOperand(0).getValueType() == MVT::Other &&
302 "Node doesn't have a token chain argument!");
303 return FindCallStartFromCallEnd(Node->getOperand(0).Val);
306 /// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
307 /// see if any uses can reach Dest. If no dest operands can get to dest,
308 /// legalize them, legalize ourself, and return false, otherwise, return true.
309 bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N,
311 if (N == Dest) return true; // N certainly leads to Dest :)
313 // If the first result of this node has been already legalized, then it cannot
315 switch (getTypeAction(N->getValueType(0))) {
317 if (LegalizedNodes.count(SDOperand(N, 0))) return false;
320 if (PromotedNodes.count(SDOperand(N, 0))) return false;
323 if (ExpandedNodes.count(SDOperand(N, 0))) return false;
327 // Okay, this node has not already been legalized. Check and legalize all
328 // operands. If none lead to Dest, then we can legalize this node.
329 bool OperandsLeadToDest = false;
330 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
331 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
332 LegalizeAllNodesNotLeadingTo(N->getOperand(i).Val, Dest);
334 if (OperandsLeadToDest) return true;
336 // Okay, this node looks safe, legalize it and return false.
337 switch (getTypeAction(N->getValueType(0))) {
339 LegalizeOp(SDOperand(N, 0));
342 PromoteOp(SDOperand(N, 0));
346 ExpandOp(SDOperand(N, 0), X, Y);
355 SDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) {
356 assert(isTypeLegal(Op.getValueType()) &&
357 "Caller should expand or promote operands that are not legal!");
358 SDNode *Node = Op.Val;
360 // If this operation defines any values that cannot be represented in a
361 // register on this target, make sure to expand or promote them.
362 if (Node->getNumValues() > 1) {
363 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
364 switch (getTypeAction(Node->getValueType(i))) {
365 case Legal: break; // Nothing to do.
368 ExpandOp(Op.getValue(i), T1, T2);
369 assert(LegalizedNodes.count(Op) &&
370 "Expansion didn't add legal operands!");
371 return LegalizedNodes[Op];
374 PromoteOp(Op.getValue(i));
375 assert(LegalizedNodes.count(Op) &&
376 "Promotion didn't add legal operands!");
377 return LegalizedNodes[Op];
381 // Note that LegalizeOp may be reentered even from single-use nodes, which
382 // means that we always must cache transformed nodes.
383 std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
384 if (I != LegalizedNodes.end()) return I->second;
386 SDOperand Tmp1, Tmp2, Tmp3, Tmp4;
387 SDOperand Result = Op;
388 bool isCustom = false;
390 switch (Node->getOpcode()) {
391 case ISD::FrameIndex:
392 case ISD::EntryToken:
394 case ISD::BasicBlock:
395 case ISD::TargetFrameIndex:
396 case ISD::TargetConstant:
397 case ISD::TargetConstantFP:
398 case ISD::TargetConstantVec:
399 case ISD::TargetConstantPool:
400 case ISD::TargetGlobalAddress:
401 case ISD::TargetExternalSymbol:
406 // Primitives must all be legal.
407 assert(TLI.isOperationLegal(Node->getValueType(0), Node->getValueType(0)) &&
408 "This must be legal!");
411 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
412 // If this is a target node, legalize it by legalizing the operands then
413 // passing it through.
414 std::vector<SDOperand> Ops;
415 bool Changed = false;
416 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
417 Ops.push_back(LegalizeOp(Node->getOperand(i)));
418 Changed = Changed || Node->getOperand(i) != Ops.back();
421 if (Node->getNumValues() == 1)
422 Result = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Ops);
424 std::vector<MVT::ValueType> VTs(Node->value_begin(),
426 Result = DAG.getNode(Node->getOpcode(), VTs, Ops);
429 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
430 AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
431 return Result.getValue(Op.ResNo);
433 // Otherwise this is an unhandled builtin node. splat.
434 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
435 assert(0 && "Do not know how to legalize this operator!");
437 case ISD::GlobalAddress:
438 case ISD::ExternalSymbol:
439 case ISD::ConstantPool: // Nothing to do.
440 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
441 default: assert(0 && "This action is not supported yet!");
442 case TargetLowering::Custom:
443 Tmp1 = TLI.LowerOperation(Op, DAG);
444 if (Tmp1.Val) Result = Tmp1;
445 // FALLTHROUGH if the target doesn't want to lower this op after all.
446 case TargetLowering::Legal:
450 case ISD::AssertSext:
451 case ISD::AssertZext:
452 Tmp1 = LegalizeOp(Node->getOperand(0));
453 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
455 case ISD::MERGE_VALUES:
456 // Legalize eliminates MERGE_VALUES nodes.
457 Result = Node->getOperand(Op.ResNo);
459 case ISD::CopyFromReg:
460 Tmp1 = LegalizeOp(Node->getOperand(0));
461 Result = Op.getValue(0);
462 if (Node->getNumValues() == 2) {
463 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
465 assert(Node->getNumValues() == 3 && "Invalid copyfromreg!");
466 if (Node->getNumOperands() == 3) {
467 Tmp2 = LegalizeOp(Node->getOperand(2));
468 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
470 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
472 AddLegalizedOperand(Op.getValue(2), Result.getValue(2));
474 // Since CopyFromReg produces two values, make sure to remember that we
475 // legalized both of them.
476 AddLegalizedOperand(Op.getValue(0), Result);
477 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
478 return Result.getValue(Op.ResNo);
480 MVT::ValueType VT = Op.getValueType();
481 switch (TLI.getOperationAction(ISD::UNDEF, VT)) {
482 default: assert(0 && "This action is not supported yet!");
483 case TargetLowering::Expand:
484 if (MVT::isInteger(VT))
485 Result = DAG.getConstant(0, VT);
486 else if (MVT::isFloatingPoint(VT))
487 Result = DAG.getConstantFP(0, VT);
489 assert(0 && "Unknown value type!");
491 case TargetLowering::Legal:
498 assert(Node->getNumOperands() == 5 && "Invalid LOCATION node!");
499 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input chain.
501 switch (TLI.getOperationAction(ISD::LOCATION, MVT::Other)) {
502 case TargetLowering::Promote:
503 default: assert(0 && "This action is not supported yet!");
504 case TargetLowering::Expand: {
505 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
506 bool useDEBUG_LOC = TLI.isOperationLegal(ISD::DEBUG_LOC, MVT::Other);
507 bool useDEBUG_LABEL = TLI.isOperationLegal(ISD::DEBUG_LABEL, MVT::Other);
509 if (DebugInfo && (useDEBUG_LOC || useDEBUG_LABEL)) {
510 const std::string &FName =
511 cast<StringSDNode>(Node->getOperand(3))->getValue();
512 const std::string &DirName =
513 cast<StringSDNode>(Node->getOperand(4))->getValue();
514 unsigned SrcFile = DebugInfo->RecordSource(DirName, FName);
516 std::vector<SDOperand> Ops;
517 Ops.push_back(Tmp1); // chain
518 SDOperand LineOp = Node->getOperand(1);
519 SDOperand ColOp = Node->getOperand(2);
522 Ops.push_back(LineOp); // line #
523 Ops.push_back(ColOp); // col #
524 Ops.push_back(DAG.getConstant(SrcFile, MVT::i32)); // source file id
525 Result = DAG.getNode(ISD::DEBUG_LOC, MVT::Other, Ops);
527 unsigned Line = cast<ConstantSDNode>(LineOp)->getValue();
528 unsigned Col = cast<ConstantSDNode>(ColOp)->getValue();
529 unsigned ID = DebugInfo->RecordLabel(Line, Col, SrcFile);
530 Ops.push_back(DAG.getConstant(ID, MVT::i32));
531 Result = DAG.getNode(ISD::DEBUG_LABEL, MVT::Other, Ops);
534 Result = Tmp1; // chain
538 case TargetLowering::Legal:
539 if (Tmp1 != Node->getOperand(0) ||
540 getTypeAction(Node->getOperand(1).getValueType()) == Promote) {
541 std::vector<SDOperand> Ops;
543 if (getTypeAction(Node->getOperand(1).getValueType()) == Legal) {
544 Ops.push_back(Node->getOperand(1)); // line # must be legal.
545 Ops.push_back(Node->getOperand(2)); // col # must be legal.
547 // Otherwise promote them.
548 Ops.push_back(PromoteOp(Node->getOperand(1)));
549 Ops.push_back(PromoteOp(Node->getOperand(2)));
551 Ops.push_back(Node->getOperand(3)); // filename must be legal.
552 Ops.push_back(Node->getOperand(4)); // working dir # must be legal.
553 Result = DAG.UpdateNodeOperands(Result, Ops);
560 assert(Node->getNumOperands() == 4 && "Invalid DEBUG_LOC node!");
561 switch (TLI.getOperationAction(ISD::DEBUG_LOC, MVT::Other)) {
562 default: assert(0 && "This action is not supported yet!");
563 case TargetLowering::Legal:
564 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
565 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the line #.
566 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the col #.
567 Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize the source file id.
568 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4);
573 case ISD::DEBUG_LABEL:
574 assert(Node->getNumOperands() == 2 && "Invalid DEBUG_LABEL node!");
575 switch (TLI.getOperationAction(ISD::DEBUG_LABEL, MVT::Other)) {
576 default: assert(0 && "This action is not supported yet!");
577 case TargetLowering::Legal:
578 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
579 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the label id.
580 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
586 // We know we don't need to expand constants here, constants only have one
587 // value and we check that it is fine above.
589 // FIXME: Maybe we should handle things like targets that don't support full
590 // 32-bit immediates?
592 case ISD::ConstantFP: {
593 // Spill FP immediates to the constant pool if the target cannot directly
594 // codegen them. Targets often have some immediate values that can be
595 // efficiently generated into an FP register without a load. We explicitly
596 // leave these constants as ConstantFP nodes for the target to deal with.
597 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
599 // Check to see if this FP immediate is already legal.
600 bool isLegal = false;
601 for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(),
602 E = TLI.legal_fpimm_end(); I != E; ++I)
603 if (CFP->isExactlyValue(*I)) {
608 // If this is a legal constant, turn it into a TargetConstantFP node.
610 Result = DAG.getTargetConstantFP(CFP->getValue(), CFP->getValueType(0));
614 switch (TLI.getOperationAction(ISD::ConstantFP, CFP->getValueType(0))) {
615 default: assert(0 && "This action is not supported yet!");
616 case TargetLowering::Custom:
617 Tmp3 = TLI.LowerOperation(Result, DAG);
623 case TargetLowering::Expand:
624 // Otherwise we need to spill the constant to memory.
627 // If a FP immediate is precise when represented as a float and if the
628 // target can do an extending load from float to double, we put it into
629 // the constant pool as a float, even if it's is statically typed as a
631 MVT::ValueType VT = CFP->getValueType(0);
632 bool isDouble = VT == MVT::f64;
633 ConstantFP *LLVMC = ConstantFP::get(isDouble ? Type::DoubleTy :
634 Type::FloatTy, CFP->getValue());
635 if (isDouble && CFP->isExactlyValue((float)CFP->getValue()) &&
636 // Only do this if the target has a native EXTLOAD instruction from
638 TLI.isOperationLegal(ISD::EXTLOAD, MVT::f32)) {
639 LLVMC = cast<ConstantFP>(ConstantExpr::getCast(LLVMC, Type::FloatTy));
644 SDOperand CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
646 Result = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
647 CPIdx, DAG.getSrcValue(NULL), MVT::f32);
649 Result = DAG.getLoad(VT, DAG.getEntryNode(), CPIdx,
650 DAG.getSrcValue(NULL));
655 case ISD::ConstantVec:
656 switch (TLI.getOperationAction(ISD::ConstantVec, Node->getValueType(0))) {
657 default: assert(0 && "This action is not supported yet!");
658 case TargetLowering::Custom:
659 Tmp3 = TLI.LowerOperation(Result, DAG);
665 case TargetLowering::Expand:
666 // We assume that vector constants are not legal, and will be immediately
667 // spilled to the constant pool.
669 // Create a ConstantPacked, and put it in the constant pool.
670 MVT::ValueType VT = Node->getValueType(0);
672 MVT::getTypeForValueType(Node->getOperand(0).getValueType());
673 std::vector<Constant*> CV;
674 if (MVT::isFloatingPoint(VT)) {
675 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
676 double V = cast<ConstantFPSDNode>(Node->getOperand(i))->getValue();
677 CV.push_back(ConstantFP::get(OpNTy, V));
680 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
681 uint64_t V = cast<ConstantSDNode>(Node->getOperand(i))->getValue();
682 CV.push_back(ConstantUInt::get(OpNTy, V));
685 Constant *CP = ConstantPacked::get(CV);
686 SDOperand CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
687 Result = DAG.getLoad(VT, DAG.getEntryNode(), CPIdx,
688 DAG.getSrcValue(NULL));
692 case ISD::TokenFactor:
693 if (Node->getNumOperands() == 2) {
694 Tmp1 = LegalizeOp(Node->getOperand(0));
695 Tmp2 = LegalizeOp(Node->getOperand(1));
696 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
697 } else if (Node->getNumOperands() == 3) {
698 Tmp1 = LegalizeOp(Node->getOperand(0));
699 Tmp2 = LegalizeOp(Node->getOperand(1));
700 Tmp3 = LegalizeOp(Node->getOperand(2));
701 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
703 std::vector<SDOperand> Ops;
704 // Legalize the operands.
705 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
706 Ops.push_back(LegalizeOp(Node->getOperand(i)));
707 Result = DAG.UpdateNodeOperands(Result, Ops);
711 case ISD::CALLSEQ_START: {
712 SDNode *CallEnd = FindCallEndFromCallStart(Node);
714 // Recursively Legalize all of the inputs of the call end that do not lead
715 // to this call start. This ensures that any libcalls that need be inserted
716 // are inserted *before* the CALLSEQ_START.
717 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
718 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).Val, Node);
720 // Now that we legalized all of the inputs (which may have inserted
721 // libcalls) create the new CALLSEQ_START node.
722 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
724 // Merge in the last call, to ensure that this call start after the last
726 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
727 Tmp1 = LegalizeOp(Tmp1);
729 // Do not try to legalize the target-specific arguments (#1+).
730 if (Tmp1 != Node->getOperand(0)) {
731 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
733 Result = DAG.UpdateNodeOperands(Result, Ops);
736 // Remember that the CALLSEQ_START is legalized.
737 AddLegalizedOperand(Op.getValue(0), Result);
738 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
739 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
741 // Now that the callseq_start and all of the non-call nodes above this call
742 // sequence have been legalized, legalize the call itself. During this
743 // process, no libcalls can/will be inserted, guaranteeing that no calls
745 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
746 SDOperand InCallSEQ = LastCALLSEQ_END;
747 // Note that we are selecting this call!
748 LastCALLSEQ_END = SDOperand(CallEnd, 0);
749 IsLegalizingCall = true;
751 // Legalize the call, starting from the CALLSEQ_END.
752 LegalizeOp(LastCALLSEQ_END);
753 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
756 case ISD::CALLSEQ_END:
757 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
758 // will cause this node to be legalized as well as handling libcalls right.
759 if (LastCALLSEQ_END.Val != Node) {
760 LegalizeOp(SDOperand(FindCallStartFromCallEnd(Node), 0));
761 std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
762 assert(I != LegalizedNodes.end() &&
763 "Legalizing the call start should have legalized this node!");
767 // Otherwise, the call start has been legalized and everything is going
768 // according to plan. Just legalize ourselves normally here.
769 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
770 // Do not try to legalize the target-specific arguments (#1+), except for
771 // an optional flag input.
772 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
773 if (Tmp1 != Node->getOperand(0)) {
774 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
776 Result = DAG.UpdateNodeOperands(Result, Ops);
779 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
780 if (Tmp1 != Node->getOperand(0) ||
781 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
782 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
785 Result = DAG.UpdateNodeOperands(Result, Ops);
788 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
789 // This finishes up call legalization.
790 IsLegalizingCall = false;
792 // If the CALLSEQ_END node has a flag, remember that we legalized it.
793 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
794 if (Node->getNumValues() == 2)
795 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
796 return Result.getValue(Op.ResNo);
797 case ISD::DYNAMIC_STACKALLOC: {
798 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
799 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size.
800 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment.
801 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
803 Tmp1 = Result.getValue(0);
804 Tmp2 = Result.getValue(1);
805 switch (TLI.getOperationAction(Node->getOpcode(),
806 Node->getValueType(0))) {
807 default: assert(0 && "This action is not supported yet!");
808 case TargetLowering::Expand: {
809 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
810 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
811 " not tell us which reg is the stack pointer!");
812 SDOperand Chain = Tmp1.getOperand(0);
813 SDOperand Size = Tmp2.getOperand(1);
814 SDOperand SP = DAG.getCopyFromReg(Chain, SPReg, Node->getValueType(0));
815 Tmp1 = DAG.getNode(ISD::SUB, Node->getValueType(0), SP, Size); // Value
816 Tmp2 = DAG.getCopyToReg(SP.getValue(1), SPReg, Tmp1); // Output chain
817 Tmp1 = LegalizeOp(Tmp1);
818 Tmp2 = LegalizeOp(Tmp2);
821 case TargetLowering::Custom:
822 Tmp3 = TLI.LowerOperation(Tmp1, DAG);
824 Tmp1 = LegalizeOp(Tmp3);
825 Tmp2 = LegalizeOp(Tmp3.getValue(1));
828 case TargetLowering::Legal:
831 // Since this op produce two values, make sure to remember that we
832 // legalized both of them.
833 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
834 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
835 return Op.ResNo ? Tmp2 : Tmp1;
838 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize Chain.
839 Tmp2 = Node->getOperand(Node->getNumOperands()-1);
840 if (Tmp2.getValueType() == MVT::Flag) // Legalize Flag if it exists.
841 Tmp2 = Tmp3 = SDOperand(0, 0);
843 Tmp3 = LegalizeOp(Tmp2);
845 if (Tmp1 != Node->getOperand(0) || Tmp2 != Tmp3) {
846 std::vector<SDOperand> Ops(Node->op_begin(), Node->op_end());
848 if (Tmp3.Val) Ops.back() = Tmp3;
849 Result = DAG.UpdateNodeOperands(Result, Ops);
852 // INLINE asm returns a chain and flag, make sure to add both to the map.
853 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
854 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
855 return Result.getValue(Op.ResNo);
857 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
858 // Ensure that libcalls are emitted before a branch.
859 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
860 Tmp1 = LegalizeOp(Tmp1);
861 LastCALLSEQ_END = DAG.getEntryNode();
863 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
867 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
868 // Ensure that libcalls are emitted before a return.
869 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
870 Tmp1 = LegalizeOp(Tmp1);
871 LastCALLSEQ_END = DAG.getEntryNode();
873 switch (getTypeAction(Node->getOperand(1).getValueType())) {
874 case Expand: assert(0 && "It's impossible to expand bools");
876 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
879 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition.
883 // Basic block destination (Op#2) is always legal.
884 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
886 switch (TLI.getOperationAction(ISD::BRCOND, MVT::Other)) {
887 default: assert(0 && "This action is not supported yet!");
888 case TargetLowering::Legal: break;
889 case TargetLowering::Custom:
890 Tmp1 = TLI.LowerOperation(Result, DAG);
891 if (Tmp1.Val) Result = Tmp1;
893 case TargetLowering::Expand:
894 // Expand brcond's setcc into its constituent parts and create a BR_CC
896 if (Tmp2.getOpcode() == ISD::SETCC) {
897 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1, Tmp2.getOperand(2),
898 Tmp2.getOperand(0), Tmp2.getOperand(1),
899 Node->getOperand(2));
901 // Make sure the condition is either zero or one. It may have been
902 // promoted from something else.
903 unsigned NumBits = MVT::getSizeInBits(Tmp2.getValueType());
904 if (!TLI.MaskedValueIsZero(Tmp2, (~0ULL >> (64-NumBits))^1))
905 Tmp2 = DAG.getZeroExtendInReg(Tmp2, MVT::i1);
907 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1,
908 DAG.getCondCode(ISD::SETNE), Tmp2,
909 DAG.getConstant(0, Tmp2.getValueType()),
910 Node->getOperand(2));
916 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
917 // Ensure that libcalls are emitted before a branch.
918 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
919 Tmp1 = LegalizeOp(Tmp1);
920 LastCALLSEQ_END = DAG.getEntryNode();
922 Tmp2 = Node->getOperand(2); // LHS
923 Tmp3 = Node->getOperand(3); // RHS
924 Tmp4 = Node->getOperand(1); // CC
926 LegalizeSetCCOperands(Tmp2, Tmp3, Tmp4);
928 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
929 // the LHS is a legal SETCC itself. In this case, we need to compare
930 // the result against zero to select between true and false values.
932 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
933 Tmp4 = DAG.getCondCode(ISD::SETNE);
936 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp4, Tmp2, Tmp3,
937 Node->getOperand(4));
939 switch (TLI.getOperationAction(ISD::BR_CC, Tmp3.getValueType())) {
940 default: assert(0 && "Unexpected action for BR_CC!");
941 case TargetLowering::Legal: break;
942 case TargetLowering::Custom:
943 Tmp4 = TLI.LowerOperation(Result, DAG);
944 if (Tmp4.Val) Result = Tmp4;
948 case ISD::BRCONDTWOWAY:
949 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
950 switch (getTypeAction(Node->getOperand(1).getValueType())) {
951 case Expand: assert(0 && "It's impossible to expand bools");
953 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
956 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition.
960 // If this target does not support BRCONDTWOWAY, lower it to a BRCOND/BR
962 switch (TLI.getOperationAction(ISD::BRCONDTWOWAY, MVT::Other)) {
963 case TargetLowering::Promote:
964 default: assert(0 && "This action is not supported yet!");
965 case TargetLowering::Legal:
966 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2),
967 Node->getOperand(3));
969 case TargetLowering::Expand:
970 // If BRTWOWAY_CC is legal for this target, then simply expand this node
971 // to that. Otherwise, skip BRTWOWAY_CC and expand directly to a
973 if (TLI.isOperationLegal(ISD::BRTWOWAY_CC, MVT::Other)) {
974 if (Tmp2.getOpcode() == ISD::SETCC) {
975 Tmp3 = Tmp2.getOperand(0);
976 Tmp4 = Tmp2.getOperand(1);
977 Tmp2 = Tmp2.getOperand(2);
980 Tmp4 = DAG.getConstant(0, Tmp2.getValueType());
981 Tmp2 = DAG.getCondCode(ISD::SETNE);
983 std::vector<SDOperand> Ops;
988 Ops.push_back(Node->getOperand(2));
989 Ops.push_back(Node->getOperand(3));
990 Result = DAG.getNode(ISD::BRTWOWAY_CC, MVT::Other, Ops);
992 Result = DAG.getNode(ISD::BRCOND, MVT::Other, Tmp1, Tmp2,
993 Node->getOperand(2));
994 Result = DAG.getNode(ISD::BR, MVT::Other, Result, Node->getOperand(3));
999 case ISD::BRTWOWAY_CC: {
1000 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1001 // Ensure that libcalls are emitted before a branch.
1002 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1003 Tmp1 = LegalizeOp(Tmp1);
1004 LastCALLSEQ_END = DAG.getEntryNode();
1006 Tmp2 = Node->getOperand(2); // LHS
1007 Tmp3 = Node->getOperand(3); // RHS
1008 Tmp4 = Node->getOperand(1); // CC
1010 LegalizeSetCCOperands(Tmp2, Tmp3, Tmp4);
1012 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1013 // the LHS is a legal SETCC itself. In this case, we need to compare
1014 // the result against zero to select between true and false values.
1015 if (Tmp3.Val == 0) {
1016 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
1017 Tmp4 = DAG.getCondCode(ISD::SETNE);
1019 std::vector<SDOperand> Ops;
1020 Ops.push_back(Tmp1);
1021 Ops.push_back(Tmp4);
1022 Ops.push_back(Tmp2);
1023 Ops.push_back(Tmp3);
1024 Ops.push_back(Node->getOperand(4));
1025 Ops.push_back(Node->getOperand(5));
1026 Result = DAG.UpdateNodeOperands(Result, Ops);
1028 // Everything is legal, see if we should expand this op or something.
1029 switch (TLI.getOperationAction(ISD::BRTWOWAY_CC, MVT::Other)) {
1030 default: assert(0 && "This action is not supported yet!");
1031 case TargetLowering::Legal: break;
1032 case TargetLowering::Expand:
1033 Result = DAG.getNode(ISD::BRCOND, MVT::Other, Tmp1,
1034 DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), Tmp2,
1036 Result.getOperand(4));
1037 Result = DAG.getNode(ISD::BR, MVT::Other, Result, Result.getOperand(5));
1043 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1044 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1046 MVT::ValueType VT = Node->getValueType(0);
1047 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1048 Tmp2 = Result.getValue(0);
1049 Tmp3 = Result.getValue(1);
1051 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1052 default: assert(0 && "This action is not supported yet!");
1053 case TargetLowering::Legal: break;
1054 case TargetLowering::Custom:
1055 Tmp1 = TLI.LowerOperation(Tmp2, DAG);
1057 Tmp2 = LegalizeOp(Tmp1);
1058 Tmp3 = LegalizeOp(Tmp1.getValue(1));
1062 // Since loads produce two values, make sure to remember that we
1063 // legalized both of them.
1064 AddLegalizedOperand(SDOperand(Node, 0), Tmp2);
1065 AddLegalizedOperand(SDOperand(Node, 1), Tmp3);
1066 return Op.ResNo ? Tmp3 : Tmp2;
1070 case ISD::ZEXTLOAD: {
1071 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1072 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1074 MVT::ValueType SrcVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
1075 switch (TLI.getOperationAction(Node->getOpcode(), SrcVT)) {
1076 default: assert(0 && "This action is not supported yet!");
1077 case TargetLowering::Promote:
1078 assert(SrcVT == MVT::i1 && "Can only promote EXTLOAD from i1 -> i8!");
1079 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2),
1080 DAG.getValueType(MVT::i8));
1081 Tmp1 = Result.getValue(0);
1082 Tmp2 = Result.getValue(1);
1084 case TargetLowering::Custom:
1087 case TargetLowering::Legal:
1088 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2),
1089 Node->getOperand(3));
1090 Tmp1 = Result.getValue(0);
1091 Tmp2 = Result.getValue(1);
1094 Tmp3 = TLI.LowerOperation(Tmp3, DAG);
1096 Tmp1 = LegalizeOp(Tmp3);
1097 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1101 case TargetLowering::Expand:
1102 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
1103 if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) {
1104 SDOperand Load = DAG.getLoad(SrcVT, Tmp1, Tmp2, Node->getOperand(2));
1105 Result = DAG.getNode(ISD::FP_EXTEND, Node->getValueType(0), Load);
1106 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
1107 Tmp2 = LegalizeOp(Load.getValue(1));
1110 assert(Node->getOpcode() != ISD::EXTLOAD &&
1111 "EXTLOAD should always be supported!");
1112 // Turn the unsupported load into an EXTLOAD followed by an explicit
1113 // zero/sign extend inreg.
1114 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
1115 Tmp1, Tmp2, Node->getOperand(2), SrcVT);
1117 if (Node->getOpcode() == ISD::SEXTLOAD)
1118 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
1119 Result, DAG.getValueType(SrcVT));
1121 ValRes = DAG.getZeroExtendInReg(Result, SrcVT);
1122 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
1123 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
1126 // Since loads produce two values, make sure to remember that we legalized
1128 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1129 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1130 return Op.ResNo ? Tmp2 : Tmp1;
1132 case ISD::EXTRACT_ELEMENT: {
1133 MVT::ValueType OpTy = Node->getOperand(0).getValueType();
1134 switch (getTypeAction(OpTy)) {
1135 default: assert(0 && "EXTRACT_ELEMENT action for type unimplemented!");
1137 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) {
1139 Result = DAG.getNode(ISD::SRL, OpTy, Node->getOperand(0),
1140 DAG.getConstant(MVT::getSizeInBits(OpTy)/2,
1141 TLI.getShiftAmountTy()));
1142 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Result);
1145 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0),
1146 Node->getOperand(0));
1150 // Get both the low and high parts.
1151 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
1152 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue())
1153 Result = Tmp2; // 1 -> Hi
1155 Result = Tmp1; // 0 -> Lo
1161 case ISD::CopyToReg:
1162 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1164 assert(isTypeLegal(Node->getOperand(2).getValueType()) &&
1165 "Register type must be legal!");
1166 // Legalize the incoming value (must be a legal type).
1167 Tmp2 = LegalizeOp(Node->getOperand(2));
1168 if (Node->getNumValues() == 1) {
1169 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2);
1171 assert(Node->getNumValues() == 2 && "Unknown CopyToReg");
1172 if (Node->getNumOperands() == 4) {
1173 Tmp3 = LegalizeOp(Node->getOperand(3));
1174 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2,
1177 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
1180 // Since this produces two values, make sure to remember that we legalized
1182 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1183 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1189 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1191 // Ensure that libcalls are emitted before a return.
1192 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1193 Tmp1 = LegalizeOp(Tmp1);
1194 LastCALLSEQ_END = DAG.getEntryNode();
1196 switch (Node->getNumOperands()) {
1198 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1200 Tmp2 = LegalizeOp(Node->getOperand(1));
1201 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1205 ExpandOp(Node->getOperand(1), Lo, Hi);
1206 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Hi);
1210 Tmp2 = PromoteOp(Node->getOperand(1));
1211 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1212 Result = LegalizeOp(Result);
1217 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1219 default: { // ret <values>
1220 std::vector<SDOperand> NewValues;
1221 NewValues.push_back(Tmp1);
1222 for (unsigned i = 1, e = Node->getNumOperands(); i != e; ++i)
1223 switch (getTypeAction(Node->getOperand(i).getValueType())) {
1225 NewValues.push_back(LegalizeOp(Node->getOperand(i)));
1229 ExpandOp(Node->getOperand(i), Lo, Hi);
1230 NewValues.push_back(Lo);
1231 NewValues.push_back(Hi);
1235 assert(0 && "Can't promote multiple return value yet!");
1238 if (NewValues.size() == Node->getNumOperands())
1239 Result = DAG.UpdateNodeOperands(Result, NewValues);
1241 Result = DAG.getNode(ISD::RET, MVT::Other, NewValues);
1246 if (Result.getOpcode() == ISD::RET) {
1247 switch (TLI.getOperationAction(Result.getOpcode(), MVT::Other)) {
1248 default: assert(0 && "This action is not supported yet!");
1249 case TargetLowering::Legal: break;
1250 case TargetLowering::Custom:
1251 Tmp1 = TLI.LowerOperation(Result, DAG);
1252 if (Tmp1.Val) Result = Tmp1;
1258 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1259 Tmp2 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer.
1261 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
1262 // FIXME: We shouldn't do this for TargetConstantFP's.
1263 if (ConstantFPSDNode *CFP =dyn_cast<ConstantFPSDNode>(Node->getOperand(1))){
1264 if (CFP->getValueType(0) == MVT::f32) {
1265 Tmp3 = DAG.getConstant(FloatToBits(CFP->getValue()), MVT::i32);
1267 assert(CFP->getValueType(0) == MVT::f64 && "Unknown FP type!");
1268 Tmp3 = DAG.getConstant(DoubleToBits(CFP->getValue()), MVT::i64);
1270 Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Tmp3, Tmp2,
1271 Node->getOperand(3));
1275 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1277 Tmp3 = LegalizeOp(Node->getOperand(1));
1278 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1279 Node->getOperand(3));
1281 MVT::ValueType VT = Tmp3.getValueType();
1282 switch (TLI.getOperationAction(ISD::STORE, VT)) {
1283 default: assert(0 && "This action is not supported yet!");
1284 case TargetLowering::Legal: break;
1285 case TargetLowering::Custom:
1286 Tmp1 = TLI.LowerOperation(Result, DAG);
1287 if (Tmp1.Val) Result = Tmp1;
1293 // Truncate the value and store the result.
1294 Tmp3 = PromoteOp(Node->getOperand(1));
1295 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp3, Tmp2,
1296 Node->getOperand(3),
1297 DAG.getValueType(Node->getOperand(1).getValueType()));
1302 ExpandOp(Node->getOperand(1), Lo, Hi);
1304 if (!TLI.isLittleEndian())
1307 Lo = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Lo, Tmp2,
1308 Node->getOperand(3));
1309 // If this is a vector type, then we have to calculate the increment as
1310 // the product of the element size in bytes, and the number of elements
1311 // in the high half of the vector.
1312 unsigned IncrementSize;
1313 if (MVT::Vector == Hi.getValueType()) {
1314 unsigned NumElems = cast<ConstantSDNode>(Hi.getOperand(0))->getValue();
1315 MVT::ValueType EVT = cast<VTSDNode>(Hi.getOperand(1))->getVT();
1316 IncrementSize = NumElems * MVT::getSizeInBits(EVT)/8;
1318 IncrementSize = MVT::getSizeInBits(Hi.getValueType())/8;
1320 Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2,
1321 getIntPtrConstant(IncrementSize));
1322 assert(isTypeLegal(Tmp2.getValueType()) &&
1323 "Pointers must be legal!");
1324 // FIXME: This sets the srcvalue of both halves to be the same, which is
1326 Hi = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Hi, Tmp2,
1327 Node->getOperand(3));
1328 Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi);
1334 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1335 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
1337 case ISD::STACKSAVE:
1338 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1339 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1340 Tmp1 = Result.getValue(0);
1341 Tmp2 = Result.getValue(1);
1343 switch (TLI.getOperationAction(ISD::STACKSAVE, MVT::Other)) {
1344 default: assert(0 && "This action is not supported yet!");
1345 case TargetLowering::Legal: break;
1346 case TargetLowering::Custom:
1347 Tmp3 = TLI.LowerOperation(Result, DAG);
1349 Tmp1 = LegalizeOp(Tmp3);
1350 Tmp2 = LegalizeOp(Tmp3.getValue(1));
1353 case TargetLowering::Expand:
1354 // Expand to CopyFromReg if the target set
1355 // StackPointerRegisterToSaveRestore.
1356 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
1357 Tmp1 = DAG.getCopyFromReg(Result.getOperand(0), SP,
1358 Node->getValueType(0));
1359 Tmp2 = Tmp1.getValue(1);
1361 Tmp1 = DAG.getNode(ISD::UNDEF, Node->getValueType(0));
1362 Tmp2 = Node->getOperand(0);
1367 // Since stacksave produce two values, make sure to remember that we
1368 // legalized both of them.
1369 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1370 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1371 return Op.ResNo ? Tmp2 : Tmp1;
1373 case ISD::STACKRESTORE:
1374 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1375 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1376 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1378 switch (TLI.getOperationAction(ISD::STACKRESTORE, MVT::Other)) {
1379 default: assert(0 && "This action is not supported yet!");
1380 case TargetLowering::Legal: break;
1381 case TargetLowering::Custom:
1382 Tmp1 = TLI.LowerOperation(Result, DAG);
1383 if (Tmp1.Val) Result = Tmp1;
1385 case TargetLowering::Expand:
1386 // Expand to CopyToReg if the target set
1387 // StackPointerRegisterToSaveRestore.
1388 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
1389 Result = DAG.getCopyToReg(Tmp1, SP, Tmp2);
1397 case ISD::READCYCLECOUNTER:
1398 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain
1399 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1401 // Since rdcc produce two values, make sure to remember that we legalized
1403 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1404 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1407 case ISD::TRUNCSTORE: {
1408 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1409 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer.
1411 assert(isTypeLegal(Node->getOperand(1).getValueType()) &&
1412 "Cannot handle illegal TRUNCSTORE yet!");
1413 Tmp2 = LegalizeOp(Node->getOperand(1));
1415 // The only promote case we handle is TRUNCSTORE:i1 X into
1416 // -> TRUNCSTORE:i8 (and X, 1)
1417 if (cast<VTSDNode>(Node->getOperand(4))->getVT() == MVT::i1 &&
1418 TLI.getOperationAction(ISD::TRUNCSTORE, MVT::i1) ==
1419 TargetLowering::Promote) {
1420 // Promote the bool to a mask then store.
1421 Tmp2 = DAG.getNode(ISD::AND, Tmp2.getValueType(), Tmp2,
1422 DAG.getConstant(1, Tmp2.getValueType()));
1423 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp2, Tmp3,
1424 Node->getOperand(3), DAG.getValueType(MVT::i8));
1426 } else if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) ||
1427 Tmp3 != Node->getOperand(2)) {
1428 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
1429 Node->getOperand(3), Node->getOperand(4));
1432 MVT::ValueType StVT = cast<VTSDNode>(Result.Val->getOperand(4))->getVT();
1433 switch (TLI.getOperationAction(Result.Val->getOpcode(), StVT)) {
1434 default: assert(0 && "This action is not supported yet!");
1435 case TargetLowering::Legal: break;
1436 case TargetLowering::Custom:
1437 Tmp1 = TLI.LowerOperation(Result, DAG);
1438 if (Tmp1.Val) Result = Tmp1;
1444 switch (getTypeAction(Node->getOperand(0).getValueType())) {
1445 case Expand: assert(0 && "It's impossible to expand bools");
1447 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition.
1450 Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition.
1453 Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal
1454 Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal
1456 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1458 switch (TLI.getOperationAction(ISD::SELECT, Tmp2.getValueType())) {
1459 default: assert(0 && "This action is not supported yet!");
1460 case TargetLowering::Legal: break;
1461 case TargetLowering::Custom: {
1462 Tmp1 = TLI.LowerOperation(Result, DAG);
1463 if (Tmp1.Val) Result = Tmp1;
1466 case TargetLowering::Expand:
1467 if (Tmp1.getOpcode() == ISD::SETCC) {
1468 Result = DAG.getSelectCC(Tmp1.getOperand(0), Tmp1.getOperand(1),
1470 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
1472 // Make sure the condition is either zero or one. It may have been
1473 // promoted from something else.
1474 unsigned NumBits = MVT::getSizeInBits(Tmp1.getValueType());
1475 if (!TLI.MaskedValueIsZero(Tmp1, (~0ULL >> (64-NumBits))^1))
1476 Tmp1 = DAG.getZeroExtendInReg(Tmp1, MVT::i1);
1477 Result = DAG.getSelectCC(Tmp1,
1478 DAG.getConstant(0, Tmp1.getValueType()),
1479 Tmp2, Tmp3, ISD::SETNE);
1482 case TargetLowering::Promote: {
1483 MVT::ValueType NVT =
1484 TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType());
1485 unsigned ExtOp, TruncOp;
1486 if (MVT::isInteger(Tmp2.getValueType())) {
1487 ExtOp = ISD::ANY_EXTEND;
1488 TruncOp = ISD::TRUNCATE;
1490 ExtOp = ISD::FP_EXTEND;
1491 TruncOp = ISD::FP_ROUND;
1493 // Promote each of the values to the new type.
1494 Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2);
1495 Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3);
1496 // Perform the larger operation, then round down.
1497 Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3);
1498 Result = DAG.getNode(TruncOp, Node->getValueType(0), Result);
1503 case ISD::SELECT_CC: {
1504 Tmp1 = Node->getOperand(0); // LHS
1505 Tmp2 = Node->getOperand(1); // RHS
1506 Tmp3 = LegalizeOp(Node->getOperand(2)); // True
1507 Tmp4 = LegalizeOp(Node->getOperand(3)); // False
1508 SDOperand CC = Node->getOperand(4);
1510 LegalizeSetCCOperands(Tmp1, Tmp2, CC);
1512 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1513 // the LHS is a legal SETCC itself. In this case, we need to compare
1514 // the result against zero to select between true and false values.
1515 if (Tmp2.Val == 0) {
1516 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
1517 CC = DAG.getCondCode(ISD::SETNE);
1519 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, CC);
1521 // Everything is legal, see if we should expand this op or something.
1522 switch (TLI.getOperationAction(ISD::SELECT_CC, Tmp3.getValueType())) {
1523 default: assert(0 && "This action is not supported yet!");
1524 case TargetLowering::Legal: break;
1525 case TargetLowering::Custom:
1526 Tmp1 = TLI.LowerOperation(Result, DAG);
1527 if (Tmp1.Val) Result = Tmp1;
1533 Tmp1 = Node->getOperand(0);
1534 Tmp2 = Node->getOperand(1);
1535 Tmp3 = Node->getOperand(2);
1536 LegalizeSetCCOperands(Tmp1, Tmp2, Tmp3);
1538 // If we had to Expand the SetCC operands into a SELECT node, then it may
1539 // not always be possible to return a true LHS & RHS. In this case, just
1540 // return the value we legalized, returned in the LHS
1541 if (Tmp2.Val == 0) {
1546 switch (TLI.getOperationAction(ISD::SETCC, Tmp1.getValueType())) {
1547 default: assert(0 && "Cannot handle this action for SETCC yet!");
1548 case TargetLowering::Custom:
1551 case TargetLowering::Legal:
1552 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1554 Tmp3 = TLI.LowerOperation(Result, DAG);
1555 if (Tmp3.Val) Result = Tmp3;
1558 case TargetLowering::Promote: {
1559 // First step, figure out the appropriate operation to use.
1560 // Allow SETCC to not be supported for all legal data types
1561 // Mostly this targets FP
1562 MVT::ValueType NewInTy = Node->getOperand(0).getValueType();
1563 MVT::ValueType OldVT = NewInTy;
1565 // Scan for the appropriate larger type to use.
1567 NewInTy = (MVT::ValueType)(NewInTy+1);
1569 assert(MVT::isInteger(NewInTy) == MVT::isInteger(OldVT) &&
1570 "Fell off of the edge of the integer world");
1571 assert(MVT::isFloatingPoint(NewInTy) == MVT::isFloatingPoint(OldVT) &&
1572 "Fell off of the edge of the floating point world");
1574 // If the target supports SETCC of this type, use it.
1575 if (TLI.isOperationLegal(ISD::SETCC, NewInTy))
1578 if (MVT::isInteger(NewInTy))
1579 assert(0 && "Cannot promote Legal Integer SETCC yet");
1581 Tmp1 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp1);
1582 Tmp2 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp2);
1584 Tmp1 = LegalizeOp(Tmp1);
1585 Tmp2 = LegalizeOp(Tmp2);
1586 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1587 Result = LegalizeOp(Result);
1590 case TargetLowering::Expand:
1591 // Expand a setcc node into a select_cc of the same condition, lhs, and
1592 // rhs that selects between const 1 (true) and const 0 (false).
1593 MVT::ValueType VT = Node->getValueType(0);
1594 Result = DAG.getNode(ISD::SELECT_CC, VT, Tmp1, Tmp2,
1595 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
1596 Node->getOperand(2));
1602 case ISD::MEMMOVE: {
1603 Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain
1604 Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer
1606 if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte
1607 switch (getTypeAction(Node->getOperand(2).getValueType())) {
1608 case Expand: assert(0 && "Cannot expand a byte!");
1610 Tmp3 = LegalizeOp(Node->getOperand(2));
1613 Tmp3 = PromoteOp(Node->getOperand(2));
1617 Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer,
1621 switch (getTypeAction(Node->getOperand(3).getValueType())) {
1623 // Length is too big, just take the lo-part of the length.
1625 ExpandOp(Node->getOperand(3), HiPart, Tmp4);
1629 Tmp4 = LegalizeOp(Node->getOperand(3));
1632 Tmp4 = PromoteOp(Node->getOperand(3));
1637 switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint
1638 case Expand: assert(0 && "Cannot expand this yet!");
1640 Tmp5 = LegalizeOp(Node->getOperand(4));
1643 Tmp5 = PromoteOp(Node->getOperand(4));
1647 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
1648 default: assert(0 && "This action not implemented for this operation!");
1649 case TargetLowering::Custom:
1652 case TargetLowering::Legal:
1653 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, Tmp5);
1655 Tmp1 = TLI.LowerOperation(Result, DAG);
1656 if (Tmp1.Val) Result = Tmp1;
1659 case TargetLowering::Expand: {
1660 // Otherwise, the target does not support this operation. Lower the
1661 // operation to an explicit libcall as appropriate.
1662 MVT::ValueType IntPtr = TLI.getPointerTy();
1663 const Type *IntPtrTy = TLI.getTargetData().getIntPtrType();
1664 std::vector<std::pair<SDOperand, const Type*> > Args;
1666 const char *FnName = 0;
1667 if (Node->getOpcode() == ISD::MEMSET) {
1668 Args.push_back(std::make_pair(Tmp2, IntPtrTy));
1669 // Extend the (previously legalized) ubyte argument to be an int value
1671 if (Tmp3.getValueType() > MVT::i32)
1672 Tmp3 = DAG.getNode(ISD::TRUNCATE, MVT::i32, Tmp3);
1674 Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3);
1675 Args.push_back(std::make_pair(Tmp3, Type::IntTy));
1676 Args.push_back(std::make_pair(Tmp4, IntPtrTy));
1679 } else if (Node->getOpcode() == ISD::MEMCPY ||
1680 Node->getOpcode() == ISD::MEMMOVE) {
1681 Args.push_back(std::make_pair(Tmp2, IntPtrTy));
1682 Args.push_back(std::make_pair(Tmp3, IntPtrTy));
1683 Args.push_back(std::make_pair(Tmp4, IntPtrTy));
1684 FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy";
1686 assert(0 && "Unknown op!");
1689 std::pair<SDOperand,SDOperand> CallResult =
1690 TLI.LowerCallTo(Tmp1, Type::VoidTy, false, CallingConv::C, false,
1691 DAG.getExternalSymbol(FnName, IntPtr), Args, DAG);
1692 Result = CallResult.second;
1699 case ISD::SHL_PARTS:
1700 case ISD::SRA_PARTS:
1701 case ISD::SRL_PARTS: {
1702 std::vector<SDOperand> Ops;
1703 bool Changed = false;
1704 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
1705 Ops.push_back(LegalizeOp(Node->getOperand(i)));
1706 Changed |= Ops.back() != Node->getOperand(i);
1709 Result = DAG.UpdateNodeOperands(Result, Ops);
1711 switch (TLI.getOperationAction(Node->getOpcode(),
1712 Node->getValueType(0))) {
1713 default: assert(0 && "This action is not supported yet!");
1714 case TargetLowering::Legal: break;
1715 case TargetLowering::Custom:
1716 Tmp1 = TLI.LowerOperation(Result, DAG);
1718 SDOperand Tmp2, RetVal(0, 0);
1719 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
1720 Tmp2 = LegalizeOp(Tmp1.getValue(i));
1721 AddLegalizedOperand(SDOperand(Node, i), Tmp2);
1725 assert(RetVal.Val && "Illegal result number");
1731 // Since these produce multiple values, make sure to remember that we
1732 // legalized all of them.
1733 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
1734 AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i));
1735 return Result.getValue(Op.ResNo);
1756 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
1757 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1758 case Expand: assert(0 && "Not possible");
1760 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
1763 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
1767 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1769 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
1770 default: assert(0 && "Operation not supported");
1771 case TargetLowering::Legal: break;
1772 case TargetLowering::Custom:
1773 Tmp1 = TLI.LowerOperation(Result, DAG);
1774 if (Tmp1.Val) Result = Tmp1;
1781 Tmp1 = LegalizeOp(Node->getOperand(0));
1782 Tmp2 = LegalizeOp(Node->getOperand(1));
1783 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1784 // Since this produces two values, make sure to remember that we legalized
1786 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1787 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1793 Tmp1 = LegalizeOp(Node->getOperand(0));
1794 Tmp2 = LegalizeOp(Node->getOperand(1));
1795 Tmp3 = LegalizeOp(Node->getOperand(2));
1796 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
1797 // Since this produces two values, make sure to remember that we legalized
1799 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1800 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1804 case ISD::BUILD_PAIR: {
1805 MVT::ValueType PairTy = Node->getValueType(0);
1806 // TODO: handle the case where the Lo and Hi operands are not of legal type
1807 Tmp1 = LegalizeOp(Node->getOperand(0)); // Lo
1808 Tmp2 = LegalizeOp(Node->getOperand(1)); // Hi
1809 switch (TLI.getOperationAction(ISD::BUILD_PAIR, PairTy)) {
1810 case TargetLowering::Promote:
1811 case TargetLowering::Custom:
1812 assert(0 && "Cannot promote/custom this yet!");
1813 case TargetLowering::Legal:
1814 if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1))
1815 Result = DAG.getNode(ISD::BUILD_PAIR, PairTy, Tmp1, Tmp2);
1817 case TargetLowering::Expand:
1818 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, PairTy, Tmp1);
1819 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, PairTy, Tmp2);
1820 Tmp2 = DAG.getNode(ISD::SHL, PairTy, Tmp2,
1821 DAG.getConstant(MVT::getSizeInBits(PairTy)/2,
1822 TLI.getShiftAmountTy()));
1823 Result = DAG.getNode(ISD::OR, PairTy, Tmp1, Tmp2);
1832 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
1833 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
1835 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
1836 case TargetLowering::Promote: assert(0 && "Cannot promote this yet!");
1837 case TargetLowering::Custom:
1840 case TargetLowering::Legal:
1841 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1843 Tmp1 = TLI.LowerOperation(Result, DAG);
1844 if (Tmp1.Val) Result = Tmp1;
1847 case TargetLowering::Expand:
1848 if (MVT::isInteger(Node->getValueType(0))) {
1850 MVT::ValueType VT = Node->getValueType(0);
1851 unsigned Opc = Node->getOpcode() == ISD::UREM ? ISD::UDIV : ISD::SDIV;
1852 Result = DAG.getNode(Opc, VT, Tmp1, Tmp2);
1853 Result = DAG.getNode(ISD::MUL, VT, Result, Tmp2);
1854 Result = DAG.getNode(ISD::SUB, VT, Tmp1, Result);
1856 // Floating point mod -> fmod libcall.
1857 const char *FnName = Node->getValueType(0) == MVT::f32 ? "fmodf":"fmod";
1859 Result = ExpandLibCall(FnName, Node, Dummy);
1865 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1866 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1868 MVT::ValueType VT = Node->getValueType(0);
1869 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
1870 default: assert(0 && "This action is not supported yet!");
1871 case TargetLowering::Custom:
1874 case TargetLowering::Legal:
1875 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1876 Result = Result.getValue(0);
1877 Tmp1 = Result.getValue(1);
1880 Tmp2 = TLI.LowerOperation(Result, DAG);
1882 Result = LegalizeOp(Tmp2);
1883 Tmp1 = LegalizeOp(Tmp2.getValue(1));
1887 case TargetLowering::Expand: {
1888 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
1889 Node->getOperand(2));
1890 // Increment the pointer, VAList, to the next vaarg
1891 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
1892 DAG.getConstant(MVT::getSizeInBits(VT)/8,
1893 TLI.getPointerTy()));
1894 // Store the incremented VAList to the legalized pointer
1895 Tmp3 = DAG.getNode(ISD::STORE, MVT::Other, VAList.getValue(1), Tmp3, Tmp2,
1896 Node->getOperand(2));
1897 // Load the actual argument out of the pointer VAList
1898 Result = DAG.getLoad(VT, Tmp3, VAList, DAG.getSrcValue(0));
1899 Tmp1 = LegalizeOp(Result.getValue(1));
1900 Result = LegalizeOp(Result);
1904 // Since VAARG produces two values, make sure to remember that we
1905 // legalized both of them.
1906 AddLegalizedOperand(SDOperand(Node, 0), Result);
1907 AddLegalizedOperand(SDOperand(Node, 1), Tmp1);
1908 return Op.ResNo ? Tmp1 : Result;
1912 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1913 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the dest pointer.
1914 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the source pointer.
1916 switch (TLI.getOperationAction(ISD::VACOPY, MVT::Other)) {
1917 default: assert(0 && "This action is not supported yet!");
1918 case TargetLowering::Custom:
1921 case TargetLowering::Legal:
1922 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
1923 Node->getOperand(3), Node->getOperand(4));
1925 Tmp1 = TLI.LowerOperation(Result, DAG);
1926 if (Tmp1.Val) Result = Tmp1;
1929 case TargetLowering::Expand:
1930 // This defaults to loading a pointer from the input and storing it to the
1931 // output, returning the chain.
1932 Tmp4 = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp3, Node->getOperand(3));
1933 Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp4.getValue(1), Tmp4, Tmp2,
1934 Node->getOperand(4));
1940 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1941 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1943 switch (TLI.getOperationAction(ISD::VAEND, MVT::Other)) {
1944 default: assert(0 && "This action is not supported yet!");
1945 case TargetLowering::Custom:
1948 case TargetLowering::Legal:
1949 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1951 Tmp1 = TLI.LowerOperation(Tmp1, DAG);
1952 if (Tmp1.Val) Result = Tmp1;
1955 case TargetLowering::Expand:
1956 Result = Tmp1; // Default to a no-op, return the chain
1962 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1963 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
1965 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
1967 switch (TLI.getOperationAction(ISD::VASTART, MVT::Other)) {
1968 default: assert(0 && "This action is not supported yet!");
1969 case TargetLowering::Legal: break;
1970 case TargetLowering::Custom:
1971 Tmp1 = TLI.LowerOperation(Result, DAG);
1972 if (Tmp1.Val) Result = Tmp1;
1979 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
1980 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
1982 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
1983 "Cannot handle this yet!");
1984 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1988 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
1989 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
1990 case TargetLowering::Custom:
1991 assert(0 && "Cannot custom legalize this yet!");
1992 case TargetLowering::Legal:
1993 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1995 case TargetLowering::Promote: {
1996 MVT::ValueType OVT = Tmp1.getValueType();
1997 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
1998 unsigned DiffBits = getSizeInBits(NVT) - getSizeInBits(OVT);
2000 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2001 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
2002 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
2003 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
2006 case TargetLowering::Expand:
2007 Result = ExpandBSWAP(Tmp1);
2015 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
2016 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2017 case TargetLowering::Custom: assert(0 && "Cannot custom handle this yet!");
2018 case TargetLowering::Legal:
2019 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2021 case TargetLowering::Promote: {
2022 MVT::ValueType OVT = Tmp1.getValueType();
2023 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2025 // Zero extend the argument.
2026 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2027 // Perform the larger operation, then subtract if needed.
2028 Tmp1 = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1);
2029 switch (Node->getOpcode()) {
2034 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
2035 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
2036 DAG.getConstant(getSizeInBits(NVT), NVT),
2038 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
2039 DAG.getConstant(getSizeInBits(OVT),NVT), Tmp1);
2042 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
2043 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
2044 DAG.getConstant(getSizeInBits(NVT) -
2045 getSizeInBits(OVT), NVT));
2050 case TargetLowering::Expand:
2051 Result = ExpandBitCount(Node->getOpcode(), Tmp1);
2062 Tmp1 = LegalizeOp(Node->getOperand(0));
2063 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2064 case TargetLowering::Promote:
2065 case TargetLowering::Custom:
2068 case TargetLowering::Legal:
2069 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2071 Tmp1 = TLI.LowerOperation(Result, DAG);
2072 if (Tmp1.Val) Result = Tmp1;
2075 case TargetLowering::Expand:
2076 switch (Node->getOpcode()) {
2077 default: assert(0 && "Unreachable!");
2079 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
2080 Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0));
2081 Result = DAG.getNode(ISD::FSUB, Node->getValueType(0), Tmp2, Tmp1);
2084 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
2085 MVT::ValueType VT = Node->getValueType(0);
2086 Tmp2 = DAG.getConstantFP(0.0, VT);
2087 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, Tmp2, ISD::SETUGT);
2088 Tmp3 = DAG.getNode(ISD::FNEG, VT, Tmp1);
2089 Result = DAG.getNode(ISD::SELECT, VT, Tmp2, Tmp1, Tmp3);
2095 MVT::ValueType VT = Node->getValueType(0);
2096 const char *FnName = 0;
2097 switch(Node->getOpcode()) {
2098 case ISD::FSQRT: FnName = VT == MVT::f32 ? "sqrtf" : "sqrt"; break;
2099 case ISD::FSIN: FnName = VT == MVT::f32 ? "sinf" : "sin"; break;
2100 case ISD::FCOS: FnName = VT == MVT::f32 ? "cosf" : "cos"; break;
2101 default: assert(0 && "Unreachable!");
2104 Result = ExpandLibCall(FnName, Node, Dummy);
2112 case ISD::BIT_CONVERT:
2113 if (!isTypeLegal(Node->getOperand(0).getValueType())) {
2114 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2116 switch (TLI.getOperationAction(ISD::BIT_CONVERT,
2117 Node->getOperand(0).getValueType())) {
2118 default: assert(0 && "Unknown operation action!");
2119 case TargetLowering::Expand:
2120 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2122 case TargetLowering::Legal:
2123 Tmp1 = LegalizeOp(Node->getOperand(0));
2124 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2129 // Conversion operators. The source and destination have different types.
2130 case ISD::SINT_TO_FP:
2131 case ISD::UINT_TO_FP: {
2132 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
2133 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2135 switch (TLI.getOperationAction(Node->getOpcode(),
2136 Node->getOperand(0).getValueType())) {
2137 default: assert(0 && "Unknown operation action!");
2138 case TargetLowering::Custom:
2141 case TargetLowering::Legal:
2142 Tmp1 = LegalizeOp(Node->getOperand(0));
2143 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2145 Tmp1 = TLI.LowerOperation(Result, DAG);
2146 if (Tmp1.Val) Result = Tmp1;
2149 case TargetLowering::Expand:
2150 Result = ExpandLegalINT_TO_FP(isSigned,
2151 LegalizeOp(Node->getOperand(0)),
2152 Node->getValueType(0));
2154 case TargetLowering::Promote:
2155 Result = PromoteLegalINT_TO_FP(LegalizeOp(Node->getOperand(0)),
2156 Node->getValueType(0),
2162 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP,
2163 Node->getValueType(0), Node->getOperand(0));
2166 Tmp1 = PromoteOp(Node->getOperand(0));
2168 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp1.getValueType(),
2169 Tmp1, DAG.getValueType(Node->getOperand(0).getValueType()));
2171 Tmp1 = DAG.getZeroExtendInReg(Tmp1,
2172 Node->getOperand(0).getValueType());
2174 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2175 Result = LegalizeOp(Result); // The 'op' is not necessarily legal!
2181 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2183 Tmp1 = LegalizeOp(Node->getOperand(0));
2184 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2187 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2189 // Since the result is legal, we should just be able to truncate the low
2190 // part of the source.
2191 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1);
2194 Result = PromoteOp(Node->getOperand(0));
2195 Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result);
2200 case ISD::FP_TO_SINT:
2201 case ISD::FP_TO_UINT:
2202 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2204 Tmp1 = LegalizeOp(Node->getOperand(0));
2206 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))){
2207 default: assert(0 && "Unknown operation action!");
2208 case TargetLowering::Custom:
2211 case TargetLowering::Legal:
2212 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2214 Tmp1 = TLI.LowerOperation(Result, DAG);
2215 if (Tmp1.Val) Result = Tmp1;
2218 case TargetLowering::Promote:
2219 Result = PromoteLegalFP_TO_INT(Tmp1, Node->getValueType(0),
2220 Node->getOpcode() == ISD::FP_TO_SINT);
2222 case TargetLowering::Expand:
2223 if (Node->getOpcode() == ISD::FP_TO_UINT) {
2224 SDOperand True, False;
2225 MVT::ValueType VT = Node->getOperand(0).getValueType();
2226 MVT::ValueType NVT = Node->getValueType(0);
2227 unsigned ShiftAmt = MVT::getSizeInBits(Node->getValueType(0))-1;
2228 Tmp2 = DAG.getConstantFP((double)(1ULL << ShiftAmt), VT);
2229 Tmp3 = DAG.getSetCC(TLI.getSetCCResultTy(),
2230 Node->getOperand(0), Tmp2, ISD::SETLT);
2231 True = DAG.getNode(ISD::FP_TO_SINT, NVT, Node->getOperand(0));
2232 False = DAG.getNode(ISD::FP_TO_SINT, NVT,
2233 DAG.getNode(ISD::FSUB, VT, Node->getOperand(0),
2235 False = DAG.getNode(ISD::XOR, NVT, False,
2236 DAG.getConstant(1ULL << ShiftAmt, NVT));
2237 Result = DAG.getNode(ISD::SELECT, NVT, Tmp3, True, False);
2240 assert(0 && "Do not know how to expand FP_TO_SINT yet!");
2246 assert(0 && "Shouldn't need to expand other operators here!");
2248 Tmp1 = PromoteOp(Node->getOperand(0));
2249 Result = DAG.UpdateNodeOperands(Result, LegalizeOp(Tmp1));
2250 Result = LegalizeOp(Result);
2255 case ISD::ANY_EXTEND:
2256 case ISD::ZERO_EXTEND:
2257 case ISD::SIGN_EXTEND:
2258 case ISD::FP_EXTEND:
2260 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2261 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
2263 Tmp1 = LegalizeOp(Node->getOperand(0));
2264 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2267 switch (Node->getOpcode()) {
2268 case ISD::ANY_EXTEND:
2269 Tmp1 = PromoteOp(Node->getOperand(0));
2270 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Tmp1);
2272 case ISD::ZERO_EXTEND:
2273 Result = PromoteOp(Node->getOperand(0));
2274 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
2275 Result = DAG.getZeroExtendInReg(Result,
2276 Node->getOperand(0).getValueType());
2278 case ISD::SIGN_EXTEND:
2279 Result = PromoteOp(Node->getOperand(0));
2280 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
2281 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
2283 DAG.getValueType(Node->getOperand(0).getValueType()));
2285 case ISD::FP_EXTEND:
2286 Result = PromoteOp(Node->getOperand(0));
2287 if (Result.getValueType() != Op.getValueType())
2288 // Dynamically dead while we have only 2 FP types.
2289 Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result);
2292 Result = PromoteOp(Node->getOperand(0));
2293 Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result);
2298 case ISD::FP_ROUND_INREG:
2299 case ISD::SIGN_EXTEND_INREG: {
2300 Tmp1 = LegalizeOp(Node->getOperand(0));
2301 MVT::ValueType ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
2303 // If this operation is not supported, convert it to a shl/shr or load/store
2305 switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) {
2306 default: assert(0 && "This action not supported for this op yet!");
2307 case TargetLowering::Legal:
2308 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
2310 case TargetLowering::Expand:
2311 // If this is an integer extend and shifts are supported, do that.
2312 if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) {
2313 // NOTE: we could fall back on load/store here too for targets without
2314 // SAR. However, it is doubtful that any exist.
2315 unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) -
2316 MVT::getSizeInBits(ExtraVT);
2317 SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy());
2318 Result = DAG.getNode(ISD::SHL, Node->getValueType(0),
2319 Node->getOperand(0), ShiftCst);
2320 Result = DAG.getNode(ISD::SRA, Node->getValueType(0),
2322 } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) {
2323 // The only way we can lower this is to turn it into a STORETRUNC,
2324 // EXTLOAD pair, targetting a temporary location (a stack slot).
2326 // NOTE: there is a choice here between constantly creating new stack
2327 // slots and always reusing the same one. We currently always create
2328 // new ones, as reuse may inhibit scheduling.
2329 const Type *Ty = MVT::getTypeForValueType(ExtraVT);
2330 unsigned TySize = (unsigned)TLI.getTargetData().getTypeSize(Ty);
2331 unsigned Align = TLI.getTargetData().getTypeAlignment(Ty);
2332 MachineFunction &MF = DAG.getMachineFunction();
2334 MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align);
2335 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
2336 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, DAG.getEntryNode(),
2337 Node->getOperand(0), StackSlot,
2338 DAG.getSrcValue(NULL), DAG.getValueType(ExtraVT));
2339 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
2340 Result, StackSlot, DAG.getSrcValue(NULL),
2343 assert(0 && "Unknown op");
2351 // Make sure that the generated code is itself legal.
2353 Result = LegalizeOp(Result);
2355 // Note that LegalizeOp may be reentered even from single-use nodes, which
2356 // means that we always must cache transformed nodes.
2357 AddLegalizedOperand(Op, Result);
2361 /// PromoteOp - Given an operation that produces a value in an invalid type,
2362 /// promote it to compute the value into a larger type. The produced value will
2363 /// have the correct bits for the low portion of the register, but no guarantee
2364 /// is made about the top bits: it may be zero, sign-extended, or garbage.
2365 SDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) {
2366 MVT::ValueType VT = Op.getValueType();
2367 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
2368 assert(getTypeAction(VT) == Promote &&
2369 "Caller should expand or legalize operands that are not promotable!");
2370 assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) &&
2371 "Cannot promote to smaller type!");
2373 SDOperand Tmp1, Tmp2, Tmp3;
2375 SDNode *Node = Op.Val;
2377 std::map<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op);
2378 if (I != PromotedNodes.end()) return I->second;
2380 switch (Node->getOpcode()) {
2381 case ISD::CopyFromReg:
2382 assert(0 && "CopyFromReg must be legal!");
2384 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
2385 assert(0 && "Do not know how to promote this operator!");
2388 Result = DAG.getNode(ISD::UNDEF, NVT);
2392 Result = DAG.getNode(ISD::SIGN_EXTEND, NVT, Op);
2394 Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op);
2395 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?");
2397 case ISD::ConstantFP:
2398 Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op);
2399 assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?");
2403 assert(isTypeLegal(TLI.getSetCCResultTy()) && "SetCC type is not legal??");
2404 Result = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(),Node->getOperand(0),
2405 Node->getOperand(1), Node->getOperand(2));
2409 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2411 Result = LegalizeOp(Node->getOperand(0));
2412 assert(Result.getValueType() >= NVT &&
2413 "This truncation doesn't make sense!");
2414 if (Result.getValueType() > NVT) // Truncate to NVT instead of VT
2415 Result = DAG.getNode(ISD::TRUNCATE, NVT, Result);
2418 // The truncation is not required, because we don't guarantee anything
2419 // about high bits anyway.
2420 Result = PromoteOp(Node->getOperand(0));
2423 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2424 // Truncate the low part of the expanded value to the result type
2425 Result = DAG.getNode(ISD::TRUNCATE, NVT, Tmp1);
2428 case ISD::SIGN_EXTEND:
2429 case ISD::ZERO_EXTEND:
2430 case ISD::ANY_EXTEND:
2431 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2432 case Expand: assert(0 && "BUG: Smaller reg should have been promoted!");
2434 // Input is legal? Just do extend all the way to the larger type.
2435 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
2438 // Promote the reg if it's smaller.
2439 Result = PromoteOp(Node->getOperand(0));
2440 // The high bits are not guaranteed to be anything. Insert an extend.
2441 if (Node->getOpcode() == ISD::SIGN_EXTEND)
2442 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
2443 DAG.getValueType(Node->getOperand(0).getValueType()));
2444 else if (Node->getOpcode() == ISD::ZERO_EXTEND)
2445 Result = DAG.getZeroExtendInReg(Result,
2446 Node->getOperand(0).getValueType());
2450 case ISD::BIT_CONVERT:
2451 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2452 Result = PromoteOp(Result);
2455 case ISD::FP_EXTEND:
2456 assert(0 && "Case not implemented. Dynamically dead with 2 FP types!");
2458 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2459 case Expand: assert(0 && "BUG: Cannot expand FP regs!");
2460 case Promote: assert(0 && "Unreachable with 2 FP types!");
2462 // Input is legal? Do an FP_ROUND_INREG.
2463 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Node->getOperand(0),
2464 DAG.getValueType(VT));
2469 case ISD::SINT_TO_FP:
2470 case ISD::UINT_TO_FP:
2471 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2473 // No extra round required here.
2474 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
2478 Result = PromoteOp(Node->getOperand(0));
2479 if (Node->getOpcode() == ISD::SINT_TO_FP)
2480 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
2482 DAG.getValueType(Node->getOperand(0).getValueType()));
2484 Result = DAG.getZeroExtendInReg(Result,
2485 Node->getOperand(0).getValueType());
2486 // No extra round required here.
2487 Result = DAG.getNode(Node->getOpcode(), NVT, Result);
2490 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT,
2491 Node->getOperand(0));
2492 // Round if we cannot tolerate excess precision.
2493 if (NoExcessFPPrecision)
2494 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
2495 DAG.getValueType(VT));
2500 case ISD::SIGN_EXTEND_INREG:
2501 Result = PromoteOp(Node->getOperand(0));
2502 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
2503 Node->getOperand(1));
2505 case ISD::FP_TO_SINT:
2506 case ISD::FP_TO_UINT:
2507 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2509 Tmp1 = Node->getOperand(0);
2512 // The input result is prerounded, so we don't have to do anything
2514 Tmp1 = PromoteOp(Node->getOperand(0));
2517 assert(0 && "not implemented");
2519 // If we're promoting a UINT to a larger size, check to see if the new node
2520 // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since
2521 // we can use that instead. This allows us to generate better code for
2522 // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not
2523 // legal, such as PowerPC.
2524 if (Node->getOpcode() == ISD::FP_TO_UINT &&
2525 !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) &&
2526 (TLI.isOperationLegal(ISD::FP_TO_SINT, NVT) ||
2527 TLI.getOperationAction(ISD::FP_TO_SINT, NVT)==TargetLowering::Custom)){
2528 Result = DAG.getNode(ISD::FP_TO_SINT, NVT, Tmp1);
2530 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
2536 Tmp1 = PromoteOp(Node->getOperand(0));
2537 assert(Tmp1.getValueType() == NVT);
2538 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
2539 // NOTE: we do not have to do any extra rounding here for
2540 // NoExcessFPPrecision, because we know the input will have the appropriate
2541 // precision, and these operations don't modify precision at all.
2547 Tmp1 = PromoteOp(Node->getOperand(0));
2548 assert(Tmp1.getValueType() == NVT);
2549 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
2550 if (NoExcessFPPrecision)
2551 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
2552 DAG.getValueType(VT));
2561 // The input may have strange things in the top bits of the registers, but
2562 // these operations don't care. They may have weird bits going out, but
2563 // that too is okay if they are integer operations.
2564 Tmp1 = PromoteOp(Node->getOperand(0));
2565 Tmp2 = PromoteOp(Node->getOperand(1));
2566 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
2567 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2572 Tmp1 = PromoteOp(Node->getOperand(0));
2573 Tmp2 = PromoteOp(Node->getOperand(1));
2574 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
2575 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2577 // Floating point operations will give excess precision that we may not be
2578 // able to tolerate. If we DO allow excess precision, just leave it,
2579 // otherwise excise it.
2580 // FIXME: Why would we need to round FP ops more than integer ones?
2581 // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C))
2582 if (NoExcessFPPrecision)
2583 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
2584 DAG.getValueType(VT));
2589 // These operators require that their input be sign extended.
2590 Tmp1 = PromoteOp(Node->getOperand(0));
2591 Tmp2 = PromoteOp(Node->getOperand(1));
2592 if (MVT::isInteger(NVT)) {
2593 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
2594 DAG.getValueType(VT));
2595 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
2596 DAG.getValueType(VT));
2598 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2600 // Perform FP_ROUND: this is probably overly pessimistic.
2601 if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision)
2602 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
2603 DAG.getValueType(VT));
2607 // These operators require that their input be fp extended.
2608 Tmp1 = PromoteOp(Node->getOperand(0));
2609 Tmp2 = PromoteOp(Node->getOperand(1));
2610 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2612 // Perform FP_ROUND: this is probably overly pessimistic.
2613 if (NoExcessFPPrecision)
2614 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
2615 DAG.getValueType(VT));
2620 // These operators require that their input be zero extended.
2621 Tmp1 = PromoteOp(Node->getOperand(0));
2622 Tmp2 = PromoteOp(Node->getOperand(1));
2623 assert(MVT::isInteger(NVT) && "Operators don't apply to FP!");
2624 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
2625 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
2626 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2630 Tmp1 = PromoteOp(Node->getOperand(0));
2631 Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Node->getOperand(1));
2634 // The input value must be properly sign extended.
2635 Tmp1 = PromoteOp(Node->getOperand(0));
2636 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
2637 DAG.getValueType(VT));
2638 Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Node->getOperand(1));
2641 // The input value must be properly zero extended.
2642 Tmp1 = PromoteOp(Node->getOperand(0));
2643 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
2644 Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Node->getOperand(1));
2648 Tmp1 = Node->getOperand(0); // Get the chain.
2649 Tmp2 = Node->getOperand(1); // Get the pointer.
2650 if (TLI.getOperationAction(ISD::VAARG, VT) == TargetLowering::Custom) {
2651 Tmp3 = DAG.getVAArg(VT, Tmp1, Tmp2, Node->getOperand(2));
2652 Result = TLI.CustomPromoteOperation(Tmp3, DAG);
2654 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
2655 Node->getOperand(2));
2656 // Increment the pointer, VAList, to the next vaarg
2657 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
2658 DAG.getConstant(MVT::getSizeInBits(VT)/8,
2659 TLI.getPointerTy()));
2660 // Store the incremented VAList to the legalized pointer
2661 Tmp3 = DAG.getNode(ISD::STORE, MVT::Other, VAList.getValue(1), Tmp3, Tmp2,
2662 Node->getOperand(2));
2663 // Load the actual argument out of the pointer VAList
2664 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Tmp3, VAList,
2665 DAG.getSrcValue(0), VT);
2667 // Remember that we legalized the chain.
2668 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
2672 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Node->getOperand(0),
2673 Node->getOperand(1), Node->getOperand(2), VT);
2674 // Remember that we legalized the chain.
2675 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
2680 Result = DAG.getExtLoad(Node->getOpcode(), NVT, Node->getOperand(0),
2681 Node->getOperand(1), Node->getOperand(2),
2682 cast<VTSDNode>(Node->getOperand(3))->getVT());
2683 // Remember that we legalized the chain.
2684 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
2687 Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0
2688 Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1
2689 Result = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), Tmp2, Tmp3);
2691 case ISD::SELECT_CC:
2692 Tmp2 = PromoteOp(Node->getOperand(2)); // True
2693 Tmp3 = PromoteOp(Node->getOperand(3)); // False
2694 Result = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
2695 Node->getOperand(1), Tmp2, Tmp3, Node->getOperand(4));
2698 Tmp1 = Node->getOperand(0);
2699 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2700 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
2701 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
2702 DAG.getConstant(getSizeInBits(NVT) - getSizeInBits(VT),
2703 TLI.getShiftAmountTy()));
2708 // Zero extend the argument
2709 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
2710 // Perform the larger operation, then subtract if needed.
2711 Tmp1 = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
2712 switch(Node->getOpcode()) {
2717 // if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
2718 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
2719 DAG.getConstant(getSizeInBits(NVT), NVT), ISD::SETEQ);
2720 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
2721 DAG.getConstant(getSizeInBits(VT), NVT), Tmp1);
2724 //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
2725 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
2726 DAG.getConstant(getSizeInBits(NVT) -
2727 getSizeInBits(VT), NVT));
2733 assert(Result.Val && "Didn't set a result!");
2735 // Make sure the result is itself legal.
2736 Result = LegalizeOp(Result);
2738 // Remember that we promoted this!
2739 AddPromotedOperand(Op, Result);
2743 /// LegalizeSetCCOperands - Attempts to create a legal LHS and RHS for a SETCC
2744 /// with condition CC on the current target. This usually involves legalizing
2745 /// or promoting the arguments. In the case where LHS and RHS must be expanded,
2746 /// there may be no choice but to create a new SetCC node to represent the
2747 /// legalized value of setcc lhs, rhs. In this case, the value is returned in
2748 /// LHS, and the SDOperand returned in RHS has a nil SDNode value.
2749 void SelectionDAGLegalize::LegalizeSetCCOperands(SDOperand &LHS,
2752 SDOperand Tmp1, Tmp2, Result;
2754 switch (getTypeAction(LHS.getValueType())) {
2756 Tmp1 = LegalizeOp(LHS); // LHS
2757 Tmp2 = LegalizeOp(RHS); // RHS
2760 Tmp1 = PromoteOp(LHS); // LHS
2761 Tmp2 = PromoteOp(RHS); // RHS
2763 // If this is an FP compare, the operands have already been extended.
2764 if (MVT::isInteger(LHS.getValueType())) {
2765 MVT::ValueType VT = LHS.getValueType();
2766 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
2768 // Otherwise, we have to insert explicit sign or zero extends. Note
2769 // that we could insert sign extends for ALL conditions, but zero extend
2770 // is cheaper on many machines (an AND instead of two shifts), so prefer
2772 switch (cast<CondCodeSDNode>(CC)->get()) {
2773 default: assert(0 && "Unknown integer comparison!");
2780 // ALL of these operations will work if we either sign or zero extend
2781 // the operands (including the unsigned comparisons!). Zero extend is
2782 // usually a simpler/cheaper operation, so prefer it.
2783 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
2784 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
2790 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
2791 DAG.getValueType(VT));
2792 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
2793 DAG.getValueType(VT));
2799 SDOperand LHSLo, LHSHi, RHSLo, RHSHi;
2800 ExpandOp(LHS, LHSLo, LHSHi);
2801 ExpandOp(RHS, RHSLo, RHSHi);
2802 switch (cast<CondCodeSDNode>(CC)->get()) {
2806 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo))
2807 if (RHSCST->isAllOnesValue()) {
2808 // Comparison to -1.
2809 Tmp1 = DAG.getNode(ISD::AND, LHSLo.getValueType(), LHSLo, LHSHi);
2814 Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo);
2815 Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi);
2816 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2);
2817 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
2820 // If this is a comparison of the sign bit, just look at the top part.
2822 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(RHS))
2823 if ((cast<CondCodeSDNode>(CC)->get() == ISD::SETLT &&
2824 CST->getValue() == 0) || // X < 0
2825 (cast<CondCodeSDNode>(CC)->get() == ISD::SETGT &&
2826 CST->isAllOnesValue())) { // X > -1
2832 // FIXME: This generated code sucks.
2833 ISD::CondCode LowCC;
2834 switch (cast<CondCodeSDNode>(CC)->get()) {
2835 default: assert(0 && "Unknown integer setcc!");
2837 case ISD::SETULT: LowCC = ISD::SETULT; break;
2839 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
2841 case ISD::SETULE: LowCC = ISD::SETULE; break;
2843 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
2846 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
2847 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
2848 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
2850 // NOTE: on targets without efficient SELECT of bools, we can always use
2851 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
2852 Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC);
2853 Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHSHi, RHSHi, CC);
2854 Result = DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETEQ);
2855 Result = LegalizeOp(DAG.getNode(ISD::SELECT, Tmp1.getValueType(),
2856 Result, Tmp1, Tmp2));
2865 /// ExpandBIT_CONVERT - Expand a BIT_CONVERT node into a store/load combination.
2866 /// The resultant code need not be legal. Note that SrcOp is the input operand
2867 /// to the BIT_CONVERT, not the BIT_CONVERT node itself.
2868 SDOperand SelectionDAGLegalize::ExpandBIT_CONVERT(MVT::ValueType DestVT,
2870 // Create the stack frame object.
2871 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
2872 unsigned ByteSize = MVT::getSizeInBits(DestVT)/8;
2873 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, ByteSize);
2874 SDOperand FIPtr = DAG.getFrameIndex(FrameIdx, TLI.getPointerTy());
2876 // Emit a store to the stack slot.
2877 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
2878 SrcOp, FIPtr, DAG.getSrcValue(NULL));
2879 // Result is a load from the stack slot.
2880 return DAG.getLoad(DestVT, Store, FIPtr, DAG.getSrcValue(0));
2883 void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp,
2884 SDOperand Op, SDOperand Amt,
2885 SDOperand &Lo, SDOperand &Hi) {
2886 // Expand the subcomponents.
2887 SDOperand LHSL, LHSH;
2888 ExpandOp(Op, LHSL, LHSH);
2890 std::vector<SDOperand> Ops;
2891 Ops.push_back(LHSL);
2892 Ops.push_back(LHSH);
2894 std::vector<MVT::ValueType> VTs(2, LHSL.getValueType());
2895 Lo = DAG.getNode(NodeOp, VTs, Ops);
2896 Hi = Lo.getValue(1);
2900 /// ExpandShift - Try to find a clever way to expand this shift operation out to
2901 /// smaller elements. If we can't find a way that is more efficient than a
2902 /// libcall on this target, return false. Otherwise, return true with the
2903 /// low-parts expanded into Lo and Hi.
2904 bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt,
2905 SDOperand &Lo, SDOperand &Hi) {
2906 assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) &&
2907 "This is not a shift!");
2909 MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType());
2910 SDOperand ShAmt = LegalizeOp(Amt);
2911 MVT::ValueType ShTy = ShAmt.getValueType();
2912 unsigned VTBits = MVT::getSizeInBits(Op.getValueType());
2913 unsigned NVTBits = MVT::getSizeInBits(NVT);
2915 // Handle the case when Amt is an immediate. Other cases are currently broken
2916 // and are disabled.
2917 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.Val)) {
2918 unsigned Cst = CN->getValue();
2919 // Expand the incoming operand to be shifted, so that we have its parts
2921 ExpandOp(Op, InL, InH);
2925 Lo = DAG.getConstant(0, NVT);
2926 Hi = DAG.getConstant(0, NVT);
2927 } else if (Cst > NVTBits) {
2928 Lo = DAG.getConstant(0, NVT);
2929 Hi = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst-NVTBits,ShTy));
2930 } else if (Cst == NVTBits) {
2931 Lo = DAG.getConstant(0, NVT);
2934 Lo = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst, ShTy));
2935 Hi = DAG.getNode(ISD::OR, NVT,
2936 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(Cst, ShTy)),
2937 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(NVTBits-Cst, ShTy)));
2942 Lo = DAG.getConstant(0, NVT);
2943 Hi = DAG.getConstant(0, NVT);
2944 } else if (Cst > NVTBits) {
2945 Lo = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst-NVTBits,ShTy));
2946 Hi = DAG.getConstant(0, NVT);
2947 } else if (Cst == NVTBits) {
2949 Hi = DAG.getConstant(0, NVT);
2951 Lo = DAG.getNode(ISD::OR, NVT,
2952 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
2953 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
2954 Hi = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst, ShTy));
2959 Hi = Lo = DAG.getNode(ISD::SRA, NVT, InH,
2960 DAG.getConstant(NVTBits-1, ShTy));
2961 } else if (Cst > NVTBits) {
2962 Lo = DAG.getNode(ISD::SRA, NVT, InH,
2963 DAG.getConstant(Cst-NVTBits, ShTy));
2964 Hi = DAG.getNode(ISD::SRA, NVT, InH,
2965 DAG.getConstant(NVTBits-1, ShTy));
2966 } else if (Cst == NVTBits) {
2968 Hi = DAG.getNode(ISD::SRA, NVT, InH,
2969 DAG.getConstant(NVTBits-1, ShTy));
2971 Lo = DAG.getNode(ISD::OR, NVT,
2972 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
2973 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
2974 Hi = DAG.getNode(ISD::SRA, NVT, InH, DAG.getConstant(Cst, ShTy));
2983 // ExpandLibCall - Expand a node into a call to a libcall. If the result value
2984 // does not fit into a register, return the lo part and set the hi part to the
2985 // by-reg argument. If it does fit into a single register, return the result
2986 // and leave the Hi part unset.
2987 SDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node,
2989 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
2990 // The input chain to this libcall is the entry node of the function.
2991 // Legalizing the call will automatically add the previous call to the
2993 SDOperand InChain = DAG.getEntryNode();
2995 TargetLowering::ArgListTy Args;
2996 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
2997 MVT::ValueType ArgVT = Node->getOperand(i).getValueType();
2998 const Type *ArgTy = MVT::getTypeForValueType(ArgVT);
2999 Args.push_back(std::make_pair(Node->getOperand(i), ArgTy));
3001 SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy());
3003 // Splice the libcall in wherever FindInputOutputChains tells us to.
3004 const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0));
3005 std::pair<SDOperand,SDOperand> CallInfo =
3006 TLI.LowerCallTo(InChain, RetTy, false, CallingConv::C, false,
3009 // Legalize the call sequence, starting with the chain. This will advance
3010 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
3011 // was added by LowerCallTo (guaranteeing proper serialization of calls).
3012 LegalizeOp(CallInfo.second);
3014 switch (getTypeAction(CallInfo.first.getValueType())) {
3015 default: assert(0 && "Unknown thing");
3017 Result = CallInfo.first;
3020 ExpandOp(CallInfo.first, Result, Hi);
3027 /// ExpandIntToFP - Expand a [US]INT_TO_FP operation, assuming that the
3028 /// destination type is legal.
3029 SDOperand SelectionDAGLegalize::
3030 ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) {
3031 assert(isTypeLegal(DestTy) && "Destination type is not legal!");
3032 assert(getTypeAction(Source.getValueType()) == Expand &&
3033 "This is not an expansion!");
3034 assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!");
3037 assert(Source.getValueType() == MVT::i64 &&
3038 "This only works for 64-bit -> FP");
3039 // The 64-bit value loaded will be incorrectly if the 'sign bit' of the
3040 // incoming integer is set. To handle this, we dynamically test to see if
3041 // it is set, and, if so, add a fudge factor.
3043 ExpandOp(Source, Lo, Hi);
3045 // If this is unsigned, and not supported, first perform the conversion to
3046 // signed, then adjust the result if the sign bit is set.
3047 SDOperand SignedConv = ExpandIntToFP(true, DestTy,
3048 DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), Lo, Hi));
3050 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Hi,
3051 DAG.getConstant(0, Hi.getValueType()),
3053 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
3054 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
3055 SignSet, Four, Zero);
3056 uint64_t FF = 0x5f800000ULL;
3057 if (TLI.isLittleEndian()) FF <<= 32;
3058 static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF);
3060 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
3061 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
3062 SDOperand FudgeInReg;
3063 if (DestTy == MVT::f32)
3064 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx,
3065 DAG.getSrcValue(NULL));
3067 assert(DestTy == MVT::f64 && "Unexpected conversion");
3068 FudgeInReg = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
3069 CPIdx, DAG.getSrcValue(NULL), MVT::f32);
3071 return DAG.getNode(ISD::FADD, DestTy, SignedConv, FudgeInReg);
3074 // Check to see if the target has a custom way to lower this. If so, use it.
3075 switch (TLI.getOperationAction(ISD::SINT_TO_FP, Source.getValueType())) {
3076 default: assert(0 && "This action not implemented for this operation!");
3077 case TargetLowering::Legal:
3078 case TargetLowering::Expand:
3079 break; // This case is handled below.
3080 case TargetLowering::Custom: {
3081 SDOperand NV = TLI.LowerOperation(DAG.getNode(ISD::SINT_TO_FP, DestTy,
3084 return LegalizeOp(NV);
3085 break; // The target decided this was legal after all
3089 // Expand the source, then glue it back together for the call. We must expand
3090 // the source in case it is shared (this pass of legalize must traverse it).
3091 SDOperand SrcLo, SrcHi;
3092 ExpandOp(Source, SrcLo, SrcHi);
3093 Source = DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), SrcLo, SrcHi);
3095 const char *FnName = 0;
3096 if (DestTy == MVT::f32)
3097 FnName = "__floatdisf";
3099 assert(DestTy == MVT::f64 && "Unknown fp value type!");
3100 FnName = "__floatdidf";
3103 Source = DAG.getNode(ISD::SINT_TO_FP, DestTy, Source);
3104 SDOperand UnusedHiPart;
3105 return ExpandLibCall(FnName, Source.Val, UnusedHiPart);
3108 /// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
3109 /// INT_TO_FP operation of the specified operand when the target requests that
3110 /// we expand it. At this point, we know that the result and operand types are
3111 /// legal for the target.
3112 SDOperand SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
3114 MVT::ValueType DestVT) {
3115 if (Op0.getValueType() == MVT::i32) {
3116 // simple 32-bit [signed|unsigned] integer to float/double expansion
3118 // get the stack frame index of a 8 byte buffer
3119 MachineFunction &MF = DAG.getMachineFunction();
3120 int SSFI = MF.getFrameInfo()->CreateStackObject(8, 8);
3121 // get address of 8 byte buffer
3122 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
3123 // word offset constant for Hi/Lo address computation
3124 SDOperand WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
3125 // set up Hi and Lo (into buffer) address based on endian
3127 if (TLI.isLittleEndian()) {
3128 Hi = DAG.getNode(ISD::ADD, TLI.getPointerTy(), StackSlot, WordOff);
3132 Lo = DAG.getNode(ISD::ADD, TLI.getPointerTy(), StackSlot, WordOff);
3134 // if signed map to unsigned space
3135 SDOperand Op0Mapped;
3137 // constant used to invert sign bit (signed to unsigned mapping)
3138 SDOperand SignBit = DAG.getConstant(0x80000000u, MVT::i32);
3139 Op0Mapped = DAG.getNode(ISD::XOR, MVT::i32, Op0, SignBit);
3143 // store the lo of the constructed double - based on integer input
3144 SDOperand Store1 = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3145 Op0Mapped, Lo, DAG.getSrcValue(NULL));
3146 // initial hi portion of constructed double
3147 SDOperand InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
3148 // store the hi of the constructed double - biased exponent
3149 SDOperand Store2 = DAG.getNode(ISD::STORE, MVT::Other, Store1,
3150 InitialHi, Hi, DAG.getSrcValue(NULL));
3151 // load the constructed double
3152 SDOperand Load = DAG.getLoad(MVT::f64, Store2, StackSlot,
3153 DAG.getSrcValue(NULL));
3154 // FP constant to bias correct the final result
3155 SDOperand Bias = DAG.getConstantFP(isSigned ?
3156 BitsToDouble(0x4330000080000000ULL)
3157 : BitsToDouble(0x4330000000000000ULL),
3159 // subtract the bias
3160 SDOperand Sub = DAG.getNode(ISD::FSUB, MVT::f64, Load, Bias);
3163 // handle final rounding
3164 if (DestVT == MVT::f64) {
3168 // if f32 then cast to f32
3169 Result = DAG.getNode(ISD::FP_ROUND, MVT::f32, Sub);
3173 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
3174 SDOperand Tmp1 = DAG.getNode(ISD::SINT_TO_FP, DestVT, Op0);
3176 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Op0,
3177 DAG.getConstant(0, Op0.getValueType()),
3179 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
3180 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
3181 SignSet, Four, Zero);
3183 // If the sign bit of the integer is set, the large number will be treated
3184 // as a negative number. To counteract this, the dynamic code adds an
3185 // offset depending on the data type.
3187 switch (Op0.getValueType()) {
3188 default: assert(0 && "Unsupported integer type!");
3189 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
3190 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
3191 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
3192 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
3194 if (TLI.isLittleEndian()) FF <<= 32;
3195 static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF);
3197 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
3198 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
3199 SDOperand FudgeInReg;
3200 if (DestVT == MVT::f32)
3201 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx,
3202 DAG.getSrcValue(NULL));
3204 assert(DestVT == MVT::f64 && "Unexpected conversion");
3205 FudgeInReg = LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, MVT::f64,
3206 DAG.getEntryNode(), CPIdx,
3207 DAG.getSrcValue(NULL), MVT::f32));
3210 return DAG.getNode(ISD::FADD, DestVT, Tmp1, FudgeInReg);
3213 /// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
3214 /// *INT_TO_FP operation of the specified operand when the target requests that
3215 /// we promote it. At this point, we know that the result and operand types are
3216 /// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
3217 /// operation that takes a larger input.
3218 SDOperand SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDOperand LegalOp,
3219 MVT::ValueType DestVT,
3221 // First step, figure out the appropriate *INT_TO_FP operation to use.
3222 MVT::ValueType NewInTy = LegalOp.getValueType();
3224 unsigned OpToUse = 0;
3226 // Scan for the appropriate larger type to use.
3228 NewInTy = (MVT::ValueType)(NewInTy+1);
3229 assert(MVT::isInteger(NewInTy) && "Ran out of possibilities!");
3231 // If the target supports SINT_TO_FP of this type, use it.
3232 switch (TLI.getOperationAction(ISD::SINT_TO_FP, NewInTy)) {
3234 case TargetLowering::Legal:
3235 if (!TLI.isTypeLegal(NewInTy))
3236 break; // Can't use this datatype.
3238 case TargetLowering::Custom:
3239 OpToUse = ISD::SINT_TO_FP;
3243 if (isSigned) continue;
3245 // If the target supports UINT_TO_FP of this type, use it.
3246 switch (TLI.getOperationAction(ISD::UINT_TO_FP, NewInTy)) {
3248 case TargetLowering::Legal:
3249 if (!TLI.isTypeLegal(NewInTy))
3250 break; // Can't use this datatype.
3252 case TargetLowering::Custom:
3253 OpToUse = ISD::UINT_TO_FP;
3258 // Otherwise, try a larger type.
3261 // Okay, we found the operation and type to use. Zero extend our input to the
3262 // desired type then run the operation on it.
3263 return DAG.getNode(OpToUse, DestVT,
3264 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
3268 /// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
3269 /// FP_TO_*INT operation of the specified operand when the target requests that
3270 /// we promote it. At this point, we know that the result and operand types are
3271 /// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
3272 /// operation that returns a larger result.
3273 SDOperand SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDOperand LegalOp,
3274 MVT::ValueType DestVT,
3276 // First step, figure out the appropriate FP_TO*INT operation to use.
3277 MVT::ValueType NewOutTy = DestVT;
3279 unsigned OpToUse = 0;
3281 // Scan for the appropriate larger type to use.
3283 NewOutTy = (MVT::ValueType)(NewOutTy+1);
3284 assert(MVT::isInteger(NewOutTy) && "Ran out of possibilities!");
3286 // If the target supports FP_TO_SINT returning this type, use it.
3287 switch (TLI.getOperationAction(ISD::FP_TO_SINT, NewOutTy)) {
3289 case TargetLowering::Legal:
3290 if (!TLI.isTypeLegal(NewOutTy))
3291 break; // Can't use this datatype.
3293 case TargetLowering::Custom:
3294 OpToUse = ISD::FP_TO_SINT;
3299 // If the target supports FP_TO_UINT of this type, use it.
3300 switch (TLI.getOperationAction(ISD::FP_TO_UINT, NewOutTy)) {
3302 case TargetLowering::Legal:
3303 if (!TLI.isTypeLegal(NewOutTy))
3304 break; // Can't use this datatype.
3306 case TargetLowering::Custom:
3307 OpToUse = ISD::FP_TO_UINT;
3312 // Otherwise, try a larger type.
3315 // Okay, we found the operation and type to use. Truncate the result of the
3316 // extended FP_TO_*INT operation to the desired size.
3317 return DAG.getNode(ISD::TRUNCATE, DestVT,
3318 DAG.getNode(OpToUse, NewOutTy, LegalOp));
3321 /// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
3323 SDOperand SelectionDAGLegalize::ExpandBSWAP(SDOperand Op) {
3324 MVT::ValueType VT = Op.getValueType();
3325 MVT::ValueType SHVT = TLI.getShiftAmountTy();
3326 SDOperand Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
3328 default: assert(0 && "Unhandled Expand type in BSWAP!"); abort();
3330 Tmp2 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
3331 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
3332 return DAG.getNode(ISD::OR, VT, Tmp1, Tmp2);
3334 Tmp4 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
3335 Tmp3 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
3336 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
3337 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
3338 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
3339 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(0xFF00, VT));
3340 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
3341 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
3342 return DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
3344 Tmp8 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(56, SHVT));
3345 Tmp7 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(40, SHVT));
3346 Tmp6 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
3347 Tmp5 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
3348 Tmp4 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
3349 Tmp3 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
3350 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(40, SHVT));
3351 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(56, SHVT));
3352 Tmp7 = DAG.getNode(ISD::AND, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
3353 Tmp6 = DAG.getNode(ISD::AND, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
3354 Tmp5 = DAG.getNode(ISD::AND, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
3355 Tmp4 = DAG.getNode(ISD::AND, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
3356 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
3357 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
3358 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp7);
3359 Tmp6 = DAG.getNode(ISD::OR, VT, Tmp6, Tmp5);
3360 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
3361 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
3362 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp6);
3363 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
3364 return DAG.getNode(ISD::OR, VT, Tmp8, Tmp4);
3368 /// ExpandBitCount - Expand the specified bitcount instruction into operations.
3370 SDOperand SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDOperand Op) {
3372 default: assert(0 && "Cannot expand this yet!");
3374 static const uint64_t mask[6] = {
3375 0x5555555555555555ULL, 0x3333333333333333ULL,
3376 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
3377 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
3379 MVT::ValueType VT = Op.getValueType();
3380 MVT::ValueType ShVT = TLI.getShiftAmountTy();
3381 unsigned len = getSizeInBits(VT);
3382 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
3383 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
3384 SDOperand Tmp2 = DAG.getConstant(mask[i], VT);
3385 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
3386 Op = DAG.getNode(ISD::ADD, VT, DAG.getNode(ISD::AND, VT, Op, Tmp2),
3387 DAG.getNode(ISD::AND, VT,
3388 DAG.getNode(ISD::SRL, VT, Op, Tmp3),Tmp2));
3393 // for now, we do this:
3394 // x = x | (x >> 1);
3395 // x = x | (x >> 2);
3397 // x = x | (x >>16);
3398 // x = x | (x >>32); // for 64-bit input
3399 // return popcount(~x);
3401 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
3402 MVT::ValueType VT = Op.getValueType();
3403 MVT::ValueType ShVT = TLI.getShiftAmountTy();
3404 unsigned len = getSizeInBits(VT);
3405 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
3406 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
3407 Op = DAG.getNode(ISD::OR, VT, Op, DAG.getNode(ISD::SRL, VT, Op, Tmp3));
3409 Op = DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(~0ULL, VT));
3410 return DAG.getNode(ISD::CTPOP, VT, Op);
3413 // for now, we use: { return popcount(~x & (x - 1)); }
3414 // unless the target has ctlz but not ctpop, in which case we use:
3415 // { return 32 - nlz(~x & (x-1)); }
3416 // see also http://www.hackersdelight.org/HDcode/ntz.cc
3417 MVT::ValueType VT = Op.getValueType();
3418 SDOperand Tmp2 = DAG.getConstant(~0ULL, VT);
3419 SDOperand Tmp3 = DAG.getNode(ISD::AND, VT,
3420 DAG.getNode(ISD::XOR, VT, Op, Tmp2),
3421 DAG.getNode(ISD::SUB, VT, Op, DAG.getConstant(1, VT)));
3422 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
3423 if (!TLI.isOperationLegal(ISD::CTPOP, VT) &&
3424 TLI.isOperationLegal(ISD::CTLZ, VT))
3425 return DAG.getNode(ISD::SUB, VT,
3426 DAG.getConstant(getSizeInBits(VT), VT),
3427 DAG.getNode(ISD::CTLZ, VT, Tmp3));
3428 return DAG.getNode(ISD::CTPOP, VT, Tmp3);
3434 /// ExpandOp - Expand the specified SDOperand into its two component pieces
3435 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the
3436 /// LegalizeNodes map is filled in for any results that are not expanded, the
3437 /// ExpandedNodes map is filled in for any results that are expanded, and the
3438 /// Lo/Hi values are returned.
3439 void SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){
3440 MVT::ValueType VT = Op.getValueType();
3441 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
3442 SDNode *Node = Op.Val;
3443 assert(getTypeAction(VT) == Expand && "Not an expanded type!");
3444 assert((MVT::isInteger(VT) || VT == MVT::Vector) &&
3445 "Cannot expand FP values!");
3446 assert(((MVT::isInteger(NVT) && NVT < VT) || VT == MVT::Vector) &&
3447 "Cannot expand to FP value or to larger int value!");
3449 // See if we already expanded it.
3450 std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
3451 = ExpandedNodes.find(Op);
3452 if (I != ExpandedNodes.end()) {
3453 Lo = I->second.first;
3454 Hi = I->second.second;
3458 switch (Node->getOpcode()) {
3459 case ISD::CopyFromReg:
3460 assert(0 && "CopyFromReg must be legal!");
3462 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
3463 assert(0 && "Do not know how to expand this operator!");
3466 Lo = DAG.getNode(ISD::UNDEF, NVT);
3467 Hi = DAG.getNode(ISD::UNDEF, NVT);
3469 case ISD::Constant: {
3470 uint64_t Cst = cast<ConstantSDNode>(Node)->getValue();
3471 Lo = DAG.getConstant(Cst, NVT);
3472 Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT);
3475 case ISD::VConstant: {
3476 unsigned NumElements =
3477 cast<ConstantSDNode>(Node->getOperand(0))->getValue() / 2;
3478 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
3479 MVT::ValueType TVT = (NumElements > 1)
3480 ? getVectorType(EVT, NumElements) : EVT;
3481 // If type of bisected vector is legal, turn it into a ConstantVec (which
3482 // will be lowered to a ConstantPool or something else). Otherwise, bisect
3483 // the VConstant, and return each half as a new VConstant.
3484 unsigned Opc = ISD::ConstantVec;
3485 std::vector<SDOperand> LoOps, HiOps;
3486 if (!(TVT != MVT::Other &&
3487 (!MVT::isVector(TVT) || TLI.isTypeLegal(TVT)))) {
3488 Opc = ISD::VConstant;
3490 SDOperand Num = DAG.getConstant(NumElements, MVT::i32);
3491 SDOperand Typ = DAG.getValueType(EVT);
3492 HiOps.push_back(Num);
3493 HiOps.push_back(Typ);
3494 LoOps.push_back(Num);
3495 LoOps.push_back(Typ);
3498 if (NumElements == 1) {
3499 Hi = Node->getOperand(2);
3500 Lo = Node->getOperand(3);
3502 for (unsigned I = 0, E = NumElements; I < E; ++I) {
3503 HiOps.push_back(Node->getOperand(I+2));
3504 LoOps.push_back(Node->getOperand(I+2+NumElements));
3506 Hi = DAG.getNode(Opc, TVT, HiOps);
3507 Lo = DAG.getNode(Opc, TVT, LoOps);
3512 case ISD::BUILD_PAIR:
3513 // Return the operands.
3514 Lo = Node->getOperand(0);
3515 Hi = Node->getOperand(1);
3518 case ISD::SIGN_EXTEND_INREG:
3519 ExpandOp(Node->getOperand(0), Lo, Hi);
3520 // Sign extend the lo-part.
3521 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
3522 DAG.getConstant(MVT::getSizeInBits(NVT)-1,
3523 TLI.getShiftAmountTy()));
3524 // sext_inreg the low part if needed.
3525 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Lo, Node->getOperand(1));
3529 ExpandOp(Node->getOperand(0), Lo, Hi);
3530 SDOperand TempLo = DAG.getNode(ISD::BSWAP, NVT, Hi);
3531 Hi = DAG.getNode(ISD::BSWAP, NVT, Lo);
3537 ExpandOp(Node->getOperand(0), Lo, Hi);
3538 Lo = DAG.getNode(ISD::ADD, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L)
3539 DAG.getNode(ISD::CTPOP, NVT, Lo),
3540 DAG.getNode(ISD::CTPOP, NVT, Hi));
3541 Hi = DAG.getConstant(0, NVT);
3545 // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32)
3546 ExpandOp(Node->getOperand(0), Lo, Hi);
3547 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
3548 SDOperand HLZ = DAG.getNode(ISD::CTLZ, NVT, Hi);
3549 SDOperand TopNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), HLZ, BitsC,
3551 SDOperand LowPart = DAG.getNode(ISD::CTLZ, NVT, Lo);
3552 LowPart = DAG.getNode(ISD::ADD, NVT, LowPart, BitsC);
3554 Lo = DAG.getNode(ISD::SELECT, NVT, TopNotZero, HLZ, LowPart);
3555 Hi = DAG.getConstant(0, NVT);
3560 // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32)
3561 ExpandOp(Node->getOperand(0), Lo, Hi);
3562 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
3563 SDOperand LTZ = DAG.getNode(ISD::CTTZ, NVT, Lo);
3564 SDOperand BotNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), LTZ, BitsC,
3566 SDOperand HiPart = DAG.getNode(ISD::CTTZ, NVT, Hi);
3567 HiPart = DAG.getNode(ISD::ADD, NVT, HiPart, BitsC);
3569 Lo = DAG.getNode(ISD::SELECT, NVT, BotNotZero, LTZ, HiPart);
3570 Hi = DAG.getConstant(0, NVT);
3575 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
3576 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
3577 Lo = DAG.getVAArg(NVT, Ch, Ptr, Node->getOperand(2));
3578 Hi = DAG.getVAArg(NVT, Lo.getValue(1), Ptr, Node->getOperand(2));
3580 // Remember that we legalized the chain.
3581 Hi = LegalizeOp(Hi);
3582 AddLegalizedOperand(Op.getValue(1), Hi.getValue(1));
3583 if (!TLI.isLittleEndian())
3589 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
3590 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
3591 Lo = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2));
3593 // Increment the pointer to the other half.
3594 unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8;
3595 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
3596 getIntPtrConstant(IncrementSize));
3597 // FIXME: This creates a bogus srcvalue!
3598 Hi = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2));
3600 // Build a factor node to remember that this load is independent of the
3602 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
3605 // Remember that we legalized the chain.
3606 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
3607 if (!TLI.isLittleEndian())
3612 SDOperand Ch = Node->getOperand(2); // Legalize the chain.
3613 SDOperand Ptr = Node->getOperand(3); // Legalize the pointer.
3614 unsigned NumElements =cast<ConstantSDNode>(Node->getOperand(0))->getValue();
3615 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
3616 MVT::ValueType TVT = (NumElements/2 > 1)
3617 ? getVectorType(EVT, NumElements/2) : EVT;
3619 // If type of split vector is legal, turn into a pair of scalar or
3621 if (TVT != MVT::Other &&
3622 (!MVT::isVector(TVT) ||
3623 (TLI.isTypeLegal(TVT) && TLI.isOperationLegal(ISD::LOAD, TVT)))) {
3624 Lo = DAG.getLoad(TVT, Ch, Ptr, Node->getOperand(4));
3625 // Increment the pointer to the other half.
3626 unsigned IncrementSize = MVT::getSizeInBits(TVT)/8;
3627 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
3628 getIntPtrConstant(IncrementSize));
3629 // FIXME: This creates a bogus srcvalue!
3630 Hi = DAG.getLoad(TVT, Ch, Ptr, Node->getOperand(4));
3632 NumElements /= 2; // Split the vector in half
3633 Lo = DAG.getVecLoad(NumElements, EVT, Ch, Ptr, Node->getOperand(4));
3634 unsigned IncrementSize = NumElements * MVT::getSizeInBits(EVT)/8;
3635 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
3636 getIntPtrConstant(IncrementSize));
3637 // FIXME: This creates a bogus srcvalue!
3638 Hi = DAG.getVecLoad(NumElements, EVT, Ch, Ptr, Node->getOperand(4));
3641 // Build a factor node to remember that this load is independent of the
3643 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
3646 // Remember that we legalized the chain.
3647 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
3648 if (!TLI.isLittleEndian())
3660 unsigned NumElements =cast<ConstantSDNode>(Node->getOperand(0))->getValue();
3661 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
3662 MVT::ValueType TVT = (NumElements/2 > 1)
3663 ? getVectorType(EVT, NumElements/2) : EVT;
3664 SDOperand LL, LH, RL, RH;
3666 ExpandOp(Node->getOperand(2), LL, LH);
3667 ExpandOp(Node->getOperand(3), RL, RH);
3669 // If type of split vector is legal, turn into a pair of scalar / packed
3670 // ADD, SUB, or MUL.
3671 unsigned Opc = getScalarizedOpcode(Node->getOpcode(), EVT);
3672 if (TVT != MVT::Other &&
3673 (!MVT::isVector(TVT) ||
3674 (TLI.isTypeLegal(TVT) && TLI.isOperationLegal(Opc, TVT)))) {
3675 Lo = DAG.getNode(Opc, TVT, LL, RL);
3676 Hi = DAG.getNode(Opc, TVT, LH, RH);
3678 SDOperand Num = DAG.getConstant(NumElements/2, MVT::i32);
3679 SDOperand Typ = DAG.getValueType(EVT);
3680 Lo = DAG.getNode(Node->getOpcode(), MVT::Vector, Num, Typ, LL, RL);
3681 Hi = DAG.getNode(Node->getOpcode(), MVT::Vector, Num, Typ, LH, RH);
3687 case ISD::XOR: { // Simple logical operators -> two trivial pieces.
3688 SDOperand LL, LH, RL, RH;
3689 ExpandOp(Node->getOperand(0), LL, LH);
3690 ExpandOp(Node->getOperand(1), RL, RH);
3691 Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL);
3692 Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH);
3696 SDOperand LL, LH, RL, RH;
3697 ExpandOp(Node->getOperand(1), LL, LH);
3698 ExpandOp(Node->getOperand(2), RL, RH);
3699 Lo = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LL, RL);
3700 Hi = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LH, RH);
3703 case ISD::SELECT_CC: {
3704 SDOperand TL, TH, FL, FH;
3705 ExpandOp(Node->getOperand(2), TL, TH);
3706 ExpandOp(Node->getOperand(3), FL, FH);
3707 Lo = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
3708 Node->getOperand(1), TL, FL, Node->getOperand(4));
3709 Hi = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
3710 Node->getOperand(1), TH, FH, Node->getOperand(4));
3713 case ISD::SEXTLOAD: {
3714 SDOperand Chain = Node->getOperand(0);
3715 SDOperand Ptr = Node->getOperand(1);
3716 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
3719 Lo = DAG.getLoad(NVT, Chain, Ptr, Node->getOperand(2));
3721 Lo = DAG.getExtLoad(ISD::SEXTLOAD, NVT, Chain, Ptr, Node->getOperand(2),
3724 // Remember that we legalized the chain.
3725 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
3727 // The high part is obtained by SRA'ing all but one of the bits of the lo
3729 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
3730 Hi = DAG.getNode(ISD::SRA, NVT, Lo, DAG.getConstant(LoSize-1,
3731 TLI.getShiftAmountTy()));
3734 case ISD::ZEXTLOAD: {
3735 SDOperand Chain = Node->getOperand(0);
3736 SDOperand Ptr = Node->getOperand(1);
3737 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
3740 Lo = DAG.getLoad(NVT, Chain, Ptr, Node->getOperand(2));
3742 Lo = DAG.getExtLoad(ISD::ZEXTLOAD, NVT, Chain, Ptr, Node->getOperand(2),
3745 // Remember that we legalized the chain.
3746 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
3748 // The high part is just a zero.
3749 Hi = DAG.getConstant(0, NVT);
3752 case ISD::EXTLOAD: {
3753 SDOperand Chain = Node->getOperand(0);
3754 SDOperand Ptr = Node->getOperand(1);
3755 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
3758 Lo = DAG.getLoad(NVT, Chain, Ptr, Node->getOperand(2));
3760 Lo = DAG.getExtLoad(ISD::EXTLOAD, NVT, Chain, Ptr, Node->getOperand(2),
3763 // Remember that we legalized the chain.
3764 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
3766 // The high part is undefined.
3767 Hi = DAG.getNode(ISD::UNDEF, NVT);
3770 case ISD::ANY_EXTEND:
3771 // The low part is any extension of the input (which degenerates to a copy).
3772 Lo = DAG.getNode(ISD::ANY_EXTEND, NVT, Node->getOperand(0));
3773 // The high part is undefined.
3774 Hi = DAG.getNode(ISD::UNDEF, NVT);
3776 case ISD::SIGN_EXTEND: {
3777 // The low part is just a sign extension of the input (which degenerates to
3779 Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, Node->getOperand(0));
3781 // The high part is obtained by SRA'ing all but one of the bits of the lo
3783 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
3784 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
3785 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
3788 case ISD::ZERO_EXTEND:
3789 // The low part is just a zero extension of the input (which degenerates to
3791 Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
3793 // The high part is just a zero.
3794 Hi = DAG.getConstant(0, NVT);
3797 case ISD::BIT_CONVERT: {
3798 SDOperand Tmp = ExpandBIT_CONVERT(Node->getValueType(0),
3799 Node->getOperand(0));
3800 ExpandOp(Tmp, Lo, Hi);
3804 case ISD::READCYCLECOUNTER:
3805 assert(TLI.getOperationAction(ISD::READCYCLECOUNTER, VT) ==
3806 TargetLowering::Custom &&
3807 "Must custom expand ReadCycleCounter");
3808 Lo = TLI.LowerOperation(Op, DAG);
3809 assert(Lo.Val && "Node must be custom expanded!");
3810 Hi = Lo.getValue(1);
3811 AddLegalizedOperand(SDOperand(Node, 1), // Remember we legalized the chain.
3812 LegalizeOp(Lo.getValue(2)));
3815 // These operators cannot be expanded directly, emit them as calls to
3816 // library functions.
3817 case ISD::FP_TO_SINT:
3818 if (TLI.getOperationAction(ISD::FP_TO_SINT, VT) == TargetLowering::Custom) {
3820 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3821 case Expand: assert(0 && "cannot expand FP!");
3822 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
3823 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
3826 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_SINT, VT, Op), DAG);
3828 // Now that the custom expander is done, expand the result, which is still
3831 ExpandOp(Op, Lo, Hi);
3836 if (Node->getOperand(0).getValueType() == MVT::f32)
3837 Lo = ExpandLibCall("__fixsfdi", Node, Hi);
3839 Lo = ExpandLibCall("__fixdfdi", Node, Hi);
3842 case ISD::FP_TO_UINT:
3843 if (TLI.getOperationAction(ISD::FP_TO_UINT, VT) == TargetLowering::Custom) {
3845 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3846 case Expand: assert(0 && "cannot expand FP!");
3847 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
3848 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
3851 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_UINT, VT, Op), DAG);
3853 // Now that the custom expander is done, expand the result.
3855 ExpandOp(Op, Lo, Hi);
3860 if (Node->getOperand(0).getValueType() == MVT::f32)
3861 Lo = ExpandLibCall("__fixunssfdi", Node, Hi);
3863 Lo = ExpandLibCall("__fixunsdfdi", Node, Hi);
3867 // If the target wants custom lowering, do so.
3868 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
3869 if (TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Custom) {
3870 SDOperand Op = DAG.getNode(ISD::SHL, VT, Node->getOperand(0), ShiftAmt);
3871 Op = TLI.LowerOperation(Op, DAG);
3873 // Now that the custom expander is done, expand the result, which is
3875 ExpandOp(Op, Lo, Hi);
3880 // If we can emit an efficient shift operation, do so now.
3881 if (ExpandShift(ISD::SHL, Node->getOperand(0), ShiftAmt, Lo, Hi))
3884 // If this target supports SHL_PARTS, use it.
3885 TargetLowering::LegalizeAction Action =
3886 TLI.getOperationAction(ISD::SHL_PARTS, NVT);
3887 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
3888 Action == TargetLowering::Custom) {
3889 ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
3893 // Otherwise, emit a libcall.
3894 Lo = ExpandLibCall("__ashldi3", Node, Hi);
3899 // If the target wants custom lowering, do so.
3900 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
3901 if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Custom) {
3902 SDOperand Op = DAG.getNode(ISD::SRA, VT, Node->getOperand(0), ShiftAmt);
3903 Op = TLI.LowerOperation(Op, DAG);
3905 // Now that the custom expander is done, expand the result, which is
3907 ExpandOp(Op, Lo, Hi);
3912 // If we can emit an efficient shift operation, do so now.
3913 if (ExpandShift(ISD::SRA, Node->getOperand(0), ShiftAmt, Lo, Hi))
3916 // If this target supports SRA_PARTS, use it.
3917 TargetLowering::LegalizeAction Action =
3918 TLI.getOperationAction(ISD::SRA_PARTS, NVT);
3919 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
3920 Action == TargetLowering::Custom) {
3921 ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
3925 // Otherwise, emit a libcall.
3926 Lo = ExpandLibCall("__ashrdi3", Node, Hi);
3931 // If the target wants custom lowering, do so.
3932 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
3933 if (TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Custom) {
3934 SDOperand Op = DAG.getNode(ISD::SRL, VT, Node->getOperand(0), ShiftAmt);
3935 Op = TLI.LowerOperation(Op, DAG);
3937 // Now that the custom expander is done, expand the result, which is
3939 ExpandOp(Op, Lo, Hi);
3944 // If we can emit an efficient shift operation, do so now.
3945 if (ExpandShift(ISD::SRL, Node->getOperand(0), ShiftAmt, Lo, Hi))
3948 // If this target supports SRL_PARTS, use it.
3949 TargetLowering::LegalizeAction Action =
3950 TLI.getOperationAction(ISD::SRL_PARTS, NVT);
3951 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
3952 Action == TargetLowering::Custom) {
3953 ExpandShiftParts(ISD::SRL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
3957 // Otherwise, emit a libcall.
3958 Lo = ExpandLibCall("__lshrdi3", Node, Hi);
3964 // If the target wants to custom expand this, let them.
3965 if (TLI.getOperationAction(Node->getOpcode(), VT) ==
3966 TargetLowering::Custom) {
3967 Op = TLI.LowerOperation(Op, DAG);
3969 ExpandOp(Op, Lo, Hi);
3974 // Expand the subcomponents.
3975 SDOperand LHSL, LHSH, RHSL, RHSH;
3976 ExpandOp(Node->getOperand(0), LHSL, LHSH);
3977 ExpandOp(Node->getOperand(1), RHSL, RHSH);
3978 std::vector<MVT::ValueType> VTs;
3979 std::vector<SDOperand> LoOps, HiOps;
3980 VTs.push_back(LHSL.getValueType());
3981 VTs.push_back(MVT::Flag);
3982 LoOps.push_back(LHSL);
3983 LoOps.push_back(RHSL);
3984 HiOps.push_back(LHSH);
3985 HiOps.push_back(RHSH);
3986 if (Node->getOpcode() == ISD::ADD) {
3987 Lo = DAG.getNode(ISD::ADDC, VTs, LoOps);
3988 HiOps.push_back(Lo.getValue(1));
3989 Hi = DAG.getNode(ISD::ADDE, VTs, HiOps);
3991 Lo = DAG.getNode(ISD::SUBC, VTs, LoOps);
3992 HiOps.push_back(Lo.getValue(1));
3993 Hi = DAG.getNode(ISD::SUBE, VTs, HiOps);
3998 if (TLI.isOperationLegal(ISD::MULHU, NVT)) {
3999 SDOperand LL, LH, RL, RH;
4000 ExpandOp(Node->getOperand(0), LL, LH);
4001 ExpandOp(Node->getOperand(1), RL, RH);
4002 unsigned SH = MVT::getSizeInBits(RH.getValueType())-1;
4003 // MULHS implicitly sign extends its inputs. Check to see if ExpandOp
4004 // extended the sign bit of the low half through the upper half, and if so
4005 // emit a MULHS instead of the alternate sequence that is valid for any
4006 // i64 x i64 multiply.
4007 if (TLI.isOperationLegal(ISD::MULHS, NVT) &&
4008 // is RH an extension of the sign bit of RL?
4009 RH.getOpcode() == ISD::SRA && RH.getOperand(0) == RL &&
4010 RH.getOperand(1).getOpcode() == ISD::Constant &&
4011 cast<ConstantSDNode>(RH.getOperand(1))->getValue() == SH &&
4012 // is LH an extension of the sign bit of LL?
4013 LH.getOpcode() == ISD::SRA && LH.getOperand(0) == LL &&
4014 LH.getOperand(1).getOpcode() == ISD::Constant &&
4015 cast<ConstantSDNode>(LH.getOperand(1))->getValue() == SH) {
4016 Hi = DAG.getNode(ISD::MULHS, NVT, LL, RL);
4018 Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL);
4019 RH = DAG.getNode(ISD::MUL, NVT, LL, RH);
4020 LH = DAG.getNode(ISD::MUL, NVT, LH, RL);
4021 Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH);
4022 Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH);
4024 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
4026 Lo = ExpandLibCall("__muldi3" , Node, Hi);
4030 case ISD::SDIV: Lo = ExpandLibCall("__divdi3" , Node, Hi); break;
4031 case ISD::UDIV: Lo = ExpandLibCall("__udivdi3", Node, Hi); break;
4032 case ISD::SREM: Lo = ExpandLibCall("__moddi3" , Node, Hi); break;
4033 case ISD::UREM: Lo = ExpandLibCall("__umoddi3", Node, Hi); break;
4036 // Make sure the resultant values have been legalized themselves, unless this
4037 // is a type that requires multi-step expansion.
4038 if (getTypeAction(NVT) != Expand && NVT != MVT::isVoid) {
4039 Lo = LegalizeOp(Lo);
4040 Hi = LegalizeOp(Hi);
4043 // Remember in a map if the values will be reused later.
4045 ExpandedNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
4046 assert(isNew && "Value already expanded?!?");
4050 // SelectionDAG::Legalize - This is the entry point for the file.
4052 void SelectionDAG::Legalize() {
4053 /// run - This is the main entry point to this class.
4055 SelectionDAGLegalize(*this).LegalizeDAG();