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
30 /// hacks on it until the target machine can handle it. This involves
31 /// eliminating value sizes the machine cannot handle (promoting small sizes to
32 /// large sizes or splitting up large values into small values) as well as
33 /// eliminating operations the machine cannot handle.
35 /// This code also does a small amount of optimization and recognition of idioms
36 /// as part of its processing. For example, if a target does not support a
37 /// 'setcc' instruction efficiently, but does support 'brcc' instruction, this
38 /// will attempt merge setcc and brc instructions into brcc's.
40 class VISIBILITY_HIDDEN DAGTypeLegalizer {
44 // NodeIDFlags - This pass uses the NodeID on the SDNodes to hold information
45 // about the state of the node. The enum has all the values.
47 /// ReadyToProcess - All operands have been processed, so this node is ready
51 /// NewNode - This is a new node that was created in the process of
52 /// legalizing some other node.
55 /// Processed - This is a node that has already been processed.
58 // 1+ - This is a node which has this many unlegalized operands.
62 Legal, // The target natively supports this type.
63 PromoteInteger, // Replace this integer type with a larger one.
64 ExpandInteger, // Split this integer type into two of half the size.
65 SoftenFloat, // Convert this float type to a same size integer type.
66 ExpandFloat, // Split this float type into two of half the size.
67 Scalarize, // Replace this one-element vector type with its element type.
68 Split // This vector type should be split into smaller vectors.
71 /// ValueTypeActions - This is a bitvector that contains two bits for each
72 /// simple value type, where the two bits correspond to the LegalizeAction
73 /// enum from TargetLowering. This can be queried with "getTypeAction(VT)".
74 TargetLowering::ValueTypeActionImpl ValueTypeActions;
76 /// getTypeAction - Return how we should legalize values of this type, either
77 /// it is already legal, or we need to promote it to a larger integer type, or
78 /// we need to expand it into multiple registers of a smaller integer type, or
79 /// we need to scalarize a one-element vector type into the element type, or
80 /// we need to split a vector type into smaller vector types.
81 LegalizeAction getTypeAction(MVT VT) const {
82 switch (ValueTypeActions.getTypeAction(VT)) {
84 assert(false && "Unknown legalize action!");
85 case TargetLowering::Legal:
87 case TargetLowering::Promote:
88 return PromoteInteger;
89 case TargetLowering::Expand:
91 // 1) split scalar in half, 2) convert a float to an integer,
92 // 3) scalarize a single-element vector, 4) split a vector in two.
96 else if (VT.getSizeInBits() ==
97 TLI.getTypeToTransformTo(VT).getSizeInBits())
101 } else if (VT.getVectorNumElements() == 1) {
109 /// isTypeLegal - Return true if this type is legal on this target.
110 bool isTypeLegal(MVT VT) const {
111 return ValueTypeActions.getTypeAction(VT) == TargetLowering::Legal;
114 /// PromotedIntegers - For integer nodes that are below legal width, this map
115 /// indicates what promoted value to use.
116 DenseMap<SDOperand, SDOperand> PromotedIntegers;
118 /// ExpandedIntegers - For integer nodes that need to be expanded this map
119 /// indicates which operands are the expanded version of the input.
120 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedIntegers;
122 /// SoftenedFloats - For floating point nodes converted to integers of
123 /// the same size, this map indicates the converted value to use.
124 DenseMap<SDOperand, SDOperand> SoftenedFloats;
126 /// ExpandedFloats - For float nodes that need to be expanded this map
127 /// indicates which operands are the expanded version of the input.
128 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedFloats;
130 /// ScalarizedVectors - For nodes that are <1 x ty>, this map indicates the
131 /// scalar value of type 'ty' to use.
132 DenseMap<SDOperand, SDOperand> ScalarizedVectors;
134 /// SplitVectors - For nodes that need to be split this map indicates
135 /// which operands are the expanded version of the input.
136 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > SplitVectors;
138 /// ReplacedNodes - For nodes that have been replaced with another,
139 /// indicates the replacement node to use.
140 DenseMap<SDOperand, SDOperand> ReplacedNodes;
142 /// Worklist - This defines a worklist of nodes to process. In order to be
143 /// pushed onto this worklist, all operands of a node must have already been
145 SmallVector<SDNode*, 128> Worklist;
148 explicit DAGTypeLegalizer(SelectionDAG &dag)
149 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
150 ValueTypeActions(TLI.getValueTypeActions()) {
151 assert(MVT::LAST_VALUETYPE <= 32 &&
152 "Too many value types for ValueTypeActions to hold!");
157 /// ReanalyzeNode - Recompute the NodeID and correct processed operands
158 /// for the specified node, adding it to the worklist if ready.
159 void ReanalyzeNode(SDNode *N) {
160 N->setNodeId(NewNode);
164 void NoteReplacement(SDOperand From, SDOperand To) {
167 ReplacedNodes[From] = To;
171 void AnalyzeNewNode(SDNode *&N);
173 void ReplaceValueWith(SDOperand From, SDOperand To);
174 void ReplaceNodeWith(SDNode *From, SDNode *To);
176 void RemapNode(SDOperand &N);
177 void ExpungeNode(SDOperand N);
180 SDOperand CreateStackStoreLoad(SDOperand Op, MVT DestVT);
181 SDOperand MakeLibCall(RTLIB::Libcall LC, MVT RetVT,
182 const SDOperand *Ops, unsigned NumOps, bool isSigned);
184 SDOperand BitConvertToInteger(SDOperand Op);
185 SDOperand JoinIntegers(SDOperand Lo, SDOperand Hi);
186 void SplitInteger(SDOperand Op, SDOperand &Lo, SDOperand &Hi);
187 void SplitInteger(SDOperand Op, MVT LoVT, MVT HiVT,
188 SDOperand &Lo, SDOperand &Hi);
190 SDOperand GetVectorElementPointer(SDOperand VecPtr, MVT EltVT,
193 //===--------------------------------------------------------------------===//
194 // Integer Promotion Support: LegalizeIntegerTypes.cpp
195 //===--------------------------------------------------------------------===//
197 SDOperand GetPromotedInteger(SDOperand Op) {
198 SDOperand &PromotedOp = PromotedIntegers[Op];
199 RemapNode(PromotedOp);
200 assert(PromotedOp.Val && "Operand wasn't promoted?");
203 void SetPromotedInteger(SDOperand Op, SDOperand Result);
205 /// ZExtPromotedInteger - Get a promoted operand and zero extend it to the
207 SDOperand ZExtPromotedInteger(SDOperand Op) {
208 MVT OldVT = Op.getValueType();
209 Op = GetPromotedInteger(Op);
210 return DAG.getZeroExtendInReg(Op, OldVT);
213 // Integer Result Promotion.
214 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
215 SDOperand PromoteIntRes_BIT_CONVERT(SDNode *N);
216 SDOperand PromoteIntRes_BUILD_PAIR(SDNode *N);
217 SDOperand PromoteIntRes_Constant(SDNode *N);
218 SDOperand PromoteIntRes_CTLZ(SDNode *N);
219 SDOperand PromoteIntRes_CTPOP(SDNode *N);
220 SDOperand PromoteIntRes_CTTZ(SDNode *N);
221 SDOperand PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N);
222 SDOperand PromoteIntRes_FP_ROUND(SDNode *N);
223 SDOperand PromoteIntRes_FP_TO_XINT(SDNode *N);
224 SDOperand PromoteIntRes_INT_EXTEND(SDNode *N);
225 SDOperand PromoteIntRes_LOAD(LoadSDNode *N);
226 SDOperand PromoteIntRes_SDIV(SDNode *N);
227 SDOperand PromoteIntRes_SELECT (SDNode *N);
228 SDOperand PromoteIntRes_SELECT_CC(SDNode *N);
229 SDOperand PromoteIntRes_SETCC(SDNode *N);
230 SDOperand PromoteIntRes_SHL(SDNode *N);
231 SDOperand PromoteIntRes_SimpleIntBinOp(SDNode *N);
232 SDOperand PromoteIntRes_SRA(SDNode *N);
233 SDOperand PromoteIntRes_SRL(SDNode *N);
234 SDOperand PromoteIntRes_TRUNCATE(SDNode *N);
235 SDOperand PromoteIntRes_UDIV(SDNode *N);
236 SDOperand PromoteIntRes_UNDEF(SDNode *N);
237 SDOperand PromoteIntRes_VAARG(SDNode *N);
239 // Integer Operand Promotion.
240 bool PromoteIntegerOperand(SDNode *N, unsigned OperandNo);
241 SDOperand PromoteIntOp_ANY_EXTEND(SDNode *N);
242 SDOperand PromoteIntOp_BUILD_PAIR(SDNode *N);
243 SDOperand PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo);
244 SDOperand PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo);
245 SDOperand PromoteIntOp_BUILD_VECTOR(SDNode *N);
246 SDOperand PromoteIntOp_FP_EXTEND(SDNode *N);
247 SDOperand PromoteIntOp_FP_ROUND(SDNode *N);
248 SDOperand PromoteIntOp_INT_TO_FP(SDNode *N);
249 SDOperand PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N, unsigned OpNo);
250 SDOperand PromoteIntOp_MEMBARRIER(SDNode *N);
251 SDOperand PromoteIntOp_SELECT(SDNode *N, unsigned OpNo);
252 SDOperand PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo);
253 SDOperand PromoteIntOp_SETCC(SDNode *N, unsigned OpNo);
254 SDOperand PromoteIntOp_SIGN_EXTEND(SDNode *N);
255 SDOperand PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo);
256 SDOperand PromoteIntOp_TRUNCATE(SDNode *N);
257 SDOperand PromoteIntOp_ZERO_EXTEND(SDNode *N);
259 void PromoteSetCCOperands(SDOperand &LHS,SDOperand &RHS, ISD::CondCode Code);
261 //===--------------------------------------------------------------------===//
262 // Integer Expansion Support: LegalizeIntegerTypes.cpp
263 //===--------------------------------------------------------------------===//
265 void GetExpandedInteger(SDOperand Op, SDOperand &Lo, SDOperand &Hi);
266 void SetExpandedInteger(SDOperand Op, SDOperand Lo, SDOperand Hi);
268 // Integer Result Expansion.
269 void ExpandIntegerResult(SDNode *N, unsigned ResNo);
270 void ExpandIntRes_ANY_EXTEND (SDNode *N, SDOperand &Lo, SDOperand &Hi);
271 void ExpandIntRes_AssertZext (SDNode *N, SDOperand &Lo, SDOperand &Hi);
272 void ExpandIntRes_Constant (SDNode *N, SDOperand &Lo, SDOperand &Hi);
273 void ExpandIntRes_CTLZ (SDNode *N, SDOperand &Lo, SDOperand &Hi);
274 void ExpandIntRes_CTPOP (SDNode *N, SDOperand &Lo, SDOperand &Hi);
275 void ExpandIntRes_CTTZ (SDNode *N, SDOperand &Lo, SDOperand &Hi);
276 void ExpandIntRes_LOAD (LoadSDNode *N, SDOperand &Lo, SDOperand &Hi);
277 void ExpandIntRes_SIGN_EXTEND (SDNode *N, SDOperand &Lo, SDOperand &Hi);
278 void ExpandIntRes_SIGN_EXTEND_INREG (SDNode *N, SDOperand &Lo, SDOperand &Hi);
279 void ExpandIntRes_TRUNCATE (SDNode *N, SDOperand &Lo, SDOperand &Hi);
280 void ExpandIntRes_ZERO_EXTEND (SDNode *N, SDOperand &Lo, SDOperand &Hi);
281 void ExpandIntRes_FP_TO_SINT (SDNode *N, SDOperand &Lo, SDOperand &Hi);
282 void ExpandIntRes_FP_TO_UINT (SDNode *N, SDOperand &Lo, SDOperand &Hi);
284 void ExpandIntRes_Logical (SDNode *N, SDOperand &Lo, SDOperand &Hi);
285 void ExpandIntRes_ADDSUB (SDNode *N, SDOperand &Lo, SDOperand &Hi);
286 void ExpandIntRes_ADDSUBC (SDNode *N, SDOperand &Lo, SDOperand &Hi);
287 void ExpandIntRes_ADDSUBE (SDNode *N, SDOperand &Lo, SDOperand &Hi);
288 void ExpandIntRes_BSWAP (SDNode *N, SDOperand &Lo, SDOperand &Hi);
289 void ExpandIntRes_MUL (SDNode *N, SDOperand &Lo, SDOperand &Hi);
290 void ExpandIntRes_SDIV (SDNode *N, SDOperand &Lo, SDOperand &Hi);
291 void ExpandIntRes_SREM (SDNode *N, SDOperand &Lo, SDOperand &Hi);
292 void ExpandIntRes_UDIV (SDNode *N, SDOperand &Lo, SDOperand &Hi);
293 void ExpandIntRes_UREM (SDNode *N, SDOperand &Lo, SDOperand &Hi);
294 void ExpandIntRes_Shift (SDNode *N, SDOperand &Lo, SDOperand &Hi);
296 void ExpandShiftByConstant(SDNode *N, unsigned Amt,
297 SDOperand &Lo, SDOperand &Hi);
298 bool ExpandShiftWithKnownAmountBit(SDNode *N, SDOperand &Lo, SDOperand &Hi);
300 // Integer Operand Expansion.
301 bool ExpandIntegerOperand(SDNode *N, unsigned OperandNo);
302 SDOperand ExpandIntOp_BIT_CONVERT(SDNode *N);
303 SDOperand ExpandIntOp_BR_CC(SDNode *N);
304 SDOperand ExpandIntOp_BUILD_VECTOR(SDNode *N);
305 SDOperand ExpandIntOp_EXTRACT_ELEMENT(SDNode *N);
306 SDOperand ExpandIntOp_SELECT_CC(SDNode *N);
307 SDOperand ExpandIntOp_SETCC(SDNode *N);
308 SDOperand ExpandIntOp_SINT_TO_FP(SDOperand Source, MVT DestTy);
309 SDOperand ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo);
310 SDOperand ExpandIntOp_TRUNCATE(SDNode *N);
311 SDOperand ExpandIntOp_UINT_TO_FP(SDOperand Source, MVT DestTy);
313 void IntegerExpandSetCCOperands(SDOperand &NewLHS, SDOperand &NewRHS,
314 ISD::CondCode &CCCode);
316 //===--------------------------------------------------------------------===//
317 // Float to Integer Conversion Support: LegalizeFloatTypes.cpp
318 //===--------------------------------------------------------------------===//
320 SDOperand GetSoftenedFloat(SDOperand Op) {
321 SDOperand &SoftenedOp = SoftenedFloats[Op];
322 RemapNode(SoftenedOp);
323 assert(SoftenedOp.Val && "Operand wasn't converted to integer?");
326 void SetSoftenedFloat(SDOperand Op, SDOperand Result);
328 // Result Float to Integer Conversion.
329 void SoftenFloatResult(SDNode *N, unsigned OpNo);
330 SDOperand SoftenFloatRes_BIT_CONVERT(SDNode *N);
331 SDOperand SoftenFloatRes_BUILD_PAIR(SDNode *N);
332 SDOperand SoftenFloatRes_ConstantFP(ConstantFPSDNode *N);
333 SDOperand SoftenFloatRes_FADD(SDNode *N);
334 SDOperand SoftenFloatRes_FCOPYSIGN(SDNode *N);
335 SDOperand SoftenFloatRes_FMUL(SDNode *N);
336 SDOperand SoftenFloatRes_FSUB(SDNode *N);
337 SDOperand SoftenFloatRes_LOAD(SDNode *N);
338 SDOperand SoftenFloatRes_XINT_TO_FP(SDNode *N);
340 // Operand Float to Integer Conversion.
341 bool SoftenFloatOperand(SDNode *N, unsigned OpNo);
342 SDOperand SoftenFloatOp_BIT_CONVERT(SDNode *N);
343 SDOperand SoftenFloatOp_BR_CC(SDNode *N);
344 SDOperand SoftenFloatOp_SELECT_CC(SDNode *N);
345 SDOperand SoftenFloatOp_SETCC(SDNode *N);
347 void SoftenSetCCOperands(SDOperand &NewLHS, SDOperand &NewRHS,
348 ISD::CondCode &CCCode);
350 //===--------------------------------------------------------------------===//
351 // Float Expansion Support: LegalizeFloatTypes.cpp
352 //===--------------------------------------------------------------------===//
354 void GetExpandedFloat(SDOperand Op, SDOperand &Lo, SDOperand &Hi);
355 void SetExpandedFloat(SDOperand Op, SDOperand Lo, SDOperand Hi);
357 // Float Result Expansion.
358 void ExpandFloatResult(SDNode *N, unsigned ResNo);
359 void ExpandFloatRes_ConstantFP(SDNode *N, SDOperand &Lo, SDOperand &Hi);
360 void ExpandFloatRes_FADD (SDNode *N, SDOperand &Lo, SDOperand &Hi);
361 void ExpandFloatRes_FDIV (SDNode *N, SDOperand &Lo, SDOperand &Hi);
362 void ExpandFloatRes_FMUL (SDNode *N, SDOperand &Lo, SDOperand &Hi);
363 void ExpandFloatRes_FSUB (SDNode *N, SDOperand &Lo, SDOperand &Hi);
364 void ExpandFloatRes_LOAD (SDNode *N, SDOperand &Lo, SDOperand &Hi);
365 void ExpandFloatRes_XINT_TO_FP(SDNode *N, SDOperand &Lo, SDOperand &Hi);
367 // Float Operand Expansion.
368 bool ExpandFloatOperand(SDNode *N, unsigned OperandNo);
369 SDOperand ExpandFloatOp_BR_CC(SDNode *N);
370 SDOperand ExpandFloatOp_FP_ROUND(SDNode *N);
371 SDOperand ExpandFloatOp_FP_TO_SINT(SDNode *N);
372 SDOperand ExpandFloatOp_FP_TO_UINT(SDNode *N);
373 SDOperand ExpandFloatOp_SELECT_CC(SDNode *N);
374 SDOperand ExpandFloatOp_SETCC(SDNode *N);
375 SDOperand ExpandFloatOp_STORE(SDNode *N, unsigned OpNo);
377 void FloatExpandSetCCOperands(SDOperand &NewLHS, SDOperand &NewRHS,
378 ISD::CondCode &CCCode);
380 //===--------------------------------------------------------------------===//
381 // Scalarization Support: LegalizeVectorTypes.cpp
382 //===--------------------------------------------------------------------===//
384 SDOperand GetScalarizedVector(SDOperand Op) {
385 SDOperand &ScalarizedOp = ScalarizedVectors[Op];
386 RemapNode(ScalarizedOp);
387 assert(ScalarizedOp.Val && "Operand wasn't scalarized?");
390 void SetScalarizedVector(SDOperand Op, SDOperand Result);
392 // Vector Result Scalarization: <1 x ty> -> ty.
393 void ScalarizeResult(SDNode *N, unsigned OpNo);
394 SDOperand ScalarizeVecRes_BinOp(SDNode *N);
395 SDOperand ScalarizeVecRes_UnaryOp(SDNode *N);
397 SDOperand ScalarizeVecRes_BIT_CONVERT(SDNode *N);
398 SDOperand ScalarizeVecRes_FPOWI(SDNode *N);
399 SDOperand ScalarizeVecRes_INSERT_VECTOR_ELT(SDNode *N);
400 SDOperand ScalarizeVecRes_LOAD(LoadSDNode *N);
401 SDOperand ScalarizeVecRes_SELECT(SDNode *N);
402 SDOperand ScalarizeVecRes_UNDEF(SDNode *N);
403 SDOperand ScalarizeVecRes_VECTOR_SHUFFLE(SDNode *N);
405 // Vector Operand Scalarization: <1 x ty> -> ty.
406 bool ScalarizeOperand(SDNode *N, unsigned OpNo);
407 SDOperand ScalarizeVecOp_BIT_CONVERT(SDNode *N);
408 SDOperand ScalarizeVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
409 SDOperand ScalarizeVecOp_STORE(StoreSDNode *N, unsigned OpNo);
411 //===--------------------------------------------------------------------===//
412 // Vector Splitting Support: LegalizeVectorTypes.cpp
413 //===--------------------------------------------------------------------===//
415 void GetSplitVector(SDOperand Op, SDOperand &Lo, SDOperand &Hi);
416 void SetSplitVector(SDOperand Op, SDOperand Lo, SDOperand Hi);
418 // Vector Result Splitting: <128 x ty> -> 2 x <64 x ty>.
419 void SplitResult(SDNode *N, unsigned OpNo);
421 void SplitVecRes_UNDEF(SDNode *N, SDOperand &Lo, SDOperand &Hi);
422 void SplitVecRes_LOAD(LoadSDNode *N, SDOperand &Lo, SDOperand &Hi);
423 void SplitVecRes_BUILD_PAIR(SDNode *N, SDOperand &Lo, SDOperand &Hi);
424 void SplitVecRes_INSERT_VECTOR_ELT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
425 void SplitVecRes_VECTOR_SHUFFLE(SDNode *N, SDOperand &Lo, SDOperand &Hi);
427 void SplitVecRes_BUILD_VECTOR(SDNode *N, SDOperand &Lo, SDOperand &Hi);
428 void SplitVecRes_CONCAT_VECTORS(SDNode *N, SDOperand &Lo, SDOperand &Hi);
429 void SplitVecRes_BIT_CONVERT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
430 void SplitVecRes_UnOp(SDNode *N, SDOperand &Lo, SDOperand &Hi);
431 void SplitVecRes_BinOp(SDNode *N, SDOperand &Lo, SDOperand &Hi);
432 void SplitVecRes_FPOWI(SDNode *N, SDOperand &Lo, SDOperand &Hi);
434 // Vector Operand Splitting: <128 x ty> -> 2 x <64 x ty>.
435 bool SplitOperand(SDNode *N, unsigned OpNo);
437 SDOperand SplitVecOp_BIT_CONVERT(SDNode *N);
438 SDOperand SplitVecOp_EXTRACT_SUBVECTOR(SDNode *N);
439 SDOperand SplitVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
440 SDOperand SplitVecOp_RET(SDNode *N, unsigned OpNo);
441 SDOperand SplitVecOp_STORE(StoreSDNode *N, unsigned OpNo);
442 SDOperand SplitVecOp_VECTOR_SHUFFLE(SDNode *N, unsigned OpNo);
444 //===--------------------------------------------------------------------===//
445 // Generic Splitting: LegalizeTypesGeneric.cpp
446 //===--------------------------------------------------------------------===//
448 // Legalization methods which only use that the illegal type is split into two
449 // not necessarily identical types. As such they can be used for splitting
450 // vectors and expanding integers and floats.
452 void GetSplitOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi) {
453 if (Op.getValueType().isVector())
454 GetSplitVector(Op, Lo, Hi);
455 else if (Op.getValueType().isInteger())
456 GetExpandedInteger(Op, Lo, Hi);
458 GetExpandedFloat(Op, Lo, Hi);
461 /// GetSplitDestVTs - Compute the VTs needed for the low/hi parts of a type
462 /// which is split (or expanded) into two not necessarily identical pieces.
463 void GetSplitDestVTs(MVT InVT, MVT &LoVT, MVT &HiVT);
465 // Generic Result Splitting.
466 void SplitRes_MERGE_VALUES(SDNode *N, SDOperand &Lo, SDOperand &Hi);
467 void SplitRes_SELECT (SDNode *N, SDOperand &Lo, SDOperand &Hi);
468 void SplitRes_SELECT_CC (SDNode *N, SDOperand &Lo, SDOperand &Hi);
469 void SplitRes_UNDEF (SDNode *N, SDOperand &Lo, SDOperand &Hi);
471 //===--------------------------------------------------------------------===//
472 // Generic Expansion: LegalizeTypesGeneric.cpp
473 //===--------------------------------------------------------------------===//
475 // Legalization methods which only use that the illegal type is split into two
476 // identical types of half the size, and that the Lo/Hi part is stored first
477 // in memory on little/big-endian machines, followed by the Hi/Lo part. As
478 // such they can be used for expanding integers and floats.
480 void GetExpandedOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi) {
481 if (Op.getValueType().isInteger())
482 GetExpandedInteger(Op, Lo, Hi);
484 GetExpandedFloat(Op, Lo, Hi);
487 // Generic Result Expansion.
488 void ExpandRes_BIT_CONVERT (SDNode *N, SDOperand &Lo, SDOperand &Hi);
489 void ExpandRes_BUILD_PAIR (SDNode *N, SDOperand &Lo, SDOperand &Hi);
490 void ExpandRes_EXTRACT_ELEMENT (SDNode *N, SDOperand &Lo, SDOperand &Hi);
491 void ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
492 void ExpandRes_NormalLoad (SDNode *N, SDOperand &Lo, SDOperand &Hi);
494 // Generic Operand Expansion.
495 SDOperand ExpandOp_BIT_CONVERT (SDNode *N);
496 SDOperand ExpandOp_BUILD_VECTOR (SDNode *N);
497 SDOperand ExpandOp_EXTRACT_ELEMENT(SDNode *N);
498 SDOperand ExpandOp_NormalStore (SDNode *N, unsigned OpNo);
502 } // end namespace llvm.