InlineFunction.cpp revision 50dead06ffc107edb7e84857baaeeb09039c631c
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 321dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattnerbool llvm::InlineFunction(CallInst *CI, CallGraph *CG, const TargetData *TD) { 331dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattner return InlineFunction(CallSite(CI), CG, TD); 34468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 351dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattnerbool llvm::InlineFunction(InvokeInst *II, CallGraph *CG, const TargetData *TD) { 361dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattner return InlineFunction(CallSite(II), CG, TD); 37468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 3880a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner 39cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// HandleInlinedInvoke - If we inlined an invoke site, we need to convert calls 40cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// in the body of the inlined function into invokes and turn unwind 41cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// instructions into branches to the invoke unwind dest. 42cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// 43dac5c4b10b387b55c2394cd98a64f3f1394df2e8Nick Lewycky/// II is the invoke instruction being inlined. FirstNewBlock is the first 44cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// block of the inlined code (the last block is the end of the function), 45cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner/// and InlineCodeInfo is information about the code that got inlined. 46cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattnerstatic void HandleInlinedInvoke(InvokeInst *II, BasicBlock *FirstNewBlock, 4728c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel ClonedCodeInfo &InlinedCodeInfo, 4828c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel CallGraph *CG) { 49cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner BasicBlock *InvokeDest = II->getUnwindDest(); 50cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner std::vector<Value*> InvokeDestPHIValues; 51cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 52cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // If there are PHI nodes in the unwind destination block, we need to 53cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // keep track of which values came into them from this invoke, then remove 54cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // the entry for this block. 55cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner BasicBlock *InvokeBlock = II->getParent(); 56cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); isa<PHINode>(I); ++I) { 57cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner PHINode *PN = cast<PHINode>(I); 58cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // Save the value to use for this edge. 59cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner InvokeDestPHIValues.push_back(PN->getIncomingValueForBlock(InvokeBlock)); 60cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 61cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 62cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner Function *Caller = FirstNewBlock->getParent(); 63a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 64cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // The inlined code is currently at the end of the function, scan from the 65cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // start of the inlined code to its end, checking for stuff we need to 66cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // rewrite. 67727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (InlinedCodeInfo.ContainsCalls || InlinedCodeInfo.ContainsUnwinds) { 68727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 69727d1dd58793447e83ade712f0e58172f156edcfChris Lattner BB != E; ++BB) { 70727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (InlinedCodeInfo.ContainsCalls) { 71727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ){ 72727d1dd58793447e83ade712f0e58172f156edcfChris Lattner Instruction *I = BBI++; 73a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 74727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // We only need to check for function calls: inlined invoke 75727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // instructions require no special handling. 76727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (!isa<CallInst>(I)) continue; 77727d1dd58793447e83ade712f0e58172f156edcfChris Lattner CallInst *CI = cast<CallInst>(I); 78cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 79fd7b326bea39c077eea8d378156bcf09051cc4ecDuncan Sands // If this call cannot unwind, don't convert it to an invoke. 802b0e8990ab33ec2dad21286d3ce01dbb4bbe63c1Duncan Sands if (CI->doesNotThrow()) 81727d1dd58793447e83ade712f0e58172f156edcfChris Lattner continue; 82a3355ffb3d30d19d226bbb75707991c60f236e37Duncan Sands 83727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Convert this function call into an invoke instruction. 84727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // First, split the basic block. 85727d1dd58793447e83ade712f0e58172f156edcfChris Lattner BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc"); 86a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 87727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Next, create the new invoke instruction, inserting it at the end 88727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // of the old basic block. 8993e985f1b17aef62d58e3198a4604f9f6cfe8d19Chris Lattner SmallVector<Value*, 8> InvokeArgs(CI->op_begin()+1, CI->op_end()); 90727d1dd58793447e83ade712f0e58172f156edcfChris Lattner InvokeInst *II = 91051a950000e21935165db56695e35bade668193bGabor Greif InvokeInst::Create(CI->getCalledValue(), Split, InvokeDest, 92051a950000e21935165db56695e35bade668193bGabor Greif InvokeArgs.begin(), InvokeArgs.end(), 93051a950000e21935165db56695e35bade668193bGabor Greif CI->getName(), BB->getTerminator()); 94727d1dd58793447e83ade712f0e58172f156edcfChris Lattner II->setCallingConv(CI->getCallingConv()); 950598866c052147c31b808391f58434ce3dbfb838Devang Patel II->setAttributes(CI->getAttributes()); 96a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 97727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Make sure that anything using the call now uses the invoke! 98727d1dd58793447e83ade712f0e58172f156edcfChris Lattner CI->replaceAllUsesWith(II); 99a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 10028c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel // Update the callgraph. 10128c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel if (CG) { 10228c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel // We should be able to do this: 10328c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel // (*CG)[Caller]->replaceCallSite(CI, II); 10428c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel // but that fails if the old call site isn't in the call graph, 10528c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel // which, because of LLVM bug 3601, it sometimes isn't. 10628c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel CallGraphNode *CGN = (*CG)[Caller]; 10728c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel for (CallGraphNode::iterator NI = CGN->begin(), NE = CGN->end(); 10828c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel NI != NE; ++NI) { 10928c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel if (NI->first == CI) { 11028c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel NI->first = II; 11128c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel break; 11228c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel } 11328c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel } 11428c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel } 11528c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel 116727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Delete the unconditional branch inserted by splitBasicBlock 117727d1dd58793447e83ade712f0e58172f156edcfChris Lattner BB->getInstList().pop_back(); 118727d1dd58793447e83ade712f0e58172f156edcfChris Lattner Split->getInstList().pop_front(); // Delete the original call 119a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 120727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Update any PHI nodes in the exceptional block to indicate that 121727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // there is now a new entry in them. 122727d1dd58793447e83ade712f0e58172f156edcfChris Lattner unsigned i = 0; 123727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); 124727d1dd58793447e83ade712f0e58172f156edcfChris Lattner isa<PHINode>(I); ++I, ++i) { 125727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PHINode *PN = cast<PHINode>(I); 126727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PN->addIncoming(InvokeDestPHIValues[i], BB); 127727d1dd58793447e83ade712f0e58172f156edcfChris Lattner } 128a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 129727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // This basic block is now complete, start scanning the next one. 130727d1dd58793447e83ade712f0e58172f156edcfChris Lattner break; 131727d1dd58793447e83ade712f0e58172f156edcfChris Lattner } 132cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 133a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 134727d1dd58793447e83ade712f0e58172f156edcfChris Lattner if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) { 135727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // An UnwindInst requires special handling when it gets inlined into an 136727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // invoke site. Once this happens, we know that the unwind would cause 137727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // a control transfer to the invoke exception destination, so we can 138727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // transform it into a direct branch to the exception destination. 139051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(InvokeDest, UI); 140a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 141727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Delete the unwind instruction! 1421adec83ae84031bfa9f0bf209c5ee6c64906a1ffDan Gohman UI->eraseFromParent(); 143a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 144727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // Update any PHI nodes in the exceptional block to indicate that 145727d1dd58793447e83ade712f0e58172f156edcfChris Lattner // there is now a new entry in them. 146727d1dd58793447e83ade712f0e58172f156edcfChris Lattner unsigned i = 0; 147727d1dd58793447e83ade712f0e58172f156edcfChris Lattner for (BasicBlock::iterator I = InvokeDest->begin(); 148727d1dd58793447e83ade712f0e58172f156edcfChris Lattner isa<PHINode>(I); ++I, ++i) { 149727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PHINode *PN = cast<PHINode>(I); 150727d1dd58793447e83ade712f0e58172f156edcfChris Lattner PN->addIncoming(InvokeDestPHIValues[i], BB); 151727d1dd58793447e83ade712f0e58172f156edcfChris Lattner } 152cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 153cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 154cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner } 155cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 156cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // Now that everything is happy, we have one final detail. The PHI nodes in 157cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // the exception destination block still have entries due to the original 158cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // invoke instruction. Eliminate these entries (which might even delete the 159cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner // PHI node) now. 160cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner InvokeDest->removePredecessor(II->getParent()); 161cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner} 162cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 163d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// UpdateCallGraphAfterInlining - Once we have cloned code over from a callee 164d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// into the caller, update the specified callgraph to reflect the changes we 165d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner/// made. Note that it's possible that not all code was copied over, so only 166d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands/// some edges of the callgraph may remain. 167d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sandsstatic void UpdateCallGraphAfterInlining(CallSite CS, 168d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner Function::iterator FirstNewBlock, 1695e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*> &ValueMap, 170468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraph &CG) { 171d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands const Function *Caller = CS.getInstruction()->getParent()->getParent(); 172d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands const Function *Callee = CS.getCalledFunction(); 173468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraphNode *CalleeNode = CG[Callee]; 174468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner CallGraphNode *CallerNode = CG[Caller]; 175a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 176d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Since we inlined some uninlined call sites in the callee into the caller, 177468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // add edges from the caller to all of the callees of the callee. 178c478e52bf4c12691037856ee103c66946afeab6cGabor Greif CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end(); 179c478e52bf4c12691037856ee103c66946afeab6cGabor Greif 180c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // Consider the case where CalleeNode == CallerNode. 181125329891f97baedef21e4b464ba70182c3fb45eGabor Greif CallGraphNode::CalledFunctionsVector CallCache; 182c478e52bf4c12691037856ee103c66946afeab6cGabor Greif if (CalleeNode == CallerNode) { 183c478e52bf4c12691037856ee103c66946afeab6cGabor Greif CallCache.assign(I, E); 184c478e52bf4c12691037856ee103c66946afeab6cGabor Greif I = CallCache.begin(); 185c478e52bf4c12691037856ee103c66946afeab6cGabor Greif E = CallCache.end(); 186c478e52bf4c12691037856ee103c66946afeab6cGabor Greif } 187c478e52bf4c12691037856ee103c66946afeab6cGabor Greif 188c478e52bf4c12691037856ee103c66946afeab6cGabor Greif for (; I != E; ++I) { 189d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner const Instruction *OrigCall = I->first.getInstruction(); 190a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 1915e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*>::iterator VMI = ValueMap.find(OrigCall); 192981418bf1562d0b5b470ddc7d0034c9f3297b893Chris Lattner // Only copy the edge if the call was inlined! 193981418bf1562d0b5b470ddc7d0034c9f3297b893Chris Lattner if (VMI != ValueMap.end() && VMI->second) { 1941bb3a402574557cb228f8a96030776c229e282e5Chris Lattner // If the call was inlined, but then constant folded, there is no edge to 1951bb3a402574557cb228f8a96030776c229e282e5Chris Lattner // add. Check for this case. 1961bb3a402574557cb228f8a96030776c229e282e5Chris Lattner if (Instruction *NewCall = dyn_cast<Instruction>(VMI->second)) 1971bb3a402574557cb228f8a96030776c229e282e5Chris Lattner CallerNode->addCalledFunction(CallSite::get(NewCall), I->second); 198d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 199d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 20039fa32403e0b5e163f4f05566d6cde65e6c11095Dale Johannesen // Update the call graph by deleting the edge from Callee to Caller. We must 20139fa32403e0b5e163f4f05566d6cde65e6c11095Dale Johannesen // do this after the loop above in case Caller and Callee are the same. 20239fa32403e0b5e163f4f05566d6cde65e6c11095Dale Johannesen CallerNode->removeCallEdgeFor(CS); 203468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner} 204468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 205517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel/// findFnRegionEndMarker - This is a utility routine that is used by 206517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel/// InlineFunction. Return llvm.dbg.region.end intrinsic that corresponds 207517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel/// to the llvm.dbg.func.start of the function F. Otherwise return NULL. 208517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patelstatic const DbgRegionEndInst *findFnRegionEndMarker(const Function *F) { 209517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel 210517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel GlobalVariable *FnStart = NULL; 211517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel const DbgRegionEndInst *FnEnd = NULL; 212517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel for (Function::const_iterator FI = F->begin(), FE =F->end(); FI != FE; ++FI) 213517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel for (BasicBlock::const_iterator BI = FI->begin(), BE = FI->end(); BI != BE; 214517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel ++BI) { 215517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (FnStart == NULL) { 216517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (const DbgFuncStartInst *FSI = dyn_cast<DbgFuncStartInst>(BI)) { 217517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel DISubprogram SP(cast<GlobalVariable>(FSI->getSubprogram())); 218517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel assert (SP.isNull() == false && "Invalid llvm.dbg.func.start"); 219517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (SP.describes(F)) 220517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel FnStart = SP.getGV(); 221517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 222517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } else { 223517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (const DbgRegionEndInst *REI = dyn_cast<DbgRegionEndInst>(BI)) 224517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (REI->getContext() == FnStart) 225517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel FnEnd = REI; 226517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 227517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 228517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel return FnEnd; 229517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel} 230cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner 231ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// InlineFunction - This function inlines the called function into the basic 232ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// block of the caller. This returns false if it is not possible to inline this 233ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// call. The program is still in a well defined state if this occurs though. 234ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 235fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// Note that this only does one level of inlining. For example, if the 236fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman// instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now 237ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// exists in the instruction stream. Similiarly this will inline a recursive 238ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// function by one level. 239ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner// 2401dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattnerbool llvm::InlineFunction(CallSite CS, CallGraph *CG, const TargetData *TD) { 24180a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner Instruction *TheCall = CS.getInstruction(); 2420a205a459884ec745df1c529396dd921f029dafdOwen Anderson LLVMContext *Context = TheCall->getParent()->getContext(); 24380a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner assert(TheCall->getParent() && TheCall->getParent()->getParent() && 24480a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner "Instruction not in function!"); 245ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 24680a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner const Function *CalledFunc = CS.getCalledFunction(); 247ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner if (CalledFunc == 0 || // Can't inline external function or indirect 2485cbf985dcbc89fba3208e7baf8b6f488b06d3ec9Reid Spencer CalledFunc->isDeclaration() || // call, or call to a vararg function! 249ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner CalledFunc->getFunctionType()->isVarArg()) return false; 250ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 2511b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 252af9985c6b9d066cb70a0363fed699022d0ec196cChris Lattner // If the call to the callee is not a tail call, we must clear the 'tail' 2531b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner // flags on any calls that we inline. 2541b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner bool MustClearTailCallFlags = 255af9985c6b9d066cb70a0363fed699022d0ec196cChris Lattner !(isa<CallInst>(TheCall) && cast<CallInst>(TheCall)->isTailCall()); 2561b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 257f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If the call to the callee cannot throw, set the 'nounwind' flag on any 258f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // calls that we inline. 259f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands bool MarkNoUnwind = CS.doesNotThrow(); 260f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 26180a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock *OrigBB = TheCall->getParent(); 262ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner Function *Caller = OrigBB->getParent(); 263ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 2640e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // GC poses two hazards to inlining, which only occur when the callee has GC: 2650e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // 1. If the caller has no GC, then the callee's GC must be propagated to the 2660e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // caller. 2670e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen // 2. If the caller has a differing GC, it is invalid to inline. 2685eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (CalledFunc->hasGC()) { 2695eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen if (!Caller->hasGC()) 2705eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen Caller->setGC(CalledFunc->getGC()); 2715eca075b74d62c621b160aa216b4cd50829a2cc7Gordon Henriksen else if (CalledFunc->getGC() != Caller->getGC()) 2720e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen return false; 2730e13821c96937830ec817f08095c3cef1fdcac8dGordon Henriksen } 274a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 2755052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // Get an iterator to the last basic block in the function, which will have 2765052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // the new function inlined after it. 2775052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner // 2785052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner Function::iterator LastBlock = &Caller->back(); 2795052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner 2805e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Make sure to capture all of the return instructions from the cloned 2815e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // function. 2825052c911ec1be51ecb36e7f025c26412e9f1bfacChris Lattner std::vector<ReturnInst*> Returns; 283cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner ClonedCodeInfo InlinedFunctionInfo; 2840744f09efc53d3352ac1caffc61f6e8239201c3bDale Johannesen Function::iterator FirstNewBlock; 285f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 2865e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner { // Scope to destroy ValueMap after cloning. 2875e665f559419c7f58a4fd9360cd488f065505c44Chris Lattner DenseMap<const Value*, Value*> ValueMap; 2885b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner 2899614fcc640eb628cc5dfddb277ebae9f6cb61014Dan Gohman assert(CalledFunc->arg_size() == CS.arg_size() && 2905e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner "No varargs calls can be inlined!"); 291a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 292c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Calculate the vector of arguments to pass into the function cloner, which 293c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // matches up the formal to the actual argument values. 2945e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner CallSite::arg_iterator AI = CS.arg_begin(); 295c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner unsigned ArgNo = 0; 296e4d5c441e04bdc00ccf1804744af670655123b07Chris Lattner for (Function::const_arg_iterator I = CalledFunc->arg_begin(), 297c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner E = CalledFunc->arg_end(); I != E; ++I, ++AI, ++ArgNo) { 298c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *ActualArg = *AI; 299a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 300d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // When byval arguments actually inlined, we need to make the copy implied 301d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // by them explicit. However, we don't do this if the callee is readonly 302d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // or readnone, because the copy would be unneeded: the callee doesn't 303d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands // modify the struct. 3040598866c052147c31b808391f58434ce3dbfb838Devang Patel if (CalledFunc->paramHasAttr(ArgNo+1, Attribute::ByVal) && 305d82375c1c43db7f823dd4660d3495e76566699e3Duncan Sands !CalledFunc->onlyReadsMemory()) { 306c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner const Type *AggTy = cast<PointerType>(I->getType())->getElementType(); 3070a205a459884ec745df1c529396dd921f029dafdOwen Anderson const Type *VoidPtrTy = Context->getPointerTypeUnqual(Type::Int8Ty); 308a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 309c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Create the alloca. If we have TargetData, use nice alignment. 310c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner unsigned Align = 1; 311c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (TD) Align = TD->getPrefTypeAlignment(AggTy); 31250dead06ffc107edb7e84857baaeeb09039c631cOwen Anderson Value *NewAlloca = new AllocaInst(AggTy, 0, Align, 3139adc0abad3c3ed40a268ccbcee0c74cb9e1359feOwen Anderson I->getName(), 3149adc0abad3c3ed40a268ccbcee0c74cb9e1359feOwen Anderson &*Caller->begin()->begin()); 315c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Emit a memcpy. 316824b958e6fb1236e92e4d07f3acf18fca107cdc0Chris Lattner const Type *Tys[] = { Type::Int64Ty }; 317c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Function *MemCpyFn = Intrinsic::getDeclaration(Caller->getParent(), 318824b958e6fb1236e92e4d07f3acf18fca107cdc0Chris Lattner Intrinsic::memcpy, 319824b958e6fb1236e92e4d07f3acf18fca107cdc0Chris Lattner Tys, 1); 320c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *DestCast = new BitCastInst(NewAlloca, VoidPtrTy, "tmp", TheCall); 321c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *SrcCast = new BitCastInst(*AI, VoidPtrTy, "tmp", TheCall); 322a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 323c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *Size; 324c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (TD == 0) 3250a205a459884ec745df1c529396dd921f029dafdOwen Anderson Size = Context->getConstantExprSizeOf(AggTy); 326c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner else 3270a205a459884ec745df1c529396dd921f029dafdOwen Anderson Size = Context->getConstantInt(Type::Int64Ty, 3280a205a459884ec745df1c529396dd921f029dafdOwen Anderson TD->getTypeStoreSize(AggTy)); 329a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 330c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Always generate a memcpy of alignment 1 here because we don't know 331c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // the alignment of the src pointer. Other optimizations can infer 332c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // better alignment. 333c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner Value *CallArgs[] = { 3340a205a459884ec745df1c529396dd921f029dafdOwen Anderson DestCast, SrcCast, Size, Context->getConstantInt(Type::Int32Ty, 1) 335c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner }; 336c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallInst *TheMemCpy = 337051a950000e21935165db56695e35bade668193bGabor Greif CallInst::Create(MemCpyFn, CallArgs, CallArgs+4, "", TheCall); 338a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 339c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // If we have a call graph, update it. 340c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner if (CG) { 341c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallGraphNode *MemCpyCGN = CG->getOrInsertFunction(MemCpyFn); 342c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallGraphNode *CallerNode = (*CG)[Caller]; 343c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner CallerNode->addCalledFunction(TheMemCpy, MemCpyCGN); 344c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 345a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 346c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // Uses of the argument in the function should use our new alloca 347c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner // instead. 348c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner ActualArg = NewAlloca; 349c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 350a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 351c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner ValueMap[I] = ActualArg; 352c93adca35856d0eaae088e52ba30cfefbd7ad910Chris Lattner } 353fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 354517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // Adjust llvm.dbg.region.end. If the CalledFunc has region end 355517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // marker then clone that marker after next stop point at the 356517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // call site. The function body cloner does not clone original 357517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // region end marker from the CalledFunc. This will ensure that 358517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel // inlined function's scope ends at the right place. 359517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel const DbgRegionEndInst *DREI = findFnRegionEndMarker(CalledFunc); 360517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (DREI) { 361517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel for (BasicBlock::iterator BI = TheCall, 362517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel BE = TheCall->getParent()->end(); BI != BE; ++BI) { 363517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (DbgStopPointInst *DSPI = dyn_cast<DbgStopPointInst>(BI)) { 364517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel if (DbgRegionEndInst *NewDREI = 365333c40096561218bc3597cf153c0a3895274414cOwen Anderson dyn_cast<DbgRegionEndInst>(DREI->clone(*Context))) 366517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel NewDREI->insertAfter(DSPI); 367517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel break; 368517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 369517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 370517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel } 371517576d6f96a0acde9bab79553d89f4ceba20cf6Devang Patel 3725b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // We want the inliner to prune the code as it copies. We would LOVE to 3735b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // have no dead or constant instructions leftover after inlining occurs 3745b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // (which can happen, e.g., because an argument was constant), but we'll be 3755b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner // happy with whatever the cloner can do. 3765b5bc3032f97cfa7bfa3e22282d3a9c1ed05eec6Chris Lattner CloneAndPruneFunctionInto(Caller, CalledFunc, ValueMap, Returns, ".i", 3771dfdf8255e803d6376f5fe94a113f892e796ae6cChris Lattner &InlinedFunctionInfo, TD); 378a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 379d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Remember the first block that is newly cloned over. 380d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner FirstNewBlock = LastBlock; ++FirstNewBlock; 381a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 382d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // Update the callgraph if requested. 383d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) 384d7b9851c4e634ed3599b1a4c70b1c76c90a11686Duncan Sands UpdateCallGraphAfterInlining(CS, FirstNewBlock, ValueMap, *CG); 385fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman } 386a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 387ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // If there are any alloca instructions in the block that used to be the entry 388ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // block for the callee, move them to the entry block of the caller. First 389ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // calculate which instruction they should be inserted before. We insert the 390ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // instructions at the end of the current alloca list. 391ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner // 39221f20558d629f7ff8f64c20746d890d29328a544Chris Lattner { 39380a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner BasicBlock::iterator InsertPoint = Caller->begin()->begin(); 3945e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner for (BasicBlock::iterator I = FirstNewBlock->begin(), 3955e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner E = FirstNewBlock->end(); I != E; ) 39633bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner if (AllocaInst *AI = dyn_cast<AllocaInst>(I++)) { 39733bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner // If the alloca is now dead, remove it. This often occurs due to code 39833bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner // specialization. 39933bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner if (AI->use_empty()) { 40033bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner AI->eraseFromParent(); 40133bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner continue; 40233bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner } 403a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 404f775f95369ba7d88a5cb8b6f1900241699d79351Chris Lattner if (isa<Constant>(AI->getArraySize())) { 40521f20558d629f7ff8f64c20746d890d29328a544Chris Lattner // Scan for the block of allocas that we can move over, and move them 40621f20558d629f7ff8f64c20746d890d29328a544Chris Lattner // all at once. 407c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner while (isa<AllocaInst>(I) && 408c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner isa<Constant>(cast<AllocaInst>(I)->getArraySize())) 409c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner ++I; 410c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner 411c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner // Transfer all of the allocas over in a block. Using splice means 412e26bff22dbcfec2074a7502dd56683fc7f55912aDan Gohman // that the instructions aren't removed from the symbol table, then 413c1df7e1799a7a97602bdedec818f7ab1dc514b4eChris Lattner // reinserted. 414ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman Caller->getEntryBlock().getInstList().splice( 415ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman InsertPoint, 416ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman FirstNewBlock->getInstList(), 417ecb7a77885b174cf4d001a9b48533b3979e7810dDan Gohman AI, I); 418f775f95369ba7d88a5cb8b6f1900241699d79351Chris Lattner } 41933bb3c8be355d179ece8e751f6e0f0978d0dd038Chris Lattner } 42080a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner } 42180a38d245359cb0a3be8f78f5d7d911232886b9aChris Lattner 422bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If the inlined code contained dynamic alloca instructions, wrap the inlined 423bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // code with llvm.stacksave/llvm.stackrestore intrinsics. 424bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsDynamicAllocas) { 425bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner Module *M = Caller->getParent(); 426bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Get the two intrinsics we care about. 427a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner Constant *StackSave, *StackRestore; 4283d292aca0306fbb65da4622c80df01432ab6559bDuncan Sands StackSave = Intrinsic::getDeclaration(M, Intrinsic::stacksave); 4293d292aca0306fbb65da4622c80df01432ab6559bDuncan Sands StackRestore = Intrinsic::getDeclaration(M, Intrinsic::stackrestore); 430d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner 431d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // If we are preserving the callgraph, add edges to the stacksave/restore 432d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner // functions for the calls we insert. 43321ba23d0d88cff57dcdf104cd6914dabcbc68131Chris Lattner CallGraphNode *StackSaveCGN = 0, *StackRestoreCGN = 0, *CallerNode = 0; 434d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) { 435a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner // We know that StackSave/StackRestore are Function*'s, because they are 436a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner // intrinsics which must have the right types. 437a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner StackSaveCGN = CG->getOrInsertFunction(cast<Function>(StackSave)); 438a121fddf3c34938d866ac4bb67247a479dedcd1bChris Lattner StackRestoreCGN = CG->getOrInsertFunction(cast<Function>(StackRestore)); 439d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner CallerNode = (*CG)[Caller]; 440d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 441a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 442bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert the llvm.stacksave. 443a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands CallInst *SavedPtr = CallInst::Create(StackSave, "savedstack", 444051a950000e21935165db56695e35bade668193bGabor Greif FirstNewBlock->begin()); 445d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(SavedPtr, StackSaveCGN); 446a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 447bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // Insert a call to llvm.stackrestore before any return instructions in the 448bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // inlined function. 449d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 450051a950000e21935165db56695e35bade668193bGabor Greif CallInst *CI = CallInst::Create(StackRestore, SavedPtr, "", Returns[i]); 451d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner if (CG) CallerNode->addCalledFunction(CI, StackRestoreCGN); 452d85340f4ec587e22b0239617f3b747a6df113894Chris Lattner } 453468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner 454468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner // Count the number of StackRestore calls we insert. 455468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner unsigned NumStackRestores = Returns.size(); 456a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 457bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // If we are inlining an invoke instruction, insert restores before each 458bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner // unwind. These unwinds will be rewritten into branches later. 459bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner if (InlinedFunctionInfo.ContainsUnwinds && isa<InvokeInst>(TheCall)) { 460bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 461bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner BB != E; ++BB) 462468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner if (UnwindInst *UI = dyn_cast<UnwindInst>(BB->getTerminator())) { 4633d292aca0306fbb65da4622c80df01432ab6559bDuncan Sands CallInst::Create(StackRestore, SavedPtr, "", UI); 464468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner ++NumStackRestores; 465468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 466468fb1df7db466e5682ee44341c3990b599e8d6aChris Lattner } 467bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner } 468bf229f488a7541abd979cc3fbe9c3ce1c100e5c0Chris Lattner 469a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands // If we are inlining tail call instruction through a call site that isn't 4701fdf4a859f03ce5aa4ce9acba29ce321c847388eChris Lattner // marked 'tail', we must remove the tail marker for any calls in the inlined 471f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // code. Also, calls inlined through a 'nounwind' call site should be marked 472f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // 'nounwind'. 473f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsCalls && 474f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands (MustClearTailCallFlags || MarkNoUnwind)) { 4751b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 4761b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner BB != E; ++BB) 4771b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) 478f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (CallInst *CI = dyn_cast<CallInst>(I)) { 479f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MustClearTailCallFlags) 480f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setTailCall(false); 481f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (MarkNoUnwind) 482f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands CI->setDoesNotThrow(); 483f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 4841b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner } 4851b49141821e98e4321bfe6234c7001c836b2a289Chris Lattner 486f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // If we are inlining through a 'nounwind' call site then any inlined 'unwind' 487f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands // instructions are unreachable. 488f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (InlinedFunctionInfo.ContainsUnwinds && MarkNoUnwind) 489f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands for (Function::iterator BB = FirstNewBlock, E = Caller->end(); 490f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB != E; ++BB) { 491f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands TerminatorInst *Term = BB->getTerminator(); 492f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands if (isa<UnwindInst>(Term)) { 493f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands new UnreachableInst(Term); 494f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands BB->getInstList().erase(Term); 495f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 496f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands } 497f0c3354d998507515ab39e26b5292ea0ceb06aefDuncan Sands 4985e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // If we are inlining for an invoke instruction, we must make sure to rewrite 4995e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any inlined 'unwind' instructions into branches to the invoke exception 5005e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // destination, and call instructions into invoke instructions. 501cd4d339ec187182c9abc22b80560349f8ba5010fChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 50228c531cdbb403c59f492d3361ec9e8581f2a7ab2Devang Patel HandleInlinedInvoke(II, FirstNewBlock, InlinedFunctionInfo, CG); 5035e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 50444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If we cloned in _exactly one_ basic block, and if that block ends in a 50544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // return instruction, we splice the body of the inlined callee directly into 50644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the calling basic block. 50744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) { 50844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Move all of the instructions right before the call. 50944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(), 51044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock->begin(), FirstNewBlock->end()); 51144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Remove the cloned basic block. 51244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().pop_back(); 513fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 51444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the call site was an invoke instruction, add a branch to the normal 51544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // destination. 51644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) 517051a950000e21935165db56695e35bade668193bGabor Greif BranchInst::Create(II->getNormalDest(), TheCall); 51844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 51944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If the return instruction returned a value, replace uses of the call with 52044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // uses of the returned value. 521dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel if (!TheCall->use_empty()) { 522dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel ReturnInst *R = Returns[0]; 5235877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (TheCall == R->getReturnValue()) 5240a205a459884ec745df1c529396dd921f029dafdOwen Anderson TheCall->replaceAllUsesWith(Context->getUndef(TheCall->getType())); 5255877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman else 5265877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman TheCall->replaceAllUsesWith(R->getReturnValue()); 527dc00d42bb18a6748f43c365d9bd30c1ed0e800acDevang Patel } 52844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the Call/Invoke, we can delete it. 5291adec83ae84031bfa9f0bf209c5ee6c64906a1ffDan Gohman TheCall->eraseFromParent(); 53044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 53144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Since we are now done with the return instruction, delete it also. 5321adec83ae84031bfa9f0bf209c5ee6c64906a1ffDan Gohman Returns[0]->eraseFromParent(); 53344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 53444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // We are now done with the inlining. 53544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner return true; 53644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner } 53744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 53844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Otherwise, we have the normal case, of more than one block to inline or 53944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // multiple return sites. 54044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 5415e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // We want to clone the entire callee function into the hole between the 5425e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // "starter" and "ender" blocks. How we accomplish this depends on whether 5435e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // this is an invoke instruction or a call instruction. 5445e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner BasicBlock *AfterCallBB; 5455e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) { 546fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5475e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Add an unconditional branch to make this look like the CallInst case... 548051a950000e21935165db56695e35bade668193bGabor Greif BranchInst *NewBr = BranchInst::Create(II->getNormalDest(), TheCall); 549fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5505e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Split the basic block. This guarantees that no PHI nodes will have to be 5515e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // updated due to new incoming edges, and make the invoke case more 5525e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // symmetric to the call case. 5535e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(NewBr, 554284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 555fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 5565e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } else { // It's a call 55744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // If this is a call instruction, we need to split the basic block that 55844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // the call lives in. 5595e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // 5605e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner AfterCallBB = OrigBB->splitBasicBlock(TheCall, 561284d1b88273eb1967c8faef407f1167791c760e0Chris Lattner CalledFunc->getName()+".exit"); 5625e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 5635e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner 56444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Change the branch that used to go to AfterCallBB to branch to the first 56544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // basic block of the inlined function. 56644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // 56744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner TerminatorInst *Br = OrigBB->getTerminator(); 568fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman assert(Br && Br->getOpcode() == Instruction::Br && 56944a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner "splitBasicBlock broken!"); 57044a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Br->setOperand(0, FirstNewBlock); 57144a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 57244a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 57344a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // Now that the function is correct, make it a little bit nicer. In 57444a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // particular, move the basic blocks inserted from the end of the function 57544a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner // into the space made by splitting the source basic block. 57644a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(), 57744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner FirstNewBlock, Caller->end()); 57844a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 5795e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Handle all of the return instructions that we just cloned in, and eliminate 5805e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // any users of the original call/invoke instruction. 581b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel const Type *RTy = CalledFunc->getReturnType(); 5822c31750cd0ebdc83a890ace97dbb6249b3abe44eDan Gohman 583fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman if (Returns.size() > 1) { 5845e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // The PHI node should go at the front of the new basic block to merge all 5855e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // possible incoming values. 586fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHINode *PHI = 0; 5875e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner if (!TheCall->use_empty()) { 588fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHI = PHINode::Create(RTy, TheCall->getName(), 589fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman AfterCallBB->begin()); 590fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman // Anything that used the result of the function call should now use the 591fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman // PHI node as their operand. 592a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands TheCall->replaceAllUsesWith(PHI); 5935e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 594fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 595c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // Loop over all of the return instructions adding entries to the PHI node 596c478e52bf4c12691037856ee103c66946afeab6cGabor Greif // as appropriate. 597fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman if (PHI) { 598fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 599fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman ReturnInst *RI = Returns[i]; 600fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman assert(RI->getReturnValue()->getType() == PHI->getType() && 601fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman "Ret value not consistent in function!"); 602fc74abfba5128544a750fce22fdf13eb0403e3ceDan Gohman PHI->addIncoming(RI->getReturnValue(), RI->getParent()); 6035e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 60412a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel } 605fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 606de62aeaec49ddcf4a4c61fbbb3a22d3a4dd448f0Gabor Greif // Add a branch to the merge points and remove return instructions. 60712a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel for (unsigned i = 0, e = Returns.size(); i != e; ++i) { 60812a466b9d0e27be453cfa05cff18acc9d7c1cfbaDevang Patel ReturnInst *RI = Returns[i]; 6090744f09efc53d3352ac1caffc61f6e8239201c3bDale Johannesen BranchInst::Create(AfterCallBB, RI); 610b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel RI->eraseFromParent(); 6115e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 612b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel } else if (!Returns.empty()) { 613b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Otherwise, if there is exactly one return value, just replace anything 614b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // using the return value of the call with the computed value. 6155877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (!TheCall->use_empty()) { 6165877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman if (TheCall == Returns[0]->getReturnValue()) 6170a205a459884ec745df1c529396dd921f029dafdOwen Anderson TheCall->replaceAllUsesWith(Context->getUndef(TheCall->getType())); 6185877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman else 6195877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman TheCall->replaceAllUsesWith(Returns[0]->getReturnValue()); 6205877ad7e90de2179c15914ff9e8f1c72152cac30Eli Friedman } 621a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 622b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Splice the code from the return block into the block that it will return 623b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // to, which contains the code that was after the call. 624b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel BasicBlock *ReturnBB = Returns[0]->getParent(); 625b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel AfterCallBB->getInstList().splice(AfterCallBB->begin(), 626b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->getInstList()); 627a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 628b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Update PHI nodes that use the ReturnBB to use the AfterCallBB. 629b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->replaceAllUsesWith(AfterCallBB); 630a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 631b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel // Delete the return instruction now and empty ReturnBB now. 632b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel Returns[0]->eraseFromParent(); 633b8f198af1b62f2ed48dcb914973a9d211dcba38bDevang Patel ReturnBB->eraseFromParent(); 6343787e765facfad5ea62753922d940bcdd52afd57Chris Lattner } else if (!TheCall->use_empty()) { 6353787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // No returns, but something is using the return value of the call. Just 6363787e765facfad5ea62753922d940bcdd52afd57Chris Lattner // nuke the result. 6370a205a459884ec745df1c529396dd921f029dafdOwen Anderson TheCall->replaceAllUsesWith(Context->getUndef(TheCall->getType())); 6385e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner } 639fd93908ae8b9684fe71c239e3c6cfe13ff6a2663Misha Brukman 6405e923dee6024248f58fa83a7c7299437f44f0d1aChris Lattner // Since we are now done with the Call/Invoke, we can delete it. 6413787e765facfad5ea62753922d940bcdd52afd57Chris Lattner TheCall->eraseFromParent(); 642ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner 6437152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // We should always be able to fold the entry block of the function into the 6447152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner // single predecessor of the block... 645cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!"); 6467152c237b46a920b29d5605af934766b8f9a07a1Chris Lattner BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0); 64744a6807f4f785ecdd96b3aa67dad056677131b98Chris Lattner 648cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Splice the code entry block into calling block, right before the 649cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // unconditional branch. 650cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().splice(Br, CalleeEntry->getInstList()); 651cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner CalleeEntry->replaceAllUsesWith(OrigBB); // Update PHI nodes 652cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 653cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Remove the unconditional branch. 654cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner OrigBB->getInstList().erase(Br); 655cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner 656cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner // Now we can remove the CalleeEntry block, which is now empty. 657cd01ae5c7071fb99a665b2bbea7428d769792ab8Chris Lattner Caller->getBasicBlockList().erase(CalleeEntry); 658a7212e58260f6d1ead0c4eec7af400cf6c0d289eDuncan Sands 659ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner return true; 660ca398dc3989d35e8516489fd163e012133bd41cbChris Lattner} 661