1 //===- llvm/Analysis/TargetTransformInfo.cpp ------------------------------===//
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 #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"
20 
21 using namespace llvm;
22 
23 #define DEBUG_TYPE "tti"
24 
25 namespace {
26 /// \brief No-op implementation of the TTI interface using the utility base
27 /// classes.
28 ///
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) {}
33 };
34 }
35 
36 TargetTransformInfo::TargetTransformInfo(const DataLayout &DL)
37     : TTIImpl(new Model<NoTTIImpl>(NoTTIImpl(DL))) {}
38 
39 TargetTransformInfo::~TargetTransformInfo() {}
40 
41 TargetTransformInfo::TargetTransformInfo(TargetTransformInfo &&Arg)
42     : TTIImpl(std::move(Arg.TTIImpl)) {}
43 
44 TargetTransformInfo &TargetTransformInfo::operator=(TargetTransformInfo &&RHS) {
45   TTIImpl = std::move(RHS.TTIImpl);
46   return *this;
47 }
48 
49 int TargetTransformInfo::getOperationCost(unsigned Opcode, Type *Ty,
50                                           Type *OpTy) const {
51   int Cost = TTIImpl->getOperationCost(Opcode, Ty, OpTy);
52   assert(Cost >= 0 && "TTI should not produce negative costs!");
53   return Cost;
54 }
55 
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!");
59   return Cost;
60 }
61 
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!");
66   return Cost;
67 }
68 
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!");
73   return Cost;
74 }
75 
76 int TargetTransformInfo::getUserCost(const User *U) const {
77   int Cost = TTIImpl->getUserCost(U);
78   assert(Cost >= 0 && "TTI should not produce negative costs!");
79   return Cost;
80 }
81 
82 bool TargetTransformInfo::hasBranchDivergence() const {
83   return TTIImpl->hasBranchDivergence();
84 }
85 
86 bool TargetTransformInfo::isSourceOfDivergence(const Value *V) const {
87   return TTIImpl->isSourceOfDivergence(V);
88 }
89 
90 bool TargetTransformInfo::isLoweredToCall(const Function *F) const {
91   return TTIImpl->isLoweredToCall(F);
92 }
93 
94 void TargetTransformInfo::getUnrollingPreferences(
95     Loop *L, UnrollingPreferences &UP) const {
96   return TTIImpl->getUnrollingPreferences(L, UP);
97 }
98 
99 bool TargetTransformInfo::isLegalAddImmediate(int64_t Imm) const {
100   return TTIImpl->isLegalAddImmediate(Imm);
101 }
102 
103 bool TargetTransformInfo::isLegalICmpImmediate(int64_t Imm) const {
104   return TTIImpl->isLegalICmpImmediate(Imm);
105 }
106 
107 bool TargetTransformInfo::isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV,
108                                                 int64_t BaseOffset,
109                                                 bool HasBaseReg,
110                                                 int64_t Scale,
111                                                 unsigned AddrSpace) const {
112   return TTIImpl->isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg,
113                                         Scale, AddrSpace);
114 }
115 
116 bool TargetTransformInfo::isLegalMaskedStore(Type *DataType) const {
117   return TTIImpl->isLegalMaskedStore(DataType);
118 }
119 
120 bool TargetTransformInfo::isLegalMaskedLoad(Type *DataType) const {
121   return TTIImpl->isLegalMaskedLoad(DataType);
122 }
123 
124 bool TargetTransformInfo::isLegalMaskedGather(Type *DataType) const {
125   return TTIImpl->isLegalMaskedGather(DataType);
126 }
127 
128 bool TargetTransformInfo::isLegalMaskedScatter(Type *DataType) const {
129   return TTIImpl->isLegalMaskedGather(DataType);
130 }
131 
132 int TargetTransformInfo::getScalingFactorCost(Type *Ty, GlobalValue *BaseGV,
133                                               int64_t BaseOffset,
134                                               bool HasBaseReg,
135                                               int64_t Scale,
136                                               unsigned AddrSpace) const {
137   int Cost = TTIImpl->getScalingFactorCost(Ty, BaseGV, BaseOffset, HasBaseReg,
138                                            Scale, AddrSpace);
139   assert(Cost >= 0 && "TTI should not produce negative costs!");
140   return Cost;
141 }
142 
143 bool TargetTransformInfo::isTruncateFree(Type *Ty1, Type *Ty2) const {
144   return TTIImpl->isTruncateFree(Ty1, Ty2);
145 }
146 
147 bool TargetTransformInfo::isProfitableToHoist(Instruction *I) const {
148   return TTIImpl->isProfitableToHoist(I);
149 }
150 
151 bool TargetTransformInfo::isTypeLegal(Type *Ty) const {
152   return TTIImpl->isTypeLegal(Ty);
153 }
154 
155 unsigned TargetTransformInfo::getJumpBufAlignment() const {
156   return TTIImpl->getJumpBufAlignment();
157 }
158 
159 unsigned TargetTransformInfo::getJumpBufSize() const {
160   return TTIImpl->getJumpBufSize();
161 }
162 
163 bool TargetTransformInfo::shouldBuildLookupTables() const {
164   return TTIImpl->shouldBuildLookupTables();
165 }
166 
167 bool TargetTransformInfo::enableAggressiveInterleaving(bool LoopHasReductions) const {
168   return TTIImpl->enableAggressiveInterleaving(LoopHasReductions);
169 }
170 
171 bool TargetTransformInfo::enableInterleavedAccessVectorization() const {
172   return TTIImpl->enableInterleavedAccessVectorization();
173 }
174 
175 TargetTransformInfo::PopcntSupportKind
176 TargetTransformInfo::getPopcntSupport(unsigned IntTyWidthInBit) const {
177   return TTIImpl->getPopcntSupport(IntTyWidthInBit);
178 }
179 
180 bool TargetTransformInfo::haveFastSqrt(Type *Ty) const {
181   return TTIImpl->haveFastSqrt(Ty);
182 }
183 
184 int TargetTransformInfo::getFPOpCost(Type *Ty) const {
185   int Cost = TTIImpl->getFPOpCost(Ty);
186   assert(Cost >= 0 && "TTI should not produce negative costs!");
187   return Cost;
188 }
189 
190 int TargetTransformInfo::getIntImmCost(const APInt &Imm, Type *Ty) const {
191   int Cost = TTIImpl->getIntImmCost(Imm, Ty);
192   assert(Cost >= 0 && "TTI should not produce negative costs!");
193   return Cost;
194 }
195 
196 int TargetTransformInfo::getIntImmCost(unsigned Opcode, unsigned Idx,
197                                        const APInt &Imm, Type *Ty) const {
198   int Cost = TTIImpl->getIntImmCost(Opcode, Idx, Imm, Ty);
199   assert(Cost >= 0 && "TTI should not produce negative costs!");
200   return Cost;
201 }
202 
203 int TargetTransformInfo::getIntImmCost(Intrinsic::ID IID, unsigned Idx,
204                                        const APInt &Imm, Type *Ty) const {
205   int Cost = TTIImpl->getIntImmCost(IID, Idx, Imm, Ty);
206   assert(Cost >= 0 && "TTI should not produce negative costs!");
207   return Cost;
208 }
209 
210 unsigned TargetTransformInfo::getNumberOfRegisters(bool Vector) const {
211   return TTIImpl->getNumberOfRegisters(Vector);
212 }
213 
214 unsigned TargetTransformInfo::getRegisterBitWidth(bool Vector) const {
215   return TTIImpl->getRegisterBitWidth(Vector);
216 }
217 
218 unsigned TargetTransformInfo::getCacheLineSize() const {
219   return TTIImpl->getCacheLineSize();
220 }
221 
222 unsigned TargetTransformInfo::getPrefetchDistance() const {
223   return TTIImpl->getPrefetchDistance();
224 }
225 
226 unsigned TargetTransformInfo::getMinPrefetchStride() const {
227   return TTIImpl->getMinPrefetchStride();
228 }
229 
230 unsigned TargetTransformInfo::getMaxPrefetchIterationsAhead() const {
231   return TTIImpl->getMaxPrefetchIterationsAhead();
232 }
233 
234 unsigned TargetTransformInfo::getMaxInterleaveFactor(unsigned VF) const {
235   return TTIImpl->getMaxInterleaveFactor(VF);
236 }
237 
238 int TargetTransformInfo::getArithmeticInstrCost(
239     unsigned Opcode, Type *Ty, OperandValueKind Opd1Info,
240     OperandValueKind Opd2Info, OperandValueProperties Opd1PropInfo,
241     OperandValueProperties Opd2PropInfo) const {
242   int Cost = TTIImpl->getArithmeticInstrCost(Opcode, Ty, Opd1Info, Opd2Info,
243                                              Opd1PropInfo, Opd2PropInfo);
244   assert(Cost >= 0 && "TTI should not produce negative costs!");
245   return Cost;
246 }
247 
248 int TargetTransformInfo::getShuffleCost(ShuffleKind Kind, Type *Ty, int Index,
249                                         Type *SubTp) const {
250   int Cost = TTIImpl->getShuffleCost(Kind, Ty, Index, SubTp);
251   assert(Cost >= 0 && "TTI should not produce negative costs!");
252   return Cost;
253 }
254 
255 int TargetTransformInfo::getCastInstrCost(unsigned Opcode, Type *Dst,
256                                           Type *Src) const {
257   int Cost = TTIImpl->getCastInstrCost(Opcode, Dst, Src);
258   assert(Cost >= 0 && "TTI should not produce negative costs!");
259   return Cost;
260 }
261 
262 int TargetTransformInfo::getCFInstrCost(unsigned Opcode) const {
263   int Cost = TTIImpl->getCFInstrCost(Opcode);
264   assert(Cost >= 0 && "TTI should not produce negative costs!");
265   return Cost;
266 }
267 
268 int TargetTransformInfo::getCmpSelInstrCost(unsigned Opcode, Type *ValTy,
269                                             Type *CondTy) const {
270   int Cost = TTIImpl->getCmpSelInstrCost(Opcode, ValTy, CondTy);
271   assert(Cost >= 0 && "TTI should not produce negative costs!");
272   return Cost;
273 }
274 
275 int TargetTransformInfo::getVectorInstrCost(unsigned Opcode, Type *Val,
276                                             unsigned Index) const {
277   int Cost = TTIImpl->getVectorInstrCost(Opcode, Val, Index);
278   assert(Cost >= 0 && "TTI should not produce negative costs!");
279   return Cost;
280 }
281 
282 int TargetTransformInfo::getMemoryOpCost(unsigned Opcode, Type *Src,
283                                          unsigned Alignment,
284                                          unsigned AddressSpace) const {
285   int Cost = TTIImpl->getMemoryOpCost(Opcode, Src, Alignment, AddressSpace);
286   assert(Cost >= 0 && "TTI should not produce negative costs!");
287   return Cost;
288 }
289 
290 int TargetTransformInfo::getMaskedMemoryOpCost(unsigned Opcode, Type *Src,
291                                                unsigned Alignment,
292                                                unsigned AddressSpace) const {
293   int Cost =
294       TTIImpl->getMaskedMemoryOpCost(Opcode, Src, Alignment, AddressSpace);
295   assert(Cost >= 0 && "TTI should not produce negative costs!");
296   return Cost;
297 }
298 
299 int TargetTransformInfo::getGatherScatterOpCost(unsigned Opcode, Type *DataTy,
300                                                 Value *Ptr, bool VariableMask,
301                                                 unsigned Alignment) const {
302   int Cost = TTIImpl->getGatherScatterOpCost(Opcode, DataTy, Ptr, VariableMask,
303                                              Alignment);
304   assert(Cost >= 0 && "TTI should not produce negative costs!");
305   return Cost;
306 }
307 
308 int TargetTransformInfo::getInterleavedMemoryOpCost(
309     unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
310     unsigned Alignment, unsigned AddressSpace) const {
311   int Cost = TTIImpl->getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
312                                                  Alignment, AddressSpace);
313   assert(Cost >= 0 && "TTI should not produce negative costs!");
314   return Cost;
315 }
316 
317 int TargetTransformInfo::getIntrinsicInstrCost(Intrinsic::ID ID, Type *RetTy,
318                                                ArrayRef<Type *> Tys) const {
319   int Cost = TTIImpl->getIntrinsicInstrCost(ID, RetTy, Tys);
320   assert(Cost >= 0 && "TTI should not produce negative costs!");
321   return Cost;
322 }
323 
324 int TargetTransformInfo::getIntrinsicInstrCost(Intrinsic::ID ID, Type *RetTy,
325                                                ArrayRef<Value *> Args) const {
326   int Cost = TTIImpl->getIntrinsicInstrCost(ID, RetTy, Args);
327   assert(Cost >= 0 && "TTI should not produce negative costs!");
328   return Cost;
329 }
330 
331 int TargetTransformInfo::getCallInstrCost(Function *F, Type *RetTy,
332                                           ArrayRef<Type *> Tys) const {
333   int Cost = TTIImpl->getCallInstrCost(F, RetTy, Tys);
334   assert(Cost >= 0 && "TTI should not produce negative costs!");
335   return Cost;
336 }
337 
338 unsigned TargetTransformInfo::getNumberOfParts(Type *Tp) const {
339   return TTIImpl->getNumberOfParts(Tp);
340 }
341 
342 int TargetTransformInfo::getAddressComputationCost(Type *Tp,
343                                                    bool IsComplex) const {
344   int Cost = TTIImpl->getAddressComputationCost(Tp, IsComplex);
345   assert(Cost >= 0 && "TTI should not produce negative costs!");
346   return Cost;
347 }
348 
349 int TargetTransformInfo::getReductionCost(unsigned Opcode, Type *Ty,
350                                           bool IsPairwiseForm) const {
351   int Cost = TTIImpl->getReductionCost(Opcode, Ty, IsPairwiseForm);
352   assert(Cost >= 0 && "TTI should not produce negative costs!");
353   return Cost;
354 }
355 
356 unsigned
357 TargetTransformInfo::getCostOfKeepingLiveOverCall(ArrayRef<Type *> Tys) const {
358   return TTIImpl->getCostOfKeepingLiveOverCall(Tys);
359 }
360 
361 bool TargetTransformInfo::getTgtMemIntrinsic(IntrinsicInst *Inst,
362                                              MemIntrinsicInfo &Info) const {
363   return TTIImpl->getTgtMemIntrinsic(Inst, Info);
364 }
365 
366 Value *TargetTransformInfo::getOrCreateResultFromMemIntrinsic(
367     IntrinsicInst *Inst, Type *ExpectedType) const {
368   return TTIImpl->getOrCreateResultFromMemIntrinsic(Inst, ExpectedType);
369 }
370 
371 bool TargetTransformInfo::areInlineCompatible(const Function *Caller,
372                                               const Function *Callee) const {
373   return TTIImpl->areInlineCompatible(Caller, Callee);
374 }
375 
376 TargetTransformInfo::Concept::~Concept() {}
377 
378 TargetIRAnalysis::TargetIRAnalysis() : TTICallback(&getDefaultTTI) {}
379 
380 TargetIRAnalysis::TargetIRAnalysis(
381     std::function<Result(const Function &)> TTICallback)
382     : TTICallback(TTICallback) {}
383 
384 TargetIRAnalysis::Result TargetIRAnalysis::run(const Function &F) {
385   return TTICallback(F);
386 }
387 
388 char TargetIRAnalysis::PassID;
389 
390 TargetIRAnalysis::Result TargetIRAnalysis::getDefaultTTI(const Function &F) {
391   return Result(F.getParent()->getDataLayout());
392 }
393 
394 // Register the basic pass.
395 INITIALIZE_PASS(TargetTransformInfoWrapperPass, "tti",
396                 "Target Transform Information", false, true)
397 char TargetTransformInfoWrapperPass::ID = 0;
398 
399 void TargetTransformInfoWrapperPass::anchor() {}
400 
401 TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass()
402     : ImmutablePass(ID) {
403   initializeTargetTransformInfoWrapperPassPass(
404       *PassRegistry::getPassRegistry());
405 }
406 
407 TargetTransformInfoWrapperPass::TargetTransformInfoWrapperPass(
408     TargetIRAnalysis TIRA)
409     : ImmutablePass(ID), TIRA(std::move(TIRA)) {
410   initializeTargetTransformInfoWrapperPassPass(
411       *PassRegistry::getPassRegistry());
412 }
413 
414 TargetTransformInfo &TargetTransformInfoWrapperPass::getTTI(const Function &F) {
415   TTI = TIRA.run(F);
416   return *TTI;
417 }
418 
419 ImmutablePass *
420 llvm::createTargetTransformInfoWrapperPass(TargetIRAnalysis TIRA) {
421   return new TargetTransformInfoWrapperPass(std::move(TIRA));
422 }
423