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, use the promote integer type (e.g., i8 to i32)
84 // 2) For vectors, use the widen vector type returned by the target
85 // (e.g., v3i32 to v4i32). If the type is the same as the original
86 // type, than expand the vector instead.
88 return PromoteInteger;
90 // TODO: move widen code to LegalizeType.
91 if (VT.getVectorNumElements() == 1) {
92 return ScalarizeVector;
97 case TargetLowering::Expand:
99 // 1) split scalar in half, 2) convert a float to an integer,
100 // 3) scalarize a single-element vector, 4) split a vector in two.
101 if (!VT.isVector()) {
103 return ExpandInteger;
104 else if (VT.getSizeInBits() ==
105 TLI.getTypeToTransformTo(VT).getSizeInBits())
109 } else if (VT.getVectorNumElements() == 1) {
110 return ScalarizeVector;
117 /// isTypeLegal - Return true if this type is legal on this target.
118 bool isTypeLegal(MVT VT) const {
119 return ValueTypeActions.getTypeAction(VT) == TargetLowering::Legal;
122 /// IgnoreNodeResults - Pretend all of this node's results are legal.
123 bool IgnoreNodeResults(SDNode *N) const {
124 return N->getOpcode() == ISD::TargetConstant;
127 /// PromotedIntegers - For integer nodes that are below legal width, this map
128 /// indicates what promoted value to use.
129 DenseMap<SDValue, SDValue> PromotedIntegers;
131 /// ExpandedIntegers - For integer nodes that need to be expanded this map
132 /// indicates which operands are the expanded version of the input.
133 DenseMap<SDValue, std::pair<SDValue, SDValue> > ExpandedIntegers;
135 /// SoftenedFloats - For floating point nodes converted to integers of
136 /// the same size, this map indicates the converted value to use.
137 DenseMap<SDValue, SDValue> SoftenedFloats;
139 /// ExpandedFloats - For float nodes that need to be expanded this map
140 /// indicates which operands are the expanded version of the input.
141 DenseMap<SDValue, std::pair<SDValue, SDValue> > ExpandedFloats;
143 /// ScalarizedVectors - For nodes that are <1 x ty>, this map indicates the
144 /// scalar value of type 'ty' to use.
145 DenseMap<SDValue, SDValue> ScalarizedVectors;
147 /// SplitVectors - For nodes that need to be split this map indicates
148 /// which operands are the expanded version of the input.
149 DenseMap<SDValue, std::pair<SDValue, SDValue> > SplitVectors;
151 /// ReplacedValues - For values that have been replaced with another,
152 /// indicates the replacement value to use.
153 DenseMap<SDValue, SDValue> ReplacedValues;
155 /// Worklist - This defines a worklist of nodes to process. In order to be
156 /// pushed onto this worklist, all operands of a node must have already been
158 SmallVector<SDNode*, 128> Worklist;
161 explicit DAGTypeLegalizer(SelectionDAG &dag)
162 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
163 ValueTypeActions(TLI.getValueTypeActions()) {
164 assert(MVT::LAST_VALUETYPE <= 32 &&
165 "Too many value types for ValueTypeActions to hold!");
170 /// ReanalyzeNode - Recompute the NodeId and correct processed operands
171 /// for the specified node, adding it to the worklist if ready.
172 void ReanalyzeNode(SDNode *N) {
173 N->setNodeId(NewNode);
175 // The node may have changed but we don't care.
178 void NoteDeletion(SDNode *Old, SDNode *New) {
181 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i)
182 ReplacedValues[SDValue(Old, i)] = SDValue(New, i);
186 SDNode *AnalyzeNewNode(SDNode *N);
187 void AnalyzeNewValue(SDValue &Val);
189 void ReplaceValueWith(SDValue From, SDValue To);
190 void ReplaceNodeWith(SDNode *From, SDNode *To);
192 void RemapValue(SDValue &N);
193 void ExpungeNode(SDNode *N);
196 SDValue CreateStackStoreLoad(SDValue Op, MVT DestVT);
197 SDValue MakeLibCall(RTLIB::Libcall LC, MVT RetVT,
198 const SDValue *Ops, unsigned NumOps, bool isSigned);
199 SDValue LibCallify(RTLIB::Libcall LC, SDNode *N, bool isSigned);
201 SDValue BitConvertToInteger(SDValue Op);
202 SDValue JoinIntegers(SDValue Lo, SDValue Hi);
203 void SplitInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
204 void SplitInteger(SDValue Op, MVT LoVT, MVT HiVT,
205 SDValue &Lo, SDValue &Hi);
207 SDValue GetVectorElementPointer(SDValue VecPtr, MVT EltVT, SDValue Index);
209 //===--------------------------------------------------------------------===//
210 // Integer Promotion Support: LegalizeIntegerTypes.cpp
211 //===--------------------------------------------------------------------===//
213 SDValue GetPromotedInteger(SDValue Op) {
214 SDValue &PromotedOp = PromotedIntegers[Op];
215 RemapValue(PromotedOp);
216 assert(PromotedOp.getNode() && "Operand wasn't promoted?");
219 void SetPromotedInteger(SDValue Op, SDValue Result);
221 /// ZExtPromotedInteger - Get a promoted operand and zero extend it to the
223 SDValue ZExtPromotedInteger(SDValue Op) {
224 MVT OldVT = Op.getValueType();
225 Op = GetPromotedInteger(Op);
226 return DAG.getZeroExtendInReg(Op, OldVT);
229 // Integer Result Promotion.
230 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
231 SDValue PromoteIntRes_AssertSext(SDNode *N);
232 SDValue PromoteIntRes_AssertZext(SDNode *N);
233 SDValue PromoteIntRes_Atomic1(AtomicSDNode *N);
234 SDValue PromoteIntRes_Atomic2(AtomicSDNode *N);
235 SDValue PromoteIntRes_BIT_CONVERT(SDNode *N);
236 SDValue PromoteIntRes_BSWAP(SDNode *N);
237 SDValue PromoteIntRes_BUILD_PAIR(SDNode *N);
238 SDValue PromoteIntRes_Constant(SDNode *N);
239 SDValue PromoteIntRes_CTLZ(SDNode *N);
240 SDValue PromoteIntRes_CTPOP(SDNode *N);
241 SDValue PromoteIntRes_CTTZ(SDNode *N);
242 SDValue PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N);
243 SDValue PromoteIntRes_FP_TO_XINT(SDNode *N);
244 SDValue PromoteIntRes_INT_EXTEND(SDNode *N);
245 SDValue PromoteIntRes_LOAD(LoadSDNode *N);
246 SDValue PromoteIntRes_SDIV(SDNode *N);
247 SDValue PromoteIntRes_SELECT (SDNode *N);
248 SDValue PromoteIntRes_SELECT_CC(SDNode *N);
249 SDValue PromoteIntRes_SETCC(SDNode *N);
250 SDValue PromoteIntRes_SHL(SDNode *N);
251 SDValue PromoteIntRes_SimpleIntBinOp(SDNode *N);
252 SDValue PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N);
253 SDValue PromoteIntRes_SRA(SDNode *N);
254 SDValue PromoteIntRes_SRL(SDNode *N);
255 SDValue PromoteIntRes_TRUNCATE(SDNode *N);
256 SDValue PromoteIntRes_UDIV(SDNode *N);
257 SDValue PromoteIntRes_UNDEF(SDNode *N);
258 SDValue PromoteIntRes_VAARG(SDNode *N);
260 // Integer Operand Promotion.
261 bool PromoteIntegerOperand(SDNode *N, unsigned OperandNo);
262 SDValue PromoteIntOp_ANY_EXTEND(SDNode *N);
263 SDValue PromoteIntOp_BUILD_PAIR(SDNode *N);
264 SDValue PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo);
265 SDValue PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo);
266 SDValue PromoteIntOp_BUILD_VECTOR(SDNode *N);
267 SDValue PromoteIntOp_FP_EXTEND(SDNode *N);
268 SDValue PromoteIntOp_FP_ROUND(SDNode *N);
269 SDValue PromoteIntOp_INT_TO_FP(SDNode *N);
270 SDValue PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N, unsigned OpNo);
271 SDValue PromoteIntOp_MEMBARRIER(SDNode *N);
272 SDValue PromoteIntOp_SELECT(SDNode *N, unsigned OpNo);
273 SDValue PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo);
274 SDValue PromoteIntOp_SETCC(SDNode *N, unsigned OpNo);
275 SDValue PromoteIntOp_SIGN_EXTEND(SDNode *N);
276 SDValue PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo);
277 SDValue PromoteIntOp_TRUNCATE(SDNode *N);
278 SDValue PromoteIntOp_ZERO_EXTEND(SDNode *N);
280 void PromoteSetCCOperands(SDValue &LHS,SDValue &RHS, ISD::CondCode Code);
282 //===--------------------------------------------------------------------===//
283 // Integer Expansion Support: LegalizeIntegerTypes.cpp
284 //===--------------------------------------------------------------------===//
286 void GetExpandedInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
287 void SetExpandedInteger(SDValue Op, SDValue Lo, SDValue Hi);
289 // Integer Result Expansion.
290 void ExpandIntegerResult(SDNode *N, unsigned ResNo);
291 void ExpandIntRes_ANY_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
292 void ExpandIntRes_AssertSext (SDNode *N, SDValue &Lo, SDValue &Hi);
293 void ExpandIntRes_AssertZext (SDNode *N, SDValue &Lo, SDValue &Hi);
294 void ExpandIntRes_Constant (SDNode *N, SDValue &Lo, SDValue &Hi);
295 void ExpandIntRes_CTLZ (SDNode *N, SDValue &Lo, SDValue &Hi);
296 void ExpandIntRes_CTPOP (SDNode *N, SDValue &Lo, SDValue &Hi);
297 void ExpandIntRes_CTTZ (SDNode *N, SDValue &Lo, SDValue &Hi);
298 void ExpandIntRes_LOAD (LoadSDNode *N, SDValue &Lo, SDValue &Hi);
299 void ExpandIntRes_SIGN_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
300 void ExpandIntRes_SIGN_EXTEND_INREG (SDNode *N, SDValue &Lo, SDValue &Hi);
301 void ExpandIntRes_TRUNCATE (SDNode *N, SDValue &Lo, SDValue &Hi);
302 void ExpandIntRes_ZERO_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
303 void ExpandIntRes_FP_TO_SINT (SDNode *N, SDValue &Lo, SDValue &Hi);
304 void ExpandIntRes_FP_TO_UINT (SDNode *N, SDValue &Lo, SDValue &Hi);
306 void ExpandIntRes_Logical (SDNode *N, SDValue &Lo, SDValue &Hi);
307 void ExpandIntRes_ADDSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
308 void ExpandIntRes_ADDSUBC (SDNode *N, SDValue &Lo, SDValue &Hi);
309 void ExpandIntRes_ADDSUBE (SDNode *N, SDValue &Lo, SDValue &Hi);
310 void ExpandIntRes_BSWAP (SDNode *N, SDValue &Lo, SDValue &Hi);
311 void ExpandIntRes_MUL (SDNode *N, SDValue &Lo, SDValue &Hi);
312 void ExpandIntRes_SDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
313 void ExpandIntRes_SREM (SDNode *N, SDValue &Lo, SDValue &Hi);
314 void ExpandIntRes_UDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
315 void ExpandIntRes_UREM (SDNode *N, SDValue &Lo, SDValue &Hi);
316 void ExpandIntRes_Shift (SDNode *N, SDValue &Lo, SDValue &Hi);
318 void ExpandShiftByConstant(SDNode *N, unsigned Amt,
319 SDValue &Lo, SDValue &Hi);
320 bool ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi);
322 // Integer Operand Expansion.
323 bool ExpandIntegerOperand(SDNode *N, unsigned OperandNo);
324 SDValue ExpandIntOp_BIT_CONVERT(SDNode *N);
325 SDValue ExpandIntOp_BR_CC(SDNode *N);
326 SDValue ExpandIntOp_BUILD_VECTOR(SDNode *N);
327 SDValue ExpandIntOp_EXTRACT_ELEMENT(SDNode *N);
328 SDValue ExpandIntOp_SELECT_CC(SDNode *N);
329 SDValue ExpandIntOp_SETCC(SDNode *N);
330 SDValue ExpandIntOp_SINT_TO_FP(SDNode *N);
331 SDValue ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo);
332 SDValue ExpandIntOp_TRUNCATE(SDNode *N);
333 SDValue ExpandIntOp_UINT_TO_FP(SDNode *N);
335 void IntegerExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
336 ISD::CondCode &CCCode);
338 //===--------------------------------------------------------------------===//
339 // Float to Integer Conversion Support: LegalizeFloatTypes.cpp
340 //===--------------------------------------------------------------------===//
342 SDValue GetSoftenedFloat(SDValue Op) {
343 SDValue &SoftenedOp = SoftenedFloats[Op];
344 RemapValue(SoftenedOp);
345 assert(SoftenedOp.getNode() && "Operand wasn't converted to integer?");
348 void SetSoftenedFloat(SDValue Op, SDValue Result);
350 // Result Float to Integer Conversion.
351 void SoftenFloatResult(SDNode *N, unsigned OpNo);
352 SDValue SoftenFloatRes_BIT_CONVERT(SDNode *N);
353 SDValue SoftenFloatRes_BUILD_PAIR(SDNode *N);
354 SDValue SoftenFloatRes_ConstantFP(ConstantFPSDNode *N);
355 SDValue SoftenFloatRes_FABS(SDNode *N);
356 SDValue SoftenFloatRes_FADD(SDNode *N);
357 SDValue SoftenFloatRes_FCOPYSIGN(SDNode *N);
358 SDValue SoftenFloatRes_FDIV(SDNode *N);
359 SDValue SoftenFloatRes_FMUL(SDNode *N);
360 SDValue SoftenFloatRes_FP_EXTEND(SDNode *N);
361 SDValue SoftenFloatRes_FP_ROUND(SDNode *N);
362 SDValue SoftenFloatRes_FPOW(SDNode *N);
363 SDValue SoftenFloatRes_FPOWI(SDNode *N);
364 SDValue SoftenFloatRes_FSUB(SDNode *N);
365 SDValue SoftenFloatRes_LOAD(SDNode *N);
366 SDValue SoftenFloatRes_SELECT(SDNode *N);
367 SDValue SoftenFloatRes_SELECT_CC(SDNode *N);
368 SDValue SoftenFloatRes_SINT_TO_FP(SDNode *N);
369 SDValue SoftenFloatRes_UINT_TO_FP(SDNode *N);
371 // Operand Float to Integer Conversion.
372 bool SoftenFloatOperand(SDNode *N, unsigned OpNo);
373 SDValue SoftenFloatOp_BIT_CONVERT(SDNode *N);
374 SDValue SoftenFloatOp_BR_CC(SDNode *N);
375 SDValue SoftenFloatOp_FP_ROUND(SDNode *N);
376 SDValue SoftenFloatOp_FP_TO_SINT(SDNode *N);
377 SDValue SoftenFloatOp_FP_TO_UINT(SDNode *N);
378 SDValue SoftenFloatOp_SELECT_CC(SDNode *N);
379 SDValue SoftenFloatOp_SETCC(SDNode *N);
380 SDValue SoftenFloatOp_STORE(SDNode *N, unsigned OpNo);
382 void SoftenSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
383 ISD::CondCode &CCCode);
385 //===--------------------------------------------------------------------===//
386 // Float Expansion Support: LegalizeFloatTypes.cpp
387 //===--------------------------------------------------------------------===//
389 void GetExpandedFloat(SDValue Op, SDValue &Lo, SDValue &Hi);
390 void SetExpandedFloat(SDValue Op, SDValue Lo, SDValue Hi);
392 // Float Result Expansion.
393 void ExpandFloatResult(SDNode *N, unsigned ResNo);
394 void ExpandFloatRes_ConstantFP(SDNode *N, SDValue &Lo, SDValue &Hi);
395 void ExpandFloatRes_FABS (SDNode *N, SDValue &Lo, SDValue &Hi);
396 void ExpandFloatRes_FADD (SDNode *N, SDValue &Lo, SDValue &Hi);
397 void ExpandFloatRes_FCEIL (SDNode *N, SDValue &Lo, SDValue &Hi);
398 void ExpandFloatRes_FCOS (SDNode *N, SDValue &Lo, SDValue &Hi);
399 void ExpandFloatRes_FDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
400 void ExpandFloatRes_FEXP (SDNode *N, SDValue &Lo, SDValue &Hi);
401 void ExpandFloatRes_FEXP2 (SDNode *N, SDValue &Lo, SDValue &Hi);
402 void ExpandFloatRes_FFLOOR (SDNode *N, SDValue &Lo, SDValue &Hi);
403 void ExpandFloatRes_FLOG (SDNode *N, SDValue &Lo, SDValue &Hi);
404 void ExpandFloatRes_FLOG2 (SDNode *N, SDValue &Lo, SDValue &Hi);
405 void ExpandFloatRes_FLOG10 (SDNode *N, SDValue &Lo, SDValue &Hi);
406 void ExpandFloatRes_FMUL (SDNode *N, SDValue &Lo, SDValue &Hi);
407 void ExpandFloatRes_FNEARBYINT(SDNode *N, SDValue &Lo, SDValue &Hi);
408 void ExpandFloatRes_FNEG (SDNode *N, SDValue &Lo, SDValue &Hi);
409 void ExpandFloatRes_FP_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
410 void ExpandFloatRes_FPOW (SDNode *N, SDValue &Lo, SDValue &Hi);
411 void ExpandFloatRes_FPOWI (SDNode *N, SDValue &Lo, SDValue &Hi);
412 void ExpandFloatRes_FRINT (SDNode *N, SDValue &Lo, SDValue &Hi);
413 void ExpandFloatRes_FSIN (SDNode *N, SDValue &Lo, SDValue &Hi);
414 void ExpandFloatRes_FSQRT (SDNode *N, SDValue &Lo, SDValue &Hi);
415 void ExpandFloatRes_FSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
416 void ExpandFloatRes_FTRUNC (SDNode *N, SDValue &Lo, SDValue &Hi);
417 void ExpandFloatRes_LOAD (SDNode *N, SDValue &Lo, SDValue &Hi);
418 void ExpandFloatRes_XINT_TO_FP(SDNode *N, SDValue &Lo, SDValue &Hi);
420 // Float Operand Expansion.
421 bool ExpandFloatOperand(SDNode *N, unsigned OperandNo);
422 SDValue ExpandFloatOp_BR_CC(SDNode *N);
423 SDValue ExpandFloatOp_FP_ROUND(SDNode *N);
424 SDValue ExpandFloatOp_FP_TO_SINT(SDNode *N);
425 SDValue ExpandFloatOp_FP_TO_UINT(SDNode *N);
426 SDValue ExpandFloatOp_SELECT_CC(SDNode *N);
427 SDValue ExpandFloatOp_SETCC(SDNode *N);
428 SDValue ExpandFloatOp_STORE(SDNode *N, unsigned OpNo);
430 void FloatExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
431 ISD::CondCode &CCCode);
433 //===--------------------------------------------------------------------===//
434 // Scalarization Support: LegalizeVectorTypes.cpp
435 //===--------------------------------------------------------------------===//
437 SDValue GetScalarizedVector(SDValue Op) {
438 SDValue &ScalarizedOp = ScalarizedVectors[Op];
439 RemapValue(ScalarizedOp);
440 assert(ScalarizedOp.getNode() && "Operand wasn't scalarized?");
443 void SetScalarizedVector(SDValue Op, SDValue Result);
445 // Vector Result Scalarization: <1 x ty> -> ty.
446 void ScalarizeVectorResult(SDNode *N, unsigned OpNo);
447 SDValue ScalarizeVecRes_BinOp(SDNode *N);
448 SDValue ScalarizeVecRes_UnaryOp(SDNode *N);
450 SDValue ScalarizeVecRes_BIT_CONVERT(SDNode *N);
451 SDValue ScalarizeVecRes_EXTRACT_SUBVECTOR(SDNode *N);
452 SDValue ScalarizeVecRes_FPOWI(SDNode *N);
453 SDValue ScalarizeVecRes_INSERT_VECTOR_ELT(SDNode *N);
454 SDValue ScalarizeVecRes_LOAD(LoadSDNode *N);
455 SDValue ScalarizeVecRes_SELECT(SDNode *N);
456 SDValue ScalarizeVecRes_SELECT_CC(SDNode *N);
457 SDValue ScalarizeVecRes_UNDEF(SDNode *N);
458 SDValue ScalarizeVecRes_VECTOR_SHUFFLE(SDNode *N);
459 SDValue ScalarizeVecRes_VSETCC(SDNode *N);
461 // Vector Operand Scalarization: <1 x ty> -> ty.
462 bool ScalarizeVectorOperand(SDNode *N, unsigned OpNo);
463 SDValue ScalarizeVecOp_BIT_CONVERT(SDNode *N);
464 SDValue ScalarizeVecOp_CONCAT_VECTORS(SDNode *N);
465 SDValue ScalarizeVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
466 SDValue ScalarizeVecOp_STORE(StoreSDNode *N, unsigned OpNo);
468 //===--------------------------------------------------------------------===//
469 // Vector Splitting Support: LegalizeVectorTypes.cpp
470 //===--------------------------------------------------------------------===//
472 void GetSplitVector(SDValue Op, SDValue &Lo, SDValue &Hi);
473 void SetSplitVector(SDValue Op, SDValue Lo, SDValue Hi);
475 // Vector Result Splitting: <128 x ty> -> 2 x <64 x ty>.
476 void SplitVectorResult(SDNode *N, unsigned OpNo);
477 void SplitVecRes_BinOp(SDNode *N, SDValue &Lo, SDValue &Hi);
478 void SplitVecRes_UnaryOp(SDNode *N, SDValue &Lo, SDValue &Hi);
480 void SplitVecRes_BIT_CONVERT(SDNode *N, SDValue &Lo, SDValue &Hi);
481 void SplitVecRes_BUILD_PAIR(SDNode *N, SDValue &Lo, SDValue &Hi);
482 void SplitVecRes_BUILD_VECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
483 void SplitVecRes_CONCAT_VECTORS(SDNode *N, SDValue &Lo, SDValue &Hi);
484 void SplitVecRes_FPOWI(SDNode *N, SDValue &Lo, SDValue &Hi);
485 void SplitVecRes_INSERT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
486 void SplitVecRes_LOAD(LoadSDNode *N, SDValue &Lo, SDValue &Hi);
487 void SplitVecRes_UNDEF(SDNode *N, SDValue &Lo, SDValue &Hi);
488 void SplitVecRes_VECTOR_SHUFFLE(SDNode *N, SDValue &Lo, SDValue &Hi);
489 void SplitVecRes_VSETCC(SDNode *N, SDValue &Lo, SDValue &Hi);
491 // Vector Operand Splitting: <128 x ty> -> 2 x <64 x ty>.
492 bool SplitVectorOperand(SDNode *N, unsigned OpNo);
493 SDValue SplitVecOp_UnaryOp(SDNode *N);
495 SDValue SplitVecOp_BIT_CONVERT(SDNode *N);
496 SDValue SplitVecOp_EXTRACT_SUBVECTOR(SDNode *N);
497 SDValue SplitVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
498 SDValue SplitVecOp_STORE(StoreSDNode *N, unsigned OpNo);
499 SDValue SplitVecOp_VECTOR_SHUFFLE(SDNode *N, unsigned OpNo);
501 //===--------------------------------------------------------------------===//
502 // Generic Splitting: LegalizeTypesGeneric.cpp
503 //===--------------------------------------------------------------------===//
505 // Legalization methods which only use that the illegal type is split into two
506 // not necessarily identical types. As such they can be used for splitting
507 // vectors and expanding integers and floats.
509 void GetSplitOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
510 if (Op.getValueType().isVector())
511 GetSplitVector(Op, Lo, Hi);
512 else if (Op.getValueType().isInteger())
513 GetExpandedInteger(Op, Lo, Hi);
515 GetExpandedFloat(Op, Lo, Hi);
518 /// GetSplitDestVTs - Compute the VTs needed for the low/hi parts of a type
519 /// which is split (or expanded) into two not necessarily identical pieces.
520 void GetSplitDestVTs(MVT InVT, MVT &LoVT, MVT &HiVT);
522 // Generic Result Splitting.
523 void SplitRes_MERGE_VALUES(SDNode *N, SDValue &Lo, SDValue &Hi);
524 void SplitRes_SELECT (SDNode *N, SDValue &Lo, SDValue &Hi);
525 void SplitRes_SELECT_CC (SDNode *N, SDValue &Lo, SDValue &Hi);
526 void SplitRes_UNDEF (SDNode *N, SDValue &Lo, SDValue &Hi);
528 //===--------------------------------------------------------------------===//
529 // Generic Expansion: LegalizeTypesGeneric.cpp
530 //===--------------------------------------------------------------------===//
532 // Legalization methods which only use that the illegal type is split into two
533 // identical types of half the size, and that the Lo/Hi part is stored first
534 // in memory on little/big-endian machines, followed by the Hi/Lo part. As
535 // such they can be used for expanding integers and floats.
537 void GetExpandedOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
538 if (Op.getValueType().isInteger())
539 GetExpandedInteger(Op, Lo, Hi);
541 GetExpandedFloat(Op, Lo, Hi);
544 // Generic Result Expansion.
545 void ExpandRes_BIT_CONVERT (SDNode *N, SDValue &Lo, SDValue &Hi);
546 void ExpandRes_BUILD_PAIR (SDNode *N, SDValue &Lo, SDValue &Hi);
547 void ExpandRes_EXTRACT_ELEMENT (SDNode *N, SDValue &Lo, SDValue &Hi);
548 void ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
549 void ExpandRes_NormalLoad (SDNode *N, SDValue &Lo, SDValue &Hi);
550 void ExpandRes_VAARG (SDNode *N, SDValue &Lo, SDValue &Hi);
552 // Generic Operand Expansion.
553 SDValue ExpandOp_BIT_CONVERT (SDNode *N);
554 SDValue ExpandOp_BUILD_VECTOR (SDNode *N);
555 SDValue ExpandOp_EXTRACT_ELEMENT(SDNode *N);
556 SDValue ExpandOp_NormalStore (SDNode *N, unsigned OpNo);
560 } // end namespace llvm.