Inliner.cpp revision 6f7426ec2e46bb19cc9f9e75f1c355b35cf12d7d
1cf5933a716e7eb6bd5ff49aa62f3e76379ebaf51Chris Lattner//===- Inliner.cpp - Code common to all inliners --------------------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 3b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// The LLVM Compiler Infrastructure 4b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 5b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// This file was developed by the LLVM research group and is distributed under 6b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// the University of Illinois Open Source 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" 19237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner#include "llvm/Analysis/CallGraph.h" 20237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner#include "llvm/Support/CallSite.h" 21ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner#include "llvm/Target/TargetData.h" 226f7426ec2e46bb19cc9f9e75f1c355b35cf12d7dTanya Lattner#include "llvm/Transforms/IPO/InlinerPass.h" 23237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner#include "llvm/Transforms/Utils/Cloning.h" 24551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/CommandLine.h" 25551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/Support/Debug.h" 26551ccae044b0ff658fe629dd67edd5ffe75d10e8Reid Spencer#include "llvm/ADT/Statistic.h" 27befa499d45ffcc32bd9902518aec18589464e47cChris Lattner#include <set> 28a51bcb50b0c74adc741361824ef81dbefb715c53Chris Lattnerusing namespace llvm; 29d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 3086453c52ba02e743d29c08456e51006500041456Chris LattnerSTATISTIC(NumInlined, "Number of functions inlined"); 3186453c52ba02e743d29c08456e51006500041456Chris LattnerSTATISTIC(NumDeleted, "Number of functions deleted because all callers found"); 3286453c52ba02e743d29c08456e51006500041456Chris Lattner 33237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattnernamespace { 34237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner cl::opt<unsigned> // FIXME: 200 is VERY conservative 35237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner InlineLimit("inline-threshold", cl::Hidden, cl::init(200), 368acb249725e3304aafe91d5357f69722957c51b1Chris Lattner cl::desc("Control the amount of inlining to perform (default = 200)")); 37237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner} 38237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 391ce6f8da7283a1f281f1767905873537d66560d5Chris LattnerInliner::Inliner(const void *ID) 401ce6f8da7283a1f281f1767905873537d66560d5Chris Lattner : CallGraphSCCPass((intptr_t)ID), InlineThreshold(InlineLimit) {} 41237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 42ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner/// getAnalysisUsage - For this class, we declare that we require and preserve 43ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner/// the call graph. If the derived class implements this method, it should 44ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner/// always explicitly call the implementation here. 45ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattnervoid Inliner::getAnalysisUsage(AnalysisUsage &Info) const { 46ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner Info.addRequired<TargetData>(); 47ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner CallGraphSCCPass::getAnalysisUsage(Info); 48ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner} 49ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner 50befa499d45ffcc32bd9902518aec18589464e47cChris Lattner// InlineCallIfPossible - If it is possible to inline the specified call site, 51befa499d45ffcc32bd9902518aec18589464e47cChris Lattner// do so and update the CallGraph for this operation. 52befa499d45ffcc32bd9902518aec18589464e47cChris Lattnerstatic bool InlineCallIfPossible(CallSite CS, CallGraph &CG, 53ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner const std::set<Function*> &SCCFunctions, 54ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner const TargetData &TD) { 55befa499d45ffcc32bd9902518aec18589464e47cChris Lattner Function *Callee = CS.getCalledFunction(); 56ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner if (!InlineFunction(CS, &CG, &TD)) return false; 57fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5854970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner // If we inlined the last possible call site to the function, delete the 5954970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner // function body now. 60befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (Callee->use_empty() && Callee->hasInternalLinkage() && 61befa499d45ffcc32bd9902518aec18589464e47cChris Lattner !SCCFunctions.count(Callee)) { 620a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling DOUT << " -> Deleting dead function: " << Callee->getName() << "\n"; 63fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 64befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Remove any call graph edges from the callee to its callees. 65432a205769d22e7744dd8b0b45efd687aa6998e3Chris Lattner CallGraphNode *CalleeNode = CG[Callee]; 66befa499d45ffcc32bd9902518aec18589464e47cChris Lattner while (CalleeNode->begin() != CalleeNode->end()) 67d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CalleeNode->removeCallEdgeTo((CalleeNode->end()-1)->second); 68fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 69befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Removing the node for callee from the call graph and delete it. 70befa499d45ffcc32bd9902518aec18589464e47cChris Lattner delete CG.removeFunctionFromModule(CalleeNode); 71befa499d45ffcc32bd9902518aec18589464e47cChris Lattner ++NumDeleted; 72befa499d45ffcc32bd9902518aec18589464e47cChris Lattner } 73befa499d45ffcc32bd9902518aec18589464e47cChris Lattner return true; 74237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner} 75237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 76237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattnerbool Inliner::runOnSCC(const std::vector<CallGraphNode*> &SCC) { 77237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner CallGraph &CG = getAnalysis<CallGraph>(); 78237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 79237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner std::set<Function*> SCCFunctions; 800a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling DOUT << "Inliner visiting SCC:"; 81237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner for (unsigned i = 0, e = SCC.size(); i != e; ++i) { 82befa499d45ffcc32bd9902518aec18589464e47cChris Lattner Function *F = SCC[i]->getFunction(); 83befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (F) SCCFunctions.insert(F); 840a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling DOUT << " " << (F ? F->getName() : "INDIRECTNODE"); 85237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner } 86237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 87befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Scan through and identify all call sites ahead of time so that we only 88befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // inline call sites in the original functions, not call sites that result 89befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // from inlining other functions. 90befa499d45ffcc32bd9902518aec18589464e47cChris Lattner std::vector<CallSite> CallSites; 91befa499d45ffcc32bd9902518aec18589464e47cChris Lattner 92cf5933a716e7eb6bd5ff49aa62f3e76379ebaf51Chris Lattner for (unsigned i = 0, e = SCC.size(); i != e; ++i) 93cf5933a716e7eb6bd5ff49aa62f3e76379ebaf51Chris Lattner if (Function *F = SCC[i]->getFunction()) 94befa499d45ffcc32bd9902518aec18589464e47cChris Lattner for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) 95befa499d45ffcc32bd9902518aec18589464e47cChris Lattner for (BasicBlock::iterator I = BB->begin(); I != BB->end(); ++I) { 96befa499d45ffcc32bd9902518aec18589464e47cChris Lattner CallSite CS = CallSite::get(I); 97befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (CS.getInstruction() && (!CS.getCalledFunction() || 985cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer !CS.getCalledFunction()->isDeclaration())) 99befa499d45ffcc32bd9902518aec18589464e47cChris Lattner CallSites.push_back(CS); 100befa499d45ffcc32bd9902518aec18589464e47cChris Lattner } 101237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 1020a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling DOUT << ": " << CallSites.size() << " call sites.\n"; 103fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 104befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Now that we have all of the call sites, move the ones to functions in the 105befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // current SCC to the end of the list. 106befa499d45ffcc32bd9902518aec18589464e47cChris Lattner unsigned FirstCallInSCC = CallSites.size(); 107befa499d45ffcc32bd9902518aec18589464e47cChris Lattner for (unsigned i = 0; i < FirstCallInSCC; ++i) 108befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (Function *F = CallSites[i].getCalledFunction()) 109befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (SCCFunctions.count(F)) 110befa499d45ffcc32bd9902518aec18589464e47cChris Lattner std::swap(CallSites[i--], CallSites[--FirstCallInSCC]); 111fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 112befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Now that we have all of the call sites, loop over them and inline them if 113befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // it looks profitable to do so. 114befa499d45ffcc32bd9902518aec18589464e47cChris Lattner bool Changed = false; 115befa499d45ffcc32bd9902518aec18589464e47cChris Lattner bool LocalChange; 116befa499d45ffcc32bd9902518aec18589464e47cChris Lattner do { 117befa499d45ffcc32bd9902518aec18589464e47cChris Lattner LocalChange = false; 118befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Iterate over the outer loop because inlining functions can cause indirect 119befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // calls to become direct calls. 120befa499d45ffcc32bd9902518aec18589464e47cChris Lattner for (unsigned CSi = 0; CSi != CallSites.size(); ++CSi) 121befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (Function *Callee = CallSites[CSi].getCalledFunction()) { 122befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Calls to external functions are never inlinable. 1235cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer if (Callee->isDeclaration() || 124befa499d45ffcc32bd9902518aec18589464e47cChris Lattner CallSites[CSi].getInstruction()->getParent()->getParent() ==Callee){ 12508ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner if (SCC.size() == 1) { 12608ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner std::swap(CallSites[CSi], CallSites.back()); 12708ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner CallSites.pop_back(); 12808ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner } else { 12908ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner // Keep the 'in SCC / not in SCC' boundary correct. 13008ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner CallSites.erase(CallSites.begin()+CSi); 13108ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner } 132befa499d45ffcc32bd9902518aec18589464e47cChris Lattner --CSi; 133befa499d45ffcc32bd9902518aec18589464e47cChris Lattner continue; 134befa499d45ffcc32bd9902518aec18589464e47cChris Lattner } 135befa499d45ffcc32bd9902518aec18589464e47cChris Lattner 136befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // If the policy determines that we should inline this function, 137befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // try to do so. 138befa499d45ffcc32bd9902518aec18589464e47cChris Lattner CallSite CS = CallSites[CSi]; 139befa499d45ffcc32bd9902518aec18589464e47cChris Lattner int InlineCost = getInlineCost(CS); 140befa499d45ffcc32bd9902518aec18589464e47cChris Lattner if (InlineCost >= (int)InlineThreshold) { 1410a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling DOUT << " NOT Inlining: cost=" << InlineCost 1420a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling << ", Call: " << *CS.getInstruction(); 143befa499d45ffcc32bd9902518aec18589464e47cChris Lattner } else { 1440a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling DOUT << " Inlining: cost=" << InlineCost 1450a81aac4b46eed130d20714af5a1c01b05d0275eBill Wendling << ", Call: " << *CS.getInstruction(); 146fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 147befa499d45ffcc32bd9902518aec18589464e47cChris Lattner // Attempt to inline the function... 148ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner if (InlineCallIfPossible(CS, CG, SCCFunctions, 149ff2dad312883e5da91fb9f4e3619b7d095867f3bChris Lattner getAnalysis<TargetData>())) { 15008ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner // Remove this call site from the list. If possible, use 15108ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner // swap/pop_back for efficiency, but do not use it if doing so would 15208ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner // move a call site to a function in this SCC before the 15308ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner // 'FirstCallInSCC' barrier. 15408ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner if (SCC.size() == 1) { 15508ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner std::swap(CallSites[CSi], CallSites.back()); 15608ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner CallSites.pop_back(); 15708ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner } else { 15808ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner CallSites.erase(CallSites.begin()+CSi); 15908ff1480ffcb22e946c7bb6c7d66c5d977ae3d6eChris Lattner } 160befa499d45ffcc32bd9902518aec18589464e47cChris Lattner --CSi; 161befa499d45ffcc32bd9902518aec18589464e47cChris Lattner 162befa499d45ffcc32bd9902518aec18589464e47cChris Lattner ++NumInlined; 163befa499d45ffcc32bd9902518aec18589464e47cChris Lattner Changed = true; 164befa499d45ffcc32bd9902518aec18589464e47cChris Lattner LocalChange = true; 165775cbdd51a3b33dd5eb343689f65ab5cc8ac7118Chris Lattner } 166237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner } 167237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner } 168befa499d45ffcc32bd9902518aec18589464e47cChris Lattner } while (LocalChange); 169237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner 170775cbdd51a3b33dd5eb343689f65ab5cc8ac7118Chris Lattner return Changed; 171237ef567f6764f24a47c63121cc0a599ddc8f56dChris Lattner} 172d0fde30ce850b78371fd1386338350591f9ff494Brian Gaeke 17368d57e7ae80044401efd889270a12c71b3efb9abChris Lattner// doFinalization - Remove now-dead linkonce functions at the end of 17468d57e7ae80044401efd889270a12c71b3efb9abChris Lattner// processing to avoid breaking the SCC traversal. 17568d57e7ae80044401efd889270a12c71b3efb9abChris Lattnerbool Inliner::doFinalization(CallGraph &CG) { 1763e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner std::set<CallGraphNode*> FunctionsToRemove; 1773e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner 1783e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // Scan for all of the functions, looking for ones that should now be removed 1793e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // from the program. Insert the dead ones in the FunctionsToRemove set. 1803e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) { 1813e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner CallGraphNode *CGN = I->second; 18254970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner if (Function *F = CGN ? CGN->getFunction() : 0) { 1830c0aa711b8a0550c21f032125c4663ff45864f81Chris Lattner // If the only remaining users of the function are dead constants, remove 1840c0aa711b8a0550c21f032125c4663ff45864f81Chris Lattner // them. 18554970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner F->removeDeadConstantUsers(); 18654970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner 18754970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner if ((F->hasLinkOnceLinkage() || F->hasInternalLinkage()) && 18854970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner F->use_empty()) { 1890c0aa711b8a0550c21f032125c4663ff45864f81Chris Lattner 19054970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner // Remove any call graph edges from the function to its callees. 19154970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner while (CGN->begin() != CGN->end()) 192d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CGN->removeCallEdgeTo((CGN->end()-1)->second); 193fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 1940c0aa711b8a0550c21f032125c4663ff45864f81Chris Lattner // Remove any edges from the external node to the function's call graph 1950c0aa711b8a0550c21f032125c4663ff45864f81Chris Lattner // node. These edges might have been made irrelegant due to 1960c0aa711b8a0550c21f032125c4663ff45864f81Chris Lattner // optimization of the program. 1970c0aa711b8a0550c21f032125c4663ff45864f81Chris Lattner CG.getExternalCallingNode()->removeAnyCallEdgeTo(CGN); 198fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 19954970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner // Removing the node for callee from the call graph and delete it. 20054970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner FunctionsToRemove.insert(CGN); 20154970c032815edadb1b2988ea33f5a1173e5b29cChris Lattner } 20268d57e7ae80044401efd889270a12c71b3efb9abChris Lattner } 20368d57e7ae80044401efd889270a12c71b3efb9abChris Lattner } 2043e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner 2053e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // Now that we know which functions to delete, do so. We didn't want to do 2063e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // this inline, because that would invalidate our CallGraph::iterator 2073e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner // objects. :( 2083e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner bool Changed = false; 2093e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner for (std::set<CallGraphNode*>::iterator I = FunctionsToRemove.begin(), 2103e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner E = FunctionsToRemove.end(); I != E; ++I) { 2113e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner delete CG.removeFunctionFromModule(*I); 2123e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner ++NumDeleted; 2133e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner Changed = true; 2143e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner } 2153e1358a9fa1ebd3f51c94eb69da55d693895fe7cChris Lattner 21668d57e7ae80044401efd889270a12c71b3efb9abChris Lattner return Changed; 21768d57e7ae80044401efd889270a12c71b3efb9abChris Lattner} 218