blob: 07b72a63729385403e25f9a376f76b62e0c2e738 [file] [log] [blame]
Chris Lattner3e928bb2005-01-07 07:47:09 +00001//===-- LegalizeDAG.cpp - Implement SelectionDAG::Legalize ----------------===//
Misha Brukmanedf128a2005-04-21 22:36:52 +00002//
Chris Lattner3e928bb2005-01-07 07:47:09 +00003// The LLVM Compiler Infrastructure
4//
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.
Misha Brukmanedf128a2005-04-21 22:36:52 +00007//
Chris Lattner3e928bb2005-01-07 07:47:09 +00008//===----------------------------------------------------------------------===//
9//
10// This file implements the SelectionDAG::Legalize method.
11//
12//===----------------------------------------------------------------------===//
13
14#include "llvm/CodeGen/SelectionDAG.h"
Chris Lattner3e928bb2005-01-07 07:47:09 +000015#include "llvm/CodeGen/MachineFunction.h"
Chris Lattner45b8caf2005-01-15 07:15:18 +000016#include "llvm/CodeGen/MachineFrameInfo.h"
Chris Lattner3e928bb2005-01-07 07:47:09 +000017#include "llvm/Target/TargetLowering.h"
Chris Lattnere1bd8222005-01-11 05:57:22 +000018#include "llvm/Target/TargetData.h"
Chris Lattner0f69b292005-01-15 06:18:18 +000019#include "llvm/Target/TargetOptions.h"
Chris Lattneradf6a962005-05-13 18:50:42 +000020#include "llvm/CallingConv.h"
Chris Lattner3e928bb2005-01-07 07:47:09 +000021#include "llvm/Constants.h"
Chris Lattner5e46a192006-04-02 03:07:27 +000022#include "llvm/Support/MathExtras.h"
23#include "llvm/Support/CommandLine.h"
Chris Lattnera4f0b3a2006-08-27 12:54:02 +000024#include "llvm/Support/Compiler.h"
Chris Lattnerf06f35e2006-08-08 01:09:31 +000025#include "llvm/ADT/SmallVector.h"
Chris Lattner3e928bb2005-01-07 07:47:09 +000026#include <iostream>
Evan Cheng033e6812006-03-24 01:17:21 +000027#include <map>
Chris Lattner3e928bb2005-01-07 07:47:09 +000028using namespace llvm;
29
Chris Lattner5e46a192006-04-02 03:07:27 +000030#ifndef NDEBUG
31static cl::opt<bool>
32ViewLegalizeDAGs("view-legalize-dags", cl::Hidden,
33 cl::desc("Pop up a window to show dags before legalize"));
34#else
35static const bool ViewLegalizeDAGs = 0;
36#endif
37
Chris Lattner3e928bb2005-01-07 07:47:09 +000038//===----------------------------------------------------------------------===//
39/// SelectionDAGLegalize - This takes an arbitrary SelectionDAG as input and
40/// hacks on it until the target machine can handle it. This involves
41/// eliminating value sizes the machine cannot handle (promoting small sizes to
42/// large sizes or splitting up large values into small values) as well as
43/// eliminating operations the machine cannot handle.
44///
45/// This code also does a small amount of optimization and recognition of idioms
46/// as part of its processing. For example, if a target does not support a
47/// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
48/// will attempt merge setcc and brc instructions into brcc's.
49///
50namespace {
Chris Lattner360e8202006-06-28 21:58:30 +000051class VISIBILITY_HIDDEN SelectionDAGLegalize {
Chris Lattner3e928bb2005-01-07 07:47:09 +000052 TargetLowering &TLI;
53 SelectionDAG &DAG;
54
Chris Lattner6831a812006-02-13 09:18:02 +000055 // Libcall insertion helpers.
56
57 /// LastCALLSEQ_END - This keeps track of the CALLSEQ_END node that has been
58 /// legalized. We use this to ensure that calls are properly serialized
59 /// against each other, including inserted libcalls.
60 SDOperand LastCALLSEQ_END;
61
62 /// IsLegalizingCall - This member is used *only* for purposes of providing
63 /// helpful assertions that a libcall isn't created while another call is
64 /// being legalized (which could lead to non-serialized call sequences).
65 bool IsLegalizingCall;
66
Chris Lattner3e928bb2005-01-07 07:47:09 +000067 enum LegalizeAction {
Chris Lattner68a17fe2006-01-29 08:42:06 +000068 Legal, // The target natively supports this operation.
69 Promote, // This operation should be executed in a larger type.
Chris Lattnerd74ea2b2006-05-24 17:04:05 +000070 Expand // Try to expand this to other ops, otherwise use a libcall.
Chris Lattner3e928bb2005-01-07 07:47:09 +000071 };
Chris Lattner6831a812006-02-13 09:18:02 +000072
Chris Lattner3e928bb2005-01-07 07:47:09 +000073 /// ValueTypeActions - This is a bitvector that contains two bits for each
74 /// value type, where the two bits correspond to the LegalizeAction enum.
75 /// This can be queried with "getTypeAction(VT)".
Chris Lattner68a17fe2006-01-29 08:42:06 +000076 TargetLowering::ValueTypeActionImpl ValueTypeActions;
Chris Lattner3e928bb2005-01-07 07:47:09 +000077
Chris Lattner3e928bb2005-01-07 07:47:09 +000078 /// LegalizedNodes - For nodes that are of legal width, and that have more
79 /// than one use, this map indicates what regularized operand to use. This
80 /// allows us to avoid legalizing the same thing more than once.
81 std::map<SDOperand, SDOperand> LegalizedNodes;
82
Chris Lattner03c85462005-01-15 05:21:40 +000083 /// PromotedNodes - For nodes that are below legal width, and that have more
84 /// than one use, this map indicates what promoted value to use. This allows
85 /// us to avoid promoting the same thing more than once.
86 std::map<SDOperand, SDOperand> PromotedNodes;
87
Chris Lattnerc7029802006-03-18 01:44:44 +000088 /// ExpandedNodes - For nodes that need to be expanded this map indicates
89 /// which which operands are the expanded version of the input. This allows
90 /// us to avoid expanding the same node more than once.
Chris Lattner3e928bb2005-01-07 07:47:09 +000091 std::map<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes;
92
Chris Lattnerc7029802006-03-18 01:44:44 +000093 /// SplitNodes - For vector nodes that need to be split, this map indicates
94 /// which which operands are the split version of the input. This allows us
95 /// to avoid splitting the same node more than once.
96 std::map<SDOperand, std::pair<SDOperand, SDOperand> > SplitNodes;
97
98 /// PackedNodes - For nodes that need to be packed from MVT::Vector types to
99 /// concrete packed types, this contains the mapping of ones we have already
100 /// processed to the result.
101 std::map<SDOperand, SDOperand> PackedNodes;
102
Chris Lattner8afc48e2005-01-07 22:28:47 +0000103 void AddLegalizedOperand(SDOperand From, SDOperand To) {
Chris Lattner69a889e2005-12-20 00:53:54 +0000104 LegalizedNodes.insert(std::make_pair(From, To));
105 // If someone requests legalization of the new node, return itself.
106 if (From != To)
107 LegalizedNodes.insert(std::make_pair(To, To));
Chris Lattner8afc48e2005-01-07 22:28:47 +0000108 }
Chris Lattner03c85462005-01-15 05:21:40 +0000109 void AddPromotedOperand(SDOperand From, SDOperand To) {
110 bool isNew = PromotedNodes.insert(std::make_pair(From, To)).second;
111 assert(isNew && "Got into the map somehow?");
Chris Lattner69a889e2005-12-20 00:53:54 +0000112 // If someone requests legalization of the new node, return itself.
113 LegalizedNodes.insert(std::make_pair(To, To));
Chris Lattner03c85462005-01-15 05:21:40 +0000114 }
Chris Lattner8afc48e2005-01-07 22:28:47 +0000115
Chris Lattner3e928bb2005-01-07 07:47:09 +0000116public:
117
Chris Lattner9c32d3b2005-01-23 04:42:50 +0000118 SelectionDAGLegalize(SelectionDAG &DAG);
Chris Lattner3e928bb2005-01-07 07:47:09 +0000119
Chris Lattner3e928bb2005-01-07 07:47:09 +0000120 /// getTypeAction - Return how we should legalize values of this type, either
121 /// it is already legal or we need to expand it into multiple registers of
122 /// smaller integer type, or we need to promote it to a larger type.
123 LegalizeAction getTypeAction(MVT::ValueType VT) const {
Chris Lattner68a17fe2006-01-29 08:42:06 +0000124 return (LegalizeAction)ValueTypeActions.getTypeAction(VT);
Chris Lattner3e928bb2005-01-07 07:47:09 +0000125 }
126
127 /// isTypeLegal - Return true if this type is legal on this target.
128 ///
129 bool isTypeLegal(MVT::ValueType VT) const {
130 return getTypeAction(VT) == Legal;
131 }
132
Chris Lattner3e928bb2005-01-07 07:47:09 +0000133 void LegalizeDAG();
134
Chris Lattner456a93a2006-01-28 07:39:30 +0000135private:
Chris Lattnerc7029802006-03-18 01:44:44 +0000136 /// HandleOp - Legalize, Promote, Expand or Pack the specified operand as
137 /// appropriate for its type.
138 void HandleOp(SDOperand Op);
139
140 /// LegalizeOp - We know that the specified value has a legal type.
141 /// Recursively ensure that the operands have legal types, then return the
142 /// result.
Chris Lattner3e928bb2005-01-07 07:47:09 +0000143 SDOperand LegalizeOp(SDOperand O);
Chris Lattnerc7029802006-03-18 01:44:44 +0000144
145 /// PromoteOp - Given an operation that produces a value in an invalid type,
146 /// promote it to compute the value into a larger type. The produced value
147 /// will have the correct bits for the low portion of the register, but no
148 /// guarantee is made about the top bits: it may be zero, sign-extended, or
149 /// garbage.
Chris Lattner03c85462005-01-15 05:21:40 +0000150 SDOperand PromoteOp(SDOperand O);
Chris Lattner3e928bb2005-01-07 07:47:09 +0000151
Chris Lattnerc7029802006-03-18 01:44:44 +0000152 /// ExpandOp - Expand the specified SDOperand into its two component pieces
153 /// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this,
154 /// the LegalizeNodes map is filled in for any results that are not expanded,
155 /// the ExpandedNodes map is filled in for any results that are expanded, and
156 /// the Lo/Hi values are returned. This applies to integer types and Vector
157 /// types.
158 void ExpandOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
159
160 /// SplitVectorOp - Given an operand of MVT::Vector type, break it down into
161 /// two smaller values of MVT::Vector type.
162 void SplitVectorOp(SDOperand O, SDOperand &Lo, SDOperand &Hi);
163
164 /// PackVectorOp - Given an operand of MVT::Vector type, convert it into the
165 /// equivalent operation that returns a packed value (e.g. MVT::V4F32). When
166 /// this is called, we know that PackedVT is the right type for the result and
167 /// we know that this type is legal for the target.
168 SDOperand PackVectorOp(SDOperand O, MVT::ValueType PackedVT);
169
Chris Lattner4352cc92006-04-04 17:23:26 +0000170 /// isShuffleLegal - Return true if a vector shuffle is legal with the
171 /// specified mask and type. Targets can specify exactly which masks they
172 /// support and the code generator is tasked with not creating illegal masks.
173 ///
174 /// Note that this will also return true for shuffles that are promoted to a
175 /// different type.
176 ///
177 /// If this is a legal shuffle, this method returns the (possibly promoted)
178 /// build_vector Mask. If it's not a legal shuffle, it returns null.
179 SDNode *isShuffleLegal(MVT::ValueType VT, SDOperand Mask) const;
180
Chris Lattnerc9cf4f12006-07-26 23:55:56 +0000181 bool LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
182 std::set<SDNode*> &NodesLeadingTo);
Chris Lattner6831a812006-02-13 09:18:02 +0000183
Nate Begeman750ac1b2006-02-01 07:19:44 +0000184 void LegalizeSetCCOperands(SDOperand &LHS, SDOperand &RHS, SDOperand &CC);
185
Chris Lattnerce872152006-03-19 06:31:19 +0000186 SDOperand CreateStackTemporary(MVT::ValueType VT);
187
Chris Lattner77e77a62005-01-21 06:05:23 +0000188 SDOperand ExpandLibCall(const char *Name, SDNode *Node,
189 SDOperand &Hi);
190 SDOperand ExpandIntToFP(bool isSigned, MVT::ValueType DestTy,
191 SDOperand Source);
Chris Lattnercad063f2005-07-16 00:19:57 +0000192
Chris Lattner35481892005-12-23 00:16:34 +0000193 SDOperand ExpandBIT_CONVERT(MVT::ValueType DestVT, SDOperand SrcOp);
Chris Lattnerce872152006-03-19 06:31:19 +0000194 SDOperand ExpandBUILD_VECTOR(SDNode *Node);
Chris Lattner4352cc92006-04-04 17:23:26 +0000195 SDOperand ExpandSCALAR_TO_VECTOR(SDNode *Node);
Jim Laskey6269ed12005-08-17 00:39:29 +0000196 SDOperand ExpandLegalINT_TO_FP(bool isSigned,
197 SDOperand LegalOp,
198 MVT::ValueType DestVT);
Nate Begeman5a8441e2005-07-16 02:02:34 +0000199 SDOperand PromoteLegalINT_TO_FP(SDOperand LegalOp, MVT::ValueType DestVT,
200 bool isSigned);
Chris Lattner1618beb2005-07-29 00:11:56 +0000201 SDOperand PromoteLegalFP_TO_INT(SDOperand LegalOp, MVT::ValueType DestVT,
202 bool isSigned);
Jeff Cohen00b168892005-07-27 06:12:32 +0000203
Chris Lattner456a93a2006-01-28 07:39:30 +0000204 SDOperand ExpandBSWAP(SDOperand Op);
205 SDOperand ExpandBitCount(unsigned Opc, SDOperand Op);
Chris Lattnere34b3962005-01-19 04:19:40 +0000206 bool ExpandShift(unsigned Opc, SDOperand Op, SDOperand Amt,
207 SDOperand &Lo, SDOperand &Hi);
Chris Lattner5b359c62005-04-02 04:00:59 +0000208 void ExpandShiftParts(unsigned NodeOp, SDOperand Op, SDOperand Amt,
209 SDOperand &Lo, SDOperand &Hi);
Chris Lattnerb9fa3bc2005-05-12 04:49:08 +0000210
Chris Lattner15972212006-03-31 17:55:51 +0000211 SDOperand LowerVEXTRACT_VECTOR_ELT(SDOperand Op);
Chris Lattner4aab2f42006-04-02 05:06:04 +0000212 SDOperand ExpandEXTRACT_VECTOR_ELT(SDOperand Op);
Chris Lattner15972212006-03-31 17:55:51 +0000213
Chris Lattner3e928bb2005-01-07 07:47:09 +0000214 SDOperand getIntPtrConstant(uint64_t Val) {
215 return DAG.getConstant(Val, TLI.getPointerTy());
216 }
217};
218}
219
Chris Lattner4352cc92006-04-04 17:23:26 +0000220/// isVectorShuffleLegal - Return true if a vector shuffle is legal with the
221/// specified mask and type. Targets can specify exactly which masks they
222/// support and the code generator is tasked with not creating illegal masks.
223///
224/// Note that this will also return true for shuffles that are promoted to a
225/// different type.
226SDNode *SelectionDAGLegalize::isShuffleLegal(MVT::ValueType VT,
227 SDOperand Mask) const {
228 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE, VT)) {
229 default: return 0;
230 case TargetLowering::Legal:
231 case TargetLowering::Custom:
232 break;
233 case TargetLowering::Promote: {
234 // If this is promoted to a different type, convert the shuffle mask and
235 // ask if it is legal in the promoted type!
236 MVT::ValueType NVT = TLI.getTypeToPromoteTo(ISD::VECTOR_SHUFFLE, VT);
237
238 // If we changed # elements, change the shuffle mask.
239 unsigned NumEltsGrowth =
240 MVT::getVectorNumElements(NVT) / MVT::getVectorNumElements(VT);
241 assert(NumEltsGrowth && "Cannot promote to vector type with fewer elts!");
242 if (NumEltsGrowth > 1) {
243 // Renumber the elements.
Chris Lattnerbd564bf2006-08-08 02:23:42 +0000244 SmallVector<SDOperand, 8> Ops;
Chris Lattner4352cc92006-04-04 17:23:26 +0000245 for (unsigned i = 0, e = Mask.getNumOperands(); i != e; ++i) {
246 SDOperand InOp = Mask.getOperand(i);
247 for (unsigned j = 0; j != NumEltsGrowth; ++j) {
248 if (InOp.getOpcode() == ISD::UNDEF)
249 Ops.push_back(DAG.getNode(ISD::UNDEF, MVT::i32));
250 else {
251 unsigned InEltNo = cast<ConstantSDNode>(InOp)->getValue();
252 Ops.push_back(DAG.getConstant(InEltNo*NumEltsGrowth+j, MVT::i32));
253 }
254 }
255 }
Chris Lattnerbd564bf2006-08-08 02:23:42 +0000256 Mask = DAG.getNode(ISD::BUILD_VECTOR, NVT, &Ops[0], Ops.size());
Chris Lattner4352cc92006-04-04 17:23:26 +0000257 }
258 VT = NVT;
259 break;
260 }
261 }
262 return TLI.isShuffleMaskLegal(Mask, VT) ? Mask.Val : 0;
263}
264
Chris Lattnerc7029802006-03-18 01:44:44 +0000265/// getScalarizedOpcode - Return the scalar opcode that corresponds to the
266/// specified vector opcode.
Chris Lattnerb89175f2005-11-19 05:51:46 +0000267static unsigned getScalarizedOpcode(unsigned VecOp, MVT::ValueType VT) {
Nate Begeman5fbb5d22005-11-19 00:36:38 +0000268 switch (VecOp) {
269 default: assert(0 && "Don't know how to scalarize this opcode!");
Evan Cheng3e1ce5a2006-03-03 07:01:07 +0000270 case ISD::VADD: return MVT::isInteger(VT) ? ISD::ADD : ISD::FADD;
271 case ISD::VSUB: return MVT::isInteger(VT) ? ISD::SUB : ISD::FSUB;
272 case ISD::VMUL: return MVT::isInteger(VT) ? ISD::MUL : ISD::FMUL;
273 case ISD::VSDIV: return MVT::isInteger(VT) ? ISD::SDIV: ISD::FDIV;
274 case ISD::VUDIV: return MVT::isInteger(VT) ? ISD::UDIV: ISD::FDIV;
275 case ISD::VAND: return MVT::isInteger(VT) ? ISD::AND : 0;
276 case ISD::VOR: return MVT::isInteger(VT) ? ISD::OR : 0;
277 case ISD::VXOR: return MVT::isInteger(VT) ? ISD::XOR : 0;
Nate Begeman5fbb5d22005-11-19 00:36:38 +0000278 }
279}
Chris Lattner3e928bb2005-01-07 07:47:09 +0000280
Chris Lattner9c32d3b2005-01-23 04:42:50 +0000281SelectionDAGLegalize::SelectionDAGLegalize(SelectionDAG &dag)
282 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
283 ValueTypeActions(TLI.getValueTypeActions()) {
Nate Begeman6a648612005-11-29 05:45:29 +0000284 assert(MVT::LAST_VALUETYPE <= 32 &&
Chris Lattner3e928bb2005-01-07 07:47:09 +0000285 "Too many value types for ValueTypeActions to hold!");
Chris Lattner3e928bb2005-01-07 07:47:09 +0000286}
287
Chris Lattner32fca002005-10-06 01:20:27 +0000288/// ComputeTopDownOrdering - Add the specified node to the Order list if it has
289/// not been visited yet and if all of its operands have already been visited.
290static void ComputeTopDownOrdering(SDNode *N, std::vector<SDNode*> &Order,
291 std::map<SDNode*, unsigned> &Visited) {
292 if (++Visited[N] != N->getNumOperands())
293 return; // Haven't visited all operands yet
294
295 Order.push_back(N);
296
297 if (N->hasOneUse()) { // Tail recurse in common case.
298 ComputeTopDownOrdering(*N->use_begin(), Order, Visited);
299 return;
300 }
301
302 // Now that we have N in, add anything that uses it if all of their operands
303 // are now done.
Chris Lattner32fca002005-10-06 01:20:27 +0000304 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end(); UI != E;++UI)
305 ComputeTopDownOrdering(*UI, Order, Visited);
306}
307
Chris Lattner1618beb2005-07-29 00:11:56 +0000308
Chris Lattner3e928bb2005-01-07 07:47:09 +0000309void SelectionDAGLegalize::LegalizeDAG() {
Chris Lattner6831a812006-02-13 09:18:02 +0000310 LastCALLSEQ_END = DAG.getEntryNode();
311 IsLegalizingCall = false;
312
Chris Lattnerab510a72005-10-02 17:49:46 +0000313 // The legalize process is inherently a bottom-up recursive process (users
314 // legalize their uses before themselves). Given infinite stack space, we
315 // could just start legalizing on the root and traverse the whole graph. In
316 // practice however, this causes us to run out of stack space on large basic
Chris Lattner32fca002005-10-06 01:20:27 +0000317 // blocks. To avoid this problem, compute an ordering of the nodes where each
318 // node is only legalized after all of its operands are legalized.
319 std::map<SDNode*, unsigned> Visited;
320 std::vector<SDNode*> Order;
Chris Lattnerab510a72005-10-02 17:49:46 +0000321
Chris Lattner32fca002005-10-06 01:20:27 +0000322 // Compute ordering from all of the leaves in the graphs, those (like the
323 // entry node) that have no operands.
324 for (SelectionDAG::allnodes_iterator I = DAG.allnodes_begin(),
325 E = DAG.allnodes_end(); I != E; ++I) {
Chris Lattnerde202b32005-11-09 23:47:37 +0000326 if (I->getNumOperands() == 0) {
327 Visited[I] = 0 - 1U;
328 ComputeTopDownOrdering(I, Order, Visited);
Chris Lattnerab510a72005-10-02 17:49:46 +0000329 }
Chris Lattnerab510a72005-10-02 17:49:46 +0000330 }
331
Chris Lattnerde202b32005-11-09 23:47:37 +0000332 assert(Order.size() == Visited.size() &&
333 Order.size() ==
334 (unsigned)std::distance(DAG.allnodes_begin(), DAG.allnodes_end()) &&
Chris Lattner32fca002005-10-06 01:20:27 +0000335 "Error: DAG is cyclic!");
336 Visited.clear();
Chris Lattnerab510a72005-10-02 17:49:46 +0000337
Chris Lattnerc7029802006-03-18 01:44:44 +0000338 for (unsigned i = 0, e = Order.size(); i != e; ++i)
339 HandleOp(SDOperand(Order[i], 0));
Chris Lattner32fca002005-10-06 01:20:27 +0000340
341 // Finally, it's possible the root changed. Get the new root.
Chris Lattner3e928bb2005-01-07 07:47:09 +0000342 SDOperand OldRoot = DAG.getRoot();
Chris Lattner32fca002005-10-06 01:20:27 +0000343 assert(LegalizedNodes.count(OldRoot) && "Root didn't get legalized?");
344 DAG.setRoot(LegalizedNodes[OldRoot]);
Chris Lattner3e928bb2005-01-07 07:47:09 +0000345
346 ExpandedNodes.clear();
347 LegalizedNodes.clear();
Chris Lattner71c42a02005-01-16 01:11:45 +0000348 PromotedNodes.clear();
Chris Lattnerc7029802006-03-18 01:44:44 +0000349 SplitNodes.clear();
350 PackedNodes.clear();
Chris Lattner3e928bb2005-01-07 07:47:09 +0000351
352 // Remove dead nodes now.
Chris Lattner190a4182006-08-04 17:45:20 +0000353 DAG.RemoveDeadNodes();
Chris Lattner3e928bb2005-01-07 07:47:09 +0000354}
355
Chris Lattner6831a812006-02-13 09:18:02 +0000356
357/// FindCallEndFromCallStart - Given a chained node that is part of a call
358/// sequence, find the CALLSEQ_END node that terminates the call sequence.
359static SDNode *FindCallEndFromCallStart(SDNode *Node) {
360 if (Node->getOpcode() == ISD::CALLSEQ_END)
361 return Node;
362 if (Node->use_empty())
363 return 0; // No CallSeqEnd
364
365 // The chain is usually at the end.
366 SDOperand TheChain(Node, Node->getNumValues()-1);
367 if (TheChain.getValueType() != MVT::Other) {
368 // Sometimes it's at the beginning.
369 TheChain = SDOperand(Node, 0);
370 if (TheChain.getValueType() != MVT::Other) {
371 // Otherwise, hunt for it.
372 for (unsigned i = 1, e = Node->getNumValues(); i != e; ++i)
373 if (Node->getValueType(i) == MVT::Other) {
374 TheChain = SDOperand(Node, i);
375 break;
376 }
377
378 // Otherwise, we walked into a node without a chain.
379 if (TheChain.getValueType() != MVT::Other)
380 return 0;
381 }
382 }
383
384 for (SDNode::use_iterator UI = Node->use_begin(),
385 E = Node->use_end(); UI != E; ++UI) {
386
387 // Make sure to only follow users of our token chain.
388 SDNode *User = *UI;
389 for (unsigned i = 0, e = User->getNumOperands(); i != e; ++i)
390 if (User->getOperand(i) == TheChain)
391 if (SDNode *Result = FindCallEndFromCallStart(User))
392 return Result;
393 }
394 return 0;
395}
396
397/// FindCallStartFromCallEnd - Given a chained node that is part of a call
398/// sequence, find the CALLSEQ_START node that initiates the call sequence.
399static SDNode *FindCallStartFromCallEnd(SDNode *Node) {
400 assert(Node && "Didn't find callseq_start for a call??");
401 if (Node->getOpcode() == ISD::CALLSEQ_START) return Node;
402
403 assert(Node->getOperand(0).getValueType() == MVT::Other &&
404 "Node doesn't have a token chain argument!");
405 return FindCallStartFromCallEnd(Node->getOperand(0).Val);
406}
407
408/// LegalizeAllNodesNotLeadingTo - Recursively walk the uses of N, looking to
409/// see if any uses can reach Dest. If no dest operands can get to dest,
410/// legalize them, legalize ourself, and return false, otherwise, return true.
Chris Lattnerc9cf4f12006-07-26 23:55:56 +0000411///
412/// Keep track of the nodes we fine that actually do lead to Dest in
413/// NodesLeadingTo. This avoids retraversing them exponential number of times.
414///
415bool SelectionDAGLegalize::LegalizeAllNodesNotLeadingTo(SDNode *N, SDNode *Dest,
416 std::set<SDNode*> &NodesLeadingTo) {
Chris Lattner6831a812006-02-13 09:18:02 +0000417 if (N == Dest) return true; // N certainly leads to Dest :)
418
Chris Lattnerc9cf4f12006-07-26 23:55:56 +0000419 // If we've already processed this node and it does lead to Dest, there is no
420 // need to reprocess it.
421 if (NodesLeadingTo.count(N)) return true;
422
Chris Lattner6831a812006-02-13 09:18:02 +0000423 // If the first result of this node has been already legalized, then it cannot
424 // reach N.
425 switch (getTypeAction(N->getValueType(0))) {
426 case Legal:
427 if (LegalizedNodes.count(SDOperand(N, 0))) return false;
428 break;
429 case Promote:
430 if (PromotedNodes.count(SDOperand(N, 0))) return false;
431 break;
432 case Expand:
433 if (ExpandedNodes.count(SDOperand(N, 0))) return false;
434 break;
435 }
436
437 // Okay, this node has not already been legalized. Check and legalize all
438 // operands. If none lead to Dest, then we can legalize this node.
439 bool OperandsLeadToDest = false;
440 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i)
441 OperandsLeadToDest |= // If an operand leads to Dest, so do we.
Chris Lattnerc9cf4f12006-07-26 23:55:56 +0000442 LegalizeAllNodesNotLeadingTo(N->getOperand(i).Val, Dest, NodesLeadingTo);
Chris Lattner6831a812006-02-13 09:18:02 +0000443
Chris Lattnerc9cf4f12006-07-26 23:55:56 +0000444 if (OperandsLeadToDest) {
445 NodesLeadingTo.insert(N);
446 return true;
447 }
Chris Lattner6831a812006-02-13 09:18:02 +0000448
449 // Okay, this node looks safe, legalize it and return false.
Chris Lattner80edfb32006-04-17 22:10:08 +0000450 HandleOp(SDOperand(N, 0));
Chris Lattner6831a812006-02-13 09:18:02 +0000451 return false;
452}
453
Chris Lattnerc7029802006-03-18 01:44:44 +0000454/// HandleOp - Legalize, Promote, Expand or Pack the specified operand as
455/// appropriate for its type.
456void SelectionDAGLegalize::HandleOp(SDOperand Op) {
457 switch (getTypeAction(Op.getValueType())) {
458 default: assert(0 && "Bad type action!");
459 case Legal: LegalizeOp(Op); break;
460 case Promote: PromoteOp(Op); break;
461 case Expand:
462 if (Op.getValueType() != MVT::Vector) {
463 SDOperand X, Y;
464 ExpandOp(Op, X, Y);
465 } else {
466 SDNode *N = Op.Val;
467 unsigned NumOps = N->getNumOperands();
468 unsigned NumElements =
469 cast<ConstantSDNode>(N->getOperand(NumOps-2))->getValue();
470 MVT::ValueType EVT = cast<VTSDNode>(N->getOperand(NumOps-1))->getVT();
471 MVT::ValueType PackedVT = getVectorType(EVT, NumElements);
472 if (PackedVT != MVT::Other && TLI.isTypeLegal(PackedVT)) {
473 // In the common case, this is a legal vector type, convert it to the
474 // packed operation and type now.
475 PackVectorOp(Op, PackedVT);
476 } else if (NumElements == 1) {
477 // Otherwise, if this is a single element vector, convert it to a
478 // scalar operation.
479 PackVectorOp(Op, EVT);
480 } else {
481 // Otherwise, this is a multiple element vector that isn't supported.
482 // Split it in half and legalize both parts.
483 SDOperand X, Y;
Chris Lattner4794a6b2006-03-19 00:07:49 +0000484 SplitVectorOp(Op, X, Y);
Chris Lattnerc7029802006-03-18 01:44:44 +0000485 }
486 }
487 break;
488 }
489}
Chris Lattner6831a812006-02-13 09:18:02 +0000490
491
Chris Lattnerc7029802006-03-18 01:44:44 +0000492/// LegalizeOp - We know that the specified value has a legal type.
493/// Recursively ensure that the operands have legal types, then return the
494/// result.
Chris Lattner3e928bb2005-01-07 07:47:09 +0000495SDOperand SelectionDAGLegalize::LegalizeOp(SDOperand Op) {
Chris Lattnerc9c60f62005-08-24 16:35:28 +0000496 assert(isTypeLegal(Op.getValueType()) &&
Chris Lattnere3304a32005-01-08 20:35:13 +0000497 "Caller should expand or promote operands that are not legal!");
Chris Lattner45982da2005-05-12 16:53:42 +0000498 SDNode *Node = Op.Val;
Chris Lattnere3304a32005-01-08 20:35:13 +0000499
Chris Lattner3e928bb2005-01-07 07:47:09 +0000500 // If this operation defines any values that cannot be represented in a
Chris Lattnere3304a32005-01-08 20:35:13 +0000501 // register on this target, make sure to expand or promote them.
Chris Lattner45982da2005-05-12 16:53:42 +0000502 if (Node->getNumValues() > 1) {
503 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
Chris Lattnerc7029802006-03-18 01:44:44 +0000504 if (getTypeAction(Node->getValueType(i)) != Legal) {
505 HandleOp(Op.getValue(i));
Chris Lattner3e928bb2005-01-07 07:47:09 +0000506 assert(LegalizedNodes.count(Op) &&
Chris Lattnerc7029802006-03-18 01:44:44 +0000507 "Handling didn't add legal operands!");
Chris Lattner03c85462005-01-15 05:21:40 +0000508 return LegalizedNodes[Op];
Chris Lattner3e928bb2005-01-07 07:47:09 +0000509 }
510 }
511
Chris Lattner45982da2005-05-12 16:53:42 +0000512 // Note that LegalizeOp may be reentered even from single-use nodes, which
513 // means that we always must cache transformed nodes.
Chris Lattnere1bd8222005-01-11 05:57:22 +0000514 std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
515 if (I != LegalizedNodes.end()) return I->second;
Chris Lattner3e928bb2005-01-07 07:47:09 +0000516
Nate Begeman9373a812005-08-10 20:51:12 +0000517 SDOperand Tmp1, Tmp2, Tmp3, Tmp4;
Chris Lattner3e928bb2005-01-07 07:47:09 +0000518 SDOperand Result = Op;
Chris Lattner456a93a2006-01-28 07:39:30 +0000519 bool isCustom = false;
520
Chris Lattner3e928bb2005-01-07 07:47:09 +0000521 switch (Node->getOpcode()) {
Chris Lattner948c1b12006-01-28 08:31:04 +0000522 case ISD::FrameIndex:
523 case ISD::EntryToken:
524 case ISD::Register:
525 case ISD::BasicBlock:
526 case ISD::TargetFrameIndex:
Nate Begeman37efe672006-04-22 18:53:45 +0000527 case ISD::TargetJumpTable:
Chris Lattner948c1b12006-01-28 08:31:04 +0000528 case ISD::TargetConstant:
Chris Lattner3181a772006-01-29 06:26:56 +0000529 case ISD::TargetConstantFP:
Chris Lattner948c1b12006-01-28 08:31:04 +0000530 case ISD::TargetConstantPool:
531 case ISD::TargetGlobalAddress:
532 case ISD::TargetExternalSymbol:
533 case ISD::VALUETYPE:
534 case ISD::SRCVALUE:
535 case ISD::STRING:
536 case ISD::CONDCODE:
537 // Primitives must all be legal.
538 assert(TLI.isOperationLegal(Node->getValueType(0), Node->getValueType(0)) &&
539 "This must be legal!");
540 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +0000541 default:
Chris Lattnerd73cc5d2005-05-14 06:34:48 +0000542 if (Node->getOpcode() >= ISD::BUILTIN_OP_END) {
543 // If this is a target node, legalize it by legalizing the operands then
544 // passing it through.
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000545 SmallVector<SDOperand, 8> Ops;
Chris Lattnerc5d7d7c2006-05-17 18:00:08 +0000546 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
Chris Lattnerd73cc5d2005-05-14 06:34:48 +0000547 Ops.push_back(LegalizeOp(Node->getOperand(i)));
Chris Lattnerc5d7d7c2006-05-17 18:00:08 +0000548
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000549 Result = DAG.UpdateNodeOperands(Result.getValue(0), &Ops[0], Ops.size());
Chris Lattnerd73cc5d2005-05-14 06:34:48 +0000550
551 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
552 AddLegalizedOperand(Op.getValue(i), Result.getValue(i));
553 return Result.getValue(Op.ResNo);
554 }
555 // Otherwise this is an unhandled builtin node. splat.
Jim Laskeye37fe9b2006-07-11 17:58:07 +0000556#ifndef NDEBUG
Chris Lattner3e928bb2005-01-07 07:47:09 +0000557 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
Jim Laskeye37fe9b2006-07-11 17:58:07 +0000558#endif
Chris Lattner3e928bb2005-01-07 07:47:09 +0000559 assert(0 && "Do not know how to legalize this operator!");
560 abort();
Andrew Lenharthbeec30e2006-09-24 19:45:58 +0000561 case ISD::JumpTableRelocBase:
562 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
563 case TargetLowering::Custom:
564 Tmp1 = TLI.LowerOperation(Op, DAG);
565 if (Tmp1.Val) Result = Tmp1;
566 break;
567 default:
568 Result = LegalizeOp(Node->getOperand(0));
569 break;
570 }
571 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +0000572 case ISD::GlobalAddress:
Chris Lattner03c0cf82005-01-07 21:45:56 +0000573 case ISD::ExternalSymbol:
Nate Begeman37efe672006-04-22 18:53:45 +0000574 case ISD::ConstantPool:
575 case ISD::JumpTable: // Nothing to do.
Chris Lattner0c8fbe32005-11-17 06:41:44 +0000576 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
577 default: assert(0 && "This action is not supported yet!");
Chris Lattner948c1b12006-01-28 08:31:04 +0000578 case TargetLowering::Custom:
579 Tmp1 = TLI.LowerOperation(Op, DAG);
580 if (Tmp1.Val) Result = Tmp1;
581 // FALLTHROUGH if the target doesn't want to lower this op after all.
Chris Lattner0c8fbe32005-11-17 06:41:44 +0000582 case TargetLowering::Legal:
Chris Lattner0c8fbe32005-11-17 06:41:44 +0000583 break;
584 }
Chris Lattner3e928bb2005-01-07 07:47:09 +0000585 break;
Chris Lattner08951a32005-09-02 01:15:01 +0000586 case ISD::AssertSext:
587 case ISD::AssertZext:
588 Tmp1 = LegalizeOp(Node->getOperand(0));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000589 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
Chris Lattner08951a32005-09-02 01:15:01 +0000590 break;
Chris Lattner308575b2005-11-20 22:56:56 +0000591 case ISD::MERGE_VALUES:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000592 // Legalize eliminates MERGE_VALUES nodes.
Chris Lattner456a93a2006-01-28 07:39:30 +0000593 Result = Node->getOperand(Op.ResNo);
594 break;
Chris Lattner69a52152005-01-14 22:38:01 +0000595 case ISD::CopyFromReg:
596 Tmp1 = LegalizeOp(Node->getOperand(0));
Chris Lattner7310fb12005-12-18 15:27:43 +0000597 Result = Op.getValue(0);
Chris Lattnerf1a47c32005-12-18 15:36:21 +0000598 if (Node->getNumValues() == 2) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000599 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
Chris Lattner7310fb12005-12-18 15:27:43 +0000600 } else {
Chris Lattnerf1a47c32005-12-18 15:36:21 +0000601 assert(Node->getNumValues() == 3 && "Invalid copyfromreg!");
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000602 if (Node->getNumOperands() == 3) {
Chris Lattnerf1a47c32005-12-18 15:36:21 +0000603 Tmp2 = LegalizeOp(Node->getOperand(2));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000604 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
605 } else {
606 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
607 }
Chris Lattner7310fb12005-12-18 15:27:43 +0000608 AddLegalizedOperand(Op.getValue(2), Result.getValue(2));
609 }
Chris Lattner13c184d2005-01-28 06:27:38 +0000610 // Since CopyFromReg produces two values, make sure to remember that we
611 // legalized both of them.
612 AddLegalizedOperand(Op.getValue(0), Result);
613 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
614 return Result.getValue(Op.ResNo);
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000615 case ISD::UNDEF: {
616 MVT::ValueType VT = Op.getValueType();
617 switch (TLI.getOperationAction(ISD::UNDEF, VT)) {
Nate Begemanea19cd52005-04-02 00:41:14 +0000618 default: assert(0 && "This action is not supported yet!");
619 case TargetLowering::Expand:
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000620 if (MVT::isInteger(VT))
621 Result = DAG.getConstant(0, VT);
622 else if (MVT::isFloatingPoint(VT))
623 Result = DAG.getConstantFP(0, VT);
624 else
625 assert(0 && "Unknown value type!");
626 break;
Nate Begemanea19cd52005-04-02 00:41:14 +0000627 case TargetLowering::Legal:
Nate Begemanfc1b1da2005-04-01 22:34:39 +0000628 break;
629 }
630 break;
631 }
Chris Lattnerd1f04d42006-03-24 02:26:29 +0000632
Chris Lattner48b61a72006-03-28 00:40:33 +0000633 case ISD::INTRINSIC_W_CHAIN:
634 case ISD::INTRINSIC_WO_CHAIN:
635 case ISD::INTRINSIC_VOID: {
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000636 SmallVector<SDOperand, 8> Ops;
Chris Lattnerd1f04d42006-03-24 02:26:29 +0000637 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
638 Ops.push_back(LegalizeOp(Node->getOperand(i)));
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000639 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattner10d7fa62006-03-26 09:12:51 +0000640
641 // Allow the target to custom lower its intrinsics if it wants to.
Chris Lattner48b61a72006-03-28 00:40:33 +0000642 if (TLI.getOperationAction(Node->getOpcode(), MVT::Other) ==
Chris Lattner10d7fa62006-03-26 09:12:51 +0000643 TargetLowering::Custom) {
644 Tmp3 = TLI.LowerOperation(Result, DAG);
645 if (Tmp3.Val) Result = Tmp3;
Chris Lattner13fc2f12006-03-27 20:28:29 +0000646 }
647
648 if (Result.Val->getNumValues() == 1) break;
649
650 // Must have return value and chain result.
651 assert(Result.Val->getNumValues() == 2 &&
652 "Cannot return more than two values!");
653
654 // Since loads produce two values, make sure to remember that we
655 // legalized both of them.
656 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
657 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
658 return Result.getValue(Op.ResNo);
Chris Lattnerd1f04d42006-03-24 02:26:29 +0000659 }
Chris Lattner36ce6912005-11-29 06:21:05 +0000660
661 case ISD::LOCATION:
662 assert(Node->getNumOperands() == 5 && "Invalid LOCATION node!");
663 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input chain.
664
665 switch (TLI.getOperationAction(ISD::LOCATION, MVT::Other)) {
666 case TargetLowering::Promote:
667 default: assert(0 && "This action is not supported yet!");
Jim Laskeyf5395ce2005-12-16 22:45:29 +0000668 case TargetLowering::Expand: {
Jim Laskeyb2efb852006-01-04 22:28:25 +0000669 MachineDebugInfo *DebugInfo = DAG.getMachineDebugInfo();
Jim Laskeyabf6d172006-01-05 01:25:28 +0000670 bool useDEBUG_LOC = TLI.isOperationLegal(ISD::DEBUG_LOC, MVT::Other);
671 bool useDEBUG_LABEL = TLI.isOperationLegal(ISD::DEBUG_LABEL, MVT::Other);
672
673 if (DebugInfo && (useDEBUG_LOC || useDEBUG_LABEL)) {
674 const std::string &FName =
675 cast<StringSDNode>(Node->getOperand(3))->getValue();
676 const std::string &DirName =
677 cast<StringSDNode>(Node->getOperand(4))->getValue();
Jim Laskey063e7652006-01-17 17:31:53 +0000678 unsigned SrcFile = DebugInfo->RecordSource(DirName, FName);
Jim Laskeyabf6d172006-01-05 01:25:28 +0000679
Chris Lattnerbd564bf2006-08-08 02:23:42 +0000680 SmallVector<SDOperand, 8> Ops;
Jim Laskeye81aecb2005-12-21 20:51:37 +0000681 Ops.push_back(Tmp1); // chain
Jim Laskeyabf6d172006-01-05 01:25:28 +0000682 SDOperand LineOp = Node->getOperand(1);
683 SDOperand ColOp = Node->getOperand(2);
684
685 if (useDEBUG_LOC) {
686 Ops.push_back(LineOp); // line #
687 Ops.push_back(ColOp); // col #
688 Ops.push_back(DAG.getConstant(SrcFile, MVT::i32)); // source file id
Chris Lattnerbd564bf2006-08-08 02:23:42 +0000689 Result = DAG.getNode(ISD::DEBUG_LOC, MVT::Other, &Ops[0], Ops.size());
Jim Laskeyabf6d172006-01-05 01:25:28 +0000690 } else {
Jim Laskeyd0e58e32006-02-15 19:34:44 +0000691 unsigned Line = cast<ConstantSDNode>(LineOp)->getValue();
692 unsigned Col = cast<ConstantSDNode>(ColOp)->getValue();
Jim Laskeyabf6d172006-01-05 01:25:28 +0000693 unsigned ID = DebugInfo->RecordLabel(Line, Col, SrcFile);
694 Ops.push_back(DAG.getConstant(ID, MVT::i32));
Chris Lattnerbd564bf2006-08-08 02:23:42 +0000695 Result = DAG.getNode(ISD::DEBUG_LABEL, MVT::Other,&Ops[0],Ops.size());
Jim Laskeyabf6d172006-01-05 01:25:28 +0000696 }
Jim Laskeye81aecb2005-12-21 20:51:37 +0000697 } else {
698 Result = Tmp1; // chain
699 }
Chris Lattner36ce6912005-11-29 06:21:05 +0000700 break;
Chris Lattnere7736732005-12-18 23:54:29 +0000701 }
Chris Lattner36ce6912005-11-29 06:21:05 +0000702 case TargetLowering::Legal:
Chris Lattner9ad17c92005-12-01 18:21:35 +0000703 if (Tmp1 != Node->getOperand(0) ||
704 getTypeAction(Node->getOperand(1).getValueType()) == Promote) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000705 SmallVector<SDOperand, 8> Ops;
Chris Lattner36ce6912005-11-29 06:21:05 +0000706 Ops.push_back(Tmp1);
Chris Lattner9ad17c92005-12-01 18:21:35 +0000707 if (getTypeAction(Node->getOperand(1).getValueType()) == Legal) {
708 Ops.push_back(Node->getOperand(1)); // line # must be legal.
709 Ops.push_back(Node->getOperand(2)); // col # must be legal.
710 } else {
711 // Otherwise promote them.
712 Ops.push_back(PromoteOp(Node->getOperand(1)));
713 Ops.push_back(PromoteOp(Node->getOperand(2)));
714 }
Chris Lattner36ce6912005-11-29 06:21:05 +0000715 Ops.push_back(Node->getOperand(3)); // filename must be legal.
716 Ops.push_back(Node->getOperand(4)); // working dir # must be legal.
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000717 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattner36ce6912005-11-29 06:21:05 +0000718 }
719 break;
720 }
721 break;
Jim Laskeyf5395ce2005-12-16 22:45:29 +0000722
723 case ISD::DEBUG_LOC:
Jim Laskeyabf6d172006-01-05 01:25:28 +0000724 assert(Node->getNumOperands() == 4 && "Invalid DEBUG_LOC node!");
Jim Laskeyf5395ce2005-12-16 22:45:29 +0000725 switch (TLI.getOperationAction(ISD::DEBUG_LOC, MVT::Other)) {
Jim Laskeyf5395ce2005-12-16 22:45:29 +0000726 default: assert(0 && "This action is not supported yet!");
Jim Laskeyabf6d172006-01-05 01:25:28 +0000727 case TargetLowering::Legal:
728 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
729 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the line #.
730 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the col #.
731 Tmp4 = LegalizeOp(Node->getOperand(3)); // Legalize the source file id.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000732 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4);
Jim Laskeyabf6d172006-01-05 01:25:28 +0000733 break;
734 }
735 break;
736
737 case ISD::DEBUG_LABEL:
738 assert(Node->getNumOperands() == 2 && "Invalid DEBUG_LABEL node!");
739 switch (TLI.getOperationAction(ISD::DEBUG_LABEL, MVT::Other)) {
Jim Laskeyabf6d172006-01-05 01:25:28 +0000740 default: assert(0 && "This action is not supported yet!");
741 case TargetLowering::Legal:
742 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
743 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the label id.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000744 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
Jim Laskeyf5395ce2005-12-16 22:45:29 +0000745 break;
746 }
Nate Begeman551bf3f2006-02-17 05:43:56 +0000747 break;
Chris Lattner36ce6912005-11-29 06:21:05 +0000748
Chris Lattner3e928bb2005-01-07 07:47:09 +0000749 case ISD::Constant:
750 // We know we don't need to expand constants here, constants only have one
751 // value and we check that it is fine above.
752
753 // FIXME: Maybe we should handle things like targets that don't support full
754 // 32-bit immediates?
755 break;
756 case ISD::ConstantFP: {
757 // Spill FP immediates to the constant pool if the target cannot directly
758 // codegen them. Targets often have some immediate values that can be
759 // efficiently generated into an FP register without a load. We explicitly
760 // leave these constants as ConstantFP nodes for the target to deal with.
Chris Lattner3e928bb2005-01-07 07:47:09 +0000761 ConstantFPSDNode *CFP = cast<ConstantFPSDNode>(Node);
762
763 // Check to see if this FP immediate is already legal.
764 bool isLegal = false;
765 for (TargetLowering::legal_fpimm_iterator I = TLI.legal_fpimm_begin(),
766 E = TLI.legal_fpimm_end(); I != E; ++I)
767 if (CFP->isExactlyValue(*I)) {
768 isLegal = true;
769 break;
770 }
771
Chris Lattner3181a772006-01-29 06:26:56 +0000772 // If this is a legal constant, turn it into a TargetConstantFP node.
773 if (isLegal) {
774 Result = DAG.getTargetConstantFP(CFP->getValue(), CFP->getValueType(0));
775 break;
776 }
777
778 switch (TLI.getOperationAction(ISD::ConstantFP, CFP->getValueType(0))) {
779 default: assert(0 && "This action is not supported yet!");
780 case TargetLowering::Custom:
781 Tmp3 = TLI.LowerOperation(Result, DAG);
782 if (Tmp3.Val) {
783 Result = Tmp3;
784 break;
785 }
786 // FALLTHROUGH
787 case TargetLowering::Expand:
Chris Lattner3e928bb2005-01-07 07:47:09 +0000788 // Otherwise we need to spill the constant to memory.
Chris Lattner3e928bb2005-01-07 07:47:09 +0000789 bool Extend = false;
790
Chris Lattner456a93a2006-01-28 07:39:30 +0000791 // If a FP immediate is precise when represented as a float and if the
792 // target can do an extending load from float to double, we put it into
793 // the constant pool as a float, even if it's is statically typed as a
794 // double.
Chris Lattner3e928bb2005-01-07 07:47:09 +0000795 MVT::ValueType VT = CFP->getValueType(0);
796 bool isDouble = VT == MVT::f64;
797 ConstantFP *LLVMC = ConstantFP::get(isDouble ? Type::DoubleTy :
798 Type::FloatTy, CFP->getValue());
Chris Lattner99939d32005-01-28 22:58:25 +0000799 if (isDouble && CFP->isExactlyValue((float)CFP->getValue()) &&
800 // Only do this if the target has a native EXTLOAD instruction from
801 // f32.
Evan Chengc5484282006-10-04 00:56:09 +0000802 TLI.isLoadXLegal(ISD::EXTLOAD, MVT::f32)) {
Chris Lattner3e928bb2005-01-07 07:47:09 +0000803 LLVMC = cast<ConstantFP>(ConstantExpr::getCast(LLVMC, Type::FloatTy));
804 VT = MVT::f32;
805 Extend = true;
806 }
Misha Brukmanedf128a2005-04-21 22:36:52 +0000807
Chris Lattner456a93a2006-01-28 07:39:30 +0000808 SDOperand CPIdx = DAG.getConstantPool(LLVMC, TLI.getPointerTy());
Chris Lattnerf8161d82005-01-16 05:06:12 +0000809 if (Extend) {
Chris Lattner5f056bf2005-07-10 01:55:33 +0000810 Result = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
811 CPIdx, DAG.getSrcValue(NULL), MVT::f32);
Chris Lattnerf8161d82005-01-16 05:06:12 +0000812 } else {
Chris Lattner52d08bd2005-05-09 20:23:03 +0000813 Result = DAG.getLoad(VT, DAG.getEntryNode(), CPIdx,
814 DAG.getSrcValue(NULL));
Chris Lattnerf8161d82005-01-16 05:06:12 +0000815 }
Chris Lattner3e928bb2005-01-07 07:47:09 +0000816 }
817 break;
818 }
Chris Lattner040c11c2005-11-09 18:48:57 +0000819 case ISD::TokenFactor:
820 if (Node->getNumOperands() == 2) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000821 Tmp1 = LegalizeOp(Node->getOperand(0));
822 Tmp2 = LegalizeOp(Node->getOperand(1));
823 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
824 } else if (Node->getNumOperands() == 3) {
825 Tmp1 = LegalizeOp(Node->getOperand(0));
826 Tmp2 = LegalizeOp(Node->getOperand(1));
827 Tmp3 = LegalizeOp(Node->getOperand(2));
828 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
Chris Lattner040c11c2005-11-09 18:48:57 +0000829 } else {
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000830 SmallVector<SDOperand, 8> Ops;
Chris Lattner040c11c2005-11-09 18:48:57 +0000831 // Legalize the operands.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +0000832 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i)
833 Ops.push_back(LegalizeOp(Node->getOperand(i)));
Chris Lattnerf06f35e2006-08-08 01:09:31 +0000834 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattnera385e9b2005-01-13 17:59:25 +0000835 }
Chris Lattnera385e9b2005-01-13 17:59:25 +0000836 break;
Chris Lattnerfdfded52006-04-12 16:20:43 +0000837
838 case ISD::FORMAL_ARGUMENTS:
Chris Lattnerf4ec8172006-05-16 22:53:20 +0000839 case ISD::CALL:
Chris Lattnerfdfded52006-04-12 16:20:43 +0000840 // The only option for this is to custom lower it.
Chris Lattnerb248e162006-05-17 17:55:45 +0000841 Tmp3 = TLI.LowerOperation(Result.getValue(0), DAG);
842 assert(Tmp3.Val && "Target didn't custom lower this node!");
843 assert(Tmp3.Val->getNumValues() == Result.Val->getNumValues() &&
844 "Lowering call/formal_arguments produced unexpected # results!");
Chris Lattnere2e41732006-05-16 05:49:56 +0000845
Chris Lattnerf4ec8172006-05-16 22:53:20 +0000846 // Since CALL/FORMAL_ARGUMENTS nodes produce multiple values, make sure to
Chris Lattnere2e41732006-05-16 05:49:56 +0000847 // remember that we legalized all of them, so it doesn't get relegalized.
Chris Lattnerb248e162006-05-17 17:55:45 +0000848 for (unsigned i = 0, e = Tmp3.Val->getNumValues(); i != e; ++i) {
849 Tmp1 = LegalizeOp(Tmp3.getValue(i));
Chris Lattnere2e41732006-05-16 05:49:56 +0000850 if (Op.ResNo == i)
851 Tmp2 = Tmp1;
852 AddLegalizedOperand(SDOperand(Node, i), Tmp1);
853 }
854 return Tmp2;
Chris Lattnerfdfded52006-04-12 16:20:43 +0000855
Chris Lattnerb2827b02006-03-19 00:52:58 +0000856 case ISD::BUILD_VECTOR:
857 switch (TLI.getOperationAction(ISD::BUILD_VECTOR, Node->getValueType(0))) {
Chris Lattner2332b9f2006-03-19 01:17:20 +0000858 default: assert(0 && "This action is not supported yet!");
859 case TargetLowering::Custom:
860 Tmp3 = TLI.LowerOperation(Result, DAG);
861 if (Tmp3.Val) {
862 Result = Tmp3;
863 break;
864 }
865 // FALLTHROUGH
Chris Lattnerce872152006-03-19 06:31:19 +0000866 case TargetLowering::Expand:
867 Result = ExpandBUILD_VECTOR(Result.Val);
Chris Lattnerb2827b02006-03-19 00:52:58 +0000868 break;
Chris Lattner2332b9f2006-03-19 01:17:20 +0000869 }
Chris Lattner2332b9f2006-03-19 01:17:20 +0000870 break;
871 case ISD::INSERT_VECTOR_ELT:
872 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVec
873 Tmp2 = LegalizeOp(Node->getOperand(1)); // InVal
874 Tmp3 = LegalizeOp(Node->getOperand(2)); // InEltNo
875 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
876
877 switch (TLI.getOperationAction(ISD::INSERT_VECTOR_ELT,
878 Node->getValueType(0))) {
879 default: assert(0 && "This action is not supported yet!");
880 case TargetLowering::Legal:
881 break;
882 case TargetLowering::Custom:
883 Tmp3 = TLI.LowerOperation(Result, DAG);
884 if (Tmp3.Val) {
885 Result = Tmp3;
886 break;
887 }
888 // FALLTHROUGH
889 case TargetLowering::Expand: {
Chris Lattner8d5a8942006-04-17 19:21:01 +0000890 // If the insert index is a constant, codegen this as a scalar_to_vector,
891 // then a shuffle that inserts it into the right position in the vector.
892 if (ConstantSDNode *InsertPos = dyn_cast<ConstantSDNode>(Tmp3)) {
893 SDOperand ScVec = DAG.getNode(ISD::SCALAR_TO_VECTOR,
894 Tmp1.getValueType(), Tmp2);
895
896 unsigned NumElts = MVT::getVectorNumElements(Tmp1.getValueType());
897 MVT::ValueType ShufMaskVT = MVT::getIntVectorWithNumElements(NumElts);
898 MVT::ValueType ShufMaskEltVT = MVT::getVectorBaseType(ShufMaskVT);
899
900 // We generate a shuffle of InVec and ScVec, so the shuffle mask should
901 // be 0,1,2,3,4,5... with the appropriate element replaced with elt 0 of
902 // the RHS.
Chris Lattnerbd564bf2006-08-08 02:23:42 +0000903 SmallVector<SDOperand, 8> ShufOps;
Chris Lattner8d5a8942006-04-17 19:21:01 +0000904 for (unsigned i = 0; i != NumElts; ++i) {
905 if (i != InsertPos->getValue())
906 ShufOps.push_back(DAG.getConstant(i, ShufMaskEltVT));
907 else
908 ShufOps.push_back(DAG.getConstant(NumElts, ShufMaskEltVT));
909 }
Chris Lattnerbd564bf2006-08-08 02:23:42 +0000910 SDOperand ShufMask = DAG.getNode(ISD::BUILD_VECTOR, ShufMaskVT,
911 &ShufOps[0], ShufOps.size());
Chris Lattner8d5a8942006-04-17 19:21:01 +0000912
913 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, Tmp1.getValueType(),
914 Tmp1, ScVec, ShufMask);
915 Result = LegalizeOp(Result);
916 break;
917 }
918
Chris Lattner2332b9f2006-03-19 01:17:20 +0000919 // If the target doesn't support this, we have to spill the input vector
920 // to a temporary stack slot, update the element, then reload it. This is
921 // badness. We could also load the value into a vector register (either
922 // with a "move to register" or "extload into register" instruction, then
923 // permute it into place, if the idx is a constant and if the idx is
924 // supported by the target.
Evan Chengf6bf87f2006-04-08 01:46:37 +0000925 MVT::ValueType VT = Tmp1.getValueType();
926 MVT::ValueType EltVT = Tmp2.getValueType();
927 MVT::ValueType IdxVT = Tmp3.getValueType();
928 MVT::ValueType PtrVT = TLI.getPointerTy();
929 SDOperand StackPtr = CreateStackTemporary(VT);
Evan Chengeb0b4612006-03-31 01:27:51 +0000930 // Store the vector.
931 SDOperand Ch = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
932 Tmp1, StackPtr, DAG.getSrcValue(NULL));
933
934 // Truncate or zero extend offset to target pointer type.
Evan Chengf6bf87f2006-04-08 01:46:37 +0000935 unsigned CastOpc = (IdxVT > PtrVT) ? ISD::TRUNCATE : ISD::ZERO_EXTEND;
936 Tmp3 = DAG.getNode(CastOpc, PtrVT, Tmp3);
Evan Chengeb0b4612006-03-31 01:27:51 +0000937 // Add the offset to the index.
Evan Chengf6bf87f2006-04-08 01:46:37 +0000938 unsigned EltSize = MVT::getSizeInBits(EltVT)/8;
939 Tmp3 = DAG.getNode(ISD::MUL, IdxVT, Tmp3,DAG.getConstant(EltSize, IdxVT));
940 SDOperand StackPtr2 = DAG.getNode(ISD::ADD, IdxVT, Tmp3, StackPtr);
Evan Chengeb0b4612006-03-31 01:27:51 +0000941 // Store the scalar value.
942 Ch = DAG.getNode(ISD::STORE, MVT::Other, Ch,
943 Tmp2, StackPtr2, DAG.getSrcValue(NULL));
944 // Load the updated vector.
Evan Chengf6bf87f2006-04-08 01:46:37 +0000945 Result = DAG.getLoad(VT, Ch, StackPtr, DAG.getSrcValue(NULL));
Chris Lattner2332b9f2006-03-19 01:17:20 +0000946 break;
947 }
948 }
949 break;
Chris Lattnerce872152006-03-19 06:31:19 +0000950 case ISD::SCALAR_TO_VECTOR:
Chris Lattner4352cc92006-04-04 17:23:26 +0000951 if (!TLI.isTypeLegal(Node->getOperand(0).getValueType())) {
952 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
953 break;
954 }
955
Chris Lattnerce872152006-03-19 06:31:19 +0000956 Tmp1 = LegalizeOp(Node->getOperand(0)); // InVal
957 Result = DAG.UpdateNodeOperands(Result, Tmp1);
958 switch (TLI.getOperationAction(ISD::SCALAR_TO_VECTOR,
959 Node->getValueType(0))) {
960 default: assert(0 && "This action is not supported yet!");
961 case TargetLowering::Legal:
962 break;
Chris Lattner4d3abee2006-03-19 06:47:21 +0000963 case TargetLowering::Custom:
964 Tmp3 = TLI.LowerOperation(Result, DAG);
965 if (Tmp3.Val) {
966 Result = Tmp3;
967 break;
968 }
969 // FALLTHROUGH
Chris Lattner4352cc92006-04-04 17:23:26 +0000970 case TargetLowering::Expand:
971 Result = LegalizeOp(ExpandSCALAR_TO_VECTOR(Node));
Chris Lattnerce872152006-03-19 06:31:19 +0000972 break;
973 }
Chris Lattnerce872152006-03-19 06:31:19 +0000974 break;
Chris Lattner87100e02006-03-20 01:52:29 +0000975 case ISD::VECTOR_SHUFFLE:
Chris Lattner87100e02006-03-20 01:52:29 +0000976 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the input vectors,
977 Tmp2 = LegalizeOp(Node->getOperand(1)); // but not the shuffle mask.
978 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
979
980 // Allow targets to custom lower the SHUFFLEs they support.
Chris Lattner4352cc92006-04-04 17:23:26 +0000981 switch (TLI.getOperationAction(ISD::VECTOR_SHUFFLE,Result.getValueType())) {
982 default: assert(0 && "Unknown operation action!");
983 case TargetLowering::Legal:
984 assert(isShuffleLegal(Result.getValueType(), Node->getOperand(2)) &&
985 "vector shuffle should not be created if not legal!");
986 break;
987 case TargetLowering::Custom:
Evan Cheng18dd6d02006-04-05 06:07:11 +0000988 Tmp3 = TLI.LowerOperation(Result, DAG);
989 if (Tmp3.Val) {
990 Result = Tmp3;
991 break;
992 }
993 // FALLTHROUGH
994 case TargetLowering::Expand: {
995 MVT::ValueType VT = Node->getValueType(0);
996 MVT::ValueType EltVT = MVT::getVectorBaseType(VT);
997 MVT::ValueType PtrVT = TLI.getPointerTy();
998 SDOperand Mask = Node->getOperand(2);
999 unsigned NumElems = Mask.getNumOperands();
Chris Lattnerbd564bf2006-08-08 02:23:42 +00001000 SmallVector<SDOperand,8> Ops;
Evan Cheng18dd6d02006-04-05 06:07:11 +00001001 for (unsigned i = 0; i != NumElems; ++i) {
1002 SDOperand Arg = Mask.getOperand(i);
1003 if (Arg.getOpcode() == ISD::UNDEF) {
1004 Ops.push_back(DAG.getNode(ISD::UNDEF, EltVT));
1005 } else {
1006 assert(isa<ConstantSDNode>(Arg) && "Invalid VECTOR_SHUFFLE mask!");
1007 unsigned Idx = cast<ConstantSDNode>(Arg)->getValue();
1008 if (Idx < NumElems)
1009 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1,
1010 DAG.getConstant(Idx, PtrVT)));
1011 else
1012 Ops.push_back(DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2,
1013 DAG.getConstant(Idx - NumElems, PtrVT)));
1014 }
1015 }
Chris Lattnerbd564bf2006-08-08 02:23:42 +00001016 Result = DAG.getNode(ISD::BUILD_VECTOR, VT, &Ops[0], Ops.size());
Chris Lattner4352cc92006-04-04 17:23:26 +00001017 break;
Evan Cheng18dd6d02006-04-05 06:07:11 +00001018 }
Chris Lattner4352cc92006-04-04 17:23:26 +00001019 case TargetLowering::Promote: {
1020 // Change base type to a different vector type.
1021 MVT::ValueType OVT = Node->getValueType(0);
1022 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
1023
1024 // Cast the two input vectors.
1025 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
1026 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
1027
1028 // Convert the shuffle mask to the right # elements.
1029 Tmp3 = SDOperand(isShuffleLegal(OVT, Node->getOperand(2)), 0);
1030 assert(Tmp3.Val && "Shuffle not legal?");
1031 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NVT, Tmp1, Tmp2, Tmp3);
1032 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
1033 break;
1034 }
Chris Lattner87100e02006-03-20 01:52:29 +00001035 }
1036 break;
Chris Lattner384504c2006-03-21 20:44:12 +00001037
1038 case ISD::EXTRACT_VECTOR_ELT:
1039 Tmp1 = LegalizeOp(Node->getOperand(0));
1040 Tmp2 = LegalizeOp(Node->getOperand(1));
1041 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
Chris Lattnere35c2182006-03-21 21:02:03 +00001042
1043 switch (TLI.getOperationAction(ISD::EXTRACT_VECTOR_ELT,
1044 Tmp1.getValueType())) {
1045 default: assert(0 && "This action is not supported yet!");
1046 case TargetLowering::Legal:
1047 break;
1048 case TargetLowering::Custom:
1049 Tmp3 = TLI.LowerOperation(Result, DAG);
1050 if (Tmp3.Val) {
1051 Result = Tmp3;
1052 break;
1053 }
1054 // FALLTHROUGH
Chris Lattner4aab2f42006-04-02 05:06:04 +00001055 case TargetLowering::Expand:
1056 Result = ExpandEXTRACT_VECTOR_ELT(Result);
Chris Lattnere35c2182006-03-21 21:02:03 +00001057 break;
1058 }
Chris Lattner384504c2006-03-21 20:44:12 +00001059 break;
1060
Chris Lattner15972212006-03-31 17:55:51 +00001061 case ISD::VEXTRACT_VECTOR_ELT:
1062 Result = LegalizeOp(LowerVEXTRACT_VECTOR_ELT(Op));
Chris Lattner384504c2006-03-21 20:44:12 +00001063 break;
Chris Lattner87100e02006-03-20 01:52:29 +00001064
Chris Lattner6831a812006-02-13 09:18:02 +00001065 case ISD::CALLSEQ_START: {
1066 SDNode *CallEnd = FindCallEndFromCallStart(Node);
1067
1068 // Recursively Legalize all of the inputs of the call end that do not lead
1069 // to this call start. This ensures that any libcalls that need be inserted
1070 // are inserted *before* the CALLSEQ_START.
Chris Lattnerc9cf4f12006-07-26 23:55:56 +00001071 {std::set<SDNode*> NodesLeadingTo;
Chris Lattner6831a812006-02-13 09:18:02 +00001072 for (unsigned i = 0, e = CallEnd->getNumOperands(); i != e; ++i)
Chris Lattnerc9cf4f12006-07-26 23:55:56 +00001073 LegalizeAllNodesNotLeadingTo(CallEnd->getOperand(i).Val, Node,
1074 NodesLeadingTo);
1075 }
Chris Lattner6831a812006-02-13 09:18:02 +00001076
1077 // Now that we legalized all of the inputs (which may have inserted
1078 // libcalls) create the new CALLSEQ_START node.
1079 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1080
1081 // Merge in the last call, to ensure that this call start after the last
1082 // call ended.
Chris Lattnerc5d7d7c2006-05-17 18:00:08 +00001083 if (LastCALLSEQ_END.getOpcode() != ISD::EntryToken) {
Chris Lattnerb248e162006-05-17 17:55:45 +00001084 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1085 Tmp1 = LegalizeOp(Tmp1);
1086 }
Chris Lattner6831a812006-02-13 09:18:02 +00001087
1088 // Do not try to legalize the target-specific arguments (#1+).
1089 if (Tmp1 != Node->getOperand(0)) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001090 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
Chris Lattner6831a812006-02-13 09:18:02 +00001091 Ops[0] = Tmp1;
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001092 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattner6831a812006-02-13 09:18:02 +00001093 }
1094
1095 // Remember that the CALLSEQ_START is legalized.
Chris Lattner4b653a02006-02-14 00:55:02 +00001096 AddLegalizedOperand(Op.getValue(0), Result);
1097 if (Node->getNumValues() == 2) // If this has a flag result, remember it.
1098 AddLegalizedOperand(Op.getValue(1), Result.getValue(1));
1099
Chris Lattner6831a812006-02-13 09:18:02 +00001100 // Now that the callseq_start and all of the non-call nodes above this call
1101 // sequence have been legalized, legalize the call itself. During this
1102 // process, no libcalls can/will be inserted, guaranteeing that no calls
1103 // can overlap.
1104 assert(!IsLegalizingCall && "Inconsistent sequentialization of calls!");
1105 SDOperand InCallSEQ = LastCALLSEQ_END;
1106 // Note that we are selecting this call!
1107 LastCALLSEQ_END = SDOperand(CallEnd, 0);
1108 IsLegalizingCall = true;
1109
1110 // Legalize the call, starting from the CALLSEQ_END.
1111 LegalizeOp(LastCALLSEQ_END);
1112 assert(!IsLegalizingCall && "CALLSEQ_END should have cleared this!");
1113 return Result;
1114 }
Chris Lattner16cd04d2005-05-12 23:24:06 +00001115 case ISD::CALLSEQ_END:
Chris Lattner6831a812006-02-13 09:18:02 +00001116 // If the CALLSEQ_START node hasn't been legalized first, legalize it. This
1117 // will cause this node to be legalized as well as handling libcalls right.
1118 if (LastCALLSEQ_END.Val != Node) {
1119 LegalizeOp(SDOperand(FindCallStartFromCallEnd(Node), 0));
1120 std::map<SDOperand, SDOperand>::iterator I = LegalizedNodes.find(Op);
1121 assert(I != LegalizedNodes.end() &&
1122 "Legalizing the call start should have legalized this node!");
1123 return I->second;
1124 }
1125
1126 // Otherwise, the call start has been legalized and everything is going
1127 // according to plan. Just legalize ourselves normally here.
Chris Lattner3e928bb2005-01-07 07:47:09 +00001128 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Chris Lattner70814bc2006-01-29 07:58:15 +00001129 // Do not try to legalize the target-specific arguments (#1+), except for
1130 // an optional flag input.
1131 if (Node->getOperand(Node->getNumOperands()-1).getValueType() != MVT::Flag){
1132 if (Tmp1 != Node->getOperand(0)) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001133 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
Chris Lattner70814bc2006-01-29 07:58:15 +00001134 Ops[0] = Tmp1;
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001135 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattner70814bc2006-01-29 07:58:15 +00001136 }
1137 } else {
1138 Tmp2 = LegalizeOp(Node->getOperand(Node->getNumOperands()-1));
1139 if (Tmp1 != Node->getOperand(0) ||
1140 Tmp2 != Node->getOperand(Node->getNumOperands()-1)) {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001141 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
Chris Lattner70814bc2006-01-29 07:58:15 +00001142 Ops[0] = Tmp1;
1143 Ops.back() = Tmp2;
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001144 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattner70814bc2006-01-29 07:58:15 +00001145 }
Chris Lattner6a542892006-01-24 05:48:21 +00001146 }
Chris Lattner4b653a02006-02-14 00:55:02 +00001147 assert(IsLegalizingCall && "Call sequence imbalance between start/end?");
Chris Lattner6831a812006-02-13 09:18:02 +00001148 // This finishes up call legalization.
1149 IsLegalizingCall = false;
Chris Lattner4b653a02006-02-14 00:55:02 +00001150
1151 // If the CALLSEQ_END node has a flag, remember that we legalized it.
1152 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
1153 if (Node->getNumValues() == 2)
1154 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1155 return Result.getValue(Op.ResNo);
Evan Chenga7dce3c2006-01-11 22:14:47 +00001156 case ISD::DYNAMIC_STACKALLOC: {
Chris Lattnerfa404e82005-01-09 19:03:49 +00001157 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1158 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the size.
1159 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the alignment.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001160 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
Chris Lattnerfa404e82005-01-09 19:03:49 +00001161
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001162 Tmp1 = Result.getValue(0);
Chris Lattner5f652292006-01-15 08:43:08 +00001163 Tmp2 = Result.getValue(1);
Evan Chenga7dce3c2006-01-11 22:14:47 +00001164 switch (TLI.getOperationAction(Node->getOpcode(),
1165 Node->getValueType(0))) {
1166 default: assert(0 && "This action is not supported yet!");
Chris Lattner903d2782006-01-15 08:54:32 +00001167 case TargetLowering::Expand: {
1168 unsigned SPReg = TLI.getStackPointerRegisterToSaveRestore();
1169 assert(SPReg && "Target cannot require DYNAMIC_STACKALLOC expansion and"
1170 " not tell us which reg is the stack pointer!");
1171 SDOperand Chain = Tmp1.getOperand(0);
1172 SDOperand Size = Tmp2.getOperand(1);
1173 SDOperand SP = DAG.getCopyFromReg(Chain, SPReg, Node->getValueType(0));
1174 Tmp1 = DAG.getNode(ISD::SUB, Node->getValueType(0), SP, Size); // Value
1175 Tmp2 = DAG.getCopyToReg(SP.getValue(1), SPReg, Tmp1); // Output chain
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001176 Tmp1 = LegalizeOp(Tmp1);
1177 Tmp2 = LegalizeOp(Tmp2);
Chris Lattner903d2782006-01-15 08:54:32 +00001178 break;
1179 }
1180 case TargetLowering::Custom:
Chris Lattner5f652292006-01-15 08:43:08 +00001181 Tmp3 = TLI.LowerOperation(Tmp1, DAG);
1182 if (Tmp3.Val) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001183 Tmp1 = LegalizeOp(Tmp3);
1184 Tmp2 = LegalizeOp(Tmp3.getValue(1));
Evan Chenga7dce3c2006-01-11 22:14:47 +00001185 }
Chris Lattner903d2782006-01-15 08:54:32 +00001186 break;
Evan Chenga7dce3c2006-01-11 22:14:47 +00001187 case TargetLowering::Legal:
Chris Lattner903d2782006-01-15 08:54:32 +00001188 break;
Evan Chenga7dce3c2006-01-11 22:14:47 +00001189 }
Chris Lattner903d2782006-01-15 08:54:32 +00001190 // Since this op produce two values, make sure to remember that we
1191 // legalized both of them.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001192 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1193 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
Chris Lattner903d2782006-01-15 08:54:32 +00001194 return Op.ResNo ? Tmp2 : Tmp1;
Evan Chenga7dce3c2006-01-11 22:14:47 +00001195 }
Chris Lattner25a022c2006-07-11 01:40:09 +00001196 case ISD::INLINEASM: {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001197 SmallVector<SDOperand, 8> Ops(Node->op_begin(), Node->op_end());
Chris Lattner25a022c2006-07-11 01:40:09 +00001198 bool Changed = false;
1199 // Legalize all of the operands of the inline asm, in case they are nodes
1200 // that need to be expanded or something. Note we skip the asm string and
1201 // all of the TargetConstant flags.
1202 SDOperand Op = LegalizeOp(Ops[0]);
1203 Changed = Op != Ops[0];
1204 Ops[0] = Op;
1205
1206 bool HasInFlag = Ops.back().getValueType() == MVT::Flag;
1207 for (unsigned i = 2, e = Ops.size()-HasInFlag; i < e; ) {
1208 unsigned NumVals = cast<ConstantSDNode>(Ops[i])->getValue() >> 3;
1209 for (++i; NumVals; ++i, --NumVals) {
1210 SDOperand Op = LegalizeOp(Ops[i]);
1211 if (Op != Ops[i]) {
1212 Changed = true;
1213 Ops[i] = Op;
1214 }
1215 }
Chris Lattnerce7518c2006-01-26 22:24:51 +00001216 }
Chris Lattner25a022c2006-07-11 01:40:09 +00001217
1218 if (HasInFlag) {
1219 Op = LegalizeOp(Ops.back());
1220 Changed |= Op != Ops.back();
1221 Ops.back() = Op;
1222 }
1223
1224 if (Changed)
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001225 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattnerce7518c2006-01-26 22:24:51 +00001226
1227 // INLINE asm returns a chain and flag, make sure to add both to the map.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001228 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
Chris Lattnerce7518c2006-01-26 22:24:51 +00001229 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
1230 return Result.getValue(Op.ResNo);
Chris Lattner25a022c2006-07-11 01:40:09 +00001231 }
Chris Lattnerc7af1792005-01-07 22:12:08 +00001232 case ISD::BR:
1233 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Chris Lattner6831a812006-02-13 09:18:02 +00001234 // Ensure that libcalls are emitted before a branch.
1235 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1236 Tmp1 = LegalizeOp(Tmp1);
1237 LastCALLSEQ_END = DAG.getEntryNode();
1238
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001239 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
Chris Lattnerc7af1792005-01-07 22:12:08 +00001240 break;
Nate Begeman37efe672006-04-22 18:53:45 +00001241 case ISD::BRIND:
1242 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1243 // Ensure that libcalls are emitted before a branch.
1244 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1245 Tmp1 = LegalizeOp(Tmp1);
1246 LastCALLSEQ_END = DAG.getEntryNode();
1247
1248 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1249 default: assert(0 && "Indirect target must be legal type (pointer)!");
1250 case Legal:
1251 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1252 break;
1253 }
1254 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
1255 break;
Chris Lattnerc18ae4c2005-01-07 08:19:42 +00001256 case ISD::BRCOND:
1257 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Chris Lattner6831a812006-02-13 09:18:02 +00001258 // Ensure that libcalls are emitted before a return.
1259 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1260 Tmp1 = LegalizeOp(Tmp1);
1261 LastCALLSEQ_END = DAG.getEntryNode();
1262
Chris Lattner47e92232005-01-18 19:27:06 +00001263 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1264 case Expand: assert(0 && "It's impossible to expand bools");
1265 case Legal:
1266 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the condition.
1267 break;
1268 case Promote:
1269 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the condition.
1270 break;
1271 }
Chris Lattner456a93a2006-01-28 07:39:30 +00001272
1273 // Basic block destination (Op#2) is always legal.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001274 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
Nate Begeman7cbd5252005-08-16 19:49:35 +00001275
1276 switch (TLI.getOperationAction(ISD::BRCOND, MVT::Other)) {
1277 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00001278 case TargetLowering::Legal: break;
1279 case TargetLowering::Custom:
1280 Tmp1 = TLI.LowerOperation(Result, DAG);
1281 if (Tmp1.Val) Result = Tmp1;
1282 break;
Nate Begeman7cbd5252005-08-16 19:49:35 +00001283 case TargetLowering::Expand:
1284 // Expand brcond's setcc into its constituent parts and create a BR_CC
1285 // Node.
1286 if (Tmp2.getOpcode() == ISD::SETCC) {
1287 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1, Tmp2.getOperand(2),
1288 Tmp2.getOperand(0), Tmp2.getOperand(1),
1289 Node->getOperand(2));
1290 } else {
Chris Lattner550b1e52005-08-21 18:03:09 +00001291 // Make sure the condition is either zero or one. It may have been
1292 // promoted from something else.
Chris Lattner19c5c4c2006-01-31 05:04:52 +00001293 unsigned NumBits = MVT::getSizeInBits(Tmp2.getValueType());
1294 if (!TLI.MaskedValueIsZero(Tmp2, (~0ULL >> (64-NumBits))^1))
1295 Tmp2 = DAG.getZeroExtendInReg(Tmp2, MVT::i1);
Chris Lattner550b1e52005-08-21 18:03:09 +00001296
Nate Begeman7cbd5252005-08-16 19:49:35 +00001297 Result = DAG.getNode(ISD::BR_CC, MVT::Other, Tmp1,
1298 DAG.getCondCode(ISD::SETNE), Tmp2,
1299 DAG.getConstant(0, Tmp2.getValueType()),
1300 Node->getOperand(2));
1301 }
1302 break;
Nate Begeman7cbd5252005-08-16 19:49:35 +00001303 }
1304 break;
1305 case ISD::BR_CC:
1306 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Chris Lattner6831a812006-02-13 09:18:02 +00001307 // Ensure that libcalls are emitted before a branch.
1308 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1309 Tmp1 = LegalizeOp(Tmp1);
1310 LastCALLSEQ_END = DAG.getEntryNode();
1311
Nate Begeman750ac1b2006-02-01 07:19:44 +00001312 Tmp2 = Node->getOperand(2); // LHS
1313 Tmp3 = Node->getOperand(3); // RHS
1314 Tmp4 = Node->getOperand(1); // CC
1315
1316 LegalizeSetCCOperands(Tmp2, Tmp3, Tmp4);
1317
1318 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1319 // the LHS is a legal SETCC itself. In this case, we need to compare
1320 // the result against zero to select between true and false values.
1321 if (Tmp3.Val == 0) {
1322 Tmp3 = DAG.getConstant(0, Tmp2.getValueType());
1323 Tmp4 = DAG.getCondCode(ISD::SETNE);
Chris Lattner181b7a32005-12-17 23:46:46 +00001324 }
Nate Begeman750ac1b2006-02-01 07:19:44 +00001325
1326 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp4, Tmp2, Tmp3,
1327 Node->getOperand(4));
Chris Lattner456a93a2006-01-28 07:39:30 +00001328
Chris Lattner181b7a32005-12-17 23:46:46 +00001329 switch (TLI.getOperationAction(ISD::BR_CC, Tmp3.getValueType())) {
1330 default: assert(0 && "Unexpected action for BR_CC!");
Chris Lattner456a93a2006-01-28 07:39:30 +00001331 case TargetLowering::Legal: break;
1332 case TargetLowering::Custom:
1333 Tmp4 = TLI.LowerOperation(Result, DAG);
1334 if (Tmp4.Val) Result = Tmp4;
Chris Lattner181b7a32005-12-17 23:46:46 +00001335 break;
Nate Begeman7cbd5252005-08-16 19:49:35 +00001336 }
Chris Lattnerc18ae4c2005-01-07 08:19:42 +00001337 break;
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001338 case ISD::LOAD: {
Chris Lattner3e928bb2005-01-07 07:47:09 +00001339 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1340 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
Andrew Lenharth2d86ea22005-04-27 20:10:01 +00001341
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001342 MVT::ValueType VT = Node->getValueType(0);
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001343 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
Evan Cheng41f6cbb2006-04-12 16:33:18 +00001344 Tmp3 = Result.getValue(0);
1345 Tmp4 = Result.getValue(1);
Chris Lattner456a93a2006-01-28 07:39:30 +00001346
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001347 switch (TLI.getOperationAction(Node->getOpcode(), VT)) {
1348 default: assert(0 && "This action is not supported yet!");
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001349 case TargetLowering::Legal: break;
Chris Lattner456a93a2006-01-28 07:39:30 +00001350 case TargetLowering::Custom:
Evan Cheng41f6cbb2006-04-12 16:33:18 +00001351 Tmp1 = TLI.LowerOperation(Tmp3, DAG);
Chris Lattner456a93a2006-01-28 07:39:30 +00001352 if (Tmp1.Val) {
Evan Cheng41f6cbb2006-04-12 16:33:18 +00001353 Tmp3 = LegalizeOp(Tmp1);
1354 Tmp4 = LegalizeOp(Tmp1.getValue(1));
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001355 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001356 break;
Evan Cheng41f6cbb2006-04-12 16:33:18 +00001357 case TargetLowering::Promote: {
1358 // Only promote a load of vector type to another.
1359 assert(MVT::isVector(VT) && "Cannot promote this load!");
1360 // Change base type to a different vector type.
1361 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), VT);
1362
1363 Tmp1 = DAG.getLoad(NVT, Tmp1, Tmp2, Node->getOperand(2));
1364 Tmp3 = LegalizeOp(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp1));
1365 Tmp4 = LegalizeOp(Tmp1.getValue(1));
1366 break;
1367 }
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001368 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001369 // Since loads produce two values, make sure to remember that we
1370 // legalized both of them.
Evan Cheng41f6cbb2006-04-12 16:33:18 +00001371 AddLegalizedOperand(SDOperand(Node, 0), Tmp3);
1372 AddLegalizedOperand(SDOperand(Node, 1), Tmp4);
1373 return Op.ResNo ? Tmp4 : Tmp3;
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001374 }
Evan Chengc5484282006-10-04 00:56:09 +00001375 case ISD::LOADX: {
Chris Lattner0f69b292005-01-15 06:18:18 +00001376 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1377 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
Chris Lattner0f69b292005-01-15 06:18:18 +00001378
Chris Lattner5f056bf2005-07-10 01:55:33 +00001379 MVT::ValueType SrcVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
Evan Chengc5484282006-10-04 00:56:09 +00001380 unsigned LType = cast<ConstantSDNode>(Node->getOperand(4))->getValue();
1381 switch (TLI.getLoadXAction(LType, SrcVT)) {
Chris Lattner01ff7212005-04-10 22:54:25 +00001382 default: assert(0 && "This action is not supported yet!");
Chris Lattner1c51c6a2005-04-12 20:30:10 +00001383 case TargetLowering::Promote:
Evan Chengc5484282006-10-04 00:56:09 +00001384 assert(SrcVT == MVT::i1 && "Can only promote LOADX from i1 -> i8!");
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001385 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2),
Evan Chengc5484282006-10-04 00:56:09 +00001386 DAG.getValueType(MVT::i8),
1387 Node->getOperand(4));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001388 Tmp1 = Result.getValue(0);
1389 Tmp2 = Result.getValue(1);
1390 break;
Chris Lattner456a93a2006-01-28 07:39:30 +00001391 case TargetLowering::Custom:
1392 isCustom = true;
1393 // FALLTHROUGH
Chris Lattner01ff7212005-04-10 22:54:25 +00001394 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001395 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2),
Evan Chengc5484282006-10-04 00:56:09 +00001396 Node->getOperand(3), Node->getOperand(4));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001397 Tmp1 = Result.getValue(0);
1398 Tmp2 = Result.getValue(1);
Chris Lattner456a93a2006-01-28 07:39:30 +00001399
1400 if (isCustom) {
Evan Chengbf497a32006-10-03 23:08:27 +00001401 Tmp3 = TLI.LowerOperation(Result, DAG);
Chris Lattner456a93a2006-01-28 07:39:30 +00001402 if (Tmp3.Val) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001403 Tmp1 = LegalizeOp(Tmp3);
1404 Tmp2 = LegalizeOp(Tmp3.getValue(1));
Chris Lattner456a93a2006-01-28 07:39:30 +00001405 }
1406 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001407 break;
Chris Lattner01ff7212005-04-10 22:54:25 +00001408 case TargetLowering::Expand:
Chris Lattner69a889e2005-12-20 00:53:54 +00001409 // f64 = EXTLOAD f32 should expand to LOAD, FP_EXTEND
Andrew Lenharth9d416f72005-06-30 19:22:37 +00001410 if (SrcVT == MVT::f32 && Node->getValueType(0) == MVT::f64) {
1411 SDOperand Load = DAG.getLoad(SrcVT, Tmp1, Tmp2, Node->getOperand(2));
Andrew Lenharth31559082005-06-30 19:32:57 +00001412 Result = DAG.getNode(ISD::FP_EXTEND, Node->getValueType(0), Load);
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001413 Tmp1 = LegalizeOp(Result); // Relegalize new nodes.
1414 Tmp2 = LegalizeOp(Load.getValue(1));
1415 break;
Andrew Lenharth9d416f72005-06-30 19:22:37 +00001416 }
Evan Chengc5484282006-10-04 00:56:09 +00001417 assert(LType != ISD::EXTLOAD && "EXTLOAD should always be supported!");
Chris Lattner01ff7212005-04-10 22:54:25 +00001418 // Turn the unsupported load into an EXTLOAD followed by an explicit
1419 // zero/sign extend inreg.
Chris Lattner5f056bf2005-07-10 01:55:33 +00001420 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
1421 Tmp1, Tmp2, Node->getOperand(2), SrcVT);
Chris Lattner23993562005-04-13 02:38:47 +00001422 SDOperand ValRes;
Evan Chengc5484282006-10-04 00:56:09 +00001423 if (LType == ISD::SEXTLOAD)
Chris Lattner23993562005-04-13 02:38:47 +00001424 ValRes = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
Chris Lattner15e4b012005-07-10 00:07:11 +00001425 Result, DAG.getValueType(SrcVT));
Chris Lattner23993562005-04-13 02:38:47 +00001426 else
1427 ValRes = DAG.getZeroExtendInReg(Result, SrcVT);
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001428 Tmp1 = LegalizeOp(ValRes); // Relegalize new nodes.
1429 Tmp2 = LegalizeOp(Result.getValue(1)); // Relegalize new nodes.
1430 break;
Chris Lattner01ff7212005-04-10 22:54:25 +00001431 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001432 // Since loads produce two values, make sure to remember that we legalized
1433 // both of them.
1434 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1435 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1436 return Op.ResNo ? Tmp2 : Tmp1;
Chris Lattner01ff7212005-04-10 22:54:25 +00001437 }
Nate Begeman5dc897b2005-10-19 00:06:56 +00001438 case ISD::EXTRACT_ELEMENT: {
1439 MVT::ValueType OpTy = Node->getOperand(0).getValueType();
1440 switch (getTypeAction(OpTy)) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001441 default: assert(0 && "EXTRACT_ELEMENT action for type unimplemented!");
Nate Begeman5dc897b2005-10-19 00:06:56 +00001442 case Legal:
1443 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue()) {
1444 // 1 -> Hi
1445 Result = DAG.getNode(ISD::SRL, OpTy, Node->getOperand(0),
1446 DAG.getConstant(MVT::getSizeInBits(OpTy)/2,
1447 TLI.getShiftAmountTy()));
1448 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Result);
1449 } else {
1450 // 0 -> Lo
1451 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0),
1452 Node->getOperand(0));
1453 }
Nate Begeman5dc897b2005-10-19 00:06:56 +00001454 break;
1455 case Expand:
1456 // Get both the low and high parts.
1457 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
1458 if (cast<ConstantSDNode>(Node->getOperand(1))->getValue())
1459 Result = Tmp2; // 1 -> Hi
1460 else
1461 Result = Tmp1; // 0 -> Lo
1462 break;
1463 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001464 break;
Nate Begeman5dc897b2005-10-19 00:06:56 +00001465 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001466
1467 case ISD::CopyToReg:
1468 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Misha Brukmanedf128a2005-04-21 22:36:52 +00001469
Chris Lattnerc9c60f62005-08-24 16:35:28 +00001470 assert(isTypeLegal(Node->getOperand(2).getValueType()) &&
Chris Lattnerd5d0f9b2005-08-16 21:55:35 +00001471 "Register type must be legal!");
Chris Lattner7310fb12005-12-18 15:27:43 +00001472 // Legalize the incoming value (must be a legal type).
Chris Lattnerd5d0f9b2005-08-16 21:55:35 +00001473 Tmp2 = LegalizeOp(Node->getOperand(2));
Chris Lattnerf1a47c32005-12-18 15:36:21 +00001474 if (Node->getNumValues() == 1) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001475 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2);
Chris Lattner7310fb12005-12-18 15:27:43 +00001476 } else {
Chris Lattnerf1a47c32005-12-18 15:36:21 +00001477 assert(Node->getNumValues() == 2 && "Unknown CopyToReg");
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001478 if (Node->getNumOperands() == 4) {
Chris Lattnerf1a47c32005-12-18 15:36:21 +00001479 Tmp3 = LegalizeOp(Node->getOperand(3));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001480 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1), Tmp2,
1481 Tmp3);
1482 } else {
1483 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1),Tmp2);
Chris Lattner7310fb12005-12-18 15:27:43 +00001484 }
1485
1486 // Since this produces two values, make sure to remember that we legalized
1487 // both of them.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001488 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
Chris Lattner7310fb12005-12-18 15:27:43 +00001489 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001490 return Result;
Chris Lattner7310fb12005-12-18 15:27:43 +00001491 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001492 break;
1493
1494 case ISD::RET:
1495 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Chris Lattner6831a812006-02-13 09:18:02 +00001496
1497 // Ensure that libcalls are emitted before a return.
1498 Tmp1 = DAG.getNode(ISD::TokenFactor, MVT::Other, Tmp1, LastCALLSEQ_END);
1499 Tmp1 = LegalizeOp(Tmp1);
1500 LastCALLSEQ_END = DAG.getEntryNode();
Chris Lattnerf87324e2006-04-11 01:31:51 +00001501
Chris Lattner3e928bb2005-01-07 07:47:09 +00001502 switch (Node->getNumOperands()) {
Evan Cheng8e7d0562006-05-26 23:09:09 +00001503 case 3: // ret val
Evan Cheng98f8aeb2006-04-11 06:33:39 +00001504 Tmp2 = Node->getOperand(1);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001505 Tmp3 = Node->getOperand(2); // Signness
Chris Lattnerf87324e2006-04-11 01:31:51 +00001506 switch (getTypeAction(Tmp2.getValueType())) {
Chris Lattner3e928bb2005-01-07 07:47:09 +00001507 case Legal:
Evan Cheng8e7d0562006-05-26 23:09:09 +00001508 Result = DAG.UpdateNodeOperands(Result, Tmp1, LegalizeOp(Tmp2), Tmp3);
Chris Lattner3e928bb2005-01-07 07:47:09 +00001509 break;
Chris Lattnerf87324e2006-04-11 01:31:51 +00001510 case Expand:
1511 if (Tmp2.getValueType() != MVT::Vector) {
1512 SDOperand Lo, Hi;
1513 ExpandOp(Tmp2, Lo, Hi);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001514 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi, Tmp3);
Chris Lattnerf921a512006-08-21 20:24:53 +00001515 Result = LegalizeOp(Result);
Chris Lattnerf87324e2006-04-11 01:31:51 +00001516 } else {
1517 SDNode *InVal = Tmp2.Val;
1518 unsigned NumElems =
1519 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
1520 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
1521
1522 // Figure out if there is a Packed type corresponding to this Vector
1523 // type. If so, convert to the packed type.
1524 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
1525 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
1526 // Turn this into a return of the packed type.
1527 Tmp2 = PackVectorOp(Tmp2, TVT);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001528 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
Chris Lattnerf87324e2006-04-11 01:31:51 +00001529 } else if (NumElems == 1) {
1530 // Turn this into a return of the scalar type.
1531 Tmp2 = PackVectorOp(Tmp2, EVT);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001532 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
Chris Lattnerb49e52c2006-04-11 02:00:08 +00001533
1534 // FIXME: Returns of gcc generic vectors smaller than a legal type
1535 // should be returned in integer registers!
1536
Chris Lattnerf87324e2006-04-11 01:31:51 +00001537 // The scalarized value type may not be legal, e.g. it might require
1538 // promotion or expansion. Relegalize the return.
1539 Result = LegalizeOp(Result);
1540 } else {
Chris Lattnerb49e52c2006-04-11 02:00:08 +00001541 // FIXME: Returns of gcc generic vectors larger than a legal vector
1542 // type should be returned by reference!
Chris Lattnerf87324e2006-04-11 01:31:51 +00001543 SDOperand Lo, Hi;
1544 SplitVectorOp(Tmp2, Lo, Hi);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001545 Result = DAG.getNode(ISD::RET, MVT::Other, Tmp1, Lo, Tmp3, Hi, Tmp3);
Chris Lattnerf87324e2006-04-11 01:31:51 +00001546 Result = LegalizeOp(Result);
1547 }
1548 }
Misha Brukmanedf128a2005-04-21 22:36:52 +00001549 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001550 case Promote:
Chris Lattner8b6fa222005-01-15 22:16:26 +00001551 Tmp2 = PromoteOp(Node->getOperand(1));
Evan Cheng8e7d0562006-05-26 23:09:09 +00001552 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001553 Result = LegalizeOp(Result);
Chris Lattner8b6fa222005-01-15 22:16:26 +00001554 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001555 }
1556 break;
1557 case 1: // ret void
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001558 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Chris Lattner3e928bb2005-01-07 07:47:09 +00001559 break;
1560 default: { // ret <values>
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001561 SmallVector<SDOperand, 8> NewValues;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001562 NewValues.push_back(Tmp1);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001563 for (unsigned i = 1, e = Node->getNumOperands(); i < e; i += 2)
Chris Lattner3e928bb2005-01-07 07:47:09 +00001564 switch (getTypeAction(Node->getOperand(i).getValueType())) {
1565 case Legal:
Chris Lattner4e6c7462005-01-08 19:27:05 +00001566 NewValues.push_back(LegalizeOp(Node->getOperand(i)));
Evan Cheng8e7d0562006-05-26 23:09:09 +00001567 NewValues.push_back(Node->getOperand(i+1));
Chris Lattner3e928bb2005-01-07 07:47:09 +00001568 break;
1569 case Expand: {
1570 SDOperand Lo, Hi;
Chris Lattnerb49e52c2006-04-11 02:00:08 +00001571 assert(Node->getOperand(i).getValueType() != MVT::Vector &&
1572 "FIXME: TODO: implement returning non-legal vector types!");
Chris Lattner3e928bb2005-01-07 07:47:09 +00001573 ExpandOp(Node->getOperand(i), Lo, Hi);
1574 NewValues.push_back(Lo);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001575 NewValues.push_back(Node->getOperand(i+1));
Chris Lattner3e928bb2005-01-07 07:47:09 +00001576 NewValues.push_back(Hi);
Evan Cheng8e7d0562006-05-26 23:09:09 +00001577 NewValues.push_back(Node->getOperand(i+1));
Misha Brukmanedf128a2005-04-21 22:36:52 +00001578 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001579 }
1580 case Promote:
Chris Lattner8b6fa222005-01-15 22:16:26 +00001581 assert(0 && "Can't promote multiple return value yet!");
Chris Lattner3e928bb2005-01-07 07:47:09 +00001582 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001583
1584 if (NewValues.size() == Node->getNumOperands())
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001585 Result = DAG.UpdateNodeOperands(Result, &NewValues[0],NewValues.size());
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001586 else
Chris Lattnerf06f35e2006-08-08 01:09:31 +00001587 Result = DAG.getNode(ISD::RET, MVT::Other,
1588 &NewValues[0], NewValues.size());
Chris Lattner3e928bb2005-01-07 07:47:09 +00001589 break;
1590 }
1591 }
Evan Cheng17c428e2006-01-06 00:41:43 +00001592
Chris Lattner6862dbc2006-01-29 21:02:23 +00001593 if (Result.getOpcode() == ISD::RET) {
1594 switch (TLI.getOperationAction(Result.getOpcode(), MVT::Other)) {
1595 default: assert(0 && "This action is not supported yet!");
1596 case TargetLowering::Legal: break;
1597 case TargetLowering::Custom:
1598 Tmp1 = TLI.LowerOperation(Result, DAG);
1599 if (Tmp1.Val) Result = Tmp1;
1600 break;
1601 }
Evan Cheng17c428e2006-01-06 00:41:43 +00001602 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001603 break;
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001604 case ISD::STORE: {
Chris Lattner3e928bb2005-01-07 07:47:09 +00001605 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1606 Tmp2 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer.
1607
Chris Lattner5d2c6c72005-01-08 06:25:56 +00001608 // Turn 'store float 1.0, Ptr' -> 'store int 0x12345678, Ptr'
Chris Lattner456a93a2006-01-28 07:39:30 +00001609 // FIXME: We shouldn't do this for TargetConstantFP's.
Chris Lattner06ac6ab2006-03-15 22:19:18 +00001610 // FIXME: move this to the DAG Combiner!
Chris Lattner03c85462005-01-15 05:21:40 +00001611 if (ConstantFPSDNode *CFP =dyn_cast<ConstantFPSDNode>(Node->getOperand(1))){
Chris Lattner5d2c6c72005-01-08 06:25:56 +00001612 if (CFP->getValueType(0) == MVT::f32) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001613 Tmp3 = DAG.getConstant(FloatToBits(CFP->getValue()), MVT::i32);
Chris Lattner5d2c6c72005-01-08 06:25:56 +00001614 } else {
1615 assert(CFP->getValueType(0) == MVT::f64 && "Unknown FP type!");
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001616 Tmp3 = DAG.getConstant(DoubleToBits(CFP->getValue()), MVT::i64);
Chris Lattner5d2c6c72005-01-08 06:25:56 +00001617 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001618 Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Tmp3, Tmp2,
1619 Node->getOperand(3));
Chris Lattner6a542892006-01-24 05:48:21 +00001620 break;
Chris Lattner5d2c6c72005-01-08 06:25:56 +00001621 }
1622
Chris Lattner3e928bb2005-01-07 07:47:09 +00001623 switch (getTypeAction(Node->getOperand(1).getValueType())) {
1624 case Legal: {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001625 Tmp3 = LegalizeOp(Node->getOperand(1));
1626 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1627 Node->getOperand(3));
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001628
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001629 MVT::ValueType VT = Tmp3.getValueType();
Chris Lattner456a93a2006-01-28 07:39:30 +00001630 switch (TLI.getOperationAction(ISD::STORE, VT)) {
1631 default: assert(0 && "This action is not supported yet!");
1632 case TargetLowering::Legal: break;
1633 case TargetLowering::Custom:
1634 Tmp1 = TLI.LowerOperation(Result, DAG);
1635 if (Tmp1.Val) Result = Tmp1;
1636 break;
Chris Lattner2efce0a2006-04-16 01:36:45 +00001637 case TargetLowering::Promote:
1638 assert(MVT::isVector(VT) && "Unknown legal promote case!");
1639 Tmp3 = DAG.getNode(ISD::BIT_CONVERT,
1640 TLI.getTypeToPromoteTo(ISD::STORE, VT), Tmp3);
1641 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1642 Node->getOperand(3));
1643 break;
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001644 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001645 break;
1646 }
1647 case Promote:
Chris Lattner03c85462005-01-15 05:21:40 +00001648 // Truncate the value and store the result.
1649 Tmp3 = PromoteOp(Node->getOperand(1));
1650 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp3, Tmp2,
Andrew Lenharth2d86ea22005-04-27 20:10:01 +00001651 Node->getOperand(3),
Chris Lattner9fadb4c2005-07-10 00:29:18 +00001652 DAG.getValueType(Node->getOperand(1).getValueType()));
Chris Lattner03c85462005-01-15 05:21:40 +00001653 break;
1654
Chris Lattner3e928bb2005-01-07 07:47:09 +00001655 case Expand:
Chris Lattnerc7029802006-03-18 01:44:44 +00001656 unsigned IncrementSize = 0;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001657 SDOperand Lo, Hi;
Chris Lattnerc7029802006-03-18 01:44:44 +00001658
1659 // If this is a vector type, then we have to calculate the increment as
1660 // the product of the element size in bytes, and the number of elements
1661 // in the high half of the vector.
1662 if (Node->getOperand(1).getValueType() == MVT::Vector) {
1663 SDNode *InVal = Node->getOperand(1).Val;
1664 unsigned NumElems =
1665 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
1666 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
1667
1668 // Figure out if there is a Packed type corresponding to this Vector
1669 // type. If so, convert to the packed type.
1670 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
1671 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
1672 // Turn this into a normal store of the packed type.
1673 Tmp3 = PackVectorOp(Node->getOperand(1), TVT);
1674 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1675 Node->getOperand(3));
Chris Lattner2efce0a2006-04-16 01:36:45 +00001676 Result = LegalizeOp(Result);
Chris Lattnerc7029802006-03-18 01:44:44 +00001677 break;
1678 } else if (NumElems == 1) {
1679 // Turn this into a normal store of the scalar type.
1680 Tmp3 = PackVectorOp(Node->getOperand(1), EVT);
1681 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp3, Tmp2,
1682 Node->getOperand(3));
Chris Lattner2ae2e982006-03-31 17:37:22 +00001683 // The scalarized value type may not be legal, e.g. it might require
1684 // promotion or expansion. Relegalize the scalar store.
1685 Result = LegalizeOp(Result);
Chris Lattnerc7029802006-03-18 01:44:44 +00001686 break;
1687 } else {
1688 SplitVectorOp(Node->getOperand(1), Lo, Hi);
1689 IncrementSize = NumElems/2 * MVT::getSizeInBits(EVT)/8;
1690 }
1691 } else {
1692 ExpandOp(Node->getOperand(1), Lo, Hi);
1693 IncrementSize = MVT::getSizeInBits(Hi.getValueType())/8;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001694
Chris Lattnerd9731af2006-03-31 18:20:46 +00001695 if (!TLI.isLittleEndian())
1696 std::swap(Lo, Hi);
1697 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001698
Chris Lattneredb1add2005-05-11 04:51:16 +00001699 Lo = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Lo, Tmp2,
1700 Node->getOperand(3));
Chris Lattner3e928bb2005-01-07 07:47:09 +00001701 Tmp2 = DAG.getNode(ISD::ADD, Tmp2.getValueType(), Tmp2,
1702 getIntPtrConstant(IncrementSize));
1703 assert(isTypeLegal(Tmp2.getValueType()) &&
1704 "Pointers must be legal!");
Chris Lattner456a93a2006-01-28 07:39:30 +00001705 // FIXME: This sets the srcvalue of both halves to be the same, which is
1706 // wrong.
Chris Lattneredb1add2005-05-11 04:51:16 +00001707 Hi = DAG.getNode(ISD::STORE, MVT::Other, Tmp1, Hi, Tmp2,
1708 Node->getOperand(3));
Chris Lattnerec39a452005-01-19 18:02:17 +00001709 Result = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo, Hi);
1710 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001711 }
1712 break;
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001713 }
Andrew Lenharth95762122005-03-31 21:24:06 +00001714 case ISD::PCMARKER:
1715 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001716 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
Andrew Lenharth95762122005-03-31 21:24:06 +00001717 break;
Chris Lattner140d53c2006-01-13 02:50:02 +00001718 case ISD::STACKSAVE:
1719 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001720 Result = DAG.UpdateNodeOperands(Result, Tmp1);
1721 Tmp1 = Result.getValue(0);
1722 Tmp2 = Result.getValue(1);
Chris Lattner456a93a2006-01-28 07:39:30 +00001723
Chris Lattner140d53c2006-01-13 02:50:02 +00001724 switch (TLI.getOperationAction(ISD::STACKSAVE, MVT::Other)) {
1725 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00001726 case TargetLowering::Legal: break;
1727 case TargetLowering::Custom:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001728 Tmp3 = TLI.LowerOperation(Result, DAG);
1729 if (Tmp3.Val) {
1730 Tmp1 = LegalizeOp(Tmp3);
1731 Tmp2 = LegalizeOp(Tmp3.getValue(1));
Chris Lattner140d53c2006-01-13 02:50:02 +00001732 }
Chris Lattner456a93a2006-01-28 07:39:30 +00001733 break;
Chris Lattner140d53c2006-01-13 02:50:02 +00001734 case TargetLowering::Expand:
Chris Lattner4f0d8e42006-01-13 17:48:44 +00001735 // Expand to CopyFromReg if the target set
1736 // StackPointerRegisterToSaveRestore.
1737 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001738 Tmp1 = DAG.getCopyFromReg(Result.getOperand(0), SP,
Chris Lattner4f0d8e42006-01-13 17:48:44 +00001739 Node->getValueType(0));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001740 Tmp2 = Tmp1.getValue(1);
Chris Lattner4f0d8e42006-01-13 17:48:44 +00001741 } else {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001742 Tmp1 = DAG.getNode(ISD::UNDEF, Node->getValueType(0));
1743 Tmp2 = Node->getOperand(0);
Chris Lattner4f0d8e42006-01-13 17:48:44 +00001744 }
Chris Lattner456a93a2006-01-28 07:39:30 +00001745 break;
Chris Lattner140d53c2006-01-13 02:50:02 +00001746 }
Chris Lattner456a93a2006-01-28 07:39:30 +00001747
1748 // Since stacksave produce two values, make sure to remember that we
1749 // legalized both of them.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001750 AddLegalizedOperand(SDOperand(Node, 0), Tmp1);
1751 AddLegalizedOperand(SDOperand(Node, 1), Tmp2);
1752 return Op.ResNo ? Tmp2 : Tmp1;
Chris Lattner456a93a2006-01-28 07:39:30 +00001753
Chris Lattner140d53c2006-01-13 02:50:02 +00001754 case ISD::STACKRESTORE:
1755 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1756 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001757 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
Chris Lattner140d53c2006-01-13 02:50:02 +00001758
1759 switch (TLI.getOperationAction(ISD::STACKRESTORE, MVT::Other)) {
1760 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00001761 case TargetLowering::Legal: break;
1762 case TargetLowering::Custom:
1763 Tmp1 = TLI.LowerOperation(Result, DAG);
1764 if (Tmp1.Val) Result = Tmp1;
Chris Lattner140d53c2006-01-13 02:50:02 +00001765 break;
1766 case TargetLowering::Expand:
Chris Lattner4f0d8e42006-01-13 17:48:44 +00001767 // Expand to CopyToReg if the target set
1768 // StackPointerRegisterToSaveRestore.
1769 if (unsigned SP = TLI.getStackPointerRegisterToSaveRestore()) {
1770 Result = DAG.getCopyToReg(Tmp1, SP, Tmp2);
1771 } else {
1772 Result = Tmp1;
1773 }
Chris Lattner140d53c2006-01-13 02:50:02 +00001774 break;
1775 }
1776 break;
1777
Andrew Lenharth51b8d542005-11-11 16:47:30 +00001778 case ISD::READCYCLECOUNTER:
1779 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001780 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Andrew Lenharth49c709f2005-12-02 04:56:24 +00001781
1782 // Since rdcc produce two values, make sure to remember that we legalized
1783 // both of them.
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001784 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
Andrew Lenharth49c709f2005-12-02 04:56:24 +00001785 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001786 return Result;
Andrew Lenharthf70e30b2005-11-20 21:32:07 +00001787
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001788 case ISD::TRUNCSTORE: {
Chris Lattner0f69b292005-01-15 06:18:18 +00001789 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
1790 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the pointer.
1791
Chris Lattner456a93a2006-01-28 07:39:30 +00001792 assert(isTypeLegal(Node->getOperand(1).getValueType()) &&
1793 "Cannot handle illegal TRUNCSTORE yet!");
1794 Tmp2 = LegalizeOp(Node->getOperand(1));
1795
1796 // The only promote case we handle is TRUNCSTORE:i1 X into
1797 // -> TRUNCSTORE:i8 (and X, 1)
1798 if (cast<VTSDNode>(Node->getOperand(4))->getVT() == MVT::i1 &&
1799 TLI.getOperationAction(ISD::TRUNCSTORE, MVT::i1) ==
1800 TargetLowering::Promote) {
1801 // Promote the bool to a mask then store.
1802 Tmp2 = DAG.getNode(ISD::AND, Tmp2.getValueType(), Tmp2,
1803 DAG.getConstant(1, Tmp2.getValueType()));
1804 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, Tmp1, Tmp2, Tmp3,
1805 Node->getOperand(3), DAG.getValueType(MVT::i8));
Chris Lattner13d58e72005-09-10 00:20:18 +00001806
Chris Lattner456a93a2006-01-28 07:39:30 +00001807 } else if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1) ||
1808 Tmp3 != Node->getOperand(2)) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001809 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
1810 Node->getOperand(3), Node->getOperand(4));
Chris Lattner456a93a2006-01-28 07:39:30 +00001811 }
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001812
Chris Lattner456a93a2006-01-28 07:39:30 +00001813 MVT::ValueType StVT = cast<VTSDNode>(Result.Val->getOperand(4))->getVT();
1814 switch (TLI.getOperationAction(Result.Val->getOpcode(), StVT)) {
1815 default: assert(0 && "This action is not supported yet!");
1816 case TargetLowering::Legal: break;
1817 case TargetLowering::Custom:
1818 Tmp1 = TLI.LowerOperation(Result, DAG);
1819 if (Tmp1.Val) Result = Tmp1;
Chris Lattner0f69b292005-01-15 06:18:18 +00001820 break;
Chris Lattner0f69b292005-01-15 06:18:18 +00001821 }
1822 break;
Evan Chengf3fd9fe2005-12-23 07:29:34 +00001823 }
Chris Lattner2ee743f2005-01-14 22:08:15 +00001824 case ISD::SELECT:
Chris Lattner47e92232005-01-18 19:27:06 +00001825 switch (getTypeAction(Node->getOperand(0).getValueType())) {
1826 case Expand: assert(0 && "It's impossible to expand bools");
1827 case Legal:
1828 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the condition.
1829 break;
1830 case Promote:
1831 Tmp1 = PromoteOp(Node->getOperand(0)); // Promote the condition.
1832 break;
1833 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001834 Tmp2 = LegalizeOp(Node->getOperand(1)); // TrueVal
Chris Lattner2ee743f2005-01-14 22:08:15 +00001835 Tmp3 = LegalizeOp(Node->getOperand(2)); // FalseVal
Chris Lattner55ba8fb2005-01-16 07:29:19 +00001836
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001837 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
Chris Lattner456a93a2006-01-28 07:39:30 +00001838
Nate Begemanb942a3d2005-08-23 04:29:48 +00001839 switch (TLI.getOperationAction(ISD::SELECT, Tmp2.getValueType())) {
Chris Lattner55ba8fb2005-01-16 07:29:19 +00001840 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00001841 case TargetLowering::Legal: break;
1842 case TargetLowering::Custom: {
1843 Tmp1 = TLI.LowerOperation(Result, DAG);
1844 if (Tmp1.Val) Result = Tmp1;
1845 break;
1846 }
Nate Begeman9373a812005-08-10 20:51:12 +00001847 case TargetLowering::Expand:
1848 if (Tmp1.getOpcode() == ISD::SETCC) {
1849 Result = DAG.getSelectCC(Tmp1.getOperand(0), Tmp1.getOperand(1),
1850 Tmp2, Tmp3,
1851 cast<CondCodeSDNode>(Tmp1.getOperand(2))->get());
1852 } else {
Chris Lattner550b1e52005-08-21 18:03:09 +00001853 // Make sure the condition is either zero or one. It may have been
1854 // promoted from something else.
Chris Lattner0e753d62006-01-30 04:22:28 +00001855 unsigned NumBits = MVT::getSizeInBits(Tmp1.getValueType());
1856 if (!TLI.MaskedValueIsZero(Tmp1, (~0ULL >> (64-NumBits))^1))
1857 Tmp1 = DAG.getZeroExtendInReg(Tmp1, MVT::i1);
Nate Begeman9373a812005-08-10 20:51:12 +00001858 Result = DAG.getSelectCC(Tmp1,
1859 DAG.getConstant(0, Tmp1.getValueType()),
1860 Tmp2, Tmp3, ISD::SETNE);
1861 }
Chris Lattner55ba8fb2005-01-16 07:29:19 +00001862 break;
1863 case TargetLowering::Promote: {
1864 MVT::ValueType NVT =
1865 TLI.getTypeToPromoteTo(ISD::SELECT, Tmp2.getValueType());
1866 unsigned ExtOp, TruncOp;
Evan Cheng41f6cbb2006-04-12 16:33:18 +00001867 if (MVT::isVector(Tmp2.getValueType())) {
1868 ExtOp = ISD::BIT_CONVERT;
1869 TruncOp = ISD::BIT_CONVERT;
1870 } else if (MVT::isInteger(Tmp2.getValueType())) {
Chris Lattner456a93a2006-01-28 07:39:30 +00001871 ExtOp = ISD::ANY_EXTEND;
1872 TruncOp = ISD::TRUNCATE;
Chris Lattner55ba8fb2005-01-16 07:29:19 +00001873 } else {
Chris Lattner456a93a2006-01-28 07:39:30 +00001874 ExtOp = ISD::FP_EXTEND;
1875 TruncOp = ISD::FP_ROUND;
Chris Lattner55ba8fb2005-01-16 07:29:19 +00001876 }
1877 // Promote each of the values to the new type.
1878 Tmp2 = DAG.getNode(ExtOp, NVT, Tmp2);
1879 Tmp3 = DAG.getNode(ExtOp, NVT, Tmp3);
1880 // Perform the larger operation, then round down.
1881 Result = DAG.getNode(ISD::SELECT, NVT, Tmp1, Tmp2,Tmp3);
1882 Result = DAG.getNode(TruncOp, Node->getValueType(0), Result);
1883 break;
1884 }
1885 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001886 break;
Nate Begeman750ac1b2006-02-01 07:19:44 +00001887 case ISD::SELECT_CC: {
1888 Tmp1 = Node->getOperand(0); // LHS
1889 Tmp2 = Node->getOperand(1); // RHS
Nate Begeman9373a812005-08-10 20:51:12 +00001890 Tmp3 = LegalizeOp(Node->getOperand(2)); // True
1891 Tmp4 = LegalizeOp(Node->getOperand(3)); // False
Nate Begeman750ac1b2006-02-01 07:19:44 +00001892 SDOperand CC = Node->getOperand(4);
Nate Begeman9373a812005-08-10 20:51:12 +00001893
Nate Begeman750ac1b2006-02-01 07:19:44 +00001894 LegalizeSetCCOperands(Tmp1, Tmp2, CC);
1895
1896 // If we didn't get both a LHS and RHS back from LegalizeSetCCOperands,
1897 // the LHS is a legal SETCC itself. In this case, we need to compare
1898 // the result against zero to select between true and false values.
1899 if (Tmp2.Val == 0) {
1900 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
1901 CC = DAG.getCondCode(ISD::SETNE);
1902 }
1903 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, CC);
1904
1905 // Everything is legal, see if we should expand this op or something.
1906 switch (TLI.getOperationAction(ISD::SELECT_CC, Tmp3.getValueType())) {
1907 default: assert(0 && "This action is not supported yet!");
1908 case TargetLowering::Legal: break;
1909 case TargetLowering::Custom:
1910 Tmp1 = TLI.LowerOperation(Result, DAG);
1911 if (Tmp1.Val) Result = Tmp1;
Nate Begeman9373a812005-08-10 20:51:12 +00001912 break;
Nate Begeman9373a812005-08-10 20:51:12 +00001913 }
1914 break;
Nate Begeman750ac1b2006-02-01 07:19:44 +00001915 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001916 case ISD::SETCC:
Nate Begeman750ac1b2006-02-01 07:19:44 +00001917 Tmp1 = Node->getOperand(0);
1918 Tmp2 = Node->getOperand(1);
1919 Tmp3 = Node->getOperand(2);
1920 LegalizeSetCCOperands(Tmp1, Tmp2, Tmp3);
1921
1922 // If we had to Expand the SetCC operands into a SELECT node, then it may
1923 // not always be possible to return a true LHS & RHS. In this case, just
1924 // return the value we legalized, returned in the LHS
1925 if (Tmp2.Val == 0) {
1926 Result = Tmp1;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001927 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00001928 }
Nate Begemanb942a3d2005-08-23 04:29:48 +00001929
Chris Lattner73e142f2006-01-30 22:43:50 +00001930 switch (TLI.getOperationAction(ISD::SETCC, Tmp1.getValueType())) {
Chris Lattner456a93a2006-01-28 07:39:30 +00001931 default: assert(0 && "Cannot handle this action for SETCC yet!");
1932 case TargetLowering::Custom:
1933 isCustom = true;
1934 // FALLTHROUGH.
1935 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001936 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
Chris Lattner456a93a2006-01-28 07:39:30 +00001937 if (isCustom) {
1938 Tmp3 = TLI.LowerOperation(Result, DAG);
1939 if (Tmp3.Val) Result = Tmp3;
1940 }
Nate Begemanb942a3d2005-08-23 04:29:48 +00001941 break;
Andrew Lenharthae355752005-11-30 17:12:26 +00001942 case TargetLowering::Promote: {
1943 // First step, figure out the appropriate operation to use.
1944 // Allow SETCC to not be supported for all legal data types
1945 // Mostly this targets FP
1946 MVT::ValueType NewInTy = Node->getOperand(0).getValueType();
1947 MVT::ValueType OldVT = NewInTy;
1948
1949 // Scan for the appropriate larger type to use.
1950 while (1) {
1951 NewInTy = (MVT::ValueType)(NewInTy+1);
1952
1953 assert(MVT::isInteger(NewInTy) == MVT::isInteger(OldVT) &&
1954 "Fell off of the edge of the integer world");
1955 assert(MVT::isFloatingPoint(NewInTy) == MVT::isFloatingPoint(OldVT) &&
1956 "Fell off of the edge of the floating point world");
1957
1958 // If the target supports SETCC of this type, use it.
Chris Lattner1ccf26a2005-12-22 05:23:45 +00001959 if (TLI.isOperationLegal(ISD::SETCC, NewInTy))
Andrew Lenharthae355752005-11-30 17:12:26 +00001960 break;
1961 }
1962 if (MVT::isInteger(NewInTy))
1963 assert(0 && "Cannot promote Legal Integer SETCC yet");
1964 else {
1965 Tmp1 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp1);
1966 Tmp2 = DAG.getNode(ISD::FP_EXTEND, NewInTy, Tmp2);
1967 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00001968 Tmp1 = LegalizeOp(Tmp1);
1969 Tmp2 = LegalizeOp(Tmp2);
1970 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
Evan Cheng433f8ac2006-01-17 19:47:13 +00001971 Result = LegalizeOp(Result);
Andrew Lenharth5e3efbc2005-08-29 20:46:51 +00001972 break;
Andrew Lenharthae355752005-11-30 17:12:26 +00001973 }
Nate Begemanb942a3d2005-08-23 04:29:48 +00001974 case TargetLowering::Expand:
1975 // Expand a setcc node into a select_cc of the same condition, lhs, and
1976 // rhs that selects between const 1 (true) and const 0 (false).
1977 MVT::ValueType VT = Node->getValueType(0);
1978 Result = DAG.getNode(ISD::SELECT_CC, VT, Tmp1, Tmp2,
1979 DAG.getConstant(1, VT), DAG.getConstant(0, VT),
1980 Node->getOperand(2));
Nate Begemanb942a3d2005-08-23 04:29:48 +00001981 break;
1982 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00001983 break;
Chris Lattnere1bd8222005-01-11 05:57:22 +00001984 case ISD::MEMSET:
1985 case ISD::MEMCPY:
1986 case ISD::MEMMOVE: {
Chris Lattnerdeb692e2005-02-01 18:38:28 +00001987 Tmp1 = LegalizeOp(Node->getOperand(0)); // Chain
Chris Lattnere5605212005-01-28 22:29:18 +00001988 Tmp2 = LegalizeOp(Node->getOperand(1)); // Pointer
1989
1990 if (Node->getOpcode() == ISD::MEMSET) { // memset = ubyte
1991 switch (getTypeAction(Node->getOperand(2).getValueType())) {
1992 case Expand: assert(0 && "Cannot expand a byte!");
1993 case Legal:
Chris Lattnerdeb692e2005-02-01 18:38:28 +00001994 Tmp3 = LegalizeOp(Node->getOperand(2));
Chris Lattnere5605212005-01-28 22:29:18 +00001995 break;
1996 case Promote:
Chris Lattnerdeb692e2005-02-01 18:38:28 +00001997 Tmp3 = PromoteOp(Node->getOperand(2));
Chris Lattnere5605212005-01-28 22:29:18 +00001998 break;
1999 }
2000 } else {
Misha Brukmanedf128a2005-04-21 22:36:52 +00002001 Tmp3 = LegalizeOp(Node->getOperand(2)); // memcpy/move = pointer,
Chris Lattnere5605212005-01-28 22:29:18 +00002002 }
Chris Lattner272455b2005-02-02 03:44:41 +00002003
2004 SDOperand Tmp4;
2005 switch (getTypeAction(Node->getOperand(3).getValueType())) {
Chris Lattner6814f152005-07-13 01:42:45 +00002006 case Expand: {
2007 // Length is too big, just take the lo-part of the length.
2008 SDOperand HiPart;
2009 ExpandOp(Node->getOperand(3), HiPart, Tmp4);
2010 break;
2011 }
Chris Lattnere5605212005-01-28 22:29:18 +00002012 case Legal:
2013 Tmp4 = LegalizeOp(Node->getOperand(3));
Chris Lattnere5605212005-01-28 22:29:18 +00002014 break;
2015 case Promote:
2016 Tmp4 = PromoteOp(Node->getOperand(3));
Chris Lattner272455b2005-02-02 03:44:41 +00002017 break;
2018 }
2019
2020 SDOperand Tmp5;
2021 switch (getTypeAction(Node->getOperand(4).getValueType())) { // uint
2022 case Expand: assert(0 && "Cannot expand this yet!");
2023 case Legal:
2024 Tmp5 = LegalizeOp(Node->getOperand(4));
2025 break;
2026 case Promote:
Chris Lattnere5605212005-01-28 22:29:18 +00002027 Tmp5 = PromoteOp(Node->getOperand(4));
2028 break;
2029 }
Chris Lattner55ba8fb2005-01-16 07:29:19 +00002030
2031 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
2032 default: assert(0 && "This action not implemented for this operation!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002033 case TargetLowering::Custom:
2034 isCustom = true;
2035 // FALLTHROUGH
Chris Lattner55ba8fb2005-01-16 07:29:19 +00002036 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002037 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3, Tmp4, Tmp5);
Chris Lattner456a93a2006-01-28 07:39:30 +00002038 if (isCustom) {
2039 Tmp1 = TLI.LowerOperation(Result, DAG);
2040 if (Tmp1.Val) Result = Tmp1;
2041 }
Chris Lattner55ba8fb2005-01-16 07:29:19 +00002042 break;
2043 case TargetLowering::Expand: {
Chris Lattnere1bd8222005-01-11 05:57:22 +00002044 // Otherwise, the target does not support this operation. Lower the
2045 // operation to an explicit libcall as appropriate.
2046 MVT::ValueType IntPtr = TLI.getPointerTy();
Owen Andersona69571c2006-05-03 01:29:57 +00002047 const Type *IntPtrTy = TLI.getTargetData()->getIntPtrType();
Chris Lattnere1bd8222005-01-11 05:57:22 +00002048 std::vector<std::pair<SDOperand, const Type*> > Args;
2049
Reid Spencer3bfbf4e2005-01-12 14:53:45 +00002050 const char *FnName = 0;
Chris Lattnere1bd8222005-01-11 05:57:22 +00002051 if (Node->getOpcode() == ISD::MEMSET) {
2052 Args.push_back(std::make_pair(Tmp2, IntPtrTy));
Chris Lattnerdca7abe2006-02-20 06:38:35 +00002053 // Extend the (previously legalized) ubyte argument to be an int value
2054 // for the call.
2055 if (Tmp3.getValueType() > MVT::i32)
2056 Tmp3 = DAG.getNode(ISD::TRUNCATE, MVT::i32, Tmp3);
2057 else
2058 Tmp3 = DAG.getNode(ISD::ZERO_EXTEND, MVT::i32, Tmp3);
Chris Lattnere1bd8222005-01-11 05:57:22 +00002059 Args.push_back(std::make_pair(Tmp3, Type::IntTy));
2060 Args.push_back(std::make_pair(Tmp4, IntPtrTy));
2061
2062 FnName = "memset";
2063 } else if (Node->getOpcode() == ISD::MEMCPY ||
2064 Node->getOpcode() == ISD::MEMMOVE) {
2065 Args.push_back(std::make_pair(Tmp2, IntPtrTy));
2066 Args.push_back(std::make_pair(Tmp3, IntPtrTy));
2067 Args.push_back(std::make_pair(Tmp4, IntPtrTy));
2068 FnName = Node->getOpcode() == ISD::MEMMOVE ? "memmove" : "memcpy";
2069 } else {
2070 assert(0 && "Unknown op!");
2071 }
Chris Lattner45982da2005-05-12 16:53:42 +00002072
Chris Lattnere1bd8222005-01-11 05:57:22 +00002073 std::pair<SDOperand,SDOperand> CallResult =
Chris Lattneradf6a962005-05-13 18:50:42 +00002074 TLI.LowerCallTo(Tmp1, Type::VoidTy, false, CallingConv::C, false,
Chris Lattnere1bd8222005-01-11 05:57:22 +00002075 DAG.getExternalSymbol(FnName, IntPtr), Args, DAG);
Chris Lattner456a93a2006-01-28 07:39:30 +00002076 Result = CallResult.second;
Chris Lattner55ba8fb2005-01-16 07:29:19 +00002077 break;
2078 }
Chris Lattnere1bd8222005-01-11 05:57:22 +00002079 }
2080 break;
2081 }
Chris Lattner52d08bd2005-05-09 20:23:03 +00002082
Chris Lattner5b359c62005-04-02 04:00:59 +00002083 case ISD::SHL_PARTS:
2084 case ISD::SRA_PARTS:
2085 case ISD::SRL_PARTS: {
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002086 SmallVector<SDOperand, 8> Ops;
Chris Lattner84f67882005-01-20 18:52:28 +00002087 bool Changed = false;
2088 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
2089 Ops.push_back(LegalizeOp(Node->getOperand(i)));
2090 Changed |= Ops.back() != Node->getOperand(i);
2091 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002092 if (Changed)
Chris Lattnerf06f35e2006-08-08 01:09:31 +00002093 Result = DAG.UpdateNodeOperands(Result, &Ops[0], Ops.size());
Chris Lattner2c8086f2005-04-02 05:00:07 +00002094
Evan Cheng05a2d562006-01-09 18:31:59 +00002095 switch (TLI.getOperationAction(Node->getOpcode(),
2096 Node->getValueType(0))) {
2097 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002098 case TargetLowering::Legal: break;
2099 case TargetLowering::Custom:
2100 Tmp1 = TLI.LowerOperation(Result, DAG);
2101 if (Tmp1.Val) {
2102 SDOperand Tmp2, RetVal(0, 0);
Evan Cheng05a2d562006-01-09 18:31:59 +00002103 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i) {
Chris Lattner456a93a2006-01-28 07:39:30 +00002104 Tmp2 = LegalizeOp(Tmp1.getValue(i));
Evan Cheng05a2d562006-01-09 18:31:59 +00002105 AddLegalizedOperand(SDOperand(Node, i), Tmp2);
2106 if (i == Op.ResNo)
Evan Cheng12f22742006-01-19 04:54:52 +00002107 RetVal = Tmp2;
Evan Cheng05a2d562006-01-09 18:31:59 +00002108 }
Chris Lattner269f8c02006-01-10 19:43:26 +00002109 assert(RetVal.Val && "Illegal result number");
Evan Cheng05a2d562006-01-09 18:31:59 +00002110 return RetVal;
2111 }
Evan Cheng05a2d562006-01-09 18:31:59 +00002112 break;
2113 }
2114
Chris Lattner2c8086f2005-04-02 05:00:07 +00002115 // Since these produce multiple values, make sure to remember that we
2116 // legalized all of them.
2117 for (unsigned i = 0, e = Node->getNumValues(); i != e; ++i)
2118 AddLegalizedOperand(SDOperand(Node, i), Result.getValue(i));
2119 return Result.getValue(Op.ResNo);
Chris Lattner84f67882005-01-20 18:52:28 +00002120 }
Chris Lattner2c8086f2005-04-02 05:00:07 +00002121
2122 // Binary operators
Chris Lattner3e928bb2005-01-07 07:47:09 +00002123 case ISD::ADD:
2124 case ISD::SUB:
2125 case ISD::MUL:
Nate Begemanc7c16572005-04-11 03:01:51 +00002126 case ISD::MULHS:
2127 case ISD::MULHU:
Chris Lattner3e928bb2005-01-07 07:47:09 +00002128 case ISD::UDIV:
2129 case ISD::SDIV:
Chris Lattner3e928bb2005-01-07 07:47:09 +00002130 case ISD::AND:
2131 case ISD::OR:
2132 case ISD::XOR:
Chris Lattner03c0cf82005-01-07 21:45:56 +00002133 case ISD::SHL:
2134 case ISD::SRL:
2135 case ISD::SRA:
Chris Lattner01b3d732005-09-28 22:28:18 +00002136 case ISD::FADD:
2137 case ISD::FSUB:
2138 case ISD::FMUL:
2139 case ISD::FDIV:
Chris Lattner3e928bb2005-01-07 07:47:09 +00002140 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
Andrew Lenharthf2eb1392005-07-05 19:52:39 +00002141 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2142 case Expand: assert(0 && "Not possible");
2143 case Legal:
2144 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2145 break;
2146 case Promote:
2147 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2148 break;
2149 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002150
2151 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
Chris Lattner456a93a2006-01-28 07:39:30 +00002152
Andrew Lenharthe8f65f12005-12-24 23:42:32 +00002153 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
Chris Lattnerbc70cf82006-04-02 03:57:31 +00002154 default: assert(0 && "BinOp legalize operation not supported");
Chris Lattner456a93a2006-01-28 07:39:30 +00002155 case TargetLowering::Legal: break;
2156 case TargetLowering::Custom:
2157 Tmp1 = TLI.LowerOperation(Result, DAG);
2158 if (Tmp1.Val) Result = Tmp1;
Andrew Lenharth57030e32005-12-25 01:07:37 +00002159 break;
Chris Lattnerbc70cf82006-04-02 03:57:31 +00002160 case TargetLowering::Expand: {
Evan Cheng52cc1ea2006-09-18 21:49:04 +00002161 if (Node->getValueType(0) == MVT::i32) {
2162 switch (Node->getOpcode()) {
2163 default: assert(0 && "Do not know how to expand this integer BinOp!");
2164 case ISD::UDIV:
2165 case ISD::SDIV:
2166 const char *FnName = Node->getOpcode() == ISD::UDIV
2167 ? "__udivsi3" : "__divsi3";
2168 SDOperand Dummy;
2169 Result = ExpandLibCall(FnName, Node, Dummy);
2170 };
2171 break;
2172 }
2173
Chris Lattnerbc70cf82006-04-02 03:57:31 +00002174 assert(MVT::isVector(Node->getValueType(0)) &&
2175 "Cannot expand this binary operator!");
2176 // Expand the operation into a bunch of nasty scalar code.
Chris Lattnerbd564bf2006-08-08 02:23:42 +00002177 SmallVector<SDOperand, 8> Ops;
Chris Lattnerbc70cf82006-04-02 03:57:31 +00002178 MVT::ValueType EltVT = MVT::getVectorBaseType(Node->getValueType(0));
2179 MVT::ValueType PtrVT = TLI.getPointerTy();
2180 for (unsigned i = 0, e = MVT::getVectorNumElements(Node->getValueType(0));
2181 i != e; ++i) {
2182 SDOperand Idx = DAG.getConstant(i, PtrVT);
2183 SDOperand LHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp1, Idx);
2184 SDOperand RHS = DAG.getNode(ISD::EXTRACT_VECTOR_ELT, EltVT, Tmp2, Idx);
2185 Ops.push_back(DAG.getNode(Node->getOpcode(), EltVT, LHS, RHS));
2186 }
Chris Lattnerbd564bf2006-08-08 02:23:42 +00002187 Result = DAG.getNode(ISD::BUILD_VECTOR, Node->getValueType(0),
2188 &Ops[0], Ops.size());
Chris Lattnerbc70cf82006-04-02 03:57:31 +00002189 break;
2190 }
Evan Chengcc987612006-04-12 21:20:24 +00002191 case TargetLowering::Promote: {
2192 switch (Node->getOpcode()) {
2193 default: assert(0 && "Do not know how to promote this BinOp!");
2194 case ISD::AND:
2195 case ISD::OR:
2196 case ISD::XOR: {
2197 MVT::ValueType OVT = Node->getValueType(0);
2198 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2199 assert(MVT::isVector(OVT) && "Cannot promote this BinOp!");
2200 // Bit convert each of the values to the new type.
2201 Tmp1 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp1);
2202 Tmp2 = DAG.getNode(ISD::BIT_CONVERT, NVT, Tmp2);
2203 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
2204 // Bit convert the result back the original type.
2205 Result = DAG.getNode(ISD::BIT_CONVERT, OVT, Result);
2206 break;
2207 }
2208 }
2209 }
Andrew Lenharthe8f65f12005-12-24 23:42:32 +00002210 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00002211 break;
Chris Lattnera09f8482006-03-05 05:09:38 +00002212
2213 case ISD::FCOPYSIGN: // FCOPYSIGN does not require LHS/RHS to match type!
2214 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2215 switch (getTypeAction(Node->getOperand(1).getValueType())) {
2216 case Expand: assert(0 && "Not possible");
2217 case Legal:
2218 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the RHS.
2219 break;
2220 case Promote:
2221 Tmp2 = PromoteOp(Node->getOperand(1)); // Promote the RHS.
2222 break;
2223 }
2224
2225 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2226
2227 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
2228 default: assert(0 && "Operation not supported");
2229 case TargetLowering::Custom:
2230 Tmp1 = TLI.LowerOperation(Result, DAG);
2231 if (Tmp1.Val) Result = Tmp1;
Chris Lattner8f4191d2006-03-13 06:08:38 +00002232 break;
Chris Lattnera09f8482006-03-05 05:09:38 +00002233 case TargetLowering::Legal: break;
2234 case TargetLowering::Expand:
Chris Lattner8f4191d2006-03-13 06:08:38 +00002235 // If this target supports fabs/fneg natively, do this efficiently.
2236 if (TLI.isOperationLegal(ISD::FABS, Tmp1.getValueType()) &&
2237 TLI.isOperationLegal(ISD::FNEG, Tmp1.getValueType())) {
2238 // Get the sign bit of the RHS.
2239 MVT::ValueType IVT =
2240 Tmp2.getValueType() == MVT::f32 ? MVT::i32 : MVT::i64;
2241 SDOperand SignBit = DAG.getNode(ISD::BIT_CONVERT, IVT, Tmp2);
2242 SignBit = DAG.getSetCC(TLI.getSetCCResultTy(),
2243 SignBit, DAG.getConstant(0, IVT), ISD::SETLT);
2244 // Get the absolute value of the result.
2245 SDOperand AbsVal = DAG.getNode(ISD::FABS, Tmp1.getValueType(), Tmp1);
2246 // Select between the nabs and abs value based on the sign bit of
2247 // the input.
2248 Result = DAG.getNode(ISD::SELECT, AbsVal.getValueType(), SignBit,
2249 DAG.getNode(ISD::FNEG, AbsVal.getValueType(),
2250 AbsVal),
2251 AbsVal);
2252 Result = LegalizeOp(Result);
2253 break;
2254 }
2255
2256 // Otherwise, do bitwise ops!
2257
2258 // copysign -> copysignf/copysign libcall.
Chris Lattnera09f8482006-03-05 05:09:38 +00002259 const char *FnName;
2260 if (Node->getValueType(0) == MVT::f32) {
2261 FnName = "copysignf";
2262 if (Tmp2.getValueType() != MVT::f32) // Force operands to match type.
2263 Result = DAG.UpdateNodeOperands(Result, Tmp1,
2264 DAG.getNode(ISD::FP_ROUND, MVT::f32, Tmp2));
2265 } else {
2266 FnName = "copysign";
2267 if (Tmp2.getValueType() != MVT::f64) // Force operands to match type.
2268 Result = DAG.UpdateNodeOperands(Result, Tmp1,
2269 DAG.getNode(ISD::FP_EXTEND, MVT::f64, Tmp2));
2270 }
2271 SDOperand Dummy;
2272 Result = ExpandLibCall(FnName, Node, Dummy);
2273 break;
2274 }
2275 break;
2276
Nate Begeman551bf3f2006-02-17 05:43:56 +00002277 case ISD::ADDC:
2278 case ISD::SUBC:
2279 Tmp1 = LegalizeOp(Node->getOperand(0));
2280 Tmp2 = LegalizeOp(Node->getOperand(1));
2281 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
2282 // Since this produces two values, make sure to remember that we legalized
2283 // both of them.
2284 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2285 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2286 return Result;
Misha Brukmanedf128a2005-04-21 22:36:52 +00002287
Nate Begeman551bf3f2006-02-17 05:43:56 +00002288 case ISD::ADDE:
2289 case ISD::SUBE:
2290 Tmp1 = LegalizeOp(Node->getOperand(0));
2291 Tmp2 = LegalizeOp(Node->getOperand(1));
2292 Tmp3 = LegalizeOp(Node->getOperand(2));
2293 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3);
2294 // Since this produces two values, make sure to remember that we legalized
2295 // both of them.
2296 AddLegalizedOperand(SDOperand(Node, 0), Result.getValue(0));
2297 AddLegalizedOperand(SDOperand(Node, 1), Result.getValue(1));
2298 return Result;
Nate Begeman551bf3f2006-02-17 05:43:56 +00002299
Nate Begeman419f8b62005-10-18 00:27:41 +00002300 case ISD::BUILD_PAIR: {
2301 MVT::ValueType PairTy = Node->getValueType(0);
2302 // TODO: handle the case where the Lo and Hi operands are not of legal type
2303 Tmp1 = LegalizeOp(Node->getOperand(0)); // Lo
2304 Tmp2 = LegalizeOp(Node->getOperand(1)); // Hi
2305 switch (TLI.getOperationAction(ISD::BUILD_PAIR, PairTy)) {
Chris Lattner456a93a2006-01-28 07:39:30 +00002306 case TargetLowering::Promote:
2307 case TargetLowering::Custom:
2308 assert(0 && "Cannot promote/custom this yet!");
Nate Begeman419f8b62005-10-18 00:27:41 +00002309 case TargetLowering::Legal:
2310 if (Tmp1 != Node->getOperand(0) || Tmp2 != Node->getOperand(1))
2311 Result = DAG.getNode(ISD::BUILD_PAIR, PairTy, Tmp1, Tmp2);
2312 break;
Nate Begeman419f8b62005-10-18 00:27:41 +00002313 case TargetLowering::Expand:
2314 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, PairTy, Tmp1);
2315 Tmp2 = DAG.getNode(ISD::ANY_EXTEND, PairTy, Tmp2);
2316 Tmp2 = DAG.getNode(ISD::SHL, PairTy, Tmp2,
2317 DAG.getConstant(MVT::getSizeInBits(PairTy)/2,
2318 TLI.getShiftAmountTy()));
Chris Lattner456a93a2006-01-28 07:39:30 +00002319 Result = DAG.getNode(ISD::OR, PairTy, Tmp1, Tmp2);
Nate Begeman419f8b62005-10-18 00:27:41 +00002320 break;
2321 }
2322 break;
2323 }
2324
Nate Begemanc105e192005-04-06 00:23:54 +00002325 case ISD::UREM:
2326 case ISD::SREM:
Chris Lattner01b3d732005-09-28 22:28:18 +00002327 case ISD::FREM:
Nate Begemanc105e192005-04-06 00:23:54 +00002328 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2329 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
Chris Lattner456a93a2006-01-28 07:39:30 +00002330
Nate Begemanc105e192005-04-06 00:23:54 +00002331 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
Chris Lattner456a93a2006-01-28 07:39:30 +00002332 case TargetLowering::Promote: assert(0 && "Cannot promote this yet!");
2333 case TargetLowering::Custom:
2334 isCustom = true;
2335 // FALLTHROUGH
Nate Begemanc105e192005-04-06 00:23:54 +00002336 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002337 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
Chris Lattner456a93a2006-01-28 07:39:30 +00002338 if (isCustom) {
2339 Tmp1 = TLI.LowerOperation(Result, DAG);
2340 if (Tmp1.Val) Result = Tmp1;
2341 }
Nate Begemanc105e192005-04-06 00:23:54 +00002342 break;
Chris Lattner4c64dd72005-08-03 20:31:37 +00002343 case TargetLowering::Expand:
Evan Cheng6b5578f2006-09-18 23:28:33 +00002344 unsigned DivOpc= (Node->getOpcode() == ISD::UREM) ? ISD::UDIV : ISD::SDIV;
Chris Lattner4c64dd72005-08-03 20:31:37 +00002345 if (MVT::isInteger(Node->getValueType(0))) {
Evan Cheng52cc1ea2006-09-18 21:49:04 +00002346 if (TLI.getOperationAction(DivOpc, Node->getValueType(0)) ==
2347 TargetLowering::Legal) {
2348 // X % Y -> X-X/Y*Y
2349 MVT::ValueType VT = Node->getValueType(0);
Evan Cheng6b5578f2006-09-18 23:28:33 +00002350 Result = DAG.getNode(DivOpc, VT, Tmp1, Tmp2);
Evan Cheng52cc1ea2006-09-18 21:49:04 +00002351 Result = DAG.getNode(ISD::MUL, VT, Result, Tmp2);
2352 Result = DAG.getNode(ISD::SUB, VT, Tmp1, Result);
2353 } else {
2354 assert(Node->getValueType(0) == MVT::i32 &&
2355 "Cannot expand this binary operator!");
2356 const char *FnName = Node->getOpcode() == ISD::UREM
2357 ? "__umodsi3" : "__modsi3";
2358 SDOperand Dummy;
2359 Result = ExpandLibCall(FnName, Node, Dummy);
2360 }
Chris Lattner4c64dd72005-08-03 20:31:37 +00002361 } else {
2362 // Floating point mod -> fmod libcall.
2363 const char *FnName = Node->getValueType(0) == MVT::f32 ? "fmodf":"fmod";
2364 SDOperand Dummy;
Chris Lattner9c6b4b82006-01-28 04:28:26 +00002365 Result = ExpandLibCall(FnName, Node, Dummy);
Nate Begemanc105e192005-04-06 00:23:54 +00002366 }
2367 break;
2368 }
2369 break;
Nate Begemanacc398c2006-01-25 18:21:52 +00002370 case ISD::VAARG: {
2371 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2372 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2373
Chris Lattner5c62f332006-01-28 07:42:08 +00002374 MVT::ValueType VT = Node->getValueType(0);
Nate Begemanacc398c2006-01-25 18:21:52 +00002375 switch (TLI.getOperationAction(Node->getOpcode(), MVT::Other)) {
2376 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002377 case TargetLowering::Custom:
2378 isCustom = true;
2379 // FALLTHROUGH
Nate Begemanacc398c2006-01-25 18:21:52 +00002380 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002381 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2382 Result = Result.getValue(0);
Chris Lattner456a93a2006-01-28 07:39:30 +00002383 Tmp1 = Result.getValue(1);
2384
2385 if (isCustom) {
2386 Tmp2 = TLI.LowerOperation(Result, DAG);
2387 if (Tmp2.Val) {
2388 Result = LegalizeOp(Tmp2);
2389 Tmp1 = LegalizeOp(Tmp2.getValue(1));
2390 }
2391 }
Nate Begemanacc398c2006-01-25 18:21:52 +00002392 break;
2393 case TargetLowering::Expand: {
2394 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
2395 Node->getOperand(2));
2396 // Increment the pointer, VAList, to the next vaarg
2397 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
2398 DAG.getConstant(MVT::getSizeInBits(VT)/8,
2399 TLI.getPointerTy()));
2400 // Store the incremented VAList to the legalized pointer
2401 Tmp3 = DAG.getNode(ISD::STORE, MVT::Other, VAList.getValue(1), Tmp3, Tmp2,
2402 Node->getOperand(2));
2403 // Load the actual argument out of the pointer VAList
2404 Result = DAG.getLoad(VT, Tmp3, VAList, DAG.getSrcValue(0));
Chris Lattner456a93a2006-01-28 07:39:30 +00002405 Tmp1 = LegalizeOp(Result.getValue(1));
Nate Begemanacc398c2006-01-25 18:21:52 +00002406 Result = LegalizeOp(Result);
2407 break;
2408 }
2409 }
2410 // Since VAARG produces two values, make sure to remember that we
2411 // legalized both of them.
2412 AddLegalizedOperand(SDOperand(Node, 0), Result);
Chris Lattner456a93a2006-01-28 07:39:30 +00002413 AddLegalizedOperand(SDOperand(Node, 1), Tmp1);
2414 return Op.ResNo ? Tmp1 : Result;
Nate Begemanacc398c2006-01-25 18:21:52 +00002415 }
2416
2417 case ISD::VACOPY:
2418 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2419 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the dest pointer.
2420 Tmp3 = LegalizeOp(Node->getOperand(2)); // Legalize the source pointer.
2421
2422 switch (TLI.getOperationAction(ISD::VACOPY, MVT::Other)) {
2423 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002424 case TargetLowering::Custom:
2425 isCustom = true;
2426 // FALLTHROUGH
Nate Begemanacc398c2006-01-25 18:21:52 +00002427 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002428 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Tmp3,
2429 Node->getOperand(3), Node->getOperand(4));
Chris Lattner456a93a2006-01-28 07:39:30 +00002430 if (isCustom) {
2431 Tmp1 = TLI.LowerOperation(Result, DAG);
2432 if (Tmp1.Val) Result = Tmp1;
2433 }
Nate Begemanacc398c2006-01-25 18:21:52 +00002434 break;
2435 case TargetLowering::Expand:
2436 // This defaults to loading a pointer from the input and storing it to the
2437 // output, returning the chain.
2438 Tmp4 = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp3, Node->getOperand(3));
2439 Result = DAG.getNode(ISD::STORE, MVT::Other, Tmp4.getValue(1), Tmp4, Tmp2,
2440 Node->getOperand(4));
Nate Begemanacc398c2006-01-25 18:21:52 +00002441 break;
2442 }
2443 break;
2444
2445 case ISD::VAEND:
2446 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2447 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2448
2449 switch (TLI.getOperationAction(ISD::VAEND, MVT::Other)) {
2450 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002451 case TargetLowering::Custom:
2452 isCustom = true;
2453 // FALLTHROUGH
Nate Begemanacc398c2006-01-25 18:21:52 +00002454 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002455 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
Chris Lattner456a93a2006-01-28 07:39:30 +00002456 if (isCustom) {
2457 Tmp1 = TLI.LowerOperation(Tmp1, DAG);
2458 if (Tmp1.Val) Result = Tmp1;
2459 }
Nate Begemanacc398c2006-01-25 18:21:52 +00002460 break;
2461 case TargetLowering::Expand:
2462 Result = Tmp1; // Default to a no-op, return the chain
2463 break;
2464 }
2465 break;
2466
2467 case ISD::VASTART:
2468 Tmp1 = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
2469 Tmp2 = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
2470
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002471 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2, Node->getOperand(2));
2472
Nate Begemanacc398c2006-01-25 18:21:52 +00002473 switch (TLI.getOperationAction(ISD::VASTART, MVT::Other)) {
2474 default: assert(0 && "This action is not supported yet!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002475 case TargetLowering::Legal: break;
2476 case TargetLowering::Custom:
2477 Tmp1 = TLI.LowerOperation(Result, DAG);
2478 if (Tmp1.Val) Result = Tmp1;
Nate Begemanacc398c2006-01-25 18:21:52 +00002479 break;
2480 }
2481 break;
2482
Nate Begeman35ef9132006-01-11 21:21:00 +00002483 case ISD::ROTL:
2484 case ISD::ROTR:
2485 Tmp1 = LegalizeOp(Node->getOperand(0)); // LHS
2486 Tmp2 = LegalizeOp(Node->getOperand(1)); // RHS
Chris Lattner456a93a2006-01-28 07:39:30 +00002487
2488 assert(TLI.isOperationLegal(Node->getOpcode(), Node->getValueType(0)) &&
2489 "Cannot handle this yet!");
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002490 Result = DAG.UpdateNodeOperands(Result, Tmp1, Tmp2);
Nate Begeman35ef9132006-01-11 21:21:00 +00002491 break;
2492
Nate Begemand88fc032006-01-14 03:14:10 +00002493 case ISD::BSWAP:
2494 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
2495 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
Chris Lattner456a93a2006-01-28 07:39:30 +00002496 case TargetLowering::Custom:
2497 assert(0 && "Cannot custom legalize this yet!");
2498 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002499 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Chris Lattner456a93a2006-01-28 07:39:30 +00002500 break;
2501 case TargetLowering::Promote: {
2502 MVT::ValueType OVT = Tmp1.getValueType();
2503 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
2504 unsigned DiffBits = getSizeInBits(NVT) - getSizeInBits(OVT);
Nate Begemand88fc032006-01-14 03:14:10 +00002505
Chris Lattner456a93a2006-01-28 07:39:30 +00002506 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2507 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
2508 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
2509 DAG.getConstant(DiffBits, TLI.getShiftAmountTy()));
2510 break;
2511 }
2512 case TargetLowering::Expand:
2513 Result = ExpandBSWAP(Tmp1);
2514 break;
Nate Begemand88fc032006-01-14 03:14:10 +00002515 }
2516 break;
2517
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002518 case ISD::CTPOP:
2519 case ISD::CTTZ:
2520 case ISD::CTLZ:
2521 Tmp1 = LegalizeOp(Node->getOperand(0)); // Op
2522 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
Chris Lattner456a93a2006-01-28 07:39:30 +00002523 case TargetLowering::Custom: assert(0 && "Cannot custom handle this yet!");
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002524 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002525 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002526 break;
2527 case TargetLowering::Promote: {
2528 MVT::ValueType OVT = Tmp1.getValueType();
2529 MVT::ValueType NVT = TLI.getTypeToPromoteTo(Node->getOpcode(), OVT);
Chris Lattneredb1add2005-05-11 04:51:16 +00002530
2531 // Zero extend the argument.
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002532 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
2533 // Perform the larger operation, then subtract if needed.
2534 Tmp1 = DAG.getNode(Node->getOpcode(), Node->getValueType(0), Tmp1);
Chris Lattner456a93a2006-01-28 07:39:30 +00002535 switch (Node->getOpcode()) {
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002536 case ISD::CTPOP:
2537 Result = Tmp1;
2538 break;
2539 case ISD::CTTZ:
2540 //if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00002541 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
2542 DAG.getConstant(getSizeInBits(NVT), NVT),
2543 ISD::SETEQ);
Jeff Cohen00b168892005-07-27 06:12:32 +00002544 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002545 DAG.getConstant(getSizeInBits(OVT),NVT), Tmp1);
2546 break;
2547 case ISD::CTLZ:
Chris Lattner456a93a2006-01-28 07:39:30 +00002548 // Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
Jeff Cohen00b168892005-07-27 06:12:32 +00002549 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
2550 DAG.getConstant(getSizeInBits(NVT) -
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002551 getSizeInBits(OVT), NVT));
2552 break;
2553 }
2554 break;
2555 }
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002556 case TargetLowering::Expand:
Chris Lattner456a93a2006-01-28 07:39:30 +00002557 Result = ExpandBitCount(Node->getOpcode(), Tmp1);
Andrew Lenharth691ef2b2005-05-03 17:19:30 +00002558 break;
2559 }
2560 break;
Jeff Cohen00b168892005-07-27 06:12:32 +00002561
Chris Lattner2c8086f2005-04-02 05:00:07 +00002562 // Unary operators
2563 case ISD::FABS:
2564 case ISD::FNEG:
Chris Lattnerda6ba872005-04-28 21:44:33 +00002565 case ISD::FSQRT:
2566 case ISD::FSIN:
2567 case ISD::FCOS:
Chris Lattner2c8086f2005-04-02 05:00:07 +00002568 Tmp1 = LegalizeOp(Node->getOperand(0));
2569 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))) {
Chris Lattner456a93a2006-01-28 07:39:30 +00002570 case TargetLowering::Promote:
2571 case TargetLowering::Custom:
Evan Cheng59ad7812006-01-31 18:14:25 +00002572 isCustom = true;
2573 // FALLTHROUGH
Chris Lattner2c8086f2005-04-02 05:00:07 +00002574 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002575 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Evan Cheng59ad7812006-01-31 18:14:25 +00002576 if (isCustom) {
2577 Tmp1 = TLI.LowerOperation(Result, DAG);
2578 if (Tmp1.Val) Result = Tmp1;
2579 }
Chris Lattner2c8086f2005-04-02 05:00:07 +00002580 break;
Chris Lattner2c8086f2005-04-02 05:00:07 +00002581 case TargetLowering::Expand:
Chris Lattner456a93a2006-01-28 07:39:30 +00002582 switch (Node->getOpcode()) {
2583 default: assert(0 && "Unreachable!");
2584 case ISD::FNEG:
Chris Lattner2c8086f2005-04-02 05:00:07 +00002585 // Expand Y = FNEG(X) -> Y = SUB -0.0, X
2586 Tmp2 = DAG.getConstantFP(-0.0, Node->getValueType(0));
Chris Lattner456a93a2006-01-28 07:39:30 +00002587 Result = DAG.getNode(ISD::FSUB, Node->getValueType(0), Tmp2, Tmp1);
Chris Lattnerf76e7dc2005-04-30 04:43:14 +00002588 break;
Chris Lattnerf76e7dc2005-04-30 04:43:14 +00002589 case ISD::FABS: {
Chris Lattner4af6e0d2005-04-02 05:26:37 +00002590 // Expand Y = FABS(X) -> Y = (X >u 0.0) ? X : fneg(X).
2591 MVT::ValueType VT = Node->getValueType(0);
2592 Tmp2 = DAG.getConstantFP(0.0, VT);
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00002593 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1, Tmp2, ISD::SETUGT);
Chris Lattner4af6e0d2005-04-02 05:26:37 +00002594 Tmp3 = DAG.getNode(ISD::FNEG, VT, Tmp1);
2595 Result = DAG.getNode(ISD::SELECT, VT, Tmp2, Tmp1, Tmp3);
Chris Lattnerf76e7dc2005-04-30 04:43:14 +00002596 break;
2597 }
2598 case ISD::FSQRT:
2599 case ISD::FSIN:
2600 case ISD::FCOS: {
2601 MVT::ValueType VT = Node->getValueType(0);
Chris Lattnerf76e7dc2005-04-30 04:43:14 +00002602 const char *FnName = 0;
2603 switch(Node->getOpcode()) {
2604 case ISD::FSQRT: FnName = VT == MVT::f32 ? "sqrtf" : "sqrt"; break;
2605 case ISD::FSIN: FnName = VT == MVT::f32 ? "sinf" : "sin"; break;
2606 case ISD::FCOS: FnName = VT == MVT::f32 ? "cosf" : "cos"; break;
2607 default: assert(0 && "Unreachable!");
2608 }
Nate Begeman2ac4fc02005-08-04 21:43:28 +00002609 SDOperand Dummy;
Chris Lattner9c6b4b82006-01-28 04:28:26 +00002610 Result = ExpandLibCall(FnName, Node, Dummy);
Chris Lattnerf76e7dc2005-04-30 04:43:14 +00002611 break;
2612 }
Chris Lattner2c8086f2005-04-02 05:00:07 +00002613 }
2614 break;
2615 }
2616 break;
Chris Lattner6ddf8ed2006-09-09 06:03:30 +00002617 case ISD::FPOWI: {
2618 // We always lower FPOWI into a libcall. No target support it yet.
2619 const char *FnName = Node->getValueType(0) == MVT::f32
2620 ? "__powisf2" : "__powidf2";
2621 SDOperand Dummy;
2622 Result = ExpandLibCall(FnName, Node, Dummy);
2623 break;
2624 }
Chris Lattner35481892005-12-23 00:16:34 +00002625 case ISD::BIT_CONVERT:
Chris Lattner67993f72006-01-23 07:30:46 +00002626 if (!isTypeLegal(Node->getOperand(0).getValueType())) {
Chris Lattner35481892005-12-23 00:16:34 +00002627 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
Chris Lattner67993f72006-01-23 07:30:46 +00002628 } else {
Chris Lattner35481892005-12-23 00:16:34 +00002629 switch (TLI.getOperationAction(ISD::BIT_CONVERT,
2630 Node->getOperand(0).getValueType())) {
2631 default: assert(0 && "Unknown operation action!");
2632 case TargetLowering::Expand:
2633 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
2634 break;
2635 case TargetLowering::Legal:
2636 Tmp1 = LegalizeOp(Node->getOperand(0));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002637 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Chris Lattner35481892005-12-23 00:16:34 +00002638 break;
2639 }
2640 }
2641 break;
Chris Lattnerd1f04d42006-03-24 02:26:29 +00002642 case ISD::VBIT_CONVERT: {
2643 assert(Op.getOperand(0).getValueType() == MVT::Vector &&
2644 "Can only have VBIT_CONVERT where input or output is MVT::Vector!");
2645
2646 // The input has to be a vector type, we have to either scalarize it, pack
2647 // it, or convert it based on whether the input vector type is legal.
2648 SDNode *InVal = Node->getOperand(0).Val;
2649 unsigned NumElems =
2650 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
2651 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
2652
2653 // Figure out if there is a Packed type corresponding to this Vector
2654 // type. If so, convert to the packed type.
2655 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
2656 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
2657 // Turn this into a bit convert of the packed input.
2658 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
2659 PackVectorOp(Node->getOperand(0), TVT));
2660 break;
2661 } else if (NumElems == 1) {
2662 // Turn this into a bit convert of the scalar input.
2663 Result = DAG.getNode(ISD::BIT_CONVERT, Node->getValueType(0),
2664 PackVectorOp(Node->getOperand(0), EVT));
2665 break;
2666 } else {
2667 // FIXME: UNIMP! Store then reload
2668 assert(0 && "Cast from unsupported vector type not implemented yet!");
2669 }
2670 }
2671
Chris Lattner2c8086f2005-04-02 05:00:07 +00002672 // Conversion operators. The source and destination have different types.
Chris Lattnerae0aacb2005-01-08 08:08:56 +00002673 case ISD::SINT_TO_FP:
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002674 case ISD::UINT_TO_FP: {
2675 bool isSigned = Node->getOpcode() == ISD::SINT_TO_FP;
Chris Lattner3e928bb2005-01-07 07:47:09 +00002676 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2677 case Legal:
Jeff Cohend29b6aa2005-07-30 18:33:25 +00002678 switch (TLI.getOperationAction(Node->getOpcode(),
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002679 Node->getOperand(0).getValueType())) {
2680 default: assert(0 && "Unknown operation action!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002681 case TargetLowering::Custom:
2682 isCustom = true;
2683 // FALLTHROUGH
2684 case TargetLowering::Legal:
2685 Tmp1 = LegalizeOp(Node->getOperand(0));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002686 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Chris Lattner456a93a2006-01-28 07:39:30 +00002687 if (isCustom) {
2688 Tmp1 = TLI.LowerOperation(Result, DAG);
2689 if (Tmp1.Val) Result = Tmp1;
2690 }
2691 break;
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002692 case TargetLowering::Expand:
Jim Laskey6269ed12005-08-17 00:39:29 +00002693 Result = ExpandLegalINT_TO_FP(isSigned,
2694 LegalizeOp(Node->getOperand(0)),
2695 Node->getValueType(0));
Chris Lattner456a93a2006-01-28 07:39:30 +00002696 break;
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002697 case TargetLowering::Promote:
2698 Result = PromoteLegalINT_TO_FP(LegalizeOp(Node->getOperand(0)),
2699 Node->getValueType(0),
2700 isSigned);
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002701 break;
Andrew Lenharth5b5b8c22005-11-30 06:43:03 +00002702 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00002703 break;
Chris Lattnerb00a6422005-01-07 22:37:48 +00002704 case Expand:
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002705 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP,
2706 Node->getValueType(0), Node->getOperand(0));
2707 break;
2708 case Promote:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002709 Tmp1 = PromoteOp(Node->getOperand(0));
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002710 if (isSigned) {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002711 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, Tmp1.getValueType(),
2712 Tmp1, DAG.getValueType(Node->getOperand(0).getValueType()));
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002713 } else {
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002714 Tmp1 = DAG.getZeroExtendInReg(Tmp1,
2715 Node->getOperand(0).getValueType());
Chris Lattner77e77a62005-01-21 06:05:23 +00002716 }
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002717 Result = DAG.UpdateNodeOperands(Result, Tmp1);
2718 Result = LegalizeOp(Result); // The 'op' is not necessarily legal!
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002719 break;
2720 }
2721 break;
2722 }
2723 case ISD::TRUNCATE:
2724 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2725 case Legal:
2726 Tmp1 = LegalizeOp(Node->getOperand(0));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002727 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002728 break;
2729 case Expand:
2730 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2731
2732 // Since the result is legal, we should just be able to truncate the low
2733 // part of the source.
2734 Result = DAG.getNode(ISD::TRUNCATE, Node->getValueType(0), Tmp1);
2735 break;
2736 case Promote:
2737 Result = PromoteOp(Node->getOperand(0));
2738 Result = DAG.getNode(ISD::TRUNCATE, Op.getValueType(), Result);
2739 break;
2740 }
2741 break;
Jeff Cohend29b6aa2005-07-30 18:33:25 +00002742
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002743 case ISD::FP_TO_SINT:
2744 case ISD::FP_TO_UINT:
2745 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2746 case Legal:
Chris Lattnerf1fa74e2005-07-30 00:04:12 +00002747 Tmp1 = LegalizeOp(Node->getOperand(0));
2748
Chris Lattner1618beb2005-07-29 00:11:56 +00002749 switch (TLI.getOperationAction(Node->getOpcode(), Node->getValueType(0))){
2750 default: assert(0 && "Unknown operation action!");
Chris Lattner456a93a2006-01-28 07:39:30 +00002751 case TargetLowering::Custom:
2752 isCustom = true;
2753 // FALLTHROUGH
2754 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002755 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Chris Lattner456a93a2006-01-28 07:39:30 +00002756 if (isCustom) {
2757 Tmp1 = TLI.LowerOperation(Result, DAG);
2758 if (Tmp1.Val) Result = Tmp1;
2759 }
2760 break;
2761 case TargetLowering::Promote:
2762 Result = PromoteLegalFP_TO_INT(Tmp1, Node->getValueType(0),
2763 Node->getOpcode() == ISD::FP_TO_SINT);
2764 break;
Chris Lattner1618beb2005-07-29 00:11:56 +00002765 case TargetLowering::Expand:
Nate Begemand2558e32005-08-14 01:20:53 +00002766 if (Node->getOpcode() == ISD::FP_TO_UINT) {
2767 SDOperand True, False;
2768 MVT::ValueType VT = Node->getOperand(0).getValueType();
2769 MVT::ValueType NVT = Node->getValueType(0);
2770 unsigned ShiftAmt = MVT::getSizeInBits(Node->getValueType(0))-1;
2771 Tmp2 = DAG.getConstantFP((double)(1ULL << ShiftAmt), VT);
2772 Tmp3 = DAG.getSetCC(TLI.getSetCCResultTy(),
2773 Node->getOperand(0), Tmp2, ISD::SETLT);
2774 True = DAG.getNode(ISD::FP_TO_SINT, NVT, Node->getOperand(0));
2775 False = DAG.getNode(ISD::FP_TO_SINT, NVT,
Chris Lattner01b3d732005-09-28 22:28:18 +00002776 DAG.getNode(ISD::FSUB, VT, Node->getOperand(0),
Nate Begemand2558e32005-08-14 01:20:53 +00002777 Tmp2));
2778 False = DAG.getNode(ISD::XOR, NVT, False,
2779 DAG.getConstant(1ULL << ShiftAmt, NVT));
Chris Lattner456a93a2006-01-28 07:39:30 +00002780 Result = DAG.getNode(ISD::SELECT, NVT, Tmp3, True, False);
2781 break;
Nate Begemand2558e32005-08-14 01:20:53 +00002782 } else {
2783 assert(0 && "Do not know how to expand FP_TO_SINT yet!");
2784 }
2785 break;
Chris Lattner07dffd62005-08-26 00:14:16 +00002786 }
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002787 break;
2788 case Expand:
2789 assert(0 && "Shouldn't need to expand other operators here!");
2790 case Promote:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002791 Tmp1 = PromoteOp(Node->getOperand(0));
2792 Result = DAG.UpdateNodeOperands(Result, LegalizeOp(Tmp1));
2793 Result = LegalizeOp(Result);
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002794 break;
2795 }
2796 break;
Jeff Cohend29b6aa2005-07-30 18:33:25 +00002797
Chris Lattner13c78e22005-09-02 00:18:10 +00002798 case ISD::ANY_EXTEND:
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002799 case ISD::ZERO_EXTEND:
2800 case ISD::SIGN_EXTEND:
2801 case ISD::FP_EXTEND:
2802 case ISD::FP_ROUND:
2803 switch (getTypeAction(Node->getOperand(0).getValueType())) {
Chris Lattner456a93a2006-01-28 07:39:30 +00002804 case Expand: assert(0 && "Shouldn't need to expand other operators here!");
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002805 case Legal:
2806 Tmp1 = LegalizeOp(Node->getOperand(0));
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002807 Result = DAG.UpdateNodeOperands(Result, Tmp1);
Chris Lattnerfa9c8012005-07-28 23:31:12 +00002808 break;
Chris Lattner03c85462005-01-15 05:21:40 +00002809 case Promote:
2810 switch (Node->getOpcode()) {
Chris Lattner13c78e22005-09-02 00:18:10 +00002811 case ISD::ANY_EXTEND:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002812 Tmp1 = PromoteOp(Node->getOperand(0));
2813 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Tmp1);
Chris Lattner13c78e22005-09-02 00:18:10 +00002814 break;
Chris Lattner1713e732005-01-16 00:38:00 +00002815 case ISD::ZERO_EXTEND:
2816 Result = PromoteOp(Node->getOperand(0));
Chris Lattner13c78e22005-09-02 00:18:10 +00002817 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
Chris Lattner23993562005-04-13 02:38:47 +00002818 Result = DAG.getZeroExtendInReg(Result,
2819 Node->getOperand(0).getValueType());
Chris Lattner03c85462005-01-15 05:21:40 +00002820 break;
Chris Lattner03c85462005-01-15 05:21:40 +00002821 case ISD::SIGN_EXTEND:
Chris Lattner1713e732005-01-16 00:38:00 +00002822 Result = PromoteOp(Node->getOperand(0));
Chris Lattner13c78e22005-09-02 00:18:10 +00002823 Result = DAG.getNode(ISD::ANY_EXTEND, Op.getValueType(), Result);
Chris Lattner1713e732005-01-16 00:38:00 +00002824 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
Chris Lattner15e4b012005-07-10 00:07:11 +00002825 Result,
2826 DAG.getValueType(Node->getOperand(0).getValueType()));
Chris Lattner1713e732005-01-16 00:38:00 +00002827 break;
Chris Lattner03c85462005-01-15 05:21:40 +00002828 case ISD::FP_EXTEND:
Chris Lattner1713e732005-01-16 00:38:00 +00002829 Result = PromoteOp(Node->getOperand(0));
2830 if (Result.getValueType() != Op.getValueType())
2831 // Dynamically dead while we have only 2 FP types.
2832 Result = DAG.getNode(ISD::FP_EXTEND, Op.getValueType(), Result);
2833 break;
Chris Lattner03c85462005-01-15 05:21:40 +00002834 case ISD::FP_ROUND:
Chris Lattnerf8161d82005-01-16 05:06:12 +00002835 Result = PromoteOp(Node->getOperand(0));
2836 Result = DAG.getNode(Node->getOpcode(), Op.getValueType(), Result);
2837 break;
Chris Lattner03c85462005-01-15 05:21:40 +00002838 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00002839 }
2840 break;
Chris Lattner0f69b292005-01-15 06:18:18 +00002841 case ISD::FP_ROUND_INREG:
Chris Lattner23993562005-04-13 02:38:47 +00002842 case ISD::SIGN_EXTEND_INREG: {
Chris Lattner0f69b292005-01-15 06:18:18 +00002843 Tmp1 = LegalizeOp(Node->getOperand(0));
Chris Lattner15e4b012005-07-10 00:07:11 +00002844 MVT::ValueType ExtraVT = cast<VTSDNode>(Node->getOperand(1))->getVT();
Chris Lattner45b8caf2005-01-15 07:15:18 +00002845
2846 // If this operation is not supported, convert it to a shl/shr or load/store
2847 // pair.
Chris Lattner55ba8fb2005-01-16 07:29:19 +00002848 switch (TLI.getOperationAction(Node->getOpcode(), ExtraVT)) {
2849 default: assert(0 && "This action not supported for this op yet!");
2850 case TargetLowering::Legal:
Chris Lattnerc52ad4f2006-01-28 10:58:55 +00002851 Result = DAG.UpdateNodeOperands(Result, Tmp1, Node->getOperand(1));
Chris Lattner55ba8fb2005-01-16 07:29:19 +00002852 break;
2853 case TargetLowering::Expand:
Chris Lattner45b8caf2005-01-15 07:15:18 +00002854 // If this is an integer extend and shifts are supported, do that.
Chris Lattner23993562005-04-13 02:38:47 +00002855 if (Node->getOpcode() == ISD::SIGN_EXTEND_INREG) {
Chris Lattner45b8caf2005-01-15 07:15:18 +00002856 // NOTE: we could fall back on load/store here too for targets without
2857 // SAR. However, it is doubtful that any exist.
2858 unsigned BitsDiff = MVT::getSizeInBits(Node->getValueType(0)) -
2859 MVT::getSizeInBits(ExtraVT);
Chris Lattner27ff1122005-01-22 00:31:52 +00002860 SDOperand ShiftCst = DAG.getConstant(BitsDiff, TLI.getShiftAmountTy());
Chris Lattner45b8caf2005-01-15 07:15:18 +00002861 Result = DAG.getNode(ISD::SHL, Node->getValueType(0),
2862 Node->getOperand(0), ShiftCst);
2863 Result = DAG.getNode(ISD::SRA, Node->getValueType(0),
2864 Result, ShiftCst);
2865 } else if (Node->getOpcode() == ISD::FP_ROUND_INREG) {
2866 // The only way we can lower this is to turn it into a STORETRUNC,
2867 // EXTLOAD pair, targetting a temporary location (a stack slot).
2868
2869 // NOTE: there is a choice here between constantly creating new stack
2870 // slots and always reusing the same one. We currently always create
2871 // new ones, as reuse may inhibit scheduling.
2872 const Type *Ty = MVT::getTypeForValueType(ExtraVT);
Owen Andersona69571c2006-05-03 01:29:57 +00002873 unsigned TySize = (unsigned)TLI.getTargetData()->getTypeSize(Ty);
2874 unsigned Align = TLI.getTargetData()->getTypeAlignment(Ty);
Chris Lattner45b8caf2005-01-15 07:15:18 +00002875 MachineFunction &MF = DAG.getMachineFunction();
Misha Brukmanedf128a2005-04-21 22:36:52 +00002876 int SSFI =
Chris Lattner45b8caf2005-01-15 07:15:18 +00002877 MF.getFrameInfo()->CreateStackObject((unsigned)TySize, Align);
2878 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
2879 Result = DAG.getNode(ISD::TRUNCSTORE, MVT::Other, DAG.getEntryNode(),
Chris Lattner52d08bd2005-05-09 20:23:03 +00002880 Node->getOperand(0), StackSlot,
Chris Lattner9fadb4c2005-07-10 00:29:18 +00002881 DAG.getSrcValue(NULL), DAG.getValueType(ExtraVT));
Chris Lattner5f056bf2005-07-10 01:55:33 +00002882 Result = DAG.getExtLoad(ISD::EXTLOAD, Node->getValueType(0),
2883 Result, StackSlot, DAG.getSrcValue(NULL),
2884 ExtraVT);
Chris Lattner45b8caf2005-01-15 07:15:18 +00002885 } else {
2886 assert(0 && "Unknown op");
2887 }
Chris Lattner55ba8fb2005-01-16 07:29:19 +00002888 break;
Chris Lattner45b8caf2005-01-15 07:15:18 +00002889 }
Chris Lattner0f69b292005-01-15 06:18:18 +00002890 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00002891 }
Chris Lattner45b8caf2005-01-15 07:15:18 +00002892 }
Chris Lattner456a93a2006-01-28 07:39:30 +00002893
Chris Lattner4ddd2832006-04-08 04:13:17 +00002894 assert(Result.getValueType() == Op.getValueType() &&
2895 "Bad legalization!");
2896
Chris Lattner456a93a2006-01-28 07:39:30 +00002897 // Make sure that the generated code is itself legal.
2898 if (Result != Op)
2899 Result = LegalizeOp(Result);
Chris Lattner3e928bb2005-01-07 07:47:09 +00002900
Chris Lattner45982da2005-05-12 16:53:42 +00002901 // Note that LegalizeOp may be reentered even from single-use nodes, which
2902 // means that we always must cache transformed nodes.
2903 AddLegalizedOperand(Op, Result);
Chris Lattner3e928bb2005-01-07 07:47:09 +00002904 return Result;
2905}
2906
Chris Lattner8b6fa222005-01-15 22:16:26 +00002907/// PromoteOp - Given an operation that produces a value in an invalid type,
2908/// promote it to compute the value into a larger type. The produced value will
2909/// have the correct bits for the low portion of the register, but no guarantee
2910/// is made about the top bits: it may be zero, sign-extended, or garbage.
Chris Lattner03c85462005-01-15 05:21:40 +00002911SDOperand SelectionDAGLegalize::PromoteOp(SDOperand Op) {
2912 MVT::ValueType VT = Op.getValueType();
Chris Lattner71c42a02005-01-16 01:11:45 +00002913 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
Chris Lattner03c85462005-01-15 05:21:40 +00002914 assert(getTypeAction(VT) == Promote &&
2915 "Caller should expand or legalize operands that are not promotable!");
2916 assert(NVT > VT && MVT::isInteger(NVT) == MVT::isInteger(VT) &&
2917 "Cannot promote to smaller type!");
2918
Chris Lattner03c85462005-01-15 05:21:40 +00002919 SDOperand Tmp1, Tmp2, Tmp3;
Chris Lattner03c85462005-01-15 05:21:40 +00002920 SDOperand Result;
2921 SDNode *Node = Op.Val;
2922
Chris Lattner6fdcb252005-09-02 20:32:45 +00002923 std::map<SDOperand, SDOperand>::iterator I = PromotedNodes.find(Op);
2924 if (I != PromotedNodes.end()) return I->second;
Chris Lattner45982da2005-05-12 16:53:42 +00002925
Chris Lattner03c85462005-01-15 05:21:40 +00002926 switch (Node->getOpcode()) {
Chris Lattnerd5d0f9b2005-08-16 21:55:35 +00002927 case ISD::CopyFromReg:
2928 assert(0 && "CopyFromReg must be legal!");
Chris Lattner03c85462005-01-15 05:21:40 +00002929 default:
Jim Laskeye37fe9b2006-07-11 17:58:07 +00002930#ifndef NDEBUG
Chris Lattner03c85462005-01-15 05:21:40 +00002931 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
Jim Laskeye37fe9b2006-07-11 17:58:07 +00002932#endif
Chris Lattner03c85462005-01-15 05:21:40 +00002933 assert(0 && "Do not know how to promote this operator!");
2934 abort();
Nate Begemanfc1b1da2005-04-01 22:34:39 +00002935 case ISD::UNDEF:
2936 Result = DAG.getNode(ISD::UNDEF, NVT);
2937 break;
Chris Lattner03c85462005-01-15 05:21:40 +00002938 case ISD::Constant:
Chris Lattnerec176e32005-08-30 16:56:19 +00002939 if (VT != MVT::i1)
2940 Result = DAG.getNode(ISD::SIGN_EXTEND, NVT, Op);
2941 else
2942 Result = DAG.getNode(ISD::ZERO_EXTEND, NVT, Op);
Chris Lattner03c85462005-01-15 05:21:40 +00002943 assert(isa<ConstantSDNode>(Result) && "Didn't constant fold zext?");
2944 break;
2945 case ISD::ConstantFP:
2946 Result = DAG.getNode(ISD::FP_EXTEND, NVT, Op);
2947 assert(isa<ConstantFPSDNode>(Result) && "Didn't constant fold fp_extend?");
2948 break;
Chris Lattneref5cd1d2005-01-18 17:54:55 +00002949
Chris Lattner82fbfb62005-01-18 02:59:52 +00002950 case ISD::SETCC:
Chris Lattnerc9c60f62005-08-24 16:35:28 +00002951 assert(isTypeLegal(TLI.getSetCCResultTy()) && "SetCC type is not legal??");
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00002952 Result = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(),Node->getOperand(0),
2953 Node->getOperand(1), Node->getOperand(2));
Chris Lattner82fbfb62005-01-18 02:59:52 +00002954 break;
Chris Lattnerfdfded52006-04-12 16:20:43 +00002955
Chris Lattner03c85462005-01-15 05:21:40 +00002956 case ISD::TRUNCATE:
2957 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2958 case Legal:
2959 Result = LegalizeOp(Node->getOperand(0));
2960 assert(Result.getValueType() >= NVT &&
2961 "This truncation doesn't make sense!");
2962 if (Result.getValueType() > NVT) // Truncate to NVT instead of VT
2963 Result = DAG.getNode(ISD::TRUNCATE, NVT, Result);
2964 break;
Chris Lattnere76ad6d2005-01-28 22:52:50 +00002965 case Promote:
2966 // The truncation is not required, because we don't guarantee anything
2967 // about high bits anyway.
2968 Result = PromoteOp(Node->getOperand(0));
2969 break;
Chris Lattner03c85462005-01-15 05:21:40 +00002970 case Expand:
Nate Begeman79e46ac2005-04-04 00:57:08 +00002971 ExpandOp(Node->getOperand(0), Tmp1, Tmp2);
2972 // Truncate the low part of the expanded value to the result type
Chris Lattnere21c3052005-08-01 18:16:37 +00002973 Result = DAG.getNode(ISD::TRUNCATE, NVT, Tmp1);
Chris Lattner03c85462005-01-15 05:21:40 +00002974 }
2975 break;
Chris Lattner8b6fa222005-01-15 22:16:26 +00002976 case ISD::SIGN_EXTEND:
2977 case ISD::ZERO_EXTEND:
Chris Lattner13c78e22005-09-02 00:18:10 +00002978 case ISD::ANY_EXTEND:
Chris Lattner8b6fa222005-01-15 22:16:26 +00002979 switch (getTypeAction(Node->getOperand(0).getValueType())) {
2980 case Expand: assert(0 && "BUG: Smaller reg should have been promoted!");
2981 case Legal:
2982 // Input is legal? Just do extend all the way to the larger type.
Chris Lattner456a93a2006-01-28 07:39:30 +00002983 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
Chris Lattner8b6fa222005-01-15 22:16:26 +00002984 break;
2985 case Promote:
2986 // Promote the reg if it's smaller.
2987 Result = PromoteOp(Node->getOperand(0));
2988 // The high bits are not guaranteed to be anything. Insert an extend.
2989 if (Node->getOpcode() == ISD::SIGN_EXTEND)
Chris Lattner595dc542005-02-04 18:39:19 +00002990 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
Chris Lattner15e4b012005-07-10 00:07:11 +00002991 DAG.getValueType(Node->getOperand(0).getValueType()));
Chris Lattner13c78e22005-09-02 00:18:10 +00002992 else if (Node->getOpcode() == ISD::ZERO_EXTEND)
Chris Lattner23993562005-04-13 02:38:47 +00002993 Result = DAG.getZeroExtendInReg(Result,
2994 Node->getOperand(0).getValueType());
Chris Lattner8b6fa222005-01-15 22:16:26 +00002995 break;
2996 }
2997 break;
Chris Lattner35481892005-12-23 00:16:34 +00002998 case ISD::BIT_CONVERT:
2999 Result = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
3000 Result = PromoteOp(Result);
3001 break;
3002
Chris Lattner8b6fa222005-01-15 22:16:26 +00003003 case ISD::FP_EXTEND:
3004 assert(0 && "Case not implemented. Dynamically dead with 2 FP types!");
3005 case ISD::FP_ROUND:
3006 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3007 case Expand: assert(0 && "BUG: Cannot expand FP regs!");
3008 case Promote: assert(0 && "Unreachable with 2 FP types!");
3009 case Legal:
3010 // Input is legal? Do an FP_ROUND_INREG.
Chris Lattner456a93a2006-01-28 07:39:30 +00003011 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Node->getOperand(0),
Chris Lattner15e4b012005-07-10 00:07:11 +00003012 DAG.getValueType(VT));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003013 break;
3014 }
3015 break;
3016
3017 case ISD::SINT_TO_FP:
3018 case ISD::UINT_TO_FP:
3019 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3020 case Legal:
Chris Lattner77e77a62005-01-21 06:05:23 +00003021 // No extra round required here.
Chris Lattner456a93a2006-01-28 07:39:30 +00003022 Result = DAG.getNode(Node->getOpcode(), NVT, Node->getOperand(0));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003023 break;
3024
3025 case Promote:
3026 Result = PromoteOp(Node->getOperand(0));
3027 if (Node->getOpcode() == ISD::SINT_TO_FP)
3028 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, Result.getValueType(),
Chris Lattner15e4b012005-07-10 00:07:11 +00003029 Result,
3030 DAG.getValueType(Node->getOperand(0).getValueType()));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003031 else
Chris Lattner23993562005-04-13 02:38:47 +00003032 Result = DAG.getZeroExtendInReg(Result,
3033 Node->getOperand(0).getValueType());
Chris Lattner77e77a62005-01-21 06:05:23 +00003034 // No extra round required here.
3035 Result = DAG.getNode(Node->getOpcode(), NVT, Result);
Chris Lattner8b6fa222005-01-15 22:16:26 +00003036 break;
3037 case Expand:
Chris Lattner77e77a62005-01-21 06:05:23 +00003038 Result = ExpandIntToFP(Node->getOpcode() == ISD::SINT_TO_FP, NVT,
3039 Node->getOperand(0));
Chris Lattner77e77a62005-01-21 06:05:23 +00003040 // Round if we cannot tolerate excess precision.
3041 if (NoExcessFPPrecision)
Chris Lattner15e4b012005-07-10 00:07:11 +00003042 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3043 DAG.getValueType(VT));
Chris Lattner77e77a62005-01-21 06:05:23 +00003044 break;
Chris Lattner8b6fa222005-01-15 22:16:26 +00003045 }
Chris Lattner8b6fa222005-01-15 22:16:26 +00003046 break;
3047
Chris Lattner5e3c5b42005-12-09 17:32:47 +00003048 case ISD::SIGN_EXTEND_INREG:
3049 Result = PromoteOp(Node->getOperand(0));
3050 Result = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Result,
3051 Node->getOperand(1));
3052 break;
Chris Lattner8b6fa222005-01-15 22:16:26 +00003053 case ISD::FP_TO_SINT:
3054 case ISD::FP_TO_UINT:
3055 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3056 case Legal:
Chris Lattner456a93a2006-01-28 07:39:30 +00003057 Tmp1 = Node->getOperand(0);
Chris Lattner8b6fa222005-01-15 22:16:26 +00003058 break;
3059 case Promote:
3060 // The input result is prerounded, so we don't have to do anything
3061 // special.
3062 Tmp1 = PromoteOp(Node->getOperand(0));
3063 break;
3064 case Expand:
3065 assert(0 && "not implemented");
3066 }
Nate Begemand2558e32005-08-14 01:20:53 +00003067 // If we're promoting a UINT to a larger size, check to see if the new node
3068 // will be legal. If it isn't, check to see if FP_TO_SINT is legal, since
3069 // we can use that instead. This allows us to generate better code for
3070 // FP_TO_UINT for small destination sizes on targets where FP_TO_UINT is not
3071 // legal, such as PowerPC.
3072 if (Node->getOpcode() == ISD::FP_TO_UINT &&
Chris Lattnerc9c60f62005-08-24 16:35:28 +00003073 !TLI.isOperationLegal(ISD::FP_TO_UINT, NVT) &&
Nate Begemanb7f6ef12005-10-25 23:47:25 +00003074 (TLI.isOperationLegal(ISD::FP_TO_SINT, NVT) ||
3075 TLI.getOperationAction(ISD::FP_TO_SINT, NVT)==TargetLowering::Custom)){
Nate Begemand2558e32005-08-14 01:20:53 +00003076 Result = DAG.getNode(ISD::FP_TO_SINT, NVT, Tmp1);
3077 } else {
3078 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3079 }
Chris Lattner8b6fa222005-01-15 22:16:26 +00003080 break;
3081
Chris Lattner2c8086f2005-04-02 05:00:07 +00003082 case ISD::FABS:
3083 case ISD::FNEG:
3084 Tmp1 = PromoteOp(Node->getOperand(0));
3085 assert(Tmp1.getValueType() == NVT);
3086 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
3087 // NOTE: we do not have to do any extra rounding here for
3088 // NoExcessFPPrecision, because we know the input will have the appropriate
3089 // precision, and these operations don't modify precision at all.
3090 break;
3091
Chris Lattnerda6ba872005-04-28 21:44:33 +00003092 case ISD::FSQRT:
3093 case ISD::FSIN:
3094 case ISD::FCOS:
3095 Tmp1 = PromoteOp(Node->getOperand(0));
3096 assert(Tmp1.getValueType() == NVT);
3097 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
Chris Lattner456a93a2006-01-28 07:39:30 +00003098 if (NoExcessFPPrecision)
Chris Lattner15e4b012005-07-10 00:07:11 +00003099 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3100 DAG.getValueType(VT));
Chris Lattnerda6ba872005-04-28 21:44:33 +00003101 break;
3102
Chris Lattner03c85462005-01-15 05:21:40 +00003103 case ISD::AND:
3104 case ISD::OR:
3105 case ISD::XOR:
Chris Lattner0f69b292005-01-15 06:18:18 +00003106 case ISD::ADD:
Chris Lattner8b6fa222005-01-15 22:16:26 +00003107 case ISD::SUB:
Chris Lattner0f69b292005-01-15 06:18:18 +00003108 case ISD::MUL:
3109 // The input may have strange things in the top bits of the registers, but
Chris Lattner01b3d732005-09-28 22:28:18 +00003110 // these operations don't care. They may have weird bits going out, but
Chris Lattner0f69b292005-01-15 06:18:18 +00003111 // that too is okay if they are integer operations.
3112 Tmp1 = PromoteOp(Node->getOperand(0));
3113 Tmp2 = PromoteOp(Node->getOperand(1));
3114 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3115 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
Chris Lattner01b3d732005-09-28 22:28:18 +00003116 break;
3117 case ISD::FADD:
3118 case ISD::FSUB:
3119 case ISD::FMUL:
Chris Lattner01b3d732005-09-28 22:28:18 +00003120 Tmp1 = PromoteOp(Node->getOperand(0));
3121 Tmp2 = PromoteOp(Node->getOperand(1));
3122 assert(Tmp1.getValueType() == NVT && Tmp2.getValueType() == NVT);
3123 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3124
3125 // Floating point operations will give excess precision that we may not be
3126 // able to tolerate. If we DO allow excess precision, just leave it,
3127 // otherwise excise it.
Chris Lattner8b6fa222005-01-15 22:16:26 +00003128 // FIXME: Why would we need to round FP ops more than integer ones?
3129 // Is Round(Add(Add(A,B),C)) != Round(Add(Round(Add(A,B)), C))
Chris Lattner01b3d732005-09-28 22:28:18 +00003130 if (NoExcessFPPrecision)
Chris Lattner15e4b012005-07-10 00:07:11 +00003131 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3132 DAG.getValueType(VT));
Chris Lattner0f69b292005-01-15 06:18:18 +00003133 break;
3134
Chris Lattner8b6fa222005-01-15 22:16:26 +00003135 case ISD::SDIV:
3136 case ISD::SREM:
3137 // These operators require that their input be sign extended.
3138 Tmp1 = PromoteOp(Node->getOperand(0));
3139 Tmp2 = PromoteOp(Node->getOperand(1));
3140 if (MVT::isInteger(NVT)) {
Chris Lattner15e4b012005-07-10 00:07:11 +00003141 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3142 DAG.getValueType(VT));
3143 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
3144 DAG.getValueType(VT));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003145 }
3146 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3147
3148 // Perform FP_ROUND: this is probably overly pessimistic.
3149 if (MVT::isFloatingPoint(NVT) && NoExcessFPPrecision)
Chris Lattner15e4b012005-07-10 00:07:11 +00003150 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3151 DAG.getValueType(VT));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003152 break;
Chris Lattner01b3d732005-09-28 22:28:18 +00003153 case ISD::FDIV:
3154 case ISD::FREM:
Chris Lattnera09f8482006-03-05 05:09:38 +00003155 case ISD::FCOPYSIGN:
Chris Lattner01b3d732005-09-28 22:28:18 +00003156 // These operators require that their input be fp extended.
Nate Begemanec57fd92006-05-09 18:20:51 +00003157 switch (getTypeAction(Node->getOperand(0).getValueType())) {
3158 case Legal:
3159 Tmp1 = LegalizeOp(Node->getOperand(0));
3160 break;
3161 case Promote:
3162 Tmp1 = PromoteOp(Node->getOperand(0));
3163 break;
3164 case Expand:
3165 assert(0 && "not implemented");
3166 }
3167 switch (getTypeAction(Node->getOperand(1).getValueType())) {
3168 case Legal:
3169 Tmp2 = LegalizeOp(Node->getOperand(1));
3170 break;
3171 case Promote:
3172 Tmp2 = PromoteOp(Node->getOperand(1));
3173 break;
3174 case Expand:
3175 assert(0 && "not implemented");
3176 }
Chris Lattner01b3d732005-09-28 22:28:18 +00003177 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3178
3179 // Perform FP_ROUND: this is probably overly pessimistic.
Chris Lattnera09f8482006-03-05 05:09:38 +00003180 if (NoExcessFPPrecision && Node->getOpcode() != ISD::FCOPYSIGN)
Chris Lattner01b3d732005-09-28 22:28:18 +00003181 Result = DAG.getNode(ISD::FP_ROUND_INREG, NVT, Result,
3182 DAG.getValueType(VT));
3183 break;
Chris Lattner8b6fa222005-01-15 22:16:26 +00003184
3185 case ISD::UDIV:
3186 case ISD::UREM:
3187 // These operators require that their input be zero extended.
3188 Tmp1 = PromoteOp(Node->getOperand(0));
3189 Tmp2 = PromoteOp(Node->getOperand(1));
3190 assert(MVT::isInteger(NVT) && "Operators don't apply to FP!");
Chris Lattner23993562005-04-13 02:38:47 +00003191 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3192 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
Chris Lattner8b6fa222005-01-15 22:16:26 +00003193 Result = DAG.getNode(Node->getOpcode(), NVT, Tmp1, Tmp2);
3194 break;
3195
3196 case ISD::SHL:
3197 Tmp1 = PromoteOp(Node->getOperand(0));
Chris Lattner456a93a2006-01-28 07:39:30 +00003198 Result = DAG.getNode(ISD::SHL, NVT, Tmp1, Node->getOperand(1));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003199 break;
3200 case ISD::SRA:
3201 // The input value must be properly sign extended.
3202 Tmp1 = PromoteOp(Node->getOperand(0));
Chris Lattner15e4b012005-07-10 00:07:11 +00003203 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3204 DAG.getValueType(VT));
Chris Lattner456a93a2006-01-28 07:39:30 +00003205 Result = DAG.getNode(ISD::SRA, NVT, Tmp1, Node->getOperand(1));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003206 break;
3207 case ISD::SRL:
3208 // The input value must be properly zero extended.
3209 Tmp1 = PromoteOp(Node->getOperand(0));
Chris Lattner23993562005-04-13 02:38:47 +00003210 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
Chris Lattner456a93a2006-01-28 07:39:30 +00003211 Result = DAG.getNode(ISD::SRL, NVT, Tmp1, Node->getOperand(1));
Chris Lattner8b6fa222005-01-15 22:16:26 +00003212 break;
Nate Begeman0aed7842006-01-28 03:14:31 +00003213
3214 case ISD::VAARG:
Chris Lattner456a93a2006-01-28 07:39:30 +00003215 Tmp1 = Node->getOperand(0); // Get the chain.
3216 Tmp2 = Node->getOperand(1); // Get the pointer.
Nate Begeman0aed7842006-01-28 03:14:31 +00003217 if (TLI.getOperationAction(ISD::VAARG, VT) == TargetLowering::Custom) {
3218 Tmp3 = DAG.getVAArg(VT, Tmp1, Tmp2, Node->getOperand(2));
3219 Result = TLI.CustomPromoteOperation(Tmp3, DAG);
3220 } else {
3221 SDOperand VAList = DAG.getLoad(TLI.getPointerTy(), Tmp1, Tmp2,
3222 Node->getOperand(2));
3223 // Increment the pointer, VAList, to the next vaarg
3224 Tmp3 = DAG.getNode(ISD::ADD, TLI.getPointerTy(), VAList,
3225 DAG.getConstant(MVT::getSizeInBits(VT)/8,
3226 TLI.getPointerTy()));
3227 // Store the incremented VAList to the legalized pointer
3228 Tmp3 = DAG.getNode(ISD::STORE, MVT::Other, VAList.getValue(1), Tmp3, Tmp2,
3229 Node->getOperand(2));
3230 // Load the actual argument out of the pointer VAList
3231 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Tmp3, VAList,
3232 DAG.getSrcValue(0), VT);
3233 }
3234 // Remember that we legalized the chain.
Chris Lattner456a93a2006-01-28 07:39:30 +00003235 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
Nate Begeman0aed7842006-01-28 03:14:31 +00003236 break;
3237
Chris Lattner03c85462005-01-15 05:21:40 +00003238 case ISD::LOAD:
Chris Lattner456a93a2006-01-28 07:39:30 +00003239 Result = DAG.getExtLoad(ISD::EXTLOAD, NVT, Node->getOperand(0),
3240 Node->getOperand(1), Node->getOperand(2), VT);
Chris Lattner03c85462005-01-15 05:21:40 +00003241 // Remember that we legalized the chain.
Chris Lattner456a93a2006-01-28 07:39:30 +00003242 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
Chris Lattner03c85462005-01-15 05:21:40 +00003243 break;
Evan Chengc5484282006-10-04 00:56:09 +00003244 case ISD::LOADX:
3245 Result =
3246 DAG.getExtLoad((ISD::LoadExtType)Node->getConstantOperandVal(4),
3247 NVT, Node->getOperand(0), Node->getOperand(1),
3248 Node->getOperand(2),
3249 cast<VTSDNode>(Node->getOperand(3))->getVT());
Chris Lattner4c8f8f02005-10-13 20:07:41 +00003250 // Remember that we legalized the chain.
Chris Lattner456a93a2006-01-28 07:39:30 +00003251 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
Chris Lattner4c8f8f02005-10-13 20:07:41 +00003252 break;
Chris Lattner03c85462005-01-15 05:21:40 +00003253 case ISD::SELECT:
Chris Lattner03c85462005-01-15 05:21:40 +00003254 Tmp2 = PromoteOp(Node->getOperand(1)); // Legalize the op0
3255 Tmp3 = PromoteOp(Node->getOperand(2)); // Legalize the op1
Chris Lattner456a93a2006-01-28 07:39:30 +00003256 Result = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), Tmp2, Tmp3);
Chris Lattner03c85462005-01-15 05:21:40 +00003257 break;
Nate Begeman9373a812005-08-10 20:51:12 +00003258 case ISD::SELECT_CC:
3259 Tmp2 = PromoteOp(Node->getOperand(2)); // True
3260 Tmp3 = PromoteOp(Node->getOperand(3)); // False
3261 Result = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
Chris Lattner456a93a2006-01-28 07:39:30 +00003262 Node->getOperand(1), Tmp2, Tmp3, Node->getOperand(4));
Nate Begeman9373a812005-08-10 20:51:12 +00003263 break;
Nate Begemand88fc032006-01-14 03:14:10 +00003264 case ISD::BSWAP:
3265 Tmp1 = Node->getOperand(0);
3266 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Tmp1);
3267 Tmp1 = DAG.getNode(ISD::BSWAP, NVT, Tmp1);
3268 Result = DAG.getNode(ISD::SRL, NVT, Tmp1,
3269 DAG.getConstant(getSizeInBits(NVT) - getSizeInBits(VT),
3270 TLI.getShiftAmountTy()));
3271 break;
Andrew Lenharthfecf0952005-05-04 19:11:05 +00003272 case ISD::CTPOP:
3273 case ISD::CTTZ:
3274 case ISD::CTLZ:
Chris Lattner456a93a2006-01-28 07:39:30 +00003275 // Zero extend the argument
3276 Tmp1 = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
Andrew Lenharthfecf0952005-05-04 19:11:05 +00003277 // Perform the larger operation, then subtract if needed.
3278 Tmp1 = DAG.getNode(Node->getOpcode(), NVT, Tmp1);
Chris Lattner456a93a2006-01-28 07:39:30 +00003279 switch(Node->getOpcode()) {
Andrew Lenharthfecf0952005-05-04 19:11:05 +00003280 case ISD::CTPOP:
3281 Result = Tmp1;
3282 break;
3283 case ISD::CTTZ:
Chris Lattner456a93a2006-01-28 07:39:30 +00003284 // if Tmp1 == sizeinbits(NVT) then Tmp1 = sizeinbits(Old VT)
Nate Begemand2558e32005-08-14 01:20:53 +00003285 Tmp2 = DAG.getSetCC(TLI.getSetCCResultTy(), Tmp1,
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00003286 DAG.getConstant(getSizeInBits(NVT), NVT), ISD::SETEQ);
Jeff Cohen00b168892005-07-27 06:12:32 +00003287 Result = DAG.getNode(ISD::SELECT, NVT, Tmp2,
Chris Lattner456a93a2006-01-28 07:39:30 +00003288 DAG.getConstant(getSizeInBits(VT), NVT), Tmp1);
Andrew Lenharthfecf0952005-05-04 19:11:05 +00003289 break;
3290 case ISD::CTLZ:
3291 //Tmp1 = Tmp1 - (sizeinbits(NVT) - sizeinbits(Old VT))
Jeff Cohen00b168892005-07-27 06:12:32 +00003292 Result = DAG.getNode(ISD::SUB, NVT, Tmp1,
3293 DAG.getConstant(getSizeInBits(NVT) -
Andrew Lenharthfecf0952005-05-04 19:11:05 +00003294 getSizeInBits(VT), NVT));
3295 break;
3296 }
3297 break;
Chris Lattner15972212006-03-31 17:55:51 +00003298 case ISD::VEXTRACT_VECTOR_ELT:
3299 Result = PromoteOp(LowerVEXTRACT_VECTOR_ELT(Op));
3300 break;
Chris Lattner4aab2f42006-04-02 05:06:04 +00003301 case ISD::EXTRACT_VECTOR_ELT:
3302 Result = PromoteOp(ExpandEXTRACT_VECTOR_ELT(Op));
3303 break;
Chris Lattner03c85462005-01-15 05:21:40 +00003304 }
3305
3306 assert(Result.Val && "Didn't set a result!");
Chris Lattner456a93a2006-01-28 07:39:30 +00003307
3308 // Make sure the result is itself legal.
3309 Result = LegalizeOp(Result);
3310
3311 // Remember that we promoted this!
Chris Lattner03c85462005-01-15 05:21:40 +00003312 AddPromotedOperand(Op, Result);
3313 return Result;
3314}
Chris Lattner3e928bb2005-01-07 07:47:09 +00003315
Chris Lattner15972212006-03-31 17:55:51 +00003316/// LowerVEXTRACT_VECTOR_ELT - Lower a VEXTRACT_VECTOR_ELT operation into a
3317/// EXTRACT_VECTOR_ELT operation, to memory operations, or to scalar code based
3318/// on the vector type. The return type of this matches the element type of the
3319/// vector, which may not be legal for the target.
3320SDOperand SelectionDAGLegalize::LowerVEXTRACT_VECTOR_ELT(SDOperand Op) {
3321 // We know that operand #0 is the Vec vector. If the index is a constant
3322 // or if the invec is a supported hardware type, we can use it. Otherwise,
3323 // lower to a store then an indexed load.
3324 SDOperand Vec = Op.getOperand(0);
3325 SDOperand Idx = LegalizeOp(Op.getOperand(1));
3326
3327 SDNode *InVal = Vec.Val;
3328 unsigned NumElems = cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
3329 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
3330
3331 // Figure out if there is a Packed type corresponding to this Vector
3332 // type. If so, convert to the packed type.
3333 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
3334 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
3335 // Turn this into a packed extract_vector_elt operation.
3336 Vec = PackVectorOp(Vec, TVT);
3337 return DAG.getNode(ISD::EXTRACT_VECTOR_ELT, Op.getValueType(), Vec, Idx);
3338 } else if (NumElems == 1) {
3339 // This must be an access of the only element. Return it.
3340 return PackVectorOp(Vec, EVT);
3341 } else if (ConstantSDNode *CIdx = dyn_cast<ConstantSDNode>(Idx)) {
3342 SDOperand Lo, Hi;
3343 SplitVectorOp(Vec, Lo, Hi);
3344 if (CIdx->getValue() < NumElems/2) {
3345 Vec = Lo;
3346 } else {
3347 Vec = Hi;
3348 Idx = DAG.getConstant(CIdx->getValue() - NumElems/2, Idx.getValueType());
3349 }
3350
3351 // It's now an extract from the appropriate high or low part. Recurse.
3352 Op = DAG.UpdateNodeOperands(Op, Vec, Idx);
3353 return LowerVEXTRACT_VECTOR_ELT(Op);
3354 } else {
3355 // Variable index case for extract element.
3356 // FIXME: IMPLEMENT STORE/LOAD lowering. Need alignment of stack slot!!
3357 assert(0 && "unimp!");
3358 return SDOperand();
3359 }
3360}
3361
Chris Lattner4aab2f42006-04-02 05:06:04 +00003362/// ExpandEXTRACT_VECTOR_ELT - Expand an EXTRACT_VECTOR_ELT operation into
3363/// memory traffic.
3364SDOperand SelectionDAGLegalize::ExpandEXTRACT_VECTOR_ELT(SDOperand Op) {
3365 SDOperand Vector = Op.getOperand(0);
3366 SDOperand Idx = Op.getOperand(1);
3367
3368 // If the target doesn't support this, store the value to a temporary
3369 // stack slot, then LOAD the scalar element back out.
3370 SDOperand StackPtr = CreateStackTemporary(Vector.getValueType());
3371 SDOperand Ch = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3372 Vector, StackPtr, DAG.getSrcValue(NULL));
3373
3374 // Add the offset to the index.
3375 unsigned EltSize = MVT::getSizeInBits(Op.getValueType())/8;
3376 Idx = DAG.getNode(ISD::MUL, Idx.getValueType(), Idx,
3377 DAG.getConstant(EltSize, Idx.getValueType()));
3378 StackPtr = DAG.getNode(ISD::ADD, Idx.getValueType(), Idx, StackPtr);
3379
3380 return DAG.getLoad(Op.getValueType(), Ch, StackPtr, DAG.getSrcValue(NULL));
3381}
3382
Chris Lattner15972212006-03-31 17:55:51 +00003383
Nate Begeman750ac1b2006-02-01 07:19:44 +00003384/// LegalizeSetCCOperands - Attempts to create a legal LHS and RHS for a SETCC
3385/// with condition CC on the current target. This usually involves legalizing
3386/// or promoting the arguments. In the case where LHS and RHS must be expanded,
3387/// there may be no choice but to create a new SetCC node to represent the
3388/// legalized value of setcc lhs, rhs. In this case, the value is returned in
3389/// LHS, and the SDOperand returned in RHS has a nil SDNode value.
3390void SelectionDAGLegalize::LegalizeSetCCOperands(SDOperand &LHS,
3391 SDOperand &RHS,
3392 SDOperand &CC) {
3393 SDOperand Tmp1, Tmp2, Result;
3394
3395 switch (getTypeAction(LHS.getValueType())) {
3396 case Legal:
3397 Tmp1 = LegalizeOp(LHS); // LHS
3398 Tmp2 = LegalizeOp(RHS); // RHS
3399 break;
3400 case Promote:
3401 Tmp1 = PromoteOp(LHS); // LHS
3402 Tmp2 = PromoteOp(RHS); // RHS
3403
3404 // If this is an FP compare, the operands have already been extended.
3405 if (MVT::isInteger(LHS.getValueType())) {
3406 MVT::ValueType VT = LHS.getValueType();
3407 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
3408
3409 // Otherwise, we have to insert explicit sign or zero extends. Note
3410 // that we could insert sign extends for ALL conditions, but zero extend
3411 // is cheaper on many machines (an AND instead of two shifts), so prefer
3412 // it.
3413 switch (cast<CondCodeSDNode>(CC)->get()) {
3414 default: assert(0 && "Unknown integer comparison!");
3415 case ISD::SETEQ:
3416 case ISD::SETNE:
3417 case ISD::SETUGE:
3418 case ISD::SETUGT:
3419 case ISD::SETULE:
3420 case ISD::SETULT:
3421 // ALL of these operations will work if we either sign or zero extend
3422 // the operands (including the unsigned comparisons!). Zero extend is
3423 // usually a simpler/cheaper operation, so prefer it.
3424 Tmp1 = DAG.getZeroExtendInReg(Tmp1, VT);
3425 Tmp2 = DAG.getZeroExtendInReg(Tmp2, VT);
3426 break;
3427 case ISD::SETGE:
3428 case ISD::SETGT:
3429 case ISD::SETLT:
3430 case ISD::SETLE:
3431 Tmp1 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp1,
3432 DAG.getValueType(VT));
3433 Tmp2 = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Tmp2,
3434 DAG.getValueType(VT));
3435 break;
3436 }
3437 }
3438 break;
3439 case Expand:
3440 SDOperand LHSLo, LHSHi, RHSLo, RHSHi;
3441 ExpandOp(LHS, LHSLo, LHSHi);
3442 ExpandOp(RHS, RHSLo, RHSHi);
3443 switch (cast<CondCodeSDNode>(CC)->get()) {
3444 case ISD::SETEQ:
3445 case ISD::SETNE:
3446 if (RHSLo == RHSHi)
3447 if (ConstantSDNode *RHSCST = dyn_cast<ConstantSDNode>(RHSLo))
3448 if (RHSCST->isAllOnesValue()) {
3449 // Comparison to -1.
3450 Tmp1 = DAG.getNode(ISD::AND, LHSLo.getValueType(), LHSLo, LHSHi);
3451 Tmp2 = RHSLo;
3452 break;
3453 }
3454
3455 Tmp1 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSLo, RHSLo);
3456 Tmp2 = DAG.getNode(ISD::XOR, LHSLo.getValueType(), LHSHi, RHSHi);
3457 Tmp1 = DAG.getNode(ISD::OR, Tmp1.getValueType(), Tmp1, Tmp2);
3458 Tmp2 = DAG.getConstant(0, Tmp1.getValueType());
3459 break;
3460 default:
3461 // If this is a comparison of the sign bit, just look at the top part.
3462 // X > -1, x < 0
3463 if (ConstantSDNode *CST = dyn_cast<ConstantSDNode>(RHS))
3464 if ((cast<CondCodeSDNode>(CC)->get() == ISD::SETLT &&
3465 CST->getValue() == 0) || // X < 0
3466 (cast<CondCodeSDNode>(CC)->get() == ISD::SETGT &&
3467 CST->isAllOnesValue())) { // X > -1
3468 Tmp1 = LHSHi;
3469 Tmp2 = RHSHi;
3470 break;
3471 }
3472
3473 // FIXME: This generated code sucks.
3474 ISD::CondCode LowCC;
3475 switch (cast<CondCodeSDNode>(CC)->get()) {
3476 default: assert(0 && "Unknown integer setcc!");
3477 case ISD::SETLT:
3478 case ISD::SETULT: LowCC = ISD::SETULT; break;
3479 case ISD::SETGT:
3480 case ISD::SETUGT: LowCC = ISD::SETUGT; break;
3481 case ISD::SETLE:
3482 case ISD::SETULE: LowCC = ISD::SETULE; break;
3483 case ISD::SETGE:
3484 case ISD::SETUGE: LowCC = ISD::SETUGE; break;
3485 }
3486
3487 // Tmp1 = lo(op1) < lo(op2) // Always unsigned comparison
3488 // Tmp2 = hi(op1) < hi(op2) // Signedness depends on operands
3489 // dest = hi(op1) == hi(op2) ? Tmp1 : Tmp2;
3490
3491 // NOTE: on targets without efficient SELECT of bools, we can always use
3492 // this identity: (B1 ? B2 : B3) --> (B1 & B2)|(!B1&B3)
3493 Tmp1 = DAG.getSetCC(TLI.getSetCCResultTy(), LHSLo, RHSLo, LowCC);
3494 Tmp2 = DAG.getNode(ISD::SETCC, TLI.getSetCCResultTy(), LHSHi, RHSHi, CC);
3495 Result = DAG.getSetCC(TLI.getSetCCResultTy(), LHSHi, RHSHi, ISD::SETEQ);
3496 Result = LegalizeOp(DAG.getNode(ISD::SELECT, Tmp1.getValueType(),
3497 Result, Tmp1, Tmp2));
3498 Tmp1 = Result;
Nate Begemanda06e9e2006-02-01 19:05:15 +00003499 Tmp2 = SDOperand();
Nate Begeman750ac1b2006-02-01 07:19:44 +00003500 }
3501 }
3502 LHS = Tmp1;
3503 RHS = Tmp2;
3504}
3505
Chris Lattner35481892005-12-23 00:16:34 +00003506/// ExpandBIT_CONVERT - Expand a BIT_CONVERT node into a store/load combination.
Chris Lattner232348d2005-12-23 00:52:30 +00003507/// The resultant code need not be legal. Note that SrcOp is the input operand
3508/// to the BIT_CONVERT, not the BIT_CONVERT node itself.
Chris Lattner35481892005-12-23 00:16:34 +00003509SDOperand SelectionDAGLegalize::ExpandBIT_CONVERT(MVT::ValueType DestVT,
3510 SDOperand SrcOp) {
3511 // Create the stack frame object.
Chris Lattnerce872152006-03-19 06:31:19 +00003512 SDOperand FIPtr = CreateStackTemporary(DestVT);
Chris Lattner35481892005-12-23 00:16:34 +00003513
3514 // Emit a store to the stack slot.
3515 SDOperand Store = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
Chris Lattnered7b5ba2005-12-23 00:50:25 +00003516 SrcOp, FIPtr, DAG.getSrcValue(NULL));
Chris Lattner35481892005-12-23 00:16:34 +00003517 // Result is a load from the stack slot.
3518 return DAG.getLoad(DestVT, Store, FIPtr, DAG.getSrcValue(0));
3519}
3520
Chris Lattner4352cc92006-04-04 17:23:26 +00003521SDOperand SelectionDAGLegalize::ExpandSCALAR_TO_VECTOR(SDNode *Node) {
3522 // Create a vector sized/aligned stack slot, store the value to element #0,
3523 // then load the whole vector back out.
3524 SDOperand StackPtr = CreateStackTemporary(Node->getValueType(0));
3525 SDOperand Ch = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3526 Node->getOperand(0), StackPtr,
3527 DAG.getSrcValue(NULL));
3528 return DAG.getLoad(Node->getValueType(0), Ch, StackPtr,DAG.getSrcValue(NULL));
3529}
3530
3531
Chris Lattnerce872152006-03-19 06:31:19 +00003532/// ExpandBUILD_VECTOR - Expand a BUILD_VECTOR node on targets that don't
3533/// support the operation, but do support the resultant packed vector type.
3534SDOperand SelectionDAGLegalize::ExpandBUILD_VECTOR(SDNode *Node) {
3535
3536 // If the only non-undef value is the low element, turn this into a
Chris Lattner87100e02006-03-20 01:52:29 +00003537 // SCALAR_TO_VECTOR node. If this is { X, X, X, X }, determine X.
Evan Cheng033e6812006-03-24 01:17:21 +00003538 unsigned NumElems = Node->getNumOperands();
Chris Lattnerce872152006-03-19 06:31:19 +00003539 bool isOnlyLowElement = true;
Chris Lattner87100e02006-03-20 01:52:29 +00003540 SDOperand SplatValue = Node->getOperand(0);
Evan Cheng033e6812006-03-24 01:17:21 +00003541 std::map<SDOperand, std::vector<unsigned> > Values;
3542 Values[SplatValue].push_back(0);
Chris Lattner2eb86532006-03-24 07:29:17 +00003543 bool isConstant = true;
3544 if (!isa<ConstantFPSDNode>(SplatValue) && !isa<ConstantSDNode>(SplatValue) &&
3545 SplatValue.getOpcode() != ISD::UNDEF)
3546 isConstant = false;
3547
Evan Cheng033e6812006-03-24 01:17:21 +00003548 for (unsigned i = 1; i < NumElems; ++i) {
3549 SDOperand V = Node->getOperand(i);
Chris Lattner89a1b382006-04-19 23:17:50 +00003550 Values[V].push_back(i);
Evan Cheng033e6812006-03-24 01:17:21 +00003551 if (V.getOpcode() != ISD::UNDEF)
Chris Lattnerce872152006-03-19 06:31:19 +00003552 isOnlyLowElement = false;
Evan Cheng033e6812006-03-24 01:17:21 +00003553 if (SplatValue != V)
Chris Lattner87100e02006-03-20 01:52:29 +00003554 SplatValue = SDOperand(0,0);
Chris Lattner2eb86532006-03-24 07:29:17 +00003555
3556 // If this isn't a constant element or an undef, we can't use a constant
3557 // pool load.
3558 if (!isa<ConstantFPSDNode>(V) && !isa<ConstantSDNode>(V) &&
3559 V.getOpcode() != ISD::UNDEF)
3560 isConstant = false;
Chris Lattnerce872152006-03-19 06:31:19 +00003561 }
3562
3563 if (isOnlyLowElement) {
3564 // If the low element is an undef too, then this whole things is an undef.
3565 if (Node->getOperand(0).getOpcode() == ISD::UNDEF)
3566 return DAG.getNode(ISD::UNDEF, Node->getValueType(0));
3567 // Otherwise, turn this into a scalar_to_vector node.
3568 return DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
3569 Node->getOperand(0));
3570 }
3571
Chris Lattner2eb86532006-03-24 07:29:17 +00003572 // If all elements are constants, create a load from the constant pool.
3573 if (isConstant) {
3574 MVT::ValueType VT = Node->getValueType(0);
3575 const Type *OpNTy =
3576 MVT::getTypeForValueType(Node->getOperand(0).getValueType());
3577 std::vector<Constant*> CV;
3578 for (unsigned i = 0, e = NumElems; i != e; ++i) {
3579 if (ConstantFPSDNode *V =
3580 dyn_cast<ConstantFPSDNode>(Node->getOperand(i))) {
3581 CV.push_back(ConstantFP::get(OpNTy, V->getValue()));
3582 } else if (ConstantSDNode *V =
3583 dyn_cast<ConstantSDNode>(Node->getOperand(i))) {
3584 CV.push_back(ConstantUInt::get(OpNTy, V->getValue()));
3585 } else {
3586 assert(Node->getOperand(i).getOpcode() == ISD::UNDEF);
3587 CV.push_back(UndefValue::get(OpNTy));
3588 }
3589 }
3590 Constant *CP = ConstantPacked::get(CV);
3591 SDOperand CPIdx = DAG.getConstantPool(CP, TLI.getPointerTy());
3592 return DAG.getLoad(VT, DAG.getEntryNode(), CPIdx,
3593 DAG.getSrcValue(NULL));
3594 }
3595
Chris Lattner87100e02006-03-20 01:52:29 +00003596 if (SplatValue.Val) { // Splat of one value?
3597 // Build the shuffle constant vector: <0, 0, 0, 0>
3598 MVT::ValueType MaskVT =
Evan Cheng033e6812006-03-24 01:17:21 +00003599 MVT::getIntVectorWithNumElements(NumElems);
Chris Lattner87100e02006-03-20 01:52:29 +00003600 SDOperand Zero = DAG.getConstant(0, MVT::getVectorBaseType(MaskVT));
Evan Cheng033e6812006-03-24 01:17:21 +00003601 std::vector<SDOperand> ZeroVec(NumElems, Zero);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003602 SDOperand SplatMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT,
3603 &ZeroVec[0], ZeroVec.size());
Chris Lattner87100e02006-03-20 01:52:29 +00003604
3605 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
Chris Lattner4352cc92006-04-04 17:23:26 +00003606 if (isShuffleLegal(Node->getValueType(0), SplatMask)) {
Chris Lattner87100e02006-03-20 01:52:29 +00003607 // Get the splatted value into the low element of a vector register.
3608 SDOperand LowValVec =
3609 DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0), SplatValue);
3610
3611 // Return shuffle(LowValVec, undef, <0,0,0,0>)
3612 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0), LowValVec,
3613 DAG.getNode(ISD::UNDEF, Node->getValueType(0)),
3614 SplatMask);
3615 }
3616 }
3617
Evan Cheng033e6812006-03-24 01:17:21 +00003618 // If there are only two unique elements, we may be able to turn this into a
3619 // vector shuffle.
3620 if (Values.size() == 2) {
3621 // Build the shuffle constant vector: e.g. <0, 4, 0, 4>
3622 MVT::ValueType MaskVT =
3623 MVT::getIntVectorWithNumElements(NumElems);
3624 std::vector<SDOperand> MaskVec(NumElems);
3625 unsigned i = 0;
3626 for (std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
3627 E = Values.end(); I != E; ++I) {
3628 for (std::vector<unsigned>::iterator II = I->second.begin(),
3629 EE = I->second.end(); II != EE; ++II)
3630 MaskVec[*II] = DAG.getConstant(i, MVT::getVectorBaseType(MaskVT));
3631 i += NumElems;
3632 }
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003633 SDOperand ShuffleMask = DAG.getNode(ISD::BUILD_VECTOR, MaskVT,
3634 &MaskVec[0], MaskVec.size());
Evan Cheng033e6812006-03-24 01:17:21 +00003635
3636 // If the target supports VECTOR_SHUFFLE and this shuffle mask, use it.
Chris Lattner4352cc92006-04-04 17:23:26 +00003637 if (TLI.isOperationLegal(ISD::SCALAR_TO_VECTOR, Node->getValueType(0)) &&
3638 isShuffleLegal(Node->getValueType(0), ShuffleMask)) {
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003639 SmallVector<SDOperand, 8> Ops;
Evan Cheng033e6812006-03-24 01:17:21 +00003640 for(std::map<SDOperand,std::vector<unsigned> >::iterator I=Values.begin(),
3641 E = Values.end(); I != E; ++I) {
3642 SDOperand Op = DAG.getNode(ISD::SCALAR_TO_VECTOR, Node->getValueType(0),
3643 I->first);
3644 Ops.push_back(Op);
3645 }
3646 Ops.push_back(ShuffleMask);
3647
3648 // Return shuffle(LoValVec, HiValVec, <0,1,0,1>)
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003649 return DAG.getNode(ISD::VECTOR_SHUFFLE, Node->getValueType(0),
3650 &Ops[0], Ops.size());
Evan Cheng033e6812006-03-24 01:17:21 +00003651 }
3652 }
Chris Lattnerce872152006-03-19 06:31:19 +00003653
3654 // Otherwise, we can't handle this case efficiently. Allocate a sufficiently
3655 // aligned object on the stack, store each element into it, then load
3656 // the result as a vector.
3657 MVT::ValueType VT = Node->getValueType(0);
3658 // Create the stack frame object.
3659 SDOperand FIPtr = CreateStackTemporary(VT);
3660
3661 // Emit a store of each element to the stack slot.
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003662 SmallVector<SDOperand, 8> Stores;
Chris Lattnerce872152006-03-19 06:31:19 +00003663 unsigned TypeByteSize =
3664 MVT::getSizeInBits(Node->getOperand(0).getValueType())/8;
3665 unsigned VectorSize = MVT::getSizeInBits(VT)/8;
3666 // Store (in the right endianness) the elements to memory.
3667 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
3668 // Ignore undef elements.
3669 if (Node->getOperand(i).getOpcode() == ISD::UNDEF) continue;
3670
Chris Lattner841c8822006-03-22 01:46:54 +00003671 unsigned Offset = TypeByteSize*i;
Chris Lattnerce872152006-03-19 06:31:19 +00003672
3673 SDOperand Idx = DAG.getConstant(Offset, FIPtr.getValueType());
3674 Idx = DAG.getNode(ISD::ADD, FIPtr.getValueType(), FIPtr, Idx);
3675
3676 Stores.push_back(DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
3677 Node->getOperand(i), Idx,
3678 DAG.getSrcValue(NULL)));
3679 }
3680
3681 SDOperand StoreChain;
3682 if (!Stores.empty()) // Not all undef elements?
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003683 StoreChain = DAG.getNode(ISD::TokenFactor, MVT::Other,
3684 &Stores[0], Stores.size());
Chris Lattnerce872152006-03-19 06:31:19 +00003685 else
3686 StoreChain = DAG.getEntryNode();
3687
3688 // Result is a load from the stack slot.
3689 return DAG.getLoad(VT, StoreChain, FIPtr, DAG.getSrcValue(0));
3690}
3691
3692/// CreateStackTemporary - Create a stack temporary, suitable for holding the
3693/// specified value type.
3694SDOperand SelectionDAGLegalize::CreateStackTemporary(MVT::ValueType VT) {
3695 MachineFrameInfo *FrameInfo = DAG.getMachineFunction().getFrameInfo();
3696 unsigned ByteSize = MVT::getSizeInBits(VT)/8;
3697 int FrameIdx = FrameInfo->CreateStackObject(ByteSize, ByteSize);
3698 return DAG.getFrameIndex(FrameIdx, TLI.getPointerTy());
3699}
3700
Chris Lattner5b359c62005-04-02 04:00:59 +00003701void SelectionDAGLegalize::ExpandShiftParts(unsigned NodeOp,
3702 SDOperand Op, SDOperand Amt,
3703 SDOperand &Lo, SDOperand &Hi) {
3704 // Expand the subcomponents.
3705 SDOperand LHSL, LHSH;
3706 ExpandOp(Op, LHSL, LHSH);
3707
Chris Lattnerbd564bf2006-08-08 02:23:42 +00003708 SDOperand Ops[] = { LHSL, LHSH, Amt };
Chris Lattnerf9f37fc2006-08-14 23:53:35 +00003709 MVT::ValueType VT = LHSL.getValueType();
3710 Lo = DAG.getNode(NodeOp, DAG.getNodeValueTypes(VT, VT), 2, Ops, 3);
Chris Lattner5b359c62005-04-02 04:00:59 +00003711 Hi = Lo.getValue(1);
3712}
3713
3714
Chris Lattnere34b3962005-01-19 04:19:40 +00003715/// ExpandShift - Try to find a clever way to expand this shift operation out to
3716/// smaller elements. If we can't find a way that is more efficient than a
3717/// libcall on this target, return false. Otherwise, return true with the
3718/// low-parts expanded into Lo and Hi.
3719bool SelectionDAGLegalize::ExpandShift(unsigned Opc, SDOperand Op,SDOperand Amt,
3720 SDOperand &Lo, SDOperand &Hi) {
3721 assert((Opc == ISD::SHL || Opc == ISD::SRA || Opc == ISD::SRL) &&
3722 "This is not a shift!");
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003723
Chris Lattnere34b3962005-01-19 04:19:40 +00003724 MVT::ValueType NVT = TLI.getTypeToTransformTo(Op.getValueType());
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003725 SDOperand ShAmt = LegalizeOp(Amt);
3726 MVT::ValueType ShTy = ShAmt.getValueType();
3727 unsigned VTBits = MVT::getSizeInBits(Op.getValueType());
3728 unsigned NVTBits = MVT::getSizeInBits(NVT);
3729
3730 // Handle the case when Amt is an immediate. Other cases are currently broken
3731 // and are disabled.
3732 if (ConstantSDNode *CN = dyn_cast<ConstantSDNode>(Amt.Val)) {
3733 unsigned Cst = CN->getValue();
3734 // Expand the incoming operand to be shifted, so that we have its parts
3735 SDOperand InL, InH;
3736 ExpandOp(Op, InL, InH);
3737 switch(Opc) {
3738 case ISD::SHL:
3739 if (Cst > VTBits) {
3740 Lo = DAG.getConstant(0, NVT);
3741 Hi = DAG.getConstant(0, NVT);
3742 } else if (Cst > NVTBits) {
3743 Lo = DAG.getConstant(0, NVT);
3744 Hi = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst-NVTBits,ShTy));
Chris Lattneree27f572005-04-11 20:08:52 +00003745 } else if (Cst == NVTBits) {
3746 Lo = DAG.getConstant(0, NVT);
3747 Hi = InL;
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003748 } else {
3749 Lo = DAG.getNode(ISD::SHL, NVT, InL, DAG.getConstant(Cst, ShTy));
3750 Hi = DAG.getNode(ISD::OR, NVT,
3751 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(Cst, ShTy)),
3752 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(NVTBits-Cst, ShTy)));
3753 }
3754 return true;
3755 case ISD::SRL:
3756 if (Cst > VTBits) {
3757 Lo = DAG.getConstant(0, NVT);
3758 Hi = DAG.getConstant(0, NVT);
3759 } else if (Cst > NVTBits) {
3760 Lo = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst-NVTBits,ShTy));
3761 Hi = DAG.getConstant(0, NVT);
Chris Lattneree27f572005-04-11 20:08:52 +00003762 } else if (Cst == NVTBits) {
3763 Lo = InH;
3764 Hi = DAG.getConstant(0, NVT);
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003765 } else {
3766 Lo = DAG.getNode(ISD::OR, NVT,
3767 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
3768 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
3769 Hi = DAG.getNode(ISD::SRL, NVT, InH, DAG.getConstant(Cst, ShTy));
3770 }
3771 return true;
3772 case ISD::SRA:
3773 if (Cst > VTBits) {
Misha Brukmanedf128a2005-04-21 22:36:52 +00003774 Hi = Lo = DAG.getNode(ISD::SRA, NVT, InH,
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003775 DAG.getConstant(NVTBits-1, ShTy));
3776 } else if (Cst > NVTBits) {
Misha Brukmanedf128a2005-04-21 22:36:52 +00003777 Lo = DAG.getNode(ISD::SRA, NVT, InH,
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003778 DAG.getConstant(Cst-NVTBits, ShTy));
Misha Brukmanedf128a2005-04-21 22:36:52 +00003779 Hi = DAG.getNode(ISD::SRA, NVT, InH,
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003780 DAG.getConstant(NVTBits-1, ShTy));
Chris Lattneree27f572005-04-11 20:08:52 +00003781 } else if (Cst == NVTBits) {
3782 Lo = InH;
Misha Brukmanedf128a2005-04-21 22:36:52 +00003783 Hi = DAG.getNode(ISD::SRA, NVT, InH,
Chris Lattneree27f572005-04-11 20:08:52 +00003784 DAG.getConstant(NVTBits-1, ShTy));
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003785 } else {
3786 Lo = DAG.getNode(ISD::OR, NVT,
3787 DAG.getNode(ISD::SRL, NVT, InL, DAG.getConstant(Cst, ShTy)),
3788 DAG.getNode(ISD::SHL, NVT, InH, DAG.getConstant(NVTBits-Cst, ShTy)));
3789 Hi = DAG.getNode(ISD::SRA, NVT, InH, DAG.getConstant(Cst, ShTy));
3790 }
3791 return true;
3792 }
3793 }
Chris Lattner0ea26ca2006-09-20 03:38:48 +00003794
3795 // Okay, the shift amount isn't constant. However, if we can tell that it is
3796 // >= 32 or < 32, we can still simplify it, without knowing the actual value.
3797 uint64_t Mask = NVTBits, KnownZero, KnownOne;
3798 TLI.ComputeMaskedBits(Amt, Mask, KnownZero, KnownOne);
3799
3800 // If we know that the high bit of the shift amount is one, then we can do
3801 // this as a couple of simple shifts.
3802 if (KnownOne & Mask) {
3803 // Mask out the high bit, which we know is set.
3804 Amt = DAG.getNode(ISD::AND, Amt.getValueType(), Amt,
3805 DAG.getConstant(NVTBits-1, Amt.getValueType()));
3806
3807 // Expand the incoming operand to be shifted, so that we have its parts
3808 SDOperand InL, InH;
3809 ExpandOp(Op, InL, InH);
3810 switch(Opc) {
3811 case ISD::SHL:
3812 Lo = DAG.getConstant(0, NVT); // Low part is zero.
3813 Hi = DAG.getNode(ISD::SHL, NVT, InL, Amt); // High part from Lo part.
3814 return true;
3815 case ISD::SRL:
3816 Hi = DAG.getConstant(0, NVT); // Hi part is zero.
3817 Lo = DAG.getNode(ISD::SRL, NVT, InH, Amt); // Lo part from Hi part.
3818 return true;
3819 case ISD::SRA:
3820 Hi = DAG.getNode(ISD::SRA, NVT, InH, // Sign extend high part.
3821 DAG.getConstant(NVTBits-1, Amt.getValueType()));
3822 Lo = DAG.getNode(ISD::SRA, NVT, InH, Amt); // Lo part from Hi part.
3823 return true;
3824 }
3825 }
3826
3827 // If we know that the high bit of the shift amount is zero, then we can do
3828 // this as a couple of simple shifts.
3829 if (KnownZero & Mask) {
3830 // Compute 32-amt.
3831 SDOperand Amt2 = DAG.getNode(ISD::SUB, Amt.getValueType(),
3832 DAG.getConstant(NVTBits, Amt.getValueType()),
3833 Amt);
3834
3835 // Expand the incoming operand to be shifted, so that we have its parts
3836 SDOperand InL, InH;
3837 ExpandOp(Op, InL, InH);
3838 switch(Opc) {
3839 case ISD::SHL:
3840 Lo = DAG.getNode(ISD::SHL, NVT, InL, Amt);
3841 Hi = DAG.getNode(ISD::OR, NVT,
3842 DAG.getNode(ISD::SHL, NVT, InH, Amt),
3843 DAG.getNode(ISD::SRL, NVT, InL, Amt2));
3844 return true;
3845 case ISD::SRL:
3846 Hi = DAG.getNode(ISD::SRL, NVT, InH, Amt);
3847 Lo = DAG.getNode(ISD::OR, NVT,
3848 DAG.getNode(ISD::SRL, NVT, InL, Amt),
3849 DAG.getNode(ISD::SHL, NVT, InH, Amt2));
3850 return true;
3851 case ISD::SRA:
3852 Hi = DAG.getNode(ISD::SRA, NVT, InH, Amt);
3853 Lo = DAG.getNode(ISD::OR, NVT,
3854 DAG.getNode(ISD::SRL, NVT, InL, Amt),
3855 DAG.getNode(ISD::SHL, NVT, InH, Amt2));
3856 return true;
3857 }
3858 }
3859
Nate Begemanf1fe32e2005-04-06 21:13:14 +00003860 return false;
Chris Lattnere34b3962005-01-19 04:19:40 +00003861}
Chris Lattner77e77a62005-01-21 06:05:23 +00003862
Chris Lattner9c32d3b2005-01-23 04:42:50 +00003863
Chris Lattner77e77a62005-01-21 06:05:23 +00003864// ExpandLibCall - Expand a node into a call to a libcall. If the result value
3865// does not fit into a register, return the lo part and set the hi part to the
3866// by-reg argument. If it does fit into a single register, return the result
3867// and leave the Hi part unset.
3868SDOperand SelectionDAGLegalize::ExpandLibCall(const char *Name, SDNode *Node,
3869 SDOperand &Hi) {
Chris Lattner6831a812006-02-13 09:18:02 +00003870 assert(!IsLegalizingCall && "Cannot overlap legalization of calls!");
3871 // The input chain to this libcall is the entry node of the function.
3872 // Legalizing the call will automatically add the previous call to the
3873 // dependence.
3874 SDOperand InChain = DAG.getEntryNode();
3875
Chris Lattner77e77a62005-01-21 06:05:23 +00003876 TargetLowering::ArgListTy Args;
3877 for (unsigned i = 0, e = Node->getNumOperands(); i != e; ++i) {
3878 MVT::ValueType ArgVT = Node->getOperand(i).getValueType();
3879 const Type *ArgTy = MVT::getTypeForValueType(ArgVT);
3880 Args.push_back(std::make_pair(Node->getOperand(i), ArgTy));
3881 }
3882 SDOperand Callee = DAG.getExternalSymbol(Name, TLI.getPointerTy());
Misha Brukmanedf128a2005-04-21 22:36:52 +00003883
Chris Lattner0d67f0c2005-05-11 19:02:11 +00003884 // Splice the libcall in wherever FindInputOutputChains tells us to.
Chris Lattner77e77a62005-01-21 06:05:23 +00003885 const Type *RetTy = MVT::getTypeForValueType(Node->getValueType(0));
Chris Lattner0d67f0c2005-05-11 19:02:11 +00003886 std::pair<SDOperand,SDOperand> CallInfo =
Chris Lattneradf6a962005-05-13 18:50:42 +00003887 TLI.LowerCallTo(InChain, RetTy, false, CallingConv::C, false,
3888 Callee, Args, DAG);
Chris Lattnerb9fa3bc2005-05-12 04:49:08 +00003889
Chris Lattner6831a812006-02-13 09:18:02 +00003890 // Legalize the call sequence, starting with the chain. This will advance
3891 // the LastCALLSEQ_END to the legalized version of the CALLSEQ_END node that
3892 // was added by LowerCallTo (guaranteeing proper serialization of calls).
3893 LegalizeOp(CallInfo.second);
Chris Lattner99c25b82005-09-02 20:26:58 +00003894 SDOperand Result;
Chris Lattner0d67f0c2005-05-11 19:02:11 +00003895 switch (getTypeAction(CallInfo.first.getValueType())) {
Chris Lattner77e77a62005-01-21 06:05:23 +00003896 default: assert(0 && "Unknown thing");
3897 case Legal:
Chris Lattner456a93a2006-01-28 07:39:30 +00003898 Result = CallInfo.first;
Chris Lattner99c25b82005-09-02 20:26:58 +00003899 break;
Chris Lattner77e77a62005-01-21 06:05:23 +00003900 case Expand:
Chris Lattner99c25b82005-09-02 20:26:58 +00003901 ExpandOp(CallInfo.first, Result, Hi);
Chris Lattner99c25b82005-09-02 20:26:58 +00003902 break;
Chris Lattner77e77a62005-01-21 06:05:23 +00003903 }
Chris Lattner99c25b82005-09-02 20:26:58 +00003904 return Result;
Chris Lattner77e77a62005-01-21 06:05:23 +00003905}
3906
Chris Lattner9c32d3b2005-01-23 04:42:50 +00003907
Chris Lattner77e77a62005-01-21 06:05:23 +00003908/// ExpandIntToFP - Expand a [US]INT_TO_FP operation, assuming that the
3909/// destination type is legal.
3910SDOperand SelectionDAGLegalize::
3911ExpandIntToFP(bool isSigned, MVT::ValueType DestTy, SDOperand Source) {
Chris Lattnerc9c60f62005-08-24 16:35:28 +00003912 assert(isTypeLegal(DestTy) && "Destination type is not legal!");
Chris Lattner77e77a62005-01-21 06:05:23 +00003913 assert(getTypeAction(Source.getValueType()) == Expand &&
3914 "This is not an expansion!");
3915 assert(Source.getValueType() == MVT::i64 && "Only handle expand from i64!");
3916
Chris Lattner0d67f0c2005-05-11 19:02:11 +00003917 if (!isSigned) {
Chris Lattnere9c35e72005-04-13 05:09:42 +00003918 assert(Source.getValueType() == MVT::i64 &&
3919 "This only works for 64-bit -> FP");
3920 // The 64-bit value loaded will be incorrectly if the 'sign bit' of the
3921 // incoming integer is set. To handle this, we dynamically test to see if
3922 // it is set, and, if so, add a fudge factor.
3923 SDOperand Lo, Hi;
3924 ExpandOp(Source, Lo, Hi);
3925
Chris Lattner66de05b2005-05-13 04:45:13 +00003926 // If this is unsigned, and not supported, first perform the conversion to
3927 // signed, then adjust the result if the sign bit is set.
3928 SDOperand SignedConv = ExpandIntToFP(true, DestTy,
3929 DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), Lo, Hi));
3930
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00003931 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Hi,
3932 DAG.getConstant(0, Hi.getValueType()),
3933 ISD::SETLT);
Chris Lattnere9c35e72005-04-13 05:09:42 +00003934 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
3935 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
3936 SignSet, Four, Zero);
Chris Lattner383203b2005-05-12 18:52:34 +00003937 uint64_t FF = 0x5f800000ULL;
3938 if (TLI.isLittleEndian()) FF <<= 32;
3939 static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF);
Chris Lattnere9c35e72005-04-13 05:09:42 +00003940
Chris Lattner5839bf22005-08-26 17:15:30 +00003941 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
Chris Lattnere9c35e72005-04-13 05:09:42 +00003942 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
3943 SDOperand FudgeInReg;
3944 if (DestTy == MVT::f32)
Chris Lattner52d08bd2005-05-09 20:23:03 +00003945 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx,
3946 DAG.getSrcValue(NULL));
Chris Lattnere9c35e72005-04-13 05:09:42 +00003947 else {
3948 assert(DestTy == MVT::f64 && "Unexpected conversion");
Chris Lattner5f056bf2005-07-10 01:55:33 +00003949 FudgeInReg = DAG.getExtLoad(ISD::EXTLOAD, MVT::f64, DAG.getEntryNode(),
3950 CPIdx, DAG.getSrcValue(NULL), MVT::f32);
Chris Lattnere9c35e72005-04-13 05:09:42 +00003951 }
Chris Lattner473a9902005-09-29 06:44:39 +00003952 return DAG.getNode(ISD::FADD, DestTy, SignedConv, FudgeInReg);
Chris Lattner77e77a62005-01-21 06:05:23 +00003953 }
Chris Lattner0d67f0c2005-05-11 19:02:11 +00003954
Chris Lattnera88a2602005-05-14 05:33:54 +00003955 // Check to see if the target has a custom way to lower this. If so, use it.
3956 switch (TLI.getOperationAction(ISD::SINT_TO_FP, Source.getValueType())) {
3957 default: assert(0 && "This action not implemented for this operation!");
3958 case TargetLowering::Legal:
3959 case TargetLowering::Expand:
3960 break; // This case is handled below.
Chris Lattner07dffd62005-08-26 00:14:16 +00003961 case TargetLowering::Custom: {
3962 SDOperand NV = TLI.LowerOperation(DAG.getNode(ISD::SINT_TO_FP, DestTy,
3963 Source), DAG);
3964 if (NV.Val)
3965 return LegalizeOp(NV);
3966 break; // The target decided this was legal after all
3967 }
Chris Lattnera88a2602005-05-14 05:33:54 +00003968 }
3969
Chris Lattner13689e22005-05-12 07:00:44 +00003970 // Expand the source, then glue it back together for the call. We must expand
3971 // the source in case it is shared (this pass of legalize must traverse it).
3972 SDOperand SrcLo, SrcHi;
3973 ExpandOp(Source, SrcLo, SrcHi);
3974 Source = DAG.getNode(ISD::BUILD_PAIR, Source.getValueType(), SrcLo, SrcHi);
3975
Chris Lattner0d67f0c2005-05-11 19:02:11 +00003976 const char *FnName = 0;
3977 if (DestTy == MVT::f32)
3978 FnName = "__floatdisf";
3979 else {
3980 assert(DestTy == MVT::f64 && "Unknown fp value type!");
3981 FnName = "__floatdidf";
3982 }
Chris Lattner6831a812006-02-13 09:18:02 +00003983
3984 Source = DAG.getNode(ISD::SINT_TO_FP, DestTy, Source);
3985 SDOperand UnusedHiPart;
Chris Lattner25125692006-02-17 04:32:33 +00003986 return ExpandLibCall(FnName, Source.Val, UnusedHiPart);
Chris Lattner77e77a62005-01-21 06:05:23 +00003987}
Misha Brukmanedf128a2005-04-21 22:36:52 +00003988
Chris Lattner22cde6a2006-01-28 08:25:58 +00003989/// ExpandLegalINT_TO_FP - This function is responsible for legalizing a
3990/// INT_TO_FP operation of the specified operand when the target requests that
3991/// we expand it. At this point, we know that the result and operand types are
3992/// legal for the target.
3993SDOperand SelectionDAGLegalize::ExpandLegalINT_TO_FP(bool isSigned,
3994 SDOperand Op0,
3995 MVT::ValueType DestVT) {
3996 if (Op0.getValueType() == MVT::i32) {
3997 // simple 32-bit [signed|unsigned] integer to float/double expansion
3998
3999 // get the stack frame index of a 8 byte buffer
4000 MachineFunction &MF = DAG.getMachineFunction();
4001 int SSFI = MF.getFrameInfo()->CreateStackObject(8, 8);
4002 // get address of 8 byte buffer
4003 SDOperand StackSlot = DAG.getFrameIndex(SSFI, TLI.getPointerTy());
4004 // word offset constant for Hi/Lo address computation
4005 SDOperand WordOff = DAG.getConstant(sizeof(int), TLI.getPointerTy());
4006 // set up Hi and Lo (into buffer) address based on endian
Chris Lattner408c4282006-03-23 05:29:04 +00004007 SDOperand Hi = StackSlot;
4008 SDOperand Lo = DAG.getNode(ISD::ADD, TLI.getPointerTy(), StackSlot,WordOff);
4009 if (TLI.isLittleEndian())
4010 std::swap(Hi, Lo);
4011
Chris Lattner22cde6a2006-01-28 08:25:58 +00004012 // if signed map to unsigned space
4013 SDOperand Op0Mapped;
4014 if (isSigned) {
4015 // constant used to invert sign bit (signed to unsigned mapping)
4016 SDOperand SignBit = DAG.getConstant(0x80000000u, MVT::i32);
4017 Op0Mapped = DAG.getNode(ISD::XOR, MVT::i32, Op0, SignBit);
4018 } else {
4019 Op0Mapped = Op0;
4020 }
4021 // store the lo of the constructed double - based on integer input
4022 SDOperand Store1 = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
4023 Op0Mapped, Lo, DAG.getSrcValue(NULL));
4024 // initial hi portion of constructed double
4025 SDOperand InitialHi = DAG.getConstant(0x43300000u, MVT::i32);
4026 // store the hi of the constructed double - biased exponent
4027 SDOperand Store2 = DAG.getNode(ISD::STORE, MVT::Other, Store1,
4028 InitialHi, Hi, DAG.getSrcValue(NULL));
4029 // load the constructed double
4030 SDOperand Load = DAG.getLoad(MVT::f64, Store2, StackSlot,
4031 DAG.getSrcValue(NULL));
4032 // FP constant to bias correct the final result
4033 SDOperand Bias = DAG.getConstantFP(isSigned ?
4034 BitsToDouble(0x4330000080000000ULL)
4035 : BitsToDouble(0x4330000000000000ULL),
4036 MVT::f64);
4037 // subtract the bias
4038 SDOperand Sub = DAG.getNode(ISD::FSUB, MVT::f64, Load, Bias);
4039 // final result
4040 SDOperand Result;
4041 // handle final rounding
4042 if (DestVT == MVT::f64) {
4043 // do nothing
4044 Result = Sub;
4045 } else {
4046 // if f32 then cast to f32
4047 Result = DAG.getNode(ISD::FP_ROUND, MVT::f32, Sub);
4048 }
4049 return Result;
4050 }
4051 assert(!isSigned && "Legalize cannot Expand SINT_TO_FP for i64 yet");
4052 SDOperand Tmp1 = DAG.getNode(ISD::SINT_TO_FP, DestVT, Op0);
4053
4054 SDOperand SignSet = DAG.getSetCC(TLI.getSetCCResultTy(), Op0,
4055 DAG.getConstant(0, Op0.getValueType()),
4056 ISD::SETLT);
4057 SDOperand Zero = getIntPtrConstant(0), Four = getIntPtrConstant(4);
4058 SDOperand CstOffset = DAG.getNode(ISD::SELECT, Zero.getValueType(),
4059 SignSet, Four, Zero);
4060
4061 // If the sign bit of the integer is set, the large number will be treated
4062 // as a negative number. To counteract this, the dynamic code adds an
4063 // offset depending on the data type.
4064 uint64_t FF;
4065 switch (Op0.getValueType()) {
4066 default: assert(0 && "Unsupported integer type!");
4067 case MVT::i8 : FF = 0x43800000ULL; break; // 2^8 (as a float)
4068 case MVT::i16: FF = 0x47800000ULL; break; // 2^16 (as a float)
4069 case MVT::i32: FF = 0x4F800000ULL; break; // 2^32 (as a float)
4070 case MVT::i64: FF = 0x5F800000ULL; break; // 2^64 (as a float)
4071 }
4072 if (TLI.isLittleEndian()) FF <<= 32;
4073 static Constant *FudgeFactor = ConstantUInt::get(Type::ULongTy, FF);
4074
4075 SDOperand CPIdx = DAG.getConstantPool(FudgeFactor, TLI.getPointerTy());
4076 CPIdx = DAG.getNode(ISD::ADD, TLI.getPointerTy(), CPIdx, CstOffset);
4077 SDOperand FudgeInReg;
4078 if (DestVT == MVT::f32)
4079 FudgeInReg = DAG.getLoad(MVT::f32, DAG.getEntryNode(), CPIdx,
4080 DAG.getSrcValue(NULL));
4081 else {
4082 assert(DestVT == MVT::f64 && "Unexpected conversion");
4083 FudgeInReg = LegalizeOp(DAG.getExtLoad(ISD::EXTLOAD, MVT::f64,
4084 DAG.getEntryNode(), CPIdx,
4085 DAG.getSrcValue(NULL), MVT::f32));
4086 }
4087
4088 return DAG.getNode(ISD::FADD, DestVT, Tmp1, FudgeInReg);
4089}
4090
4091/// PromoteLegalINT_TO_FP - This function is responsible for legalizing a
4092/// *INT_TO_FP operation of the specified operand when the target requests that
4093/// we promote it. At this point, we know that the result and operand types are
4094/// legal for the target, and that there is a legal UINT_TO_FP or SINT_TO_FP
4095/// operation that takes a larger input.
4096SDOperand SelectionDAGLegalize::PromoteLegalINT_TO_FP(SDOperand LegalOp,
4097 MVT::ValueType DestVT,
4098 bool isSigned) {
4099 // First step, figure out the appropriate *INT_TO_FP operation to use.
4100 MVT::ValueType NewInTy = LegalOp.getValueType();
4101
4102 unsigned OpToUse = 0;
4103
4104 // Scan for the appropriate larger type to use.
4105 while (1) {
4106 NewInTy = (MVT::ValueType)(NewInTy+1);
4107 assert(MVT::isInteger(NewInTy) && "Ran out of possibilities!");
4108
4109 // If the target supports SINT_TO_FP of this type, use it.
4110 switch (TLI.getOperationAction(ISD::SINT_TO_FP, NewInTy)) {
4111 default: break;
4112 case TargetLowering::Legal:
4113 if (!TLI.isTypeLegal(NewInTy))
4114 break; // Can't use this datatype.
4115 // FALL THROUGH.
4116 case TargetLowering::Custom:
4117 OpToUse = ISD::SINT_TO_FP;
4118 break;
4119 }
4120 if (OpToUse) break;
4121 if (isSigned) continue;
4122
4123 // If the target supports UINT_TO_FP of this type, use it.
4124 switch (TLI.getOperationAction(ISD::UINT_TO_FP, NewInTy)) {
4125 default: break;
4126 case TargetLowering::Legal:
4127 if (!TLI.isTypeLegal(NewInTy))
4128 break; // Can't use this datatype.
4129 // FALL THROUGH.
4130 case TargetLowering::Custom:
4131 OpToUse = ISD::UINT_TO_FP;
4132 break;
4133 }
4134 if (OpToUse) break;
4135
4136 // Otherwise, try a larger type.
4137 }
4138
4139 // Okay, we found the operation and type to use. Zero extend our input to the
4140 // desired type then run the operation on it.
4141 return DAG.getNode(OpToUse, DestVT,
4142 DAG.getNode(isSigned ? ISD::SIGN_EXTEND : ISD::ZERO_EXTEND,
4143 NewInTy, LegalOp));
4144}
4145
4146/// PromoteLegalFP_TO_INT - This function is responsible for legalizing a
4147/// FP_TO_*INT operation of the specified operand when the target requests that
4148/// we promote it. At this point, we know that the result and operand types are
4149/// legal for the target, and that there is a legal FP_TO_UINT or FP_TO_SINT
4150/// operation that returns a larger result.
4151SDOperand SelectionDAGLegalize::PromoteLegalFP_TO_INT(SDOperand LegalOp,
4152 MVT::ValueType DestVT,
4153 bool isSigned) {
4154 // First step, figure out the appropriate FP_TO*INT operation to use.
4155 MVT::ValueType NewOutTy = DestVT;
4156
4157 unsigned OpToUse = 0;
4158
4159 // Scan for the appropriate larger type to use.
4160 while (1) {
4161 NewOutTy = (MVT::ValueType)(NewOutTy+1);
4162 assert(MVT::isInteger(NewOutTy) && "Ran out of possibilities!");
4163
4164 // If the target supports FP_TO_SINT returning this type, use it.
4165 switch (TLI.getOperationAction(ISD::FP_TO_SINT, NewOutTy)) {
4166 default: break;
4167 case TargetLowering::Legal:
4168 if (!TLI.isTypeLegal(NewOutTy))
4169 break; // Can't use this datatype.
4170 // FALL THROUGH.
4171 case TargetLowering::Custom:
4172 OpToUse = ISD::FP_TO_SINT;
4173 break;
4174 }
4175 if (OpToUse) break;
4176
4177 // If the target supports FP_TO_UINT of this type, use it.
4178 switch (TLI.getOperationAction(ISD::FP_TO_UINT, NewOutTy)) {
4179 default: break;
4180 case TargetLowering::Legal:
4181 if (!TLI.isTypeLegal(NewOutTy))
4182 break; // Can't use this datatype.
4183 // FALL THROUGH.
4184 case TargetLowering::Custom:
4185 OpToUse = ISD::FP_TO_UINT;
4186 break;
4187 }
4188 if (OpToUse) break;
4189
4190 // Otherwise, try a larger type.
4191 }
4192
4193 // Okay, we found the operation and type to use. Truncate the result of the
4194 // extended FP_TO_*INT operation to the desired size.
4195 return DAG.getNode(ISD::TRUNCATE, DestVT,
4196 DAG.getNode(OpToUse, NewOutTy, LegalOp));
4197}
4198
4199/// ExpandBSWAP - Open code the operations for BSWAP of the specified operation.
4200///
4201SDOperand SelectionDAGLegalize::ExpandBSWAP(SDOperand Op) {
4202 MVT::ValueType VT = Op.getValueType();
4203 MVT::ValueType SHVT = TLI.getShiftAmountTy();
4204 SDOperand Tmp1, Tmp2, Tmp3, Tmp4, Tmp5, Tmp6, Tmp7, Tmp8;
4205 switch (VT) {
4206 default: assert(0 && "Unhandled Expand type in BSWAP!"); abort();
4207 case MVT::i16:
4208 Tmp2 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4209 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4210 return DAG.getNode(ISD::OR, VT, Tmp1, Tmp2);
4211 case MVT::i32:
4212 Tmp4 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
4213 Tmp3 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4214 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4215 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
4216 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(0xFF0000, VT));
4217 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(0xFF00, VT));
4218 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
4219 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
4220 return DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
4221 case MVT::i64:
4222 Tmp8 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(56, SHVT));
4223 Tmp7 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(40, SHVT));
4224 Tmp6 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(24, SHVT));
4225 Tmp5 = DAG.getNode(ISD::SHL, VT, Op, DAG.getConstant(8, SHVT));
4226 Tmp4 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(8, SHVT));
4227 Tmp3 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(24, SHVT));
4228 Tmp2 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(40, SHVT));
4229 Tmp1 = DAG.getNode(ISD::SRL, VT, Op, DAG.getConstant(56, SHVT));
4230 Tmp7 = DAG.getNode(ISD::AND, VT, Tmp7, DAG.getConstant(255ULL<<48, VT));
4231 Tmp6 = DAG.getNode(ISD::AND, VT, Tmp6, DAG.getConstant(255ULL<<40, VT));
4232 Tmp5 = DAG.getNode(ISD::AND, VT, Tmp5, DAG.getConstant(255ULL<<32, VT));
4233 Tmp4 = DAG.getNode(ISD::AND, VT, Tmp4, DAG.getConstant(255ULL<<24, VT));
4234 Tmp3 = DAG.getNode(ISD::AND, VT, Tmp3, DAG.getConstant(255ULL<<16, VT));
4235 Tmp2 = DAG.getNode(ISD::AND, VT, Tmp2, DAG.getConstant(255ULL<<8 , VT));
4236 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp7);
4237 Tmp6 = DAG.getNode(ISD::OR, VT, Tmp6, Tmp5);
4238 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp3);
4239 Tmp2 = DAG.getNode(ISD::OR, VT, Tmp2, Tmp1);
4240 Tmp8 = DAG.getNode(ISD::OR, VT, Tmp8, Tmp6);
4241 Tmp4 = DAG.getNode(ISD::OR, VT, Tmp4, Tmp2);
4242 return DAG.getNode(ISD::OR, VT, Tmp8, Tmp4);
4243 }
4244}
4245
4246/// ExpandBitCount - Expand the specified bitcount instruction into operations.
4247///
4248SDOperand SelectionDAGLegalize::ExpandBitCount(unsigned Opc, SDOperand Op) {
4249 switch (Opc) {
4250 default: assert(0 && "Cannot expand this yet!");
4251 case ISD::CTPOP: {
4252 static const uint64_t mask[6] = {
4253 0x5555555555555555ULL, 0x3333333333333333ULL,
4254 0x0F0F0F0F0F0F0F0FULL, 0x00FF00FF00FF00FFULL,
4255 0x0000FFFF0000FFFFULL, 0x00000000FFFFFFFFULL
4256 };
4257 MVT::ValueType VT = Op.getValueType();
4258 MVT::ValueType ShVT = TLI.getShiftAmountTy();
4259 unsigned len = getSizeInBits(VT);
4260 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
4261 //x = (x & mask[i][len/8]) + (x >> (1 << i) & mask[i][len/8])
4262 SDOperand Tmp2 = DAG.getConstant(mask[i], VT);
4263 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
4264 Op = DAG.getNode(ISD::ADD, VT, DAG.getNode(ISD::AND, VT, Op, Tmp2),
4265 DAG.getNode(ISD::AND, VT,
4266 DAG.getNode(ISD::SRL, VT, Op, Tmp3),Tmp2));
4267 }
4268 return Op;
4269 }
4270 case ISD::CTLZ: {
4271 // for now, we do this:
4272 // x = x | (x >> 1);
4273 // x = x | (x >> 2);
4274 // ...
4275 // x = x | (x >>16);
4276 // x = x | (x >>32); // for 64-bit input
4277 // return popcount(~x);
4278 //
4279 // but see also: http://www.hackersdelight.org/HDcode/nlz.cc
4280 MVT::ValueType VT = Op.getValueType();
4281 MVT::ValueType ShVT = TLI.getShiftAmountTy();
4282 unsigned len = getSizeInBits(VT);
4283 for (unsigned i = 0; (1U << i) <= (len / 2); ++i) {
4284 SDOperand Tmp3 = DAG.getConstant(1ULL << i, ShVT);
4285 Op = DAG.getNode(ISD::OR, VT, Op, DAG.getNode(ISD::SRL, VT, Op, Tmp3));
4286 }
4287 Op = DAG.getNode(ISD::XOR, VT, Op, DAG.getConstant(~0ULL, VT));
4288 return DAG.getNode(ISD::CTPOP, VT, Op);
4289 }
4290 case ISD::CTTZ: {
4291 // for now, we use: { return popcount(~x & (x - 1)); }
4292 // unless the target has ctlz but not ctpop, in which case we use:
4293 // { return 32 - nlz(~x & (x-1)); }
4294 // see also http://www.hackersdelight.org/HDcode/ntz.cc
4295 MVT::ValueType VT = Op.getValueType();
4296 SDOperand Tmp2 = DAG.getConstant(~0ULL, VT);
4297 SDOperand Tmp3 = DAG.getNode(ISD::AND, VT,
4298 DAG.getNode(ISD::XOR, VT, Op, Tmp2),
4299 DAG.getNode(ISD::SUB, VT, Op, DAG.getConstant(1, VT)));
4300 // If ISD::CTLZ is legal and CTPOP isn't, then do that instead.
4301 if (!TLI.isOperationLegal(ISD::CTPOP, VT) &&
4302 TLI.isOperationLegal(ISD::CTLZ, VT))
4303 return DAG.getNode(ISD::SUB, VT,
4304 DAG.getConstant(getSizeInBits(VT), VT),
4305 DAG.getNode(ISD::CTLZ, VT, Tmp3));
4306 return DAG.getNode(ISD::CTPOP, VT, Tmp3);
4307 }
4308 }
4309}
Chris Lattnere34b3962005-01-19 04:19:40 +00004310
Chris Lattner3e928bb2005-01-07 07:47:09 +00004311/// ExpandOp - Expand the specified SDOperand into its two component pieces
4312/// Lo&Hi. Note that the Op MUST be an expanded type. As a result of this, the
4313/// LegalizeNodes map is filled in for any results that are not expanded, the
4314/// ExpandedNodes map is filled in for any results that are expanded, and the
4315/// Lo/Hi values are returned.
4316void SelectionDAGLegalize::ExpandOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi){
4317 MVT::ValueType VT = Op.getValueType();
Chris Lattner71c42a02005-01-16 01:11:45 +00004318 MVT::ValueType NVT = TLI.getTypeToTransformTo(VT);
Chris Lattner3e928bb2005-01-07 07:47:09 +00004319 SDNode *Node = Op.Val;
4320 assert(getTypeAction(VT) == Expand && "Not an expanded type!");
Nate Begemanab48be32005-11-22 18:16:00 +00004321 assert((MVT::isInteger(VT) || VT == MVT::Vector) &&
4322 "Cannot expand FP values!");
4323 assert(((MVT::isInteger(NVT) && NVT < VT) || VT == MVT::Vector) &&
Chris Lattner3e928bb2005-01-07 07:47:09 +00004324 "Cannot expand to FP value or to larger int value!");
4325
Chris Lattner6fdcb252005-09-02 20:32:45 +00004326 // See if we already expanded it.
4327 std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
4328 = ExpandedNodes.find(Op);
4329 if (I != ExpandedNodes.end()) {
4330 Lo = I->second.first;
4331 Hi = I->second.second;
4332 return;
Chris Lattner3e928bb2005-01-07 07:47:09 +00004333 }
4334
Chris Lattner3e928bb2005-01-07 07:47:09 +00004335 switch (Node->getOpcode()) {
Chris Lattner348e93c2006-01-21 04:27:00 +00004336 case ISD::CopyFromReg:
4337 assert(0 && "CopyFromReg must be legal!");
4338 default:
Jim Laskeye37fe9b2006-07-11 17:58:07 +00004339#ifndef NDEBUG
Chris Lattner3e928bb2005-01-07 07:47:09 +00004340 std::cerr << "NODE: "; Node->dump(); std::cerr << "\n";
Jim Laskeye37fe9b2006-07-11 17:58:07 +00004341#endif
Chris Lattner3e928bb2005-01-07 07:47:09 +00004342 assert(0 && "Do not know how to expand this operator!");
4343 abort();
Nate Begemanfc1b1da2005-04-01 22:34:39 +00004344 case ISD::UNDEF:
4345 Lo = DAG.getNode(ISD::UNDEF, NVT);
4346 Hi = DAG.getNode(ISD::UNDEF, NVT);
4347 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00004348 case ISD::Constant: {
4349 uint64_t Cst = cast<ConstantSDNode>(Node)->getValue();
4350 Lo = DAG.getConstant(Cst, NVT);
4351 Hi = DAG.getConstant(Cst >> MVT::getSizeInBits(NVT), NVT);
4352 break;
4353 }
Chris Lattnerd4e50bb2005-03-28 22:03:13 +00004354 case ISD::BUILD_PAIR:
Chris Lattner8137c9e2006-01-28 05:07:51 +00004355 // Return the operands.
4356 Lo = Node->getOperand(0);
4357 Hi = Node->getOperand(1);
Chris Lattnerd4e50bb2005-03-28 22:03:13 +00004358 break;
Chris Lattner58f79632005-12-12 22:27:43 +00004359
4360 case ISD::SIGN_EXTEND_INREG:
4361 ExpandOp(Node->getOperand(0), Lo, Hi);
4362 // Sign extend the lo-part.
4363 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
4364 DAG.getConstant(MVT::getSizeInBits(NVT)-1,
4365 TLI.getShiftAmountTy()));
4366 // sext_inreg the low part if needed.
4367 Lo = DAG.getNode(ISD::SIGN_EXTEND_INREG, NVT, Lo, Node->getOperand(1));
4368 break;
Chris Lattnerd4e50bb2005-03-28 22:03:13 +00004369
Nate Begemand88fc032006-01-14 03:14:10 +00004370 case ISD::BSWAP: {
4371 ExpandOp(Node->getOperand(0), Lo, Hi);
4372 SDOperand TempLo = DAG.getNode(ISD::BSWAP, NVT, Hi);
4373 Hi = DAG.getNode(ISD::BSWAP, NVT, Lo);
4374 Lo = TempLo;
4375 break;
4376 }
4377
Chris Lattneredb1add2005-05-11 04:51:16 +00004378 case ISD::CTPOP:
4379 ExpandOp(Node->getOperand(0), Lo, Hi);
Chris Lattner9b583b42005-05-11 05:09:47 +00004380 Lo = DAG.getNode(ISD::ADD, NVT, // ctpop(HL) -> ctpop(H)+ctpop(L)
4381 DAG.getNode(ISD::CTPOP, NVT, Lo),
4382 DAG.getNode(ISD::CTPOP, NVT, Hi));
Chris Lattneredb1add2005-05-11 04:51:16 +00004383 Hi = DAG.getConstant(0, NVT);
4384 break;
4385
Chris Lattner39a8f332005-05-12 19:05:01 +00004386 case ISD::CTLZ: {
4387 // ctlz (HL) -> ctlz(H) != 32 ? ctlz(H) : (ctlz(L)+32)
Chris Lattner3becf202005-05-12 19:27:51 +00004388 ExpandOp(Node->getOperand(0), Lo, Hi);
Chris Lattner39a8f332005-05-12 19:05:01 +00004389 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
4390 SDOperand HLZ = DAG.getNode(ISD::CTLZ, NVT, Hi);
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00004391 SDOperand TopNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), HLZ, BitsC,
4392 ISD::SETNE);
Chris Lattner39a8f332005-05-12 19:05:01 +00004393 SDOperand LowPart = DAG.getNode(ISD::CTLZ, NVT, Lo);
4394 LowPart = DAG.getNode(ISD::ADD, NVT, LowPart, BitsC);
4395
4396 Lo = DAG.getNode(ISD::SELECT, NVT, TopNotZero, HLZ, LowPart);
4397 Hi = DAG.getConstant(0, NVT);
4398 break;
4399 }
4400
4401 case ISD::CTTZ: {
4402 // cttz (HL) -> cttz(L) != 32 ? cttz(L) : (cttz(H)+32)
Chris Lattner3becf202005-05-12 19:27:51 +00004403 ExpandOp(Node->getOperand(0), Lo, Hi);
Chris Lattner39a8f332005-05-12 19:05:01 +00004404 SDOperand BitsC = DAG.getConstant(MVT::getSizeInBits(NVT), NVT);
4405 SDOperand LTZ = DAG.getNode(ISD::CTTZ, NVT, Lo);
Chris Lattner7cf7e3f2005-08-09 20:20:18 +00004406 SDOperand BotNotZero = DAG.getSetCC(TLI.getSetCCResultTy(), LTZ, BitsC,
4407 ISD::SETNE);
Chris Lattner39a8f332005-05-12 19:05:01 +00004408 SDOperand HiPart = DAG.getNode(ISD::CTTZ, NVT, Hi);
4409 HiPart = DAG.getNode(ISD::ADD, NVT, HiPart, BitsC);
4410
4411 Lo = DAG.getNode(ISD::SELECT, NVT, BotNotZero, LTZ, HiPart);
4412 Hi = DAG.getConstant(0, NVT);
4413 break;
4414 }
Chris Lattneredb1add2005-05-11 04:51:16 +00004415
Nate Begemanacc398c2006-01-25 18:21:52 +00004416 case ISD::VAARG: {
Chris Lattner8137c9e2006-01-28 05:07:51 +00004417 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
4418 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
Nate Begemanacc398c2006-01-25 18:21:52 +00004419 Lo = DAG.getVAArg(NVT, Ch, Ptr, Node->getOperand(2));
4420 Hi = DAG.getVAArg(NVT, Lo.getValue(1), Ptr, Node->getOperand(2));
4421
4422 // Remember that we legalized the chain.
Chris Lattner8137c9e2006-01-28 05:07:51 +00004423 Hi = LegalizeOp(Hi);
Nate Begemanacc398c2006-01-25 18:21:52 +00004424 AddLegalizedOperand(Op.getValue(1), Hi.getValue(1));
4425 if (!TLI.isLittleEndian())
4426 std::swap(Lo, Hi);
4427 break;
4428 }
4429
Chris Lattner3e928bb2005-01-07 07:47:09 +00004430 case ISD::LOAD: {
Chris Lattner8137c9e2006-01-28 05:07:51 +00004431 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
4432 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
Andrew Lenharth2d86ea22005-04-27 20:10:01 +00004433 Lo = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2));
Chris Lattner3e928bb2005-01-07 07:47:09 +00004434
4435 // Increment the pointer to the other half.
Chris Lattner38d6be52005-01-09 19:43:23 +00004436 unsigned IncrementSize = MVT::getSizeInBits(Lo.getValueType())/8;
Chris Lattner3e928bb2005-01-07 07:47:09 +00004437 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
4438 getIntPtrConstant(IncrementSize));
Chris Lattner8137c9e2006-01-28 05:07:51 +00004439 // FIXME: This creates a bogus srcvalue!
Andrew Lenharth2d86ea22005-04-27 20:10:01 +00004440 Hi = DAG.getLoad(NVT, Ch, Ptr, Node->getOperand(2));
Chris Lattnerec39a452005-01-19 18:02:17 +00004441
4442 // Build a factor node to remember that this load is independent of the
4443 // other one.
4444 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
4445 Hi.getValue(1));
Misha Brukmanedf128a2005-04-21 22:36:52 +00004446
Chris Lattner3e928bb2005-01-07 07:47:09 +00004447 // Remember that we legalized the chain.
Chris Lattner8137c9e2006-01-28 05:07:51 +00004448 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
Chris Lattner3e928bb2005-01-07 07:47:09 +00004449 if (!TLI.isLittleEndian())
4450 std::swap(Lo, Hi);
4451 break;
4452 }
Chris Lattner3e928bb2005-01-07 07:47:09 +00004453 case ISD::AND:
4454 case ISD::OR:
4455 case ISD::XOR: { // Simple logical operators -> two trivial pieces.
4456 SDOperand LL, LH, RL, RH;
4457 ExpandOp(Node->getOperand(0), LL, LH);
4458 ExpandOp(Node->getOperand(1), RL, RH);
4459 Lo = DAG.getNode(Node->getOpcode(), NVT, LL, RL);
4460 Hi = DAG.getNode(Node->getOpcode(), NVT, LH, RH);
4461 break;
4462 }
4463 case ISD::SELECT: {
Chris Lattner456a93a2006-01-28 07:39:30 +00004464 SDOperand LL, LH, RL, RH;
Chris Lattner3e928bb2005-01-07 07:47:09 +00004465 ExpandOp(Node->getOperand(1), LL, LH);
4466 ExpandOp(Node->getOperand(2), RL, RH);
Chris Lattner456a93a2006-01-28 07:39:30 +00004467 Lo = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LL, RL);
4468 Hi = DAG.getNode(ISD::SELECT, NVT, Node->getOperand(0), LH, RH);
Chris Lattner3e928bb2005-01-07 07:47:09 +00004469 break;
4470 }
Nate Begeman9373a812005-08-10 20:51:12 +00004471 case ISD::SELECT_CC: {
4472 SDOperand TL, TH, FL, FH;
4473 ExpandOp(Node->getOperand(2), TL, TH);
4474 ExpandOp(Node->getOperand(3), FL, FH);
4475 Lo = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
4476 Node->getOperand(1), TL, FL, Node->getOperand(4));
4477 Hi = DAG.getNode(ISD::SELECT_CC, NVT, Node->getOperand(0),
4478 Node->getOperand(1), TH, FH, Node->getOperand(4));
4479 break;
4480 }
Evan Chengc5484282006-10-04 00:56:09 +00004481 case ISD::LOADX: {
Chris Lattner8137c9e2006-01-28 05:07:51 +00004482 SDOperand Chain = Node->getOperand(0);
4483 SDOperand Ptr = Node->getOperand(1);
Nate Begeman144ff662005-10-13 17:15:37 +00004484 MVT::ValueType EVT = cast<VTSDNode>(Node->getOperand(3))->getVT();
Evan Chengc5484282006-10-04 00:56:09 +00004485 unsigned LType = Node->getConstantOperandVal(4);
Nate Begeman144ff662005-10-13 17:15:37 +00004486
4487 if (EVT == NVT)
4488 Lo = DAG.getLoad(NVT, Chain, Ptr, Node->getOperand(2));
4489 else
4490 Lo = DAG.getExtLoad(ISD::SEXTLOAD, NVT, Chain, Ptr, Node->getOperand(2),
4491 EVT);
Chris Lattner9ad84812005-10-13 21:44:47 +00004492
4493 // Remember that we legalized the chain.
Chris Lattner8137c9e2006-01-28 05:07:51 +00004494 AddLegalizedOperand(SDOperand(Node, 1), LegalizeOp(Lo.getValue(1)));
Chris Lattner9ad84812005-10-13 21:44:47 +00004495
Evan Chengc5484282006-10-04 00:56:09 +00004496 if (LType == ISD::SEXTLOAD) {
4497 // The high part is obtained by SRA'ing all but one of the bits of the lo
4498 // part.
4499 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
4500 Hi = DAG.getNode(ISD::SRA, NVT, Lo, DAG.getConstant(LoSize-1,
4501 TLI.getShiftAmountTy()));
4502 } else if (LType == ISD::ZEXTLOAD) {
4503 // The high part is just a zero.
4504 Hi = DAG.getConstant(0, NVT);
4505 } else /* if (LType == ISD::EXTLOAD) */ {
4506 // The high part is undefined.
4507 Hi = DAG.getNode(ISD::UNDEF, NVT);
4508 }
Chris Lattner13c78e22005-09-02 00:18:10 +00004509 break;
4510 }
Chris Lattner8137c9e2006-01-28 05:07:51 +00004511 case ISD::ANY_EXTEND:
4512 // The low part is any extension of the input (which degenerates to a copy).
4513 Lo = DAG.getNode(ISD::ANY_EXTEND, NVT, Node->getOperand(0));
4514 // The high part is undefined.
4515 Hi = DAG.getNode(ISD::UNDEF, NVT);
4516 break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00004517 case ISD::SIGN_EXTEND: {
4518 // The low part is just a sign extension of the input (which degenerates to
4519 // a copy).
Chris Lattner8137c9e2006-01-28 05:07:51 +00004520 Lo = DAG.getNode(ISD::SIGN_EXTEND, NVT, Node->getOperand(0));
Misha Brukmanedf128a2005-04-21 22:36:52 +00004521
Chris Lattner3e928bb2005-01-07 07:47:09 +00004522 // The high part is obtained by SRA'ing all but one of the bits of the lo
4523 // part.
Chris Lattner2dad4542005-01-12 18:19:52 +00004524 unsigned LoSize = MVT::getSizeInBits(Lo.getValueType());
Chris Lattner8137c9e2006-01-28 05:07:51 +00004525 Hi = DAG.getNode(ISD::SRA, NVT, Lo,
4526 DAG.getConstant(LoSize-1, TLI.getShiftAmountTy()));
Chris Lattner3e928bb2005-01-07 07:47:09 +00004527 break;
4528 }
Chris Lattner8137c9e2006-01-28 05:07:51 +00004529 case ISD::ZERO_EXTEND:
Chris Lattner3e928bb2005-01-07 07:47:09 +00004530 // The low part is just a zero extension of the input (which degenerates to
4531 // a copy).
Chris Lattner8137c9e2006-01-28 05:07:51 +00004532 Lo = DAG.getNode(ISD::ZERO_EXTEND, NVT, Node->getOperand(0));
Misha Brukmanedf128a2005-04-21 22:36:52 +00004533
Chris Lattner3e928bb2005-01-07 07:47:09 +00004534 // The high part is just a zero.
4535 Hi = DAG.getConstant(0, NVT);
4536 break;
Chris Lattner35481892005-12-23 00:16:34 +00004537
4538 case ISD::BIT_CONVERT: {
Chris Lattnerf3f333d2006-09-09 00:20:27 +00004539 SDOperand Tmp;
4540 if (TLI.getOperationAction(ISD::BIT_CONVERT, VT) == TargetLowering::Custom){
4541 // If the target wants to, allow it to lower this itself.
4542 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4543 case Expand: assert(0 && "cannot expand FP!");
4544 case Legal: Tmp = LegalizeOp(Node->getOperand(0)); break;
4545 case Promote: Tmp = PromoteOp (Node->getOperand(0)); break;
4546 }
4547 Tmp = TLI.LowerOperation(DAG.getNode(ISD::BIT_CONVERT, VT, Tmp), DAG);
4548 }
4549
4550 // Turn this into a load/store pair by default.
4551 if (Tmp.Val == 0)
4552 Tmp = ExpandBIT_CONVERT(Node->getValueType(0), Node->getOperand(0));
4553
Chris Lattner35481892005-12-23 00:16:34 +00004554 ExpandOp(Tmp, Lo, Hi);
4555 break;
4556 }
Andrew Lenharthf70e30b2005-11-20 21:32:07 +00004557
Chris Lattner8137c9e2006-01-28 05:07:51 +00004558 case ISD::READCYCLECOUNTER:
Chris Lattner308575b2005-11-20 22:56:56 +00004559 assert(TLI.getOperationAction(ISD::READCYCLECOUNTER, VT) ==
4560 TargetLowering::Custom &&
4561 "Must custom expand ReadCycleCounter");
Chris Lattner8137c9e2006-01-28 05:07:51 +00004562 Lo = TLI.LowerOperation(Op, DAG);
4563 assert(Lo.Val && "Node must be custom expanded!");
4564 Hi = Lo.getValue(1);
Chris Lattner308575b2005-11-20 22:56:56 +00004565 AddLegalizedOperand(SDOperand(Node, 1), // Remember we legalized the chain.
Chris Lattner8137c9e2006-01-28 05:07:51 +00004566 LegalizeOp(Lo.getValue(2)));
Andrew Lenharthf70e30b2005-11-20 21:32:07 +00004567 break;
4568
Chris Lattner4e6c7462005-01-08 19:27:05 +00004569 // These operators cannot be expanded directly, emit them as calls to
4570 // library functions.
4571 case ISD::FP_TO_SINT:
Chris Lattner80a3e942005-07-29 00:33:32 +00004572 if (TLI.getOperationAction(ISD::FP_TO_SINT, VT) == TargetLowering::Custom) {
Chris Lattnerf20d1832005-07-30 01:40:57 +00004573 SDOperand Op;
4574 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4575 case Expand: assert(0 && "cannot expand FP!");
Chris Lattner8137c9e2006-01-28 05:07:51 +00004576 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
4577 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
Chris Lattnerf20d1832005-07-30 01:40:57 +00004578 }
Jeff Cohend29b6aa2005-07-30 18:33:25 +00004579
Chris Lattnerf20d1832005-07-30 01:40:57 +00004580 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_SINT, VT, Op), DAG);
4581
Chris Lattner80a3e942005-07-29 00:33:32 +00004582 // Now that the custom expander is done, expand the result, which is still
4583 // VT.
Chris Lattner07dffd62005-08-26 00:14:16 +00004584 if (Op.Val) {
4585 ExpandOp(Op, Lo, Hi);
4586 break;
4587 }
Chris Lattner80a3e942005-07-29 00:33:32 +00004588 }
Jeff Cohend29b6aa2005-07-30 18:33:25 +00004589
Chris Lattner4e6c7462005-01-08 19:27:05 +00004590 if (Node->getOperand(0).getValueType() == MVT::f32)
Chris Lattner77e77a62005-01-21 06:05:23 +00004591 Lo = ExpandLibCall("__fixsfdi", Node, Hi);
Chris Lattner4e6c7462005-01-08 19:27:05 +00004592 else
Chris Lattner77e77a62005-01-21 06:05:23 +00004593 Lo = ExpandLibCall("__fixdfdi", Node, Hi);
Chris Lattner4e6c7462005-01-08 19:27:05 +00004594 break;
Jeff Cohend29b6aa2005-07-30 18:33:25 +00004595
Chris Lattner4e6c7462005-01-08 19:27:05 +00004596 case ISD::FP_TO_UINT:
Chris Lattner80a3e942005-07-29 00:33:32 +00004597 if (TLI.getOperationAction(ISD::FP_TO_UINT, VT) == TargetLowering::Custom) {
Chris Lattner8137c9e2006-01-28 05:07:51 +00004598 SDOperand Op;
4599 switch (getTypeAction(Node->getOperand(0).getValueType())) {
4600 case Expand: assert(0 && "cannot expand FP!");
4601 case Legal: Op = LegalizeOp(Node->getOperand(0)); break;
4602 case Promote: Op = PromoteOp (Node->getOperand(0)); break;
4603 }
4604
4605 Op = TLI.LowerOperation(DAG.getNode(ISD::FP_TO_UINT, VT, Op), DAG);
4606
4607 // Now that the custom expander is done, expand the result.
Chris Lattner07dffd62005-08-26 00:14:16 +00004608 if (Op.Val) {
4609 ExpandOp(Op, Lo, Hi);
4610 break;
4611 }
Chris Lattner80a3e942005-07-29 00:33:32 +00004612 }
Jeff Cohend29b6aa2005-07-30 18:33:25 +00004613
Chris Lattner4e6c7462005-01-08 19:27:05 +00004614 if (Node->getOperand(0).getValueType() == MVT::f32)
Chris Lattner77e77a62005-01-21 06:05:23 +00004615 Lo = ExpandLibCall("__fixunssfdi", Node, Hi);
Chris Lattner4e6c7462005-01-08 19:27:05 +00004616 else
Chris Lattner77e77a62005-01-21 06:05:23 +00004617 Lo = ExpandLibCall("__fixunsdfdi", Node, Hi);
Chris Lattner4e6c7462005-01-08 19:27:05 +00004618 break;
4619
Evan Cheng05a2d562006-01-09 18:31:59 +00004620 case ISD::SHL: {
Chris Lattner50ec8972005-08-31 19:01:53 +00004621 // If the target wants custom lowering, do so.
Chris Lattner348e93c2006-01-21 04:27:00 +00004622 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
Chris Lattner50ec8972005-08-31 19:01:53 +00004623 if (TLI.getOperationAction(ISD::SHL, VT) == TargetLowering::Custom) {
Chris Lattner8137c9e2006-01-28 05:07:51 +00004624 SDOperand Op = DAG.getNode(ISD::SHL, VT, Node->getOperand(0), ShiftAmt);
Chris Lattner50ec8972005-08-31 19:01:53 +00004625 Op = TLI.LowerOperation(Op, DAG);
4626 if (Op.Val) {
4627 // Now that the custom expander is done, expand the result, which is
4628 // still VT.
4629 ExpandOp(Op, Lo, Hi);
4630 break;
4631 }
4632 }
4633
Chris Lattner79980b02006-09-13 03:50:39 +00004634 // If ADDC/ADDE are supported and if the shift amount is a constant 1, emit
4635 // this X << 1 as X+X.
4636 if (ConstantSDNode *ShAmt = dyn_cast<ConstantSDNode>(ShiftAmt)) {
4637 if (ShAmt->getValue() == 1 && TLI.isOperationLegal(ISD::ADDC, NVT) &&
4638 TLI.isOperationLegal(ISD::ADDE, NVT)) {
4639 SDOperand LoOps[2], HiOps[3];
4640 ExpandOp(Node->getOperand(0), LoOps[0], HiOps[0]);
4641 SDVTList VTList = DAG.getVTList(LoOps[0].getValueType(), MVT::Flag);
4642 LoOps[1] = LoOps[0];
4643 Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2);
4644
4645 HiOps[1] = HiOps[0];
4646 HiOps[2] = Lo.getValue(1);
4647 Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3);
4648 break;
4649 }
4650 }
4651
Chris Lattnere34b3962005-01-19 04:19:40 +00004652 // If we can emit an efficient shift operation, do so now.
Chris Lattner348e93c2006-01-21 04:27:00 +00004653 if (ExpandShift(ISD::SHL, Node->getOperand(0), ShiftAmt, Lo, Hi))
Chris Lattnere34b3962005-01-19 04:19:40 +00004654 break;
Chris Lattner47599822005-04-02 03:38:53 +00004655
4656 // If this target supports SHL_PARTS, use it.
Evan Cheng05a2d562006-01-09 18:31:59 +00004657 TargetLowering::LegalizeAction Action =
4658 TLI.getOperationAction(ISD::SHL_PARTS, NVT);
4659 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
4660 Action == TargetLowering::Custom) {
Chris Lattner348e93c2006-01-21 04:27:00 +00004661 ExpandShiftParts(ISD::SHL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
Chris Lattner47599822005-04-02 03:38:53 +00004662 break;
4663 }
4664
Chris Lattnere34b3962005-01-19 04:19:40 +00004665 // Otherwise, emit a libcall.
Chris Lattner77e77a62005-01-21 06:05:23 +00004666 Lo = ExpandLibCall("__ashldi3", Node, Hi);
Chris Lattnere34b3962005-01-19 04:19:40 +00004667 break;
Evan Cheng05a2d562006-01-09 18:31:59 +00004668 }
Chris Lattnere34b3962005-01-19 04:19:40 +00004669
Evan Cheng05a2d562006-01-09 18:31:59 +00004670 case ISD::SRA: {
Chris Lattner50ec8972005-08-31 19:01:53 +00004671 // If the target wants custom lowering, do so.
Chris Lattner348e93c2006-01-21 04:27:00 +00004672 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
Chris Lattner50ec8972005-08-31 19:01:53 +00004673 if (TLI.getOperationAction(ISD::SRA, VT) == TargetLowering::Custom) {
Chris Lattner8137c9e2006-01-28 05:07:51 +00004674 SDOperand Op = DAG.getNode(ISD::SRA, VT, Node->getOperand(0), ShiftAmt);
Chris Lattner50ec8972005-08-31 19:01:53 +00004675 Op = TLI.LowerOperation(Op, DAG);
4676 if (Op.Val) {
4677 // Now that the custom expander is done, expand the result, which is
4678 // still VT.
4679 ExpandOp(Op, Lo, Hi);
4680 break;
4681 }
4682 }
4683
Chris Lattnere34b3962005-01-19 04:19:40 +00004684 // If we can emit an efficient shift operation, do so now.
Chris Lattner348e93c2006-01-21 04:27:00 +00004685 if (ExpandShift(ISD::SRA, Node->getOperand(0), ShiftAmt, Lo, Hi))
Chris Lattnere34b3962005-01-19 04:19:40 +00004686 break;
Chris Lattner47599822005-04-02 03:38:53 +00004687
4688 // If this target supports SRA_PARTS, use it.
Evan Cheng05a2d562006-01-09 18:31:59 +00004689 TargetLowering::LegalizeAction Action =
4690 TLI.getOperationAction(ISD::SRA_PARTS, NVT);
4691 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
4692 Action == TargetLowering::Custom) {
Chris Lattner348e93c2006-01-21 04:27:00 +00004693 ExpandShiftParts(ISD::SRA_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
Chris Lattner47599822005-04-02 03:38:53 +00004694 break;
4695 }
4696
Chris Lattnere34b3962005-01-19 04:19:40 +00004697 // Otherwise, emit a libcall.
Chris Lattner77e77a62005-01-21 06:05:23 +00004698 Lo = ExpandLibCall("__ashrdi3", Node, Hi);
Chris Lattnere34b3962005-01-19 04:19:40 +00004699 break;
Evan Cheng05a2d562006-01-09 18:31:59 +00004700 }
4701
4702 case ISD::SRL: {
Chris Lattner50ec8972005-08-31 19:01:53 +00004703 // If the target wants custom lowering, do so.
Chris Lattner348e93c2006-01-21 04:27:00 +00004704 SDOperand ShiftAmt = LegalizeOp(Node->getOperand(1));
Chris Lattner50ec8972005-08-31 19:01:53 +00004705 if (TLI.getOperationAction(ISD::SRL, VT) == TargetLowering::Custom) {
Chris Lattner8137c9e2006-01-28 05:07:51 +00004706 SDOperand Op = DAG.getNode(ISD::SRL, VT, Node->getOperand(0), ShiftAmt);
Chris Lattner50ec8972005-08-31 19:01:53 +00004707 Op = TLI.LowerOperation(Op, DAG);
4708 if (Op.Val) {
4709 // Now that the custom expander is done, expand the result, which is
4710 // still VT.
4711 ExpandOp(Op, Lo, Hi);
4712 break;
4713 }
4714 }
4715
Chris Lattnere34b3962005-01-19 04:19:40 +00004716 // If we can emit an efficient shift operation, do so now.
Chris Lattner348e93c2006-01-21 04:27:00 +00004717 if (ExpandShift(ISD::SRL, Node->getOperand(0), ShiftAmt, Lo, Hi))
Chris Lattnere34b3962005-01-19 04:19:40 +00004718 break;
Chris Lattner47599822005-04-02 03:38:53 +00004719
4720 // If this target supports SRL_PARTS, use it.
Evan Cheng05a2d562006-01-09 18:31:59 +00004721 TargetLowering::LegalizeAction Action =
4722 TLI.getOperationAction(ISD::SRL_PARTS, NVT);
4723 if ((Action == TargetLowering::Legal && TLI.isTypeLegal(NVT)) ||
4724 Action == TargetLowering::Custom) {
Chris Lattner348e93c2006-01-21 04:27:00 +00004725 ExpandShiftParts(ISD::SRL_PARTS, Node->getOperand(0), ShiftAmt, Lo, Hi);
Chris Lattner47599822005-04-02 03:38:53 +00004726 break;
4727 }
4728
Chris Lattnere34b3962005-01-19 04:19:40 +00004729 // Otherwise, emit a libcall.
Chris Lattner77e77a62005-01-21 06:05:23 +00004730 Lo = ExpandLibCall("__lshrdi3", Node, Hi);
Chris Lattnere34b3962005-01-19 04:19:40 +00004731 break;
Evan Cheng05a2d562006-01-09 18:31:59 +00004732 }
Chris Lattnere34b3962005-01-19 04:19:40 +00004733
Misha Brukmanedf128a2005-04-21 22:36:52 +00004734 case ISD::ADD:
Chris Lattner8137c9e2006-01-28 05:07:51 +00004735 case ISD::SUB: {
4736 // If the target wants to custom expand this, let them.
4737 if (TLI.getOperationAction(Node->getOpcode(), VT) ==
4738 TargetLowering::Custom) {
4739 Op = TLI.LowerOperation(Op, DAG);
4740 if (Op.Val) {
4741 ExpandOp(Op, Lo, Hi);
4742 break;
4743 }
4744 }
4745
4746 // Expand the subcomponents.
4747 SDOperand LHSL, LHSH, RHSL, RHSH;
4748 ExpandOp(Node->getOperand(0), LHSL, LHSH);
4749 ExpandOp(Node->getOperand(1), RHSL, RHSH);
Chris Lattner79980b02006-09-13 03:50:39 +00004750 SDVTList VTList = DAG.getVTList(LHSL.getValueType(), MVT::Flag);
4751 SDOperand LoOps[2], HiOps[3];
Chris Lattnerbd564bf2006-08-08 02:23:42 +00004752 LoOps[0] = LHSL;
4753 LoOps[1] = RHSL;
4754 HiOps[0] = LHSH;
4755 HiOps[1] = RHSH;
Nate Begeman551bf3f2006-02-17 05:43:56 +00004756 if (Node->getOpcode() == ISD::ADD) {
Chris Lattner79980b02006-09-13 03:50:39 +00004757 Lo = DAG.getNode(ISD::ADDC, VTList, LoOps, 2);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00004758 HiOps[2] = Lo.getValue(1);
Chris Lattner79980b02006-09-13 03:50:39 +00004759 Hi = DAG.getNode(ISD::ADDE, VTList, HiOps, 3);
Nate Begeman551bf3f2006-02-17 05:43:56 +00004760 } else {
Chris Lattner79980b02006-09-13 03:50:39 +00004761 Lo = DAG.getNode(ISD::SUBC, VTList, LoOps, 2);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00004762 HiOps[2] = Lo.getValue(1);
Chris Lattner79980b02006-09-13 03:50:39 +00004763 Hi = DAG.getNode(ISD::SUBE, VTList, HiOps, 3);
Nate Begeman551bf3f2006-02-17 05:43:56 +00004764 }
Chris Lattner84f67882005-01-20 18:52:28 +00004765 break;
Chris Lattner8137c9e2006-01-28 05:07:51 +00004766 }
Nate Begemanc7c16572005-04-11 03:01:51 +00004767 case ISD::MUL: {
Chris Lattner7d7bffe2006-09-16 00:09:24 +00004768 // If the target wants to custom expand this, let them.
4769 if (TLI.getOperationAction(ISD::MUL, VT) == TargetLowering::Custom) {
Chris Lattner8829dc82006-09-16 05:08:34 +00004770 SDOperand New = TLI.LowerOperation(Op, DAG);
4771 if (New.Val) {
4772 ExpandOp(New, Lo, Hi);
Chris Lattner7d7bffe2006-09-16 00:09:24 +00004773 break;
4774 }
4775 }
4776
Evan Cheng3f4fd0f2006-09-01 18:17:58 +00004777 bool HasMULHS = TLI.isOperationLegal(ISD::MULHS, NVT);
4778 bool HasMULHU = TLI.isOperationLegal(ISD::MULHU, NVT);
4779 bool UseLibCall = true;
4780 if (HasMULHS || HasMULHU) {
Nate Begemanc7c16572005-04-11 03:01:51 +00004781 SDOperand LL, LH, RL, RH;
4782 ExpandOp(Node->getOperand(0), LL, LH);
4783 ExpandOp(Node->getOperand(1), RL, RH);
Nate Begeman56eb8682005-08-30 02:44:00 +00004784 unsigned SH = MVT::getSizeInBits(RH.getValueType())-1;
4785 // MULHS implicitly sign extends its inputs. Check to see if ExpandOp
4786 // extended the sign bit of the low half through the upper half, and if so
4787 // emit a MULHS instead of the alternate sequence that is valid for any
4788 // i64 x i64 multiply.
Evan Cheng3f4fd0f2006-09-01 18:17:58 +00004789 if (HasMULHS &&
Nate Begeman56eb8682005-08-30 02:44:00 +00004790 // is RH an extension of the sign bit of RL?
4791 RH.getOpcode() == ISD::SRA && RH.getOperand(0) == RL &&
4792 RH.getOperand(1).getOpcode() == ISD::Constant &&
4793 cast<ConstantSDNode>(RH.getOperand(1))->getValue() == SH &&
4794 // is LH an extension of the sign bit of LL?
4795 LH.getOpcode() == ISD::SRA && LH.getOperand(0) == LL &&
4796 LH.getOperand(1).getOpcode() == ISD::Constant &&
4797 cast<ConstantSDNode>(LH.getOperand(1))->getValue() == SH) {
Chris Lattnera89654b2006-09-16 00:21:44 +00004798 // FIXME: Move this to the dag combiner.
4799
4800 // Low part:
4801 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
4802 // High part:
Nate Begeman56eb8682005-08-30 02:44:00 +00004803 Hi = DAG.getNode(ISD::MULHS, NVT, LL, RL);
Chris Lattnera89654b2006-09-16 00:21:44 +00004804 break;
Evan Cheng3f4fd0f2006-09-01 18:17:58 +00004805 } else if (HasMULHU) {
Chris Lattnera89654b2006-09-16 00:21:44 +00004806 // Low part:
4807 Lo = DAG.getNode(ISD::MUL, NVT, LL, RL);
4808
4809 // High part:
Nate Begeman56eb8682005-08-30 02:44:00 +00004810 Hi = DAG.getNode(ISD::MULHU, NVT, LL, RL);
4811 RH = DAG.getNode(ISD::MUL, NVT, LL, RH);
4812 LH = DAG.getNode(ISD::MUL, NVT, LH, RL);
4813 Hi = DAG.getNode(ISD::ADD, NVT, Hi, RH);
4814 Hi = DAG.getNode(ISD::ADD, NVT, Hi, LH);
Chris Lattnera89654b2006-09-16 00:21:44 +00004815 break;
Nate Begeman56eb8682005-08-30 02:44:00 +00004816 }
Nate Begemanc7c16572005-04-11 03:01:51 +00004817 }
Evan Cheng3f4fd0f2006-09-01 18:17:58 +00004818
Chris Lattnera89654b2006-09-16 00:21:44 +00004819 Lo = ExpandLibCall("__muldi3" , Node, Hi);
Nate Begemanc7c16572005-04-11 03:01:51 +00004820 break;
4821 }
Chris Lattner77e77a62005-01-21 06:05:23 +00004822 case ISD::SDIV: Lo = ExpandLibCall("__divdi3" , Node, Hi); break;
4823 case ISD::UDIV: Lo = ExpandLibCall("__udivdi3", Node, Hi); break;
4824 case ISD::SREM: Lo = ExpandLibCall("__moddi3" , Node, Hi); break;
4825 case ISD::UREM: Lo = ExpandLibCall("__umoddi3", Node, Hi); break;
Chris Lattner3e928bb2005-01-07 07:47:09 +00004826 }
4827
Chris Lattner83397362005-12-21 18:02:52 +00004828 // Make sure the resultant values have been legalized themselves, unless this
4829 // is a type that requires multi-step expansion.
4830 if (getTypeAction(NVT) != Expand && NVT != MVT::isVoid) {
4831 Lo = LegalizeOp(Lo);
4832 Hi = LegalizeOp(Hi);
4833 }
Evan Cheng05a2d562006-01-09 18:31:59 +00004834
4835 // Remember in a map if the values will be reused later.
4836 bool isNew =
4837 ExpandedNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
4838 assert(isNew && "Value already expanded?!?");
Chris Lattner3e928bb2005-01-07 07:47:09 +00004839}
4840
Chris Lattnerc7029802006-03-18 01:44:44 +00004841/// SplitVectorOp - Given an operand of MVT::Vector type, break it down into
4842/// two smaller values of MVT::Vector type.
4843void SelectionDAGLegalize::SplitVectorOp(SDOperand Op, SDOperand &Lo,
4844 SDOperand &Hi) {
4845 assert(Op.getValueType() == MVT::Vector && "Cannot split non-vector type!");
4846 SDNode *Node = Op.Val;
4847 unsigned NumElements = cast<ConstantSDNode>(*(Node->op_end()-2))->getValue();
4848 assert(NumElements > 1 && "Cannot split a single element vector!");
4849 unsigned NewNumElts = NumElements/2;
4850 SDOperand NewNumEltsNode = DAG.getConstant(NewNumElts, MVT::i32);
4851 SDOperand TypeNode = *(Node->op_end()-1);
4852
4853 // See if we already split it.
4854 std::map<SDOperand, std::pair<SDOperand, SDOperand> >::iterator I
4855 = SplitNodes.find(Op);
4856 if (I != SplitNodes.end()) {
4857 Lo = I->second.first;
4858 Hi = I->second.second;
4859 return;
4860 }
4861
4862 switch (Node->getOpcode()) {
Jim Laskeye37fe9b2006-07-11 17:58:07 +00004863 default:
4864#ifndef NDEBUG
4865 Node->dump();
4866#endif
4867 assert(0 && "Unhandled operation in SplitVectorOp!");
Chris Lattnerb2827b02006-03-19 00:52:58 +00004868 case ISD::VBUILD_VECTOR: {
Chris Lattnerbd564bf2006-08-08 02:23:42 +00004869 SmallVector<SDOperand, 8> LoOps(Node->op_begin(),
4870 Node->op_begin()+NewNumElts);
Chris Lattnerc7029802006-03-18 01:44:44 +00004871 LoOps.push_back(NewNumEltsNode);
4872 LoOps.push_back(TypeNode);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00004873 Lo = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &LoOps[0], LoOps.size());
Chris Lattnerc7029802006-03-18 01:44:44 +00004874
Chris Lattnerbd564bf2006-08-08 02:23:42 +00004875 SmallVector<SDOperand, 8> HiOps(Node->op_begin()+NewNumElts,
4876 Node->op_end()-2);
Chris Lattnerc7029802006-03-18 01:44:44 +00004877 HiOps.push_back(NewNumEltsNode);
4878 HiOps.push_back(TypeNode);
Chris Lattnerbd564bf2006-08-08 02:23:42 +00004879 Hi = DAG.getNode(ISD::VBUILD_VECTOR, MVT::Vector, &HiOps[0], HiOps.size());
Chris Lattnerc7029802006-03-18 01:44:44 +00004880 break;
4881 }
4882 case ISD::VADD:
4883 case ISD::VSUB:
4884 case ISD::VMUL:
4885 case ISD::VSDIV:
4886 case ISD::VUDIV:
4887 case ISD::VAND:
4888 case ISD::VOR:
4889 case ISD::VXOR: {
4890 SDOperand LL, LH, RL, RH;
4891 SplitVectorOp(Node->getOperand(0), LL, LH);
4892 SplitVectorOp(Node->getOperand(1), RL, RH);
4893
4894 Lo = DAG.getNode(Node->getOpcode(), MVT::Vector, LL, RL,
4895 NewNumEltsNode, TypeNode);
4896 Hi = DAG.getNode(Node->getOpcode(), MVT::Vector, LH, RH,
4897 NewNumEltsNode, TypeNode);
4898 break;
4899 }
4900 case ISD::VLOAD: {
4901 SDOperand Ch = Node->getOperand(0); // Legalize the chain.
4902 SDOperand Ptr = Node->getOperand(1); // Legalize the pointer.
4903 MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT();
4904
4905 Lo = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2));
4906 unsigned IncrementSize = NewNumElts * MVT::getSizeInBits(EVT)/8;
4907 Ptr = DAG.getNode(ISD::ADD, Ptr.getValueType(), Ptr,
4908 getIntPtrConstant(IncrementSize));
4909 // FIXME: This creates a bogus srcvalue!
4910 Hi = DAG.getVecLoad(NewNumElts, EVT, Ch, Ptr, Node->getOperand(2));
4911
4912 // Build a factor node to remember that this load is independent of the
4913 // other one.
4914 SDOperand TF = DAG.getNode(ISD::TokenFactor, MVT::Other, Lo.getValue(1),
4915 Hi.getValue(1));
4916
4917 // Remember that we legalized the chain.
4918 AddLegalizedOperand(Op.getValue(1), LegalizeOp(TF));
Chris Lattnerc7029802006-03-18 01:44:44 +00004919 break;
4920 }
Chris Lattner7692eb42006-03-23 21:16:34 +00004921 case ISD::VBIT_CONVERT: {
4922 // We know the result is a vector. The input may be either a vector or a
4923 // scalar value.
4924 if (Op.getOperand(0).getValueType() != MVT::Vector) {
4925 // Lower to a store/load. FIXME: this could be improved probably.
4926 SDOperand Ptr = CreateStackTemporary(Op.getOperand(0).getValueType());
4927
4928 SDOperand St = DAG.getNode(ISD::STORE, MVT::Other, DAG.getEntryNode(),
4929 Op.getOperand(0), Ptr, DAG.getSrcValue(0));
4930 MVT::ValueType EVT = cast<VTSDNode>(TypeNode)->getVT();
4931 St = DAG.getVecLoad(NumElements, EVT, St, Ptr, DAG.getSrcValue(0));
4932 SplitVectorOp(St, Lo, Hi);
4933 } else {
4934 // If the input is a vector type, we have to either scalarize it, pack it
4935 // or convert it based on whether the input vector type is legal.
4936 SDNode *InVal = Node->getOperand(0).Val;
4937 unsigned NumElems =
4938 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
4939 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
4940
4941 // If the input is from a single element vector, scalarize the vector,
4942 // then treat like a scalar.
4943 if (NumElems == 1) {
4944 SDOperand Scalar = PackVectorOp(Op.getOperand(0), EVT);
4945 Scalar = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Scalar,
4946 Op.getOperand(1), Op.getOperand(2));
4947 SplitVectorOp(Scalar, Lo, Hi);
4948 } else {
4949 // Split the input vector.
4950 SplitVectorOp(Op.getOperand(0), Lo, Hi);
4951
4952 // Convert each of the pieces now.
4953 Lo = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Lo,
4954 NewNumEltsNode, TypeNode);
4955 Hi = DAG.getNode(ISD::VBIT_CONVERT, MVT::Vector, Hi,
4956 NewNumEltsNode, TypeNode);
4957 }
4958 break;
4959 }
4960 }
Chris Lattnerc7029802006-03-18 01:44:44 +00004961 }
4962
4963 // Remember in a map if the values will be reused later.
4964 bool isNew =
4965 SplitNodes.insert(std::make_pair(Op, std::make_pair(Lo, Hi))).second;
4966 assert(isNew && "Value already expanded?!?");
4967}
4968
4969
4970/// PackVectorOp - Given an operand of MVT::Vector type, convert it into the
4971/// equivalent operation that returns a scalar (e.g. F32) or packed value
4972/// (e.g. MVT::V4F32). When this is called, we know that PackedVT is the right
4973/// type for the result.
4974SDOperand SelectionDAGLegalize::PackVectorOp(SDOperand Op,
4975 MVT::ValueType NewVT) {
4976 assert(Op.getValueType() == MVT::Vector && "Bad PackVectorOp invocation!");
4977 SDNode *Node = Op.Val;
4978
4979 // See if we already packed it.
4980 std::map<SDOperand, SDOperand>::iterator I = PackedNodes.find(Op);
4981 if (I != PackedNodes.end()) return I->second;
4982
4983 SDOperand Result;
4984 switch (Node->getOpcode()) {
Chris Lattner2332b9f2006-03-19 01:17:20 +00004985 default:
Jim Laskeye37fe9b2006-07-11 17:58:07 +00004986#ifndef NDEBUG
Chris Lattner2332b9f2006-03-19 01:17:20 +00004987 Node->dump(); std::cerr << "\n";
Jim Laskeye37fe9b2006-07-11 17:58:07 +00004988#endif
Chris Lattner2332b9f2006-03-19 01:17:20 +00004989 assert(0 && "Unknown vector operation in PackVectorOp!");
Chris Lattnerc7029802006-03-18 01:44:44 +00004990 case ISD::VADD:
4991 case ISD::VSUB:
4992 case ISD::VMUL:
4993 case ISD::VSDIV:
4994 case ISD::VUDIV:
4995 case ISD::VAND:
4996 case ISD::VOR:
4997 case ISD::VXOR:
4998 Result = DAG.getNode(getScalarizedOpcode(Node->getOpcode(), NewVT),
4999 NewVT,
5000 PackVectorOp(Node->getOperand(0), NewVT),
5001 PackVectorOp(Node->getOperand(1), NewVT));
5002 break;
5003 case ISD::VLOAD: {
Chris Lattner4794a6b2006-03-19 00:07:49 +00005004 SDOperand Ch = LegalizeOp(Node->getOperand(0)); // Legalize the chain.
5005 SDOperand Ptr = LegalizeOp(Node->getOperand(1)); // Legalize the pointer.
Chris Lattnerc7029802006-03-18 01:44:44 +00005006
Chris Lattner4794a6b2006-03-19 00:07:49 +00005007 Result = DAG.getLoad(NewVT, Ch, Ptr, Node->getOperand(2));
Chris Lattnerc7029802006-03-18 01:44:44 +00005008
5009 // Remember that we legalized the chain.
5010 AddLegalizedOperand(Op.getValue(1), LegalizeOp(Result.getValue(1)));
5011 break;
5012 }
Chris Lattnerb2827b02006-03-19 00:52:58 +00005013 case ISD::VBUILD_VECTOR:
Chris Lattner70c2a612006-03-31 02:06:56 +00005014 if (Node->getOperand(0).getValueType() == NewVT) {
Chris Lattnerb2827b02006-03-19 00:52:58 +00005015 // Returning a scalar?
Chris Lattnerc7029802006-03-18 01:44:44 +00005016 Result = Node->getOperand(0);
5017 } else {
Chris Lattnerb2827b02006-03-19 00:52:58 +00005018 // Returning a BUILD_VECTOR?
Chris Lattner17614ea2006-04-08 05:34:25 +00005019
5020 // If all elements of the build_vector are undefs, return an undef.
5021 bool AllUndef = true;
5022 for (unsigned i = 0, e = Node->getNumOperands()-2; i != e; ++i)
5023 if (Node->getOperand(i).getOpcode() != ISD::UNDEF) {
5024 AllUndef = false;
5025 break;
5026 }
5027 if (AllUndef) {
5028 Result = DAG.getNode(ISD::UNDEF, NewVT);
5029 } else {
Chris Lattnerbd564bf2006-08-08 02:23:42 +00005030 Result = DAG.getNode(ISD::BUILD_VECTOR, NewVT, Node->op_begin(),
5031 Node->getNumOperands()-2);
Chris Lattner17614ea2006-04-08 05:34:25 +00005032 }
Chris Lattnerc7029802006-03-18 01:44:44 +00005033 }
5034 break;
Chris Lattner2332b9f2006-03-19 01:17:20 +00005035 case ISD::VINSERT_VECTOR_ELT:
5036 if (!MVT::isVector(NewVT)) {
5037 // Returning a scalar? Must be the inserted element.
5038 Result = Node->getOperand(1);
5039 } else {
5040 Result = DAG.getNode(ISD::INSERT_VECTOR_ELT, NewVT,
5041 PackVectorOp(Node->getOperand(0), NewVT),
5042 Node->getOperand(1), Node->getOperand(2));
5043 }
5044 break;
Chris Lattner5b2316e2006-03-28 20:24:43 +00005045 case ISD::VVECTOR_SHUFFLE:
5046 if (!MVT::isVector(NewVT)) {
5047 // Returning a scalar? Figure out if it is the LHS or RHS and return it.
5048 SDOperand EltNum = Node->getOperand(2).getOperand(0);
5049 if (cast<ConstantSDNode>(EltNum)->getValue())
5050 Result = PackVectorOp(Node->getOperand(1), NewVT);
5051 else
5052 Result = PackVectorOp(Node->getOperand(0), NewVT);
5053 } else {
5054 // Otherwise, return a VECTOR_SHUFFLE node. First convert the index
5055 // vector from a VBUILD_VECTOR to a BUILD_VECTOR.
5056 std::vector<SDOperand> BuildVecIdx(Node->getOperand(2).Val->op_begin(),
5057 Node->getOperand(2).Val->op_end()-2);
5058 MVT::ValueType BVT = MVT::getIntVectorWithNumElements(BuildVecIdx.size());
Chris Lattnerbd564bf2006-08-08 02:23:42 +00005059 SDOperand BV = DAG.getNode(ISD::BUILD_VECTOR, BVT,
5060 Node->getOperand(2).Val->op_begin(),
5061 Node->getOperand(2).Val->getNumOperands()-2);
Chris Lattner5b2316e2006-03-28 20:24:43 +00005062
5063 Result = DAG.getNode(ISD::VECTOR_SHUFFLE, NewVT,
5064 PackVectorOp(Node->getOperand(0), NewVT),
5065 PackVectorOp(Node->getOperand(1), NewVT), BV);
5066 }
5067 break;
Chris Lattnere25ca692006-03-22 20:09:35 +00005068 case ISD::VBIT_CONVERT:
5069 if (Op.getOperand(0).getValueType() != MVT::Vector)
5070 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT, Op.getOperand(0));
5071 else {
5072 // If the input is a vector type, we have to either scalarize it, pack it
5073 // or convert it based on whether the input vector type is legal.
5074 SDNode *InVal = Node->getOperand(0).Val;
5075 unsigned NumElems =
5076 cast<ConstantSDNode>(*(InVal->op_end()-2))->getValue();
5077 MVT::ValueType EVT = cast<VTSDNode>(*(InVal->op_end()-1))->getVT();
5078
5079 // Figure out if there is a Packed type corresponding to this Vector
5080 // type. If so, convert to the packed type.
5081 MVT::ValueType TVT = MVT::getVectorType(EVT, NumElems);
5082 if (TVT != MVT::Other && TLI.isTypeLegal(TVT)) {
5083 // Turn this into a bit convert of the packed input.
5084 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT,
5085 PackVectorOp(Node->getOperand(0), TVT));
5086 break;
5087 } else if (NumElems == 1) {
5088 // Turn this into a bit convert of the scalar input.
5089 Result = DAG.getNode(ISD::BIT_CONVERT, NewVT,
5090 PackVectorOp(Node->getOperand(0), EVT));
5091 break;
5092 } else {
5093 // FIXME: UNIMP!
5094 assert(0 && "Cast from unsupported vector type not implemented yet!");
5095 }
5096 }
Evan Chengdb3c6262006-04-10 18:54:36 +00005097 break;
Chris Lattnerb22e35a2006-04-08 22:22:57 +00005098 case ISD::VSELECT:
5099 Result = DAG.getNode(ISD::SELECT, NewVT, Op.getOperand(0),
5100 PackVectorOp(Op.getOperand(1), NewVT),
5101 PackVectorOp(Op.getOperand(2), NewVT));
5102 break;
Chris Lattnerc7029802006-03-18 01:44:44 +00005103 }
5104
5105 if (TLI.isTypeLegal(NewVT))
5106 Result = LegalizeOp(Result);
5107 bool isNew = PackedNodes.insert(std::make_pair(Op, Result)).second;
5108 assert(isNew && "Value already packed?");
5109 return Result;
5110}
5111
Chris Lattner3e928bb2005-01-07 07:47:09 +00005112
5113// SelectionDAG::Legalize - This is the entry point for the file.
5114//
Chris Lattner9c32d3b2005-01-23 04:42:50 +00005115void SelectionDAG::Legalize() {
Chris Lattner5e46a192006-04-02 03:07:27 +00005116 if (ViewLegalizeDAGs) viewGraph();
5117
Chris Lattner3e928bb2005-01-07 07:47:09 +00005118 /// run - This is the main entry point to this class.
5119 ///
Chris Lattner456a93a2006-01-28 07:39:30 +00005120 SelectionDAGLegalize(*this).LegalizeDAG();
Chris Lattner3e928bb2005-01-07 07:47:09 +00005121}
5122