LegalizeTypes.h revision fcd8e9e3a21efb32172a6395e8697889962067e1
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 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. 34/// 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. 39/// 40class VISIBILITY_HIDDEN DAGTypeLegalizer { 41 TargetLowering &TLI; 42 SelectionDAG &DAG; 43public: 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. 46 enum NodeIDFlags { 47 /// ReadyToProcess - All operands have been processed, so this node is ready 48 /// to be handled. 49 ReadyToProcess = 0, 50 51 /// NewNode - This is a new node that was created in the process of 52 /// legalizing some other node. 53 NewNode = -1, 54 55 /// Processed - This is a node that has already been processed. 56 Processed = -2 57 58 // 1+ - This is a node which has this many unlegalized operands. 59 }; 60private: 61 enum LegalizeAction { 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 }; 66 67 /// ValueTypeActions - This is a bitvector that contains two bits for each 68 /// simple value type, where the two bits correspond to the LegalizeAction 69 /// enum. This can be queried with "getTypeAction(VT)". 70 TargetLowering::ValueTypeActionImpl ValueTypeActions; 71 72 /// getTypeAction - Return how we should legalize values of this type, either 73 /// it is already legal or we need to expand it into multiple registers of 74 /// smaller integer type, or we need to promote it to a larger type. 75 LegalizeAction getTypeAction(MVT::ValueType VT) const { 76 return (LegalizeAction)ValueTypeActions.getTypeAction(VT); 77 } 78 79 /// isTypeLegal - Return true if this type is legal on this target. 80 /// 81 bool isTypeLegal(MVT::ValueType VT) const { 82 return getTypeAction(VT) == Legal; 83 } 84 85 /// PromotedNodes - For nodes that are below legal width, this map indicates 86 /// what promoted value to use. 87 DenseMap<SDOperand, SDOperand> PromotedNodes; 88 89 /// ExpandedNodes - For nodes that need to be expanded this map indicates 90 /// which operands are the expanded version of the input. 91 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > ExpandedNodes; 92 93 /// ScalarizedNodes - For nodes that are <1 x ty>, this map indicates the 94 /// scalar value of type 'ty' to use. 95 DenseMap<SDOperand, SDOperand> ScalarizedNodes; 96 97 /// SplitNodes - For nodes that need to be split this map indicates 98 /// which operands are the expanded version of the input. 99 DenseMap<SDOperand, std::pair<SDOperand, SDOperand> > SplitNodes; 100 101 /// ReplacedNodes - For nodes that have been replaced with another, 102 /// indicates the replacement node to use. 103 DenseMap<SDOperand, SDOperand> ReplacedNodes; 104 105 /// Worklist - This defines a worklist of nodes to process. In order to be 106 /// pushed onto this worklist, all operands of a node must have already been 107 /// processed. 108 SmallVector<SDNode*, 128> Worklist; 109 110public: 111 explicit DAGTypeLegalizer(SelectionDAG &dag) 112 : TLI(dag.getTargetLoweringInfo()), DAG(dag), 113 ValueTypeActions(TLI.getValueTypeActions()) { 114 assert(MVT::LAST_VALUETYPE <= 32 && 115 "Too many value types for ValueTypeActions to hold!"); 116 } 117 118 void run(); 119 120 /// ReanalyzeNodeFlags - Recompute the NodeID flags for the specified node, 121 /// adding it to the worklist if ready. 122 void ReanalyzeNodeFlags(SDNode *N) { 123 N->setNodeId(NewNode); 124 MarkNewNodes(N); 125 } 126 127private: 128 void MarkNewNodes(SDNode *N); 129 130 void ReplaceValueWith(SDOperand From, SDOperand To); 131 void ReplaceNodeWith(SDNode *From, SDNode *To); 132 133 void RemapNode(SDOperand &N); 134 135 // Common routines. 136 SDOperand CreateStackStoreLoad(SDOperand Op, MVT::ValueType DestVT); 137 SDOperand HandleMemIntrinsic(SDNode *N); 138 void SplitOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi); 139 140 //===--------------------------------------------------------------------===// 141 // Promotion Support: LegalizeTypesPromote.cpp 142 //===--------------------------------------------------------------------===// 143 144 SDOperand GetPromotedOp(SDOperand Op) { 145 SDOperand &PromotedOp = PromotedNodes[Op]; 146 RemapNode(PromotedOp); 147 assert(PromotedOp.Val && "Operand wasn't promoted?"); 148 return PromotedOp; 149 } 150 void SetPromotedOp(SDOperand Op, SDOperand Result); 151 152 /// GetPromotedZExtOp - Get a promoted operand and zero extend it to the final 153 /// size. 154 SDOperand GetPromotedZExtOp(SDOperand Op) { 155 MVT::ValueType OldVT = Op.getValueType(); 156 Op = GetPromotedOp(Op); 157 return DAG.getZeroExtendInReg(Op, OldVT); 158 } 159 160 // Result Promotion. 161 void PromoteResult(SDNode *N, unsigned ResNo); 162 SDOperand PromoteResult_UNDEF(SDNode *N); 163 SDOperand PromoteResult_Constant(SDNode *N); 164 SDOperand PromoteResult_TRUNCATE(SDNode *N); 165 SDOperand PromoteResult_INT_EXTEND(SDNode *N); 166 SDOperand PromoteResult_FP_ROUND(SDNode *N); 167 SDOperand PromoteResult_FP_TO_XINT(SDNode *N); 168 SDOperand PromoteResult_SETCC(SDNode *N); 169 SDOperand PromoteResult_LOAD(LoadSDNode *N); 170 SDOperand PromoteResult_SimpleIntBinOp(SDNode *N); 171 SDOperand PromoteResult_SDIV(SDNode *N); 172 SDOperand PromoteResult_UDIV(SDNode *N); 173 SDOperand PromoteResult_SHL(SDNode *N); 174 SDOperand PromoteResult_SRA(SDNode *N); 175 SDOperand PromoteResult_SRL(SDNode *N); 176 SDOperand PromoteResult_SELECT (SDNode *N); 177 SDOperand PromoteResult_SELECT_CC(SDNode *N); 178 179 // Operand Promotion. 180 bool PromoteOperand(SDNode *N, unsigned OperandNo); 181 SDOperand PromoteOperand_ANY_EXTEND(SDNode *N); 182 SDOperand PromoteOperand_ZERO_EXTEND(SDNode *N); 183 SDOperand PromoteOperand_SIGN_EXTEND(SDNode *N); 184 SDOperand PromoteOperand_TRUNCATE(SDNode *N); 185 SDOperand PromoteOperand_FP_EXTEND(SDNode *N); 186 SDOperand PromoteOperand_FP_ROUND(SDNode *N); 187 SDOperand PromoteOperand_INT_TO_FP(SDNode *N); 188 SDOperand PromoteOperand_SELECT(SDNode *N, unsigned OpNo); 189 SDOperand PromoteOperand_BRCOND(SDNode *N, unsigned OpNo); 190 SDOperand PromoteOperand_BR_CC(SDNode *N, unsigned OpNo); 191 SDOperand PromoteOperand_SETCC(SDNode *N, unsigned OpNo); 192 SDOperand PromoteOperand_STORE(StoreSDNode *N, unsigned OpNo); 193 194 void PromoteSetCCOperands(SDOperand &LHS,SDOperand &RHS, ISD::CondCode Code); 195 196 //===--------------------------------------------------------------------===// 197 // Expansion Support: LegalizeTypesExpand.cpp 198 //===--------------------------------------------------------------------===// 199 200 void GetExpandedOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi); 201 void SetExpandedOp(SDOperand Op, SDOperand Lo, SDOperand Hi); 202 203 // Result Expansion. 204 void ExpandResult(SDNode *N, unsigned ResNo); 205 void ExpandResult_UNDEF (SDNode *N, SDOperand &Lo, SDOperand &Hi); 206 void ExpandResult_Constant (SDNode *N, SDOperand &Lo, SDOperand &Hi); 207 void ExpandResult_BUILD_PAIR (SDNode *N, SDOperand &Lo, SDOperand &Hi); 208 void ExpandResult_MERGE_VALUES(SDNode *N, SDOperand &Lo, SDOperand &Hi); 209 void ExpandResult_ANY_EXTEND (SDNode *N, SDOperand &Lo, SDOperand &Hi); 210 void ExpandResult_ZERO_EXTEND(SDNode *N, SDOperand &Lo, SDOperand &Hi); 211 void ExpandResult_SIGN_EXTEND(SDNode *N, SDOperand &Lo, SDOperand &Hi); 212 void ExpandResult_BIT_CONVERT(SDNode *N, SDOperand &Lo, SDOperand &Hi); 213 void ExpandResult_SIGN_EXTEND_INREG(SDNode *N, SDOperand &Lo, SDOperand &Hi); 214 void ExpandResult_LOAD (LoadSDNode *N, SDOperand &Lo, SDOperand &Hi); 215 216 void ExpandResult_Logical (SDNode *N, SDOperand &Lo, SDOperand &Hi); 217 void ExpandResult_BSWAP (SDNode *N, SDOperand &Lo, SDOperand &Hi); 218 void ExpandResult_ADDSUB (SDNode *N, SDOperand &Lo, SDOperand &Hi); 219 void ExpandResult_ADDSUBC (SDNode *N, SDOperand &Lo, SDOperand &Hi); 220 void ExpandResult_ADDSUBE (SDNode *N, SDOperand &Lo, SDOperand &Hi); 221 void ExpandResult_SELECT (SDNode *N, SDOperand &Lo, SDOperand &Hi); 222 void ExpandResult_SELECT_CC (SDNode *N, SDOperand &Lo, SDOperand &Hi); 223 void ExpandResult_MUL (SDNode *N, SDOperand &Lo, SDOperand &Hi); 224 void ExpandResult_Shift (SDNode *N, SDOperand &Lo, SDOperand &Hi); 225 226 void ExpandShiftByConstant(SDNode *N, unsigned Amt, 227 SDOperand &Lo, SDOperand &Hi); 228 bool ExpandShiftWithKnownAmountBit(SDNode *N, SDOperand &Lo, SDOperand &Hi); 229 230 // Operand Expansion. 231 bool ExpandOperand(SDNode *N, unsigned OperandNo); 232 SDOperand ExpandOperand_TRUNCATE(SDNode *N); 233 SDOperand ExpandOperand_BIT_CONVERT(SDNode *N); 234 SDOperand ExpandOperand_UINT_TO_FP(SDOperand Source, MVT::ValueType DestTy); 235 SDOperand ExpandOperand_SINT_TO_FP(SDOperand Source, MVT::ValueType DestTy); 236 SDOperand ExpandOperand_EXTRACT_ELEMENT(SDNode *N); 237 SDOperand ExpandOperand_SETCC(SDNode *N); 238 SDOperand ExpandOperand_STORE(StoreSDNode *N, unsigned OpNo); 239 240 void ExpandSetCCOperands(SDOperand &NewLHS, SDOperand &NewRHS, 241 ISD::CondCode &CCCode); 242 243 //===--------------------------------------------------------------------===// 244 // Scalarization Support: LegalizeTypesScalarize.cpp 245 //===--------------------------------------------------------------------===// 246 247 SDOperand GetScalarizedOp(SDOperand Op) { 248 SDOperand &ScalarOp = ScalarizedNodes[Op]; 249 RemapNode(ScalarOp); 250 assert(ScalarOp.Val && "Operand wasn't scalarized?"); 251 return ScalarOp; 252 } 253 void SetScalarizedOp(SDOperand Op, SDOperand Result); 254 255 // Result Vector Scalarization: <1 x ty> -> ty. 256 void ScalarizeResult(SDNode *N, unsigned OpNo); 257 SDOperand ScalarizeRes_UNDEF(SDNode *N); 258 SDOperand ScalarizeRes_LOAD(LoadSDNode *N); 259 SDOperand ScalarizeRes_BinOp(SDNode *N); 260 SDOperand ScalarizeRes_UnaryOp(SDNode *N); 261 SDOperand ScalarizeRes_FPOWI(SDNode *N); 262 SDOperand ScalarizeRes_VECTOR_SHUFFLE(SDNode *N); 263 SDOperand ScalarizeRes_BIT_CONVERT(SDNode *N); 264 SDOperand ScalarizeRes_SELECT(SDNode *N); 265 266 // Operand Vector Scalarization: <1 x ty> -> ty. 267 bool ScalarizeOperand(SDNode *N, unsigned OpNo); 268 SDOperand ScalarizeOp_EXTRACT_VECTOR_ELT(SDNode *N, unsigned OpNo); 269 270 //===--------------------------------------------------------------------===// 271 // Vector Splitting Support: LegalizeTypesSplit.cpp 272 //===--------------------------------------------------------------------===// 273 274 void GetSplitOp(SDOperand Op, SDOperand &Lo, SDOperand &Hi); 275 void SetSplitOp(SDOperand Op, SDOperand Lo, SDOperand Hi); 276 277 // Result Vector Splitting: <128 x ty> -> 2 x <64 x ty>. 278 void SplitResult(SDNode *N, unsigned OpNo); 279 280 void SplitRes_UNDEF(SDNode *N, SDOperand &Lo, SDOperand &Hi); 281 void SplitRes_LOAD(LoadSDNode *N, SDOperand &Lo, SDOperand &Hi); 282 void SplitRes_BUILD_PAIR(SDNode *N, SDOperand &Lo, SDOperand &Hi); 283 void SplitRes_INSERT_VECTOR_ELT(SDNode *N, SDOperand &Lo, SDOperand &Hi); 284 void SplitRes_VECTOR_SHUFFLE(SDNode *N, SDOperand &Lo, SDOperand &Hi); 285 286 void SplitRes_BUILD_VECTOR(SDNode *N, SDOperand &Lo, SDOperand &Hi); 287 void SplitRes_CONCAT_VECTORS(SDNode *N, SDOperand &Lo, SDOperand &Hi); 288 void SplitRes_BIT_CONVERT(SDNode *N, SDOperand &Lo, SDOperand &Hi); 289 void SplitRes_UnOp(SDNode *N, SDOperand &Lo, SDOperand &Hi); 290 void SplitRes_BinOp(SDNode *N, SDOperand &Lo, SDOperand &Hi); 291 void SplitRes_FPOWI(SDNode *N, SDOperand &Lo, SDOperand &Hi); 292 void SplitRes_SELECT(SDNode *N, SDOperand &Lo, SDOperand &Hi); 293 294 // Operand Vector Scalarization: <128 x ty> -> 2 x <64 x ty>. 295 bool SplitOperand(SDNode *N, unsigned OpNo); 296 297 SDOperand SplitOp_STORE(StoreSDNode *N, unsigned OpNo); 298 SDOperand SplitOp_RET(SDNode *N, unsigned OpNo); 299}; 300 301} // end namespace llvm. 302 303#endif 304