Inliner.cpp revision bdb984bc2757114bc706026603ed40d7f508c4c1
1cf5933a716e7eb6bd5ff49aa62f3e76379ebaf51Chris Lattner//===- Inliner.cpp - Code common to all inliners --------------------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 3b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// The LLVM Compiler Infrastructure 4b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// License. See LICENSE.TXT for details. 7fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 8b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell//===----------------------------------------------------------------------===// 9237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner// 10befa499d45ffcc32bd9902518aec18589464e47cChris Lattner// This file implements the mechanics required to implement inlining without 11befa499d45ffcc32bd9902518aec18589464e47cChris Lattner// missing any calls and updating the call graph. The decisions of which calls 12befa499d45ffcc32bd9902518aec18589464e47cChris Lattner// are profitable to inline are implemented elsewhere. 13237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner// 14237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner//===----------------------------------------------------------------------===// 15237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 1686453c52ba02e743d29c08456e51006500041456Chris Lattner#define DEBUG_TYPE "inline" 17237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner#include "llvm/Module.h" 1847b14a4a6a455c7be169cfd312fcbe796f0ad426Misha Brukman#include "llvm/Instructions.h" 191f67ce4aa3f65619f54c8a3072539da5b0022841Dale Johannesen#include "llvm/IntrinsicInst.h" 20237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner#include "llvm/Analysis/CallGraph.h" 21237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner#include "llvm/Support/CallSite.h" 22ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner#include "llvm/Target/TargetData.h" 236f7426ec2e46bb19cc9f9e75f1c355b35cf12d7dTanya Lattner#include "llvm/Transforms/IPO/InlinerPass.h" 2412f0babca4459c253675700e1d707652d5b6ba17Chris Lattner#include "llvm/Transforms/Utils/InlineCost.h" 25237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner#include "llvm/Transforms/Utils/Cloning.h" 26551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/CommandLine.h" 27551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/Debug.h" 28ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar#include "llvm/Support/raw_ostream.h" 2912f0babca4459c253675700e1d707652d5b6ba17Chris Lattner#include "llvm/ADT/SmallPtrSet.h" 30551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/ADT/Statistic.h" 31befa499d45ffcc32bd9902518aec18589464e47cChris Lattner#include <set> 32a51bcb50b0c74adc741361824ef81dbefb715c53Chris Lattnerusing namespace llvm; 33d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 3486453c52ba02e743d29c08456e51006500041456Chris LattnerSTATISTIC(NumInlined, "Number of functions inlined"); 3586453c52ba02e743d29c08456e51006500041456Chris LattnerSTATISTIC(NumDeleted, "Number of functions deleted because all callers found"); 36199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris LattnerSTATISTIC(NumMergedAllocas, "Number of allocas merged together"); 3786453c52ba02e743d29c08456e51006500041456Chris Lattner 38844731a7f1909f55935e3514c9e713a62d67662eDan Gohmanstatic cl::opt<int> 395fee49eff92c2ae2f70eb84d136c31a706560750Dale JohannesenInlineLimit("inline-threshold", cl::Hidden, cl::init(200), cl::ZeroOrMore, 40cbfdf9644ce38fd3404469c26ac3c8466c940b6eDale Johannesen cl::desc("Control the amount of inlining to perform (default = 200)")); 41237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 42ae73dc1448d25b02cabc7c64c86c64371453dda8Dan GohmanInliner::Inliner(void *ID) 43ae73dc1448d25b02cabc7c64c86c64371453dda8Dan Gohman : CallGraphSCCPass(ID), InlineThreshold(InlineLimit) {} 44237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 45ae73dc1448d25b02cabc7c64c86c64371453dda8Dan GohmanInliner::Inliner(void *ID, int Threshold) 46ae73dc1448d25b02cabc7c64c86c64371453dda8Dan Gohman : CallGraphSCCPass(ID), InlineThreshold(Threshold) {} 47120d053e3ba810b44047fbcb719824bed5673ca9Chris Lattner 48ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner/// getAnalysisUsage - For this class, we declare that we require and preserve 49ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner/// the call graph. If the derived class implements this method, it should 50ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner/// always explicitly call the implementation here. 51ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattnervoid Inliner::getAnalysisUsage(AnalysisUsage &Info) const { 52ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner CallGraphSCCPass::getAnalysisUsage(Info); 53ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner} 54ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner 55199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 56199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattnertypedef DenseMap<const ArrayType*, std::vector<AllocaInst*> > 57199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris LattnerInlinedArrayAllocasTy; 58199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 59199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner/// InlineCallIfPossible - If it is possible to inline the specified call site, 60199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner/// do so and update the CallGraph for this operation. 61199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner/// 62199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner/// This function also does some basic book-keeping to update the IR. The 63cc0a0299d96676e0a51e9b8f5bf617d8025f09a7Chris Lattner/// InlinedArrayAllocas map keeps track of any allocas that are already 64cc0a0299d96676e0a51e9b8f5bf617d8025f09a7Chris Lattner/// available from other functions inlined into the caller. If we are able to 65cc0a0299d96676e0a51e9b8f5bf617d8025f09a7Chris Lattner/// inline this call site we attempt to reuse already available allocas or add 66cc0a0299d96676e0a51e9b8f5bf617d8025f09a7Chris Lattner/// any new allocas to the set if not possible. 67199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattnerstatic bool InlineCallIfPossible(CallSite CS, CallGraph &CG, 68199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner const TargetData *TD, 69199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner InlinedArrayAllocasTy &InlinedArrayAllocas) { 70befa499d45ffcc32bd9902518aec18589464e47cChris Lattner Function *Callee = CS.getCalledFunction(); 7166c75aaa028683c389c55b377ee2411b61081677Bill Wendling Function *Caller = CS.getCaller(); 7266c75aaa028683c389c55b377ee2411b61081677Bill Wendling 73199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Try to inline the function. Get the list of static allocas that were 74199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // inlined. 75199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner SmallVector<AllocaInst*, 16> StaticAllocas; 76199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner if (!InlineFunction(CS, &CG, TD, &StaticAllocas)) 7712f0babca4459c253675700e1d707652d5b6ba17Chris Lattner return false; 78fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 798c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling // If the inlined function had a higher stack protection level than the 808c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling // calling function, then bump up the caller's stack protection level. 818c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling if (Callee->hasFnAttr(Attribute::StackProtectReq)) 828c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling Caller->addFnAttr(Attribute::StackProtectReq); 838c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling else if (Callee->hasFnAttr(Attribute::StackProtect) && 848c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling !Caller->hasFnAttr(Attribute::StackProtectReq)) 858c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling Caller->addFnAttr(Attribute::StackProtect); 868c1604e7d617622cb391f1c679ddf70ea03baedcBill Wendling 87199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 88199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Look at all of the allocas that we inlined through this call site. If we 89199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // have already inlined other allocas through other calls into this function, 90199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // then we know that they have disjoint lifetimes and that we can merge them. 91199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // 92199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // There are many heuristics possible for merging these allocas, and the 93199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // different options have different tradeoffs. One thing that we *really* 94199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // don't want to hurt is SRoA: once inlining happens, often allocas are no 95199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // longer address taken and so they can be promoted. 96199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // 97199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Our "solution" for that is to only merge allocas whose outermost type is an 98199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // array type. These are usually not promoted because someone is using a 99199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // variable index into them. These are also often the most important ones to 100199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // merge. 101199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // 102199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // A better solution would be to have real memory lifetime markers in the IR 103199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // and not have the inliner do any merging of allocas at all. This would 104199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // allow the backend to do proper stack slot coloring of all allocas that 105199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // *actually make it to the backend*, which is really what we want. 106199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // 107199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Because we don't have this information, we do this simple and useful hack. 108199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // 109199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner SmallPtrSet<AllocaInst*, 16> UsedAllocas; 110199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 111199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Loop over all the allocas we have so far and see if they can be merged with 112199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // a previously inlined alloca. If not, remember that we had it. 113199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner for (unsigned AllocaNo = 0, e = StaticAllocas.size(); 114199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner AllocaNo != e; ++AllocaNo) { 115199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner AllocaInst *AI = StaticAllocas[AllocaNo]; 116199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 117199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Don't bother trying to merge array allocations (they will usually be 118199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // canonicalized to be an allocation *of* an array), or allocations whose 119199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // type is not itself an array (because we're afraid of pessimizing SRoA). 120199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner const ArrayType *ATy = dyn_cast<ArrayType>(AI->getAllocatedType()); 121199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner if (ATy == 0 || AI->isArrayAllocation()) 122199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner continue; 123199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 124199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Get the list of all available allocas for this array type. 125199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner std::vector<AllocaInst*> &AllocasForType = InlinedArrayAllocas[ATy]; 126199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 127199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Loop over the allocas in AllocasForType to see if we can reuse one. Note 128199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // that we have to be careful not to reuse the same "available" alloca for 129199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // multiple different allocas that we just inlined, we use the 'UsedAllocas' 130199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // set to keep track of which "available" allocas are being used by this 131199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // function. Also, AllocasForType can be empty of course! 132199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner bool MergedAwayAlloca = false; 133199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner for (unsigned i = 0, e = AllocasForType.size(); i != e; ++i) { 134199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner AllocaInst *AvailableAlloca = AllocasForType[i]; 135199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 136199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // The available alloca has to be in the right function, not in some other 137199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // function in this SCC. 138199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner if (AvailableAlloca->getParent() != AI->getParent()) 139199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner continue; 140199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 141199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // If the inlined function already uses this alloca then we can't reuse 142199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // it. 143199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner if (!UsedAllocas.insert(AvailableAlloca)) 144199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner continue; 145199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 146199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Otherwise, we *can* reuse it, RAUW AI into AvailableAlloca and declare 147199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // success! 148199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner DEBUG(errs() << " ***MERGED ALLOCA: " << *AI); 149199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 150199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner AI->replaceAllUsesWith(AvailableAlloca); 151199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner AI->eraseFromParent(); 152199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner MergedAwayAlloca = true; 153199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner ++NumMergedAllocas; 154199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner break; 155199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner } 156fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 157199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // If we already nuked the alloca, we're done with it. 158199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner if (MergedAwayAlloca) 159199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner continue; 1601f67ce4aa3f65619f54c8a3072539da5b0022841Dale Johannesen 161199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // If we were unable to merge away the alloca either because there are no 162199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // allocas of the right type available or because we reused them all 163199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // already, remember that this alloca came from an inlined function and mark 164199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // it used so we don't reuse it for other allocas from this inline 165199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // operation. 166199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner AllocasForType.push_back(AI); 167199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner UsedAllocas.insert(AI); 168befa499d45ffcc32bd9902518aec18589464e47cChris Lattner } 169199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 170befa499d45ffcc32bd9902518aec18589464e47cChris Lattner return true; 171237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner} 1721a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar 1731a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar/// shouldInline - Return true if the inliner should attempt to inline 1741a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar/// at the given CallSite. 1751a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbarbool Inliner::shouldInline(CallSite CS) { 176c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar InlineCost IC = getInlineCost(CS); 1771a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar 178c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar if (IC.isAlways()) { 17984a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling DEBUG(errs() << " Inlining: cost=always" 18084a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling << ", Call: " << *CS.getInstruction() << "\n"); 181c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar return true; 182c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar } 183c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar 184c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar if (IC.isNever()) { 18584a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling DEBUG(errs() << " NOT Inlining: cost=never" 18684a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling << ", Call: " << *CS.getInstruction() << "\n"); 187c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar return false; 188c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar } 189c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar 190c5e1ec47c719806fcc882470595960512edc7441Daniel Dunbar int Cost = IC.getValue(); 1911a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar int CurrentThreshold = InlineThreshold; 192e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen Function *Caller = CS.getCaller(); 193e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (Caller && !Caller->isDeclaration() && 194e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen Caller->hasFnAttr(Attribute::OptimizeForSize) && 195a0479e53323ade402272ddf8302c8aa2c496c775Evan Cheng InlineLimit.getNumOccurrences() == 0 && 19684a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling InlineThreshold != 50) 1971a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar CurrentThreshold = 50; 1981a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar 199135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner float FudgeFactor = getInlineFudgeFactor(CS); 2001a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar if (Cost >= (int)(CurrentThreshold * FudgeFactor)) { 20184a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling DEBUG(errs() << " NOT Inlining: cost=" << Cost 20284a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling << ", Call: " << *CS.getInstruction() << "\n"); 2031a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar return false; 2041a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar } 205135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 206e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // Try to detect the case where the current inlining candidate caller 207e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // (call it B) is a static function and is an inlining candidate elsewhere, 208e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // and the current candidate callee (call it C) is large enough that 209e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // inlining it into B would make B too big to inline later. In these 210e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // circumstances it may be best not to inline C into B, but to inline B 211e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // into its callers. 212e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (Caller->hasLocalLinkage()) { 213e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen int TotalSecondaryCost = 0; 214e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen bool outerCallsFound = false; 215e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen bool allOuterCallsWillBeInlined = true; 216e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen bool someOuterCallWouldNotBeInlined = false; 217e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen for (Value::use_iterator I = Caller->use_begin(), E =Caller->use_end(); 218e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen I != E; ++I) { 219e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen CallSite CS2 = CallSite::get(*I); 220e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 221e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // If this isn't a call to Caller (it could be some other sort 222e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // of reference) skip it. 223e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (CS2.getInstruction() == 0 || CS2.getCalledFunction() != Caller) 224e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen continue; 225e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 226e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen InlineCost IC2 = getInlineCost(CS2); 227e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (IC2.isNever()) 228e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen allOuterCallsWillBeInlined = false; 229e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (IC2.isAlways() || IC2.isNever()) 230e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen continue; 231e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 232e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen outerCallsFound = true; 233e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen int Cost2 = IC2.getValue(); 234e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen int CurrentThreshold2 = InlineThreshold; 235e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen Function *Caller2 = CS2.getCaller(); 236e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (Caller2 && !Caller2->isDeclaration() && 237e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen Caller2->hasFnAttr(Attribute::OptimizeForSize) && 238e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen InlineThreshold != 50) 239e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen CurrentThreshold2 = 50; 240e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 241e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen float FudgeFactor2 = getInlineFudgeFactor(CS2); 242e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 243e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (Cost2 >= (int)(CurrentThreshold2 * FudgeFactor2)) 244e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen allOuterCallsWillBeInlined = false; 245e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 246bdb984bc2757114bc706026603ed40d7f508c4c1Dale Johannesen // See if we have this case. We subtract off the penalty 247e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // for the call instruction, which we would be deleting. 248e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (Cost2 < (int)(CurrentThreshold2 * FudgeFactor2) && 249bdb984bc2757114bc706026603ed40d7f508c4c1Dale Johannesen Cost2 + Cost - (InlineConstants::CallPenalty + 1) >= 250bdb984bc2757114bc706026603ed40d7f508c4c1Dale Johannesen (int)(CurrentThreshold2 * FudgeFactor2)) { 251e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen someOuterCallWouldNotBeInlined = true; 252e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen TotalSecondaryCost += Cost2; 253e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen } 254e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen } 255e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // If all outer calls to Caller would get inlined, the cost for the last 256e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // one is set very low by getInlineCost, in anticipation that Caller will 257e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // be removed entirely. We did not account for this above unless there 258e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // is only one caller of Caller. 259e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (allOuterCallsWillBeInlined && Caller->use_begin() != Caller->use_end()) 260bdb984bc2757114bc706026603ed40d7f508c4c1Dale Johannesen TotalSecondaryCost += InlineConstants::LastCallToStaticBonus; 261e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 262e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen if (outerCallsFound && someOuterCallWouldNotBeInlined && 263e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen TotalSecondaryCost < Cost) { 264e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen DEBUG(errs() << " NOT Inlining: " << *CS.getInstruction() << 265e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen " Cost = " << Cost << 266e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen ", outer Cost = " << TotalSecondaryCost << '\n'); 267e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen return false; 268e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen } 269e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen } 270e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 271135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner DEBUG(errs() << " Inlining: cost=" << Cost 272e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen << ", Call: " << *CS.getInstruction() << '\n'); 273135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner return true; 2741a99dbfe3b70c83d3f3e4648b5868c04697cd77cDaniel Dunbar} 275237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 2765095e3d1d1caef8d573534d369e37277c623064cChris Lattnerbool Inliner::runOnSCC(std::vector<CallGraphNode*> &SCC) { 277237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner CallGraph &CG = getAnalysis<CallGraph>(); 27802a436c48ecff9e34d50ce0a2f861e5acdd9bf3fDan Gohman const TargetData *TD = getAnalysisIfAvailable<TargetData>(); 279237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 28016581bf931c0ccf2f8993397acfa4e1d509a68dcDale Johannesen SmallPtrSet<Function*, 8> SCCFunctions; 28184a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling DEBUG(errs() << "Inliner visiting SCC:"); 282237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner for (unsigned i = 0, e = SCC.size(); i != e; ++i) { 283befa499d45ffcc32bd9902518aec18589464e47cChris Lattner Function *F = SCC[i]->getFunction(); 284befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (F) SCCFunctions.insert(F); 285ce63ffb52f249b62cdf2d250c128007b13f27e71Daniel Dunbar DEBUG(errs() << " " << (F ? F->getName() : "INDIRECTNODE")); 286237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner } 287237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 288befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Scan through and identify all call sites ahead of time so that we only 289befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // inline call sites in the original functions, not call sites that result 290befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // from inlining other functions. 291199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner SmallVector<CallSite, 16> CallSites; 292befa499d45ffcc32bd9902518aec18589464e47cChris Lattner 293135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (unsigned i = 0, e = SCC.size(); i != e; ++i) { 294135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Function *F = SCC[i]->getFunction(); 295135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (!F) continue; 296135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 297135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) 298135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) { 299135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CallSite CS = CallSite::get(I); 300e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen // If this isn't a call, or it is a call to an intrinsic, it can 301d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner // never be inlined. 302d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner if (CS.getInstruction() == 0 || isa<IntrinsicInst>(I)) 303135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 304135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 305d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner // If this is a direct call to an external function, we can never inline 306d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner // it. If it is an indirect call, inlining may resolve it to be a 307d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner // direct call, so we keep it. 308d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner if (CS.getCalledFunction() && CS.getCalledFunction()->isDeclaration()) 309d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner continue; 310d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner 311d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner CallSites.push_back(CS); 312135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } 313135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } 314237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 31584a832f9272ed7f1a47c3e019c770b62e373cc6cBill Wendling DEBUG(errs() << ": " << CallSites.size() << " call sites.\n"); 316fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 317befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Now that we have all of the call sites, move the ones to functions in the 318befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // current SCC to the end of the list. 319befa499d45ffcc32bd9902518aec18589464e47cChris Lattner unsigned FirstCallInSCC = CallSites.size(); 320befa499d45ffcc32bd9902518aec18589464e47cChris Lattner for (unsigned i = 0; i < FirstCallInSCC; ++i) 321befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (Function *F = CallSites[i].getCalledFunction()) 322befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (SCCFunctions.count(F)) 323befa499d45ffcc32bd9902518aec18589464e47cChris Lattner std::swap(CallSites[i--], CallSites[--FirstCallInSCC]); 324fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 325199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 326199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner InlinedArrayAllocasTy InlinedArrayAllocas; 327199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 328befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Now that we have all of the call sites, loop over them and inline them if 329befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // it looks profitable to do so. 330befa499d45ffcc32bd9902518aec18589464e47cChris Lattner bool Changed = false; 331befa499d45ffcc32bd9902518aec18589464e47cChris Lattner bool LocalChange; 332befa499d45ffcc32bd9902518aec18589464e47cChris Lattner do { 333befa499d45ffcc32bd9902518aec18589464e47cChris Lattner LocalChange = false; 334befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Iterate over the outer loop because inlining functions can cause indirect 335befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // calls to become direct calls. 336135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (unsigned CSi = 0; CSi != CallSites.size(); ++CSi) { 337199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner CallSite CS = CallSites[CSi]; 338199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 339199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner Function *Callee = CS.getCalledFunction(); 340d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner // We can only inline direct calls to non-declarations. 341d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner if (Callee == 0 || Callee->isDeclaration()) continue; 342135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 343135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // If the policy determines that we should inline this function, 344135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // try to do so. 345135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (!shouldInline(CS)) 346135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 347e91b9a3b59688023e20cee8441179300b87c844eDale Johannesen 348135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Function *Caller = CS.getCaller(); 349135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Attempt to inline the function... 350199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner if (!InlineCallIfPossible(CS, CG, TD, InlinedArrayAllocas)) 351135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 352135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 353199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // If we inlined the last possible call site to the function, delete the 354199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // function body now. 355b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner if (Callee->use_empty() && Callee->hasLocalLinkage() && 356d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner // TODO: Can remove if in SCC now. 357b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner !SCCFunctions.count(Callee) && 358d43d5e832f756c9d2c0c8ff4d2f51807a27cab8dChris Lattner 359b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner // The function may be apparently dead, but if there are indirect 360b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner // callgraph references to the node, we cannot delete it yet, this 361b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner // could invalidate the CGSCC iterator. 362b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner CG[Callee]->getNumReferences() == 0) { 363199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner DEBUG(errs() << " -> Deleting dead function: " 364199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner << Callee->getName() << "\n"); 365199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner CallGraphNode *CalleeNode = CG[Callee]; 366199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 367199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Remove any call graph edges from the callee to its callees. 368199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner CalleeNode->removeAllCalledFunctions(); 369199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 370199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner resetCachedCostInfo(Callee); 371199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 372199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner // Removing the node for callee from the call graph and delete it. 373199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner delete CG.removeFunctionFromModule(CalleeNode); 374199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner ++NumDeleted; 375199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner } 376199ba42cbf56b2fc9c708edb4f08f97dd99ddd49Chris Lattner 377135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Remove any cached cost info for this caller, as inlining the 378135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // callee has increased the size of the caller (which may be the 379135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // same as the callee). 380135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner resetCachedCostInfo(Caller); 381135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 382135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Remove this call site from the list. If possible, use 383135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // swap/pop_back for efficiency, but do not use it if doing so would 384135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // move a call site to a function in this SCC before the 385135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // 'FirstCallInSCC' barrier. 386135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (SCC.size() == 1) { 387135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner std::swap(CallSites[CSi], CallSites.back()); 388135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CallSites.pop_back(); 389135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } else { 390135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CallSites.erase(CallSites.begin()+CSi); 391237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner } 392135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner --CSi; 393135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 394135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner ++NumInlined; 395135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Changed = true; 396135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner LocalChange = true; 397135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } 398befa499d45ffcc32bd9902518aec18589464e47cChris Lattner } while (LocalChange); 399237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 400775cbdd51a3b33dd5eb343689f65ab5cc8ac7118Chris Lattner return Changed; 401237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner} 402d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 40368d57e7ae80044401efd889270a12c71b3efb9abChris Lattner// doFinalization - Remove now-dead linkonce functions at the end of 40468d57e7ae80044401efd889270a12c71b3efb9abChris Lattner// processing to avoid breaking the SCC traversal. 40568d57e7ae80044401efd889270a12c71b3efb9abChris Lattnerbool Inliner::doFinalization(CallGraph &CG) { 406b7c6bf1e073088635951435acedff793add1cefdDevang Patel return removeDeadFunctions(CG); 407b7c6bf1e073088635951435acedff793add1cefdDevang Patel} 408b7c6bf1e073088635951435acedff793add1cefdDevang Patel 409135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// removeDeadFunctions - Remove dead functions that are not included in 410135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// DNR (Do Not Remove) list. 411b7c6bf1e073088635951435acedff793add1cefdDevang Patelbool Inliner::removeDeadFunctions(CallGraph &CG, 412135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner SmallPtrSet<const Function *, 16> *DNR) { 413135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner SmallPtrSet<CallGraphNode*, 16> FunctionsToRemove; 4143e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner 4153e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // Scan for all of the functions, looking for ones that should now be removed 4163e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // from the program. Insert the dead ones in the FunctionsToRemove set. 4173e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) { 4183e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner CallGraphNode *CGN = I->second; 419b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner if (CGN->getFunction() == 0) 420135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 421135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 422135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Function *F = CGN->getFunction(); 423135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 424135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // If the only remaining users of the function are dead constants, remove 425135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // them. 426135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner F->removeDeadConstantUsers(); 427135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 428135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (DNR && DNR->count(F)) 429135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 430b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner if (!F->hasLinkOnceLinkage() && !F->hasLocalLinkage() && 431b374b90e81d0ce6b5d02041ba4f7b15a945b38d8Chris Lattner !F->hasAvailableExternallyLinkage()) 432135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 433135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (!F->use_empty()) 434135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 435135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 436135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Remove any call graph edges from the function to its callees. 437135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CGN->removeAllCalledFunctions(); 438135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 439135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Remove any edges from the external node to the function's call graph 440135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // node. These edges might have been made irrelegant due to 441135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // optimization of the program. 442135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CG.getExternalCallingNode()->removeAnyCallEdgeTo(CGN); 443fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 444135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Removing the node for callee from the call graph and delete it. 445135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner FunctionsToRemove.insert(CGN); 44668d57e7ae80044401efd889270a12c71b3efb9abChris Lattner } 4473e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner 4483e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // Now that we know which functions to delete, do so. We didn't want to do 4493e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // this inline, because that would invalidate our CallGraph::iterator 4503e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // objects. :( 451135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // 452135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Note that it doesn't matter that we are iterating over a non-stable set 453135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // here to do this, it doesn't matter which order the functions are deleted 454135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // in. 4553e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner bool Changed = false; 456135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (SmallPtrSet<CallGraphNode*, 16>::iterator I = FunctionsToRemove.begin(), 457135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner E = FunctionsToRemove.end(); I != E; ++I) { 4581f67ce4aa3f65619f54c8a3072539da5b0022841Dale Johannesen resetCachedCostInfo((*I)->getFunction()); 4593e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner delete CG.removeFunctionFromModule(*I); 4603e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner ++NumDeleted; 4613e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner Changed = true; 4623e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner } 4633e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner 46468d57e7ae80044401efd889270a12c71b3efb9abChris Lattner return Changed; 46568d57e7ae80044401efd889270a12c71b3efb9abChris Lattner} 466