2003-05-29 23:11:31 +08:00
|
|
|
//===- InlineFunction.cpp - Code to perform function inlining -------------===//
|
2005-04-22 07:48:37 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file was developed by the LLVM research group and is distributed under
|
|
|
|
// the University of Illinois Open Source License. See LICENSE.TXT for details.
|
2005-04-22 07:48:37 +08:00
|
|
|
//
|
2003-10-21 03:43:21 +08:00
|
|
|
//===----------------------------------------------------------------------===//
|
2003-05-29 23:11:31 +08:00
|
|
|
//
|
|
|
|
// This file implements inlining of a function into a call site, resolving
|
|
|
|
// parameters and the return value as appropriate.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/Transforms/Utils/Cloning.h"
|
2004-10-18 07:21:07 +08:00
|
|
|
#include "llvm/Constants.h"
|
2003-08-24 12:06:56 +08:00
|
|
|
#include "llvm/DerivedTypes.h"
|
2003-05-29 23:11:31 +08:00
|
|
|
#include "llvm/Module.h"
|
2003-08-24 14:59:16 +08:00
|
|
|
#include "llvm/Instructions.h"
|
|
|
|
#include "llvm/Intrinsics.h"
|
2006-01-15 04:07:50 +08:00
|
|
|
#include "llvm/Analysis/CallGraph.h"
|
2007-02-13 10:10:56 +08:00
|
|
|
#include "llvm/ADT/SmallVector.h"
|
2003-08-24 14:59:16 +08:00
|
|
|
#include "llvm/Support/CallSite.h"
|
2004-01-09 14:12:26 +08:00
|
|
|
using namespace llvm;
|
2003-05-29 23:11:31 +08:00
|
|
|
|
2007-01-31 07:22:39 +08:00
|
|
|
bool llvm::InlineFunction(CallInst *CI, CallGraph *CG, const TargetData *TD) {
|
|
|
|
return InlineFunction(CallSite(CI), CG, TD);
|
2006-01-15 04:07:50 +08:00
|
|
|
}
|
2007-01-31 07:22:39 +08:00
|
|
|
bool llvm::InlineFunction(InvokeInst *II, CallGraph *CG, const TargetData *TD) {
|
|
|
|
return InlineFunction(CallSite(II), CG, TD);
|
2006-01-15 04:07:50 +08:00
|
|
|
}
|
2003-08-24 14:59:16 +08:00
|
|
|
|
2006-01-14 03:05:59 +08:00
|
|
|
/// HandleInlinedInvoke - If we inlined an invoke site, we need to convert calls
|
|
|
|
/// in the body of the inlined function into invokes and turn unwind
|
|
|
|
/// instructions into branches to the invoke unwind dest.
|
|
|
|
///
|
|
|
|
/// II is the invoke instruction begin inlined. FirstNewBlock is the first
|
|
|
|
/// block of the inlined code (the last block is the end of the function),
|
|
|
|
/// and InlineCodeInfo is information about the code that got inlined.
|
|
|
|
static void HandleInlinedInvoke(InvokeInst *II, BasicBlock *FirstNewBlock,
|
|
|
|
ClonedCodeInfo &InlinedCodeInfo) {
|
|
|
|
BasicBlock *InvokeDest = II->getUnwindDest();
|
|
|
|
std::vector<Value*> InvokeDestPHIValues;
|
|
|
|
|
|
|
|
// If there are PHI nodes in the unwind destination block, we need to
|
|
|
|
// keep track of which values came into them from this invoke, then remove
|
|
|
|
// the entry for this block.
|
|
|
|
BasicBlock *InvokeBlock = II->getParent();
|
|
|
|
for (BasicBlock::iterator I = InvokeDest->begin(); isa<PHINode>(I); ++I) {
|
|
|
|
PHINode *PN = cast<PHINode>(I);
|
|
|
|
// Save the value to use for this edge.
|
|
|
|
InvokeDestPHIValues.push_back(PN->getIncomingValueForBlock(InvokeBlock));
|
|
|
|
}
|
|
|
|
|
|
|
|
Function *Caller = FirstNewBlock->getParent();
|
|
|
|
|
|
|
|
// The inlined code is currently at the end of the function, scan from the
|
|
|
|
// start of the inlined code to its end, checking for stuff we need to
|
|
|
|
// rewrite.
|
2006-01-14 03:15:15 +08:00
|
|
|
if (InlinedCodeInfo.ContainsCalls || InlinedCodeInfo.ContainsUnwinds) {
|
|
|
|
for (Function::iterator BB = FirstNewBlock, E = Caller->end();
|
|
|
|
BB != E; ++BB) {
|
|
|
|
if (InlinedCodeInfo.ContainsCalls) {
|
|
|
|
for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ){
|
|
|
|
Instruction *I = BBI++;
|
|
|
|
|
|
|
|
// We only need to check for function calls: inlined invoke
|
|
|
|
// instructions require no special handling.
|
|
|
|
if (!isa<CallInst>(I)) continue;
|
|
|
|
CallInst *CI = cast<CallInst>(I);
|
2006-01-14 03:05:59 +08:00
|
|
|
|
2007-04-16 05:38:06 +08:00
|
|
|
// If this is an intrinsic function call or an inline asm, don't
|
|
|
|
// convert it to an invoke.
|
|
|
|
if ((CI->getCalledFunction() &&
|
|
|
|
CI->getCalledFunction()->getIntrinsicID()) ||
|
|
|
|
isa<InlineAsm>(CI->getCalledValue()))
|
2006-01-14 03:15:15 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
// Convert this function call into an invoke instruction.
|
|
|
|
// First, split the basic block.
|
|
|
|
BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc");
|
|
|
|
|
|
|
|
// Next, create the new invoke instruction, inserting it at the end
|
|
|
|
// of the old basic block.
|
2007-02-13 10:10:56 +08:00
|
|
|
SmallVector<Value*, 8> InvokeArgs(CI->op_begin()+1, CI->op_end());
|
2006-01-14 03:15:15 +08:00
|
|
|
InvokeInst *II =
|
|
|
|
new InvokeInst(CI->getCalledValue(), Split, InvokeDest,
|
2007-02-13 10:10:56 +08:00
|
|
|
&InvokeArgs[0], InvokeArgs.size(),
|
2006-01-14 03:15:15 +08:00
|
|
|
CI->getName(), BB->getTerminator());
|
|
|
|
II->setCallingConv(CI->getCallingConv());
|
|
|
|
|
|
|
|
// Make sure that anything using the call now uses the invoke!
|
|
|
|
CI->replaceAllUsesWith(II);
|
|
|
|
|
|
|
|
// Delete the unconditional branch inserted by splitBasicBlock
|
|
|
|
BB->getInstList().pop_back();
|
|
|
|
Split->getInstList().pop_front(); // Delete the original call
|
|
|
|
|
|
|
|
// Update any PHI nodes in the exceptional block to indicate that
|
|
|
|
// there is now a new entry in them.
|
|
|
|
unsigned i = 0;
|
|
|
|
for (BasicBlock::iterator I = InvokeDest->begin();
|
|
|
|
isa<PHINode>(I); ++I, ++i) {
|
|
|
|
PHINode *PN = cast<PHINode>(I);
|
|
|
|
PN->addIncoming(InvokeDestPHIValues[i], BB);
|
|
|
|
}
|
|
|
|
|
|
|
|
// This basic block is now complete, start scanning the next one.
|
|
|
|
break;
|
|
|
|
}
|
2006-01-14 03:05:59 +08:00
|
|
|
}
|
|
|
|
|
2006-01-14 03:15:15 +08:00
|
|
|
if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) {
|
|
|
|
// An UnwindInst requires special handling when it gets inlined into an
|
|
|
|
// invoke site. Once this happens, we know that the unwind would cause
|
|
|
|
// a control transfer to the invoke exception destination, so we can
|
|
|
|
// transform it into a direct branch to the exception destination.
|
|
|
|
new BranchInst(InvokeDest, UI);
|
|
|
|
|
|
|
|
// Delete the unwind instruction!
|
|
|
|
UI->getParent()->getInstList().pop_back();
|
|
|
|
|
|
|
|
// Update any PHI nodes in the exceptional block to indicate that
|
|
|
|
// there is now a new entry in them.
|
|
|
|
unsigned i = 0;
|
|
|
|
for (BasicBlock::iterator I = InvokeDest->begin();
|
|
|
|
isa<PHINode>(I); ++I, ++i) {
|
|
|
|
PHINode *PN = cast<PHINode>(I);
|
|
|
|
PN->addIncoming(InvokeDestPHIValues[i], BB);
|
|
|
|
}
|
2006-01-14 03:05:59 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Now that everything is happy, we have one final detail. The PHI nodes in
|
|
|
|
// the exception destination block still have entries due to the original
|
|
|
|
// invoke instruction. Eliminate these entries (which might even delete the
|
|
|
|
// PHI node) now.
|
|
|
|
InvokeDest->removePredecessor(II->getParent());
|
|
|
|
}
|
|
|
|
|
2006-07-13 02:29:36 +08:00
|
|
|
/// UpdateCallGraphAfterInlining - Once we have cloned code over from a callee
|
|
|
|
/// into the caller, update the specified callgraph to reflect the changes we
|
|
|
|
/// made. Note that it's possible that not all code was copied over, so only
|
|
|
|
/// some edges of the callgraph will be remain.
|
|
|
|
static void UpdateCallGraphAfterInlining(const Function *Caller,
|
2006-01-15 04:07:50 +08:00
|
|
|
const Function *Callee,
|
2006-07-13 02:29:36 +08:00
|
|
|
Function::iterator FirstNewBlock,
|
2007-02-03 08:08:31 +08:00
|
|
|
DenseMap<const Value*, Value*> &ValueMap,
|
2006-01-15 04:07:50 +08:00
|
|
|
CallGraph &CG) {
|
|
|
|
// Update the call graph by deleting the edge from Callee to Caller
|
|
|
|
CallGraphNode *CalleeNode = CG[Callee];
|
|
|
|
CallGraphNode *CallerNode = CG[Caller];
|
|
|
|
CallerNode->removeCallEdgeTo(CalleeNode);
|
|
|
|
|
2006-07-13 02:29:36 +08:00
|
|
|
// Since we inlined some uninlined call sites in the callee into the caller,
|
2006-01-15 04:07:50 +08:00
|
|
|
// add edges from the caller to all of the callees of the callee.
|
|
|
|
for (CallGraphNode::iterator I = CalleeNode->begin(),
|
2006-07-13 02:29:36 +08:00
|
|
|
E = CalleeNode->end(); I != E; ++I) {
|
|
|
|
const Instruction *OrigCall = I->first.getInstruction();
|
|
|
|
|
2007-02-03 08:08:31 +08:00
|
|
|
DenseMap<const Value*, Value*>::iterator VMI = ValueMap.find(OrigCall);
|
2006-07-13 05:37:11 +08:00
|
|
|
// Only copy the edge if the call was inlined!
|
|
|
|
if (VMI != ValueMap.end() && VMI->second) {
|
2006-07-13 02:37:18 +08:00
|
|
|
// If the call was inlined, but then constant folded, there is no edge to
|
|
|
|
// add. Check for this case.
|
|
|
|
if (Instruction *NewCall = dyn_cast<Instruction>(VMI->second))
|
|
|
|
CallerNode->addCalledFunction(CallSite::get(NewCall), I->second);
|
2006-07-13 02:29:36 +08:00
|
|
|
}
|
|
|
|
}
|
2006-01-15 04:07:50 +08:00
|
|
|
}
|
|
|
|
|
2006-01-14 03:05:59 +08:00
|
|
|
|
2003-05-29 23:11:31 +08:00
|
|
|
// InlineFunction - This function inlines the called function into the basic
|
|
|
|
// block of the caller. This returns false if it is not possible to inline this
|
|
|
|
// call. The program is still in a well defined state if this occurs though.
|
|
|
|
//
|
2005-04-22 07:48:37 +08:00
|
|
|
// Note that this only does one level of inlining. For example, if the
|
|
|
|
// instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now
|
2003-05-29 23:11:31 +08:00
|
|
|
// exists in the instruction stream. Similiarly this will inline a recursive
|
|
|
|
// function by one level.
|
|
|
|
//
|
2007-01-31 07:22:39 +08:00
|
|
|
bool llvm::InlineFunction(CallSite CS, CallGraph *CG, const TargetData *TD) {
|
2003-08-24 14:59:16 +08:00
|
|
|
Instruction *TheCall = CS.getInstruction();
|
|
|
|
assert(TheCall->getParent() && TheCall->getParent()->getParent() &&
|
|
|
|
"Instruction not in function!");
|
2003-05-29 23:11:31 +08:00
|
|
|
|
2003-08-24 14:59:16 +08:00
|
|
|
const Function *CalledFunc = CS.getCalledFunction();
|
2003-05-29 23:11:31 +08:00
|
|
|
if (CalledFunc == 0 || // Can't inline external function or indirect
|
2007-01-31 04:08:39 +08:00
|
|
|
CalledFunc->isDeclaration() || // call, or call to a vararg function!
|
2003-05-29 23:11:31 +08:00
|
|
|
CalledFunc->getFunctionType()->isVarArg()) return false;
|
|
|
|
|
2005-05-06 14:47:52 +08:00
|
|
|
|
|
|
|
// If the call to the callee is a non-tail call, we must clear the 'tail'
|
|
|
|
// flags on any calls that we inline.
|
|
|
|
bool MustClearTailCallFlags =
|
2005-05-07 01:13:16 +08:00
|
|
|
isa<CallInst>(TheCall) && !cast<CallInst>(TheCall)->isTailCall();
|
2005-05-06 14:47:52 +08:00
|
|
|
|
2003-08-24 14:59:16 +08:00
|
|
|
BasicBlock *OrigBB = TheCall->getParent();
|
2003-05-29 23:11:31 +08:00
|
|
|
Function *Caller = OrigBB->getParent();
|
|
|
|
|
2004-02-04 09:41:09 +08:00
|
|
|
// Get an iterator to the last basic block in the function, which will have
|
|
|
|
// the new function inlined after it.
|
|
|
|
//
|
|
|
|
Function::iterator LastBlock = &Caller->back();
|
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Make sure to capture all of the return instructions from the cloned
|
|
|
|
// function.
|
2004-02-04 09:41:09 +08:00
|
|
|
std::vector<ReturnInst*> Returns;
|
2006-01-14 03:05:59 +08:00
|
|
|
ClonedCodeInfo InlinedFunctionInfo;
|
2006-07-13 02:29:36 +08:00
|
|
|
Function::iterator FirstNewBlock;
|
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
{ // Scope to destroy ValueMap after cloning.
|
2007-02-03 08:08:31 +08:00
|
|
|
DenseMap<const Value*, Value*> ValueMap;
|
2006-05-27 09:28:04 +08:00
|
|
|
|
|
|
|
// Calculate the vector of arguments to pass into the function cloner, which
|
|
|
|
// matches up the formal to the actual argument values.
|
2005-04-22 07:48:37 +08:00
|
|
|
assert(std::distance(CalledFunc->arg_begin(), CalledFunc->arg_end()) ==
|
2004-02-04 10:51:48 +08:00
|
|
|
std::distance(CS.arg_begin(), CS.arg_end()) &&
|
|
|
|
"No varargs calls can be inlined!");
|
|
|
|
CallSite::arg_iterator AI = CS.arg_begin();
|
2005-03-15 12:54:21 +08:00
|
|
|
for (Function::const_arg_iterator I = CalledFunc->arg_begin(),
|
|
|
|
E = CalledFunc->arg_end(); I != E; ++I, ++AI)
|
2004-02-04 10:51:48 +08:00
|
|
|
ValueMap[I] = *AI;
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2006-05-27 09:28:04 +08:00
|
|
|
// We want the inliner to prune the code as it copies. We would LOVE to
|
|
|
|
// have no dead or constant instructions leftover after inlining occurs
|
|
|
|
// (which can happen, e.g., because an argument was constant), but we'll be
|
|
|
|
// happy with whatever the cloner can do.
|
|
|
|
CloneAndPruneFunctionInto(Caller, CalledFunc, ValueMap, Returns, ".i",
|
2007-01-31 07:22:39 +08:00
|
|
|
&InlinedFunctionInfo, TD);
|
2006-07-13 02:29:36 +08:00
|
|
|
|
|
|
|
// Remember the first block that is newly cloned over.
|
|
|
|
FirstNewBlock = LastBlock; ++FirstNewBlock;
|
|
|
|
|
|
|
|
// Update the callgraph if requested.
|
|
|
|
if (CG)
|
|
|
|
UpdateCallGraphAfterInlining(Caller, CalledFunc, FirstNewBlock, ValueMap,
|
|
|
|
*CG);
|
2005-04-22 07:48:37 +08:00
|
|
|
}
|
2006-07-13 02:29:36 +08:00
|
|
|
|
2003-05-29 23:11:31 +08:00
|
|
|
// If there are any alloca instructions in the block that used to be the entry
|
|
|
|
// block for the callee, move them to the entry block of the caller. First
|
|
|
|
// calculate which instruction they should be inserted before. We insert the
|
|
|
|
// instructions at the end of the current alloca list.
|
|
|
|
//
|
2006-01-14 02:16:48 +08:00
|
|
|
{
|
2003-08-24 14:59:16 +08:00
|
|
|
BasicBlock::iterator InsertPoint = Caller->begin()->begin();
|
2004-02-04 10:51:48 +08:00
|
|
|
for (BasicBlock::iterator I = FirstNewBlock->begin(),
|
|
|
|
E = FirstNewBlock->end(); I != E; )
|
2006-09-14 03:23:57 +08:00
|
|
|
if (AllocaInst *AI = dyn_cast<AllocaInst>(I++)) {
|
|
|
|
// If the alloca is now dead, remove it. This often occurs due to code
|
|
|
|
// specialization.
|
|
|
|
if (AI->use_empty()) {
|
|
|
|
AI->eraseFromParent();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
2003-10-14 09:11:07 +08:00
|
|
|
if (isa<Constant>(AI->getArraySize())) {
|
2006-01-14 02:16:48 +08:00
|
|
|
// Scan for the block of allocas that we can move over, and move them
|
|
|
|
// all at once.
|
2004-02-05 05:33:42 +08:00
|
|
|
while (isa<AllocaInst>(I) &&
|
|
|
|
isa<Constant>(cast<AllocaInst>(I)->getArraySize()))
|
|
|
|
++I;
|
|
|
|
|
|
|
|
// Transfer all of the allocas over in a block. Using splice means
|
2007-02-21 04:52:03 +08:00
|
|
|
// that the instructions aren't removed from the symbol table, then
|
2004-02-05 05:33:42 +08:00
|
|
|
// reinserted.
|
2007-03-23 00:38:57 +08:00
|
|
|
Caller->getEntryBlock().getInstList().splice(
|
|
|
|
InsertPoint,
|
|
|
|
FirstNewBlock->getInstList(),
|
|
|
|
AI, I);
|
2003-10-14 09:11:07 +08:00
|
|
|
}
|
2006-09-14 03:23:57 +08:00
|
|
|
}
|
2003-08-24 14:59:16 +08:00
|
|
|
}
|
|
|
|
|
2006-01-14 03:34:14 +08:00
|
|
|
// If the inlined code contained dynamic alloca instructions, wrap the inlined
|
|
|
|
// code with llvm.stacksave/llvm.stackrestore intrinsics.
|
|
|
|
if (InlinedFunctionInfo.ContainsDynamicAllocas) {
|
|
|
|
Module *M = Caller->getParent();
|
2007-01-07 15:54:34 +08:00
|
|
|
const Type *BytePtr = PointerType::get(Type::Int8Ty);
|
2006-01-14 03:34:14 +08:00
|
|
|
// Get the two intrinsics we care about.
|
2007-01-07 15:54:34 +08:00
|
|
|
Constant *StackSave, *StackRestore;
|
|
|
|
StackSave = M->getOrInsertFunction("llvm.stacksave", BytePtr, NULL);
|
2006-01-14 03:34:14 +08:00
|
|
|
StackRestore = M->getOrInsertFunction("llvm.stackrestore", Type::VoidTy,
|
2007-01-07 15:54:34 +08:00
|
|
|
BytePtr, NULL);
|
2006-07-13 02:29:36 +08:00
|
|
|
|
|
|
|
// If we are preserving the callgraph, add edges to the stacksave/restore
|
|
|
|
// functions for the calls we insert.
|
2006-07-19 05:48:57 +08:00
|
|
|
CallGraphNode *StackSaveCGN = 0, *StackRestoreCGN = 0, *CallerNode = 0;
|
2006-07-13 02:29:36 +08:00
|
|
|
if (CG) {
|
2007-01-07 15:54:34 +08:00
|
|
|
// We know that StackSave/StackRestore are Function*'s, because they are
|
|
|
|
// intrinsics which must have the right types.
|
|
|
|
StackSaveCGN = CG->getOrInsertFunction(cast<Function>(StackSave));
|
|
|
|
StackRestoreCGN = CG->getOrInsertFunction(cast<Function>(StackRestore));
|
2006-07-13 02:29:36 +08:00
|
|
|
CallerNode = (*CG)[Caller];
|
|
|
|
}
|
|
|
|
|
2006-01-14 03:34:14 +08:00
|
|
|
// Insert the llvm.stacksave.
|
2006-07-13 02:29:36 +08:00
|
|
|
CallInst *SavedPtr = new CallInst(StackSave, "savedstack",
|
|
|
|
FirstNewBlock->begin());
|
|
|
|
if (CG) CallerNode->addCalledFunction(SavedPtr, StackSaveCGN);
|
|
|
|
|
2006-01-14 03:34:14 +08:00
|
|
|
// Insert a call to llvm.stackrestore before any return instructions in the
|
|
|
|
// inlined function.
|
2006-07-13 02:29:36 +08:00
|
|
|
for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
|
|
|
|
CallInst *CI = new CallInst(StackRestore, SavedPtr, "", Returns[i]);
|
|
|
|
if (CG) CallerNode->addCalledFunction(CI, StackRestoreCGN);
|
|
|
|
}
|
2006-01-15 04:07:50 +08:00
|
|
|
|
|
|
|
// Count the number of StackRestore calls we insert.
|
|
|
|
unsigned NumStackRestores = Returns.size();
|
2006-01-14 03:34:14 +08:00
|
|
|
|
|
|
|
// If we are inlining an invoke instruction, insert restores before each
|
|
|
|
// unwind. These unwinds will be rewritten into branches later.
|
|
|
|
if (InlinedFunctionInfo.ContainsUnwinds && isa<InvokeInst>(TheCall)) {
|
|
|
|
for (Function::iterator BB = FirstNewBlock, E = Caller->end();
|
|
|
|
BB != E; ++BB)
|
2006-01-15 04:07:50 +08:00
|
|
|
if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) {
|
2006-01-14 03:34:14 +08:00
|
|
|
new CallInst(StackRestore, SavedPtr, "", UI);
|
2006-01-15 04:07:50 +08:00
|
|
|
++NumStackRestores;
|
|
|
|
}
|
|
|
|
}
|
2006-01-14 03:34:14 +08:00
|
|
|
}
|
|
|
|
|
2006-01-14 03:18:11 +08:00
|
|
|
// If we are inlining tail call instruction through a call site that isn't
|
|
|
|
// marked 'tail', we must remove the tail marker for any calls in the inlined
|
|
|
|
// code.
|
|
|
|
if (MustClearTailCallFlags && InlinedFunctionInfo.ContainsCalls) {
|
2005-05-06 14:47:52 +08:00
|
|
|
for (Function::iterator BB = FirstNewBlock, E = Caller->end();
|
|
|
|
BB != E; ++BB)
|
|
|
|
for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
|
|
|
|
if (CallInst *CI = dyn_cast<CallInst>(I))
|
|
|
|
CI->setTailCall(false);
|
|
|
|
}
|
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// If we are inlining for an invoke instruction, we must make sure to rewrite
|
|
|
|
// any inlined 'unwind' instructions into branches to the invoke exception
|
|
|
|
// destination, and call instructions into invoke instructions.
|
2006-01-14 03:05:59 +08:00
|
|
|
if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall))
|
|
|
|
HandleInlinedInvoke(II, FirstNewBlock, InlinedFunctionInfo);
|
2004-02-04 10:51:48 +08:00
|
|
|
|
2004-02-04 12:17:06 +08:00
|
|
|
// If we cloned in _exactly one_ basic block, and if that block ends in a
|
|
|
|
// return instruction, we splice the body of the inlined callee directly into
|
|
|
|
// the calling basic block.
|
|
|
|
if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) {
|
|
|
|
// Move all of the instructions right before the call.
|
|
|
|
OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(),
|
|
|
|
FirstNewBlock->begin(), FirstNewBlock->end());
|
|
|
|
// Remove the cloned basic block.
|
|
|
|
Caller->getBasicBlockList().pop_back();
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 12:17:06 +08:00
|
|
|
// If the call site was an invoke instruction, add a branch to the normal
|
|
|
|
// destination.
|
|
|
|
if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall))
|
|
|
|
new BranchInst(II->getNormalDest(), TheCall);
|
|
|
|
|
|
|
|
// If the return instruction returned a value, replace uses of the call with
|
|
|
|
// uses of the returned value.
|
|
|
|
if (!TheCall->use_empty())
|
|
|
|
TheCall->replaceAllUsesWith(Returns[0]->getReturnValue());
|
|
|
|
|
|
|
|
// Since we are now done with the Call/Invoke, we can delete it.
|
|
|
|
TheCall->getParent()->getInstList().erase(TheCall);
|
|
|
|
|
|
|
|
// Since we are now done with the return instruction, delete it also.
|
|
|
|
Returns[0]->getParent()->getInstList().erase(Returns[0]);
|
|
|
|
|
|
|
|
// We are now done with the inlining.
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Otherwise, we have the normal case, of more than one block to inline or
|
|
|
|
// multiple return sites.
|
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// We want to clone the entire callee function into the hole between the
|
|
|
|
// "starter" and "ender" blocks. How we accomplish this depends on whether
|
|
|
|
// this is an invoke instruction or a call instruction.
|
|
|
|
BasicBlock *AfterCallBB;
|
|
|
|
if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Add an unconditional branch to make this look like the CallInst case...
|
|
|
|
BranchInst *NewBr = new BranchInst(II->getNormalDest(), TheCall);
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Split the basic block. This guarantees that no PHI nodes will have to be
|
|
|
|
// updated due to new incoming edges, and make the invoke case more
|
|
|
|
// symmetric to the call case.
|
|
|
|
AfterCallBB = OrigBB->splitBasicBlock(NewBr,
|
2004-12-12 00:59:54 +08:00
|
|
|
CalledFunc->getName()+".exit");
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
} else { // It's a call
|
2004-02-04 12:17:06 +08:00
|
|
|
// If this is a call instruction, we need to split the basic block that
|
|
|
|
// the call lives in.
|
2004-02-04 10:51:48 +08:00
|
|
|
//
|
|
|
|
AfterCallBB = OrigBB->splitBasicBlock(TheCall,
|
2004-12-12 00:59:54 +08:00
|
|
|
CalledFunc->getName()+".exit");
|
2004-02-04 10:51:48 +08:00
|
|
|
}
|
|
|
|
|
2004-02-04 12:17:06 +08:00
|
|
|
// Change the branch that used to go to AfterCallBB to branch to the first
|
|
|
|
// basic block of the inlined function.
|
|
|
|
//
|
|
|
|
TerminatorInst *Br = OrigBB->getTerminator();
|
2005-04-22 07:48:37 +08:00
|
|
|
assert(Br && Br->getOpcode() == Instruction::Br &&
|
2004-02-04 12:17:06 +08:00
|
|
|
"splitBasicBlock broken!");
|
|
|
|
Br->setOperand(0, FirstNewBlock);
|
|
|
|
|
|
|
|
|
|
|
|
// Now that the function is correct, make it a little bit nicer. In
|
|
|
|
// particular, move the basic blocks inserted from the end of the function
|
|
|
|
// into the space made by splitting the source basic block.
|
|
|
|
//
|
|
|
|
Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(),
|
|
|
|
FirstNewBlock, Caller->end());
|
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Handle all of the return instructions that we just cloned in, and eliminate
|
|
|
|
// any users of the original call/invoke instruction.
|
|
|
|
if (Returns.size() > 1) {
|
|
|
|
// The PHI node should go at the front of the new basic block to merge all
|
|
|
|
// possible incoming values.
|
|
|
|
//
|
|
|
|
PHINode *PHI = 0;
|
|
|
|
if (!TheCall->use_empty()) {
|
|
|
|
PHI = new PHINode(CalledFunc->getReturnType(),
|
|
|
|
TheCall->getName(), AfterCallBB->begin());
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Anything that used the result of the function call should now use the
|
|
|
|
// PHI node as their operand.
|
|
|
|
//
|
|
|
|
TheCall->replaceAllUsesWith(PHI);
|
|
|
|
}
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Loop over all of the return instructions, turning them into unconditional
|
|
|
|
// branches to the merge point now, and adding entries to the PHI node as
|
|
|
|
// appropriate.
|
|
|
|
for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
|
|
|
|
ReturnInst *RI = Returns[i];
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
if (PHI) {
|
|
|
|
assert(RI->getReturnValue() && "Ret should have value!");
|
2005-04-22 07:48:37 +08:00
|
|
|
assert(RI->getReturnValue()->getType() == PHI->getType() &&
|
2004-02-04 10:51:48 +08:00
|
|
|
"Ret value not consistent in function!");
|
|
|
|
PHI->addIncoming(RI->getReturnValue(), RI->getParent());
|
|
|
|
}
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Add a branch to the merge point where the PHI node lives if it exists.
|
|
|
|
new BranchInst(AfterCallBB, RI);
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Delete the return instruction now
|
|
|
|
RI->getParent()->getInstList().erase(RI);
|
|
|
|
}
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
} else if (!Returns.empty()) {
|
|
|
|
// Otherwise, if there is exactly one return value, just replace anything
|
|
|
|
// using the return value of the call with the computed value.
|
|
|
|
if (!TheCall->use_empty())
|
|
|
|
TheCall->replaceAllUsesWith(Returns[0]->getReturnValue());
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-04-16 13:17:59 +08:00
|
|
|
// Splice the code from the return block into the block that it will return
|
|
|
|
// to, which contains the code that was after the call.
|
|
|
|
BasicBlock *ReturnBB = Returns[0]->getParent();
|
2004-07-20 13:45:24 +08:00
|
|
|
AfterCallBB->getInstList().splice(AfterCallBB->begin(),
|
|
|
|
ReturnBB->getInstList());
|
2004-04-16 13:17:59 +08:00
|
|
|
|
2004-07-20 13:45:24 +08:00
|
|
|
// Update PHI nodes that use the ReturnBB to use the AfterCallBB.
|
|
|
|
ReturnBB->replaceAllUsesWith(AfterCallBB);
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-07-20 13:45:24 +08:00
|
|
|
// Delete the return instruction now and empty ReturnBB now.
|
2004-10-18 07:21:07 +08:00
|
|
|
Returns[0]->eraseFromParent();
|
|
|
|
ReturnBB->eraseFromParent();
|
|
|
|
} else if (!TheCall->use_empty()) {
|
|
|
|
// No returns, but something is using the return value of the call. Just
|
|
|
|
// nuke the result.
|
|
|
|
TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType()));
|
2004-02-04 10:51:48 +08:00
|
|
|
}
|
2005-04-22 07:48:37 +08:00
|
|
|
|
2004-02-04 10:51:48 +08:00
|
|
|
// Since we are now done with the Call/Invoke, we can delete it.
|
2004-10-18 07:21:07 +08:00
|
|
|
TheCall->eraseFromParent();
|
2003-05-29 23:11:31 +08:00
|
|
|
|
2003-08-24 12:06:56 +08:00
|
|
|
// We should always be able to fold the entry block of the function into the
|
|
|
|
// single predecessor of the block...
|
2004-04-16 13:17:59 +08:00
|
|
|
assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!");
|
2003-08-24 12:06:56 +08:00
|
|
|
BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0);
|
2004-02-04 12:17:06 +08:00
|
|
|
|
2004-04-16 13:17:59 +08:00
|
|
|
// Splice the code entry block into calling block, right before the
|
|
|
|
// unconditional branch.
|
|
|
|
OrigBB->getInstList().splice(Br, CalleeEntry->getInstList());
|
|
|
|
CalleeEntry->replaceAllUsesWith(OrigBB); // Update PHI nodes
|
|
|
|
|
|
|
|
// Remove the unconditional branch.
|
|
|
|
OrigBB->getInstList().erase(Br);
|
|
|
|
|
|
|
|
// Now we can remove the CalleeEntry block, which is now empty.
|
|
|
|
Caller->getBasicBlockList().erase(CalleeEntry);
|
2006-01-15 04:07:50 +08:00
|
|
|
|
2003-05-29 23:11:31 +08:00
|
|
|
return true;
|
|
|
|
}
|