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) For integers, use a larger integer type (e.g. i8 -> i32).
84 // 2) For vectors, use a wider vector type (e.g. v3i32 -> v4i32).
86 return PromoteInteger;
87 else if (VT.getVectorNumElements() == 1)
88 return ScalarizeVector;
90 // TODO: move widen code to LegalizeTypes.
92 case TargetLowering::Expand:
94 // 1) split scalar in half, 2) convert a float to an integer,
95 // 3) scalarize a single-element vector, 4) split a vector in two.
99 else if (VT.getSizeInBits() ==
100 TLI.getTypeToTransformTo(VT).getSizeInBits())
104 } else if (VT.getVectorNumElements() == 1) {
105 return ScalarizeVector;
112 /// isTypeLegal - Return true if this type is legal on this target.
113 bool isTypeLegal(MVT VT) const {
114 return ValueTypeActions.getTypeAction(VT) == TargetLowering::Legal;
117 /// IgnoreNodeResults - Pretend all of this node's results are legal.
118 bool IgnoreNodeResults(SDNode *N) const {
119 return N->getOpcode() == ISD::TargetConstant;
122 /// PromotedIntegers - For integer nodes that are below legal width, this map
123 /// indicates what promoted value to use.
124 DenseMap<SDValue, SDValue> PromotedIntegers;
126 /// ExpandedIntegers - For integer nodes that need to be expanded this map
127 /// indicates which operands are the expanded version of the input.
128 DenseMap<SDValue, std::pair<SDValue, SDValue> > ExpandedIntegers;
130 /// SoftenedFloats - For floating point nodes converted to integers of
131 /// the same size, this map indicates the converted value to use.
132 DenseMap<SDValue, SDValue> SoftenedFloats;
134 /// ExpandedFloats - For float nodes that need to be expanded this map
135 /// indicates which operands are the expanded version of the input.
136 DenseMap<SDValue, std::pair<SDValue, SDValue> > ExpandedFloats;
138 /// ScalarizedVectors - For nodes that are <1 x ty>, this map indicates the
139 /// scalar value of type 'ty' to use.
140 DenseMap<SDValue, SDValue> ScalarizedVectors;
142 /// SplitVectors - For nodes that need to be split this map indicates
143 /// which operands are the expanded version of the input.
144 DenseMap<SDValue, std::pair<SDValue, SDValue> > SplitVectors;
146 /// ReplacedValues - For values that have been replaced with another,
147 /// indicates the replacement value to use.
148 DenseMap<SDValue, SDValue> ReplacedValues;
150 /// Worklist - This defines a worklist of nodes to process. In order to be
151 /// pushed onto this worklist, all operands of a node must have already been
153 SmallVector<SDNode*, 128> Worklist;
156 explicit DAGTypeLegalizer(SelectionDAG &dag)
157 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
158 ValueTypeActions(TLI.getValueTypeActions()) {
159 assert(MVT::LAST_VALUETYPE <= 32 &&
160 "Too many value types for ValueTypeActions to hold!");
165 /// ReanalyzeNode - Recompute the NodeId and correct processed operands
166 /// for the specified node, adding it to the worklist if ready.
167 void ReanalyzeNode(SDNode *N) {
168 N->setNodeId(NewNode);
170 // The node may have changed but we don't care.
173 void NoteDeletion(SDNode *Old, SDNode *New) {
176 for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i)
177 ReplacedValues[SDValue(Old, i)] = SDValue(New, i);
181 SDNode *AnalyzeNewNode(SDNode *N);
182 void AnalyzeNewValue(SDValue &Val);
184 void ReplaceValueWith(SDValue From, SDValue To);
185 void ReplaceNodeWith(SDNode *From, SDNode *To);
187 void RemapValue(SDValue &N);
188 void ExpungeNode(SDNode *N);
191 SDValue CreateStackStoreLoad(SDValue Op, MVT DestVT);
192 SDValue MakeLibCall(RTLIB::Libcall LC, MVT RetVT,
193 const SDValue *Ops, unsigned NumOps, bool isSigned);
194 SDValue LibCallify(RTLIB::Libcall LC, SDNode *N, bool isSigned);
196 SDValue BitConvertToInteger(SDValue Op);
197 SDValue JoinIntegers(SDValue Lo, SDValue Hi);
198 void SplitInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
199 void SplitInteger(SDValue Op, MVT LoVT, MVT HiVT,
200 SDValue &Lo, SDValue &Hi);
202 SDValue GetVectorElementPointer(SDValue VecPtr, MVT EltVT, SDValue Index);
204 //===--------------------------------------------------------------------===//
205 // Integer Promotion Support: LegalizeIntegerTypes.cpp
206 //===--------------------------------------------------------------------===//
208 /// GetPromotedInteger - Given a processed operand Op which was promoted to a
209 /// larger integer type, this returns the promoted value. The bits of the
210 /// promoted value corresponding to the original type are exactly equal to Op.
211 /// The extra bits contain rubbish, so the promoted value may need to be zero-
212 /// or sign-extended from the original type before it is usable (the helpers
213 /// SExtPromotedInteger and ZExtPromotedInteger can do this for you).
214 /// For example, if Op is an i16 and was promoted to an i32, then this method
215 /// returns an i32, the lower 16 bits of which coincide with Op, and the upper
216 /// 16 bits of which contain rubbish.
217 SDValue GetPromotedInteger(SDValue Op) {
218 SDValue &PromotedOp = PromotedIntegers[Op];
219 RemapValue(PromotedOp);
220 assert(PromotedOp.getNode() && "Operand wasn't promoted?");
223 void SetPromotedInteger(SDValue Op, SDValue Result);
225 /// SExtPromotedInteger - Get a promoted operand and sign extend it to the
227 SDValue SExtPromotedInteger(SDValue Op) {
228 MVT OldVT = Op.getValueType();
229 Op = GetPromotedInteger(Op);
230 return DAG.getNode(ISD::SIGN_EXTEND_INREG, Op.getValueType(), Op,
231 DAG.getValueType(OldVT));
234 /// ZExtPromotedInteger - Get a promoted operand and zero extend it to the
236 SDValue ZExtPromotedInteger(SDValue Op) {
237 MVT OldVT = Op.getValueType();
238 Op = GetPromotedInteger(Op);
239 return DAG.getZeroExtendInReg(Op, OldVT);
242 // Integer Result Promotion.
243 void PromoteIntegerResult(SDNode *N, unsigned ResNo);
244 SDValue PromoteIntRes_AssertSext(SDNode *N);
245 SDValue PromoteIntRes_AssertZext(SDNode *N);
246 SDValue PromoteIntRes_Atomic1(AtomicSDNode *N);
247 SDValue PromoteIntRes_Atomic2(AtomicSDNode *N);
248 SDValue PromoteIntRes_BIT_CONVERT(SDNode *N);
249 SDValue PromoteIntRes_BSWAP(SDNode *N);
250 SDValue PromoteIntRes_BUILD_PAIR(SDNode *N);
251 SDValue PromoteIntRes_Constant(SDNode *N);
252 SDValue PromoteIntRes_CONVERT_RNDSAT(SDNode *N);
253 SDValue PromoteIntRes_CTLZ(SDNode *N);
254 SDValue PromoteIntRes_CTPOP(SDNode *N);
255 SDValue PromoteIntRes_CTTZ(SDNode *N);
256 SDValue PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N);
257 SDValue PromoteIntRes_FP_TO_XINT(SDNode *N);
258 SDValue PromoteIntRes_INT_EXTEND(SDNode *N);
259 SDValue PromoteIntRes_LOAD(LoadSDNode *N);
260 SDValue PromoteIntRes_SDIV(SDNode *N);
261 SDValue PromoteIntRes_SELECT (SDNode *N);
262 SDValue PromoteIntRes_SELECT_CC(SDNode *N);
263 SDValue PromoteIntRes_SETCC(SDNode *N);
264 SDValue PromoteIntRes_SHL(SDNode *N);
265 SDValue PromoteIntRes_SimpleIntBinOp(SDNode *N);
266 SDValue PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N);
267 SDValue PromoteIntRes_SRA(SDNode *N);
268 SDValue PromoteIntRes_SRL(SDNode *N);
269 SDValue PromoteIntRes_TRUNCATE(SDNode *N);
270 SDValue PromoteIntRes_UDIV(SDNode *N);
271 SDValue PromoteIntRes_UNDEF(SDNode *N);
272 SDValue PromoteIntRes_VAARG(SDNode *N);
274 // Integer Operand Promotion.
275 bool PromoteIntegerOperand(SDNode *N, unsigned OperandNo);
276 SDValue PromoteIntOp_ANY_EXTEND(SDNode *N);
277 SDValue PromoteIntOp_BUILD_PAIR(SDNode *N);
278 SDValue PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo);
279 SDValue PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo);
280 SDValue PromoteIntOp_BUILD_VECTOR(SDNode *N);
281 SDValue PromoteIntOp_CONVERT_RNDSAT(SDNode *N);
282 SDValue PromoteIntOp_FP_EXTEND(SDNode *N);
283 SDValue PromoteIntOp_FP_ROUND(SDNode *N);
284 SDValue PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N, unsigned OpNo);
285 SDValue PromoteIntOp_MEMBARRIER(SDNode *N);
286 SDValue PromoteIntOp_SELECT(SDNode *N, unsigned OpNo);
287 SDValue PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo);
288 SDValue PromoteIntOp_SETCC(SDNode *N, unsigned OpNo);
289 SDValue PromoteIntOp_SIGN_EXTEND(SDNode *N);
290 SDValue PromoteIntOp_SINT_TO_FP(SDNode *N);
291 SDValue PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo);
292 SDValue PromoteIntOp_TRUNCATE(SDNode *N);
293 SDValue PromoteIntOp_UINT_TO_FP(SDNode *N);
294 SDValue PromoteIntOp_ZERO_EXTEND(SDNode *N);
296 void PromoteSetCCOperands(SDValue &LHS,SDValue &RHS, ISD::CondCode Code);
298 //===--------------------------------------------------------------------===//
299 // Integer Expansion Support: LegalizeIntegerTypes.cpp
300 //===--------------------------------------------------------------------===//
302 void GetExpandedInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
303 void SetExpandedInteger(SDValue Op, SDValue Lo, SDValue Hi);
305 // Integer Result Expansion.
306 void ExpandIntegerResult(SDNode *N, unsigned ResNo);
307 void ExpandIntRes_ANY_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
308 void ExpandIntRes_AssertSext (SDNode *N, SDValue &Lo, SDValue &Hi);
309 void ExpandIntRes_AssertZext (SDNode *N, SDValue &Lo, SDValue &Hi);
310 void ExpandIntRes_Constant (SDNode *N, SDValue &Lo, SDValue &Hi);
311 void ExpandIntRes_CTLZ (SDNode *N, SDValue &Lo, SDValue &Hi);
312 void ExpandIntRes_CTPOP (SDNode *N, SDValue &Lo, SDValue &Hi);
313 void ExpandIntRes_CTTZ (SDNode *N, SDValue &Lo, SDValue &Hi);
314 void ExpandIntRes_LOAD (LoadSDNode *N, SDValue &Lo, SDValue &Hi);
315 void ExpandIntRes_SIGN_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
316 void ExpandIntRes_SIGN_EXTEND_INREG (SDNode *N, SDValue &Lo, SDValue &Hi);
317 void ExpandIntRes_TRUNCATE (SDNode *N, SDValue &Lo, SDValue &Hi);
318 void ExpandIntRes_ZERO_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
319 void ExpandIntRes_FP_TO_SINT (SDNode *N, SDValue &Lo, SDValue &Hi);
320 void ExpandIntRes_FP_TO_UINT (SDNode *N, SDValue &Lo, SDValue &Hi);
322 void ExpandIntRes_Logical (SDNode *N, SDValue &Lo, SDValue &Hi);
323 void ExpandIntRes_ADDSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
324 void ExpandIntRes_ADDSUBC (SDNode *N, SDValue &Lo, SDValue &Hi);
325 void ExpandIntRes_ADDSUBE (SDNode *N, SDValue &Lo, SDValue &Hi);
326 void ExpandIntRes_BSWAP (SDNode *N, SDValue &Lo, SDValue &Hi);
327 void ExpandIntRes_MUL (SDNode *N, SDValue &Lo, SDValue &Hi);
328 void ExpandIntRes_SDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
329 void ExpandIntRes_SREM (SDNode *N, SDValue &Lo, SDValue &Hi);
330 void ExpandIntRes_UDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
331 void ExpandIntRes_UREM (SDNode *N, SDValue &Lo, SDValue &Hi);
332 void ExpandIntRes_Shift (SDNode *N, SDValue &Lo, SDValue &Hi);
334 void ExpandShiftByConstant(SDNode *N, unsigned Amt,
335 SDValue &Lo, SDValue &Hi);
336 bool ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi);
338 // Integer Operand Expansion.
339 bool ExpandIntegerOperand(SDNode *N, unsigned OperandNo);
340 SDValue ExpandIntOp_BIT_CONVERT(SDNode *N);
341 SDValue ExpandIntOp_BR_CC(SDNode *N);
342 SDValue ExpandIntOp_BUILD_VECTOR(SDNode *N);
343 SDValue ExpandIntOp_EXTRACT_ELEMENT(SDNode *N);
344 SDValue ExpandIntOp_SELECT_CC(SDNode *N);
345 SDValue ExpandIntOp_SETCC(SDNode *N);
346 SDValue ExpandIntOp_SINT_TO_FP(SDNode *N);
347 SDValue ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo);
348 SDValue ExpandIntOp_TRUNCATE(SDNode *N);
349 SDValue ExpandIntOp_UINT_TO_FP(SDNode *N);
351 void IntegerExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
352 ISD::CondCode &CCCode);
354 //===--------------------------------------------------------------------===//
355 // Float to Integer Conversion Support: LegalizeFloatTypes.cpp
356 //===--------------------------------------------------------------------===//
358 SDValue GetSoftenedFloat(SDValue Op) {
359 SDValue &SoftenedOp = SoftenedFloats[Op];
360 RemapValue(SoftenedOp);
361 assert(SoftenedOp.getNode() && "Operand wasn't converted to integer?");
364 void SetSoftenedFloat(SDValue Op, SDValue Result);
366 // Result Float to Integer Conversion.
367 void SoftenFloatResult(SDNode *N, unsigned OpNo);
368 SDValue SoftenFloatRes_BIT_CONVERT(SDNode *N);
369 SDValue SoftenFloatRes_BUILD_PAIR(SDNode *N);
370 SDValue SoftenFloatRes_ConstantFP(ConstantFPSDNode *N);
371 SDValue SoftenFloatRes_FABS(SDNode *N);
372 SDValue SoftenFloatRes_FADD(SDNode *N);
373 SDValue SoftenFloatRes_FCEIL(SDNode *N);
374 SDValue SoftenFloatRes_FCOPYSIGN(SDNode *N);
375 SDValue SoftenFloatRes_FCOS(SDNode *N);
376 SDValue SoftenFloatRes_FDIV(SDNode *N);
377 SDValue SoftenFloatRes_FEXP(SDNode *N);
378 SDValue SoftenFloatRes_FEXP2(SDNode *N);
379 SDValue SoftenFloatRes_FFLOOR(SDNode *N);
380 SDValue SoftenFloatRes_FLOG(SDNode *N);
381 SDValue SoftenFloatRes_FLOG2(SDNode *N);
382 SDValue SoftenFloatRes_FLOG10(SDNode *N);
383 SDValue SoftenFloatRes_FMUL(SDNode *N);
384 SDValue SoftenFloatRes_FNEARBYINT(SDNode *N);
385 SDValue SoftenFloatRes_FNEG(SDNode *N);
386 SDValue SoftenFloatRes_FP_EXTEND(SDNode *N);
387 SDValue SoftenFloatRes_FP_ROUND(SDNode *N);
388 SDValue SoftenFloatRes_FPOW(SDNode *N);
389 SDValue SoftenFloatRes_FPOWI(SDNode *N);
390 SDValue SoftenFloatRes_FRINT(SDNode *N);
391 SDValue SoftenFloatRes_FSIN(SDNode *N);
392 SDValue SoftenFloatRes_FSQRT(SDNode *N);
393 SDValue SoftenFloatRes_FSUB(SDNode *N);
394 SDValue SoftenFloatRes_FTRUNC(SDNode *N);
395 SDValue SoftenFloatRes_LOAD(SDNode *N);
396 SDValue SoftenFloatRes_SELECT(SDNode *N);
397 SDValue SoftenFloatRes_SELECT_CC(SDNode *N);
398 SDValue SoftenFloatRes_XINT_TO_FP(SDNode *N);
400 // Operand Float to Integer Conversion.
401 bool SoftenFloatOperand(SDNode *N, unsigned OpNo);
402 SDValue SoftenFloatOp_BIT_CONVERT(SDNode *N);
403 SDValue SoftenFloatOp_BR_CC(SDNode *N);
404 SDValue SoftenFloatOp_FP_ROUND(SDNode *N);
405 SDValue SoftenFloatOp_FP_TO_SINT(SDNode *N);
406 SDValue SoftenFloatOp_FP_TO_UINT(SDNode *N);
407 SDValue SoftenFloatOp_SELECT_CC(SDNode *N);
408 SDValue SoftenFloatOp_SETCC(SDNode *N);
409 SDValue SoftenFloatOp_STORE(SDNode *N, unsigned OpNo);
411 void SoftenSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
412 ISD::CondCode &CCCode);
414 //===--------------------------------------------------------------------===//
415 // Float Expansion Support: LegalizeFloatTypes.cpp
416 //===--------------------------------------------------------------------===//
418 void GetExpandedFloat(SDValue Op, SDValue &Lo, SDValue &Hi);
419 void SetExpandedFloat(SDValue Op, SDValue Lo, SDValue Hi);
421 // Float Result Expansion.
422 void ExpandFloatResult(SDNode *N, unsigned ResNo);
423 void ExpandFloatRes_ConstantFP(SDNode *N, SDValue &Lo, SDValue &Hi);
424 void ExpandFloatRes_FABS (SDNode *N, SDValue &Lo, SDValue &Hi);
425 void ExpandFloatRes_FADD (SDNode *N, SDValue &Lo, SDValue &Hi);
426 void ExpandFloatRes_FCEIL (SDNode *N, SDValue &Lo, SDValue &Hi);
427 void ExpandFloatRes_FCOS (SDNode *N, SDValue &Lo, SDValue &Hi);
428 void ExpandFloatRes_FDIV (SDNode *N, SDValue &Lo, SDValue &Hi);
429 void ExpandFloatRes_FEXP (SDNode *N, SDValue &Lo, SDValue &Hi);
430 void ExpandFloatRes_FEXP2 (SDNode *N, SDValue &Lo, SDValue &Hi);
431 void ExpandFloatRes_FFLOOR (SDNode *N, SDValue &Lo, SDValue &Hi);
432 void ExpandFloatRes_FLOG (SDNode *N, SDValue &Lo, SDValue &Hi);
433 void ExpandFloatRes_FLOG2 (SDNode *N, SDValue &Lo, SDValue &Hi);
434 void ExpandFloatRes_FLOG10 (SDNode *N, SDValue &Lo, SDValue &Hi);
435 void ExpandFloatRes_FMUL (SDNode *N, SDValue &Lo, SDValue &Hi);
436 void ExpandFloatRes_FNEARBYINT(SDNode *N, SDValue &Lo, SDValue &Hi);
437 void ExpandFloatRes_FNEG (SDNode *N, SDValue &Lo, SDValue &Hi);
438 void ExpandFloatRes_FP_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
439 void ExpandFloatRes_FPOW (SDNode *N, SDValue &Lo, SDValue &Hi);
440 void ExpandFloatRes_FPOWI (SDNode *N, SDValue &Lo, SDValue &Hi);
441 void ExpandFloatRes_FRINT (SDNode *N, SDValue &Lo, SDValue &Hi);
442 void ExpandFloatRes_FSIN (SDNode *N, SDValue &Lo, SDValue &Hi);
443 void ExpandFloatRes_FSQRT (SDNode *N, SDValue &Lo, SDValue &Hi);
444 void ExpandFloatRes_FSUB (SDNode *N, SDValue &Lo, SDValue &Hi);
445 void ExpandFloatRes_FTRUNC (SDNode *N, SDValue &Lo, SDValue &Hi);
446 void ExpandFloatRes_LOAD (SDNode *N, SDValue &Lo, SDValue &Hi);
447 void ExpandFloatRes_XINT_TO_FP(SDNode *N, SDValue &Lo, SDValue &Hi);
449 // Float Operand Expansion.
450 bool ExpandFloatOperand(SDNode *N, unsigned OperandNo);
451 SDValue ExpandFloatOp_BR_CC(SDNode *N);
452 SDValue ExpandFloatOp_FP_ROUND(SDNode *N);
453 SDValue ExpandFloatOp_FP_TO_SINT(SDNode *N);
454 SDValue ExpandFloatOp_FP_TO_UINT(SDNode *N);
455 SDValue ExpandFloatOp_SELECT_CC(SDNode *N);
456 SDValue ExpandFloatOp_SETCC(SDNode *N);
457 SDValue ExpandFloatOp_STORE(SDNode *N, unsigned OpNo);
459 void FloatExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
460 ISD::CondCode &CCCode);
462 //===--------------------------------------------------------------------===//
463 // Scalarization Support: LegalizeVectorTypes.cpp
464 //===--------------------------------------------------------------------===//
466 SDValue GetScalarizedVector(SDValue Op) {
467 SDValue &ScalarizedOp = ScalarizedVectors[Op];
468 RemapValue(ScalarizedOp);
469 assert(ScalarizedOp.getNode() && "Operand wasn't scalarized?");
472 void SetScalarizedVector(SDValue Op, SDValue Result);
474 // Vector Result Scalarization: <1 x ty> -> ty.
475 void ScalarizeVectorResult(SDNode *N, unsigned OpNo);
476 SDValue ScalarizeVecRes_BinOp(SDNode *N);
477 SDValue ScalarizeVecRes_UnaryOp(SDNode *N);
479 SDValue ScalarizeVecRes_BIT_CONVERT(SDNode *N);
480 SDValue ScalarizeVecRes_CONVERT_RNDSAT(SDNode *N);
481 SDValue ScalarizeVecRes_EXTRACT_SUBVECTOR(SDNode *N);
482 SDValue ScalarizeVecRes_FPOWI(SDNode *N);
483 SDValue ScalarizeVecRes_INSERT_VECTOR_ELT(SDNode *N);
484 SDValue ScalarizeVecRes_LOAD(LoadSDNode *N);
485 SDValue ScalarizeVecRes_SCALAR_TO_VECTOR(SDNode *N);
486 SDValue ScalarizeVecRes_SELECT(SDNode *N);
487 SDValue ScalarizeVecRes_SELECT_CC(SDNode *N);
488 SDValue ScalarizeVecRes_UNDEF(SDNode *N);
489 SDValue ScalarizeVecRes_VECTOR_SHUFFLE(SDNode *N);
490 SDValue ScalarizeVecRes_VSETCC(SDNode *N);
492 // Vector Operand Scalarization: <1 x ty> -> ty.
493 bool ScalarizeVectorOperand(SDNode *N, unsigned OpNo);
494 SDValue ScalarizeVecOp_BIT_CONVERT(SDNode *N);
495 SDValue ScalarizeVecOp_CONCAT_VECTORS(SDNode *N);
496 SDValue ScalarizeVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
497 SDValue ScalarizeVecOp_STORE(StoreSDNode *N, unsigned OpNo);
499 //===--------------------------------------------------------------------===//
500 // Vector Splitting Support: LegalizeVectorTypes.cpp
501 //===--------------------------------------------------------------------===//
503 void GetSplitVector(SDValue Op, SDValue &Lo, SDValue &Hi);
504 void SetSplitVector(SDValue Op, SDValue Lo, SDValue Hi);
506 // Vector Result Splitting: <128 x ty> -> 2 x <64 x ty>.
507 void SplitVectorResult(SDNode *N, unsigned OpNo);
508 void SplitVecRes_BinOp(SDNode *N, SDValue &Lo, SDValue &Hi);
509 void SplitVecRes_UnaryOp(SDNode *N, SDValue &Lo, SDValue &Hi);
511 void SplitVecRes_BIT_CONVERT(SDNode *N, SDValue &Lo, SDValue &Hi);
512 void SplitVecRes_BUILD_PAIR(SDNode *N, SDValue &Lo, SDValue &Hi);
513 void SplitVecRes_BUILD_VECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
514 void SplitVecRes_CONCAT_VECTORS(SDNode *N, SDValue &Lo, SDValue &Hi);
515 void SplitVecRes_CONVERT_RNDSAT(SDNode *N, SDValue &Lo, SDValue &Hi);
516 void SplitVecRes_EXTRACT_SUBVECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
517 void SplitVecRes_FPOWI(SDNode *N, SDValue &Lo, SDValue &Hi);
518 void SplitVecRes_INSERT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
519 void SplitVecRes_LOAD(LoadSDNode *N, SDValue &Lo, SDValue &Hi);
520 void SplitVecRes_SCALAR_TO_VECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
521 void SplitVecRes_UNDEF(SDNode *N, SDValue &Lo, SDValue &Hi);
522 void SplitVecRes_VECTOR_SHUFFLE(SDNode *N, SDValue &Lo, SDValue &Hi);
523 void SplitVecRes_VSETCC(SDNode *N, SDValue &Lo, SDValue &Hi);
525 // Vector Operand Splitting: <128 x ty> -> 2 x <64 x ty>.
526 bool SplitVectorOperand(SDNode *N, unsigned OpNo);
527 SDValue SplitVecOp_UnaryOp(SDNode *N);
529 SDValue SplitVecOp_BIT_CONVERT(SDNode *N);
530 SDValue SplitVecOp_EXTRACT_SUBVECTOR(SDNode *N);
531 SDValue SplitVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
532 SDValue SplitVecOp_STORE(StoreSDNode *N, unsigned OpNo);
533 SDValue SplitVecOp_VECTOR_SHUFFLE(SDNode *N, unsigned OpNo);
535 //===--------------------------------------------------------------------===//
536 // Generic Splitting: LegalizeTypesGeneric.cpp
537 //===--------------------------------------------------------------------===//
539 // Legalization methods which only use that the illegal type is split into two
540 // not necessarily identical types. As such they can be used for splitting
541 // vectors and expanding integers and floats.
543 void GetSplitOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
544 if (Op.getValueType().isVector())
545 GetSplitVector(Op, Lo, Hi);
546 else if (Op.getValueType().isInteger())
547 GetExpandedInteger(Op, Lo, Hi);
549 GetExpandedFloat(Op, Lo, Hi);
552 /// GetSplitDestVTs - Compute the VTs needed for the low/hi parts of a type
553 /// which is split (or expanded) into two not necessarily identical pieces.
554 void GetSplitDestVTs(MVT InVT, MVT &LoVT, MVT &HiVT);
556 // Generic Result Splitting.
557 void SplitRes_MERGE_VALUES(SDNode *N, SDValue &Lo, SDValue &Hi);
558 void SplitRes_SELECT (SDNode *N, SDValue &Lo, SDValue &Hi);
559 void SplitRes_SELECT_CC (SDNode *N, SDValue &Lo, SDValue &Hi);
560 void SplitRes_UNDEF (SDNode *N, SDValue &Lo, SDValue &Hi);
562 //===--------------------------------------------------------------------===//
563 // Generic Expansion: LegalizeTypesGeneric.cpp
564 //===--------------------------------------------------------------------===//
566 // Legalization methods which only use that the illegal type is split into two
567 // identical types of half the size, and that the Lo/Hi part is stored first
568 // in memory on little/big-endian machines, followed by the Hi/Lo part. As
569 // such they can be used for expanding integers and floats.
571 void GetExpandedOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
572 if (Op.getValueType().isInteger())
573 GetExpandedInteger(Op, Lo, Hi);
575 GetExpandedFloat(Op, Lo, Hi);
578 // Generic Result Expansion.
579 void ExpandRes_BIT_CONVERT (SDNode *N, SDValue &Lo, SDValue &Hi);
580 void ExpandRes_BUILD_PAIR (SDNode *N, SDValue &Lo, SDValue &Hi);
581 void ExpandRes_EXTRACT_ELEMENT (SDNode *N, SDValue &Lo, SDValue &Hi);
582 void ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
583 void ExpandRes_NormalLoad (SDNode *N, SDValue &Lo, SDValue &Hi);
584 void ExpandRes_VAARG (SDNode *N, SDValue &Lo, SDValue &Hi);
586 // Generic Operand Expansion.
587 SDValue ExpandOp_BIT_CONVERT (SDNode *N);
588 SDValue ExpandOp_BUILD_VECTOR (SDNode *N);
589 SDValue ExpandOp_EXTRACT_ELEMENT(SDNode *N);
590 SDValue ExpandOp_NormalStore (SDNode *N, unsigned OpNo);
594 } // end namespace llvm.