InlineFunction.cpp revision 81dfb3885252fbf621b080827a080099864415f8
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 43135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// an invoke, we have to check all of 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 213517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel/// findFnRegionEndMarker - This is a utility routine that is used by 214517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel/// InlineFunction. Return llvm.dbg.region.end intrinsic that corresponds 215517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel/// to the llvm.dbg.func.start of the function F. Otherwise return NULL. 216135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner/// 217517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patelstatic const DbgRegionEndInst *findFnRegionEndMarker(const Function *F) { 218517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel 219e4b275610a7a05b7ee4c0378a906a6330e4c4ab0Devang Patel MDNode *FnStart = NULL; 220517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel const DbgRegionEndInst *FnEnd = NULL; 221517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel for (Function::const_iterator FI = F->begin(), FE =F->end(); FI != FE; ++FI) 222517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel for (BasicBlock::const_iterator BI = FI->begin(), BE = FI->end(); BI != BE; 223517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel ++BI) { 224517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (FnStart == NULL) { 225517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (const DbgFuncStartInst *FSI = dyn_cast<DbgFuncStartInst>(BI)) { 226e4b275610a7a05b7ee4c0378a906a6330e4c4ab0Devang Patel DISubprogram SP(FSI->getSubprogram()); 227517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel assert (SP.isNull() == false && "Invalid llvm.dbg.func.start"); 228517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (SP.describes(F)) 229e4b275610a7a05b7ee4c0378a906a6330e4c4ab0Devang Patel FnStart = SP.getNode(); 230517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 231135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 232517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 233135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 234135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (const DbgRegionEndInst *REI = dyn_cast<DbgRegionEndInst>(BI)) 235135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (REI->getContext() == FnStart) 236135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner FnEnd = REI; 237517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 238517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel return FnEnd; 239517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel} 240cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 241ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// InlineFunction - This function inlines the called function into the basic 242ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// block of the caller. This returns false if it is not possible to inline this 243ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// call. The program is still in a well defined state if this occurs though. 244ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 245fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// Note that this only does one level of inlining. For example, if the 246fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now 247ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// exists in the instruction stream. Similiarly this will inline a recursive 248ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// function by one level. 249ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 2508f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattnerbool llvm::InlineFunction(CallSite CS, CallGraph *CG, const TargetData *TD, 2518f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner SmallVectorImpl<AllocaInst*> *StaticAllocas) { 25280a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner Instruction *TheCall = CS.getInstruction(); 253e922c0201916e0b980ab3cfe91e1413e68d55647Owen Anderson LLVMContext &Context = TheCall->getContext(); 25480a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner assert(TheCall->getParent() && TheCall->getParent()->getParent() && 25580a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner "Instruction not in function!"); 256ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 25780a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner const Function *CalledFunc = CS.getCalledFunction(); 258ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner if (CalledFunc == 0 || // Can't inline external function or indirect 2595cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer CalledFunc->isDeclaration() || // call, or call to a vararg function! 260ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner CalledFunc->getFunctionType()->isVarArg()) return false; 261ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 2621b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 263af9985c6b9d066cb70a0363fed699022d0ec196cChris Lattner // If the call to the callee is not a tail call, we must clear the 'tail' 2641b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner // flags on any calls that we inline. 2651b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner bool MustClearTailCallFlags = 266af9985c6b9d066cb70a0363fed699022d0ec196cChris Lattner !(isa<CallInst>(TheCall) && cast<CallInst>(TheCall)->isTailCall()); 2671b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 268f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If the call to the callee cannot throw, set the 'nounwind' flag on any 269f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // calls that we inline. 270f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands bool MarkNoUnwind = CS.doesNotThrow(); 271f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 27280a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock *OrigBB = TheCall->getParent(); 273ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner Function *Caller = OrigBB->getParent(); 274ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 2750e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // GC poses two hazards to inlining, which only occur when the callee has GC: 2760e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // 1. If the caller has no GC, then the callee's GC must be propagated to the 2770e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // caller. 2780e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // 2. If the caller has a differing GC, it is invalid to inline. 2795eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (CalledFunc->hasGC()) { 2805eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (!Caller->hasGC()) 2815eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen Caller->setGC(CalledFunc->getGC()); 2825eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen else if (CalledFunc->getGC() != Caller->getGC()) 2830e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen return false; 2840e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen } 285a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 2865052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // Get an iterator to the last basic block in the function, which will have 2875052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // the new function inlined after it. 2885052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // 2895052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner Function::iterator LastBlock = &Caller->back(); 2905052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner 2915e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Make sure to capture all of the return instructions from the cloned 2925e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // function. 293ec1bea0d94372985a0a5eb283e644c6d0dd345dcChris Lattner SmallVector<ReturnInst*, 8> Returns; 294cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner ClonedCodeInfo InlinedFunctionInfo; 2950744f09efc53d3352ac1caffc61f6e8239201c3bDale Johannesen Function::iterator FirstNewBlock; 296f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 2975e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner { // Scope to destroy ValueMap after cloning. 2985e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*> ValueMap; 2995b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner 3009614fcc640eb628cc5dfddb277ebae9f6cb61014Dan Gohman assert(CalledFunc->arg_size() == CS.arg_size() && 3015e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner "No varargs calls can be inlined!"); 302a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 303c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Calculate the vector of arguments to pass into the function cloner, which 304c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // matches up the formal to the actual argument values. 3055e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner CallSite::arg_iterator AI = CS.arg_begin(); 306c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner unsigned ArgNo = 0; 307e4d5c441e04bdc00ccf1804744af670655123b07Chris Lattner for (Function::const_arg_iterator I = CalledFunc->arg_begin(), 308c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner E = CalledFunc->arg_end(); I != E; ++I, ++AI, ++ArgNo) { 309c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *ActualArg = *AI; 310a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 311d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // When byval arguments actually inlined, we need to make the copy implied 312d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // by them explicit. However, we don't do this if the callee is readonly 313d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // or readnone, because the copy would be unneeded: the callee doesn't 314d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // modify the struct. 3150598866c052147c31b808391f58434ce3dbfb838Devang Patel if (CalledFunc->paramHasAttr(ArgNo+1, Attribute::ByVal) && 316d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands !CalledFunc->onlyReadsMemory()) { 317c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner const Type *AggTy = cast<PointerType>(I->getType())->getElementType(); 3181d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson const Type *VoidPtrTy = 3191d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson PointerType::getUnqual(Type::getInt8Ty(Context)); 320a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 321c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Create the alloca. If we have TargetData, use nice alignment. 322c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner unsigned Align = 1; 323c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (TD) Align = TD->getPrefTypeAlignment(AggTy); 32450dead06ffc107edb7e84857baaeeb09039c631cOwen Anderson Value *NewAlloca = new AllocaInst(AggTy, 0, Align, 3259adc0abad3c3ed40a268ccbcee0c74cb9e1359feOwen Anderson I->getName(), 3269adc0abad3c3ed40a268ccbcee0c74cb9e1359feOwen Anderson &*Caller->begin()->begin()); 327c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Emit a memcpy. 3281d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson const Type *Tys[] = { Type::getInt64Ty(Context) }; 329c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Function *MemCpyFn = Intrinsic::getDeclaration(Caller->getParent(), 330824b958e6fb1236e92e4d07f3acf18fca107cdc0Chris Lattner Intrinsic::memcpy, 331824b958e6fb1236e92e4d07f3acf18fca107cdc0Chris Lattner Tys, 1); 332c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *DestCast = new BitCastInst(NewAlloca, VoidPtrTy, "tmp", TheCall); 333c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *SrcCast = new BitCastInst(*AI, VoidPtrTy, "tmp", TheCall); 334a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 335c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *Size; 336c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (TD == 0) 337baf3c404409d5e47b13984a7f95bfbd6d1f2e79eOwen Anderson Size = ConstantExpr::getSizeOf(AggTy); 338c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner else 3391d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson Size = ConstantInt::get(Type::getInt64Ty(Context), 3400a205a459884ec745df1c529396dd921f029dafdOwen Anderson TD->getTypeStoreSize(AggTy)); 341a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 342c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Always generate a memcpy of alignment 1 here because we don't know 343c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // the alignment of the src pointer. Other optimizations can infer 344c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // better alignment. 345c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *CallArgs[] = { 3461d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson DestCast, SrcCast, Size, 3471d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson ConstantInt::get(Type::getInt32Ty(Context), 1) 348c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner }; 349c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallInst *TheMemCpy = 350051a950000e21935165db56695e35bade668193bGabor Greif CallInst::Create(MemCpyFn, CallArgs, CallArgs+4, "", TheCall); 351a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 352c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // If we have a call graph, update it. 353c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (CG) { 354c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallGraphNode *MemCpyCGN = CG->getOrInsertFunction(MemCpyFn); 355c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallGraphNode *CallerNode = (*CG)[Caller]; 356c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallerNode->addCalledFunction(TheMemCpy, MemCpyCGN); 357c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 358a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 359c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Uses of the argument in the function should use our new alloca 360c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // instead. 361c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner ActualArg = NewAlloca; 362c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 363a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 364c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner ValueMap[I] = ActualArg; 365c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 366fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 367517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // Adjust llvm.dbg.region.end. If the CalledFunc has region end 368517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // marker then clone that marker after next stop point at the 369517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // call site. The function body cloner does not clone original 370517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // region end marker from the CalledFunc. This will ensure that 371517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // inlined function's scope ends at the right place. 372135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (const DbgRegionEndInst *DREI = findFnRegionEndMarker(CalledFunc)) { 373135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner for (BasicBlock::iterator BI = TheCall, BE = TheCall->getParent()->end(); 374135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner BI != BE; ++BI) { 375517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (DbgStopPointInst *DSPI = dyn_cast<DbgStopPointInst>(BI)) { 376517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (DbgRegionEndInst *NewDREI = 377135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner dyn_cast<DbgRegionEndInst>(DREI->clone(Context))) 378517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel NewDREI->insertAfter(DSPI); 379517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel break; 380517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 381517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 382517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 383517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel 3845b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // We want the inliner to prune the code as it copies. We would LOVE to 3855b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // have no dead or constant instructions leftover after inlining occurs 3865b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // (which can happen, e.g., because an argument was constant), but we'll be 3875b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // happy with whatever the cloner can do. 3885b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner CloneAndPruneFunctionInto(Caller, CalledFunc, ValueMap, Returns, ".i", 3891dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattner &InlinedFunctionInfo, TD); 390a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 391d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Remember the first block that is newly cloned over. 392d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner FirstNewBlock = LastBlock; ++FirstNewBlock; 393a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 394d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Update the callgraph if requested. 395d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) 396d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands UpdateCallGraphAfterInlining(CS, FirstNewBlock, ValueMap, *CG); 397fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman } 398a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 399ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // If there are any alloca instructions in the block that used to be the entry 400ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // block for the callee, move them to the entry block of the caller. First 401ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // calculate which instruction they should be inserted before. We insert the 402ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // instructions at the end of the current alloca list. 403ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // 40421f20558d629f7ff8f64c20746d890d29328a544Chris Lattner { 40580a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock::iterator InsertPoint = Caller->begin()->begin(); 4065e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner for (BasicBlock::iterator I = FirstNewBlock->begin(), 407135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner E = FirstNewBlock->end(); I != E; ) { 408135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner AllocaInst *AI = dyn_cast<AllocaInst>(I++); 409135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (AI == 0) continue; 410135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 411135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // If the alloca is now dead, remove it. This often occurs due to code 412135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // specialization. 413135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (AI->use_empty()) { 414135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner AI->eraseFromParent(); 415135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 41633bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner } 417135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 418135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner if (!isa<Constant>(AI->getArraySize())) 419135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner continue; 420135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 4218f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner // Keep track of the static allocas that we inline into the caller if the 4228f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner // StaticAllocas pointer is non-null. 4238f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner if (StaticAllocas) StaticAllocas->push_back(AI); 4248f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner 425135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Scan for the block of allocas that we can move over, and move them 426135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // all at once. 427135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner while (isa<AllocaInst>(I) && 4288f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner isa<Constant>(cast<AllocaInst>(I)->getArraySize())) { 4298f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner if (StaticAllocas) StaticAllocas->push_back(cast<AllocaInst>(I)); 430135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner ++I; 4318f2718fbef6177966ff807af0732eb2431bd9a5fChris Lattner } 432135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner 433135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // Transfer all of the allocas over in a block. Using splice means 434135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // that the instructions aren't removed from the symbol table, then 435135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner // reinserted. 436135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner Caller->getEntryBlock().getInstList().splice(InsertPoint, 437135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner FirstNewBlock->getInstList(), 438135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner AI, I); 439135755dae4c3fa8003b76150689d5064aa4612eeChris Lattner } 44080a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner } 44180a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner 442bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If the inlined code contained dynamic alloca instructions, wrap the inlined 443bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // code with llvm.stacksave/llvm.stackrestore intrinsics. 444bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsDynamicAllocas) { 445bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner Module *M = Caller->getParent(); 446bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Get the two intrinsics we care about. 447a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner Constant *StackSave, *StackRestore; 4483d292aca0306fbb65da4622c80df01432ab6559bDuncan Sands StackSave = Intrinsic::getDeclaration(M, Intrinsic::stacksave); 4493d292aca0306fbb65da4622c80df01432ab6559bDuncan Sands StackRestore = Intrinsic::getDeclaration(M, Intrinsic::stackrestore); 450d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 451d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // If we are preserving the callgraph, add edges to the stacksave/restore 452d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // functions for the calls we insert. 45321ba23d0d88cff57dcdf104cd6914dabcbc68131Chris Lattner CallGraphNode *StackSaveCGN = 0, *StackRestoreCGN = 0, *CallerNode = 0; 454d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) { 455a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner // We know that StackSave/StackRestore are Function*'s, because they are 456a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner // intrinsics which must have the right types. 457a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner StackSaveCGN = CG->getOrInsertFunction(cast<Function>(StackSave)); 458a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner StackRestoreCGN = CG->getOrInsertFunction(cast<Function>(StackRestore)); 459d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CallerNode = (*CG)[Caller]; 460d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 461a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 462bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert the llvm.stacksave. 463a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands CallInst *SavedPtr = CallInst::Create(StackSave, "savedstack", 464051a950000e21935165db56695e35bade668193bGabor Greif FirstNewBlock->begin()); 465d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(SavedPtr, StackSaveCGN); 466a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 467bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert a call to llvm.stackrestore before any return instructions in the 468bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // inlined function. 469d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 470051a950000e21935165db56695e35bade668193bGabor Greif CallInst *CI = CallInst::Create(StackRestore, SavedPtr, "", Returns[i]); 471d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(CI, StackRestoreCGN); 472d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 473468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 474468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // Count the number of StackRestore calls we insert. 475468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner unsigned NumStackRestores = Returns.size(); 476a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 477bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If we are inlining an invoke instruction, insert restores before each 478bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // unwind. These unwinds will be rewritten into branches later. 479bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsUnwinds && isa<InvokeInst>(TheCall)) { 480bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 481bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner BB != E; ++BB) 482468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) { 4833d292aca0306fbb65da4622c80df01432ab6559bDuncan Sands CallInst::Create(StackRestore, SavedPtr, "", UI); 484468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner ++NumStackRestores; 485468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 486468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 487bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner } 488bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner 489a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands // If we are inlining tail call instruction through a call site that isn't 4901fdf4a859f03ce5aa4ce9acba29ce321c847388eChris Lattner // marked 'tail', we must remove the tail marker for any calls in the inlined 491f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // code. Also, calls inlined through a 'nounwind' call site should be marked 492f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // 'nounwind'. 493f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsCalls && 494f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands (MustClearTailCallFlags || MarkNoUnwind)) { 4951b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 4961b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner BB != E; ++BB) 4971b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 498f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (CallInst *CI = dyn_cast<CallInst>(I)) { 499f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MustClearTailCallFlags) 500f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setTailCall(false); 501f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MarkNoUnwind) 502f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setDoesNotThrow(); 503f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 5041b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner } 5051b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 506f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If we are inlining through a 'nounwind' call site then any inlined 'unwind' 507f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // instructions are unreachable. 508f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsUnwinds && MarkNoUnwind) 509f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 510f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB != E; ++BB) { 511f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands TerminatorInst *Term = BB->getTerminator(); 512f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (isa<UnwindInst>(Term)) { 5131d0be15f89cb5056e20e2d24faa8d6afb1573bcaOwen Anderson new UnreachableInst(Context, Term); 514f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB->getInstList().erase(Term); 515f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 516f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 517f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 5185e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // If we are inlining for an invoke instruction, we must make sure to rewrite 5195e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any inlined 'unwind' instructions into branches to the invoke exception 5205e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // destination, and call instructions into invoke instructions. 521cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 52281dfb3885252fbf621b080827a080099864415f8Chris Lattner HandleInlinedInvoke(II, FirstNewBlock, InlinedFunctionInfo); 5235e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 52444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If we cloned in _exactly one_ basic block, and if that block ends in a 52544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // return instruction, we splice the body of the inlined callee directly into 52644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the calling basic block. 52744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) { 52844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Move all of the instructions right before the call. 52944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(), 53044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock->begin(), FirstNewBlock->end()); 53144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Remove the cloned basic block. 53244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().pop_back(); 533fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 53444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the call site was an invoke instruction, add a branch to the normal 53544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // destination. 53644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 537051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(II->getNormalDest(), TheCall); 53844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 53944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the return instruction returned a value, replace uses of the call with 54044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // uses of the returned value. 541dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel if (!TheCall->use_empty()) { 542dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel ReturnInst *R = Returns[0]; 5435877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (TheCall == R->getReturnValue()) 5449e9a0d5fc26878e51a58a8b57900fcbf952c2691Owen Anderson TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType())); 5455877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman else 5465877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman TheCall->replaceAllUsesWith(R->getReturnValue()); 547dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel } 54844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the Call/Invoke, we can delete it. 5491adec83ae84031bfa9f0bf209c5ee6c64906a1ffDan Gohman TheCall->eraseFromParent(); 55044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 55144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the return instruction, delete it also. 5521adec83ae84031bfa9f0bf209c5ee6c64906a1ffDan Gohman Returns[0]->eraseFromParent(); 55344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 55444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // We are now done with the inlining. 55544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner return true; 55644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner } 55744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 55844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Otherwise, we have the normal case, of more than one block to inline or 55944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // multiple return sites. 56044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 5615e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // We want to clone the entire callee function into the hole between the 5625e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // "starter" and "ender" blocks. How we accomplish this depends on whether 5635e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // this is an invoke instruction or a call instruction. 5645e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner BasicBlock *AfterCallBB; 5655e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) { 566fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5675e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Add an unconditional branch to make this look like the CallInst case... 568051a950000e21935165db56695e35bade668193bGabor Greif BranchInst *NewBr = BranchInst::Create(II->getNormalDest(), TheCall); 569fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5705e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Split the basic block. This guarantees that no PHI nodes will have to be 5715e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // updated due to new incoming edges, and make the invoke case more 5725e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // symmetric to the call case. 5735e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(NewBr, 574284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 575fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5765e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } else { // It's a call 57744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If this is a call instruction, we need to split the basic block that 57844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the call lives in. 5795e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // 5805e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(TheCall, 581284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 5825e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 5835e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 58444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Change the branch that used to go to AfterCallBB to branch to the first 58544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // basic block of the inlined function. 58644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // 58744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner TerminatorInst *Br = OrigBB->getTerminator(); 588fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman assert(Br && Br->getOpcode() == Instruction::Br && 58944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner "splitBasicBlock broken!"); 59044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Br->setOperand(0, FirstNewBlock); 59144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 59244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 59344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Now that the function is correct, make it a little bit nicer. In 59444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // particular, move the basic blocks inserted from the end of the function 59544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // into the space made by splitting the source basic block. 59644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(), 59744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock, Caller->end()); 59844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 5995e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Handle all of the return instructions that we just cloned in, and eliminate 6005e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any users of the original call/invoke instruction. 601b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel const Type *RTy = CalledFunc->getReturnType(); 6022c31750cd0ebdc83a890ace97dbb6249b3abe44eDan Gohman 603fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman if (Returns.size() > 1) { 6045e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // The PHI node should go at the front of the new basic block to merge all 6055e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // possible incoming values. 606fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHINode *PHI = 0; 6075e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (!TheCall->use_empty()) { 608fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHI = PHINode::Create(RTy, TheCall->getName(), 609fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman AfterCallBB->begin()); 610fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman // Anything that used the result of the function call should now use the 611fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman // PHI node as their operand. 612a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands TheCall->replaceAllUsesWith(PHI); 6135e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 614fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 615c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // Loop over all of the return instructions adding entries to the PHI node 616c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // as appropriate. 617fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman if (PHI) { 618fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 619fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman ReturnInst *RI = Returns[i]; 620fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman assert(RI->getReturnValue()->getType() == PHI->getType() && 621fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman "Ret value not consistent in function!"); 622fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHI->addIncoming(RI->getReturnValue(), RI->getParent()); 6235e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 62412a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel } 625fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 626de62aeaec49ddcf4a4c61fbbb3a22d3a4dd448f0Gabor Greif // Add a branch to the merge points and remove return instructions. 62712a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 62812a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel ReturnInst *RI = Returns[i]; 6290744f09efc53d3352ac1caffc61f6e8239201c3bDale Johannesen BranchInst::Create(AfterCallBB, RI); 630b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel RI->eraseFromParent(); 6315e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 632b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel } else if (!Returns.empty()) { 633b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Otherwise, if there is exactly one return value, just replace anything 634b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // using the return value of the call with the computed value. 6355877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (!TheCall->use_empty()) { 6365877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (TheCall == Returns[0]->getReturnValue()) 6379e9a0d5fc26878e51a58a8b57900fcbf952c2691Owen Anderson TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType())); 6385877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman else 6395877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman TheCall->replaceAllUsesWith(Returns[0]->getReturnValue()); 6405877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman } 641a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 642b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Splice the code from the return block into the block that it will return 643b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // to, which contains the code that was after the call. 644b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel BasicBlock *ReturnBB = Returns[0]->getParent(); 645b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel AfterCallBB->getInstList().splice(AfterCallBB->begin(), 646b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->getInstList()); 647a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 648b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Update PHI nodes that use the ReturnBB to use the AfterCallBB. 649b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->replaceAllUsesWith(AfterCallBB); 650a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 651b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Delete the return instruction now and empty ReturnBB now. 652b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel Returns[0]->eraseFromParent(); 653b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->eraseFromParent(); 6543787e765facfad5ea62753922d940bcdd52afd57Chris Lattner } else if (!TheCall->use_empty()) { 6553787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // No returns, but something is using the return value of the call. Just 6563787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // nuke the result. 6579e9a0d5fc26878e51a58a8b57900fcbf952c2691Owen Anderson TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType())); 6585e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 659fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 6605e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Since we are now done with the Call/Invoke, we can delete it. 6613787e765facfad5ea62753922d940bcdd52afd57Chris Lattner TheCall->eraseFromParent(); 662ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 6637152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // We should always be able to fold the entry block of the function into the 6647152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // single predecessor of the block... 665cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!"); 6667152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0); 66744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 668cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Splice the code entry block into calling block, right before the 669cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // unconditional branch. 670cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().splice(Br, CalleeEntry->getInstList()); 671cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner CalleeEntry->replaceAllUsesWith(OrigBB); // Update PHI nodes 672cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 673cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Remove the unconditional branch. 674cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().erase(Br); 675cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 676cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Now we can remove the CalleeEntry block, which is now empty. 677cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner Caller->getBasicBlockList().erase(CalleeEntry); 678a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 679ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner return true; 680ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner} 681