2009-10-13 18:30:07 +00:00
|
|
|
//===- InlineCost.cpp - Cost analysis for inliner -------------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements inline cost analysis.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Analysis/InlineCost.h"
|
|
|
|
#include "llvm/Support/CallSite.h"
|
|
|
|
#include "llvm/CallingConv.h"
|
|
|
|
#include "llvm/IntrinsicInst.h"
|
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
2011-02-05 00:49:15 +00:00
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2010-04-16 15:14:50 +00:00
|
|
|
/// callIsSmall - If a call is likely to lower to a single target instruction,
|
|
|
|
/// or is otherwise deemed small return true.
|
|
|
|
/// TODO: Perhaps calls like memcpy, strcpy, etc?
|
|
|
|
bool llvm::callIsSmall(const Function *F) {
|
2010-01-14 21:48:00 +00:00
|
|
|
if (!F) return false;
|
|
|
|
|
|
|
|
if (F->hasLocalLinkage()) return false;
|
|
|
|
|
2010-01-14 23:00:10 +00:00
|
|
|
if (!F->hasName()) return false;
|
|
|
|
|
|
|
|
StringRef Name = F->getName();
|
|
|
|
|
|
|
|
// These will all likely lower to a single selection DAG node.
|
2010-03-15 14:01:44 +00:00
|
|
|
if (Name == "copysign" || Name == "copysignf" || Name == "copysignl" ||
|
2010-01-14 23:00:10 +00:00
|
|
|
Name == "fabs" || Name == "fabsf" || Name == "fabsl" ||
|
|
|
|
Name == "sin" || Name == "sinf" || Name == "sinl" ||
|
|
|
|
Name == "cos" || Name == "cosf" || Name == "cosl" ||
|
|
|
|
Name == "sqrt" || Name == "sqrtf" || Name == "sqrtl" )
|
|
|
|
return true;
|
|
|
|
|
|
|
|
// These are all likely to be optimized into something smaller.
|
|
|
|
if (Name == "pow" || Name == "powf" || Name == "powl" ||
|
|
|
|
Name == "exp2" || Name == "exp2l" || Name == "exp2f" ||
|
|
|
|
Name == "floor" || Name == "floorf" || Name == "ceil" ||
|
|
|
|
Name == "round" || Name == "ffs" || Name == "ffsl" ||
|
|
|
|
Name == "abs" || Name == "labs" || Name == "llabs")
|
|
|
|
return true;
|
|
|
|
|
2010-01-14 20:12:34 +00:00
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
/// analyzeBasicBlock - Fill in the current structure with information gleaned
|
|
|
|
/// from the specified block.
|
2009-10-13 19:58:07 +00:00
|
|
|
void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB) {
|
2009-10-13 18:30:07 +00:00
|
|
|
++NumBlocks;
|
2010-03-13 01:05:02 +00:00
|
|
|
unsigned NumInstsBeforeThisBB = NumInsts;
|
2009-10-13 18:30:07 +00:00
|
|
|
for (BasicBlock::const_iterator II = BB->begin(), E = BB->end();
|
|
|
|
II != E; ++II) {
|
|
|
|
if (isa<PHINode>(II)) continue; // PHI nodes don't count.
|
|
|
|
|
|
|
|
// Special handling for calls.
|
|
|
|
if (isa<CallInst>(II) || isa<InvokeInst>(II)) {
|
|
|
|
if (isa<DbgInfoIntrinsic>(II))
|
|
|
|
continue; // Debug intrinsics don't count as size.
|
2010-07-27 14:15:29 +00:00
|
|
|
|
|
|
|
ImmutableCallSite CS(cast<Instruction>(II));
|
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
// If this function contains a call to setjmp or _setjmp, never inline
|
|
|
|
// it. This is a hack because we depend on the user marking their local
|
|
|
|
// variables as volatile if they are live across a setjmp call, and they
|
|
|
|
// probably won't do this in callers.
|
2010-07-27 14:15:29 +00:00
|
|
|
if (const Function *F = CS.getCalledFunction()) {
|
2010-09-09 20:32:23 +00:00
|
|
|
// If a function is both internal and has a single use, then it is
|
|
|
|
// extremely likely to get inlined in the future (it was probably
|
|
|
|
// exposed by an interleaved devirtualization pass).
|
|
|
|
if (F->hasInternalLinkage() && F->hasOneUse())
|
|
|
|
++NumInlineCandidates;
|
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
if (F->isDeclaration() &&
|
2009-10-13 20:10:10 +00:00
|
|
|
(F->getName() == "setjmp" || F->getName() == "_setjmp"))
|
2010-06-09 15:11:37 +00:00
|
|
|
callsSetJmp = true;
|
2010-04-30 22:37:22 +00:00
|
|
|
|
|
|
|
// If this call is to function itself, then the function is recursive.
|
|
|
|
// Inlining it into other functions is a bad idea, because this is
|
|
|
|
// basically just a form of loop peeling, and our metrics aren't useful
|
|
|
|
// for that case.
|
|
|
|
if (F == BB->getParent())
|
2010-06-09 15:11:37 +00:00
|
|
|
isRecursive = true;
|
2010-04-30 22:37:22 +00:00
|
|
|
}
|
2009-10-13 18:30:07 +00:00
|
|
|
|
2010-02-05 23:21:18 +00:00
|
|
|
if (!isa<IntrinsicInst>(II) && !callIsSmall(CS.getCalledFunction())) {
|
|
|
|
// Each argument to a call takes on average one instruction to set up.
|
|
|
|
NumInsts += CS.arg_size();
|
2010-05-26 22:40:28 +00:00
|
|
|
|
|
|
|
// We don't want inline asm to count as a call - that would prevent loop
|
|
|
|
// unrolling. The argument setup cost is still real, though.
|
|
|
|
if (!isa<InlineAsm>(CS.getCalledValue()))
|
|
|
|
++NumCalls;
|
2010-02-05 23:21:18 +00:00
|
|
|
}
|
2009-10-13 18:30:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (const AllocaInst *AI = dyn_cast<AllocaInst>(II)) {
|
|
|
|
if (!AI->isStaticAlloca())
|
|
|
|
this->usesDynamicAlloca = true;
|
|
|
|
}
|
|
|
|
|
2010-02-16 11:11:14 +00:00
|
|
|
if (isa<ExtractElementInst>(II) || II->getType()->isVectorTy())
|
2009-10-13 18:30:07 +00:00
|
|
|
++NumVectorInsts;
|
|
|
|
|
|
|
|
if (const CastInst *CI = dyn_cast<CastInst>(II)) {
|
2010-01-14 21:04:31 +00:00
|
|
|
// Noop casts, including ptr <-> int, don't count.
|
2009-10-13 18:30:07 +00:00
|
|
|
if (CI->isLosslessCast() || isa<IntToPtrInst>(CI) ||
|
|
|
|
isa<PtrToIntInst>(CI))
|
|
|
|
continue;
|
2010-01-14 21:04:31 +00:00
|
|
|
// Result of a cmp instruction is often extended (to be used by other
|
|
|
|
// cmp instructions, logical or return instructions). These are usually
|
|
|
|
// nop on most sane targets.
|
|
|
|
if (isa<CmpInst>(CI->getOperand(0)))
|
|
|
|
continue;
|
2009-11-01 03:07:53 +00:00
|
|
|
} else if (const GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(II)){
|
2009-10-13 18:30:07 +00:00
|
|
|
// If a GEP has all constant indices, it will probably be folded with
|
|
|
|
// a load/store.
|
|
|
|
if (GEPI->hasAllConstantIndices())
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
++NumInsts;
|
|
|
|
}
|
2009-11-01 03:07:53 +00:00
|
|
|
|
|
|
|
if (isa<ReturnInst>(BB->getTerminator()))
|
|
|
|
++NumRets;
|
|
|
|
|
2009-11-01 18:16:30 +00:00
|
|
|
// We never want to inline functions that contain an indirectbr. This is
|
2009-11-01 19:12:43 +00:00
|
|
|
// incorrect because all the blockaddress's (in static global initializers
|
|
|
|
// for example) would be referring to the original function, and this indirect
|
2009-11-01 18:16:30 +00:00
|
|
|
// jump would jump from the inlined copy of the function into the original
|
|
|
|
// function which is extremely undefined behavior.
|
2009-11-01 03:07:53 +00:00
|
|
|
if (isa<IndirectBrInst>(BB->getTerminator()))
|
2010-06-09 15:11:37 +00:00
|
|
|
containsIndirectBr = true;
|
2010-03-13 00:10:20 +00:00
|
|
|
|
|
|
|
// Remember NumInsts for this BB.
|
2010-03-13 01:05:02 +00:00
|
|
|
NumBBInsts[BB] = NumInsts - NumInstsBeforeThisBB;
|
2009-10-13 18:30:07 +00:00
|
|
|
}
|
|
|
|
|
2010-09-09 16:56:42 +00:00
|
|
|
// CountCodeReductionForConstant - Figure out an approximation for how many
|
|
|
|
// instructions will be constant folded if the specified value is constant.
|
|
|
|
//
|
|
|
|
unsigned CodeMetrics::CountCodeReductionForConstant(Value *V) {
|
|
|
|
unsigned Reduction = 0;
|
|
|
|
for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
|
|
|
|
User *U = *UI;
|
|
|
|
if (isa<BranchInst>(U) || isa<SwitchInst>(U)) {
|
|
|
|
// We will be able to eliminate all but one of the successors.
|
|
|
|
const TerminatorInst &TI = cast<TerminatorInst>(*U);
|
|
|
|
const unsigned NumSucc = TI.getNumSuccessors();
|
|
|
|
unsigned Instrs = 0;
|
|
|
|
for (unsigned I = 0; I != NumSucc; ++I)
|
|
|
|
Instrs += NumBBInsts[TI.getSuccessor(I)];
|
|
|
|
// We don't know which blocks will be eliminated, so use the average size.
|
|
|
|
Reduction += InlineConstants::InstrCost*Instrs*(NumSucc-1)/NumSucc;
|
|
|
|
} else {
|
|
|
|
// Figure out if this instruction will be removed due to simple constant
|
|
|
|
// propagation.
|
|
|
|
Instruction &Inst = cast<Instruction>(*U);
|
|
|
|
|
|
|
|
// We can't constant propagate instructions which have effects or
|
|
|
|
// read memory.
|
|
|
|
//
|
|
|
|
// FIXME: It would be nice to capture the fact that a load from a
|
|
|
|
// pointer-to-constant-global is actually a *really* good thing to zap.
|
|
|
|
// Unfortunately, we don't know the pointer that may get propagated here,
|
|
|
|
// so we can't make this decision.
|
|
|
|
if (Inst.mayReadFromMemory() || Inst.mayHaveSideEffects() ||
|
|
|
|
isa<AllocaInst>(Inst))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
bool AllOperandsConstant = true;
|
|
|
|
for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i)
|
|
|
|
if (!isa<Constant>(Inst.getOperand(i)) && Inst.getOperand(i) != V) {
|
|
|
|
AllOperandsConstant = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (AllOperandsConstant) {
|
|
|
|
// We will get to remove this instruction...
|
|
|
|
Reduction += InlineConstants::InstrCost;
|
|
|
|
|
|
|
|
// And any other instructions that use it which become constants
|
|
|
|
// themselves.
|
|
|
|
Reduction += CountCodeReductionForConstant(&Inst);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return Reduction;
|
|
|
|
}
|
|
|
|
|
|
|
|
// CountCodeReductionForAlloca - Figure out an approximation of how much smaller
|
|
|
|
// the function will be if it is inlined into a context where an argument
|
|
|
|
// becomes an alloca.
|
|
|
|
//
|
|
|
|
unsigned CodeMetrics::CountCodeReductionForAlloca(Value *V) {
|
|
|
|
if (!V->getType()->isPointerTy()) return 0; // Not a pointer
|
|
|
|
unsigned Reduction = 0;
|
|
|
|
for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
|
|
|
|
Instruction *I = cast<Instruction>(*UI);
|
|
|
|
if (isa<LoadInst>(I) || isa<StoreInst>(I))
|
|
|
|
Reduction += InlineConstants::InstrCost;
|
|
|
|
else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(I)) {
|
|
|
|
// If the GEP has variable indices, we won't be able to do much with it.
|
|
|
|
if (GEP->hasAllConstantIndices())
|
|
|
|
Reduction += CountCodeReductionForAlloca(GEP);
|
|
|
|
} else if (BitCastInst *BCI = dyn_cast<BitCastInst>(I)) {
|
|
|
|
// Track pointer through bitcasts.
|
|
|
|
Reduction += CountCodeReductionForAlloca(BCI);
|
|
|
|
} else {
|
|
|
|
// If there is some other strange instruction, we're not going to be able
|
|
|
|
// to do much if we inline this.
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return Reduction;
|
|
|
|
}
|
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
/// analyzeFunction - Fill in the current structure with information gleaned
|
|
|
|
/// from the specified function.
|
2009-10-13 19:58:07 +00:00
|
|
|
void CodeMetrics::analyzeFunction(Function *F) {
|
|
|
|
// Look at the size of the callee.
|
2009-10-13 18:30:07 +00:00
|
|
|
for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
|
|
|
|
analyzeBasicBlock(&*BB);
|
2009-10-13 19:58:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// analyzeFunction - Fill in the current structure with information gleaned
|
|
|
|
/// from the specified function.
|
|
|
|
void InlineCostAnalyzer::FunctionInfo::analyzeFunction(Function *F) {
|
|
|
|
Metrics.analyzeFunction(F);
|
2009-10-13 18:30:07 +00:00
|
|
|
|
|
|
|
// A function with exactly one return has it removed during the inlining
|
|
|
|
// process (see InlineFunction), so don't count it.
|
2009-10-13 19:58:07 +00:00
|
|
|
// FIXME: This knowledge should really be encoded outside of FunctionInfo.
|
|
|
|
if (Metrics.NumRets==1)
|
|
|
|
--Metrics.NumInsts;
|
2009-10-13 18:30:07 +00:00
|
|
|
|
2010-01-26 21:31:24 +00:00
|
|
|
// Don't bother calculating argument weights if we are never going to inline
|
|
|
|
// the function anyway.
|
2010-06-09 15:11:37 +00:00
|
|
|
if (NeverInline())
|
2010-01-26 21:31:24 +00:00
|
|
|
return;
|
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
// Check out all of the arguments to the function, figuring out how much
|
|
|
|
// code can be eliminated if one of the arguments is a constant.
|
2010-01-26 21:31:24 +00:00
|
|
|
ArgumentWeights.reserve(F->arg_size());
|
2009-10-13 18:30:07 +00:00
|
|
|
for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I)
|
2010-09-09 16:56:42 +00:00
|
|
|
ArgumentWeights.push_back(ArgInfo(Metrics.CountCodeReductionForConstant(I),
|
2011-02-01 01:16:32 +00:00
|
|
|
Metrics.CountCodeReductionForAlloca(I)));
|
2009-10-13 18:30:07 +00:00
|
|
|
}
|
|
|
|
|
2010-06-09 15:11:37 +00:00
|
|
|
/// NeverInline - returns true if the function should never be inlined into
|
|
|
|
/// any caller
|
2011-02-01 01:16:32 +00:00
|
|
|
bool InlineCostAnalyzer::FunctionInfo::NeverInline() {
|
2010-06-09 15:11:37 +00:00
|
|
|
return (Metrics.callsSetJmp || Metrics.isRecursive ||
|
|
|
|
Metrics.containsIndirectBr);
|
|
|
|
}
|
2010-10-09 22:06:36 +00:00
|
|
|
// getSpecializationBonus - The heuristic used to determine the per-call
|
|
|
|
// performance boost for using a specialization of Callee with argument
|
|
|
|
// specializedArgNo replaced by a constant.
|
|
|
|
int InlineCostAnalyzer::getSpecializationBonus(Function *Callee,
|
|
|
|
SmallVectorImpl<unsigned> &SpecializedArgNos)
|
|
|
|
{
|
|
|
|
if (Callee->mayBeOverridden())
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
int Bonus = 0;
|
|
|
|
// If this function uses the coldcc calling convention, prefer not to
|
|
|
|
// specialize it.
|
|
|
|
if (Callee->getCallingConv() == CallingConv::Cold)
|
|
|
|
Bonus -= InlineConstants::ColdccPenalty;
|
|
|
|
|
|
|
|
// Get information about the callee.
|
|
|
|
FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
|
|
|
|
|
|
|
|
// If we haven't calculated this information yet, do so now.
|
|
|
|
if (CalleeFI->Metrics.NumBlocks == 0)
|
|
|
|
CalleeFI->analyzeFunction(Callee);
|
|
|
|
|
2011-02-01 01:16:32 +00:00
|
|
|
unsigned ArgNo = 0;
|
|
|
|
unsigned i = 0;
|
|
|
|
for (Function::arg_iterator I = Callee->arg_begin(), E = Callee->arg_end();
|
|
|
|
I != E; ++I, ++ArgNo)
|
|
|
|
if (ArgNo == SpecializedArgNos[i]) {
|
|
|
|
++i;
|
|
|
|
Bonus += CountBonusForConstant(I);
|
|
|
|
}
|
2011-01-26 01:09:59 +00:00
|
|
|
|
2010-10-09 22:06:36 +00:00
|
|
|
// Calls usually take a long time, so they make the specialization gain
|
|
|
|
// smaller.
|
|
|
|
Bonus -= CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty;
|
|
|
|
|
|
|
|
return Bonus;
|
|
|
|
}
|
|
|
|
|
2011-02-05 00:49:15 +00:00
|
|
|
// ConstantFunctionBonus - Figure out how much of a bonus we can get for
|
|
|
|
// possibly devirtualizing a function. We'll subtract the size of the function
|
|
|
|
// we may wish to inline from the indirect call bonus providing a limit on
|
|
|
|
// growth. Leave an upper limit of 0 for the bonus - we don't want to penalize
|
|
|
|
// inlining because we decide we don't want to give a bonus for
|
|
|
|
// devirtualizing.
|
|
|
|
int InlineCostAnalyzer::ConstantFunctionBonus(CallSite CS, Constant *C) {
|
|
|
|
|
|
|
|
// This could just be NULL.
|
|
|
|
if (!C) return 0;
|
|
|
|
|
|
|
|
Function *F = dyn_cast<Function>(C);
|
|
|
|
if (!F) return 0;
|
|
|
|
|
|
|
|
int Bonus = InlineConstants::IndirectCallBonus + getInlineSize(CS, F);
|
|
|
|
return (Bonus > 0) ? 0 : Bonus;
|
|
|
|
}
|
|
|
|
|
2011-02-01 01:16:32 +00:00
|
|
|
// CountBonusForConstant - Figure out an approximation for how much per-call
|
|
|
|
// performance boost we can expect if the specified value is constant.
|
2011-02-05 00:49:15 +00:00
|
|
|
int InlineCostAnalyzer::CountBonusForConstant(Value *V, Constant *C) {
|
2011-02-01 01:16:32 +00:00
|
|
|
unsigned Bonus = 0;
|
|
|
|
for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
|
|
|
|
User *U = *UI;
|
|
|
|
if (CallInst *CI = dyn_cast<CallInst>(U)) {
|
|
|
|
// Turning an indirect call into a direct call is a BIG win
|
|
|
|
if (CI->getCalledValue() == V)
|
2011-02-05 00:49:15 +00:00
|
|
|
Bonus += ConstantFunctionBonus(CallSite(CI), C);
|
|
|
|
} else if (InvokeInst *II = dyn_cast<InvokeInst>(U)) {
|
2011-02-01 01:16:32 +00:00
|
|
|
// Turning an indirect call into a direct call is a BIG win
|
|
|
|
if (II->getCalledValue() == V)
|
2011-02-05 00:49:15 +00:00
|
|
|
Bonus += ConstantFunctionBonus(CallSite(CI), C);
|
2011-02-01 01:16:32 +00:00
|
|
|
}
|
|
|
|
// FIXME: Eliminating conditional branches and switches should
|
|
|
|
// also yield a per-call performance boost.
|
|
|
|
else {
|
|
|
|
// Figure out the bonuses that wll accrue due to simple constant
|
|
|
|
// propagation.
|
|
|
|
Instruction &Inst = cast<Instruction>(*U);
|
|
|
|
|
|
|
|
// We can't constant propagate instructions which have effects or
|
|
|
|
// read memory.
|
|
|
|
//
|
|
|
|
// FIXME: It would be nice to capture the fact that a load from a
|
|
|
|
// pointer-to-constant-global is actually a *really* good thing to zap.
|
|
|
|
// Unfortunately, we don't know the pointer that may get propagated here,
|
|
|
|
// so we can't make this decision.
|
|
|
|
if (Inst.mayReadFromMemory() || Inst.mayHaveSideEffects() ||
|
|
|
|
isa<AllocaInst>(Inst))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
bool AllOperandsConstant = true;
|
|
|
|
for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i)
|
|
|
|
if (!isa<Constant>(Inst.getOperand(i)) && Inst.getOperand(i) != V) {
|
|
|
|
AllOperandsConstant = false;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (AllOperandsConstant)
|
|
|
|
Bonus += CountBonusForConstant(&Inst);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-02-05 00:49:15 +00:00
|
|
|
return Bonus;
|
|
|
|
}
|
|
|
|
|
|
|
|
int InlineCostAnalyzer::getInlineSize(CallSite CS, Function *Callee) {
|
|
|
|
// Get information about the callee.
|
|
|
|
FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
|
|
|
|
|
|
|
|
// If we haven't calculated this information yet, do so now.
|
|
|
|
if (CalleeFI->Metrics.NumBlocks == 0)
|
|
|
|
CalleeFI->analyzeFunction(Callee);
|
|
|
|
|
|
|
|
// InlineCost - This value measures how good of an inline candidate this call
|
|
|
|
// site is to inline. A lower inline cost make is more likely for the call to
|
|
|
|
// be inlined. This value may go negative.
|
|
|
|
//
|
|
|
|
int InlineCost = 0;
|
|
|
|
|
|
|
|
// Compute any size reductions we can expect due to arguments being passed into
|
|
|
|
// the function.
|
|
|
|
//
|
|
|
|
unsigned ArgNo = 0;
|
|
|
|
CallSite::arg_iterator I = CS.arg_begin();
|
|
|
|
for (Function::arg_iterator FI = Callee->arg_begin(), FE = Callee->arg_end();
|
|
|
|
FI != FE; ++I, ++FI, ++ArgNo) {
|
|
|
|
|
|
|
|
// If an alloca is passed in, inlining this function is likely to allow
|
|
|
|
// significant future optimization possibilities (like scalar promotion, and
|
|
|
|
// scalarization), so encourage the inlining of the function.
|
|
|
|
//
|
|
|
|
if (isa<AllocaInst>(I))
|
|
|
|
InlineCost -= CalleeFI->ArgumentWeights[ArgNo].AllocaWeight;
|
|
|
|
|
|
|
|
// If this is a constant being passed into the function, use the argument
|
|
|
|
// weights calculated for the callee to determine how much will be folded
|
|
|
|
// away with this information.
|
|
|
|
else if (isa<Constant>(I))
|
|
|
|
InlineCost -= CalleeFI->ArgumentWeights[ArgNo].ConstantWeight;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Each argument passed in has a cost at both the caller and the callee
|
|
|
|
// sides. Measurements show that each argument costs about the same as an
|
|
|
|
// instruction.
|
|
|
|
InlineCost -= (CS.arg_size() * InlineConstants::InstrCost);
|
|
|
|
|
|
|
|
// Now that we have considered all of the factors that make the call site more
|
|
|
|
// likely to be inlined, look at factors that make us not want to inline it.
|
|
|
|
|
|
|
|
// Calls usually take a long time, so they make the inlining gain smaller.
|
|
|
|
InlineCost += CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty;
|
|
|
|
|
|
|
|
// Look at the size of the callee. Each instruction counts as 5.
|
|
|
|
InlineCost += CalleeFI->Metrics.NumInsts*InlineConstants::InstrCost;
|
|
|
|
|
|
|
|
return InlineCost;
|
|
|
|
}
|
|
|
|
|
|
|
|
int InlineCostAnalyzer::getInlineBonuses(CallSite CS, Function *Callee) {
|
|
|
|
// Get information about the callee.
|
|
|
|
FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
|
|
|
|
|
|
|
|
// If we haven't calculated this information yet, do so now.
|
|
|
|
if (CalleeFI->Metrics.NumBlocks == 0)
|
|
|
|
CalleeFI->analyzeFunction(Callee);
|
|
|
|
|
|
|
|
bool isDirectCall = CS.getCalledFunction() == Callee;
|
|
|
|
Instruction *TheCall = CS.getInstruction();
|
|
|
|
int Bonus = 0;
|
|
|
|
|
|
|
|
// If there is only one call of the function, and it has internal linkage,
|
|
|
|
// make it almost guaranteed to be inlined.
|
|
|
|
//
|
|
|
|
if (Callee->hasLocalLinkage() && Callee->hasOneUse() && isDirectCall)
|
|
|
|
Bonus += InlineConstants::LastCallToStaticBonus;
|
|
|
|
|
|
|
|
// If the instruction after the call, or if the normal destination of the
|
|
|
|
// invoke is an unreachable instruction, the function is noreturn. As such,
|
|
|
|
// there is little point in inlining this.
|
|
|
|
if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
|
|
|
|
if (isa<UnreachableInst>(II->getNormalDest()->begin()))
|
|
|
|
Bonus += InlineConstants::NoreturnPenalty;
|
|
|
|
} else if (isa<UnreachableInst>(++BasicBlock::iterator(TheCall)))
|
|
|
|
Bonus += InlineConstants::NoreturnPenalty;
|
|
|
|
|
|
|
|
// If this function uses the coldcc calling convention, prefer not to inline
|
|
|
|
// it.
|
|
|
|
if (Callee->getCallingConv() == CallingConv::Cold)
|
|
|
|
Bonus += InlineConstants::ColdccPenalty;
|
2011-02-01 01:16:32 +00:00
|
|
|
|
2011-02-05 00:49:15 +00:00
|
|
|
// Add to the inline quality for properties that make the call valuable to
|
|
|
|
// inline. This includes factors that indicate that the result of inlining
|
|
|
|
// the function will be optimizable. Currently this just looks at arguments
|
|
|
|
// passed into the function.
|
|
|
|
//
|
|
|
|
CallSite::arg_iterator I = CS.arg_begin();
|
|
|
|
for (Function::arg_iterator FI = Callee->arg_begin(), FE = Callee->arg_end();
|
|
|
|
FI != FE; ++I, ++FI)
|
|
|
|
// Compute any constant bonus due to inlining we want to give here.
|
|
|
|
if (isa<Constant>(I))
|
|
|
|
Bonus += CountBonusForConstant(FI, cast<Constant>(I));
|
|
|
|
|
2011-02-01 01:16:32 +00:00
|
|
|
return Bonus;
|
|
|
|
}
|
2010-10-09 22:06:36 +00:00
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
// getInlineCost - The heuristic used to determine if we should inline the
|
|
|
|
// function call or not.
|
|
|
|
//
|
|
|
|
InlineCost InlineCostAnalyzer::getInlineCost(CallSite CS,
|
2010-04-17 17:55:00 +00:00
|
|
|
SmallPtrSet<const Function*, 16> &NeverInline) {
|
2010-05-01 15:47:41 +00:00
|
|
|
return getInlineCost(CS, CS.getCalledFunction(), NeverInline);
|
|
|
|
}
|
|
|
|
|
|
|
|
InlineCost InlineCostAnalyzer::getInlineCost(CallSite CS,
|
|
|
|
Function *Callee,
|
|
|
|
SmallPtrSet<const Function*, 16> &NeverInline) {
|
2009-10-13 18:30:07 +00:00
|
|
|
Instruction *TheCall = CS.getInstruction();
|
|
|
|
Function *Caller = TheCall->getParent()->getParent();
|
|
|
|
|
|
|
|
// Don't inline functions which can be redefined at link-time to mean
|
2010-03-25 04:49:10 +00:00
|
|
|
// something else. Don't inline functions marked noinline or call sites
|
|
|
|
// marked noinline.
|
2009-10-13 18:30:07 +00:00
|
|
|
if (Callee->mayBeOverridden() ||
|
2010-03-25 04:49:10 +00:00
|
|
|
Callee->hasFnAttr(Attribute::NoInline) || NeverInline.count(Callee) ||
|
|
|
|
CS.isNoInline())
|
2009-10-13 18:30:07 +00:00
|
|
|
return llvm::InlineCost::getNever();
|
|
|
|
|
2010-04-17 17:55:00 +00:00
|
|
|
// Get information about the callee.
|
|
|
|
FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
|
2009-10-13 18:30:07 +00:00
|
|
|
|
|
|
|
// If we haven't calculated this information yet, do so now.
|
2010-04-17 17:55:00 +00:00
|
|
|
if (CalleeFI->Metrics.NumBlocks == 0)
|
|
|
|
CalleeFI->analyzeFunction(Callee);
|
2009-10-13 18:30:07 +00:00
|
|
|
|
|
|
|
// If we should never inline this, return a huge cost.
|
2010-06-09 15:11:37 +00:00
|
|
|
if (CalleeFI->NeverInline())
|
2009-10-13 18:30:07 +00:00
|
|
|
return InlineCost::getNever();
|
|
|
|
|
2010-04-17 17:55:00 +00:00
|
|
|
// FIXME: It would be nice to kill off CalleeFI->NeverInline. Then we
|
2009-10-13 19:58:07 +00:00
|
|
|
// could move this up and avoid computing the FunctionInfo for
|
2009-10-13 18:30:07 +00:00
|
|
|
// things we are going to just return always inline for. This
|
|
|
|
// requires handling setjmp somewhere else, however.
|
|
|
|
if (!Callee->isDeclaration() && Callee->hasFnAttr(Attribute::AlwaysInline))
|
|
|
|
return InlineCost::getAlways();
|
|
|
|
|
2010-04-17 17:55:00 +00:00
|
|
|
if (CalleeFI->Metrics.usesDynamicAlloca) {
|
|
|
|
// Get infomation about the caller.
|
2009-10-13 19:58:07 +00:00
|
|
|
FunctionInfo &CallerFI = CachedFunctionInfo[Caller];
|
2009-10-13 18:30:07 +00:00
|
|
|
|
|
|
|
// If we haven't calculated this information yet, do so now.
|
2010-04-17 17:57:56 +00:00
|
|
|
if (CallerFI.Metrics.NumBlocks == 0) {
|
2009-10-13 18:30:07 +00:00
|
|
|
CallerFI.analyzeFunction(Caller);
|
2010-04-17 17:57:56 +00:00
|
|
|
|
|
|
|
// Recompute the CalleeFI pointer, getting Caller could have invalidated
|
|
|
|
// it.
|
|
|
|
CalleeFI = &CachedFunctionInfo[Callee];
|
|
|
|
}
|
2009-10-13 18:30:07 +00:00
|
|
|
|
|
|
|
// Don't inline a callee with dynamic alloca into a caller without them.
|
|
|
|
// Functions containing dynamic alloca's are inefficient in various ways;
|
|
|
|
// don't create more inefficiency.
|
2009-10-13 19:58:07 +00:00
|
|
|
if (!CallerFI.Metrics.usesDynamicAlloca)
|
2009-10-13 18:30:07 +00:00
|
|
|
return InlineCost::getNever();
|
|
|
|
}
|
|
|
|
|
2011-01-25 01:34:31 +00:00
|
|
|
// InlineCost - This value measures how good of an inline candidate this call
|
|
|
|
// site is to inline. A lower inline cost make is more likely for the call to
|
2011-02-05 00:49:15 +00:00
|
|
|
// be inlined. This value may go negative due to the fact that bonuses
|
|
|
|
// are negative numbers.
|
2011-01-25 01:34:31 +00:00
|
|
|
//
|
2011-02-05 00:49:15 +00:00
|
|
|
int InlineCost = getInlineSize(CS, Callee) + getInlineBonuses(CS, Callee);
|
2009-10-13 18:30:07 +00:00
|
|
|
return llvm::InlineCost::get(InlineCost);
|
|
|
|
}
|
|
|
|
|
2010-10-09 22:06:36 +00:00
|
|
|
// getSpecializationCost - The heuristic used to determine the code-size
|
|
|
|
// impact of creating a specialized version of Callee with argument
|
|
|
|
// SpecializedArgNo replaced by a constant.
|
|
|
|
InlineCost InlineCostAnalyzer::getSpecializationCost(Function *Callee,
|
|
|
|
SmallVectorImpl<unsigned> &SpecializedArgNos)
|
|
|
|
{
|
|
|
|
// Don't specialize functions which can be redefined at link-time to mean
|
|
|
|
// something else.
|
|
|
|
if (Callee->mayBeOverridden())
|
|
|
|
return llvm::InlineCost::getNever();
|
|
|
|
|
|
|
|
// Get information about the callee.
|
|
|
|
FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
|
|
|
|
|
|
|
|
// If we haven't calculated this information yet, do so now.
|
|
|
|
if (CalleeFI->Metrics.NumBlocks == 0)
|
|
|
|
CalleeFI->analyzeFunction(Callee);
|
|
|
|
|
|
|
|
int Cost = 0;
|
|
|
|
|
|
|
|
// Look at the orginal size of the callee. Each instruction counts as 5.
|
|
|
|
Cost += CalleeFI->Metrics.NumInsts * InlineConstants::InstrCost;
|
|
|
|
|
|
|
|
// Offset that with the amount of code that can be constant-folded
|
|
|
|
// away with the given arguments replaced by constants.
|
|
|
|
for (SmallVectorImpl<unsigned>::iterator an = SpecializedArgNos.begin(),
|
|
|
|
ae = SpecializedArgNos.end(); an != ae; ++an)
|
|
|
|
Cost -= CalleeFI->ArgumentWeights[*an].ConstantWeight;
|
|
|
|
|
|
|
|
return llvm::InlineCost::get(Cost);
|
|
|
|
}
|
|
|
|
|
2009-10-13 18:30:07 +00:00
|
|
|
// getInlineFudgeFactor - Return a > 1.0 factor if the inliner should use a
|
|
|
|
// higher threshold to determine if the function call should be inlined.
|
|
|
|
float InlineCostAnalyzer::getInlineFudgeFactor(CallSite CS) {
|
|
|
|
Function *Callee = CS.getCalledFunction();
|
|
|
|
|
2010-04-17 17:55:00 +00:00
|
|
|
// Get information about the callee.
|
2009-10-13 19:58:07 +00:00
|
|
|
FunctionInfo &CalleeFI = CachedFunctionInfo[Callee];
|
2009-10-13 18:30:07 +00:00
|
|
|
|
|
|
|
// If we haven't calculated this information yet, do so now.
|
2009-10-13 19:58:07 +00:00
|
|
|
if (CalleeFI.Metrics.NumBlocks == 0)
|
2009-10-13 18:30:07 +00:00
|
|
|
CalleeFI.analyzeFunction(Callee);
|
|
|
|
|
|
|
|
float Factor = 1.0f;
|
|
|
|
// Single BB functions are often written to be inlined.
|
2009-10-13 19:58:07 +00:00
|
|
|
if (CalleeFI.Metrics.NumBlocks == 1)
|
2009-10-13 18:30:07 +00:00
|
|
|
Factor += 0.5f;
|
|
|
|
|
|
|
|
// Be more aggressive if the function contains a good chunk (if it mades up
|
|
|
|
// at least 10% of the instructions) of vector instructions.
|
2009-10-13 19:58:07 +00:00
|
|
|
if (CalleeFI.Metrics.NumVectorInsts > CalleeFI.Metrics.NumInsts/2)
|
2009-10-13 18:30:07 +00:00
|
|
|
Factor += 2.0f;
|
2009-10-13 19:58:07 +00:00
|
|
|
else if (CalleeFI.Metrics.NumVectorInsts > CalleeFI.Metrics.NumInsts/10)
|
2009-10-13 18:30:07 +00:00
|
|
|
Factor += 1.5f;
|
|
|
|
return Factor;
|
|
|
|
}
|
2010-03-09 23:02:17 +00:00
|
|
|
|
|
|
|
/// growCachedCostInfo - update the cached cost info for Caller after Callee has
|
|
|
|
/// been inlined.
|
|
|
|
void
|
2010-04-17 17:55:00 +00:00
|
|
|
InlineCostAnalyzer::growCachedCostInfo(Function *Caller, Function *Callee) {
|
|
|
|
CodeMetrics &CallerMetrics = CachedFunctionInfo[Caller].Metrics;
|
2010-03-09 23:02:17 +00:00
|
|
|
|
|
|
|
// For small functions we prefer to recalculate the cost for better accuracy.
|
2010-04-17 17:55:00 +00:00
|
|
|
if (CallerMetrics.NumBlocks < 10 || CallerMetrics.NumInsts < 1000) {
|
2010-03-09 23:02:17 +00:00
|
|
|
resetCachedCostInfo(Caller);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// For large functions, we can save a lot of computation time by skipping
|
|
|
|
// recalculations.
|
2010-04-17 17:55:00 +00:00
|
|
|
if (CallerMetrics.NumCalls > 0)
|
|
|
|
--CallerMetrics.NumCalls;
|
|
|
|
|
|
|
|
if (Callee == 0) return;
|
|
|
|
|
|
|
|
CodeMetrics &CalleeMetrics = CachedFunctionInfo[Callee].Metrics;
|
|
|
|
|
|
|
|
// If we don't have metrics for the callee, don't recalculate them just to
|
|
|
|
// update an approximation in the caller. Instead, just recalculate the
|
|
|
|
// caller info from scratch.
|
|
|
|
if (CalleeMetrics.NumBlocks == 0) {
|
|
|
|
resetCachedCostInfo(Caller);
|
|
|
|
return;
|
2010-03-09 23:02:17 +00:00
|
|
|
}
|
2010-04-17 17:55:00 +00:00
|
|
|
|
2010-04-17 17:57:56 +00:00
|
|
|
// Since CalleeMetrics were already calculated, we know that the CallerMetrics
|
2010-06-09 15:11:37 +00:00
|
|
|
// reference isn't invalidated: both were in the DenseMap.
|
2010-04-17 17:55:00 +00:00
|
|
|
CallerMetrics.usesDynamicAlloca |= CalleeMetrics.usesDynamicAlloca;
|
|
|
|
|
2010-06-09 15:11:37 +00:00
|
|
|
// FIXME: If any of these three are true for the callee, the callee was
|
|
|
|
// not inlined into the caller, so I think they're redundant here.
|
|
|
|
CallerMetrics.callsSetJmp |= CalleeMetrics.callsSetJmp;
|
|
|
|
CallerMetrics.isRecursive |= CalleeMetrics.isRecursive;
|
|
|
|
CallerMetrics.containsIndirectBr |= CalleeMetrics.containsIndirectBr;
|
|
|
|
|
2010-04-17 17:55:00 +00:00
|
|
|
CallerMetrics.NumInsts += CalleeMetrics.NumInsts;
|
|
|
|
CallerMetrics.NumBlocks += CalleeMetrics.NumBlocks;
|
|
|
|
CallerMetrics.NumCalls += CalleeMetrics.NumCalls;
|
|
|
|
CallerMetrics.NumVectorInsts += CalleeMetrics.NumVectorInsts;
|
|
|
|
CallerMetrics.NumRets += CalleeMetrics.NumRets;
|
|
|
|
|
|
|
|
// analyzeBasicBlock counts each function argument as an inst.
|
|
|
|
if (CallerMetrics.NumInsts >= Callee->arg_size())
|
|
|
|
CallerMetrics.NumInsts -= Callee->arg_size();
|
|
|
|
else
|
|
|
|
CallerMetrics.NumInsts = 0;
|
|
|
|
|
2010-05-12 21:48:15 +00:00
|
|
|
// We are not updating the argument weights. We have already determined that
|
2010-03-09 23:02:17 +00:00
|
|
|
// Caller is a fairly large function, so we accept the loss of precision.
|
|
|
|
}
|
2010-05-12 21:48:15 +00:00
|
|
|
|
|
|
|
/// clear - empty the cache of inline costs
|
|
|
|
void InlineCostAnalyzer::clear() {
|
|
|
|
CachedFunctionInfo.clear();
|
|
|
|
}
|