1 //===- llvm/Analysis/TargetTransformInfo.cpp ------------------------------===//
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/Analysis/TargetTransformInfo.h"
11 #include "llvm/Analysis/TargetTransformInfoImpl.h"
12 #include "llvm/IR/CallSite.h"
13 #include "llvm/IR/DataLayout.h"
14 #include "llvm/IR/Instruction.h"
15 #include "llvm/IR/Instructions.h"
16 #include "llvm/IR/IntrinsicInst.h"
17 #include "llvm/IR/Module.h"
18 #include "llvm/IR/Operator.h"
19 #include "llvm/Support/ErrorHandling.h"
23 #define DEBUG_TYPE "tti"
26 /// \brief No-op implementation of the TTI interface using the utility base
29 /// This is used when no target specific information is available.
30 struct NoTTIImpl : TargetTransformInfoImplCRTPBase<NoTTIImpl> {
31 explicit NoTTIImpl(const DataLayout &DL)
32 : TargetTransformInfoImplCRTPBase<NoTTIImpl>(DL) {}
36 TargetTransformInfo::TargetTransformInfo(const DataLayout &DL)
37 : TTIImpl(new Model<NoTTIImpl>(NoTTIImpl(DL))) {}
39 TargetTransformInfo::~TargetTransformInfo() {}
41 TargetTransformInfo::TargetTransformInfo(TargetTransformInfo &&Arg)
42 : TTIImpl(std::move(Arg.TTIImpl)) {}
44 TargetTransformInfo &TargetTransformInfo::operator=(TargetTransformInfo &&RHS) {
45 TTIImpl = std::move(RHS.TTIImpl);
49 int TargetTransformInfo::getOperationCost(unsigned Opcode, Type *Ty,
51 int Cost = TTIImpl->getOperationCost(Opcode, Ty, OpTy);
52 assert(Cost >= 0 && "TTI should not produce negative costs!");
56 int TargetTransformInfo::getCallCost(FunctionType *FTy, int NumArgs) const {
57 int Cost = TTIImpl->getCallCost(FTy, NumArgs);
58 assert(Cost >= 0 && "TTI should not produce negative costs!");
62 int TargetTransformInfo::getCallCost(const Function *F,
63 ArrayRef<const Value *> Arguments) const {
64 int Cost = TTIImpl->getCallCost(F, Arguments);
65 assert(Cost >= 0 && "TTI should not produce negative costs!");
69 int TargetTransformInfo::getIntrinsicCost(
70 Intrinsic::ID IID, Type *RetTy, ArrayRef<const Value *> Arguments) const {
71 int Cost = TTIImpl->getIntrinsicCost(IID, RetTy, Arguments);
72 assert(Cost >= 0 && "TTI should not produce negative costs!");
76 int TargetTransformInfo::getUserCost(const User *U) const {
77 int Cost = TTIImpl->getUserCost(U);
78 assert(Cost >= 0 && "TTI should not produce negative costs!");
82 bool TargetTransformInfo::hasBranchDivergence() const {
83 return TTIImpl->hasBranchDivergence();
86 bool TargetTransformInfo::isSourceOfDivergence(const Value *V) const {
87 return TTIImpl->isSourceOfDivergence(V);
90 bool TargetTransformInfo::isLoweredToCall(const Function *F) const {
91 return TTIImpl->isLoweredToCall(F);
94 void TargetTransformInfo::getUnrollingPreferences(
95 Loop *L, UnrollingPreferences &UP) const {
96 return TTIImpl->getUnrollingPreferences(L, UP);
99 bool TargetTransformInfo::isLegalAddImmediate(int64_t Imm) const {
100 return TTIImpl->isLegalAddImmediate(Imm);
103 bool TargetTransformInfo::isLegalICmpImmediate(int64_t Imm) const {
104 return TTIImpl->isLegalICmpImmediate(Imm);
107 bool TargetTransformInfo::isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV,
111 unsigned AddrSpace) const {
112 return TTIImpl->isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg,
116 bool TargetTransformInfo::isLegalMaskedStore(Type *DataType,
117 int Consecutive) const {
118 return TTIImpl->isLegalMaskedStore(DataType, Consecutive);
121 bool TargetTransformInfo::isLegalMaskedLoad(Type *DataType,
122 int Consecutive) const {
123 return TTIImpl->isLegalMaskedLoad(DataType, Consecutive);
126 int TargetTransformInfo::getScalingFactorCost(Type *Ty, GlobalValue *BaseGV,
130 unsigned AddrSpace) const {
131 int Cost = TTIImpl->getScalingFactorCost(Ty, BaseGV, BaseOffset, HasBaseReg,
133 assert(Cost >= 0 && "TTI should not produce negative costs!");
137 bool TargetTransformInfo::isTruncateFree(Type *Ty1, Type *Ty2) const {
138 return TTIImpl->isTruncateFree(Ty1, Ty2);
141 bool TargetTransformInfo::isZExtFree(Type *Ty1, Type *Ty2) const {
142 return TTIImpl->isZExtFree(Ty1, Ty2);
145 bool TargetTransformInfo::isProfitableToHoist(Instruction *I) const {
146 return TTIImpl->isProfitableToHoist(I);
149 bool TargetTransformInfo::isTypeLegal(Type *Ty) const {
150 return TTIImpl->isTypeLegal(Ty);
153 unsigned TargetTransformInfo::getJumpBufAlignment() const {
154 return TTIImpl->getJumpBufAlignment();
157 unsigned TargetTransformInfo::getJumpBufSize() const {
158 return TTIImpl->getJumpBufSize();
161 bool TargetTransformInfo::shouldBuildLookupTables() const {
162 return TTIImpl->shouldBuildLookupTables();
165 bool TargetTransformInfo::enableAggressiveInterleaving(bool LoopHasReductions) const {
166 return TTIImpl->enableAggressiveInterleaving(LoopHasReductions);
169 bool TargetTransformInfo::enableInterleavedAccessVectorization() const {
170 return TTIImpl->enableInterleavedAccessVectorization();
173 TargetTransformInfo::PopcntSupportKind
174 TargetTransformInfo::getPopcntSupport(unsigned IntTyWidthInBit) const {
175 return TTIImpl->getPopcntSupport(IntTyWidthInBit);
178 bool TargetTransformInfo::haveFastSqrt(Type *Ty) const {
179 return TTIImpl->haveFastSqrt(Ty);
182 int TargetTransformInfo::getFPOpCost(Type *Ty) const {
183 int Cost = TTIImpl->getFPOpCost(Ty);
184 assert(Cost >= 0 && "TTI should not produce negative costs!");
188 int TargetTransformInfo::getIntImmCost(const APInt &Imm, Type *Ty) const {
189 int Cost = TTIImpl->getIntImmCost(Imm, Ty);
190 assert(Cost >= 0 && "TTI should not produce negative costs!");
194 int TargetTransformInfo::getIntImmCost(unsigned Opcode, unsigned Idx,
195 const APInt &Imm, Type *Ty) const {
196 int Cost = TTIImpl->getIntImmCost(Opcode, Idx, Imm, Ty);
197 assert(Cost >= 0 && "TTI should not produce negative costs!");
201 int TargetTransformInfo::getIntImmCost(Intrinsic::ID IID, unsigned Idx,
202 const APInt &Imm, Type *Ty) const {
203 int Cost = TTIImpl->getIntImmCost(IID, Idx, Imm, Ty);
204 assert(Cost >= 0 && "TTI should not produce negative costs!");
208 unsigned TargetTransformInfo::getNumberOfRegisters(bool Vector) const {
209 return TTIImpl->getNumberOfRegisters(Vector);
212 unsigned TargetTransformInfo::getRegisterBitWidth(bool Vector) const {
213 return TTIImpl->getRegisterBitWidth(Vector);
216 unsigned TargetTransformInfo::getMaxInterleaveFactor(unsigned VF) const {
217 return TTIImpl->getMaxInterleaveFactor(VF);
220 int TargetTransformInfo::getArithmeticInstrCost(
221 unsigned Opcode, Type *Ty, OperandValueKind Opd1Info,
222 OperandValueKind Opd2Info, OperandValueProperties Opd1PropInfo,
223 OperandValueProperties Opd2PropInfo) const {
224 int Cost = TTIImpl->getArithmeticInstrCost(Opcode, Ty, Opd1Info, Opd2Info,
225 Opd1PropInfo, Opd2PropInfo);
226 assert(Cost >= 0 && "TTI should not produce negative costs!");
230 int TargetTransformInfo::getShuffleCost(ShuffleKind Kind, Type *Ty, int Index,
232 int Cost = TTIImpl->getShuffleCost(Kind, Ty, Index, SubTp);
233 assert(Cost >= 0 && "TTI should not produce negative costs!");
237 int TargetTransformInfo::getCastInstrCost(unsigned Opcode, Type *Dst,
239 int Cost = TTIImpl->getCastInstrCost(Opcode, Dst, Src);
240 assert(Cost >= 0 && "TTI should not produce negative costs!");
244 int TargetTransformInfo::getCFInstrCost(unsigned Opcode) const {
245 int Cost = TTIImpl->getCFInstrCost(Opcode);
246 assert(Cost >= 0 && "TTI should not produce negative costs!");
250 int TargetTransformInfo::getCmpSelInstrCost(unsigned Opcode, Type *ValTy,
251 Type *CondTy) const {
252 int Cost = TTIImpl->getCmpSelInstrCost(Opcode, ValTy, CondTy);
253 assert(Cost >= 0 && "TTI should not produce negative costs!");
257 int TargetTransformInfo::getVectorInstrCost(unsigned Opcode, Type *Val,
258 unsigned Index) const {
259 int Cost = TTIImpl->getVectorInstrCost(Opcode, Val, Index);
260 assert(Cost >= 0 && "TTI should not produce negative costs!");
264 int TargetTransformInfo::getMemoryOpCost(unsigned Opcode, Type *Src,
266 unsigned AddressSpace) const {
267 int Cost = TTIImpl->getMemoryOpCost(Opcode, Src, Alignment, AddressSpace);
268 assert(Cost >= 0 && "TTI should not produce negative costs!");
272 int TargetTransformInfo::getMaskedMemoryOpCost(unsigned Opcode, Type *Src,
274 unsigned AddressSpace) const {
276 TTIImpl->getMaskedMemoryOpCost(Opcode, Src, Alignment, AddressSpace);
277 assert(Cost >= 0 && "TTI should not produce negative costs!");
281 int TargetTransformInfo::getInterleavedMemoryOpCost(
282 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
283 unsigned Alignment, unsigned AddressSpace) const {
284 int Cost = TTIImpl->getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
285 Alignment, AddressSpace);
286 assert(Cost >= 0 && "TTI should not produce negative costs!");
290 int TargetTransformInfo::getIntrinsicInstrCost(Intrinsic::ID ID, Type *RetTy,
291 ArrayRef<Type *> Tys) const {
292 int Cost = TTIImpl->getIntrinsicInstrCost(ID, RetTy, Tys);
293 assert(Cost >= 0 && "TTI should not produce negative costs!");
297 int TargetTransformInfo::getCallInstrCost(Function *F, Type *RetTy,
298 ArrayRef<Type *> Tys) const {
299 int Cost = TTIImpl->getCallInstrCost(F, RetTy, Tys);
300 assert(Cost >= 0 && "TTI should not produce negative costs!");
304 unsigned TargetTransformInfo::getNumberOfParts(Type *Tp) const {
305 return TTIImpl->getNumberOfParts(Tp);
308 int TargetTransformInfo::getAddressComputationCost(Type *Tp,
309 bool IsComplex) const {
310 int Cost = TTIImpl->getAddressComputationCost(Tp, IsComplex);
311 assert(Cost >= 0 && "TTI should not produce negative costs!");
315 int TargetTransformInfo::getReductionCost(unsigned Opcode, Type *Ty,
316 bool IsPairwiseForm) const {
317 int Cost = TTIImpl->getReductionCost(Opcode, Ty, IsPairwiseForm);
318 assert(Cost >= 0 && "TTI should not produce negative costs!");
323 TargetTransformInfo::getCostOfKeepingLiveOverCall(ArrayRef<Type *> Tys) const {
324 return TTIImpl->getCostOfKeepingLiveOverCall(Tys);
327 bool TargetTransformInfo::getTgtMemIntrinsic(IntrinsicInst *Inst,
328 MemIntrinsicInfo &Info) const {
329 return TTIImpl->getTgtMemIntrinsic(Inst, Info);
332 Value *TargetTransformInfo::getOrCreateResultFromMemIntrinsic(
333 IntrinsicInst *Inst, Type *ExpectedType) const {
334 return TTIImpl->getOrCreateResultFromMemIntrinsic(Inst, ExpectedType);
337 bool TargetTransformInfo::areInlineCompatible(const Function *Caller,
338 const Function *Callee) const {
339 return TTIImpl->areInlineCompatible(Caller, Callee);
342 TargetTransformInfo::Concept::~Concept() {}
344 TargetIRAnalysis::TargetIRAnalysis() : TTICallback(&getDefaultTTI) {}
346 TargetIRAnalysis::TargetIRAnalysis(
347 std::function<Result(const Function &)> TTICallback)
348 : TTICallback(TTICallback) {}
350 TargetIRAnalysis::Result TargetIRAnalysis::run(const Function &F) {
351 return TTICallback(F);
354 char TargetIRAnalysis::PassID;
356 TargetIRAnalysis::Result TargetIRAnalysis::getDefaultTTI(const Function &F) {
357 return Result(F.getParent()->getDataLayout());
360 // Register the basic pass.
361 INITIALIZE_PASS(TargetTransformInfoWrapperPass, "tti",
362 "Target Transform Information", false, true)
363 char TargetTransformInfoWrapperPass::ID = 0;
365 void TargetTransformInfoWrapperPass::anchor() {}
367 TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass()
368 : ImmutablePass(ID) {
369 initializeTargetTransformInfoWrapperPassPass(
370 *PassRegistry::getPassRegistry());
373 TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass(
374 TargetIRAnalysis TIRA)
375 : ImmutablePass(ID), TIRA(std::move(TIRA)) {
376 initializeTargetTransformInfoWrapperPassPass(
377 *PassRegistry::getPassRegistry());
380 TargetTransformInfo &TargetTransformInfoWrapperPass::getTTI(const Function &F) {
386 llvm::createTargetTransformInfoWrapperPass(TargetIRAnalysis TIRA) {
387 return new TargetTransformInfoWrapperPass(std::move(TIRA));