InlineFunction.cpp revision f0c3354d998507515ab39e26b5292ea0ceb06aef
1ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner//===- InlineFunction.cpp - Code to perform function inlining -------------===// 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//===----------------------------------------------------------------------===// 9ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 10ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// This file implements inlining of a function into a call site, resolving 11ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// parameters and the return value as appropriate. 12ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 13ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner//===----------------------------------------------------------------------===// 14ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 15ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner#include "llvm/Transforms/Utils/Cloning.h" 163787e765facfad5ea62753922d940bcdd52afd57Chris Lattner#include "llvm/Constants.h" 177152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner#include "llvm/DerivedTypes.h" 18ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner#include "llvm/Module.h" 1980a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner#include "llvm/Instructions.h" 2080a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner#include "llvm/Intrinsics.h" 21468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner#include "llvm/Analysis/CallGraph.h" 2293e985f1b17aef62d58e3198a4604f9f6cfe8d19Chris Lattner#include "llvm/ADT/SmallVector.h" 2380a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner#include "llvm/Support/CallSite.h" 24f7703df4968084c18c248c1feea9961c19a32e6aChris Lattnerusing namespace llvm; 25ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 261dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattnerbool llvm::InlineFunction(CallInst *CI, CallGraph *CG, const TargetData *TD) { 271dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattner return InlineFunction(CallSite(CI), CG, TD); 28468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 291dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattnerbool llvm::InlineFunction(InvokeInst *II, CallGraph *CG, const TargetData *TD) { 301dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattner return InlineFunction(CallSite(II), CG, TD); 31468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 3280a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner 33cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// HandleInlinedInvoke - If we inlined an invoke site, we need to convert calls 34cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// in the body of the inlined function into invokes and turn unwind 35cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// instructions into branches to the invoke unwind dest. 36cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// 37cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// II is the invoke instruction begin inlined. FirstNewBlock is the first 38cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// block of the inlined code (the last block is the end of the function), 39cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// and InlineCodeInfo is information about the code that got inlined. 40cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattnerstatic void HandleInlinedInvoke(InvokeInst *II, BasicBlock *FirstNewBlock, 41cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner ClonedCodeInfo &InlinedCodeInfo) { 42cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner BasicBlock *InvokeDest = II->getUnwindDest(); 43cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner std::vector<Value*> InvokeDestPHIValues; 44cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 45cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // If there are PHI nodes in the unwind destination block, we need to 46cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // keep track of which values came into them from this invoke, then remove 47cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // the entry for this block. 48cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner BasicBlock *InvokeBlock = II->getParent(); 49cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); isa<PHINode>(I); ++I) { 50cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner PHINode *PN = cast<PHINode>(I); 51cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // Save the value to use for this edge. 52cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner InvokeDestPHIValues.push_back(PN->getIncomingValueForBlock(InvokeBlock)); 53cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 54cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 55cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner Function *Caller = FirstNewBlock->getParent(); 56cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 57cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // The inlined code is currently at the end of the function, scan from the 58cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // start of the inlined code to its end, checking for stuff we need to 59cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // rewrite. 60727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (InlinedCodeInfo.ContainsCalls || InlinedCodeInfo.ContainsUnwinds) { 61727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 62727d1dd58793447e83ade712f0e58172f156edcfChris Lattner BB != E; ++BB) { 63727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (InlinedCodeInfo.ContainsCalls) { 64727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ){ 65727d1dd58793447e83ade712f0e58172f156edcfChris Lattner Instruction *I = BBI++; 66727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 67727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // We only need to check for function calls: inlined invoke 68727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // instructions require no special handling. 69727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (!isa<CallInst>(I)) continue; 70727d1dd58793447e83ade712f0e58172f156edcfChris Lattner CallInst *CI = cast<CallInst>(I); 71cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 72fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands // If this call cannot unwind, don't convert it to an invoke. 732b0e8990ab33ec2dad21286d3ce01dbb4bbe63c1Duncan Sands if (CI->doesNotThrow()) 74727d1dd58793447e83ade712f0e58172f156edcfChris Lattner continue; 75a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 76727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Convert this function call into an invoke instruction. 77727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // First, split the basic block. 78727d1dd58793447e83ade712f0e58172f156edcfChris Lattner BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc"); 79727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 80727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Next, create the new invoke instruction, inserting it at the end 81727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // of the old basic block. 8293e985f1b17aef62d58e3198a4604f9f6cfe8d19Chris Lattner SmallVector<Value*, 8> InvokeArgs(CI->op_begin()+1, CI->op_end()); 83727d1dd58793447e83ade712f0e58172f156edcfChris Lattner InvokeInst *II = 84727d1dd58793447e83ade712f0e58172f156edcfChris Lattner new InvokeInst(CI->getCalledValue(), Split, InvokeDest, 85f1355a55f8d815f5385e9a4432195f03b65f3a42David Greene InvokeArgs.begin(), InvokeArgs.end(), 86727d1dd58793447e83ade712f0e58172f156edcfChris Lattner CI->getName(), BB->getTerminator()); 87727d1dd58793447e83ade712f0e58172f156edcfChris Lattner II->setCallingConv(CI->getCallingConv()); 88dc024674ff96820d6020757b48d47f46d4c07db2Duncan Sands II->setParamAttrs(CI->getParamAttrs()); 89727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 90727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Make sure that anything using the call now uses the invoke! 91727d1dd58793447e83ade712f0e58172f156edcfChris Lattner CI->replaceAllUsesWith(II); 92727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 93727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Delete the unconditional branch inserted by splitBasicBlock 94727d1dd58793447e83ade712f0e58172f156edcfChris Lattner BB->getInstList().pop_back(); 95727d1dd58793447e83ade712f0e58172f156edcfChris Lattner Split->getInstList().pop_front(); // Delete the original call 96727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 97727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Update any PHI nodes in the exceptional block to indicate that 98727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // there is now a new entry in them. 99727d1dd58793447e83ade712f0e58172f156edcfChris Lattner unsigned i = 0; 100727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); 101727d1dd58793447e83ade712f0e58172f156edcfChris Lattner isa<PHINode>(I); ++I, ++i) { 102727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PHINode *PN = cast<PHINode>(I); 103727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PN->addIncoming(InvokeDestPHIValues[i], BB); 104727d1dd58793447e83ade712f0e58172f156edcfChris Lattner } 105727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 106727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // This basic block is now complete, start scanning the next one. 107727d1dd58793447e83ade712f0e58172f156edcfChris Lattner break; 108727d1dd58793447e83ade712f0e58172f156edcfChris Lattner } 109cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 110cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 111727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) { 112727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // An UnwindInst requires special handling when it gets inlined into an 113727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // invoke site. Once this happens, we know that the unwind would cause 114727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // a control transfer to the invoke exception destination, so we can 115727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // transform it into a direct branch to the exception destination. 116727d1dd58793447e83ade712f0e58172f156edcfChris Lattner new BranchInst(InvokeDest, UI); 117727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 118727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Delete the unwind instruction! 119727d1dd58793447e83ade712f0e58172f156edcfChris Lattner UI->getParent()->getInstList().pop_back(); 120727d1dd58793447e83ade712f0e58172f156edcfChris Lattner 121727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Update any PHI nodes in the exceptional block to indicate that 122727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // there is now a new entry in them. 123727d1dd58793447e83ade712f0e58172f156edcfChris Lattner unsigned i = 0; 124727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); 125727d1dd58793447e83ade712f0e58172f156edcfChris Lattner isa<PHINode>(I); ++I, ++i) { 126727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PHINode *PN = cast<PHINode>(I); 127727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PN->addIncoming(InvokeDestPHIValues[i], BB); 128727d1dd58793447e83ade712f0e58172f156edcfChris Lattner } 129cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 130cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 131cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 132cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 133cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // Now that everything is happy, we have one final detail. The PHI nodes in 134cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // the exception destination block still have entries due to the original 135cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // invoke instruction. Eliminate these entries (which might even delete the 136cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // PHI node) now. 137cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner InvokeDest->removePredecessor(II->getParent()); 138cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner} 139cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 140d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// UpdateCallGraphAfterInlining - Once we have cloned code over from a callee 141d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// into the caller, update the specified callgraph to reflect the changes we 142d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// made. Note that it's possible that not all code was copied over, so only 143d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// some edges of the callgraph will be remain. 144d85340f4ec587e22b0239617f3b747a6df113894Chris Lattnerstatic void UpdateCallGraphAfterInlining(const Function *Caller, 145468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner const Function *Callee, 146d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner Function::iterator FirstNewBlock, 1475e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*> &ValueMap, 148468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraph &CG) { 149468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // Update the call graph by deleting the edge from Callee to Caller 150468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraphNode *CalleeNode = CG[Callee]; 151468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraphNode *CallerNode = CG[Caller]; 152468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallerNode->removeCallEdgeTo(CalleeNode); 153468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 154d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Since we inlined some uninlined call sites in the callee into the caller, 155468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // add edges from the caller to all of the callees of the callee. 156468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner for (CallGraphNode::iterator I = CalleeNode->begin(), 157d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner E = CalleeNode->end(); I != E; ++I) { 158d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner const Instruction *OrigCall = I->first.getInstruction(); 159d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 1605e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*>::iterator VMI = ValueMap.find(OrigCall); 161981418bf1562d0b5b470ddc7d0034c9f3297b893Chris Lattner // Only copy the edge if the call was inlined! 162981418bf1562d0b5b470ddc7d0034c9f3297b893Chris Lattner if (VMI != ValueMap.end() && VMI->second) { 1631bb3a402574557cb228f8a96030776c229e282e5Chris Lattner // If the call was inlined, but then constant folded, there is no edge to 1641bb3a402574557cb228f8a96030776c229e282e5Chris Lattner // add. Check for this case. 1651bb3a402574557cb228f8a96030776c229e282e5Chris Lattner if (Instruction *NewCall = dyn_cast<Instruction>(VMI->second)) 1661bb3a402574557cb228f8a96030776c229e282e5Chris Lattner CallerNode->addCalledFunction(CallSite::get(NewCall), I->second); 167d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 168d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 169468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 170468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 171cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 172ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// InlineFunction - This function inlines the called function into the basic 173ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// block of the caller. This returns false if it is not possible to inline this 174ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// call. The program is still in a well defined state if this occurs though. 175ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 176fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// Note that this only does one level of inlining. For example, if the 177fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now 178ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// exists in the instruction stream. Similiarly this will inline a recursive 179ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// function by one level. 180ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 1811dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattnerbool llvm::InlineFunction(CallSite CS, CallGraph *CG, const TargetData *TD) { 18280a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner Instruction *TheCall = CS.getInstruction(); 18380a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner assert(TheCall->getParent() && TheCall->getParent()->getParent() && 18480a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner "Instruction not in function!"); 185ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 18680a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner const Function *CalledFunc = CS.getCalledFunction(); 187ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner if (CalledFunc == 0 || // Can't inline external function or indirect 1885cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer CalledFunc->isDeclaration() || // call, or call to a vararg function! 189ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner CalledFunc->getFunctionType()->isVarArg()) return false; 190ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 1911b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 1921b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner // If the call to the callee is a non-tail call, we must clear the 'tail' 1931b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner // flags on any calls that we inline. 1941b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner bool MustClearTailCallFlags = 1953799ed83b4cb80695a81294da6a7d18cf0884f5eChris Lattner isa<CallInst>(TheCall) && !cast<CallInst>(TheCall)->isTailCall(); 1961b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 197f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If the call to the callee cannot throw, set the 'nounwind' flag on any 198f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // calls that we inline. 199f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands bool MarkNoUnwind = CS.doesNotThrow(); 200f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 20180a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock *OrigBB = TheCall->getParent(); 202ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner Function *Caller = OrigBB->getParent(); 203ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 2045052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // Get an iterator to the last basic block in the function, which will have 2055052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // the new function inlined after it. 2065052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // 2075052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner Function::iterator LastBlock = &Caller->back(); 2085052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner 2095e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Make sure to capture all of the return instructions from the cloned 2105e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // function. 2115052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner std::vector<ReturnInst*> Returns; 212cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner ClonedCodeInfo InlinedFunctionInfo; 213d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner Function::iterator FirstNewBlock; 214f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 2155e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner { // Scope to destroy ValueMap after cloning. 2165e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*> ValueMap; 2175b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner 2185b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // Calculate the vector of arguments to pass into the function cloner, which 2195b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // matches up the formal to the actual argument values. 220fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman assert(std::distance(CalledFunc->arg_begin(), CalledFunc->arg_end()) == 2215e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner std::distance(CS.arg_begin(), CS.arg_end()) && 2225e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner "No varargs calls can be inlined!"); 2235e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner CallSite::arg_iterator AI = CS.arg_begin(); 224e4d5c441e04bdc00ccf1804744af670655123b07Chris Lattner for (Function::const_arg_iterator I = CalledFunc->arg_begin(), 225e4d5c441e04bdc00ccf1804744af670655123b07Chris Lattner E = CalledFunc->arg_end(); I != E; ++I, ++AI) 2265e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner ValueMap[I] = *AI; 227fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 2285b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // We want the inliner to prune the code as it copies. We would LOVE to 2295b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // have no dead or constant instructions leftover after inlining occurs 2305b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // (which can happen, e.g., because an argument was constant), but we'll be 2315b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // happy with whatever the cloner can do. 2325b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner CloneAndPruneFunctionInto(Caller, CalledFunc, ValueMap, Returns, ".i", 2331dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattner &InlinedFunctionInfo, TD); 234d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 235d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Remember the first block that is newly cloned over. 236d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner FirstNewBlock = LastBlock; ++FirstNewBlock; 237d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 238d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Update the callgraph if requested. 239d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) 240d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner UpdateCallGraphAfterInlining(Caller, CalledFunc, FirstNewBlock, ValueMap, 241d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner *CG); 242fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman } 243d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 244ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // If there are any alloca instructions in the block that used to be the entry 245ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // block for the callee, move them to the entry block of the caller. First 246ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // calculate which instruction they should be inserted before. We insert the 247ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // instructions at the end of the current alloca list. 248ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // 24921f20558d629f7ff8f64c20746d890d29328a544Chris Lattner { 25080a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock::iterator InsertPoint = Caller->begin()->begin(); 2515e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner for (BasicBlock::iterator I = FirstNewBlock->begin(), 2525e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner E = FirstNewBlock->end(); I != E; ) 25333bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I++)) { 25433bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner // If the alloca is now dead, remove it. This often occurs due to code 25533bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner // specialization. 25633bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner if (AI->use_empty()) { 25733bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner AI->eraseFromParent(); 25833bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner continue; 25933bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner } 26033bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner 261f775f95369ba7d88a5cb8b6f1900241699d79351Chris Lattner if (isa<Constant>(AI->getArraySize())) { 26221f20558d629f7ff8f64c20746d890d29328a544Chris Lattner // Scan for the block of allocas that we can move over, and move them 26321f20558d629f7ff8f64c20746d890d29328a544Chris Lattner // all at once. 264c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner while (isa<AllocaInst>(I) && 265c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner isa<Constant>(cast<AllocaInst>(I)->getArraySize())) 266c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner ++I; 267c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner 268c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner // Transfer all of the allocas over in a block. Using splice means 269e26bff22dbcfec2074a7502dd56683fc7f55912aDan Gohman // that the instructions aren't removed from the symbol table, then 270c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner // reinserted. 271ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman Caller->getEntryBlock().getInstList().splice( 272ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman InsertPoint, 273ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman FirstNewBlock->getInstList(), 274ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman AI, I); 275f775f95369ba7d88a5cb8b6f1900241699d79351Chris Lattner } 27633bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner } 27780a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner } 27880a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner 279bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If the inlined code contained dynamic alloca instructions, wrap the inlined 280bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // code with llvm.stacksave/llvm.stackrestore intrinsics. 281bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsDynamicAllocas) { 282bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner Module *M = Caller->getParent(); 28343ad6b3e0d6ada51e9b23aab3e061187f1f5710cChristopher Lamb const Type *BytePtr = PointerType::getUnqual(Type::Int8Ty); 284bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Get the two intrinsics we care about. 285a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner Constant *StackSave, *StackRestore; 286a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner StackSave = M->getOrInsertFunction("llvm.stacksave", BytePtr, NULL); 287bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner StackRestore = M->getOrInsertFunction("llvm.stackrestore", Type::VoidTy, 288a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner BytePtr, NULL); 289d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 290d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // If we are preserving the callgraph, add edges to the stacksave/restore 291d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // functions for the calls we insert. 29221ba23d0d88cff57dcdf104cd6914dabcbc68131Chris Lattner CallGraphNode *StackSaveCGN = 0, *StackRestoreCGN = 0, *CallerNode = 0; 293d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) { 294a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner // We know that StackSave/StackRestore are Function*'s, because they are 295a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner // intrinsics which must have the right types. 296a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner StackSaveCGN = CG->getOrInsertFunction(cast<Function>(StackSave)); 297a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner StackRestoreCGN = CG->getOrInsertFunction(cast<Function>(StackRestore)); 298d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CallerNode = (*CG)[Caller]; 299d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 300d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 301bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert the llvm.stacksave. 302d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CallInst *SavedPtr = new CallInst(StackSave, "savedstack", 303d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner FirstNewBlock->begin()); 304d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(SavedPtr, StackSaveCGN); 305d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 306bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert a call to llvm.stackrestore before any return instructions in the 307bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // inlined function. 308d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 309d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CallInst *CI = new CallInst(StackRestore, SavedPtr, "", Returns[i]); 310d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(CI, StackRestoreCGN); 311d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 312468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 313468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // Count the number of StackRestore calls we insert. 314468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner unsigned NumStackRestores = Returns.size(); 315bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner 316bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If we are inlining an invoke instruction, insert restores before each 317bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // unwind. These unwinds will be rewritten into branches later. 318bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsUnwinds && isa<InvokeInst>(TheCall)) { 319bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 320bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner BB != E; ++BB) 321468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) { 322bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner new CallInst(StackRestore, SavedPtr, "", UI); 323468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner ++NumStackRestores; 324468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 325468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 326bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner } 327bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner 3281fdf4a859f03ce5aa4ce9acba29ce321c847388eChris Lattner // If we are inlining tail call instruction through a call site that isn't 3291fdf4a859f03ce5aa4ce9acba29ce321c847388eChris Lattner // marked 'tail', we must remove the tail marker for any calls in the inlined 330f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // code. Also, calls inlined through a 'nounwind' call site should be marked 331f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // 'nounwind'. 332f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsCalls && 333f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands (MustClearTailCallFlags || MarkNoUnwind)) { 3341b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 3351b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner BB != E; ++BB) 3361b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 337f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (CallInst *CI = dyn_cast<CallInst>(I)) { 338f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MustClearTailCallFlags) 339f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setTailCall(false); 340f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MarkNoUnwind) 341f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setDoesNotThrow(); 342f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 3431b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner } 3441b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 345f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If we are inlining through a 'nounwind' call site then any inlined 'unwind' 346f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // instructions are unreachable. 347f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsUnwinds && MarkNoUnwind) 348f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 349f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB != E; ++BB) { 350f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands TerminatorInst *Term = BB->getTerminator(); 351f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (isa<UnwindInst>(Term)) { 352f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands new UnreachableInst(Term); 353f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB->getInstList().erase(Term); 354f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 355f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 356f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 3575e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // If we are inlining for an invoke instruction, we must make sure to rewrite 3585e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any inlined 'unwind' instructions into branches to the invoke exception 3595e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // destination, and call instructions into invoke instructions. 360cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 361cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner HandleInlinedInvoke(II, FirstNewBlock, InlinedFunctionInfo); 3625e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 36344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If we cloned in _exactly one_ basic block, and if that block ends in a 36444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // return instruction, we splice the body of the inlined callee directly into 36544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the calling basic block. 36644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) { 36744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Move all of the instructions right before the call. 36844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(), 36944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock->begin(), FirstNewBlock->end()); 37044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Remove the cloned basic block. 37144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().pop_back(); 372fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 37344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the call site was an invoke instruction, add a branch to the normal 37444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // destination. 37544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 37644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner new BranchInst(II->getNormalDest(), TheCall); 37744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 37844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the return instruction returned a value, replace uses of the call with 37944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // uses of the returned value. 38044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (!TheCall->use_empty()) 38144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner TheCall->replaceAllUsesWith(Returns[0]->getReturnValue()); 38244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 38344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the Call/Invoke, we can delete it. 38444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner TheCall->getParent()->getInstList().erase(TheCall); 38544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 38644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the return instruction, delete it also. 38744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Returns[0]->getParent()->getInstList().erase(Returns[0]); 38844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 38944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // We are now done with the inlining. 39044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner return true; 39144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner } 39244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 39344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Otherwise, we have the normal case, of more than one block to inline or 39444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // multiple return sites. 39544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 3965e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // We want to clone the entire callee function into the hole between the 3975e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // "starter" and "ender" blocks. How we accomplish this depends on whether 3985e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // this is an invoke instruction or a call instruction. 3995e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner BasicBlock *AfterCallBB; 4005e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) { 401fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4025e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Add an unconditional branch to make this look like the CallInst case... 4035e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner BranchInst *NewBr = new BranchInst(II->getNormalDest(), TheCall); 404fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4055e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Split the basic block. This guarantees that no PHI nodes will have to be 4065e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // updated due to new incoming edges, and make the invoke case more 4075e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // symmetric to the call case. 4085e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(NewBr, 409284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 410fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4115e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } else { // It's a call 41244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If this is a call instruction, we need to split the basic block that 41344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the call lives in. 4145e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // 4155e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(TheCall, 416284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 4175e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 4185e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 41944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Change the branch that used to go to AfterCallBB to branch to the first 42044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // basic block of the inlined function. 42144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // 42244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner TerminatorInst *Br = OrigBB->getTerminator(); 423fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman assert(Br && Br->getOpcode() == Instruction::Br && 42444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner "splitBasicBlock broken!"); 42544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Br->setOperand(0, FirstNewBlock); 42644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 42744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 42844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Now that the function is correct, make it a little bit nicer. In 42944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // particular, move the basic blocks inserted from the end of the function 43044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // into the space made by splitting the source basic block. 43144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // 43244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(), 43344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock, Caller->end()); 43444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 4355e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Handle all of the return instructions that we just cloned in, and eliminate 4365e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any users of the original call/invoke instruction. 4375e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (Returns.size() > 1) { 4385e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // The PHI node should go at the front of the new basic block to merge all 4395e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // possible incoming values. 4405e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // 4415e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner PHINode *PHI = 0; 4425e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (!TheCall->use_empty()) { 4435e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner PHI = new PHINode(CalledFunc->getReturnType(), 4445e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner TheCall->getName(), AfterCallBB->begin()); 445fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4465e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Anything that used the result of the function call should now use the 4475e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // PHI node as their operand. 4485e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // 4495e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner TheCall->replaceAllUsesWith(PHI); 4505e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 451fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4525e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Loop over all of the return instructions, turning them into unconditional 4535e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // branches to the merge point now, and adding entries to the PHI node as 4545e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // appropriate. 4555e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 4565e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner ReturnInst *RI = Returns[i]; 457fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4585e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (PHI) { 4595e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner assert(RI->getReturnValue() && "Ret should have value!"); 460fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman assert(RI->getReturnValue()->getType() == PHI->getType() && 4615e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner "Ret value not consistent in function!"); 4625e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner PHI->addIncoming(RI->getReturnValue(), RI->getParent()); 4635e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 464fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4655e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Add a branch to the merge point where the PHI node lives if it exists. 4665e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner new BranchInst(AfterCallBB, RI); 467fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4685e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Delete the return instruction now 4695e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner RI->getParent()->getInstList().erase(RI); 4705e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 471fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4725e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } else if (!Returns.empty()) { 4735e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Otherwise, if there is exactly one return value, just replace anything 4745e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // using the return value of the call with the computed value. 4755e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (!TheCall->use_empty()) 4765e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner TheCall->replaceAllUsesWith(Returns[0]->getReturnValue()); 477fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 478cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Splice the code from the return block into the block that it will return 479cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // to, which contains the code that was after the call. 480cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner BasicBlock *ReturnBB = Returns[0]->getParent(); 481adfd32f8eefc804dce24d14450c10f592e643e2dChris Lattner AfterCallBB->getInstList().splice(AfterCallBB->begin(), 482adfd32f8eefc804dce24d14450c10f592e643e2dChris Lattner ReturnBB->getInstList()); 483cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 484adfd32f8eefc804dce24d14450c10f592e643e2dChris Lattner // Update PHI nodes that use the ReturnBB to use the AfterCallBB. 485adfd32f8eefc804dce24d14450c10f592e643e2dChris Lattner ReturnBB->replaceAllUsesWith(AfterCallBB); 486fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 487adfd32f8eefc804dce24d14450c10f592e643e2dChris Lattner // Delete the return instruction now and empty ReturnBB now. 4883787e765facfad5ea62753922d940bcdd52afd57Chris Lattner Returns[0]->eraseFromParent(); 4893787e765facfad5ea62753922d940bcdd52afd57Chris Lattner ReturnBB->eraseFromParent(); 4903787e765facfad5ea62753922d940bcdd52afd57Chris Lattner } else if (!TheCall->use_empty()) { 4913787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // No returns, but something is using the return value of the call. Just 4923787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // nuke the result. 4933787e765facfad5ea62753922d940bcdd52afd57Chris Lattner TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType())); 4945e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 495fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 4965e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Since we are now done with the Call/Invoke, we can delete it. 4973787e765facfad5ea62753922d940bcdd52afd57Chris Lattner TheCall->eraseFromParent(); 498ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 4997152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // We should always be able to fold the entry block of the function into the 5007152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // single predecessor of the block... 501cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!"); 5027152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0); 50344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 504cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Splice the code entry block into calling block, right before the 505cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // unconditional branch. 506cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().splice(Br, CalleeEntry->getInstList()); 507cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner CalleeEntry->replaceAllUsesWith(OrigBB); // Update PHI nodes 508cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 509cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Remove the unconditional branch. 510cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().erase(Br); 511cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 512cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Now we can remove the CalleeEntry block, which is now empty. 513cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner Caller->getBasicBlockList().erase(CalleeEntry); 514468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 515ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner return true; 516ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner} 517