1 //===- InlineFunction.cpp - Code to perform function inlining -------------===//
3 // The LLVM Compiler Infrastructure
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.
8 //===----------------------------------------------------------------------===//
10 // This file implements inlining of a function into a call site, resolving
11 // parameters and the return value as appropriate.
13 // FIXME: This pass should transform alloca instructions in the called function
14 // into alloca/dealloca pairs! Or perhaps it should refuse to inline them!
16 //===----------------------------------------------------------------------===//
18 #include "llvm/Transforms/Utils/Cloning.h"
19 #include "llvm/Constant.h"
20 #include "llvm/DerivedTypes.h"
21 #include "llvm/Module.h"
22 #include "llvm/Instructions.h"
23 #include "llvm/Intrinsics.h"
24 #include "llvm/Support/CallSite.h"
25 #include "llvm/Transforms/Utils/Local.h"
28 bool llvm::InlineFunction(CallInst *CI) { return InlineFunction(CallSite(CI)); }
29 bool llvm::InlineFunction(InvokeInst *II) {return InlineFunction(CallSite(II));}
31 // InlineFunction - This function inlines the called function into the basic
32 // block of the caller. This returns false if it is not possible to inline this
33 // call. The program is still in a well defined state if this occurs though.
35 // Note that this only does one level of inlining. For example, if the
36 // instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now
37 // exists in the instruction stream. Similiarly this will inline a recursive
38 // function by one level.
40 bool llvm::InlineFunction(CallSite CS) {
41 Instruction *TheCall = CS.getInstruction();
42 assert(TheCall->getParent() && TheCall->getParent()->getParent() &&
43 "Instruction not in function!");
45 const Function *CalledFunc = CS.getCalledFunction();
46 if (CalledFunc == 0 || // Can't inline external function or indirect
47 CalledFunc->isExternal() || // call, or call to a vararg function!
48 CalledFunc->getFunctionType()->isVarArg()) return false;
50 BasicBlock *OrigBB = TheCall->getParent();
51 Function *Caller = OrigBB->getParent();
53 // Get an iterator to the last basic block in the function, which will have
54 // the new function inlined after it.
56 Function::iterator LastBlock = &Caller->back();
58 // Make sure to capture all of the return instructions from the cloned
60 std::vector<ReturnInst*> Returns;
61 { // Scope to destroy ValueMap after cloning.
62 // Calculate the vector of arguments to pass into the function cloner...
63 std::map<const Value*, Value*> ValueMap;
64 assert(std::distance(CalledFunc->abegin(), CalledFunc->aend()) ==
65 std::distance(CS.arg_begin(), CS.arg_end()) &&
66 "No varargs calls can be inlined!");
68 CallSite::arg_iterator AI = CS.arg_begin();
69 for (Function::const_aiterator I = CalledFunc->abegin(),
70 E = CalledFunc->aend(); I != E; ++I, ++AI)
73 // Clone the entire body of the callee into the caller.
74 CloneFunctionInto(Caller, CalledFunc, ValueMap, Returns, ".i");
77 // Remember the first block that is newly cloned over.
78 Function::iterator FirstNewBlock = LastBlock; ++FirstNewBlock;
80 // If there are any alloca instructions in the block that used to be the entry
81 // block for the callee, move them to the entry block of the caller. First
82 // calculate which instruction they should be inserted before. We insert the
83 // instructions at the end of the current alloca list.
85 if (isa<AllocaInst>(FirstNewBlock->begin())) {
86 BasicBlock::iterator InsertPoint = Caller->begin()->begin();
87 for (BasicBlock::iterator I = FirstNewBlock->begin(),
88 E = FirstNewBlock->end(); I != E; )
89 if (AllocaInst *AI = dyn_cast<AllocaInst>(I++))
90 if (isa<Constant>(AI->getArraySize())) {
91 // Scan for the block of allocas that we can move over.
92 while (isa<AllocaInst>(I) &&
93 isa<Constant>(cast<AllocaInst>(I)->getArraySize()))
96 // Transfer all of the allocas over in a block. Using splice means
97 // that they instructions aren't removed from the symbol table, then
99 Caller->front().getInstList().splice(InsertPoint,
100 FirstNewBlock->getInstList(),
105 // If we are inlining for an invoke instruction, we must make sure to rewrite
106 // any inlined 'unwind' instructions into branches to the invoke exception
107 // destination, and call instructions into invoke instructions.
108 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
109 BasicBlock *InvokeDest = II->getUnwindDest();
110 std::vector<Value*> InvokeDestPHIValues;
112 // If there are PHI nodes in the exceptional destination block, we need to
113 // keep track of which values came into them from this invoke, then remove
114 // the entry for this block.
115 for (BasicBlock::iterator I = InvokeDest->begin();
116 PHINode *PN = dyn_cast<PHINode>(I); ++I)
117 // Save the value to use for this edge...
118 InvokeDestPHIValues.push_back(PN->getIncomingValueForBlock(OrigBB));
120 for (Function::iterator BB = FirstNewBlock, E = Caller->end();
122 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ) {
123 // We only need to check for function calls: inlined invoke instructions
124 // require no special handling...
125 if (CallInst *CI = dyn_cast<CallInst>(I)) {
126 // Convert this function call into an invoke instruction... if it's
127 // not an intrinsic function call (which are known to not throw).
128 if (CI->getCalledFunction() &&
129 CI->getCalledFunction()->getIntrinsicID()) {
132 // First, split the basic block...
133 BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc");
135 // Next, create the new invoke instruction, inserting it at the end
136 // of the old basic block.
138 new InvokeInst(CI->getCalledValue(), Split, InvokeDest,
139 std::vector<Value*>(CI->op_begin()+1, CI->op_end()),
140 CI->getName(), BB->getTerminator());
142 // Make sure that anything using the call now uses the invoke!
143 CI->replaceAllUsesWith(II);
145 // Delete the unconditional branch inserted by splitBasicBlock
146 BB->getInstList().pop_back();
147 Split->getInstList().pop_front(); // Delete the original call
149 // Update any PHI nodes in the exceptional block to indicate that
150 // there is now a new entry in them.
152 for (BasicBlock::iterator I = InvokeDest->begin();
153 PHINode *PN = dyn_cast<PHINode>(I); ++I, ++i)
154 PN->addIncoming(InvokeDestPHIValues[i], BB);
156 // This basic block is now complete, start scanning the next one.
164 if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) {
165 // An UnwindInst requires special handling when it gets inlined into an
166 // invoke site. Once this happens, we know that the unwind would cause
167 // a control transfer to the invoke exception destination, so we can
168 // transform it into a direct branch to the exception destination.
169 new BranchInst(InvokeDest, UI);
171 // Delete the unwind instruction!
172 UI->getParent()->getInstList().pop_back();
174 // Update any PHI nodes in the exceptional block to indicate that
175 // there is now a new entry in them.
177 for (BasicBlock::iterator I = InvokeDest->begin();
178 PHINode *PN = dyn_cast<PHINode>(I); ++I, ++i)
179 PN->addIncoming(InvokeDestPHIValues[i], BB);
183 // Now that everything is happy, we have one final detail. The PHI nodes in
184 // the exception destination block still have entries due to the original
185 // invoke instruction. Eliminate these entries (which might even delete the
187 InvokeDest->removePredecessor(II->getParent());
190 // If we cloned in _exactly one_ basic block, and if that block ends in a
191 // return instruction, we splice the body of the inlined callee directly into
192 // the calling basic block.
193 if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) {
194 // Move all of the instructions right before the call.
195 OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(),
196 FirstNewBlock->begin(), FirstNewBlock->end());
197 // Remove the cloned basic block.
198 Caller->getBasicBlockList().pop_back();
200 // If the call site was an invoke instruction, add a branch to the normal
202 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall))
203 new BranchInst(II->getNormalDest(), TheCall);
205 // If the return instruction returned a value, replace uses of the call with
206 // uses of the returned value.
207 if (!TheCall->use_empty())
208 TheCall->replaceAllUsesWith(Returns[0]->getReturnValue());
210 // Since we are now done with the Call/Invoke, we can delete it.
211 TheCall->getParent()->getInstList().erase(TheCall);
213 // Since we are now done with the return instruction, delete it also.
214 Returns[0]->getParent()->getInstList().erase(Returns[0]);
216 // We are now done with the inlining.
220 // Otherwise, we have the normal case, of more than one block to inline or
221 // multiple return sites.
223 // We want to clone the entire callee function into the hole between the
224 // "starter" and "ender" blocks. How we accomplish this depends on whether
225 // this is an invoke instruction or a call instruction.
226 BasicBlock *AfterCallBB;
227 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
229 // Add an unconditional branch to make this look like the CallInst case...
230 BranchInst *NewBr = new BranchInst(II->getNormalDest(), TheCall);
232 // Split the basic block. This guarantees that no PHI nodes will have to be
233 // updated due to new incoming edges, and make the invoke case more
234 // symmetric to the call case.
235 AfterCallBB = OrigBB->splitBasicBlock(NewBr,
236 CalledFunc->getName()+".entry");
238 } else { // It's a call
239 // If this is a call instruction, we need to split the basic block that
240 // the call lives in.
242 AfterCallBB = OrigBB->splitBasicBlock(TheCall,
243 CalledFunc->getName()+".entry");
246 // Change the branch that used to go to AfterCallBB to branch to the first
247 // basic block of the inlined function.
249 TerminatorInst *Br = OrigBB->getTerminator();
250 assert(Br && Br->getOpcode() == Instruction::Br &&
251 "splitBasicBlock broken!");
252 Br->setOperand(0, FirstNewBlock);
255 // Now that the function is correct, make it a little bit nicer. In
256 // particular, move the basic blocks inserted from the end of the function
257 // into the space made by splitting the source basic block.
259 Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(),
260 FirstNewBlock, Caller->end());
262 // Handle all of the return instructions that we just cloned in, and eliminate
263 // any users of the original call/invoke instruction.
264 if (Returns.size() > 1) {
265 // The PHI node should go at the front of the new basic block to merge all
266 // possible incoming values.
269 if (!TheCall->use_empty()) {
270 PHI = new PHINode(CalledFunc->getReturnType(),
271 TheCall->getName(), AfterCallBB->begin());
273 // Anything that used the result of the function call should now use the
274 // PHI node as their operand.
276 TheCall->replaceAllUsesWith(PHI);
279 // Loop over all of the return instructions, turning them into unconditional
280 // branches to the merge point now, and adding entries to the PHI node as
282 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
283 ReturnInst *RI = Returns[i];
286 assert(RI->getReturnValue() && "Ret should have value!");
287 assert(RI->getReturnValue()->getType() == PHI->getType() &&
288 "Ret value not consistent in function!");
289 PHI->addIncoming(RI->getReturnValue(), RI->getParent());
292 // Add a branch to the merge point where the PHI node lives if it exists.
293 new BranchInst(AfterCallBB, RI);
295 // Delete the return instruction now
296 RI->getParent()->getInstList().erase(RI);
299 } else if (!Returns.empty()) {
300 // Otherwise, if there is exactly one return value, just replace anything
301 // using the return value of the call with the computed value.
302 if (!TheCall->use_empty())
303 TheCall->replaceAllUsesWith(Returns[0]->getReturnValue());
305 // Add a branch to the merge point where the PHI node lives if it exists.
306 new BranchInst(AfterCallBB, Returns[0]);
308 // Delete the return instruction now
309 Returns[0]->getParent()->getInstList().erase(Returns[0]);
312 // Since we are now done with the Call/Invoke, we can delete it.
313 TheCall->getParent()->getInstList().erase(TheCall);
315 // We should always be able to fold the entry block of the function into the
316 // single predecessor of the block...
317 assert(cast<BranchInst>(Br)->isUnconditional() &&"splitBasicBlock broken!");
318 BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0);
319 SimplifyCFG(CalleeEntry);
321 // Okay, continue the CFG cleanup. It's often the case that there is only a
322 // single return instruction in the callee function. If this is the case,
323 // then we have an unconditional branch from the return block to the
324 // 'AfterCallBB'. Check for this case, and eliminate the branch is possible.
325 SimplifyCFG(AfterCallBB);