Chris Lattner | cf5933a | 2004-06-20 04:11:48 +0000 | [diff] [blame] | 1 | //===- Inliner.cpp - Code common to all inliners --------------------------===// |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 9 | // |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 10 | // This file implements the mechanics required to implement inlining without |
| 11 | // missing any calls and updating the call graph. The decisions of which calls |
| 12 | // are profitable to inline are implemented elsewhere. |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 13 | // |
| 14 | //===----------------------------------------------------------------------===// |
| 15 | |
Chris Lattner | 86453c5 | 2006-12-19 22:09:18 +0000 | [diff] [blame] | 16 | #define DEBUG_TYPE "inline" |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 17 | #include "Inliner.h" |
| 18 | #include "llvm/Module.h" |
Misha Brukman | 47b14a4 | 2004-07-29 17:30:56 +0000 | [diff] [blame] | 19 | #include "llvm/Instructions.h" |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 20 | #include "llvm/Analysis/CallGraph.h" |
| 21 | #include "llvm/Support/CallSite.h" |
Chris Lattner | ff2dad3 | 2007-01-30 23:28:39 +0000 | [diff] [blame] | 22 | #include "llvm/Target/TargetData.h" |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 23 | #include "llvm/Transforms/Utils/Cloning.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 24 | #include "llvm/Support/CommandLine.h" |
| 25 | #include "llvm/Support/Debug.h" |
| 26 | #include "llvm/ADT/Statistic.h" |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 27 | #include <set> |
Chris Lattner | a51bcb5 | 2003-11-21 21:45:31 +0000 | [diff] [blame] | 28 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 29 | |
Chris Lattner | 86453c5 | 2006-12-19 22:09:18 +0000 | [diff] [blame] | 30 | STATISTIC(NumInlined, "Number of functions inlined"); |
| 31 | STATISTIC(NumDeleted, "Number of functions deleted because all callers found"); |
| 32 | |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 33 | namespace { |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 34 | cl::opt<unsigned> // FIXME: 200 is VERY conservative |
| 35 | InlineLimit("inline-threshold", cl::Hidden, cl::init(200), |
Chris Lattner | 8acb249 | 2006-01-13 18:06:56 +0000 | [diff] [blame] | 36 | cl::desc("Control the amount of inlining to perform (default = 200)")); |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 37 | } |
| 38 | |
Devang Patel | 1997473 | 2007-05-03 01:11:54 +0000 | [diff] [blame^] | 39 | char Inliner::ID = 0; |
Devang Patel | 794fd75 | 2007-05-01 21:15:47 +0000 | [diff] [blame] | 40 | Inliner::Inliner() |
| 41 | : CallGraphSCCPass((intptr_t)&ID), InlineThreshold(InlineLimit) {} |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 42 | |
Chris Lattner | ff2dad3 | 2007-01-30 23:28:39 +0000 | [diff] [blame] | 43 | /// getAnalysisUsage - For this class, we declare that we require and preserve |
| 44 | /// the call graph. If the derived class implements this method, it should |
| 45 | /// always explicitly call the implementation here. |
| 46 | void Inliner::getAnalysisUsage(AnalysisUsage &Info) const { |
| 47 | Info.addRequired<TargetData>(); |
| 48 | CallGraphSCCPass::getAnalysisUsage(Info); |
| 49 | } |
| 50 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 51 | // InlineCallIfPossible - If it is possible to inline the specified call site, |
| 52 | // do so and update the CallGraph for this operation. |
| 53 | static bool InlineCallIfPossible(CallSite CS, CallGraph &CG, |
Chris Lattner | ff2dad3 | 2007-01-30 23:28:39 +0000 | [diff] [blame] | 54 | const std::set<Function*> &SCCFunctions, |
| 55 | const TargetData &TD) { |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 56 | Function *Callee = CS.getCalledFunction(); |
Chris Lattner | ff2dad3 | 2007-01-30 23:28:39 +0000 | [diff] [blame] | 57 | if (!InlineFunction(CS, &CG, &TD)) return false; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 58 | |
Chris Lattner | 54970c0 | 2004-08-08 03:29:50 +0000 | [diff] [blame] | 59 | // If we inlined the last possible call site to the function, delete the |
| 60 | // function body now. |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 61 | if (Callee->use_empty() && Callee->hasInternalLinkage() && |
| 62 | !SCCFunctions.count(Callee)) { |
Bill Wendling | 0a81aac | 2006-11-26 10:02:32 +0000 | [diff] [blame] | 63 | DOUT << " -> Deleting dead function: " << Callee->getName() << "\n"; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 64 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 65 | // Remove any call graph edges from the callee to its callees. |
Chris Lattner | 432a205 | 2006-01-14 20:09:18 +0000 | [diff] [blame] | 66 | CallGraphNode *CalleeNode = CG[Callee]; |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 67 | while (CalleeNode->begin() != CalleeNode->end()) |
Chris Lattner | d85340f | 2006-07-12 18:29:36 +0000 | [diff] [blame] | 68 | CalleeNode->removeCallEdgeTo((CalleeNode->end()-1)->second); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 69 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 70 | // Removing the node for callee from the call graph and delete it. |
| 71 | delete CG.removeFunctionFromModule(CalleeNode); |
| 72 | ++NumDeleted; |
| 73 | } |
| 74 | return true; |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 75 | } |
| 76 | |
| 77 | bool Inliner::runOnSCC(const std::vector<CallGraphNode*> &SCC) { |
| 78 | CallGraph &CG = getAnalysis<CallGraph>(); |
| 79 | |
| 80 | std::set<Function*> SCCFunctions; |
Bill Wendling | 0a81aac | 2006-11-26 10:02:32 +0000 | [diff] [blame] | 81 | DOUT << "Inliner visiting SCC:"; |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 82 | for (unsigned i = 0, e = SCC.size(); i != e; ++i) { |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 83 | Function *F = SCC[i]->getFunction(); |
| 84 | if (F) SCCFunctions.insert(F); |
Bill Wendling | 0a81aac | 2006-11-26 10:02:32 +0000 | [diff] [blame] | 85 | DOUT << " " << (F ? F->getName() : "INDIRECTNODE"); |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 86 | } |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 87 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 88 | // Scan through and identify all call sites ahead of time so that we only |
| 89 | // inline call sites in the original functions, not call sites that result |
| 90 | // from inlining other functions. |
| 91 | std::vector<CallSite> CallSites; |
| 92 | |
Chris Lattner | cf5933a | 2004-06-20 04:11:48 +0000 | [diff] [blame] | 93 | for (unsigned i = 0, e = SCC.size(); i != e; ++i) |
| 94 | if (Function *F = SCC[i]->getFunction()) |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 95 | for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB) |
| 96 | for (BasicBlock::iterator I = BB->begin(); I != BB->end(); ++I) { |
| 97 | CallSite CS = CallSite::get(I); |
| 98 | if (CS.getInstruction() && (!CS.getCalledFunction() || |
Reid Spencer | 5cbf985 | 2007-01-30 20:08:39 +0000 | [diff] [blame] | 99 | !CS.getCalledFunction()->isDeclaration())) |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 100 | CallSites.push_back(CS); |
| 101 | } |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 102 | |
Bill Wendling | 0a81aac | 2006-11-26 10:02:32 +0000 | [diff] [blame] | 103 | DOUT << ": " << CallSites.size() << " call sites.\n"; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 104 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 105 | // Now that we have all of the call sites, move the ones to functions in the |
| 106 | // current SCC to the end of the list. |
| 107 | unsigned FirstCallInSCC = CallSites.size(); |
| 108 | for (unsigned i = 0; i < FirstCallInSCC; ++i) |
| 109 | if (Function *F = CallSites[i].getCalledFunction()) |
| 110 | if (SCCFunctions.count(F)) |
| 111 | std::swap(CallSites[i--], CallSites[--FirstCallInSCC]); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 112 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 113 | // Now that we have all of the call sites, loop over them and inline them if |
| 114 | // it looks profitable to do so. |
| 115 | bool Changed = false; |
| 116 | bool LocalChange; |
| 117 | do { |
| 118 | LocalChange = false; |
| 119 | // Iterate over the outer loop because inlining functions can cause indirect |
| 120 | // calls to become direct calls. |
| 121 | for (unsigned CSi = 0; CSi != CallSites.size(); ++CSi) |
| 122 | if (Function *Callee = CallSites[CSi].getCalledFunction()) { |
| 123 | // Calls to external functions are never inlinable. |
Reid Spencer | 5cbf985 | 2007-01-30 20:08:39 +0000 | [diff] [blame] | 124 | if (Callee->isDeclaration() || |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 125 | CallSites[CSi].getInstruction()->getParent()->getParent() ==Callee){ |
Chris Lattner | 08ff148 | 2006-11-09 23:36:08 +0000 | [diff] [blame] | 126 | if (SCC.size() == 1) { |
| 127 | std::swap(CallSites[CSi], CallSites.back()); |
| 128 | CallSites.pop_back(); |
| 129 | } else { |
| 130 | // Keep the 'in SCC / not in SCC' boundary correct. |
| 131 | CallSites.erase(CallSites.begin()+CSi); |
| 132 | } |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 133 | --CSi; |
| 134 | continue; |
| 135 | } |
Chris Lattner | 775cbdd | 2004-04-08 06:34:31 +0000 | [diff] [blame] | 136 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 137 | // If the policy determines that we should inline this function, |
| 138 | // try to do so. |
| 139 | CallSite CS = CallSites[CSi]; |
| 140 | int InlineCost = getInlineCost(CS); |
| 141 | if (InlineCost >= (int)InlineThreshold) { |
Bill Wendling | 0a81aac | 2006-11-26 10:02:32 +0000 | [diff] [blame] | 142 | DOUT << " NOT Inlining: cost=" << InlineCost |
| 143 | << ", Call: " << *CS.getInstruction(); |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 144 | } else { |
Bill Wendling | 0a81aac | 2006-11-26 10:02:32 +0000 | [diff] [blame] | 145 | DOUT << " Inlining: cost=" << InlineCost |
| 146 | << ", Call: " << *CS.getInstruction(); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 147 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 148 | // Attempt to inline the function... |
Chris Lattner | ff2dad3 | 2007-01-30 23:28:39 +0000 | [diff] [blame] | 149 | if (InlineCallIfPossible(CS, CG, SCCFunctions, |
| 150 | getAnalysis<TargetData>())) { |
Chris Lattner | 08ff148 | 2006-11-09 23:36:08 +0000 | [diff] [blame] | 151 | // Remove this call site from the list. If possible, use |
| 152 | // swap/pop_back for efficiency, but do not use it if doing so would |
| 153 | // move a call site to a function in this SCC before the |
| 154 | // 'FirstCallInSCC' barrier. |
| 155 | if (SCC.size() == 1) { |
| 156 | std::swap(CallSites[CSi], CallSites.back()); |
| 157 | CallSites.pop_back(); |
| 158 | } else { |
| 159 | CallSites.erase(CallSites.begin()+CSi); |
| 160 | } |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 161 | --CSi; |
Chris Lattner | ce1a3a2 | 2004-04-12 05:37:29 +0000 | [diff] [blame] | 162 | |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 163 | ++NumInlined; |
| 164 | Changed = true; |
| 165 | LocalChange = true; |
Chris Lattner | 775cbdd | 2004-04-08 06:34:31 +0000 | [diff] [blame] | 166 | } |
Chris Lattner | 775cbdd | 2004-04-08 06:34:31 +0000 | [diff] [blame] | 167 | } |
| 168 | } |
Chris Lattner | befa499 | 2004-05-23 21:22:17 +0000 | [diff] [blame] | 169 | } while (LocalChange); |
Chris Lattner | 775cbdd | 2004-04-08 06:34:31 +0000 | [diff] [blame] | 170 | |
Chris Lattner | 237ef56 | 2003-08-31 19:10:30 +0000 | [diff] [blame] | 171 | return Changed; |
| 172 | } |
| 173 | |
Chris Lattner | 68d57e7 | 2004-04-20 22:06:53 +0000 | [diff] [blame] | 174 | // doFinalization - Remove now-dead linkonce functions at the end of |
| 175 | // processing to avoid breaking the SCC traversal. |
| 176 | bool Inliner::doFinalization(CallGraph &CG) { |
Chris Lattner | 3e1358a | 2004-04-21 20:44:33 +0000 | [diff] [blame] | 177 | std::set<CallGraphNode*> FunctionsToRemove; |
| 178 | |
| 179 | // Scan for all of the functions, looking for ones that should now be removed |
| 180 | // from the program. Insert the dead ones in the FunctionsToRemove set. |
| 181 | for (CallGraph::iterator I = CG.begin(), E = CG.end(); I != E; ++I) { |
| 182 | CallGraphNode *CGN = I->second; |
Chris Lattner | 54970c0 | 2004-08-08 03:29:50 +0000 | [diff] [blame] | 183 | if (Function *F = CGN ? CGN->getFunction() : 0) { |
Chris Lattner | 0c0aa71 | 2004-09-18 21:37:03 +0000 | [diff] [blame] | 184 | // If the only remaining users of the function are dead constants, remove |
| 185 | // them. |
Chris Lattner | 54970c0 | 2004-08-08 03:29:50 +0000 | [diff] [blame] | 186 | F->removeDeadConstantUsers(); |
Chris Lattner | 3e1358a | 2004-04-21 20:44:33 +0000 | [diff] [blame] | 187 | |
Chris Lattner | 54970c0 | 2004-08-08 03:29:50 +0000 | [diff] [blame] | 188 | if ((F->hasLinkOnceLinkage() || F->hasInternalLinkage()) && |
| 189 | F->use_empty()) { |
Chris Lattner | 0c0aa71 | 2004-09-18 21:37:03 +0000 | [diff] [blame] | 190 | |
Chris Lattner | 54970c0 | 2004-08-08 03:29:50 +0000 | [diff] [blame] | 191 | // Remove any call graph edges from the function to its callees. |
| 192 | while (CGN->begin() != CGN->end()) |
Chris Lattner | d85340f | 2006-07-12 18:29:36 +0000 | [diff] [blame] | 193 | CGN->removeCallEdgeTo((CGN->end()-1)->second); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 194 | |
Chris Lattner | 0c0aa71 | 2004-09-18 21:37:03 +0000 | [diff] [blame] | 195 | // Remove any edges from the external node to the function's call graph |
| 196 | // node. These edges might have been made irrelegant due to |
| 197 | // optimization of the program. |
| 198 | CG.getExternalCallingNode()->removeAnyCallEdgeTo(CGN); |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 199 | |
Chris Lattner | 54970c0 | 2004-08-08 03:29:50 +0000 | [diff] [blame] | 200 | // Removing the node for callee from the call graph and delete it. |
| 201 | FunctionsToRemove.insert(CGN); |
| 202 | } |
Chris Lattner | 68d57e7 | 2004-04-20 22:06:53 +0000 | [diff] [blame] | 203 | } |
| 204 | } |
Chris Lattner | 3e1358a | 2004-04-21 20:44:33 +0000 | [diff] [blame] | 205 | |
| 206 | // Now that we know which functions to delete, do so. We didn't want to do |
| 207 | // this inline, because that would invalidate our CallGraph::iterator |
| 208 | // objects. :( |
| 209 | bool Changed = false; |
| 210 | for (std::set<CallGraphNode*>::iterator I = FunctionsToRemove.begin(), |
| 211 | E = FunctionsToRemove.end(); I != E; ++I) { |
| 212 | delete CG.removeFunctionFromModule(*I); |
| 213 | ++NumDeleted; |
| 214 | Changed = true; |
| 215 | } |
| 216 | |
Chris Lattner | 68d57e7 | 2004-04-20 22:06:53 +0000 | [diff] [blame] | 217 | return Changed; |
| 218 | } |