1 // llvm/Target/TargetTransformImpl.cpp - Target Loop Trans Info ---*- C++ -*-=//
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 #include "llvm/Target/TargetTransformImpl.h"
11 #include "llvm/Target/TargetLowering.h"
16 //===----------------------------------------------------------------------===//
18 // Calls used by scalar transformations.
20 //===----------------------------------------------------------------------===//
22 bool ScalarTargetTransformImpl::isLegalAddImmediate(int64_t imm) const {
23 return TLI->isLegalAddImmediate(imm);
26 bool ScalarTargetTransformImpl::isLegalICmpImmediate(int64_t imm) const {
27 return TLI->isLegalICmpImmediate(imm);
30 bool ScalarTargetTransformImpl::isLegalAddressingMode(const AddrMode &AM,
32 return TLI->isLegalAddressingMode(AM, Ty);
35 bool ScalarTargetTransformImpl::isTruncateFree(Type *Ty1, Type *Ty2) const {
36 return TLI->isTruncateFree(Ty1, Ty2);
39 bool ScalarTargetTransformImpl::isTypeLegal(Type *Ty) const {
40 EVT T = TLI->getValueType(Ty);
41 return TLI->isTypeLegal(T);
44 unsigned ScalarTargetTransformImpl::getJumpBufAlignment() const {
45 return TLI->getJumpBufAlignment();
48 unsigned ScalarTargetTransformImpl::getJumpBufSize() const {
49 return TLI->getJumpBufSize();
52 bool ScalarTargetTransformImpl::shouldBuildLookupTables() const {
53 return TLI->supportJumpTables() &&
54 (TLI->isOperationLegalOrCustom(ISD::BR_JT, MVT::Other) ||
55 TLI->isOperationLegalOrCustom(ISD::BRIND, MVT::Other));
58 //===----------------------------------------------------------------------===//
60 // Calls used by the vectorizers.
62 //===----------------------------------------------------------------------===//
63 int VectorTargetTransformImpl::InstructionOpcodeToISD(unsigned Opcode) const {
64 enum InstructionOpcodes {
65 #define HANDLE_INST(NUM, OPCODE, CLASS) OPCODE = NUM,
66 #define LAST_OTHER_INST(NUM) InstructionOpcodesCount = NUM
67 #include "llvm/Instruction.def"
69 switch (static_cast<InstructionOpcodes>(Opcode)) {
72 case Switch: return 0;
73 case IndirectBr: return 0;
74 case Invoke: return 0;
75 case Resume: return 0;
76 case Unreachable: return 0;
77 case Add: return ISD::ADD;
78 case FAdd: return ISD::FADD;
79 case Sub: return ISD::SUB;
80 case FSub: return ISD::FSUB;
81 case Mul: return ISD::MUL;
82 case FMul: return ISD::FMUL;
83 case UDiv: return ISD::UDIV;
84 case SDiv: return ISD::UDIV;
85 case FDiv: return ISD::FDIV;
86 case URem: return ISD::UREM;
87 case SRem: return ISD::SREM;
88 case FRem: return ISD::FREM;
89 case Shl: return ISD::SHL;
90 case LShr: return ISD::SRL;
91 case AShr: return ISD::SRA;
92 case And: return ISD::AND;
93 case Or: return ISD::OR;
94 case Xor: return ISD::XOR;
95 case Alloca: return 0;
96 case Load: return ISD::LOAD;
97 case Store: return ISD::STORE;
98 case GetElementPtr: return 0;
100 case AtomicCmpXchg: return 0;
101 case AtomicRMW: return 0;
102 case Trunc: return ISD::TRUNCATE;
103 case ZExt: return ISD::ZERO_EXTEND;
104 case SExt: return ISD::SIGN_EXTEND;
105 case FPToUI: return ISD::FP_TO_UINT;
106 case FPToSI: return ISD::FP_TO_SINT;
107 case UIToFP: return ISD::UINT_TO_FP;
108 case SIToFP: return ISD::SINT_TO_FP;
109 case FPTrunc: return ISD::FP_ROUND;
110 case FPExt: return ISD::FP_EXTEND;
111 case PtrToInt: return ISD::BITCAST;
112 case IntToPtr: return ISD::BITCAST;
113 case BitCast: return ISD::BITCAST;
114 case ICmp: return ISD::SETCC;
115 case FCmp: return ISD::SETCC;
118 case Select: return ISD::SELECT;
119 case UserOp1: return 0;
120 case UserOp2: return 0;
121 case VAArg: return 0;
122 case ExtractElement: return ISD::EXTRACT_VECTOR_ELT;
123 case InsertElement: return ISD::INSERT_VECTOR_ELT;
124 case ShuffleVector: return ISD::VECTOR_SHUFFLE;
125 case ExtractValue: return ISD::MERGE_VALUES;
126 case InsertValue: return ISD::MERGE_VALUES;
127 case LandingPad: return 0;
130 llvm_unreachable("Unknown instruction type encountered!");
133 std::pair<unsigned, MVT>
134 VectorTargetTransformImpl::getTypeLegalizationCost(Type *Ty) const {
135 LLVMContext &C = Ty->getContext();
136 EVT MTy = TLI->getValueType(Ty);
139 // We keep legalizing the type until we find a legal kind. We assume that
140 // the only operation that costs anything is the split. After splitting
141 // we need to handle two types.
143 TargetLowering::LegalizeKind LK = TLI->getTypeConversion(C, MTy);
145 if (LK.first == TargetLowering::TypeLegal)
146 return std::make_pair(Cost, MTy.getSimpleVT());
148 if (LK.first == TargetLowering::TypeSplitVector ||
149 LK.first == TargetLowering::TypeExpandInteger)
152 // Keep legalizing the type.
158 VectorTargetTransformImpl::getScalarizationOverhead(Type *Ty,
160 bool Extract) const {
161 assert (Ty->isVectorTy() && "Can only scalarize vectors");
164 for (int i = 0, e = Ty->getVectorNumElements(); i < e; ++i) {
166 Cost += getVectorInstrCost(Instruction::InsertElement, Ty, i);
168 Cost += getVectorInstrCost(Instruction::ExtractElement, Ty, i);
174 unsigned VectorTargetTransformImpl::getArithmeticInstrCost(unsigned Opcode,
176 // Check if any of the operands are vector operands.
177 int ISD = InstructionOpcodeToISD(Opcode);
178 assert(ISD && "Invalid opcode");
180 std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Ty);
182 if (TLI->isOperationLegalOrPromote(ISD, LT.second)) {
183 // The operation is legal. Assume it costs 1.
184 // If the type is split to multiple registers, assume that thre is some
186 // TODO: Once we have extract/insert subvector cost we need to use them.
192 if (!TLI->isOperationExpand(ISD, LT.second)) {
193 // If the operation is custom lowered then assume
194 // thare the code is twice as expensive.
198 // Else, assume that we need to scalarize this op.
199 if (Ty->isVectorTy()) {
200 unsigned Num = Ty->getVectorNumElements();
201 unsigned Cost = getArithmeticInstrCost(Opcode, Ty->getScalarType());
202 // return the cost of multiple scalar invocation plus the cost of inserting
203 // and extracting the values.
204 return getScalarizationOverhead(Ty, true, true) + Num * Cost;
207 // We don't know anything about this scalar instruction.
211 unsigned VectorTargetTransformImpl::getShuffleCost(ShuffleKind Kind,
216 unsigned VectorTargetTransformImpl::getCastInstrCost(unsigned Opcode, Type *Dst,
218 int ISD = InstructionOpcodeToISD(Opcode);
219 assert(ISD && "Invalid opcode");
221 std::pair<unsigned, MVT> SrcLT = getTypeLegalizationCost(Src);
222 std::pair<unsigned, MVT> DstLT = getTypeLegalizationCost(Dst);
224 // Handle scalar conversions.
225 if (!Src->isVectorTy() && !Dst->isVectorTy()) {
227 // Scalar bitcasts are usually free.
228 if (Opcode == Instruction::BitCast)
231 if (Opcode == Instruction::Trunc &&
232 TLI->isTruncateFree(SrcLT.second, DstLT.second))
235 if (Opcode == Instruction::ZExt &&
236 TLI->isZExtFree(SrcLT.second, DstLT.second))
239 // Just check the op cost. If the operation is legal then assume it costs 1.
240 if (!TLI->isOperationExpand(ISD, DstLT.second))
243 // Assume that illegal scalar instruction are expensive.
247 // Check vector-to-vector casts.
248 if (Dst->isVectorTy() && Src->isVectorTy()) {
250 // If the cast is between same-sized registers, then the check is simple.
251 if (SrcLT.first == DstLT.first &&
252 SrcLT.second.getSizeInBits() == DstLT.second.getSizeInBits()) {
254 // Bitcast between types that are legalized to the same type are free.
255 if (Opcode == Instruction::BitCast || Opcode == Instruction::Trunc)
258 // Assume that Zext is done using AND.
259 if (Opcode == Instruction::ZExt)
262 // Assume that sext is done using SHL and SRA.
263 if (Opcode == Instruction::SExt)
266 // Just check the op cost. If the operation is legal then assume it costs
267 // 1 and multiply by the type-legalization overhead.
268 if (!TLI->isOperationExpand(ISD, DstLT.second))
269 return SrcLT.first * 1;
272 // If we are converting vectors and the operation is illegal, or
273 // if the vectors are legalized to different types, estimate the
274 // scalarization costs.
275 unsigned Num = Dst->getVectorNumElements();
276 unsigned Cost = getCastInstrCost(Opcode, Dst->getScalarType(),
277 Src->getScalarType());
279 // Return the cost of multiple scalar invocation plus the cost of
280 // inserting and extracting the values.
281 return getScalarizationOverhead(Dst, true, true) + Num * Cost;
284 // We already handled vector-to-vector and scalar-to-scalar conversions. This
285 // is where we handle bitcast between vectors and scalars. We need to assume
286 // that the conversion is scalarized in one way or another.
287 if (Opcode == Instruction::BitCast)
288 // Illegal bitcasts are done by storing and loading from a stack slot.
289 return (Src->isVectorTy()? getScalarizationOverhead(Src, false, true):0) +
290 (Dst->isVectorTy()? getScalarizationOverhead(Dst, true, false):0);
292 llvm_unreachable("Unhandled cast");
295 unsigned VectorTargetTransformImpl::getCFInstrCost(unsigned Opcode) const {
296 // Branches are assumed to be predicted.
300 unsigned VectorTargetTransformImpl::getCmpSelInstrCost(unsigned Opcode,
302 Type *CondTy) const {
303 int ISD = InstructionOpcodeToISD(Opcode);
304 assert(ISD && "Invalid opcode");
306 // Selects on vectors are actually vector selects.
307 if (ISD == ISD::SELECT) {
308 assert(CondTy && "CondTy must exist");
309 if (CondTy->isVectorTy())
313 std::pair<unsigned, MVT> LT = getTypeLegalizationCost(ValTy);
315 if (!TLI->isOperationExpand(ISD, LT.second)) {
316 // The operation is legal. Assume it costs 1. Multiply
317 // by the type-legalization overhead.
321 // Otherwise, assume that the cast is scalarized.
322 if (ValTy->isVectorTy()) {
323 unsigned Num = ValTy->getVectorNumElements();
325 CondTy = CondTy->getScalarType();
326 unsigned Cost = getCmpSelInstrCost(Opcode, ValTy->getScalarType(),
329 // Return the cost of multiple scalar invocation plus the cost of inserting
330 // and extracting the values.
331 return getScalarizationOverhead(ValTy, true, false) + Num * Cost;
334 // Unknown scalar opcode.
338 unsigned VectorTargetTransformImpl::getVectorInstrCost(unsigned Opcode,
340 unsigned Index) const {
345 VectorTargetTransformImpl::getMemoryOpCost(unsigned Opcode, Type *Src,
347 unsigned AddressSpace) const {
348 assert(!Src->isVoidTy() && "Invalid type");
349 std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Src);
351 // Assume that all loads of legal types cost 1.
356 VectorTargetTransformImpl::getIntrinsicInstrCost(Intrinsic::ID, Type *RetTy,
357 ArrayRef<Type*> Tys) const {
358 // assume that we need to scalarize this intrinsic.
359 unsigned ScalarizationCost = 0;
360 unsigned ScalarCalls = 1;
361 if (RetTy->isVectorTy()) {
362 ScalarizationCost = getScalarizationOverhead(RetTy, true, false);
363 ScalarCalls = std::max(ScalarCalls, RetTy->getVectorNumElements());
365 for (unsigned i = 0, ie = Tys.size(); i != ie; ++i) {
366 if (Tys[i]->isVectorTy()) {
367 ScalarizationCost += getScalarizationOverhead(Tys[i], false, true);
368 ScalarCalls = std::max(ScalarCalls, RetTy->getVectorNumElements());
371 return ScalarCalls + ScalarizationCost;
375 VectorTargetTransformImpl::getNumberOfParts(Type *Tp) const {
376 std::pair<unsigned, MVT> LT = getTypeLegalizationCost(Tp);