1 //===- InlineCost.cpp - Cost analysis for inliner -------------------------===//
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 // This file implements inline cost analysis.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/Analysis/InlineCost.h"
15 #include "llvm/Support/CallSite.h"
16 #include "llvm/CallingConv.h"
17 #include "llvm/IntrinsicInst.h"
18 #include "llvm/Target/TargetData.h"
19 #include "llvm/ADT/SmallPtrSet.h"
23 /// callIsSmall - If a call is likely to lower to a single target instruction,
24 /// or is otherwise deemed small return true.
25 /// TODO: Perhaps calls like memcpy, strcpy, etc?
26 bool llvm::callIsSmall(const Function *F) {
29 if (F->hasLocalLinkage()) return false;
31 if (!F->hasName()) return false;
33 StringRef Name = F->getName();
35 // These will all likely lower to a single selection DAG node.
36 if (Name == "copysign" || Name == "copysignf" || Name == "copysignl" ||
37 Name == "fabs" || Name == "fabsf" || Name == "fabsl" ||
38 Name == "sin" || Name == "sinf" || Name == "sinl" ||
39 Name == "cos" || Name == "cosf" || Name == "cosl" ||
40 Name == "sqrt" || Name == "sqrtf" || Name == "sqrtl" )
43 // These are all likely to be optimized into something smaller.
44 if (Name == "pow" || Name == "powf" || Name == "powl" ||
45 Name == "exp2" || Name == "exp2l" || Name == "exp2f" ||
46 Name == "floor" || Name == "floorf" || Name == "ceil" ||
47 Name == "round" || Name == "ffs" || Name == "ffsl" ||
48 Name == "abs" || Name == "labs" || Name == "llabs")
54 /// analyzeBasicBlock - Fill in the current structure with information gleaned
55 /// from the specified block.
56 void CodeMetrics::analyzeBasicBlock(const BasicBlock *BB,
57 const TargetData *TD) {
59 unsigned NumInstsBeforeThisBB = NumInsts;
60 for (BasicBlock::const_iterator II = BB->begin(), E = BB->end();
62 if (isa<PHINode>(II)) continue; // PHI nodes don't count.
64 // Special handling for calls.
65 if (isa<CallInst>(II) || isa<InvokeInst>(II)) {
66 if (isa<DbgInfoIntrinsic>(II))
67 continue; // Debug intrinsics don't count as size.
69 ImmutableCallSite CS(cast<Instruction>(II));
71 if (const Function *F = CS.getCalledFunction()) {
72 // If a function is both internal and has a single use, then it is
73 // extremely likely to get inlined in the future (it was probably
74 // exposed by an interleaved devirtualization pass).
75 if (F->hasInternalLinkage() && F->hasOneUse())
76 ++NumInlineCandidates;
78 // If this call is to function itself, then the function is recursive.
79 // Inlining it into other functions is a bad idea, because this is
80 // basically just a form of loop peeling, and our metrics aren't useful
82 if (F == BB->getParent())
86 if (!isa<IntrinsicInst>(II) && !callIsSmall(CS.getCalledFunction())) {
87 // Each argument to a call takes on average one instruction to set up.
88 NumInsts += CS.arg_size();
90 // We don't want inline asm to count as a call - that would prevent loop
91 // unrolling. The argument setup cost is still real, though.
92 if (!isa<InlineAsm>(CS.getCalledValue()))
97 if (const AllocaInst *AI = dyn_cast<AllocaInst>(II)) {
98 if (!AI->isStaticAlloca())
99 this->usesDynamicAlloca = true;
102 if (isa<ExtractElementInst>(II) || II->getType()->isVectorTy())
105 if (const CastInst *CI = dyn_cast<CastInst>(II)) {
106 // Noop casts, including ptr <-> int, don't count.
107 if (CI->isLosslessCast() || isa<IntToPtrInst>(CI) ||
108 isa<PtrToIntInst>(CI))
110 // trunc to a native type is free (assuming the target has compare and
111 // shift-right of the same width).
112 if (isa<TruncInst>(CI) && TD &&
113 TD->isLegalInteger(TD->getTypeSizeInBits(CI->getType())))
115 // Result of a cmp instruction is often extended (to be used by other
116 // cmp instructions, logical or return instructions). These are usually
117 // nop on most sane targets.
118 if (isa<CmpInst>(CI->getOperand(0)))
120 } else if (const GetElementPtrInst *GEPI = dyn_cast<GetElementPtrInst>(II)){
121 // If a GEP has all constant indices, it will probably be folded with
123 if (GEPI->hasAllConstantIndices())
130 if (isa<ReturnInst>(BB->getTerminator()))
133 // We never want to inline functions that contain an indirectbr. This is
134 // incorrect because all the blockaddress's (in static global initializers
135 // for example) would be referring to the original function, and this indirect
136 // jump would jump from the inlined copy of the function into the original
137 // function which is extremely undefined behavior.
138 // FIXME: This logic isn't really right; we can safely inline functions
139 // with indirectbr's as long as no other function or global references the
140 // blockaddress of a block within the current function. And as a QOI issue,
141 // if someone is using a blockaddress wihtout an indirectbr, and that
142 // reference somehow ends up in another function or global, we probably
143 // don't want to inline this function.
144 if (isa<IndirectBrInst>(BB->getTerminator()))
145 containsIndirectBr = true;
147 // Remember NumInsts for this BB.
148 NumBBInsts[BB] = NumInsts - NumInstsBeforeThisBB;
151 // CountCodeReductionForConstant - Figure out an approximation for how many
152 // instructions will be constant folded if the specified value is constant.
154 unsigned CodeMetrics::CountCodeReductionForConstant(Value *V) {
155 unsigned Reduction = 0;
156 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
158 if (isa<BranchInst>(U) || isa<SwitchInst>(U)) {
159 // We will be able to eliminate all but one of the successors.
160 const TerminatorInst &TI = cast<TerminatorInst>(*U);
161 const unsigned NumSucc = TI.getNumSuccessors();
163 for (unsigned I = 0; I != NumSucc; ++I)
164 Instrs += NumBBInsts[TI.getSuccessor(I)];
165 // We don't know which blocks will be eliminated, so use the average size.
166 Reduction += InlineConstants::InstrCost*Instrs*(NumSucc-1)/NumSucc;
168 // Figure out if this instruction will be removed due to simple constant
170 Instruction &Inst = cast<Instruction>(*U);
172 // We can't constant propagate instructions which have effects or
175 // FIXME: It would be nice to capture the fact that a load from a
176 // pointer-to-constant-global is actually a *really* good thing to zap.
177 // Unfortunately, we don't know the pointer that may get propagated here,
178 // so we can't make this decision.
179 if (Inst.mayReadFromMemory() || Inst.mayHaveSideEffects() ||
180 isa<AllocaInst>(Inst))
183 bool AllOperandsConstant = true;
184 for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i)
185 if (!isa<Constant>(Inst.getOperand(i)) && Inst.getOperand(i) != V) {
186 AllOperandsConstant = false;
190 if (AllOperandsConstant) {
191 // We will get to remove this instruction...
192 Reduction += InlineConstants::InstrCost;
194 // And any other instructions that use it which become constants
196 Reduction += CountCodeReductionForConstant(&Inst);
203 // CountCodeReductionForAlloca - Figure out an approximation of how much smaller
204 // the function will be if it is inlined into a context where an argument
205 // becomes an alloca.
207 unsigned CodeMetrics::CountCodeReductionForAlloca(Value *V) {
208 if (!V->getType()->isPointerTy()) return 0; // Not a pointer
209 unsigned Reduction = 0;
210 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
211 Instruction *I = cast<Instruction>(*UI);
212 if (isa<LoadInst>(I) || isa<StoreInst>(I))
213 Reduction += InlineConstants::InstrCost;
214 else if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(I)) {
215 // If the GEP has variable indices, we won't be able to do much with it.
216 if (GEP->hasAllConstantIndices())
217 Reduction += CountCodeReductionForAlloca(GEP);
218 } else if (BitCastInst *BCI = dyn_cast<BitCastInst>(I)) {
219 // Track pointer through bitcasts.
220 Reduction += CountCodeReductionForAlloca(BCI);
222 // If there is some other strange instruction, we're not going to be able
223 // to do much if we inline this.
231 /// analyzeFunction - Fill in the current structure with information gleaned
232 /// from the specified function.
233 void CodeMetrics::analyzeFunction(Function *F, const TargetData *TD) {
234 // If this function contains a call that "returns twice" (e.g., setjmp or
235 // _setjmp), never inline it. This is a hack because we depend on the user
236 // marking their local variables as volatile if they are live across a setjmp
237 // call, and they probably won't do this in callers.
238 callsSetJmp = F->callsFunctionThatReturnsTwice();
240 // Look at the size of the callee.
241 for (Function::const_iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
242 analyzeBasicBlock(&*BB, TD);
245 /// analyzeFunction - Fill in the current structure with information gleaned
246 /// from the specified function.
247 void InlineCostAnalyzer::FunctionInfo::analyzeFunction(Function *F,
248 const TargetData *TD) {
249 Metrics.analyzeFunction(F, TD);
251 // A function with exactly one return has it removed during the inlining
252 // process (see InlineFunction), so don't count it.
253 // FIXME: This knowledge should really be encoded outside of FunctionInfo.
254 if (Metrics.NumRets==1)
257 // Check out all of the arguments to the function, figuring out how much
258 // code can be eliminated if one of the arguments is a constant.
259 ArgumentWeights.reserve(F->arg_size());
260 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); I != E; ++I)
261 ArgumentWeights.push_back(ArgInfo(Metrics.CountCodeReductionForConstant(I),
262 Metrics.CountCodeReductionForAlloca(I)));
265 /// NeverInline - returns true if the function should never be inlined into
267 bool InlineCostAnalyzer::FunctionInfo::NeverInline() {
268 return (Metrics.callsSetJmp || Metrics.isRecursive ||
269 Metrics.containsIndirectBr);
271 // getSpecializationBonus - The heuristic used to determine the per-call
272 // performance boost for using a specialization of Callee with argument
273 // specializedArgNo replaced by a constant.
274 int InlineCostAnalyzer::getSpecializationBonus(Function *Callee,
275 SmallVectorImpl<unsigned> &SpecializedArgNos)
277 if (Callee->mayBeOverridden())
281 // If this function uses the coldcc calling convention, prefer not to
283 if (Callee->getCallingConv() == CallingConv::Cold)
284 Bonus -= InlineConstants::ColdccPenalty;
286 // Get information about the callee.
287 FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
289 // If we haven't calculated this information yet, do so now.
290 if (CalleeFI->Metrics.NumBlocks == 0)
291 CalleeFI->analyzeFunction(Callee, TD);
295 for (Function::arg_iterator I = Callee->arg_begin(), E = Callee->arg_end();
296 I != E; ++I, ++ArgNo)
297 if (ArgNo == SpecializedArgNos[i]) {
299 Bonus += CountBonusForConstant(I);
302 // Calls usually take a long time, so they make the specialization gain
304 Bonus -= CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty;
309 // ConstantFunctionBonus - Figure out how much of a bonus we can get for
310 // possibly devirtualizing a function. We'll subtract the size of the function
311 // we may wish to inline from the indirect call bonus providing a limit on
312 // growth. Leave an upper limit of 0 for the bonus - we don't want to penalize
313 // inlining because we decide we don't want to give a bonus for
315 int InlineCostAnalyzer::ConstantFunctionBonus(CallSite CS, Constant *C) {
317 // This could just be NULL.
320 Function *F = dyn_cast<Function>(C);
323 int Bonus = InlineConstants::IndirectCallBonus + getInlineSize(CS, F);
324 return (Bonus > 0) ? 0 : Bonus;
327 // CountBonusForConstant - Figure out an approximation for how much per-call
328 // performance boost we can expect if the specified value is constant.
329 int InlineCostAnalyzer::CountBonusForConstant(Value *V, Constant *C) {
331 for (Value::use_iterator UI = V->use_begin(), E = V->use_end(); UI != E;++UI){
333 if (CallInst *CI = dyn_cast<CallInst>(U)) {
334 // Turning an indirect call into a direct call is a BIG win
335 if (CI->getCalledValue() == V)
336 Bonus += ConstantFunctionBonus(CallSite(CI), C);
337 } else if (InvokeInst *II = dyn_cast<InvokeInst>(U)) {
338 // Turning an indirect call into a direct call is a BIG win
339 if (II->getCalledValue() == V)
340 Bonus += ConstantFunctionBonus(CallSite(II), C);
342 // FIXME: Eliminating conditional branches and switches should
343 // also yield a per-call performance boost.
345 // Figure out the bonuses that wll accrue due to simple constant
347 Instruction &Inst = cast<Instruction>(*U);
349 // We can't constant propagate instructions which have effects or
352 // FIXME: It would be nice to capture the fact that a load from a
353 // pointer-to-constant-global is actually a *really* good thing to zap.
354 // Unfortunately, we don't know the pointer that may get propagated here,
355 // so we can't make this decision.
356 if (Inst.mayReadFromMemory() || Inst.mayHaveSideEffects() ||
357 isa<AllocaInst>(Inst))
360 bool AllOperandsConstant = true;
361 for (unsigned i = 0, e = Inst.getNumOperands(); i != e; ++i)
362 if (!isa<Constant>(Inst.getOperand(i)) && Inst.getOperand(i) != V) {
363 AllOperandsConstant = false;
367 if (AllOperandsConstant)
368 Bonus += CountBonusForConstant(&Inst);
375 int InlineCostAnalyzer::getInlineSize(CallSite CS, Function *Callee) {
376 // Get information about the callee.
377 FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
379 // If we haven't calculated this information yet, do so now.
380 if (CalleeFI->Metrics.NumBlocks == 0)
381 CalleeFI->analyzeFunction(Callee, TD);
383 // InlineCost - This value measures how good of an inline candidate this call
384 // site is to inline. A lower inline cost make is more likely for the call to
385 // be inlined. This value may go negative.
389 // Compute any size reductions we can expect due to arguments being passed into
393 CallSite::arg_iterator I = CS.arg_begin();
394 for (Function::arg_iterator FI = Callee->arg_begin(), FE = Callee->arg_end();
395 FI != FE; ++I, ++FI, ++ArgNo) {
397 // If an alloca is passed in, inlining this function is likely to allow
398 // significant future optimization possibilities (like scalar promotion, and
399 // scalarization), so encourage the inlining of the function.
401 if (isa<AllocaInst>(I))
402 InlineCost -= CalleeFI->ArgumentWeights[ArgNo].AllocaWeight;
404 // If this is a constant being passed into the function, use the argument
405 // weights calculated for the callee to determine how much will be folded
406 // away with this information.
407 else if (isa<Constant>(I))
408 InlineCost -= CalleeFI->ArgumentWeights[ArgNo].ConstantWeight;
411 // Each argument passed in has a cost at both the caller and the callee
412 // sides. Measurements show that each argument costs about the same as an
414 InlineCost -= (CS.arg_size() * InlineConstants::InstrCost);
416 // Now that we have considered all of the factors that make the call site more
417 // likely to be inlined, look at factors that make us not want to inline it.
419 // Calls usually take a long time, so they make the inlining gain smaller.
420 InlineCost += CalleeFI->Metrics.NumCalls * InlineConstants::CallPenalty;
422 // Look at the size of the callee. Each instruction counts as 5.
423 InlineCost += CalleeFI->Metrics.NumInsts*InlineConstants::InstrCost;
428 int InlineCostAnalyzer::getInlineBonuses(CallSite CS, Function *Callee) {
429 // Get information about the callee.
430 FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
432 // If we haven't calculated this information yet, do so now.
433 if (CalleeFI->Metrics.NumBlocks == 0)
434 CalleeFI->analyzeFunction(Callee, TD);
436 bool isDirectCall = CS.getCalledFunction() == Callee;
437 Instruction *TheCall = CS.getInstruction();
440 // If there is only one call of the function, and it has internal linkage,
441 // make it almost guaranteed to be inlined.
443 if (Callee->hasLocalLinkage() && Callee->hasOneUse() && isDirectCall)
444 Bonus += InlineConstants::LastCallToStaticBonus;
446 // If the instruction after the call, or if the normal destination of the
447 // invoke is an unreachable instruction, the function is noreturn. As such,
448 // there is little point in inlining this.
449 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
450 if (isa<UnreachableInst>(II->getNormalDest()->begin()))
451 Bonus += InlineConstants::NoreturnPenalty;
452 } else if (isa<UnreachableInst>(++BasicBlock::iterator(TheCall)))
453 Bonus += InlineConstants::NoreturnPenalty;
455 // If this function uses the coldcc calling convention, prefer not to inline
457 if (Callee->getCallingConv() == CallingConv::Cold)
458 Bonus += InlineConstants::ColdccPenalty;
460 // Add to the inline quality for properties that make the call valuable to
461 // inline. This includes factors that indicate that the result of inlining
462 // the function will be optimizable. Currently this just looks at arguments
463 // passed into the function.
465 CallSite::arg_iterator I = CS.arg_begin();
466 for (Function::arg_iterator FI = Callee->arg_begin(), FE = Callee->arg_end();
468 // Compute any constant bonus due to inlining we want to give here.
469 if (isa<Constant>(I))
470 Bonus += CountBonusForConstant(FI, cast<Constant>(I));
475 // getInlineCost - The heuristic used to determine if we should inline the
476 // function call or not.
478 InlineCost InlineCostAnalyzer::getInlineCost(CallSite CS,
479 SmallPtrSet<const Function*, 16> &NeverInline) {
480 return getInlineCost(CS, CS.getCalledFunction(), NeverInline);
483 InlineCost InlineCostAnalyzer::getInlineCost(CallSite CS,
485 SmallPtrSet<const Function*, 16> &NeverInline) {
486 Instruction *TheCall = CS.getInstruction();
487 Function *Caller = TheCall->getParent()->getParent();
489 // Don't inline functions which can be redefined at link-time to mean
490 // something else. Don't inline functions marked noinline or call sites
492 if (Callee->mayBeOverridden() ||
493 Callee->hasFnAttr(Attribute::NoInline) || NeverInline.count(Callee) ||
495 return llvm::InlineCost::getNever();
497 // Get information about the callee.
498 FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
500 // If we haven't calculated this information yet, do so now.
501 if (CalleeFI->Metrics.NumBlocks == 0)
502 CalleeFI->analyzeFunction(Callee, TD);
504 // If we should never inline this, return a huge cost.
505 if (CalleeFI->NeverInline())
506 return InlineCost::getNever();
508 // FIXME: It would be nice to kill off CalleeFI->NeverInline. Then we
509 // could move this up and avoid computing the FunctionInfo for
510 // things we are going to just return always inline for. This
511 // requires handling setjmp somewhere else, however.
512 if (!Callee->isDeclaration() && Callee->hasFnAttr(Attribute::AlwaysInline))
513 return InlineCost::getAlways();
515 if (CalleeFI->Metrics.usesDynamicAlloca) {
516 // Get information about the caller.
517 FunctionInfo &CallerFI = CachedFunctionInfo[Caller];
519 // If we haven't calculated this information yet, do so now.
520 if (CallerFI.Metrics.NumBlocks == 0) {
521 CallerFI.analyzeFunction(Caller, TD);
523 // Recompute the CalleeFI pointer, getting Caller could have invalidated
525 CalleeFI = &CachedFunctionInfo[Callee];
528 // Don't inline a callee with dynamic alloca into a caller without them.
529 // Functions containing dynamic alloca's are inefficient in various ways;
530 // don't create more inefficiency.
531 if (!CallerFI.Metrics.usesDynamicAlloca)
532 return InlineCost::getNever();
535 // InlineCost - This value measures how good of an inline candidate this call
536 // site is to inline. A lower inline cost make is more likely for the call to
537 // be inlined. This value may go negative due to the fact that bonuses
538 // are negative numbers.
540 int InlineCost = getInlineSize(CS, Callee) + getInlineBonuses(CS, Callee);
541 return llvm::InlineCost::get(InlineCost);
544 // getSpecializationCost - The heuristic used to determine the code-size
545 // impact of creating a specialized version of Callee with argument
546 // SpecializedArgNo replaced by a constant.
547 InlineCost InlineCostAnalyzer::getSpecializationCost(Function *Callee,
548 SmallVectorImpl<unsigned> &SpecializedArgNos)
550 // Don't specialize functions which can be redefined at link-time to mean
552 if (Callee->mayBeOverridden())
553 return llvm::InlineCost::getNever();
555 // Get information about the callee.
556 FunctionInfo *CalleeFI = &CachedFunctionInfo[Callee];
558 // If we haven't calculated this information yet, do so now.
559 if (CalleeFI->Metrics.NumBlocks == 0)
560 CalleeFI->analyzeFunction(Callee, TD);
564 // Look at the original size of the callee. Each instruction counts as 5.
565 Cost += CalleeFI->Metrics.NumInsts * InlineConstants::InstrCost;
567 // Offset that with the amount of code that can be constant-folded
568 // away with the given arguments replaced by constants.
569 for (SmallVectorImpl<unsigned>::iterator an = SpecializedArgNos.begin(),
570 ae = SpecializedArgNos.end(); an != ae; ++an)
571 Cost -= CalleeFI->ArgumentWeights[*an].ConstantWeight;
573 return llvm::InlineCost::get(Cost);
576 // getInlineFudgeFactor - Return a > 1.0 factor if the inliner should use a
577 // higher threshold to determine if the function call should be inlined.
578 float InlineCostAnalyzer::getInlineFudgeFactor(CallSite CS) {
579 Function *Callee = CS.getCalledFunction();
581 // Get information about the callee.
582 FunctionInfo &CalleeFI = CachedFunctionInfo[Callee];
584 // If we haven't calculated this information yet, do so now.
585 if (CalleeFI.Metrics.NumBlocks == 0)
586 CalleeFI.analyzeFunction(Callee, TD);
589 // Single BB functions are often written to be inlined.
590 if (CalleeFI.Metrics.NumBlocks == 1)
593 // Be more aggressive if the function contains a good chunk (if it mades up
594 // at least 10% of the instructions) of vector instructions.
595 if (CalleeFI.Metrics.NumVectorInsts > CalleeFI.Metrics.NumInsts/2)
597 else if (CalleeFI.Metrics.NumVectorInsts > CalleeFI.Metrics.NumInsts/10)
602 /// growCachedCostInfo - update the cached cost info for Caller after Callee has
605 InlineCostAnalyzer::growCachedCostInfo(Function *Caller, Function *Callee) {
606 CodeMetrics &CallerMetrics = CachedFunctionInfo[Caller].Metrics;
608 // For small functions we prefer to recalculate the cost for better accuracy.
609 if (CallerMetrics.NumBlocks < 10 && CallerMetrics.NumInsts < 1000) {
610 resetCachedCostInfo(Caller);
614 // For large functions, we can save a lot of computation time by skipping
616 if (CallerMetrics.NumCalls > 0)
617 --CallerMetrics.NumCalls;
619 if (Callee == 0) return;
621 CodeMetrics &CalleeMetrics = CachedFunctionInfo[Callee].Metrics;
623 // If we don't have metrics for the callee, don't recalculate them just to
624 // update an approximation in the caller. Instead, just recalculate the
625 // caller info from scratch.
626 if (CalleeMetrics.NumBlocks == 0) {
627 resetCachedCostInfo(Caller);
631 // Since CalleeMetrics were already calculated, we know that the CallerMetrics
632 // reference isn't invalidated: both were in the DenseMap.
633 CallerMetrics.usesDynamicAlloca |= CalleeMetrics.usesDynamicAlloca;
635 // FIXME: If any of these three are true for the callee, the callee was
636 // not inlined into the caller, so I think they're redundant here.
637 CallerMetrics.callsSetJmp |= CalleeMetrics.callsSetJmp;
638 CallerMetrics.isRecursive |= CalleeMetrics.isRecursive;
639 CallerMetrics.containsIndirectBr |= CalleeMetrics.containsIndirectBr;
641 CallerMetrics.NumInsts += CalleeMetrics.NumInsts;
642 CallerMetrics.NumBlocks += CalleeMetrics.NumBlocks;
643 CallerMetrics.NumCalls += CalleeMetrics.NumCalls;
644 CallerMetrics.NumVectorInsts += CalleeMetrics.NumVectorInsts;
645 CallerMetrics.NumRets += CalleeMetrics.NumRets;
647 // analyzeBasicBlock counts each function argument as an inst.
648 if (CallerMetrics.NumInsts >= Callee->arg_size())
649 CallerMetrics.NumInsts -= Callee->arg_size();
651 CallerMetrics.NumInsts = 0;
653 // We are not updating the argument weights. We have already determined that
654 // Caller is a fairly large function, so we accept the loss of precision.
657 /// clear - empty the cache of inline costs
658 void InlineCostAnalyzer::clear() {
659 CachedFunctionInfo.clear();