1 //===- InlineFunction.cpp - Code to perform function inlining -------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements inlining of a function into a call site, resolving
11 // parameters and the return value as appropriate.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/Transforms/Utils/Cloning.h"
16 #include "llvm/ADT/SmallVector.h"
17 #include "llvm/ADT/StringExtras.h"
18 #include "llvm/Analysis/CallGraph.h"
19 #include "llvm/Analysis/InstructionSimplify.h"
20 #include "llvm/IR/Attributes.h"
21 #include "llvm/IR/CallSite.h"
22 #include "llvm/IR/Constants.h"
23 #include "llvm/IR/DataLayout.h"
24 #include "llvm/IR/DebugInfo.h"
25 #include "llvm/IR/DerivedTypes.h"
26 #include "llvm/IR/IRBuilder.h"
27 #include "llvm/IR/Instructions.h"
28 #include "llvm/IR/IntrinsicInst.h"
29 #include "llvm/IR/Intrinsics.h"
30 #include "llvm/IR/Module.h"
31 #include "llvm/Transforms/Utils/Local.h"
34 bool llvm::InlineFunction(CallInst *CI, InlineFunctionInfo &IFI,
35 bool InsertLifetime) {
36 return InlineFunction(CallSite(CI), IFI, InsertLifetime);
38 bool llvm::InlineFunction(InvokeInst *II, InlineFunctionInfo &IFI,
39 bool InsertLifetime) {
40 return InlineFunction(CallSite(II), IFI, InsertLifetime);
44 /// A class for recording information about inlining through an invoke.
45 class InvokeInliningInfo {
46 BasicBlock *OuterResumeDest; ///< Destination of the invoke's unwind.
47 BasicBlock *InnerResumeDest; ///< Destination for the callee's resume.
48 LandingPadInst *CallerLPad; ///< LandingPadInst associated with the invoke.
49 PHINode *InnerEHValuesPHI; ///< PHI for EH values from landingpad insts.
50 SmallVector<Value*, 8> UnwindDestPHIValues;
53 InvokeInliningInfo(InvokeInst *II)
54 : OuterResumeDest(II->getUnwindDest()), InnerResumeDest(nullptr),
55 CallerLPad(nullptr), InnerEHValuesPHI(nullptr) {
56 // If there are PHI nodes in the unwind destination block, we need to keep
57 // track of which values came into them from the invoke before removing
58 // the edge from this block.
59 llvm::BasicBlock *InvokeBB = II->getParent();
60 BasicBlock::iterator I = OuterResumeDest->begin();
61 for (; isa<PHINode>(I); ++I) {
62 // Save the value to use for this edge.
63 PHINode *PHI = cast<PHINode>(I);
64 UnwindDestPHIValues.push_back(PHI->getIncomingValueForBlock(InvokeBB));
67 CallerLPad = cast<LandingPadInst>(I);
70 /// getOuterResumeDest - The outer unwind destination is the target of
71 /// unwind edges introduced for calls within the inlined function.
72 BasicBlock *getOuterResumeDest() const {
73 return OuterResumeDest;
76 BasicBlock *getInnerResumeDest();
78 LandingPadInst *getLandingPadInst() const { return CallerLPad; }
80 /// forwardResume - Forward the 'resume' instruction to the caller's landing
81 /// pad block. When the landing pad block has only one predecessor, this is
82 /// a simple branch. When there is more than one predecessor, we need to
83 /// split the landing pad block after the landingpad instruction and jump
85 void forwardResume(ResumeInst *RI,
86 SmallPtrSet<LandingPadInst*, 16> &InlinedLPads);
88 /// addIncomingPHIValuesFor - Add incoming-PHI values to the unwind
89 /// destination block for the given basic block, using the values for the
90 /// original invoke's source block.
91 void addIncomingPHIValuesFor(BasicBlock *BB) const {
92 addIncomingPHIValuesForInto(BB, OuterResumeDest);
95 void addIncomingPHIValuesForInto(BasicBlock *src, BasicBlock *dest) const {
96 BasicBlock::iterator I = dest->begin();
97 for (unsigned i = 0, e = UnwindDestPHIValues.size(); i != e; ++i, ++I) {
98 PHINode *phi = cast<PHINode>(I);
99 phi->addIncoming(UnwindDestPHIValues[i], src);
105 /// getInnerResumeDest - Get or create a target for the branch from ResumeInsts.
106 BasicBlock *InvokeInliningInfo::getInnerResumeDest() {
107 if (InnerResumeDest) return InnerResumeDest;
109 // Split the landing pad.
110 BasicBlock::iterator SplitPoint = CallerLPad; ++SplitPoint;
112 OuterResumeDest->splitBasicBlock(SplitPoint,
113 OuterResumeDest->getName() + ".body");
115 // The number of incoming edges we expect to the inner landing pad.
116 const unsigned PHICapacity = 2;
118 // Create corresponding new PHIs for all the PHIs in the outer landing pad.
119 BasicBlock::iterator InsertPoint = InnerResumeDest->begin();
120 BasicBlock::iterator I = OuterResumeDest->begin();
121 for (unsigned i = 0, e = UnwindDestPHIValues.size(); i != e; ++i, ++I) {
122 PHINode *OuterPHI = cast<PHINode>(I);
123 PHINode *InnerPHI = PHINode::Create(OuterPHI->getType(), PHICapacity,
124 OuterPHI->getName() + ".lpad-body",
126 OuterPHI->replaceAllUsesWith(InnerPHI);
127 InnerPHI->addIncoming(OuterPHI, OuterResumeDest);
130 // Create a PHI for the exception values.
131 InnerEHValuesPHI = PHINode::Create(CallerLPad->getType(), PHICapacity,
132 "eh.lpad-body", InsertPoint);
133 CallerLPad->replaceAllUsesWith(InnerEHValuesPHI);
134 InnerEHValuesPHI->addIncoming(CallerLPad, OuterResumeDest);
137 return InnerResumeDest;
140 /// forwardResume - Forward the 'resume' instruction to the caller's landing pad
141 /// block. When the landing pad block has only one predecessor, this is a simple
142 /// branch. When there is more than one predecessor, we need to split the
143 /// landing pad block after the landingpad instruction and jump to there.
144 void InvokeInliningInfo::forwardResume(ResumeInst *RI,
145 SmallPtrSet<LandingPadInst*, 16> &InlinedLPads) {
146 BasicBlock *Dest = getInnerResumeDest();
147 BasicBlock *Src = RI->getParent();
149 BranchInst::Create(Dest, Src);
151 // Update the PHIs in the destination. They were inserted in an order which
153 addIncomingPHIValuesForInto(Src, Dest);
155 InnerEHValuesPHI->addIncoming(RI->getOperand(0), Src);
156 RI->eraseFromParent();
159 /// HandleCallsInBlockInlinedThroughInvoke - When we inline a basic block into
160 /// an invoke, we have to turn all of the calls that can throw into
161 /// invokes. This function analyze BB to see if there are any calls, and if so,
162 /// it rewrites them to be invokes that jump to InvokeDest and fills in the PHI
163 /// nodes in that block with the values specified in InvokeDestPHIValues.
164 static void HandleCallsInBlockInlinedThroughInvoke(BasicBlock *BB,
165 InvokeInliningInfo &Invoke) {
166 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
167 Instruction *I = BBI++;
169 // We only need to check for function calls: inlined invoke
170 // instructions require no special handling.
171 CallInst *CI = dyn_cast<CallInst>(I);
173 // If this call cannot unwind, don't convert it to an invoke.
174 // Inline asm calls cannot throw.
175 if (!CI || CI->doesNotThrow() || isa<InlineAsm>(CI->getCalledValue()))
178 // Convert this function call into an invoke instruction. First, split the
180 BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc");
182 // Delete the unconditional branch inserted by splitBasicBlock
183 BB->getInstList().pop_back();
185 // Create the new invoke instruction.
186 ImmutableCallSite CS(CI);
187 SmallVector<Value*, 8> InvokeArgs(CS.arg_begin(), CS.arg_end());
188 InvokeInst *II = InvokeInst::Create(CI->getCalledValue(), Split,
189 Invoke.getOuterResumeDest(),
190 InvokeArgs, CI->getName(), BB);
191 II->setCallingConv(CI->getCallingConv());
192 II->setAttributes(CI->getAttributes());
194 // Make sure that anything using the call now uses the invoke! This also
195 // updates the CallGraph if present, because it uses a WeakVH.
196 CI->replaceAllUsesWith(II);
198 // Delete the original call
199 Split->getInstList().pop_front();
201 // Update any PHI nodes in the exceptional block to indicate that there is
202 // now a new entry in them.
203 Invoke.addIncomingPHIValuesFor(BB);
208 /// HandleInlinedInvoke - If we inlined an invoke site, we need to convert calls
209 /// in the body of the inlined function into invokes.
211 /// II is the invoke instruction being inlined. FirstNewBlock is the first
212 /// block of the inlined code (the last block is the end of the function),
213 /// and InlineCodeInfo is information about the code that got inlined.
214 static void HandleInlinedInvoke(InvokeInst *II, BasicBlock *FirstNewBlock,
215 ClonedCodeInfo &InlinedCodeInfo) {
216 BasicBlock *InvokeDest = II->getUnwindDest();
218 Function *Caller = FirstNewBlock->getParent();
220 // The inlined code is currently at the end of the function, scan from the
221 // start of the inlined code to its end, checking for stuff we need to
223 InvokeInliningInfo Invoke(II);
225 // Get all of the inlined landing pad instructions.
226 SmallPtrSet<LandingPadInst*, 16> InlinedLPads;
227 for (Function::iterator I = FirstNewBlock, E = Caller->end(); I != E; ++I)
228 if (InvokeInst *II = dyn_cast<InvokeInst>(I->getTerminator()))
229 InlinedLPads.insert(II->getLandingPadInst());
231 // Append the clauses from the outer landing pad instruction into the inlined
232 // landing pad instructions.
233 LandingPadInst *OuterLPad = Invoke.getLandingPadInst();
234 for (SmallPtrSet<LandingPadInst*, 16>::iterator I = InlinedLPads.begin(),
235 E = InlinedLPads.end(); I != E; ++I) {
236 LandingPadInst *InlinedLPad = *I;
237 unsigned OuterNum = OuterLPad->getNumClauses();
238 InlinedLPad->reserveClauses(OuterNum);
239 for (unsigned OuterIdx = 0; OuterIdx != OuterNum; ++OuterIdx)
240 InlinedLPad->addClause(OuterLPad->getClause(OuterIdx));
241 if (OuterLPad->isCleanup())
242 InlinedLPad->setCleanup(true);
245 for (Function::iterator BB = FirstNewBlock, E = Caller->end(); BB != E; ++BB){
246 if (InlinedCodeInfo.ContainsCalls)
247 HandleCallsInBlockInlinedThroughInvoke(BB, Invoke);
249 // Forward any resumes that are remaining here.
250 if (ResumeInst *RI = dyn_cast<ResumeInst>(BB->getTerminator()))
251 Invoke.forwardResume(RI, InlinedLPads);
254 // Now that everything is happy, we have one final detail. The PHI nodes in
255 // the exception destination block still have entries due to the original
256 // invoke instruction. Eliminate these entries (which might even delete the
258 InvokeDest->removePredecessor(II->getParent());
261 /// UpdateCallGraphAfterInlining - Once we have cloned code over from a callee
262 /// into the caller, update the specified callgraph to reflect the changes we
263 /// made. Note that it's possible that not all code was copied over, so only
264 /// some edges of the callgraph may remain.
265 static void UpdateCallGraphAfterInlining(CallSite CS,
266 Function::iterator FirstNewBlock,
267 ValueToValueMapTy &VMap,
268 InlineFunctionInfo &IFI) {
269 CallGraph &CG = *IFI.CG;
270 const Function *Caller = CS.getInstruction()->getParent()->getParent();
271 const Function *Callee = CS.getCalledFunction();
272 CallGraphNode *CalleeNode = CG[Callee];
273 CallGraphNode *CallerNode = CG[Caller];
275 // Since we inlined some uninlined call sites in the callee into the caller,
276 // add edges from the caller to all of the callees of the callee.
277 CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end();
279 // Consider the case where CalleeNode == CallerNode.
280 CallGraphNode::CalledFunctionsVector CallCache;
281 if (CalleeNode == CallerNode) {
282 CallCache.assign(I, E);
283 I = CallCache.begin();
287 for (; I != E; ++I) {
288 const Value *OrigCall = I->first;
290 ValueToValueMapTy::iterator VMI = VMap.find(OrigCall);
291 // Only copy the edge if the call was inlined!
292 if (VMI == VMap.end() || VMI->second == nullptr)
295 // If the call was inlined, but then constant folded, there is no edge to
296 // add. Check for this case.
297 Instruction *NewCall = dyn_cast<Instruction>(VMI->second);
298 if (!NewCall) continue;
300 // Remember that this call site got inlined for the client of
302 IFI.InlinedCalls.push_back(NewCall);
304 // It's possible that inlining the callsite will cause it to go from an
305 // indirect to a direct call by resolving a function pointer. If this
306 // happens, set the callee of the new call site to a more precise
307 // destination. This can also happen if the call graph node of the caller
308 // was just unnecessarily imprecise.
309 if (!I->second->getFunction())
310 if (Function *F = CallSite(NewCall).getCalledFunction()) {
311 // Indirect call site resolved to direct call.
312 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]);
317 CallerNode->addCalledFunction(CallSite(NewCall), I->second);
320 // Update the call graph by deleting the edge from Callee to Caller. We must
321 // do this after the loop above in case Caller and Callee are the same.
322 CallerNode->removeCallEdgeFor(CS);
325 static void HandleByValArgumentInit(Value *Dst, Value *Src, Module *M,
326 BasicBlock *InsertBlock,
327 InlineFunctionInfo &IFI) {
328 LLVMContext &Context = Src->getContext();
329 Type *VoidPtrTy = Type::getInt8PtrTy(Context);
330 Type *AggTy = cast<PointerType>(Src->getType())->getElementType();
331 Type *Tys[3] = { VoidPtrTy, VoidPtrTy, Type::getInt64Ty(Context) };
332 Function *MemCpyFn = Intrinsic::getDeclaration(M, Intrinsic::memcpy, Tys);
333 IRBuilder<> builder(InsertBlock->begin());
334 Value *DstCast = builder.CreateBitCast(Dst, VoidPtrTy, "tmp");
335 Value *SrcCast = builder.CreateBitCast(Src, VoidPtrTy, "tmp");
338 if (IFI.DL == nullptr)
339 Size = ConstantExpr::getSizeOf(AggTy);
341 Size = ConstantInt::get(Type::getInt64Ty(Context),
342 IFI.DL->getTypeStoreSize(AggTy));
344 // Always generate a memcpy of alignment 1 here because we don't know
345 // the alignment of the src pointer. Other optimizations can infer
347 Value *CallArgs[] = {
348 DstCast, SrcCast, Size,
349 ConstantInt::get(Type::getInt32Ty(Context), 1),
350 ConstantInt::getFalse(Context) // isVolatile
352 builder.CreateCall(MemCpyFn, CallArgs);
355 /// HandleByValArgument - When inlining a call site that has a byval argument,
356 /// we have to make the implicit memcpy explicit by adding it.
357 static Value *HandleByValArgument(Value *Arg, Instruction *TheCall,
358 const Function *CalledFunc,
359 InlineFunctionInfo &IFI,
360 unsigned ByValAlignment) {
361 PointerType *ArgTy = cast<PointerType>(Arg->getType());
362 Type *AggTy = ArgTy->getElementType();
364 // If the called function is readonly, then it could not mutate the caller's
365 // copy of the byval'd memory. In this case, it is safe to elide the copy and
367 if (CalledFunc->onlyReadsMemory()) {
368 // If the byval argument has a specified alignment that is greater than the
369 // passed in pointer, then we either have to round up the input pointer or
370 // give up on this transformation.
371 if (ByValAlignment <= 1) // 0 = unspecified, 1 = no particular alignment.
374 // If the pointer is already known to be sufficiently aligned, or if we can
375 // round it up to a larger alignment, then we don't need a temporary.
376 if (getOrEnforceKnownAlignment(Arg, ByValAlignment,
377 IFI.DL) >= ByValAlignment)
380 // Otherwise, we have to make a memcpy to get a safe alignment. This is bad
381 // for code quality, but rarely happens and is required for correctness.
384 // Create the alloca. If we have DataLayout, use nice alignment.
387 Align = IFI.DL->getPrefTypeAlignment(AggTy);
389 // If the byval had an alignment specified, we *must* use at least that
390 // alignment, as it is required by the byval argument (and uses of the
391 // pointer inside the callee).
392 Align = std::max(Align, ByValAlignment);
394 Function *Caller = TheCall->getParent()->getParent();
396 Value *NewAlloca = new AllocaInst(AggTy, nullptr, Align, Arg->getName(),
397 &*Caller->begin()->begin());
398 IFI.StaticAllocas.push_back(cast<AllocaInst>(NewAlloca));
400 // Uses of the argument in the function should use our new alloca
405 // isUsedByLifetimeMarker - Check whether this Value is used by a lifetime
407 static bool isUsedByLifetimeMarker(Value *V) {
408 for (User *U : V->users()) {
409 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(U)) {
410 switch (II->getIntrinsicID()) {
412 case Intrinsic::lifetime_start:
413 case Intrinsic::lifetime_end:
421 // hasLifetimeMarkers - Check whether the given alloca already has
422 // lifetime.start or lifetime.end intrinsics.
423 static bool hasLifetimeMarkers(AllocaInst *AI) {
424 Type *Ty = AI->getType();
425 Type *Int8PtrTy = Type::getInt8PtrTy(Ty->getContext(),
426 Ty->getPointerAddressSpace());
428 return isUsedByLifetimeMarker(AI);
430 // Do a scan to find all the casts to i8*.
431 for (User *U : AI->users()) {
432 if (U->getType() != Int8PtrTy) continue;
433 if (U->stripPointerCasts() != AI) continue;
434 if (isUsedByLifetimeMarker(U))
440 /// updateInlinedAtInfo - Helper function used by fixupLineNumbers to
441 /// recursively update InlinedAtEntry of a DebugLoc.
442 static DebugLoc updateInlinedAtInfo(const DebugLoc &DL,
443 const DebugLoc &InlinedAtDL,
445 if (MDNode *IA = DL.getInlinedAt(Ctx)) {
446 DebugLoc NewInlinedAtDL
447 = updateInlinedAtInfo(DebugLoc::getFromDILocation(IA), InlinedAtDL, Ctx);
448 return DebugLoc::get(DL.getLine(), DL.getCol(), DL.getScope(Ctx),
449 NewInlinedAtDL.getAsMDNode(Ctx));
452 return DebugLoc::get(DL.getLine(), DL.getCol(), DL.getScope(Ctx),
453 InlinedAtDL.getAsMDNode(Ctx));
456 /// fixupLineNumbers - Update inlined instructions' line numbers to
457 /// to encode location where these instructions are inlined.
458 static void fixupLineNumbers(Function *Fn, Function::iterator FI,
459 Instruction *TheCall) {
460 DebugLoc TheCallDL = TheCall->getDebugLoc();
461 if (TheCallDL.isUnknown())
464 for (; FI != Fn->end(); ++FI) {
465 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end();
467 DebugLoc DL = BI->getDebugLoc();
468 if (!DL.isUnknown()) {
469 BI->setDebugLoc(updateInlinedAtInfo(DL, TheCallDL, BI->getContext()));
470 if (DbgValueInst *DVI = dyn_cast<DbgValueInst>(BI)) {
471 LLVMContext &Ctx = BI->getContext();
472 MDNode *InlinedAt = BI->getDebugLoc().getInlinedAt(Ctx);
473 DVI->setOperand(2, createInlinedVariable(DVI->getVariable(),
481 /// InlineFunction - This function inlines the called function into the basic
482 /// block of the caller. This returns false if it is not possible to inline
483 /// this call. The program is still in a well defined state if this occurs
486 /// Note that this only does one level of inlining. For example, if the
487 /// instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now
488 /// exists in the instruction stream. Similarly this will inline a recursive
489 /// function by one level.
490 bool llvm::InlineFunction(CallSite CS, InlineFunctionInfo &IFI,
491 bool InsertLifetime) {
492 Instruction *TheCall = CS.getInstruction();
493 assert(TheCall->getParent() && TheCall->getParent()->getParent() &&
494 "Instruction not in function!");
496 // If IFI has any state in it, zap it before we fill it in.
499 const Function *CalledFunc = CS.getCalledFunction();
500 if (!CalledFunc || // Can't inline external function or indirect
501 CalledFunc->isDeclaration() || // call, or call to a vararg function!
502 CalledFunc->getFunctionType()->isVarArg()) return false;
504 // If the call to the callee is not a tail call, we must clear the 'tail'
505 // flags on any calls that we inline.
506 bool MustClearTailCallFlags =
507 !(isa<CallInst>(TheCall) && cast<CallInst>(TheCall)->isTailCall());
509 // If the call to the callee cannot throw, set the 'nounwind' flag on any
510 // calls that we inline.
511 bool MarkNoUnwind = CS.doesNotThrow();
513 BasicBlock *OrigBB = TheCall->getParent();
514 Function *Caller = OrigBB->getParent();
516 // GC poses two hazards to inlining, which only occur when the callee has GC:
517 // 1. If the caller has no GC, then the callee's GC must be propagated to the
519 // 2. If the caller has a differing GC, it is invalid to inline.
520 if (CalledFunc->hasGC()) {
521 if (!Caller->hasGC())
522 Caller->setGC(CalledFunc->getGC());
523 else if (CalledFunc->getGC() != Caller->getGC())
527 // Get the personality function from the callee if it contains a landing pad.
528 Value *CalleePersonality = nullptr;
529 for (Function::const_iterator I = CalledFunc->begin(), E = CalledFunc->end();
531 if (const InvokeInst *II = dyn_cast<InvokeInst>(I->getTerminator())) {
532 const BasicBlock *BB = II->getUnwindDest();
533 const LandingPadInst *LP = BB->getLandingPadInst();
534 CalleePersonality = LP->getPersonalityFn();
538 // Find the personality function used by the landing pads of the caller. If it
539 // exists, then check to see that it matches the personality function used in
541 if (CalleePersonality) {
542 for (Function::const_iterator I = Caller->begin(), E = Caller->end();
544 if (const InvokeInst *II = dyn_cast<InvokeInst>(I->getTerminator())) {
545 const BasicBlock *BB = II->getUnwindDest();
546 const LandingPadInst *LP = BB->getLandingPadInst();
548 // If the personality functions match, then we can perform the
549 // inlining. Otherwise, we can't inline.
550 // TODO: This isn't 100% true. Some personality functions are proper
551 // supersets of others and can be used in place of the other.
552 if (LP->getPersonalityFn() != CalleePersonality)
559 // Get an iterator to the last basic block in the function, which will have
560 // the new function inlined after it.
561 Function::iterator LastBlock = &Caller->back();
563 // Make sure to capture all of the return instructions from the cloned
565 SmallVector<ReturnInst*, 8> Returns;
566 ClonedCodeInfo InlinedFunctionInfo;
567 Function::iterator FirstNewBlock;
569 { // Scope to destroy VMap after cloning.
570 ValueToValueMapTy VMap;
571 // Keep a list of pair (dst, src) to emit byval initializations.
572 SmallVector<std::pair<Value*, Value*>, 4> ByValInit;
574 assert(CalledFunc->arg_size() == CS.arg_size() &&
575 "No varargs calls can be inlined!");
577 // Calculate the vector of arguments to pass into the function cloner, which
578 // matches up the formal to the actual argument values.
579 CallSite::arg_iterator AI = CS.arg_begin();
581 for (Function::const_arg_iterator I = CalledFunc->arg_begin(),
582 E = CalledFunc->arg_end(); I != E; ++I, ++AI, ++ArgNo) {
583 Value *ActualArg = *AI;
585 // When byval arguments actually inlined, we need to make the copy implied
586 // by them explicit. However, we don't do this if the callee is readonly
587 // or readnone, because the copy would be unneeded: the callee doesn't
588 // modify the struct.
589 if (CS.isByValArgument(ArgNo)) {
590 ActualArg = HandleByValArgument(ActualArg, TheCall, CalledFunc, IFI,
591 CalledFunc->getParamAlignment(ArgNo+1));
592 if (ActualArg != *AI)
593 ByValInit.push_back(std::make_pair(ActualArg, (Value*) *AI));
599 // We want the inliner to prune the code as it copies. We would LOVE to
600 // have no dead or constant instructions leftover after inlining occurs
601 // (which can happen, e.g., because an argument was constant), but we'll be
602 // happy with whatever the cloner can do.
603 CloneAndPruneFunctionInto(Caller, CalledFunc, VMap,
604 /*ModuleLevelChanges=*/false, Returns, ".i",
605 &InlinedFunctionInfo, IFI.DL, TheCall);
607 // Remember the first block that is newly cloned over.
608 FirstNewBlock = LastBlock; ++FirstNewBlock;
610 // Inject byval arguments initialization.
611 for (std::pair<Value*, Value*> &Init : ByValInit)
612 HandleByValArgumentInit(Init.first, Init.second, Caller->getParent(),
615 // Update the callgraph if requested.
617 UpdateCallGraphAfterInlining(CS, FirstNewBlock, VMap, IFI);
619 // Update inlined instructions' line number information.
620 fixupLineNumbers(Caller, FirstNewBlock, TheCall);
623 // If there are any alloca instructions in the block that used to be the entry
624 // block for the callee, move them to the entry block of the caller. First
625 // calculate which instruction they should be inserted before. We insert the
626 // instructions at the end of the current alloca list.
628 BasicBlock::iterator InsertPoint = Caller->begin()->begin();
629 for (BasicBlock::iterator I = FirstNewBlock->begin(),
630 E = FirstNewBlock->end(); I != E; ) {
631 AllocaInst *AI = dyn_cast<AllocaInst>(I++);
634 // If the alloca is now dead, remove it. This often occurs due to code
636 if (AI->use_empty()) {
637 AI->eraseFromParent();
641 if (!isa<Constant>(AI->getArraySize()))
644 // Keep track of the static allocas that we inline into the caller.
645 IFI.StaticAllocas.push_back(AI);
647 // Scan for the block of allocas that we can move over, and move them
649 while (isa<AllocaInst>(I) &&
650 isa<Constant>(cast<AllocaInst>(I)->getArraySize())) {
651 IFI.StaticAllocas.push_back(cast<AllocaInst>(I));
655 // Transfer all of the allocas over in a block. Using splice means
656 // that the instructions aren't removed from the symbol table, then
658 Caller->getEntryBlock().getInstList().splice(InsertPoint,
659 FirstNewBlock->getInstList(),
664 // Leave lifetime markers for the static alloca's, scoping them to the
665 // function we just inlined.
666 if (InsertLifetime && !IFI.StaticAllocas.empty()) {
667 IRBuilder<> builder(FirstNewBlock->begin());
668 for (unsigned ai = 0, ae = IFI.StaticAllocas.size(); ai != ae; ++ai) {
669 AllocaInst *AI = IFI.StaticAllocas[ai];
671 // If the alloca is already scoped to something smaller than the whole
672 // function then there's no need to add redundant, less accurate markers.
673 if (hasLifetimeMarkers(AI))
676 // Try to determine the size of the allocation.
677 ConstantInt *AllocaSize = nullptr;
678 if (ConstantInt *AIArraySize =
679 dyn_cast<ConstantInt>(AI->getArraySize())) {
681 Type *AllocaType = AI->getAllocatedType();
682 uint64_t AllocaTypeSize = IFI.DL->getTypeAllocSize(AllocaType);
683 uint64_t AllocaArraySize = AIArraySize->getLimitedValue();
684 assert(AllocaArraySize > 0 && "array size of AllocaInst is zero");
685 // Check that array size doesn't saturate uint64_t and doesn't
686 // overflow when it's multiplied by type size.
687 if (AllocaArraySize != ~0ULL &&
688 UINT64_MAX / AllocaArraySize >= AllocaTypeSize) {
689 AllocaSize = ConstantInt::get(Type::getInt64Ty(AI->getContext()),
690 AllocaArraySize * AllocaTypeSize);
695 builder.CreateLifetimeStart(AI, AllocaSize);
696 for (unsigned ri = 0, re = Returns.size(); ri != re; ++ri) {
697 IRBuilder<> builder(Returns[ri]);
698 builder.CreateLifetimeEnd(AI, AllocaSize);
703 // If the inlined code contained dynamic alloca instructions, wrap the inlined
704 // code with llvm.stacksave/llvm.stackrestore intrinsics.
705 if (InlinedFunctionInfo.ContainsDynamicAllocas) {
706 Module *M = Caller->getParent();
707 // Get the two intrinsics we care about.
708 Function *StackSave = Intrinsic::getDeclaration(M, Intrinsic::stacksave);
709 Function *StackRestore=Intrinsic::getDeclaration(M,Intrinsic::stackrestore);
711 // Insert the llvm.stacksave.
712 CallInst *SavedPtr = IRBuilder<>(FirstNewBlock, FirstNewBlock->begin())
713 .CreateCall(StackSave, "savedstack");
715 // Insert a call to llvm.stackrestore before any return instructions in the
717 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
718 IRBuilder<>(Returns[i]).CreateCall(StackRestore, SavedPtr);
722 // If we are inlining tail call instruction through a call site that isn't
723 // marked 'tail', we must remove the tail marker for any calls in the inlined
724 // code. Also, calls inlined through a 'nounwind' call site should be marked
726 if (InlinedFunctionInfo.ContainsCalls &&
727 (MustClearTailCallFlags || MarkNoUnwind)) {
728 for (Function::iterator BB = FirstNewBlock, E = Caller->end();
730 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
731 if (CallInst *CI = dyn_cast<CallInst>(I)) {
732 if (MustClearTailCallFlags)
733 CI->setTailCall(false);
735 CI->setDoesNotThrow();
739 // If we are inlining for an invoke instruction, we must make sure to rewrite
740 // any call instructions into invoke instructions.
741 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall))
742 HandleInlinedInvoke(II, FirstNewBlock, InlinedFunctionInfo);
744 // If we cloned in _exactly one_ basic block, and if that block ends in a
745 // return instruction, we splice the body of the inlined callee directly into
746 // the calling basic block.
747 if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) {
748 // Move all of the instructions right before the call.
749 OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(),
750 FirstNewBlock->begin(), FirstNewBlock->end());
751 // Remove the cloned basic block.
752 Caller->getBasicBlockList().pop_back();
754 // If the call site was an invoke instruction, add a branch to the normal
756 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
757 BranchInst *NewBr = BranchInst::Create(II->getNormalDest(), TheCall);
758 NewBr->setDebugLoc(Returns[0]->getDebugLoc());
761 // If the return instruction returned a value, replace uses of the call with
762 // uses of the returned value.
763 if (!TheCall->use_empty()) {
764 ReturnInst *R = Returns[0];
765 if (TheCall == R->getReturnValue())
766 TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType()));
768 TheCall->replaceAllUsesWith(R->getReturnValue());
770 // Since we are now done with the Call/Invoke, we can delete it.
771 TheCall->eraseFromParent();
773 // Since we are now done with the return instruction, delete it also.
774 Returns[0]->eraseFromParent();
776 // We are now done with the inlining.
780 // Otherwise, we have the normal case, of more than one block to inline or
781 // multiple return sites.
783 // We want to clone the entire callee function into the hole between the
784 // "starter" and "ender" blocks. How we accomplish this depends on whether
785 // this is an invoke instruction or a call instruction.
786 BasicBlock *AfterCallBB;
787 BranchInst *CreatedBranchToNormalDest = nullptr;
788 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
790 // Add an unconditional branch to make this look like the CallInst case...
791 CreatedBranchToNormalDest = BranchInst::Create(II->getNormalDest(), TheCall);
793 // Split the basic block. This guarantees that no PHI nodes will have to be
794 // updated due to new incoming edges, and make the invoke case more
795 // symmetric to the call case.
796 AfterCallBB = OrigBB->splitBasicBlock(CreatedBranchToNormalDest,
797 CalledFunc->getName()+".exit");
799 } else { // It's a call
800 // If this is a call instruction, we need to split the basic block that
801 // the call lives in.
803 AfterCallBB = OrigBB->splitBasicBlock(TheCall,
804 CalledFunc->getName()+".exit");
807 // Change the branch that used to go to AfterCallBB to branch to the first
808 // basic block of the inlined function.
810 TerminatorInst *Br = OrigBB->getTerminator();
811 assert(Br && Br->getOpcode() == Instruction::Br &&
812 "splitBasicBlock broken!");
813 Br->setOperand(0, FirstNewBlock);
816 // Now that the function is correct, make it a little bit nicer. In
817 // particular, move the basic blocks inserted from the end of the function
818 // into the space made by splitting the source basic block.
819 Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(),
820 FirstNewBlock, Caller->end());
822 // Handle all of the return instructions that we just cloned in, and eliminate
823 // any users of the original call/invoke instruction.
824 Type *RTy = CalledFunc->getReturnType();
826 PHINode *PHI = nullptr;
827 if (Returns.size() > 1) {
828 // The PHI node should go at the front of the new basic block to merge all
829 // possible incoming values.
830 if (!TheCall->use_empty()) {
831 PHI = PHINode::Create(RTy, Returns.size(), TheCall->getName(),
832 AfterCallBB->begin());
833 // Anything that used the result of the function call should now use the
834 // PHI node as their operand.
835 TheCall->replaceAllUsesWith(PHI);
838 // Loop over all of the return instructions adding entries to the PHI node
841 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
842 ReturnInst *RI = Returns[i];
843 assert(RI->getReturnValue()->getType() == PHI->getType() &&
844 "Ret value not consistent in function!");
845 PHI->addIncoming(RI->getReturnValue(), RI->getParent());
850 // Add a branch to the merge points and remove return instructions.
852 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
853 ReturnInst *RI = Returns[i];
854 BranchInst* BI = BranchInst::Create(AfterCallBB, RI);
855 Loc = RI->getDebugLoc();
856 BI->setDebugLoc(Loc);
857 RI->eraseFromParent();
859 // We need to set the debug location to *somewhere* inside the
860 // inlined function. The line number may be nonsensical, but the
861 // instruction will at least be associated with the right
863 if (CreatedBranchToNormalDest)
864 CreatedBranchToNormalDest->setDebugLoc(Loc);
865 } else if (!Returns.empty()) {
866 // Otherwise, if there is exactly one return value, just replace anything
867 // using the return value of the call with the computed value.
868 if (!TheCall->use_empty()) {
869 if (TheCall == Returns[0]->getReturnValue())
870 TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType()));
872 TheCall->replaceAllUsesWith(Returns[0]->getReturnValue());
875 // Update PHI nodes that use the ReturnBB to use the AfterCallBB.
876 BasicBlock *ReturnBB = Returns[0]->getParent();
877 ReturnBB->replaceAllUsesWith(AfterCallBB);
879 // Splice the code from the return block into the block that it will return
880 // to, which contains the code that was after the call.
881 AfterCallBB->getInstList().splice(AfterCallBB->begin(),
882 ReturnBB->getInstList());
884 if (CreatedBranchToNormalDest)
885 CreatedBranchToNormalDest->setDebugLoc(Returns[0]->getDebugLoc());
887 // Delete the return instruction now and empty ReturnBB now.
888 Returns[0]->eraseFromParent();
889 ReturnBB->eraseFromParent();
890 } else if (!TheCall->use_empty()) {
891 // No returns, but something is using the return value of the call. Just
893 TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType()));
896 // Since we are now done with the Call/Invoke, we can delete it.
897 TheCall->eraseFromParent();
899 // We should always be able to fold the entry block of the function into the
900 // single predecessor of the block...
901 assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!");
902 BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0);
904 // Splice the code entry block into calling block, right before the
905 // unconditional branch.
906 CalleeEntry->replaceAllUsesWith(OrigBB); // Update PHI nodes
907 OrigBB->getInstList().splice(Br, CalleeEntry->getInstList());
909 // Remove the unconditional branch.
910 OrigBB->getInstList().erase(Br);
912 // Now we can remove the CalleeEntry block, which is now empty.
913 Caller->getBasicBlockList().erase(CalleeEntry);
915 // If we inserted a phi node, check to see if it has a single value (e.g. all
916 // the entries are the same or undef). If so, remove the PHI so it doesn't
917 // block other optimizations.
919 if (Value *V = SimplifyInstruction(PHI, IFI.DL)) {
920 PHI->replaceAllUsesWith(V);
921 PHI->eraseFromParent();