1 //===-- LegalizeTypes.h - Definition of the DAG Type Legalizer class ------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file defines the DAGTypeLegalizer class. This is a private interface
11 // shared between the code that implements the SelectionDAG::LegalizeTypes
14 //===----------------------------------------------------------------------===//
16 #ifndef SELECTIONDAG_LEGALIZETYPES_H
17 #define SELECTIONDAG_LEGALIZETYPES_H
19 #define DEBUG_TYPE "legalize-types"
20 #include "llvm/CodeGen/SelectionDAG.h"
21 #include "llvm/Target/TargetLowering.h"
22 #include "llvm/ADT/DenseMap.h"
23 #include "llvm/Support/Compiler.h"
24 #include "llvm/Support/Debug.h"
28 //===----------------------------------------------------------------------===//
29 /// DAGTypeLegalizer - This takes an arbitrary SelectionDAG as input and hacks
30 /// on it until only value types the target machine can handle are left. This
31 /// involves promoting small sizes to large sizes or splitting up large values
32 /// into small values.
34 class VISIBILITY_HIDDEN DAGTypeLegalizer {
38 // NodeIdFlags - This pass uses the NodeId on the SDNodes to hold information
39 // about the state of the node. The enum has all the values.
41 /// ReadyToProcess - All operands have been processed, so this node is ready
45 /// NewNode - This is a new node that was created in the process of
46 /// legalizing some other node.
49 /// Processed - This is a node that has already been processed.
52 // 1+ - This is a node which has this many unlegalized operands.
56 Legal, // The target natively supports this type.
57 PromoteInteger, // Replace this integer type with a larger one.
58 ExpandInteger, // Split this integer type into two of half the size.
59 SoftenFloat, // Convert this float type to a same size integer type.
60 ExpandFloat, // Split this float type into two of half the size.
61 ScalarizeVector, // Replace this one-element vector with its element type.
62 SplitVector // This vector type should be split into smaller vectors.
65 /// ValueTypeActions - This is a bitvector that contains two bits for each
66 /// simple value type, where the two bits correspond to the LegalizeAction
67 /// enum from TargetLowering. This can be queried with "getTypeAction(VT)".
68 TargetLowering::ValueTypeActionImpl ValueTypeActions;
70 /// getTypeAction - Return how we should legalize values of this type, either
71 /// it is already legal, or we need to promote it to a larger integer type, or
72 /// we need to expand it into multiple registers of a smaller integer type, or
73 /// we need to split a vector type into smaller vector types, or we need to
74 /// convert it to a different type of the same size.
75 LegalizeAction getTypeAction(MVT VT) const {
76 switch (ValueTypeActions.getTypeAction(VT)) {
78 assert(false && "Unknown legalize action!");
79 case TargetLowering::Legal:
81 case TargetLowering::Promote:
83 // 1) On integers, it means to promote type (e.g., i8 to i32)
84 // 2) For vectors, it means try to widen (e.g., v3i32 to v4i32)
86 return PromoteInteger;
89 // TODO: move widen code to LegalizeType
90 if (VT.getVectorNumElements() == 1) {
91 return ScalarizeVector;
96 case TargetLowering::Expand:
98 // 1) split scalar in half, 2) convert a float to an integer,
99 // 3) scalarize a single-element vector, 4) split a vector in two.
100 if (!VT.isVector()) {
102 return ExpandInteger;
103 else if (VT.getSizeInBits() ==
104 TLI.getTypeToTransformTo(VT).getSizeInBits())
108 } else if (VT.getVectorNumElements() == 1) {
109 return ScalarizeVector;
116 /// isTypeLegal - Return true if this type is legal on this target.
117 bool isTypeLegal(MVT VT) const {
118 return ValueTypeActions.getTypeAction(VT) == TargetLowering::Legal;
121 /// IgnoreNodeResults - Pretend all of this node's results are legal.
122 bool IgnoreNodeResults(SDNode *N) const {
123 return N->getOpcode() == ISD::TargetConstant;
126 /// PromotedIntegers - For integer nodes that are below legal width, this map
127 /// indicates what promoted value to use.
128 DenseMap<SDValue, SDValue> PromotedIntegers;
130 /// ExpandedIntegers - For integer nodes that need to be expanded this map
131 /// indicates which operands are the expanded version of the input.
132 DenseMap<SDValue, std::pair<SDValue, SDValue> > ExpandedIntegers;
134 /// SoftenedFloats - For floating point nodes converted to integers of
135 /// the same size, this map indicates the converted value to use.
136 DenseMap<SDValue, SDValue> SoftenedFloats;
138 /// ExpandedFloats - For float nodes that need to be expanded this map
139 /// indicates which operands are the expanded version of the input.
140 DenseMap<SDValue, std::pair<SDValue, SDValue> > ExpandedFloats;
142 /// ScalarizedVectors - For nodes that are <1 x ty>, this map indicates the
143 /// scalar value of type 'ty' to use.
144 DenseMap<SDValue, SDValue> ScalarizedVectors;
146 /// SplitVectors - For nodes that need to be split this map indicates
147 /// which operands are the expanded version of the input.
148 DenseMap<SDValue, std::pair<SDValue, SDValue> > SplitVectors;
150 /// ReplacedValues - For values that have been replaced with another,
151 /// indicates the replacement value to use.
152 DenseMap<SDValue, SDValue> ReplacedValues;
154 /// Worklist - This defines a worklist of nodes to process. In order to be
155 /// pushed onto this worklist, all operands of a node must have already been
157 SmallVector<SDNode*, 128> Worklist;
160 explicit DAGTypeLegalizer(SelectionDAG &dag)
161 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
162 ValueTypeActions(TLI.getValueTypeActions()) {
163 assert(MVT::LAST_VALUETYPE <= 32 &&
164 "Too many value types for ValueTypeActions to hold!");
169 /// ReanalyzeNode - Recompute the NodeId and correct processed operands
170 /// for the specified node, adding it to the worklist if ready.
171 void ReanalyzeNode(SDNode *N) {
172 N->setNodeId(NewNode);
174 // The node may have changed but we don't care.
177 void NoteDeletion(SDNode *Old, SDNode *New) {
180 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i)
181 ReplacedValues[SDValue(Old, i)] = SDValue(New, i);
185 SDNode *AnalyzeNewNode(SDNode *N);
186 void AnalyzeNewValue(SDValue &Val);
188 void ReplaceValueWith(SDValue From, SDValue To);
189 void ReplaceNodeWith(SDNode *From, SDNode *To);
191 void RemapValue(SDValue &N);
192 void ExpungeNode(SDNode *N);
195 SDValue CreateStackStoreLoad(SDValue Op, MVT DestVT);
196 SDValue MakeLibCall(RTLIB::Libcall LC, MVT RetVT,
197 const SDValue *Ops, unsigned NumOps, bool isSigned);
199 SDValue BitConvertToInteger(SDValue Op);
200 SDValue JoinIntegers(SDValue Lo, SDValue Hi);
201 void SplitInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
202 void SplitInteger(SDValue Op, MVT LoVT, MVT HiVT,
203 SDValue &Lo, SDValue &Hi);
205 SDValue GetVectorElementPointer(SDValue VecPtr, MVT EltVT, SDValue Index);
207 //===--------------------------------------------------------------------===//
208 // Integer Promotion Support: LegalizeIntegerTypes.cpp
209 //===--------------------------------------------------------------------===//
211 SDValue GetPromotedInteger(SDValue Op) {
212 SDValue &PromotedOp = PromotedIntegers[Op];
213 RemapValue(PromotedOp);
214 assert(PromotedOp.getNode() && "Operand wasn't promoted?");
217 void SetPromotedInteger(SDValue Op, SDValue Result);
219 /// ZExtPromotedInteger - Get a promoted operand and zero extend it to the
221 SDValue ZExtPromotedInteger(SDValue Op) {
222 MVT OldVT = Op.getValueType();
223 Op = GetPromotedInteger(Op);
224 return DAG.getZeroExtendInReg(Op, OldVT);
227 // Integer Result Promotion.
228 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
229 SDValue PromoteIntRes_AssertSext(SDNode *N);
230 SDValue PromoteIntRes_AssertZext(SDNode *N);
231 SDValue PromoteIntRes_Atomic1(AtomicSDNode *N);
232 SDValue PromoteIntRes_Atomic2(AtomicSDNode *N);
233 SDValue PromoteIntRes_BIT_CONVERT(SDNode *N);
234 SDValue PromoteIntRes_BSWAP(SDNode *N);
235 SDValue PromoteIntRes_BUILD_PAIR(SDNode *N);
236 SDValue PromoteIntRes_Constant(SDNode *N);
237 SDValue PromoteIntRes_CTLZ(SDNode *N);
238 SDValue PromoteIntRes_CTPOP(SDNode *N);
239 SDValue PromoteIntRes_CTTZ(SDNode *N);
240 SDValue PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N);
241 SDValue PromoteIntRes_FP_TO_XINT(SDNode *N);
242 SDValue PromoteIntRes_INT_EXTEND(SDNode *N);
243 SDValue PromoteIntRes_LOAD(LoadSDNode *N);
244 SDValue PromoteIntRes_SDIV(SDNode *N);
245 SDValue PromoteIntRes_SELECT (SDNode *N);
246 SDValue PromoteIntRes_SELECT_CC(SDNode *N);
247 SDValue PromoteIntRes_SETCC(SDNode *N);
248 SDValue PromoteIntRes_SHL(SDNode *N);
249 SDValue PromoteIntRes_SimpleIntBinOp(SDNode *N);
250 SDValue PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N);
251 SDValue PromoteIntRes_SRA(SDNode *N);
252 SDValue PromoteIntRes_SRL(SDNode *N);
253 SDValue PromoteIntRes_TRUNCATE(SDNode *N);
254 SDValue PromoteIntRes_UDIV(SDNode *N);
255 SDValue PromoteIntRes_UNDEF(SDNode *N);
256 SDValue PromoteIntRes_VAARG(SDNode *N);
258 // Integer Operand Promotion.
259 bool PromoteIntegerOperand(SDNode *N, unsigned OperandNo);
260 SDValue PromoteIntOp_ANY_EXTEND(SDNode *N);
261 SDValue PromoteIntOp_BUILD_PAIR(SDNode *N);
262 SDValue PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo);
263 SDValue PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo);
264 SDValue PromoteIntOp_BUILD_VECTOR(SDNode *N);
265 SDValue PromoteIntOp_FP_EXTEND(SDNode *N);
266 SDValue PromoteIntOp_FP_ROUND(SDNode *N);
267 SDValue PromoteIntOp_INT_TO_FP(SDNode *N);
268 SDValue PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N, unsigned OpNo);
269 SDValue PromoteIntOp_MEMBARRIER(SDNode *N);
270 SDValue PromoteIntOp_SELECT(SDNode *N, unsigned OpNo);
271 SDValue PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo);
272 SDValue PromoteIntOp_SETCC(SDNode *N, unsigned OpNo);
273 SDValue PromoteIntOp_SIGN_EXTEND(SDNode *N);
274 SDValue PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo);
275 SDValue PromoteIntOp_TRUNCATE(SDNode *N);
276 SDValue PromoteIntOp_ZERO_EXTEND(SDNode *N);
278 void PromoteSetCCOperands(SDValue &LHS,SDValue &RHS, ISD::CondCode Code);
280 //===--------------------------------------------------------------------===//
281 // Integer Expansion Support: LegalizeIntegerTypes.cpp
282 //===--------------------------------------------------------------------===//
284 void GetExpandedInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
285 void SetExpandedInteger(SDValue Op, SDValue Lo, SDValue Hi);
287 // Integer Result Expansion.
288 void ExpandIntegerResult(SDNode *N, unsigned ResNo);
289 void ExpandIntRes_ANY_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
290 void ExpandIntRes_AssertSext (SDNode *N, SDValue &Lo, SDValue &Hi);
291 void ExpandIntRes_AssertZext (SDNode *N, SDValue &Lo, SDValue &Hi);
292 void ExpandIntRes_Constant (SDNode *N, SDValue &Lo, SDValue &Hi);
293 void ExpandIntRes_CTLZ (SDNode *N, SDValue &Lo, SDValue &Hi);
294 void ExpandIntRes_CTPOP (SDNode *N, SDValue &Lo, SDValue &Hi);
295 void ExpandIntRes_CTTZ (SDNode *N, SDValue &Lo, SDValue &Hi);
296 void ExpandIntRes_LOAD (LoadSDNode *N, SDValue &Lo, SDValue &Hi);
297 void ExpandIntRes_SIGN_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
298 void ExpandIntRes_SIGN_EXTEND_INREG (SDNode *N, SDValue &Lo, SDValue &Hi);
299 void ExpandIntRes_TRUNCATE (SDNode *N, SDValue &Lo, SDValue &Hi);
300 void ExpandIntRes_ZERO_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
301 void ExpandIntRes_FP_TO_SINT (SDNode *N, SDValue &Lo, SDValue &Hi);
302 void ExpandIntRes_FP_TO_UINT (SDNode *N, SDValue &Lo, SDValue &Hi);
304 void ExpandIntRes_Logical (SDNode *N, SDValue &Lo, SDValue &Hi);
305 void ExpandIntRes_ADDSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
306 void ExpandIntRes_ADDSUBC (SDNode *N, SDValue &Lo, SDValue &Hi);
307 void ExpandIntRes_ADDSUBE (SDNode *N, SDValue &Lo, SDValue &Hi);
308 void ExpandIntRes_BSWAP (SDNode *N, SDValue &Lo, SDValue &Hi);
309 void ExpandIntRes_MUL (SDNode *N, SDValue &Lo, SDValue &Hi);
310 void ExpandIntRes_SDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
311 void ExpandIntRes_SREM (SDNode *N, SDValue &Lo, SDValue &Hi);
312 void ExpandIntRes_UDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
313 void ExpandIntRes_UREM (SDNode *N, SDValue &Lo, SDValue &Hi);
314 void ExpandIntRes_Shift (SDNode *N, SDValue &Lo, SDValue &Hi);
316 void ExpandShiftByConstant(SDNode *N, unsigned Amt,
317 SDValue &Lo, SDValue &Hi);
318 bool ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi);
320 // Integer Operand Expansion.
321 bool ExpandIntegerOperand(SDNode *N, unsigned OperandNo);
322 SDValue ExpandIntOp_BIT_CONVERT(SDNode *N);
323 SDValue ExpandIntOp_BR_CC(SDNode *N);
324 SDValue ExpandIntOp_BUILD_VECTOR(SDNode *N);
325 SDValue ExpandIntOp_EXTRACT_ELEMENT(SDNode *N);
326 SDValue ExpandIntOp_SELECT_CC(SDNode *N);
327 SDValue ExpandIntOp_SETCC(SDNode *N);
328 SDValue ExpandIntOp_SINT_TO_FP(SDNode *N);
329 SDValue ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo);
330 SDValue ExpandIntOp_TRUNCATE(SDNode *N);
331 SDValue ExpandIntOp_UINT_TO_FP(SDNode *N);
333 void IntegerExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
334 ISD::CondCode &CCCode);
336 //===--------------------------------------------------------------------===//
337 // Float to Integer Conversion Support: LegalizeFloatTypes.cpp
338 //===--------------------------------------------------------------------===//
340 SDValue GetSoftenedFloat(SDValue Op) {
341 SDValue &SoftenedOp = SoftenedFloats[Op];
342 RemapValue(SoftenedOp);
343 assert(SoftenedOp.getNode() && "Operand wasn't converted to integer?");
346 void SetSoftenedFloat(SDValue Op, SDValue Result);
348 // Result Float to Integer Conversion.
349 void SoftenFloatResult(SDNode *N, unsigned OpNo);
350 SDValue SoftenFloatRes_BIT_CONVERT(SDNode *N);
351 SDValue SoftenFloatRes_BUILD_PAIR(SDNode *N);
352 SDValue SoftenFloatRes_ConstantFP(ConstantFPSDNode *N);
353 SDValue SoftenFloatRes_FABS(SDNode *N);
354 SDValue SoftenFloatRes_FADD(SDNode *N);
355 SDValue SoftenFloatRes_FCOPYSIGN(SDNode *N);
356 SDValue SoftenFloatRes_FDIV(SDNode *N);
357 SDValue SoftenFloatRes_FMUL(SDNode *N);
358 SDValue SoftenFloatRes_FP_EXTEND(SDNode *N);
359 SDValue SoftenFloatRes_FP_ROUND(SDNode *N);
360 SDValue SoftenFloatRes_FPOW(SDNode *N);
361 SDValue SoftenFloatRes_FPOWI(SDNode *N);
362 SDValue SoftenFloatRes_FSUB(SDNode *N);
363 SDValue SoftenFloatRes_LOAD(SDNode *N);
364 SDValue SoftenFloatRes_SELECT(SDNode *N);
365 SDValue SoftenFloatRes_SELECT_CC(SDNode *N);
366 SDValue SoftenFloatRes_SINT_TO_FP(SDNode *N);
367 SDValue SoftenFloatRes_UINT_TO_FP(SDNode *N);
369 // Operand Float to Integer Conversion.
370 bool SoftenFloatOperand(SDNode *N, unsigned OpNo);
371 SDValue SoftenFloatOp_BIT_CONVERT(SDNode *N);
372 SDValue SoftenFloatOp_BR_CC(SDNode *N);
373 SDValue SoftenFloatOp_FP_ROUND(SDNode *N);
374 SDValue SoftenFloatOp_FP_TO_SINT(SDNode *N);
375 SDValue SoftenFloatOp_FP_TO_UINT(SDNode *N);
376 SDValue SoftenFloatOp_SELECT_CC(SDNode *N);
377 SDValue SoftenFloatOp_SETCC(SDNode *N);
378 SDValue SoftenFloatOp_STORE(SDNode *N, unsigned OpNo);
380 void SoftenSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
381 ISD::CondCode &CCCode);
383 //===--------------------------------------------------------------------===//
384 // Float Expansion Support: LegalizeFloatTypes.cpp
385 //===--------------------------------------------------------------------===//
387 void GetExpandedFloat(SDValue Op, SDValue &Lo, SDValue &Hi);
388 void SetExpandedFloat(SDValue Op, SDValue Lo, SDValue Hi);
390 // Float Result Expansion.
391 void ExpandFloatResult(SDNode *N, unsigned ResNo);
392 void ExpandFloatRes_ConstantFP(SDNode *N, SDValue &Lo, SDValue &Hi);
393 void ExpandFloatRes_FABS (SDNode *N, SDValue &Lo, SDValue &Hi);
394 void ExpandFloatRes_FADD (SDNode *N, SDValue &Lo, SDValue &Hi);
395 void ExpandFloatRes_FDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
396 void ExpandFloatRes_FMUL (SDNode *N, SDValue &Lo, SDValue &Hi);
397 void ExpandFloatRes_FNEG (SDNode *N, SDValue &Lo, SDValue &Hi);
398 void ExpandFloatRes_FP_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
399 void ExpandFloatRes_FSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
400 void ExpandFloatRes_LOAD (SDNode *N, SDValue &Lo, SDValue &Hi);
401 void ExpandFloatRes_XINT_TO_FP(SDNode *N, SDValue &Lo, SDValue &Hi);
403 // Float Operand Expansion.
404 bool ExpandFloatOperand(SDNode *N, unsigned OperandNo);
405 SDValue ExpandFloatOp_BR_CC(SDNode *N);
406 SDValue ExpandFloatOp_FP_ROUND(SDNode *N);
407 SDValue ExpandFloatOp_FP_TO_SINT(SDNode *N);
408 SDValue ExpandFloatOp_FP_TO_UINT(SDNode *N);
409 SDValue ExpandFloatOp_SELECT_CC(SDNode *N);
410 SDValue ExpandFloatOp_SETCC(SDNode *N);
411 SDValue ExpandFloatOp_STORE(SDNode *N, unsigned OpNo);
413 void FloatExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
414 ISD::CondCode &CCCode);
416 //===--------------------------------------------------------------------===//
417 // Scalarization Support: LegalizeVectorTypes.cpp
418 //===--------------------------------------------------------------------===//
420 SDValue GetScalarizedVector(SDValue Op) {
421 SDValue &ScalarizedOp = ScalarizedVectors[Op];
422 RemapValue(ScalarizedOp);
423 assert(ScalarizedOp.getNode() && "Operand wasn't scalarized?");
426 void SetScalarizedVector(SDValue Op, SDValue Result);
428 // Vector Result Scalarization: <1 x ty> -> ty.
429 void ScalarizeVectorResult(SDNode *N, unsigned OpNo);
430 SDValue ScalarizeVecRes_BinOp(SDNode *N);
431 SDValue ScalarizeVecRes_UnaryOp(SDNode *N);
433 SDValue ScalarizeVecRes_BIT_CONVERT(SDNode *N);
434 SDValue ScalarizeVecRes_EXTRACT_SUBVECTOR(SDNode *N);
435 SDValue ScalarizeVecRes_FPOWI(SDNode *N);
436 SDValue ScalarizeVecRes_INSERT_VECTOR_ELT(SDNode *N);
437 SDValue ScalarizeVecRes_LOAD(LoadSDNode *N);
438 SDValue ScalarizeVecRes_SELECT(SDNode *N);
439 SDValue ScalarizeVecRes_UNDEF(SDNode *N);
440 SDValue ScalarizeVecRes_VECTOR_SHUFFLE(SDNode *N);
441 SDValue ScalarizeVecRes_VSETCC(SDNode *N);
443 // Vector Operand Scalarization: <1 x ty> -> ty.
444 bool ScalarizeVectorOperand(SDNode *N, unsigned OpNo);
445 SDValue ScalarizeVecOp_BIT_CONVERT(SDNode *N);
446 SDValue ScalarizeVecOp_CONCAT_VECTORS(SDNode *N);
447 SDValue ScalarizeVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
448 SDValue ScalarizeVecOp_STORE(StoreSDNode *N, unsigned OpNo);
450 //===--------------------------------------------------------------------===//
451 // Vector Splitting Support: LegalizeVectorTypes.cpp
452 //===--------------------------------------------------------------------===//
454 void GetSplitVector(SDValue Op, SDValue &Lo, SDValue &Hi);
455 void SetSplitVector(SDValue Op, SDValue Lo, SDValue Hi);
457 // Vector Result Splitting: <128 x ty> -> 2 x <64 x ty>.
458 void SplitVectorResult(SDNode *N, unsigned OpNo);
459 void SplitVecRes_BinOp(SDNode *N, SDValue &Lo, SDValue &Hi);
460 void SplitVecRes_UnaryOp(SDNode *N, SDValue &Lo, SDValue &Hi);
462 void SplitVecRes_BIT_CONVERT(SDNode *N, SDValue &Lo, SDValue &Hi);
463 void SplitVecRes_BUILD_PAIR(SDNode *N, SDValue &Lo, SDValue &Hi);
464 void SplitVecRes_BUILD_VECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
465 void SplitVecRes_CONCAT_VECTORS(SDNode *N, SDValue &Lo, SDValue &Hi);
466 void SplitVecRes_FPOWI(SDNode *N, SDValue &Lo, SDValue &Hi);
467 void SplitVecRes_INSERT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
468 void SplitVecRes_LOAD(LoadSDNode *N, SDValue &Lo, SDValue &Hi);
469 void SplitVecRes_UNDEF(SDNode *N, SDValue &Lo, SDValue &Hi);
470 void SplitVecRes_VECTOR_SHUFFLE(SDNode *N, SDValue &Lo, SDValue &Hi);
471 void SplitVecRes_VSETCC(SDNode *N, SDValue &Lo, SDValue &Hi);
473 // Vector Operand Splitting: <128 x ty> -> 2 x <64 x ty>.
474 bool SplitVectorOperand(SDNode *N, unsigned OpNo);
475 SDValue SplitVecOp_UnaryOp(SDNode *N);
477 SDValue SplitVecOp_BIT_CONVERT(SDNode *N);
478 SDValue SplitVecOp_EXTRACT_SUBVECTOR(SDNode *N);
479 SDValue SplitVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
480 SDValue SplitVecOp_STORE(StoreSDNode *N, unsigned OpNo);
481 SDValue SplitVecOp_VECTOR_SHUFFLE(SDNode *N, unsigned OpNo);
483 //===--------------------------------------------------------------------===//
484 // Generic Splitting: LegalizeTypesGeneric.cpp
485 //===--------------------------------------------------------------------===//
487 // Legalization methods which only use that the illegal type is split into two
488 // not necessarily identical types. As such they can be used for splitting
489 // vectors and expanding integers and floats.
491 void GetSplitOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
492 if (Op.getValueType().isVector())
493 GetSplitVector(Op, Lo, Hi);
494 else if (Op.getValueType().isInteger())
495 GetExpandedInteger(Op, Lo, Hi);
497 GetExpandedFloat(Op, Lo, Hi);
500 /// GetSplitDestVTs - Compute the VTs needed for the low/hi parts of a type
501 /// which is split (or expanded) into two not necessarily identical pieces.
502 void GetSplitDestVTs(MVT InVT, MVT &LoVT, MVT &HiVT);
504 // Generic Result Splitting.
505 void SplitRes_MERGE_VALUES(SDNode *N, SDValue &Lo, SDValue &Hi);
506 void SplitRes_SELECT (SDNode *N, SDValue &Lo, SDValue &Hi);
507 void SplitRes_SELECT_CC (SDNode *N, SDValue &Lo, SDValue &Hi);
508 void SplitRes_UNDEF (SDNode *N, SDValue &Lo, SDValue &Hi);
510 //===--------------------------------------------------------------------===//
511 // Generic Expansion: LegalizeTypesGeneric.cpp
512 //===--------------------------------------------------------------------===//
514 // Legalization methods which only use that the illegal type is split into two
515 // identical types of half the size, and that the Lo/Hi part is stored first
516 // in memory on little/big-endian machines, followed by the Hi/Lo part. As
517 // such they can be used for expanding integers and floats.
519 void GetExpandedOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
520 if (Op.getValueType().isInteger())
521 GetExpandedInteger(Op, Lo, Hi);
523 GetExpandedFloat(Op, Lo, Hi);
526 // Generic Result Expansion.
527 void ExpandRes_BIT_CONVERT (SDNode *N, SDValue &Lo, SDValue &Hi);
528 void ExpandRes_BUILD_PAIR (SDNode *N, SDValue &Lo, SDValue &Hi);
529 void ExpandRes_EXTRACT_ELEMENT (SDNode *N, SDValue &Lo, SDValue &Hi);
530 void ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
531 void ExpandRes_NormalLoad (SDNode *N, SDValue &Lo, SDValue &Hi);
532 void ExpandRes_VAARG (SDNode *N, SDValue &Lo, SDValue &Hi);
534 // Generic Operand Expansion.
535 SDValue ExpandOp_BIT_CONVERT (SDNode *N);
536 SDValue ExpandOp_BUILD_VECTOR (SDNode *N);
537 SDValue ExpandOp_EXTRACT_ELEMENT(SDNode *N);
538 SDValue ExpandOp_NormalStore (SDNode *N, unsigned OpNo);
542 } // end namespace llvm.