InlineFunction.cpp revision 0623e90398153be61226ad19f1b40d3817874526
1ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner//===- InlineFunction.cpp - Code to perform function inlining -------------===// 2fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// 3b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// The LLVM Compiler Infrastructure 4b576c94c15af9a440f69d9d03c2afead7971118cJohn Criswell// 54ee451de366474b9c228b4e5fa573795a715216dChris Lattner// This file is distributed under the University of Illinois Open Source 64ee451de366474b9c228b4e5fa573795a715216dChris Lattner// 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" 180a205a459884ec745df1c529396dd921f029dafdOwen Anderson#include "llvm/LLVMContext.h" 19ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner#include "llvm/Module.h" 2080a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner#include "llvm/Instructions.h" 21517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel#include "llvm/IntrinsicInst.h" 2280a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner#include "llvm/Intrinsics.h" 23eaf42abab6d465c38891345d999255871cf03943Devang Patel#include "llvm/Attributes.h" 24468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner#include "llvm/Analysis/CallGraph.h" 25517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel#include "llvm/Analysis/DebugInfo.h" 26c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner#include "llvm/Target/TargetData.h" 2793e985f1b17aef62d58e3198a4604f9f6cfe8d19Chris Lattner#include "llvm/ADT/SmallVector.h" 28641ca93cff0f957fc5fb9dfb05d2a4a340aa8af7Devang Patel#include "llvm/ADT/StringExtras.h" 2980a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner#include "llvm/Support/CallSite.h" 30f7703df4968084c18c248c1feea9961c19a32e6aChris Lattnerusing namespace llvm; 31ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 328f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattnerbool llvm::InlineFunction(CallInst *CI, CallGraph *CG, const TargetData *TD, 338f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner SmallVectorImpl<AllocaInst*> *StaticAllocas) { 348f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner return InlineFunction(CallSite(CI), CG, TD, StaticAllocas); 35468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 368f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattnerbool llvm::InlineFunction(InvokeInst *II, CallGraph *CG, const TargetData *TD, 378f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner SmallVectorImpl<AllocaInst*> *StaticAllocas) { 388f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner return InlineFunction(CallSite(II), CG, TD, StaticAllocas); 39468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 4080a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner 41135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 42135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// HandleCallsInBlockInlinedThroughInvoke - When we inline a basic block into 43f61f89ae14cf332a014a598153137113af34002fEric Christopher/// an invoke, we have to turn all of the calls that can throw into 44135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// invokes. This function analyze BB to see if there are any calls, and if so, 45135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// it rewrites them to be invokes that jump to InvokeDest and fills in the PHI 4681dfb3885252fbf621b080827a080099864415f8Chris Lattner/// nodes in that block with the values specified in InvokeDestPHIValues. 47135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// 48135755dae4c3fa8003b76150689d5064aa4612eeChris Lattnerstatic void HandleCallsInBlockInlinedThroughInvoke(BasicBlock *BB, 49135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner BasicBlock *InvokeDest, 5081dfb3885252fbf621b080827a080099864415f8Chris Lattner const SmallVectorImpl<Value*> &InvokeDestPHIValues) { 51135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) { 52135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Instruction *I = BBI++; 53135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 54135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // We only need to check for function calls: inlined invoke 55135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // instructions require no special handling. 56135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CallInst *CI = dyn_cast<CallInst>(I); 57135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (CI == 0) continue; 58135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 59135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // If this call cannot unwind, don't convert it to an invoke. 60135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (CI->doesNotThrow()) 61135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 62135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 63135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Convert this function call into an invoke instruction. 64135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // First, split the basic block. 65135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc"); 66135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 67135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Next, create the new invoke instruction, inserting it at the end 68135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // of the old basic block. 69135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner SmallVector<Value*, 8> InvokeArgs(CI->op_begin()+1, CI->op_end()); 70135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner InvokeInst *II = 71135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner InvokeInst::Create(CI->getCalledValue(), Split, InvokeDest, 72135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner InvokeArgs.begin(), InvokeArgs.end(), 73135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CI->getName(), BB->getTerminator()); 74135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner II->setCallingConv(CI->getCallingConv()); 75135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner II->setAttributes(CI->getAttributes()); 76135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 7781dfb3885252fbf621b080827a080099864415f8Chris Lattner // Make sure that anything using the call now uses the invoke! This also 7881dfb3885252fbf621b080827a080099864415f8Chris Lattner // updates the CallGraph if present. 79135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CI->replaceAllUsesWith(II); 80135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 81135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Delete the unconditional branch inserted by splitBasicBlock 82135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner BB->getInstList().pop_back(); 83135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Split->getInstList().pop_front(); // Delete the original call 84135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 85135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Update any PHI nodes in the exceptional block to indicate that 86135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // there is now a new entry in them. 87135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner unsigned i = 0; 88135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); 89135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner isa<PHINode>(I); ++I, ++i) 90135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner cast<PHINode>(I)->addIncoming(InvokeDestPHIValues[i], BB); 91135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 92135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // This basic block is now complete, the caller will continue scanning the 93135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // next one. 94135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner return; 95135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } 96135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner} 97135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 98135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 99cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// HandleInlinedInvoke - If we inlined an invoke site, we need to convert calls 100cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// in the body of the inlined function into invokes and turn unwind 101cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// instructions into branches to the invoke unwind dest. 102cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// 103dac5c4b10b387b55c2394cd98a64f3f1394df2e8Nick Lewycky/// II is the invoke instruction being inlined. FirstNewBlock is the first 104cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// block of the inlined code (the last block is the end of the function), 105cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// and InlineCodeInfo is information about the code that got inlined. 106cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattnerstatic void HandleInlinedInvoke(InvokeInst *II, BasicBlock *FirstNewBlock, 10781dfb3885252fbf621b080827a080099864415f8Chris Lattner ClonedCodeInfo &InlinedCodeInfo) { 108cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner BasicBlock *InvokeDest = II->getUnwindDest(); 109135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner SmallVector<Value*, 8> InvokeDestPHIValues; 110cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 111cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // If there are PHI nodes in the unwind destination block, we need to 112cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // keep track of which values came into them from this invoke, then remove 113cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // the entry for this block. 114cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner BasicBlock *InvokeBlock = II->getParent(); 115cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); isa<PHINode>(I); ++I) { 116cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner PHINode *PN = cast<PHINode>(I); 117cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // Save the value to use for this edge. 118cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner InvokeDestPHIValues.push_back(PN->getIncomingValueForBlock(InvokeBlock)); 119cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 120cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 121cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner Function *Caller = FirstNewBlock->getParent(); 122a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 123cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // The inlined code is currently at the end of the function, scan from the 124cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // start of the inlined code to its end, checking for stuff we need to 125135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // rewrite. If the code doesn't have calls or unwinds, we know there is 126135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // nothing to rewrite. 127135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (!InlinedCodeInfo.ContainsCalls && !InlinedCodeInfo.ContainsUnwinds) { 128135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Now that everything is happy, we have one final detail. The PHI nodes in 129135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // the exception destination block still have entries due to the original 130135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // invoke instruction. Eliminate these entries (which might even delete the 131135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // PHI node) now. 132135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner InvokeDest->removePredecessor(II->getParent()); 133135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner return; 134135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } 135135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 136135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); BB != E; ++BB){ 137135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (InlinedCodeInfo.ContainsCalls) 138135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner HandleCallsInBlockInlinedThroughInvoke(BB, InvokeDest, 13981dfb3885252fbf621b080827a080099864415f8Chris Lattner InvokeDestPHIValues); 140135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 141135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) { 142135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // An UnwindInst requires special handling when it gets inlined into an 143135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // invoke site. Once this happens, we know that the unwind would cause 144135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // a control transfer to the invoke exception destination, so we can 145135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // transform it into a direct branch to the exception destination. 146135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner BranchInst::Create(InvokeDest, UI); 147135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 148135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Delete the unwind instruction! 149135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner UI->eraseFromParent(); 150135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 151135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Update any PHI nodes in the exceptional block to indicate that 152135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // there is now a new entry in them. 153135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner unsigned i = 0; 154135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); 155135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner isa<PHINode>(I); ++I, ++i) { 156135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner PHINode *PN = cast<PHINode>(I); 157135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner PN->addIncoming(InvokeDestPHIValues[i], BB); 158cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 159cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 160cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 161cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 162cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // Now that everything is happy, we have one final detail. The PHI nodes in 163cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // the exception destination block still have entries due to the original 164cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // invoke instruction. Eliminate these entries (which might even delete the 165cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // PHI node) now. 166cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner InvokeDest->removePredecessor(II->getParent()); 167cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner} 168cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 169d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// UpdateCallGraphAfterInlining - Once we have cloned code over from a callee 170d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// into the caller, update the specified callgraph to reflect the changes we 171d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// made. Note that it's possible that not all code was copied over, so only 172d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands/// some edges of the callgraph may remain. 173d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sandsstatic void UpdateCallGraphAfterInlining(CallSite CS, 174d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner Function::iterator FirstNewBlock, 1755e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*> &ValueMap, 176468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraph &CG) { 177d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands const Function *Caller = CS.getInstruction()->getParent()->getParent(); 178d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands const Function *Callee = CS.getCalledFunction(); 179468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraphNode *CalleeNode = CG[Callee]; 180468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraphNode *CallerNode = CG[Caller]; 181a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 182d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Since we inlined some uninlined call sites in the callee into the caller, 183468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // add edges from the caller to all of the callees of the callee. 184c478e52bf4c12691037856ee103c66946afeab6cGabor Greif CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end(); 185c478e52bf4c12691037856ee103c66946afeab6cGabor Greif 186c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // Consider the case where CalleeNode == CallerNode. 187125329891f97baedef21e4b464ba70182c3fb45eGabor Greif CallGraphNode::CalledFunctionsVector CallCache; 188c478e52bf4c12691037856ee103c66946afeab6cGabor Greif if (CalleeNode == CallerNode) { 189c478e52bf4c12691037856ee103c66946afeab6cGabor Greif CallCache.assign(I, E); 190c478e52bf4c12691037856ee103c66946afeab6cGabor Greif I = CallCache.begin(); 191c478e52bf4c12691037856ee103c66946afeab6cGabor Greif E = CallCache.end(); 192c478e52bf4c12691037856ee103c66946afeab6cGabor Greif } 193c478e52bf4c12691037856ee103c66946afeab6cGabor Greif 194c478e52bf4c12691037856ee103c66946afeab6cGabor Greif for (; I != E; ++I) { 195a541b0fde2ab6b8b037edf113d42da41a2c5aae9Chris Lattner const Value *OrigCall = I->first; 196a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 1975e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*>::iterator VMI = ValueMap.find(OrigCall); 198981418bf1562d0b5b470ddc7d0034c9f3297b893Chris Lattner // Only copy the edge if the call was inlined! 199135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (VMI == ValueMap.end() || VMI->second == 0) 200135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 201135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 202135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // If the call was inlined, but then constant folded, there is no edge to 203135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // add. Check for this case. 204135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (Instruction *NewCall = dyn_cast<Instruction>(VMI->second)) 205135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner CallerNode->addCalledFunction(CallSite::get(NewCall), I->second); 206d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 207135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 20839fa32403e0b5e163f4f05566d6cde65e6c11095Dale Johannesen // Update the call graph by deleting the edge from Callee to Caller. We must 20939fa32403e0b5e163f4f05566d6cde65e6c11095Dale Johannesen // do this after the loop above in case Caller and Callee are the same. 21039fa32403e0b5e163f4f05566d6cde65e6c11095Dale Johannesen CallerNode->removeCallEdgeFor(CS); 211468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 212468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 213ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// InlineFunction - This function inlines the called function into the basic 214ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// block of the caller. This returns false if it is not possible to inline this 215ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// call. The program is still in a well defined state if this occurs though. 216ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 217fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// Note that this only does one level of inlining. For example, if the 218fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now 219ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// exists in the instruction stream. Similiarly this will inline a recursive 220ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// function by one level. 221ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 2228f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattnerbool llvm::InlineFunction(CallSite CS, CallGraph *CG, const TargetData *TD, 2238f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner SmallVectorImpl<AllocaInst*> *StaticAllocas) { 22480a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner Instruction *TheCall = CS.getInstruction(); 225e922c0201916e0b980ab3cfe91e1413e68d55647Owen Anderson LLVMContext &Context = TheCall->getContext(); 22680a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner assert(TheCall->getParent() && TheCall->getParent()->getParent() && 22780a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner "Instruction not in function!"); 228ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 22980a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner const Function *CalledFunc = CS.getCalledFunction(); 230ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner if (CalledFunc == 0 || // Can't inline external function or indirect 2315cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer CalledFunc->isDeclaration() || // call, or call to a vararg function! 2320623e90398153be61226ad19f1b40d3817874526Eric Christopher CalledFunc->getFunctionType()->isVarArg()) return false; 233ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 2341b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 235af9985c6b9d066cb70a0363fed699022d0ec196cChris Lattner // If the call to the callee is not a tail call, we must clear the 'tail' 2361b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner // flags on any calls that we inline. 2371b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner bool MustClearTailCallFlags = 238af9985c6b9d066cb70a0363fed699022d0ec196cChris Lattner !(isa<CallInst>(TheCall) && cast<CallInst>(TheCall)->isTailCall()); 2391b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 240f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If the call to the callee cannot throw, set the 'nounwind' flag on any 241f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // calls that we inline. 242f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands bool MarkNoUnwind = CS.doesNotThrow(); 243f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 24480a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock *OrigBB = TheCall->getParent(); 245ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner Function *Caller = OrigBB->getParent(); 246ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 2470e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // GC poses two hazards to inlining, which only occur when the callee has GC: 2480e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // 1. If the caller has no GC, then the callee's GC must be propagated to the 2490e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // caller. 2500e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // 2. If the caller has a differing GC, it is invalid to inline. 2515eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (CalledFunc->hasGC()) { 2525eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (!Caller->hasGC()) 2535eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen Caller->setGC(CalledFunc->getGC()); 2545eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen else if (CalledFunc->getGC() != Caller->getGC()) 2550e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen return false; 2560e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen } 257a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 2585052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // Get an iterator to the last basic block in the function, which will have 2595052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // the new function inlined after it. 2605052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // 2615052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner Function::iterator LastBlock = &Caller->back(); 2625052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner 2635e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Make sure to capture all of the return instructions from the cloned 2645e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // function. 265ec1bea0d94372985a0a5eb283e644c6d0dd345dcChris Lattner SmallVector<ReturnInst*, 8> Returns; 266cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner ClonedCodeInfo InlinedFunctionInfo; 2670744f09efc53d3352ac1caffc61f6e8239201c3bDale Johannesen Function::iterator FirstNewBlock; 268f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 2695e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner { // Scope to destroy ValueMap after cloning. 2705e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*> ValueMap; 2715b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner 2729614fcc640eb628cc5dfddb277ebae9f6cb61014Dan Gohman assert(CalledFunc->arg_size() == CS.arg_size() && 2735e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner "No varargs calls can be inlined!"); 274a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 275c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Calculate the vector of arguments to pass into the function cloner, which 276c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // matches up the formal to the actual argument values. 2775e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner CallSite::arg_iterator AI = CS.arg_begin(); 278c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner unsigned ArgNo = 0; 279e4d5c441e04bdc00ccf1804744af670655123b07Chris Lattner for (Function::const_arg_iterator I = CalledFunc->arg_begin(), 280c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner E = CalledFunc->arg_end(); I != E; ++I, ++AI, ++ArgNo) { 281c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *ActualArg = *AI; 282a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 283d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // When byval arguments actually inlined, we need to make the copy implied 284d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // by them explicit. However, we don't do this if the callee is readonly 285d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // or readnone, because the copy would be unneeded: the callee doesn't 286d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // modify the struct. 2870598866c052147c31b808391f58434ce3dbfb838Devang Patel if (CalledFunc->paramHasAttr(ArgNo+1, Attribute::ByVal) && 288d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands !CalledFunc->onlyReadsMemory()) { 289c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner const Type *AggTy = cast<PointerType>(I->getType())->getElementType(); 2901d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson const Type *VoidPtrTy = 291ac53a0b272452013124bfc70480aea5e41b60f40Duncan Sands Type::getInt8PtrTy(Context); 292a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 293c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Create the alloca. If we have TargetData, use nice alignment. 294c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner unsigned Align = 1; 295c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (TD) Align = TD->getPrefTypeAlignment(AggTy); 29650dead06ffc107edb7e84857baaeeb09039c631cOwen Anderson Value *NewAlloca = new AllocaInst(AggTy, 0, Align, 2979adc0abad3c3ed40a268ccbcee0c74cb9e1359feOwen Anderson I->getName(), 2989adc0abad3c3ed40a268ccbcee0c74cb9e1359feOwen Anderson &*Caller->begin()->begin()); 299c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Emit a memcpy. 3001d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson const Type *Tys[] = { Type::getInt64Ty(Context) }; 301c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Function *MemCpyFn = Intrinsic::getDeclaration(Caller->getParent(), 302824b958e6fb1236e92e4d07f3acf18fca107cdc0Chris Lattner Intrinsic::memcpy, 303824b958e6fb1236e92e4d07f3acf18fca107cdc0Chris Lattner Tys, 1); 304c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *DestCast = new BitCastInst(NewAlloca, VoidPtrTy, "tmp", TheCall); 305c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *SrcCast = new BitCastInst(*AI, VoidPtrTy, "tmp", TheCall); 306a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 307c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *Size; 308c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (TD == 0) 309baf3c404409d5e47b13984a7f95bfbd6d1f2e79eOwen Anderson Size = ConstantExpr::getSizeOf(AggTy); 310c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner else 3111d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson Size = ConstantInt::get(Type::getInt64Ty(Context), 3120a205a459884ec745df1c529396dd921f029dafdOwen Anderson TD->getTypeStoreSize(AggTy)); 313a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 314c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Always generate a memcpy of alignment 1 here because we don't know 315c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // the alignment of the src pointer. Other optimizations can infer 316c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // better alignment. 317c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *CallArgs[] = { 3181d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson DestCast, SrcCast, Size, 3191d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson ConstantInt::get(Type::getInt32Ty(Context), 1) 320c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner }; 321c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallInst *TheMemCpy = 322051a950000e21935165db56695e35bade668193bGabor Greif CallInst::Create(MemCpyFn, CallArgs, CallArgs+4, "", TheCall); 323a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 324c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // If we have a call graph, update it. 325c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (CG) { 326c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallGraphNode *MemCpyCGN = CG->getOrInsertFunction(MemCpyFn); 327c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallGraphNode *CallerNode = (*CG)[Caller]; 328c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallerNode->addCalledFunction(TheMemCpy, MemCpyCGN); 329c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 330a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 331c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Uses of the argument in the function should use our new alloca 332c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // instead. 333c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner ActualArg = NewAlloca; 334c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 335a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 336c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner ValueMap[I] = ActualArg; 337c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 338fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 3395b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // We want the inliner to prune the code as it copies. We would LOVE to 3405b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // have no dead or constant instructions leftover after inlining occurs 3415b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // (which can happen, e.g., because an argument was constant), but we'll be 3425b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // happy with whatever the cloner can do. 3435b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner CloneAndPruneFunctionInto(Caller, CalledFunc, ValueMap, Returns, ".i", 34453bb5c95afe4ff2627cac513221af2e4e7c5d2e3Devang Patel &InlinedFunctionInfo, TD, TheCall); 345a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 346d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Remember the first block that is newly cloned over. 347d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner FirstNewBlock = LastBlock; ++FirstNewBlock; 348a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 349d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Update the callgraph if requested. 350d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) 351d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands UpdateCallGraphAfterInlining(CS, FirstNewBlock, ValueMap, *CG); 352fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman } 353a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 354ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // If there are any alloca instructions in the block that used to be the entry 355ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // block for the callee, move them to the entry block of the caller. First 356ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // calculate which instruction they should be inserted before. We insert the 357ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // instructions at the end of the current alloca list. 358ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // 35921f20558d629f7ff8f64c20746d890d29328a544Chris Lattner { 36080a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock::iterator InsertPoint = Caller->begin()->begin(); 3615e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner for (BasicBlock::iterator I = FirstNewBlock->begin(), 362135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner E = FirstNewBlock->end(); I != E; ) { 363135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner AllocaInst *AI = dyn_cast<AllocaInst>(I++); 364135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (AI == 0) continue; 365135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 366135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // If the alloca is now dead, remove it. This often occurs due to code 367135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // specialization. 368135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (AI->use_empty()) { 369135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner AI->eraseFromParent(); 370135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 37133bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner } 372135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 373135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (!isa<Constant>(AI->getArraySize())) 374135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 375135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 3768f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner // Keep track of the static allocas that we inline into the caller if the 3778f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner // StaticAllocas pointer is non-null. 3788f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner if (StaticAllocas) StaticAllocas->push_back(AI); 3798f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner 380135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Scan for the block of allocas that we can move over, and move them 381135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // all at once. 382135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner while (isa<AllocaInst>(I) && 3838f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner isa<Constant>(cast<AllocaInst>(I)->getArraySize())) { 3848f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner if (StaticAllocas) StaticAllocas->push_back(cast<AllocaInst>(I)); 385135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner ++I; 3868f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner } 387135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 388135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Transfer all of the allocas over in a block. Using splice means 389135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // that the instructions aren't removed from the symbol table, then 390135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // reinserted. 391135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Caller->getEntryBlock().getInstList().splice(InsertPoint, 392135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner FirstNewBlock->getInstList(), 393135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner AI, I); 394135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } 39580a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner } 39680a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner 397bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If the inlined code contained dynamic alloca instructions, wrap the inlined 398bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // code with llvm.stacksave/llvm.stackrestore intrinsics. 399bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsDynamicAllocas) { 400bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner Module *M = Caller->getParent(); 401bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Get the two intrinsics we care about. 4026128df525501c333a650d097703c18d7e878f5e8Chris Lattner Function *StackSave = Intrinsic::getDeclaration(M, Intrinsic::stacksave); 4036128df525501c333a650d097703c18d7e878f5e8Chris Lattner Function *StackRestore=Intrinsic::getDeclaration(M,Intrinsic::stackrestore); 404d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 405d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // If we are preserving the callgraph, add edges to the stacksave/restore 406d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // functions for the calls we insert. 40721ba23d0d88cff57dcdf104cd6914dabcbc68131Chris Lattner CallGraphNode *StackSaveCGN = 0, *StackRestoreCGN = 0, *CallerNode = 0; 408d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) { 4096128df525501c333a650d097703c18d7e878f5e8Chris Lattner StackSaveCGN = CG->getOrInsertFunction(StackSave); 4106128df525501c333a650d097703c18d7e878f5e8Chris Lattner StackRestoreCGN = CG->getOrInsertFunction(StackRestore); 411d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CallerNode = (*CG)[Caller]; 412d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 413a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 414bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert the llvm.stacksave. 415a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands CallInst *SavedPtr = CallInst::Create(StackSave, "savedstack", 416051a950000e21935165db56695e35bade668193bGabor Greif FirstNewBlock->begin()); 417d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(SavedPtr, StackSaveCGN); 418a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 419bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert a call to llvm.stackrestore before any return instructions in the 420bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // inlined function. 421d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 422051a950000e21935165db56695e35bade668193bGabor Greif CallInst *CI = CallInst::Create(StackRestore, SavedPtr, "", Returns[i]); 423d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(CI, StackRestoreCGN); 424d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 425468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 426468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // Count the number of StackRestore calls we insert. 427468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner unsigned NumStackRestores = Returns.size(); 428a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 429bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If we are inlining an invoke instruction, insert restores before each 430bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // unwind. These unwinds will be rewritten into branches later. 431bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsUnwinds && isa<InvokeInst>(TheCall)) { 432bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 433bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner BB != E; ++BB) 434468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) { 4356128df525501c333a650d097703c18d7e878f5e8Chris Lattner CallInst *CI = CallInst::Create(StackRestore, SavedPtr, "", UI); 4366128df525501c333a650d097703c18d7e878f5e8Chris Lattner if (CG) CallerNode->addCalledFunction(CI, StackRestoreCGN); 437468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner ++NumStackRestores; 438468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 439468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 440bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner } 441bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner 442a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands // If we are inlining tail call instruction through a call site that isn't 4431fdf4a859f03ce5aa4ce9acba29ce321c847388eChris Lattner // marked 'tail', we must remove the tail marker for any calls in the inlined 444f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // code. Also, calls inlined through a 'nounwind' call site should be marked 445f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // 'nounwind'. 446f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsCalls && 447f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands (MustClearTailCallFlags || MarkNoUnwind)) { 4481b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 4491b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner BB != E; ++BB) 4501b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 451f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (CallInst *CI = dyn_cast<CallInst>(I)) { 452f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MustClearTailCallFlags) 453f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setTailCall(false); 454f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MarkNoUnwind) 455f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setDoesNotThrow(); 456f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 4571b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner } 4581b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 459f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If we are inlining through a 'nounwind' call site then any inlined 'unwind' 460f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // instructions are unreachable. 461f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsUnwinds && MarkNoUnwind) 462f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 463f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB != E; ++BB) { 464f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands TerminatorInst *Term = BB->getTerminator(); 465f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (isa<UnwindInst>(Term)) { 4661d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson new UnreachableInst(Context, Term); 467f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB->getInstList().erase(Term); 468f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 469f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 470f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 4715e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // If we are inlining for an invoke instruction, we must make sure to rewrite 4725e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any inlined 'unwind' instructions into branches to the invoke exception 4735e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // destination, and call instructions into invoke instructions. 474cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 47581dfb3885252fbf621b080827a080099864415f8Chris Lattner HandleInlinedInvoke(II, FirstNewBlock, InlinedFunctionInfo); 4765e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 47744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If we cloned in _exactly one_ basic block, and if that block ends in a 47844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // return instruction, we splice the body of the inlined callee directly into 47944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the calling basic block. 48044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) { 48144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Move all of the instructions right before the call. 48244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(), 48344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock->begin(), FirstNewBlock->end()); 48444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Remove the cloned basic block. 48544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().pop_back(); 486fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 48744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the call site was an invoke instruction, add a branch to the normal 48844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // destination. 48944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 490051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(II->getNormalDest(), TheCall); 49144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 49244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the return instruction returned a value, replace uses of the call with 49344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // uses of the returned value. 494dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel if (!TheCall->use_empty()) { 495dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel ReturnInst *R = Returns[0]; 4965877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (TheCall == R->getReturnValue()) 4979e9a0d5fc26878e51a58a8b57900fcbf952c2691Owen Anderson TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType())); 4985877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman else 4995877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman TheCall->replaceAllUsesWith(R->getReturnValue()); 500dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel } 50144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the Call/Invoke, we can delete it. 5021adec83ae84031bfa9f0bf209c5ee6c64906a1ffDan Gohman TheCall->eraseFromParent(); 50344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 50444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the return instruction, delete it also. 5051adec83ae84031bfa9f0bf209c5ee6c64906a1ffDan Gohman Returns[0]->eraseFromParent(); 50644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 50744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // We are now done with the inlining. 50844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner return true; 50944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner } 51044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 51144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Otherwise, we have the normal case, of more than one block to inline or 51244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // multiple return sites. 51344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 5145e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // We want to clone the entire callee function into the hole between the 5155e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // "starter" and "ender" blocks. How we accomplish this depends on whether 5165e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // this is an invoke instruction or a call instruction. 5175e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner BasicBlock *AfterCallBB; 5185e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) { 519fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5205e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Add an unconditional branch to make this look like the CallInst case... 521051a950000e21935165db56695e35bade668193bGabor Greif BranchInst *NewBr = BranchInst::Create(II->getNormalDest(), TheCall); 522fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5235e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Split the basic block. This guarantees that no PHI nodes will have to be 5245e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // updated due to new incoming edges, and make the invoke case more 5255e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // symmetric to the call case. 5265e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(NewBr, 527284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 528fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5295e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } else { // It's a call 53044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If this is a call instruction, we need to split the basic block that 53144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the call lives in. 5325e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // 5335e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(TheCall, 534284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 5355e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 5365e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 53744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Change the branch that used to go to AfterCallBB to branch to the first 53844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // basic block of the inlined function. 53944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // 54044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner TerminatorInst *Br = OrigBB->getTerminator(); 541fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman assert(Br && Br->getOpcode() == Instruction::Br && 54244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner "splitBasicBlock broken!"); 54344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Br->setOperand(0, FirstNewBlock); 54444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 54544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 54644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Now that the function is correct, make it a little bit nicer. In 54744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // particular, move the basic blocks inserted from the end of the function 54844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // into the space made by splitting the source basic block. 54944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(), 55044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock, Caller->end()); 55144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 5525e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Handle all of the return instructions that we just cloned in, and eliminate 5535e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any users of the original call/invoke instruction. 554b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel const Type *RTy = CalledFunc->getReturnType(); 5552c31750cd0ebdc83a890ace97dbb6249b3abe44eDan Gohman 556fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman if (Returns.size() > 1) { 5575e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // The PHI node should go at the front of the new basic block to merge all 5585e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // possible incoming values. 559fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHINode *PHI = 0; 5605e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (!TheCall->use_empty()) { 561fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHI = PHINode::Create(RTy, TheCall->getName(), 562fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman AfterCallBB->begin()); 563fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman // Anything that used the result of the function call should now use the 564fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman // PHI node as their operand. 565a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands TheCall->replaceAllUsesWith(PHI); 5665e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 567fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 568c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // Loop over all of the return instructions adding entries to the PHI node 569c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // as appropriate. 570fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman if (PHI) { 571fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 572fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman ReturnInst *RI = Returns[i]; 573fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman assert(RI->getReturnValue()->getType() == PHI->getType() && 574fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman "Ret value not consistent in function!"); 575fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHI->addIncoming(RI->getReturnValue(), RI->getParent()); 5765e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 577c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner 578c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner // Now that we inserted the PHI, check to see if it has a single value 579c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner // (e.g. all the entries are the same or undef). If so, remove the PHI so 580c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner // it doesn't block other optimizations. 581c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner if (Value *V = PHI->hasConstantValue()) { 582c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner PHI->replaceAllUsesWith(V); 583c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner PHI->eraseFromParent(); 584c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner } 58512a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel } 586fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 587c581acbbba3cb1af6a08e17314b26344333f9267Chris Lattner 588de62aeaec49ddcf4a4c61fbbb3a22d3a4dd448f0Gabor Greif // Add a branch to the merge points and remove return instructions. 58912a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 59012a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel ReturnInst *RI = Returns[i]; 5910744f09efc53d3352ac1caffc61f6e8239201c3bDale Johannesen BranchInst::Create(AfterCallBB, RI); 592b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel RI->eraseFromParent(); 5935e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 594b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel } else if (!Returns.empty()) { 595b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Otherwise, if there is exactly one return value, just replace anything 596b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // using the return value of the call with the computed value. 5975877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (!TheCall->use_empty()) { 5985877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (TheCall == Returns[0]->getReturnValue()) 5999e9a0d5fc26878e51a58a8b57900fcbf952c2691Owen Anderson TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType())); 6005877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman else 6015877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman TheCall->replaceAllUsesWith(Returns[0]->getReturnValue()); 6025877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman } 603a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 604b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Splice the code from the return block into the block that it will return 605b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // to, which contains the code that was after the call. 606b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel BasicBlock *ReturnBB = Returns[0]->getParent(); 607b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel AfterCallBB->getInstList().splice(AfterCallBB->begin(), 608b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->getInstList()); 609a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 610b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Update PHI nodes that use the ReturnBB to use the AfterCallBB. 611b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->replaceAllUsesWith(AfterCallBB); 612a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 613b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Delete the return instruction now and empty ReturnBB now. 614b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel Returns[0]->eraseFromParent(); 615b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->eraseFromParent(); 6163787e765facfad5ea62753922d940bcdd52afd57Chris Lattner } else if (!TheCall->use_empty()) { 6173787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // No returns, but something is using the return value of the call. Just 6183787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // nuke the result. 6199e9a0d5fc26878e51a58a8b57900fcbf952c2691Owen Anderson TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType())); 6205e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 621fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 6225e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Since we are now done with the Call/Invoke, we can delete it. 6233787e765facfad5ea62753922d940bcdd52afd57Chris Lattner TheCall->eraseFromParent(); 624ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 6257152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // We should always be able to fold the entry block of the function into the 6267152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // single predecessor of the block... 627cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!"); 6287152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0); 62944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 630cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Splice the code entry block into calling block, right before the 631cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // unconditional branch. 632cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().splice(Br, CalleeEntry->getInstList()); 633cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner CalleeEntry->replaceAllUsesWith(OrigBB); // Update PHI nodes 634cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 635cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Remove the unconditional branch. 636cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().erase(Br); 637cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 638cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Now we can remove the CalleeEntry block, which is now empty. 639cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner Caller->getBasicBlockList().erase(CalleeEntry); 640a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 641ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner return true; 642ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner} 643