LegalizeTypes.h revision e59416efb8472ee95c4500a94d2048c585faff6d 
1//===-- LegalizeTypes.h - Definition of the DAG Type Legalizer class ------===//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file defines the DAGTypeLegalizer class.  This is a private interface
11// shared between the code that implements the SelectionDAG::LegalizeTypes
12// method.
13//
14//===----------------------------------------------------------------------===//
15
16#ifndef SELECTIONDAG_LEGALIZETYPES_H
17#define SELECTIONDAG_LEGALIZETYPES_H
18
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"
25
26namespace llvm {
27
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.
33///
34class VISIBILITY_HIDDEN DAGTypeLegalizer {
35  TargetLowering &TLI;
36  SelectionDAG &DAG;
37public:
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.
40  enum NodeIdFlags {
41    /// ReadyToProcess - All operands have been processed, so this node is ready
42    /// to be handled.
43    ReadyToProcess = 0,
44
45    /// NewNode - This is a new node that was created in the process of
46    /// legalizing some other node.
47    NewNode = -1,
48
49    /// Processed - This is a node that has already been processed.
50    Processed = -2
51
52    // 1+ - This is a node which has this many unlegalized operands.
53  };
54private:
55  enum LegalizeAction {
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.
63  };
64
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;
69
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)) {
77    default:
78      assert(false && "Unknown legalize action!");
79    case TargetLowering::Legal:
80      return Legal;
81    case TargetLowering::Promote:
82      // Promote can mean
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)
85      if (!VT.isVector()) {
86        return PromoteInteger;
87      }
88      else {
89        // TODO: move widen code to LegalizeType
90        if (VT.getVectorNumElements() == 1) {
91          return ScalarizeVector;
92        } else {
93          return SplitVector;
94        }
95      }
96    case TargetLowering::Expand:
97      // Expand can mean
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()) {
101        if (VT.isInteger())
102          return ExpandInteger;
103        else if (VT.getSizeInBits() ==
104                 TLI.getTypeToTransformTo(VT).getSizeInBits())
105          return SoftenFloat;
106        else
107          return ExpandFloat;
108      } else if (VT.getVectorNumElements() == 1) {
109        return ScalarizeVector;
110      } else {
111        return SplitVector;
112      }
113    }
114  }
115
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;
119  }
120
121  /// IgnoreNodeResults - Pretend all of this node's results are legal.
122  bool IgnoreNodeResults(SDNode *N) const {
123    return N->getOpcode() == ISD::TargetConstant;
124  }
125
126  /// PromotedIntegers - For integer nodes that are below legal width, this map
127  /// indicates what promoted value to use.
128  DenseMap<SDValue, SDValue> PromotedIntegers;
129
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;
133
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;
137
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;
141
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;
145
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;
149
150  /// ReplacedValues - For values that have been replaced with another,
151  /// indicates the replacement value to use.
152  DenseMap<SDValue, SDValue> ReplacedValues;
153
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
156  /// processed.
157  SmallVector<SDNode*, 128> Worklist;
158
159public:
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!");
165  }
166
167  void run();
168
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);
173    AnalyzeNewNode(N);
174    // The node may have changed but we don't care.
175  }
176
177  void NoteDeletion(SDNode *Old, SDNode *New) {
178    ExpungeNode(Old);
179    ExpungeNode(New);
180    for (unsigned i = 0, e = Old->getNumValues(); i != e; ++i)
181      ReplacedValues[SDValue(Old, i)] = SDValue(New, i);
182  }
183
184private:
185  SDNode *AnalyzeNewNode(SDNode *N);
186  void AnalyzeNewValue(SDValue &Val);
187
188  void ReplaceValueWith(SDValue From, SDValue To);
189  void ReplaceNodeWith(SDNode *From, SDNode *To);
190
191  void RemapValue(SDValue &N);
192  void ExpungeNode(SDNode *N);
193
194  // Common routines.
195  SDValue CreateStackStoreLoad(SDValue Op, MVT DestVT);
196  SDValue MakeLibCall(RTLIB::Libcall LC, MVT RetVT,
197                      const SDValue *Ops, unsigned NumOps, bool isSigned);
198  SDValue LibCallify(RTLIB::Libcall LC, SDNode *N, bool isSigned);
199
200  SDValue BitConvertToInteger(SDValue Op);
201  SDValue JoinIntegers(SDValue Lo, SDValue Hi);
202  void SplitInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
203  void SplitInteger(SDValue Op, MVT LoVT, MVT HiVT,
204                    SDValue &Lo, SDValue &Hi);
205
206  SDValue GetVectorElementPointer(SDValue VecPtr, MVT EltVT, SDValue Index);
207
208  //===--------------------------------------------------------------------===//
209  // Integer Promotion Support: LegalizeIntegerTypes.cpp
210  //===--------------------------------------------------------------------===//
211
212  SDValue GetPromotedInteger(SDValue Op) {
213    SDValue &PromotedOp = PromotedIntegers[Op];
214    RemapValue(PromotedOp);
215    assert(PromotedOp.getNode() && "Operand wasn't promoted?");
216    return PromotedOp;
217  }
218  void SetPromotedInteger(SDValue Op, SDValue Result);
219
220  /// ZExtPromotedInteger - Get a promoted operand and zero extend it to the
221  /// final size.
222  SDValue ZExtPromotedInteger(SDValue Op) {
223    MVT OldVT = Op.getValueType();
224    Op = GetPromotedInteger(Op);
225    return DAG.getZeroExtendInReg(Op, OldVT);
226  }
227
228  // Integer Result Promotion.
229  void PromoteIntegerResult(SDNode *N, unsigned ResNo);
230  SDValue PromoteIntRes_AssertSext(SDNode *N);
231  SDValue PromoteIntRes_AssertZext(SDNode *N);
232  SDValue PromoteIntRes_Atomic1(AtomicSDNode *N);
233  SDValue PromoteIntRes_Atomic2(AtomicSDNode *N);
234  SDValue PromoteIntRes_BIT_CONVERT(SDNode *N);
235  SDValue PromoteIntRes_BSWAP(SDNode *N);
236  SDValue PromoteIntRes_BUILD_PAIR(SDNode *N);
237  SDValue PromoteIntRes_Constant(SDNode *N);
238  SDValue PromoteIntRes_CTLZ(SDNode *N);
239  SDValue PromoteIntRes_CTPOP(SDNode *N);
240  SDValue PromoteIntRes_CTTZ(SDNode *N);
241  SDValue PromoteIntRes_EXTRACT_VECTOR_ELT(SDNode *N);
242  SDValue PromoteIntRes_FP_TO_XINT(SDNode *N);
243  SDValue PromoteIntRes_INT_EXTEND(SDNode *N);
244  SDValue PromoteIntRes_LOAD(LoadSDNode *N);
245  SDValue PromoteIntRes_SDIV(SDNode *N);
246  SDValue PromoteIntRes_SELECT   (SDNode *N);
247  SDValue PromoteIntRes_SELECT_CC(SDNode *N);
248  SDValue PromoteIntRes_SETCC(SDNode *N);
249  SDValue PromoteIntRes_SHL(SDNode *N);
250  SDValue PromoteIntRes_SimpleIntBinOp(SDNode *N);
251  SDValue PromoteIntRes_SIGN_EXTEND_INREG(SDNode *N);
252  SDValue PromoteIntRes_SRA(SDNode *N);
253  SDValue PromoteIntRes_SRL(SDNode *N);
254  SDValue PromoteIntRes_TRUNCATE(SDNode *N);
255  SDValue PromoteIntRes_UDIV(SDNode *N);
256  SDValue PromoteIntRes_UNDEF(SDNode *N);
257  SDValue PromoteIntRes_VAARG(SDNode *N);
258
259  // Integer Operand Promotion.
260  bool PromoteIntegerOperand(SDNode *N, unsigned OperandNo);
261  SDValue PromoteIntOp_ANY_EXTEND(SDNode *N);
262  SDValue PromoteIntOp_BUILD_PAIR(SDNode *N);
263  SDValue PromoteIntOp_BR_CC(SDNode *N, unsigned OpNo);
264  SDValue PromoteIntOp_BRCOND(SDNode *N, unsigned OpNo);
265  SDValue PromoteIntOp_BUILD_VECTOR(SDNode *N);
266  SDValue PromoteIntOp_FP_EXTEND(SDNode *N);
267  SDValue PromoteIntOp_FP_ROUND(SDNode *N);
268  SDValue PromoteIntOp_INT_TO_FP(SDNode *N);
269  SDValue PromoteIntOp_INSERT_VECTOR_ELT(SDNode *N, unsigned OpNo);
270  SDValue PromoteIntOp_MEMBARRIER(SDNode *N);
271  SDValue PromoteIntOp_SELECT(SDNode *N, unsigned OpNo);
272  SDValue PromoteIntOp_SELECT_CC(SDNode *N, unsigned OpNo);
273  SDValue PromoteIntOp_SETCC(SDNode *N, unsigned OpNo);
274  SDValue PromoteIntOp_SIGN_EXTEND(SDNode *N);
275  SDValue PromoteIntOp_STORE(StoreSDNode *N, unsigned OpNo);
276  SDValue PromoteIntOp_TRUNCATE(SDNode *N);
277  SDValue PromoteIntOp_ZERO_EXTEND(SDNode *N);
278
279  void PromoteSetCCOperands(SDValue &LHS,SDValue &RHS, ISD::CondCode Code);
280
281  //===--------------------------------------------------------------------===//
282  // Integer Expansion Support: LegalizeIntegerTypes.cpp
283  //===--------------------------------------------------------------------===//
284
285  void GetExpandedInteger(SDValue Op, SDValue &Lo, SDValue &Hi);
286  void SetExpandedInteger(SDValue Op, SDValue Lo, SDValue Hi);
287
288  // Integer Result Expansion.
289  void ExpandIntegerResult(SDNode *N, unsigned ResNo);
290  void ExpandIntRes_ANY_EXTEND        (SDNode *N, SDValue &Lo, SDValue &Hi);
291  void ExpandIntRes_AssertSext        (SDNode *N, SDValue &Lo, SDValue &Hi);
292  void ExpandIntRes_AssertZext        (SDNode *N, SDValue &Lo, SDValue &Hi);
293  void ExpandIntRes_Constant          (SDNode *N, SDValue &Lo, SDValue &Hi);
294  void ExpandIntRes_CTLZ              (SDNode *N, SDValue &Lo, SDValue &Hi);
295  void ExpandIntRes_CTPOP             (SDNode *N, SDValue &Lo, SDValue &Hi);
296  void ExpandIntRes_CTTZ              (SDNode *N, SDValue &Lo, SDValue &Hi);
297  void ExpandIntRes_LOAD          (LoadSDNode *N, SDValue &Lo, SDValue &Hi);
298  void ExpandIntRes_SIGN_EXTEND       (SDNode *N, SDValue &Lo, SDValue &Hi);
299  void ExpandIntRes_SIGN_EXTEND_INREG (SDNode *N, SDValue &Lo, SDValue &Hi);
300  void ExpandIntRes_TRUNCATE          (SDNode *N, SDValue &Lo, SDValue &Hi);
301  void ExpandIntRes_ZERO_EXTEND       (SDNode *N, SDValue &Lo, SDValue &Hi);
302  void ExpandIntRes_FP_TO_SINT        (SDNode *N, SDValue &Lo, SDValue &Hi);
303  void ExpandIntRes_FP_TO_UINT        (SDNode *N, SDValue &Lo, SDValue &Hi);
304
305  void ExpandIntRes_Logical           (SDNode *N, SDValue &Lo, SDValue &Hi);
306  void ExpandIntRes_ADDSUB            (SDNode *N, SDValue &Lo, SDValue &Hi);
307  void ExpandIntRes_ADDSUBC           (SDNode *N, SDValue &Lo, SDValue &Hi);
308  void ExpandIntRes_ADDSUBE           (SDNode *N, SDValue &Lo, SDValue &Hi);
309  void ExpandIntRes_BSWAP             (SDNode *N, SDValue &Lo, SDValue &Hi);
310  void ExpandIntRes_MUL               (SDNode *N, SDValue &Lo, SDValue &Hi);
311  void ExpandIntRes_SDIV              (SDNode *N, SDValue &Lo, SDValue &Hi);
312  void ExpandIntRes_SREM              (SDNode *N, SDValue &Lo, SDValue &Hi);
313  void ExpandIntRes_UDIV              (SDNode *N, SDValue &Lo, SDValue &Hi);
314  void ExpandIntRes_UREM              (SDNode *N, SDValue &Lo, SDValue &Hi);
315  void ExpandIntRes_Shift             (SDNode *N, SDValue &Lo, SDValue &Hi);
316
317  void ExpandShiftByConstant(SDNode *N, unsigned Amt,
318                             SDValue &Lo, SDValue &Hi);
319  bool ExpandShiftWithKnownAmountBit(SDNode *N, SDValue &Lo, SDValue &Hi);
320
321  // Integer Operand Expansion.
322  bool ExpandIntegerOperand(SDNode *N, unsigned OperandNo);
323  SDValue ExpandIntOp_BIT_CONVERT(SDNode *N);
324  SDValue ExpandIntOp_BR_CC(SDNode *N);
325  SDValue ExpandIntOp_BUILD_VECTOR(SDNode *N);
326  SDValue ExpandIntOp_EXTRACT_ELEMENT(SDNode *N);
327  SDValue ExpandIntOp_SELECT_CC(SDNode *N);
328  SDValue ExpandIntOp_SETCC(SDNode *N);
329  SDValue ExpandIntOp_SINT_TO_FP(SDNode *N);
330  SDValue ExpandIntOp_STORE(StoreSDNode *N, unsigned OpNo);
331  SDValue ExpandIntOp_TRUNCATE(SDNode *N);
332  SDValue ExpandIntOp_UINT_TO_FP(SDNode *N);
333
334  void IntegerExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
335                                  ISD::CondCode &CCCode);
336
337  //===--------------------------------------------------------------------===//
338  // Float to Integer Conversion Support: LegalizeFloatTypes.cpp
339  //===--------------------------------------------------------------------===//
340
341  SDValue GetSoftenedFloat(SDValue Op) {
342    SDValue &SoftenedOp = SoftenedFloats[Op];
343    RemapValue(SoftenedOp);
344    assert(SoftenedOp.getNode() && "Operand wasn't converted to integer?");
345    return SoftenedOp;
346  }
347  void SetSoftenedFloat(SDValue Op, SDValue Result);
348
349  // Result Float to Integer Conversion.
350  void SoftenFloatResult(SDNode *N, unsigned OpNo);
351  SDValue SoftenFloatRes_BIT_CONVERT(SDNode *N);
352  SDValue SoftenFloatRes_BUILD_PAIR(SDNode *N);
353  SDValue SoftenFloatRes_ConstantFP(ConstantFPSDNode *N);
354  SDValue SoftenFloatRes_FABS(SDNode *N);
355  SDValue SoftenFloatRes_FADD(SDNode *N);
356  SDValue SoftenFloatRes_FCOPYSIGN(SDNode *N);
357  SDValue SoftenFloatRes_FDIV(SDNode *N);
358  SDValue SoftenFloatRes_FMUL(SDNode *N);
359  SDValue SoftenFloatRes_FP_EXTEND(SDNode *N);
360  SDValue SoftenFloatRes_FP_ROUND(SDNode *N);
361  SDValue SoftenFloatRes_FPOW(SDNode *N);
362  SDValue SoftenFloatRes_FPOWI(SDNode *N);
363  SDValue SoftenFloatRes_FSUB(SDNode *N);
364  SDValue SoftenFloatRes_LOAD(SDNode *N);
365  SDValue SoftenFloatRes_SELECT(SDNode *N);
366  SDValue SoftenFloatRes_SELECT_CC(SDNode *N);
367  SDValue SoftenFloatRes_SINT_TO_FP(SDNode *N);
368  SDValue SoftenFloatRes_UINT_TO_FP(SDNode *N);
369
370  // Operand Float to Integer Conversion.
371  bool SoftenFloatOperand(SDNode *N, unsigned OpNo);
372  SDValue SoftenFloatOp_BIT_CONVERT(SDNode *N);
373  SDValue SoftenFloatOp_BR_CC(SDNode *N);
374  SDValue SoftenFloatOp_FP_ROUND(SDNode *N);
375  SDValue SoftenFloatOp_FP_TO_SINT(SDNode *N);
376  SDValue SoftenFloatOp_FP_TO_UINT(SDNode *N);
377  SDValue SoftenFloatOp_SELECT_CC(SDNode *N);
378  SDValue SoftenFloatOp_SETCC(SDNode *N);
379  SDValue SoftenFloatOp_STORE(SDNode *N, unsigned OpNo);
380
381  void SoftenSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
382                           ISD::CondCode &CCCode);
383
384  //===--------------------------------------------------------------------===//
385  // Float Expansion Support: LegalizeFloatTypes.cpp
386  //===--------------------------------------------------------------------===//
387
388  void GetExpandedFloat(SDValue Op, SDValue &Lo, SDValue &Hi);
389  void SetExpandedFloat(SDValue Op, SDValue Lo, SDValue Hi);
390
391  // Float Result Expansion.
392  void ExpandFloatResult(SDNode *N, unsigned ResNo);
393  void ExpandFloatRes_ConstantFP(SDNode *N, SDValue &Lo, SDValue &Hi);
394  void ExpandFloatRes_FABS      (SDNode *N, SDValue &Lo, SDValue &Hi);
395  void ExpandFloatRes_FADD      (SDNode *N, SDValue &Lo, SDValue &Hi);
396  void ExpandFloatRes_FCEIL     (SDNode *N, SDValue &Lo, SDValue &Hi);
397  void ExpandFloatRes_FCOS      (SDNode *N, SDValue &Lo, SDValue &Hi);
398  void ExpandFloatRes_FDIV      (SDNode *N, SDValue &Lo, SDValue &Hi);
399  void ExpandFloatRes_FEXP      (SDNode *N, SDValue &Lo, SDValue &Hi);
400  void ExpandFloatRes_FEXP2     (SDNode *N, SDValue &Lo, SDValue &Hi);
401  void ExpandFloatRes_FFLOOR    (SDNode *N, SDValue &Lo, SDValue &Hi);
402  void ExpandFloatRes_FLOG      (SDNode *N, SDValue &Lo, SDValue &Hi);
403  void ExpandFloatRes_FLOG2     (SDNode *N, SDValue &Lo, SDValue &Hi);
404  void ExpandFloatRes_FLOG10    (SDNode *N, SDValue &Lo, SDValue &Hi);
405  void ExpandFloatRes_FMUL      (SDNode *N, SDValue &Lo, SDValue &Hi);
406  void ExpandFloatRes_FNEARBYINT(SDNode *N, SDValue &Lo, SDValue &Hi);
407  void ExpandFloatRes_FNEG      (SDNode *N, SDValue &Lo, SDValue &Hi);
408  void ExpandFloatRes_FP_EXTEND (SDNode *N, SDValue &Lo, SDValue &Hi);
409  void ExpandFloatRes_FPOW      (SDNode *N, SDValue &Lo, SDValue &Hi);
410  void ExpandFloatRes_FPOWI     (SDNode *N, SDValue &Lo, SDValue &Hi);
411  void ExpandFloatRes_FRINT     (SDNode *N, SDValue &Lo, SDValue &Hi);
412  void ExpandFloatRes_FSIN      (SDNode *N, SDValue &Lo, SDValue &Hi);
413  void ExpandFloatRes_FSQRT     (SDNode *N, SDValue &Lo, SDValue &Hi);
414  void ExpandFloatRes_FSUB      (SDNode *N, SDValue &Lo, SDValue &Hi);
415  void ExpandFloatRes_FTRUNC    (SDNode *N, SDValue &Lo, SDValue &Hi);
416  void ExpandFloatRes_LOAD      (SDNode *N, SDValue &Lo, SDValue &Hi);
417  void ExpandFloatRes_XINT_TO_FP(SDNode *N, SDValue &Lo, SDValue &Hi);
418
419  // Float Operand Expansion.
420  bool ExpandFloatOperand(SDNode *N, unsigned OperandNo);
421  SDValue ExpandFloatOp_BR_CC(SDNode *N);
422  SDValue ExpandFloatOp_FP_ROUND(SDNode *N);
423  SDValue ExpandFloatOp_FP_TO_SINT(SDNode *N);
424  SDValue ExpandFloatOp_FP_TO_UINT(SDNode *N);
425  SDValue ExpandFloatOp_SELECT_CC(SDNode *N);
426  SDValue ExpandFloatOp_SETCC(SDNode *N);
427  SDValue ExpandFloatOp_STORE(SDNode *N, unsigned OpNo);
428
429  void FloatExpandSetCCOperands(SDValue &NewLHS, SDValue &NewRHS,
430                                ISD::CondCode &CCCode);
431
432  //===--------------------------------------------------------------------===//
433  // Scalarization Support: LegalizeVectorTypes.cpp
434  //===--------------------------------------------------------------------===//
435
436  SDValue GetScalarizedVector(SDValue Op) {
437    SDValue &ScalarizedOp = ScalarizedVectors[Op];
438    RemapValue(ScalarizedOp);
439    assert(ScalarizedOp.getNode() && "Operand wasn't scalarized?");
440    return ScalarizedOp;
441  }
442  void SetScalarizedVector(SDValue Op, SDValue Result);
443
444  // Vector Result Scalarization: <1 x ty> -> ty.
445  void ScalarizeVectorResult(SDNode *N, unsigned OpNo);
446  SDValue ScalarizeVecRes_BinOp(SDNode *N);
447  SDValue ScalarizeVecRes_UnaryOp(SDNode *N);
448
449  SDValue ScalarizeVecRes_BIT_CONVERT(SDNode *N);
450  SDValue ScalarizeVecRes_EXTRACT_SUBVECTOR(SDNode *N);
451  SDValue ScalarizeVecRes_FPOWI(SDNode *N);
452  SDValue ScalarizeVecRes_INSERT_VECTOR_ELT(SDNode *N);
453  SDValue ScalarizeVecRes_LOAD(LoadSDNode *N);
454  SDValue ScalarizeVecRes_SELECT(SDNode *N);
455  SDValue ScalarizeVecRes_SELECT_CC(SDNode *N);
456  SDValue ScalarizeVecRes_UNDEF(SDNode *N);
457  SDValue ScalarizeVecRes_VECTOR_SHUFFLE(SDNode *N);
458  SDValue ScalarizeVecRes_VSETCC(SDNode *N);
459
460  // Vector Operand Scalarization: <1 x ty> -> ty.
461  bool ScalarizeVectorOperand(SDNode *N, unsigned OpNo);
462  SDValue ScalarizeVecOp_BIT_CONVERT(SDNode *N);
463  SDValue ScalarizeVecOp_CONCAT_VECTORS(SDNode *N);
464  SDValue ScalarizeVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
465  SDValue ScalarizeVecOp_STORE(StoreSDNode *N, unsigned OpNo);
466
467  //===--------------------------------------------------------------------===//
468  // Vector Splitting Support: LegalizeVectorTypes.cpp
469  //===--------------------------------------------------------------------===//
470
471  void GetSplitVector(SDValue Op, SDValue &Lo, SDValue &Hi);
472  void SetSplitVector(SDValue Op, SDValue Lo, SDValue Hi);
473
474  // Vector Result Splitting: <128 x ty> -> 2 x <64 x ty>.
475  void SplitVectorResult(SDNode *N, unsigned OpNo);
476  void SplitVecRes_BinOp(SDNode *N, SDValue &Lo, SDValue &Hi);
477  void SplitVecRes_UnaryOp(SDNode *N, SDValue &Lo, SDValue &Hi);
478
479  void SplitVecRes_BIT_CONVERT(SDNode *N, SDValue &Lo, SDValue &Hi);
480  void SplitVecRes_BUILD_PAIR(SDNode *N, SDValue &Lo, SDValue &Hi);
481  void SplitVecRes_BUILD_VECTOR(SDNode *N, SDValue &Lo, SDValue &Hi);
482  void SplitVecRes_CONCAT_VECTORS(SDNode *N, SDValue &Lo, SDValue &Hi);
483  void SplitVecRes_FPOWI(SDNode *N, SDValue &Lo, SDValue &Hi);
484  void SplitVecRes_INSERT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
485  void SplitVecRes_LOAD(LoadSDNode *N, SDValue &Lo, SDValue &Hi);
486  void SplitVecRes_UNDEF(SDNode *N, SDValue &Lo, SDValue &Hi);
487  void SplitVecRes_VECTOR_SHUFFLE(SDNode *N, SDValue &Lo, SDValue &Hi);
488  void SplitVecRes_VSETCC(SDNode *N, SDValue &Lo, SDValue &Hi);
489
490  // Vector Operand Splitting: <128 x ty> -> 2 x <64 x ty>.
491  bool SplitVectorOperand(SDNode *N, unsigned OpNo);
492  SDValue SplitVecOp_UnaryOp(SDNode *N);
493
494  SDValue SplitVecOp_BIT_CONVERT(SDNode *N);
495  SDValue SplitVecOp_EXTRACT_SUBVECTOR(SDNode *N);
496  SDValue SplitVecOp_EXTRACT_VECTOR_ELT(SDNode *N);
497  SDValue SplitVecOp_STORE(StoreSDNode *N, unsigned OpNo);
498  SDValue SplitVecOp_VECTOR_SHUFFLE(SDNode *N, unsigned OpNo);
499
500  //===--------------------------------------------------------------------===//
501  // Generic Splitting: LegalizeTypesGeneric.cpp
502  //===--------------------------------------------------------------------===//
503
504  // Legalization methods which only use that the illegal type is split into two
505  // not necessarily identical types.  As such they can be used for splitting
506  // vectors and expanding integers and floats.
507
508  void GetSplitOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
509    if (Op.getValueType().isVector())
510      GetSplitVector(Op, Lo, Hi);
511    else if (Op.getValueType().isInteger())
512      GetExpandedInteger(Op, Lo, Hi);
513    else
514      GetExpandedFloat(Op, Lo, Hi);
515  }
516
517  /// GetSplitDestVTs - Compute the VTs needed for the low/hi parts of a type
518  /// which is split (or expanded) into two not necessarily identical pieces.
519  void GetSplitDestVTs(MVT InVT, MVT &LoVT, MVT &HiVT);
520
521  // Generic Result Splitting.
522  void SplitRes_MERGE_VALUES(SDNode *N, SDValue &Lo, SDValue &Hi);
523  void SplitRes_SELECT      (SDNode *N, SDValue &Lo, SDValue &Hi);
524  void SplitRes_SELECT_CC   (SDNode *N, SDValue &Lo, SDValue &Hi);
525  void SplitRes_UNDEF       (SDNode *N, SDValue &Lo, SDValue &Hi);
526
527  //===--------------------------------------------------------------------===//
528  // Generic Expansion: LegalizeTypesGeneric.cpp
529  //===--------------------------------------------------------------------===//
530
531  // Legalization methods which only use that the illegal type is split into two
532  // identical types of half the size, and that the Lo/Hi part is stored first
533  // in memory on little/big-endian machines, followed by the Hi/Lo part.  As
534  // such they can be used for expanding integers and floats.
535
536  void GetExpandedOp(SDValue Op, SDValue &Lo, SDValue &Hi) {
537    if (Op.getValueType().isInteger())
538      GetExpandedInteger(Op, Lo, Hi);
539    else
540      GetExpandedFloat(Op, Lo, Hi);
541  }
542
543  // Generic Result Expansion.
544  void ExpandRes_BIT_CONVERT       (SDNode *N, SDValue &Lo, SDValue &Hi);
545  void ExpandRes_BUILD_PAIR        (SDNode *N, SDValue &Lo, SDValue &Hi);
546  void ExpandRes_EXTRACT_ELEMENT   (SDNode *N, SDValue &Lo, SDValue &Hi);
547  void ExpandRes_EXTRACT_VECTOR_ELT(SDNode *N, SDValue &Lo, SDValue &Hi);
548  void ExpandRes_NormalLoad        (SDNode *N, SDValue &Lo, SDValue &Hi);
549  void ExpandRes_VAARG             (SDNode *N, SDValue &Lo, SDValue &Hi);
550
551  // Generic Operand Expansion.
552  SDValue ExpandOp_BIT_CONVERT    (SDNode *N);
553  SDValue ExpandOp_BUILD_VECTOR   (SDNode *N);
554  SDValue ExpandOp_EXTRACT_ELEMENT(SDNode *N);
555  SDValue ExpandOp_NormalStore    (SDNode *N, unsigned OpNo);
556
557};
558
559} // end namespace llvm.
560
561#endif
562