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 #define DEBUG_TYPE "tti"
11 #include "llvm/Analysis/TargetTransformInfo.h"
12 #include "llvm/IR/DataLayout.h"
13 #include "llvm/IR/Operator.h"
14 #include "llvm/IR/Instruction.h"
15 #include "llvm/IR/IntrinsicInst.h"
16 #include "llvm/IR/Instructions.h"
17 #include "llvm/Support/CallSite.h"
18 #include "llvm/Support/ErrorHandling.h"
22 // Setup the analysis group to manage the TargetTransformInfo passes.
23 INITIALIZE_ANALYSIS_GROUP(TargetTransformInfo, "Target Information", NoTTI)
24 char TargetTransformInfo::ID = 0;
26 TargetTransformInfo::~TargetTransformInfo() {
29 void TargetTransformInfo::pushTTIStack(Pass *P) {
31 PrevTTI = &P->getAnalysis<TargetTransformInfo>();
33 // Walk up the chain and update the top TTI pointer.
34 for (TargetTransformInfo *PTTI = PrevTTI; PTTI; PTTI = PTTI->PrevTTI)
38 void TargetTransformInfo::popTTIStack() {
41 // Walk up the chain and update the top TTI pointer.
42 for (TargetTransformInfo *PTTI = PrevTTI; PTTI; PTTI = PTTI->PrevTTI)
43 PTTI->TopTTI = PrevTTI;
48 void TargetTransformInfo::getAnalysisUsage(AnalysisUsage &AU) const {
49 AU.addRequired<TargetTransformInfo>();
52 unsigned TargetTransformInfo::getOperationCost(unsigned Opcode, Type *Ty,
54 return PrevTTI->getOperationCost(Opcode, Ty, OpTy);
57 unsigned TargetTransformInfo::getGEPCost(
58 const Value *Ptr, ArrayRef<const Value *> Operands) const {
59 return PrevTTI->getGEPCost(Ptr, Operands);
62 unsigned TargetTransformInfo::getCallCost(FunctionType *FTy,
64 return PrevTTI->getCallCost(FTy, NumArgs);
67 unsigned TargetTransformInfo::getCallCost(const Function *F,
69 return PrevTTI->getCallCost(F, NumArgs);
72 unsigned TargetTransformInfo::getCallCost(
73 const Function *F, ArrayRef<const Value *> Arguments) const {
74 return PrevTTI->getCallCost(F, Arguments);
77 unsigned TargetTransformInfo::getIntrinsicCost(
78 Intrinsic::ID IID, Type *RetTy, ArrayRef<Type *> ParamTys) const {
79 return PrevTTI->getIntrinsicCost(IID, RetTy, ParamTys);
82 unsigned TargetTransformInfo::getIntrinsicCost(
83 Intrinsic::ID IID, Type *RetTy, ArrayRef<const Value *> Arguments) const {
84 return PrevTTI->getIntrinsicCost(IID, RetTy, Arguments);
87 unsigned TargetTransformInfo::getUserCost(const User *U) const {
88 return PrevTTI->getUserCost(U);
91 bool TargetTransformInfo::isLoweredToCall(const Function *F) const {
92 return PrevTTI->isLoweredToCall(F);
95 bool TargetTransformInfo::isLegalAddImmediate(int64_t Imm) const {
96 return PrevTTI->isLegalAddImmediate(Imm);
99 bool TargetTransformInfo::isLegalICmpImmediate(int64_t Imm) const {
100 return PrevTTI->isLegalICmpImmediate(Imm);
103 bool TargetTransformInfo::isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV,
106 int64_t Scale) const {
107 return PrevTTI->isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg,
111 int TargetTransformInfo::getScalingFactorCost(Type *Ty, GlobalValue *BaseGV,
114 int64_t Scale) const {
115 return PrevTTI->getScalingFactorCost(Ty, BaseGV, BaseOffset, HasBaseReg,
119 bool TargetTransformInfo::isTruncateFree(Type *Ty1, Type *Ty2) const {
120 return PrevTTI->isTruncateFree(Ty1, Ty2);
123 bool TargetTransformInfo::isTypeLegal(Type *Ty) const {
124 return PrevTTI->isTypeLegal(Ty);
127 unsigned TargetTransformInfo::getJumpBufAlignment() const {
128 return PrevTTI->getJumpBufAlignment();
131 unsigned TargetTransformInfo::getJumpBufSize() const {
132 return PrevTTI->getJumpBufSize();
135 bool TargetTransformInfo::shouldBuildLookupTables() const {
136 return PrevTTI->shouldBuildLookupTables();
139 TargetTransformInfo::PopcntSupportKind
140 TargetTransformInfo::getPopcntSupport(unsigned IntTyWidthInBit) const {
141 return PrevTTI->getPopcntSupport(IntTyWidthInBit);
144 unsigned TargetTransformInfo::getIntImmCost(const APInt &Imm, Type *Ty) const {
145 return PrevTTI->getIntImmCost(Imm, Ty);
148 unsigned TargetTransformInfo::getNumberOfRegisters(bool Vector) const {
149 return PrevTTI->getNumberOfRegisters(Vector);
152 unsigned TargetTransformInfo::getRegisterBitWidth(bool Vector) const {
153 return PrevTTI->getRegisterBitWidth(Vector);
156 unsigned TargetTransformInfo::getMaximumUnrollFactor() const {
157 return PrevTTI->getMaximumUnrollFactor();
160 unsigned TargetTransformInfo::getArithmeticInstrCost(unsigned Opcode,
162 OperandValueKind Op1Info,
163 OperandValueKind Op2Info) const {
164 return PrevTTI->getArithmeticInstrCost(Opcode, Ty, Op1Info, Op2Info);
167 unsigned TargetTransformInfo::getShuffleCost(ShuffleKind Kind, Type *Tp,
168 int Index, Type *SubTp) const {
169 return PrevTTI->getShuffleCost(Kind, Tp, Index, SubTp);
172 unsigned TargetTransformInfo::getCastInstrCost(unsigned Opcode, Type *Dst,
174 return PrevTTI->getCastInstrCost(Opcode, Dst, Src);
177 unsigned TargetTransformInfo::getCFInstrCost(unsigned Opcode) const {
178 return PrevTTI->getCFInstrCost(Opcode);
181 unsigned TargetTransformInfo::getCmpSelInstrCost(unsigned Opcode, Type *ValTy,
182 Type *CondTy) const {
183 return PrevTTI->getCmpSelInstrCost(Opcode, ValTy, CondTy);
186 unsigned TargetTransformInfo::getVectorInstrCost(unsigned Opcode, Type *Val,
187 unsigned Index) const {
188 return PrevTTI->getVectorInstrCost(Opcode, Val, Index);
191 unsigned TargetTransformInfo::getMemoryOpCost(unsigned Opcode, Type *Src,
193 unsigned AddressSpace) const {
194 return PrevTTI->getMemoryOpCost(Opcode, Src, Alignment, AddressSpace);
199 TargetTransformInfo::getIntrinsicInstrCost(Intrinsic::ID ID,
201 ArrayRef<Type *> Tys) const {
202 return PrevTTI->getIntrinsicInstrCost(ID, RetTy, Tys);
205 unsigned TargetTransformInfo::getNumberOfParts(Type *Tp) const {
206 return PrevTTI->getNumberOfParts(Tp);
209 unsigned TargetTransformInfo::getAddressComputationCost(Type *Tp,
210 bool IsComplex) const {
211 return PrevTTI->getAddressComputationCost(Tp, IsComplex);
216 struct NoTTI : ImmutablePass, TargetTransformInfo {
217 const DataLayout *DL;
219 NoTTI() : ImmutablePass(ID), DL(0) {
220 initializeNoTTIPass(*PassRegistry::getPassRegistry());
223 virtual void initializePass() {
224 // Note that this subclass is special, and must *not* call initializeTTI as
225 // it does not chain.
228 DL = getAnalysisIfAvailable<DataLayout>();
231 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
232 // Note that this subclass is special, and must *not* call
233 // TTI::getAnalysisUsage as it breaks the recursion.
236 /// Pass identification.
239 /// Provide necessary pointer adjustments for the two base classes.
240 virtual void *getAdjustedAnalysisPointer(const void *ID) {
241 if (ID == &TargetTransformInfo::ID)
242 return (TargetTransformInfo*)this;
246 unsigned getOperationCost(unsigned Opcode, Type *Ty, Type *OpTy) const {
249 // By default, just classify everything as 'basic'.
252 case Instruction::GetElementPtr:
253 llvm_unreachable("Use getGEPCost for GEP operations!");
255 case Instruction::BitCast:
256 assert(OpTy && "Cast instructions must provide the operand type");
257 if (Ty == OpTy || (Ty->isPointerTy() && OpTy->isPointerTy()))
258 // Identity and pointer-to-pointer casts are free.
261 // Otherwise, the default basic cost is used.
264 case Instruction::IntToPtr:
265 // An inttoptr cast is free so long as the input is a legal integer type
266 // which doesn't contain values outside the range of a pointer.
267 if (DL && DL->isLegalInteger(OpTy->getScalarSizeInBits()) &&
268 OpTy->getScalarSizeInBits() <= DL->getPointerSizeInBits())
271 // Otherwise it's not a no-op.
274 case Instruction::PtrToInt:
275 // A ptrtoint cast is free so long as the result is large enough to store
276 // the pointer, and a legal integer type.
277 if (DL && DL->isLegalInteger(Ty->getScalarSizeInBits()) &&
278 Ty->getScalarSizeInBits() >= DL->getPointerSizeInBits())
281 // Otherwise it's not a no-op.
284 case Instruction::Trunc:
285 // trunc to a native type is free (assuming the target has compare and
286 // shift-right of the same width).
287 if (DL && DL->isLegalInteger(DL->getTypeSizeInBits(Ty)))
294 unsigned getGEPCost(const Value *Ptr,
295 ArrayRef<const Value *> Operands) const {
296 // In the basic model, we just assume that all-constant GEPs will be folded
297 // into their uses via addressing modes.
298 for (unsigned Idx = 0, Size = Operands.size(); Idx != Size; ++Idx)
299 if (!isa<Constant>(Operands[Idx]))
305 unsigned getCallCost(FunctionType *FTy, int NumArgs = -1) const {
306 assert(FTy && "FunctionType must be provided to this routine.");
308 // The target-independent implementation just measures the size of the
309 // function by approximating that each argument will take on average one
310 // instruction to prepare.
313 // Set the argument number to the number of explicit arguments in the
315 NumArgs = FTy->getNumParams();
317 return TCC_Basic * (NumArgs + 1);
320 unsigned getCallCost(const Function *F, int NumArgs = -1) const {
321 assert(F && "A concrete function must be provided to this routine.");
324 // Set the argument number to the number of explicit arguments in the
326 NumArgs = F->arg_size();
328 if (Intrinsic::ID IID = (Intrinsic::ID)F->getIntrinsicID()) {
329 FunctionType *FTy = F->getFunctionType();
330 SmallVector<Type *, 8> ParamTys(FTy->param_begin(), FTy->param_end());
331 return TopTTI->getIntrinsicCost(IID, FTy->getReturnType(), ParamTys);
334 if (!TopTTI->isLoweredToCall(F))
335 return TCC_Basic; // Give a basic cost if it will be lowered directly.
337 return TopTTI->getCallCost(F->getFunctionType(), NumArgs);
340 unsigned getCallCost(const Function *F,
341 ArrayRef<const Value *> Arguments) const {
342 // Simply delegate to generic handling of the call.
343 // FIXME: We should use instsimplify or something else to catch calls which
344 // will constant fold with these arguments.
345 return TopTTI->getCallCost(F, Arguments.size());
348 unsigned getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
349 ArrayRef<Type *> ParamTys) const {
352 // Intrinsics rarely (if ever) have normal argument setup constraints.
353 // Model them as having a basic instruction cost.
354 // FIXME: This is wrong for libc intrinsics.
357 case Intrinsic::dbg_declare:
358 case Intrinsic::dbg_value:
359 case Intrinsic::invariant_start:
360 case Intrinsic::invariant_end:
361 case Intrinsic::lifetime_start:
362 case Intrinsic::lifetime_end:
363 case Intrinsic::objectsize:
364 case Intrinsic::ptr_annotation:
365 case Intrinsic::var_annotation:
366 // These intrinsics don't actually represent code after lowering.
371 unsigned getIntrinsicCost(Intrinsic::ID IID, Type *RetTy,
372 ArrayRef<const Value *> Arguments) const {
373 // Delegate to the generic intrinsic handling code. This mostly provides an
374 // opportunity for targets to (for example) special case the cost of
375 // certain intrinsics based on constants used as arguments.
376 SmallVector<Type *, 8> ParamTys;
377 ParamTys.reserve(Arguments.size());
378 for (unsigned Idx = 0, Size = Arguments.size(); Idx != Size; ++Idx)
379 ParamTys.push_back(Arguments[Idx]->getType());
380 return TopTTI->getIntrinsicCost(IID, RetTy, ParamTys);
383 unsigned getUserCost(const User *U) const {
385 return TCC_Free; // Model all PHI nodes as free.
387 if (const GEPOperator *GEP = dyn_cast<GEPOperator>(U))
388 // In the basic model we just assume that all-constant GEPs will be
389 // folded into their uses via addressing modes.
390 return GEP->hasAllConstantIndices() ? TCC_Free : TCC_Basic;
392 if (ImmutableCallSite CS = U) {
393 const Function *F = CS.getCalledFunction();
395 // Just use the called value type.
396 Type *FTy = CS.getCalledValue()->getType()->getPointerElementType();
397 return TopTTI->getCallCost(cast<FunctionType>(FTy), CS.arg_size());
400 SmallVector<const Value *, 8> Arguments;
401 for (ImmutableCallSite::arg_iterator AI = CS.arg_begin(),
404 Arguments.push_back(*AI);
406 return TopTTI->getCallCost(F, Arguments);
409 if (const CastInst *CI = dyn_cast<CastInst>(U)) {
410 // Result of a cmp instruction is often extended (to be used by other
411 // cmp instructions, logical or return instructions). These are usually
412 // nop on most sane targets.
413 if (isa<CmpInst>(CI->getOperand(0)))
417 // Otherwise delegate to the fully generic implementations.
418 return getOperationCost(Operator::getOpcode(U), U->getType(),
419 U->getNumOperands() == 1 ?
420 U->getOperand(0)->getType() : 0);
423 bool isLoweredToCall(const Function *F) const {
424 // FIXME: These should almost certainly not be handled here, and instead
425 // handled with the help of TLI or the target itself. This was largely
426 // ported from existing analysis heuristics here so that such refactorings
427 // can take place in the future.
429 if (F->isIntrinsic())
432 if (F->hasLocalLinkage() || !F->hasName())
435 StringRef Name = F->getName();
437 // These will all likely lower to a single selection DAG node.
438 if (Name == "copysign" || Name == "copysignf" || Name == "copysignl" ||
439 Name == "fabs" || Name == "fabsf" || Name == "fabsl" || Name == "sin" ||
440 Name == "sinf" || Name == "sinl" || Name == "cos" || Name == "cosf" ||
441 Name == "cosl" || Name == "sqrt" || Name == "sqrtf" || Name == "sqrtl")
444 // These are all likely to be optimized into something smaller.
445 if (Name == "pow" || Name == "powf" || Name == "powl" || Name == "exp2" ||
446 Name == "exp2l" || Name == "exp2f" || Name == "floor" || Name ==
447 "floorf" || Name == "ceil" || Name == "round" || Name == "ffs" ||
448 Name == "ffsl" || Name == "abs" || Name == "labs" || Name == "llabs")
454 bool isLegalAddImmediate(int64_t Imm) const {
458 bool isLegalICmpImmediate(int64_t Imm) const {
462 bool isLegalAddressingMode(Type *Ty, GlobalValue *BaseGV, int64_t BaseOffset,
463 bool HasBaseReg, int64_t Scale) const {
464 // Guess that reg+reg addressing is allowed. This heuristic is taken from
465 // the implementation of LSR.
466 return !BaseGV && BaseOffset == 0 && Scale <= 1;
469 int getScalingFactorCost(Type *Ty, GlobalValue *BaseGV, int64_t BaseOffset,
470 bool HasBaseReg, int64_t Scale) const {
471 // Guess that all legal addressing mode are free.
472 if(isLegalAddressingMode(Ty, BaseGV, BaseOffset, HasBaseReg, Scale))
478 bool isTruncateFree(Type *Ty1, Type *Ty2) const {
482 bool isTypeLegal(Type *Ty) const {
486 unsigned getJumpBufAlignment() const {
490 unsigned getJumpBufSize() const {
494 bool shouldBuildLookupTables() const {
498 PopcntSupportKind getPopcntSupport(unsigned IntTyWidthInBit) const {
502 unsigned getIntImmCost(const APInt &Imm, Type *Ty) const {
506 unsigned getNumberOfRegisters(bool Vector) const {
510 unsigned getRegisterBitWidth(bool Vector) const {
514 unsigned getMaximumUnrollFactor() const {
518 unsigned getArithmeticInstrCost(unsigned Opcode, Type *Ty, OperandValueKind,
519 OperandValueKind) const {
523 unsigned getShuffleCost(ShuffleKind Kind, Type *Tp,
524 int Index = 0, Type *SubTp = 0) const {
528 unsigned getCastInstrCost(unsigned Opcode, Type *Dst,
533 unsigned getCFInstrCost(unsigned Opcode) const {
537 unsigned getCmpSelInstrCost(unsigned Opcode, Type *ValTy,
538 Type *CondTy = 0) const {
542 unsigned getVectorInstrCost(unsigned Opcode, Type *Val,
543 unsigned Index = -1) const {
547 unsigned getMemoryOpCost(unsigned Opcode, Type *Src,
549 unsigned AddressSpace) const {
553 unsigned getIntrinsicInstrCost(Intrinsic::ID ID,
555 ArrayRef<Type*> Tys) const {
559 unsigned getNumberOfParts(Type *Tp) const {
563 unsigned getAddressComputationCost(Type *Tp, bool) const {
568 } // end anonymous namespace
570 INITIALIZE_AG_PASS(NoTTI, TargetTransformInfo, "notti",
571 "No target information", true, true, true)
574 ImmutablePass *llvm::createNoTargetTransformInfoPass() {