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 Promote, // This type should be executed in a larger type.
64 Expand, // This type should be split into two types of half the size.
65 Scalarize, // Replace this one-element vector type with its element type.
66 Split // This vector type should be split into smaller vectors.
69 /// ValueTypeActions - This is a bitvector that contains two bits for each
70 /// simple value type, where the two bits correspond to the LegalizeAction
71 /// enum from TargetLowering. This can be queried with "getTypeAction(VT)".
72 TargetLowering::ValueTypeActionImpl ValueTypeActions;
74 /// getTypeAction - Return how we should legalize values of this type, either
75 /// it is already legal, or we need to promote it to a larger integer type, or
76 /// we need to expand it into multiple registers of a smaller integer type, or
77 /// we need to scalarize a one-element vector type into the element type, or
78 /// we need to split a vector type into smaller vector types.
79 LegalizeAction getTypeAction(MVT::ValueType VT) const {
80 switch (ValueTypeActions.getTypeAction(VT)) {
82 assert(false && "Unknown legalize action!");
83 case TargetLowering::Legal:
85 case TargetLowering::Promote:
87 case TargetLowering::Expand:
88 // Expand can mean 1) split integer in half 2) scalarize single-element
89 // vector 3) split vector in two.
90 if (!MVT::isVector(VT))
92 else if (MVT::getVectorNumElements(VT) == 1)
99 /// isTypeLegal - Return true if this type is legal on this target.
100 bool isTypeLegal(MVT::ValueType VT) const {
101 return ValueTypeActions.getTypeAction(VT) == TargetLowering::Legal;
104 /// PromotedNodes - For nodes that are below legal width, this map indicates
105 /// what promoted value to use.
106 DenseMap<SDOperand, SDOperand> PromotedNodes;
108 /// ExpandedNodes - For nodes that need to be expanded this map indicates
109 /// which operands are the expanded version of the input.
110 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes;
112 /// ScalarizedNodes - For nodes that are <1 x ty>, this map indicates the
113 /// scalar value of type 'ty' to use.
114 DenseMap<SDOperand, SDOperand> ScalarizedNodes;
116 /// SplitNodes - For nodes that need to be split this map indicates
117 /// which operands are the expanded version of the input.
118 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > SplitNodes;
120 /// ReplacedNodes - For nodes that have been replaced with another,
121 /// indicates the replacement node to use.
122 DenseMap<SDOperand, SDOperand> ReplacedNodes;
124 /// Worklist - This defines a worklist of nodes to process. In order to be
125 /// pushed onto this worklist, all operands of a node must have already been
127 SmallVector<SDNode*, 128> Worklist;
130 explicit DAGTypeLegalizer(SelectionDAG &dag)
131 : TLI(dag.getTargetLoweringInfo()), DAG(dag),
132 ValueTypeActions(TLI.getValueTypeActions()) {
133 assert(MVT::LAST_VALUETYPE <= 32 &&
134 "Too many value types for ValueTypeActions to hold!");
139 /// ReanalyzeNode - Recompute the NodeID and correct processed operands
140 /// for the specified node, adding it to the worklist if ready.
141 void ReanalyzeNode(SDNode *N) {
142 N->setNodeId(NewNode);
147 void AnalyzeNewNode(SDNode *&N);
149 void ReplaceValueWith(SDOperand From, SDOperand To);
150 void ReplaceNodeWith(SDNode *From, SDNode *To);
152 void RemapNode(SDOperand &N);
155 SDOperand CreateStackStoreLoad(SDOperand Op, MVT::ValueType DestVT);
156 SDOperand HandleMemIntrinsic(SDNode *N);
157 SDOperand JoinIntegers(SDOperand Lo, SDOperand Hi);
158 void SplitInteger(SDOperand Op, SDOperand &Lo, SDOperand &Hi);
159 void SplitInteger(SDOperand Op, MVT::ValueType LoVT, MVT::ValueType HiVT,
160 SDOperand &Lo, SDOperand &Hi);
162 //===--------------------------------------------------------------------===//
163 // Promotion Support: LegalizeTypesPromote.cpp
164 //===--------------------------------------------------------------------===//
166 SDOperand GetPromotedOp(SDOperand Op) {
167 SDOperand &PromotedOp = PromotedNodes[Op];
168 RemapNode(PromotedOp);
169 assert(PromotedOp.Val && "Operand wasn't promoted?");
172 void SetPromotedOp(SDOperand Op, SDOperand Result);
174 /// GetPromotedZExtOp - Get a promoted operand and zero extend it to the final
176 SDOperand GetPromotedZExtOp(SDOperand Op) {
177 MVT::ValueType OldVT = Op.getValueType();
178 Op = GetPromotedOp(Op);
179 return DAG.getZeroExtendInReg(Op, OldVT);
183 void PromoteResult(SDNode *N, unsigned ResNo);
184 SDOperand PromoteResult_BIT_CONVERT(SDNode *N);
185 SDOperand PromoteResult_BUILD_PAIR(SDNode *N);
186 SDOperand PromoteResult_Constant(SDNode *N);
187 SDOperand PromoteResult_CTLZ(SDNode *N);
188 SDOperand PromoteResult_CTPOP(SDNode *N);
189 SDOperand PromoteResult_CTTZ(SDNode *N);
190 SDOperand PromoteResult_EXTRACT_VECTOR_ELT(SDNode *N);
191 SDOperand PromoteResult_FP_ROUND(SDNode *N);
192 SDOperand PromoteResult_FP_TO_XINT(SDNode *N);
193 SDOperand PromoteResult_INT_EXTEND(SDNode *N);
194 SDOperand PromoteResult_LOAD(LoadSDNode *N);
195 SDOperand PromoteResult_SDIV(SDNode *N);
196 SDOperand PromoteResult_SELECT (SDNode *N);
197 SDOperand PromoteResult_SELECT_CC(SDNode *N);
198 SDOperand PromoteResult_SETCC(SDNode *N);
199 SDOperand PromoteResult_SHL(SDNode *N);
200 SDOperand PromoteResult_SimpleIntBinOp(SDNode *N);
201 SDOperand PromoteResult_SRA(SDNode *N);
202 SDOperand PromoteResult_SRL(SDNode *N);
203 SDOperand PromoteResult_TRUNCATE(SDNode *N);
204 SDOperand PromoteResult_UDIV(SDNode *N);
205 SDOperand PromoteResult_UNDEF(SDNode *N);
207 // Operand Promotion.
208 bool PromoteOperand(SDNode *N, unsigned OperandNo);
209 SDOperand PromoteOperand_ANY_EXTEND(SDNode *N);
210 SDOperand PromoteOperand_BUILD_PAIR(SDNode *N);
211 SDOperand PromoteOperand_BR_CC(SDNode *N, unsigned OpNo);
212 SDOperand PromoteOperand_BRCOND(SDNode *N, unsigned OpNo);
213 SDOperand PromoteOperand_BUILD_VECTOR(SDNode *N);
214 SDOperand PromoteOperand_FP_EXTEND(SDNode *N);
215 SDOperand PromoteOperand_FP_ROUND(SDNode *N);
216 SDOperand PromoteOperand_INT_TO_FP(SDNode *N);
217 SDOperand PromoteOperand_INSERT_VECTOR_ELT(SDNode *N, unsigned OpNo);
218 SDOperand PromoteOperand_MEMBARRIER(SDNode *N);
219 SDOperand PromoteOperand_RET(SDNode *N, unsigned OpNo);
220 SDOperand PromoteOperand_SELECT(SDNode *N, unsigned OpNo);
221 SDOperand PromoteOperand_SETCC(SDNode *N, unsigned OpNo);
222 SDOperand PromoteOperand_SIGN_EXTEND(SDNode *N);
223 SDOperand PromoteOperand_STORE(StoreSDNode *N, unsigned OpNo);
224 SDOperand PromoteOperand_TRUNCATE(SDNode *N);
225 SDOperand PromoteOperand_ZERO_EXTEND(SDNode *N);
227 void PromoteSetCCOperands(SDOperand &LHS,SDOperand &RHS, ISD::CondCode Code);
229 //===--------------------------------------------------------------------===//
230 // Expansion Support: LegalizeTypesExpand.cpp
231 //===--------------------------------------------------------------------===//
233 void GetExpandedOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi);
234 void SetExpandedOp(SDOperand Op, SDOperand Lo, SDOperand Hi);
237 void ExpandResult(SDNode *N, unsigned ResNo);
238 void ExpandResult_ANY_EXTEND (SDNode *N, SDOperand &Lo, SDOperand &Hi);
239 void ExpandResult_AssertZext (SDNode *N, SDOperand &Lo, SDOperand &Hi);
240 void ExpandResult_BIT_CONVERT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
241 void ExpandResult_BUILD_PAIR (SDNode *N, SDOperand &Lo, SDOperand &Hi);
242 void ExpandResult_Constant (SDNode *N, SDOperand &Lo, SDOperand &Hi);
243 void ExpandResult_CTLZ (SDNode *N, SDOperand &Lo, SDOperand &Hi);
244 void ExpandResult_CTPOP (SDNode *N, SDOperand &Lo, SDOperand &Hi);
245 void ExpandResult_CTTZ (SDNode *N, SDOperand &Lo, SDOperand &Hi);
246 void ExpandResult_EXTRACT_VECTOR_ELT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
247 void ExpandResult_LOAD (LoadSDNode *N, SDOperand &Lo, SDOperand &Hi);
248 void ExpandResult_MERGE_VALUES(SDNode *N, SDOperand &Lo, SDOperand &Hi);
249 void ExpandResult_SIGN_EXTEND(SDNode *N, SDOperand &Lo, SDOperand &Hi);
250 void ExpandResult_SIGN_EXTEND_INREG(SDNode *N, SDOperand &Lo, SDOperand &Hi);
251 void ExpandResult_TRUNCATE (SDNode *N, SDOperand &Lo, SDOperand &Hi);
252 void ExpandResult_UNDEF (SDNode *N, SDOperand &Lo, SDOperand &Hi);
253 void ExpandResult_ZERO_EXTEND(SDNode *N, SDOperand &Lo, SDOperand &Hi);
255 void ExpandResult_Logical (SDNode *N, SDOperand &Lo, SDOperand &Hi);
256 void ExpandResult_BSWAP (SDNode *N, SDOperand &Lo, SDOperand &Hi);
257 void ExpandResult_ADDSUB (SDNode *N, SDOperand &Lo, SDOperand &Hi);
258 void ExpandResult_ADDSUBC (SDNode *N, SDOperand &Lo, SDOperand &Hi);
259 void ExpandResult_ADDSUBE (SDNode *N, SDOperand &Lo, SDOperand &Hi);
260 void ExpandResult_SELECT (SDNode *N, SDOperand &Lo, SDOperand &Hi);
261 void ExpandResult_SELECT_CC (SDNode *N, SDOperand &Lo, SDOperand &Hi);
262 void ExpandResult_MUL (SDNode *N, SDOperand &Lo, SDOperand &Hi);
263 void ExpandResult_Shift (SDNode *N, SDOperand &Lo, SDOperand &Hi);
265 void ExpandShiftByConstant(SDNode *N, unsigned Amt,
266 SDOperand &Lo, SDOperand &Hi);
267 bool ExpandShiftWithKnownAmountBit(SDNode *N, SDOperand &Lo, SDOperand &Hi);
269 // Operand Expansion.
270 bool ExpandOperand(SDNode *N, unsigned OperandNo);
271 SDOperand ExpandOperand_BIT_CONVERT(SDNode *N);
272 SDOperand ExpandOperand_BR_CC(SDNode *N);
273 SDOperand ExpandOperand_BUILD_VECTOR(SDNode *N);
274 SDOperand ExpandOperand_EXTRACT_ELEMENT(SDNode *N);
275 SDOperand ExpandOperand_SETCC(SDNode *N);
276 SDOperand ExpandOperand_SINT_TO_FP(SDOperand Source, MVT::ValueType DestTy);
277 SDOperand ExpandOperand_STORE(StoreSDNode *N, unsigned OpNo);
278 SDOperand ExpandOperand_TRUNCATE(SDNode *N);
279 SDOperand ExpandOperand_UINT_TO_FP(SDOperand Source, MVT::ValueType DestTy);
281 void ExpandSetCCOperands(SDOperand &NewLHS, SDOperand &NewRHS,
282 ISD::CondCode &CCCode);
284 //===--------------------------------------------------------------------===//
285 // Scalarization Support: LegalizeTypesScalarize.cpp
286 //===--------------------------------------------------------------------===//
288 SDOperand GetScalarizedOp(SDOperand Op) {
289 SDOperand &ScalarOp = ScalarizedNodes[Op];
291 assert(ScalarOp.Val && "Operand wasn't scalarized?");
294 void SetScalarizedOp(SDOperand Op, SDOperand Result);
296 // Result Vector Scalarization: <1 x ty> -> ty.
297 void ScalarizeResult(SDNode *N, unsigned OpNo);
298 SDOperand ScalarizeRes_BinOp(SDNode *N);
299 SDOperand ScalarizeRes_UnaryOp(SDNode *N);
301 SDOperand ScalarizeRes_BIT_CONVERT(SDNode *N);
302 SDOperand ScalarizeRes_FPOWI(SDNode *N);
303 SDOperand ScalarizeRes_INSERT_VECTOR_ELT(SDNode *N);
304 SDOperand ScalarizeRes_LOAD(LoadSDNode *N);
305 SDOperand ScalarizeRes_SELECT(SDNode *N);
306 SDOperand ScalarizeRes_UNDEF(SDNode *N);
307 SDOperand ScalarizeRes_VECTOR_SHUFFLE(SDNode *N);
309 // Operand Vector Scalarization: <1 x ty> -> ty.
310 bool ScalarizeOperand(SDNode *N, unsigned OpNo);
311 SDOperand ScalarizeOp_BIT_CONVERT(SDNode *N);
312 SDOperand ScalarizeOp_EXTRACT_VECTOR_ELT(SDNode *N);
313 SDOperand ScalarizeOp_STORE(StoreSDNode *N, unsigned OpNo);
315 //===--------------------------------------------------------------------===//
316 // Vector Splitting Support: LegalizeTypesSplit.cpp
317 //===--------------------------------------------------------------------===//
319 void GetSplitOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi);
320 void SetSplitOp(SDOperand Op, SDOperand Lo, SDOperand Hi);
322 // Result Vector Splitting: <128 x ty> -> 2 x <64 x ty>.
323 void SplitResult(SDNode *N, unsigned OpNo);
325 void SplitRes_UNDEF(SDNode *N, SDOperand &Lo, SDOperand &Hi);
326 void SplitRes_LOAD(LoadSDNode *N, SDOperand &Lo, SDOperand &Hi);
327 void SplitRes_BUILD_PAIR(SDNode *N, SDOperand &Lo, SDOperand &Hi);
328 void SplitRes_INSERT_VECTOR_ELT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
329 void SplitRes_VECTOR_SHUFFLE(SDNode *N, SDOperand &Lo, SDOperand &Hi);
331 void SplitRes_BUILD_VECTOR(SDNode *N, SDOperand &Lo, SDOperand &Hi);
332 void SplitRes_CONCAT_VECTORS(SDNode *N, SDOperand &Lo, SDOperand &Hi);
333 void SplitRes_BIT_CONVERT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
334 void SplitRes_UnOp(SDNode *N, SDOperand &Lo, SDOperand &Hi);
335 void SplitRes_BinOp(SDNode *N, SDOperand &Lo, SDOperand &Hi);
336 void SplitRes_FPOWI(SDNode *N, SDOperand &Lo, SDOperand &Hi);
337 void SplitRes_SELECT(SDNode *N, SDOperand &Lo, SDOperand &Hi);
339 // Operand Vector Scalarization: <128 x ty> -> 2 x <64 x ty>.
340 bool SplitOperand(SDNode *N, unsigned OpNo);
342 SDOperand SplitOp_BIT_CONVERT(SDNode *N);
343 SDOperand SplitOp_EXTRACT_SUBVECTOR(SDNode *N);
344 SDOperand SplitOp_EXTRACT_VECTOR_ELT(SDNode *N);
345 SDOperand SplitOp_RET(SDNode *N, unsigned OpNo);
346 SDOperand SplitOp_STORE(StoreSDNode *N, unsigned OpNo);
347 SDOperand SplitOp_VECTOR_SHUFFLE(SDNode *N, unsigned OpNo);
350 } // end namespace llvm.