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/SmallSet.h"
17 #include "llvm/ADT/SmallVector.h"
18 #include "llvm/ADT/SetVector.h"
19 #include "llvm/ADT/StringExtras.h"
20 #include "llvm/Analysis/AliasAnalysis.h"
21 #include "llvm/Analysis/AssumptionCache.h"
22 #include "llvm/Analysis/CallGraph.h"
23 #include "llvm/Analysis/CaptureTracking.h"
24 #include "llvm/Analysis/InstructionSimplify.h"
25 #include "llvm/Analysis/ValueTracking.h"
26 #include "llvm/IR/Attributes.h"
27 #include "llvm/IR/CallSite.h"
28 #include "llvm/IR/CFG.h"
29 #include "llvm/IR/Constants.h"
30 #include "llvm/IR/DataLayout.h"
31 #include "llvm/IR/DebugInfo.h"
32 #include "llvm/IR/DerivedTypes.h"
33 #include "llvm/IR/Dominators.h"
34 #include "llvm/IR/IRBuilder.h"
35 #include "llvm/IR/Instructions.h"
36 #include "llvm/IR/IntrinsicInst.h"
37 #include "llvm/IR/Intrinsics.h"
38 #include "llvm/IR/MDBuilder.h"
39 #include "llvm/IR/Module.h"
40 #include "llvm/Transforms/Utils/Local.h"
41 #include "llvm/Support/CommandLine.h"
46 EnableNoAliasConversion("enable-noalias-to-md-conversion", cl::init(true),
48 cl::desc("Convert noalias attributes to metadata during inlining."));
51 PreserveAlignmentAssumptions("preserve-alignment-assumptions-during-inlining",
52 cl::init(true), cl::Hidden,
53 cl::desc("Convert align attributes to assumptions during inlining."));
55 bool llvm::InlineFunction(CallInst *CI, InlineFunctionInfo &IFI,
56 bool InsertLifetime) {
57 return InlineFunction(CallSite(CI), IFI, InsertLifetime);
59 bool llvm::InlineFunction(InvokeInst *II, InlineFunctionInfo &IFI,
60 bool InsertLifetime) {
61 return InlineFunction(CallSite(II), IFI, InsertLifetime);
65 /// A class for recording information about inlining through an invoke.
66 class InvokeInliningInfo {
67 BasicBlock *OuterResumeDest; ///< Destination of the invoke's unwind.
68 BasicBlock *InnerResumeDest; ///< Destination for the callee's resume.
69 LandingPadInst *CallerLPad; ///< LandingPadInst associated with the invoke.
70 PHINode *InnerEHValuesPHI; ///< PHI for EH values from landingpad insts.
71 SmallVector<Value*, 8> UnwindDestPHIValues;
74 InvokeInliningInfo(InvokeInst *II)
75 : OuterResumeDest(II->getUnwindDest()), InnerResumeDest(nullptr),
76 CallerLPad(nullptr), InnerEHValuesPHI(nullptr) {
77 // If there are PHI nodes in the unwind destination block, we need to keep
78 // track of which values came into them from the invoke before removing
79 // the edge from this block.
80 llvm::BasicBlock *InvokeBB = II->getParent();
81 BasicBlock::iterator I = OuterResumeDest->begin();
82 for (; isa<PHINode>(I); ++I) {
83 // Save the value to use for this edge.
84 PHINode *PHI = cast<PHINode>(I);
85 UnwindDestPHIValues.push_back(PHI->getIncomingValueForBlock(InvokeBB));
88 CallerLPad = cast<LandingPadInst>(I);
91 /// getOuterResumeDest - The outer unwind destination is the target of
92 /// unwind edges introduced for calls within the inlined function.
93 BasicBlock *getOuterResumeDest() const {
94 return OuterResumeDest;
97 BasicBlock *getInnerResumeDest();
99 LandingPadInst *getLandingPadInst() const { return CallerLPad; }
101 /// forwardResume - Forward the 'resume' instruction to the caller's landing
102 /// pad block. When the landing pad block has only one predecessor, this is
103 /// a simple branch. When there is more than one predecessor, we need to
104 /// split the landing pad block after the landingpad instruction and jump
106 void forwardResume(ResumeInst *RI,
107 SmallPtrSetImpl<LandingPadInst*> &InlinedLPads);
109 /// addIncomingPHIValuesFor - Add incoming-PHI values to the unwind
110 /// destination block for the given basic block, using the values for the
111 /// original invoke's source block.
112 void addIncomingPHIValuesFor(BasicBlock *BB) const {
113 addIncomingPHIValuesForInto(BB, OuterResumeDest);
116 void addIncomingPHIValuesForInto(BasicBlock *src, BasicBlock *dest) const {
117 BasicBlock::iterator I = dest->begin();
118 for (unsigned i = 0, e = UnwindDestPHIValues.size(); i != e; ++i, ++I) {
119 PHINode *phi = cast<PHINode>(I);
120 phi->addIncoming(UnwindDestPHIValues[i], src);
126 /// getInnerResumeDest - Get or create a target for the branch from ResumeInsts.
127 BasicBlock *InvokeInliningInfo::getInnerResumeDest() {
128 if (InnerResumeDest) return InnerResumeDest;
130 // Split the landing pad.
131 BasicBlock::iterator SplitPoint = CallerLPad; ++SplitPoint;
133 OuterResumeDest->splitBasicBlock(SplitPoint,
134 OuterResumeDest->getName() + ".body");
136 // The number of incoming edges we expect to the inner landing pad.
137 const unsigned PHICapacity = 2;
139 // Create corresponding new PHIs for all the PHIs in the outer landing pad.
140 BasicBlock::iterator InsertPoint = InnerResumeDest->begin();
141 BasicBlock::iterator I = OuterResumeDest->begin();
142 for (unsigned i = 0, e = UnwindDestPHIValues.size(); i != e; ++i, ++I) {
143 PHINode *OuterPHI = cast<PHINode>(I);
144 PHINode *InnerPHI = PHINode::Create(OuterPHI->getType(), PHICapacity,
145 OuterPHI->getName() + ".lpad-body",
147 OuterPHI->replaceAllUsesWith(InnerPHI);
148 InnerPHI->addIncoming(OuterPHI, OuterResumeDest);
151 // Create a PHI for the exception values.
152 InnerEHValuesPHI = PHINode::Create(CallerLPad->getType(), PHICapacity,
153 "eh.lpad-body", InsertPoint);
154 CallerLPad->replaceAllUsesWith(InnerEHValuesPHI);
155 InnerEHValuesPHI->addIncoming(CallerLPad, OuterResumeDest);
158 return InnerResumeDest;
161 /// forwardResume - Forward the 'resume' instruction to the caller's landing pad
162 /// block. When the landing pad block has only one predecessor, this is a simple
163 /// branch. When there is more than one predecessor, we need to split the
164 /// landing pad block after the landingpad instruction and jump to there.
165 void InvokeInliningInfo::forwardResume(ResumeInst *RI,
166 SmallPtrSetImpl<LandingPadInst*> &InlinedLPads) {
167 BasicBlock *Dest = getInnerResumeDest();
168 BasicBlock *Src = RI->getParent();
170 BranchInst::Create(Dest, Src);
172 // Update the PHIs in the destination. They were inserted in an order which
174 addIncomingPHIValuesForInto(Src, Dest);
176 InnerEHValuesPHI->addIncoming(RI->getOperand(0), Src);
177 RI->eraseFromParent();
180 /// HandleCallsInBlockInlinedThroughInvoke - When we inline a basic block into
181 /// an invoke, we have to turn all of the calls that can throw into
182 /// invokes. This function analyze BB to see if there are any calls, and if so,
183 /// it rewrites them to be invokes that jump to InvokeDest and fills in the PHI
184 /// nodes in that block with the values specified in InvokeDestPHIValues.
185 static void HandleCallsInBlockInlinedThroughInvoke(BasicBlock *BB,
186 InvokeInliningInfo &Invoke) {
187 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
188 Instruction *I = BBI++;
190 // We only need to check for function calls: inlined invoke
191 // instructions require no special handling.
192 CallInst *CI = dyn_cast<CallInst>(I);
194 // If this call cannot unwind, don't convert it to an invoke.
195 // Inline asm calls cannot throw.
196 if (!CI || CI->doesNotThrow() || isa<InlineAsm>(CI->getCalledValue()))
199 // Convert this function call into an invoke instruction. First, split the
201 BasicBlock *Split = BB->splitBasicBlock(CI, CI->getName()+".noexc");
203 // Delete the unconditional branch inserted by splitBasicBlock
204 BB->getInstList().pop_back();
206 // Create the new invoke instruction.
207 ImmutableCallSite CS(CI);
208 SmallVector<Value*, 8> InvokeArgs(CS.arg_begin(), CS.arg_end());
209 InvokeInst *II = InvokeInst::Create(CI->getCalledValue(), Split,
210 Invoke.getOuterResumeDest(),
211 InvokeArgs, CI->getName(), BB);
212 II->setDebugLoc(CI->getDebugLoc());
213 II->setCallingConv(CI->getCallingConv());
214 II->setAttributes(CI->getAttributes());
216 // Make sure that anything using the call now uses the invoke! This also
217 // updates the CallGraph if present, because it uses a WeakVH.
218 CI->replaceAllUsesWith(II);
220 // Delete the original call
221 Split->getInstList().pop_front();
223 // Update any PHI nodes in the exceptional block to indicate that there is
224 // now a new entry in them.
225 Invoke.addIncomingPHIValuesFor(BB);
230 /// HandleInlinedInvoke - If we inlined an invoke site, we need to convert calls
231 /// in the body of the inlined function into invokes.
233 /// II is the invoke instruction being inlined. FirstNewBlock is the first
234 /// block of the inlined code (the last block is the end of the function),
235 /// and InlineCodeInfo is information about the code that got inlined.
236 static void HandleInlinedInvoke(InvokeInst *II, BasicBlock *FirstNewBlock,
237 ClonedCodeInfo &InlinedCodeInfo) {
238 BasicBlock *InvokeDest = II->getUnwindDest();
240 Function *Caller = FirstNewBlock->getParent();
242 // The inlined code is currently at the end of the function, scan from the
243 // start of the inlined code to its end, checking for stuff we need to
245 InvokeInliningInfo Invoke(II);
247 // Get all of the inlined landing pad instructions.
248 SmallPtrSet<LandingPadInst*, 16> InlinedLPads;
249 for (Function::iterator I = FirstNewBlock, E = Caller->end(); I != E; ++I)
250 if (InvokeInst *II = dyn_cast<InvokeInst>(I->getTerminator()))
251 InlinedLPads.insert(II->getLandingPadInst());
253 // Append the clauses from the outer landing pad instruction into the inlined
254 // landing pad instructions.
255 LandingPadInst *OuterLPad = Invoke.getLandingPadInst();
256 for (LandingPadInst *InlinedLPad : InlinedLPads) {
257 unsigned OuterNum = OuterLPad->getNumClauses();
258 InlinedLPad->reserveClauses(OuterNum);
259 for (unsigned OuterIdx = 0; OuterIdx != OuterNum; ++OuterIdx)
260 InlinedLPad->addClause(OuterLPad->getClause(OuterIdx));
261 if (OuterLPad->isCleanup())
262 InlinedLPad->setCleanup(true);
265 for (Function::iterator BB = FirstNewBlock, E = Caller->end(); BB != E; ++BB){
266 if (InlinedCodeInfo.ContainsCalls)
267 HandleCallsInBlockInlinedThroughInvoke(BB, Invoke);
269 // Forward any resumes that are remaining here.
270 if (ResumeInst *RI = dyn_cast<ResumeInst>(BB->getTerminator()))
271 Invoke.forwardResume(RI, InlinedLPads);
274 // Now that everything is happy, we have one final detail. The PHI nodes in
275 // the exception destination block still have entries due to the original
276 // invoke instruction. Eliminate these entries (which might even delete the
278 InvokeDest->removePredecessor(II->getParent());
281 /// CloneAliasScopeMetadata - When inlining a function that contains noalias
282 /// scope metadata, this metadata needs to be cloned so that the inlined blocks
283 /// have different "unqiue scopes" at every call site. Were this not done, then
284 /// aliasing scopes from a function inlined into a caller multiple times could
285 /// not be differentiated (and this would lead to miscompiles because the
286 /// non-aliasing property communicated by the metadata could have
287 /// call-site-specific control dependencies).
288 static void CloneAliasScopeMetadata(CallSite CS, ValueToValueMapTy &VMap) {
289 const Function *CalledFunc = CS.getCalledFunction();
290 SetVector<const MDNode *> MD;
292 // Note: We could only clone the metadata if it is already used in the
293 // caller. I'm omitting that check here because it might confuse
294 // inter-procedural alias analysis passes. We can revisit this if it becomes
295 // an efficiency or overhead problem.
297 for (Function::const_iterator I = CalledFunc->begin(), IE = CalledFunc->end();
299 for (BasicBlock::const_iterator J = I->begin(), JE = I->end(); J != JE; ++J) {
300 if (const MDNode *M = J->getMetadata(LLVMContext::MD_alias_scope))
302 if (const MDNode *M = J->getMetadata(LLVMContext::MD_noalias))
309 // Walk the existing metadata, adding the complete (perhaps cyclic) chain to
311 SmallVector<const Metadata *, 16> Queue(MD.begin(), MD.end());
312 while (!Queue.empty()) {
313 const MDNode *M = cast<MDNode>(Queue.pop_back_val());
314 for (unsigned i = 0, ie = M->getNumOperands(); i != ie; ++i)
315 if (const MDNode *M1 = dyn_cast<MDNode>(M->getOperand(i)))
320 // Now we have a complete set of all metadata in the chains used to specify
321 // the noalias scopes and the lists of those scopes.
322 SmallVector<MDTuple *, 16> DummyNodes;
323 DenseMap<const MDNode *, TrackingMDNodeRef> MDMap;
324 for (SetVector<const MDNode *>::iterator I = MD.begin(), IE = MD.end();
326 MDTuple *Dummy = MDTuple::getTemporary(CalledFunc->getContext(), None);
327 DummyNodes.push_back(Dummy);
328 MDMap[*I].reset(Dummy);
331 // Create new metadata nodes to replace the dummy nodes, replacing old
332 // metadata references with either a dummy node or an already-created new
334 for (SetVector<const MDNode *>::iterator I = MD.begin(), IE = MD.end();
336 SmallVector<Metadata *, 4> NewOps;
337 for (unsigned i = 0, ie = (*I)->getNumOperands(); i != ie; ++i) {
338 const Metadata *V = (*I)->getOperand(i);
339 if (const MDNode *M = dyn_cast<MDNode>(V))
340 NewOps.push_back(MDMap[M]);
342 NewOps.push_back(const_cast<Metadata *>(V));
345 MDNode *NewM = MDNode::get(CalledFunc->getContext(), NewOps);
346 MDTuple *TempM = cast<MDTuple>(MDMap[*I]);
347 assert(TempM->isTemporary() && "Expected temporary node");
349 TempM->replaceAllUsesWith(NewM);
352 // Now replace the metadata in the new inlined instructions with the
353 // repacements from the map.
354 for (ValueToValueMapTy::iterator VMI = VMap.begin(), VMIE = VMap.end();
355 VMI != VMIE; ++VMI) {
359 Instruction *NI = dyn_cast<Instruction>(VMI->second);
363 if (MDNode *M = NI->getMetadata(LLVMContext::MD_alias_scope)) {
364 MDNode *NewMD = MDMap[M];
365 // If the call site also had alias scope metadata (a list of scopes to
366 // which instructions inside it might belong), propagate those scopes to
367 // the inlined instructions.
369 CS.getInstruction()->getMetadata(LLVMContext::MD_alias_scope))
370 NewMD = MDNode::concatenate(NewMD, CSM);
371 NI->setMetadata(LLVMContext::MD_alias_scope, NewMD);
372 } else if (NI->mayReadOrWriteMemory()) {
374 CS.getInstruction()->getMetadata(LLVMContext::MD_alias_scope))
375 NI->setMetadata(LLVMContext::MD_alias_scope, M);
378 if (MDNode *M = NI->getMetadata(LLVMContext::MD_noalias)) {
379 MDNode *NewMD = MDMap[M];
380 // If the call site also had noalias metadata (a list of scopes with
381 // which instructions inside it don't alias), propagate those scopes to
382 // the inlined instructions.
384 CS.getInstruction()->getMetadata(LLVMContext::MD_noalias))
385 NewMD = MDNode::concatenate(NewMD, CSM);
386 NI->setMetadata(LLVMContext::MD_noalias, NewMD);
387 } else if (NI->mayReadOrWriteMemory()) {
388 if (MDNode *M = CS.getInstruction()->getMetadata(LLVMContext::MD_noalias))
389 NI->setMetadata(LLVMContext::MD_noalias, M);
393 // Now that everything has been replaced, delete the dummy nodes.
394 for (unsigned i = 0, ie = DummyNodes.size(); i != ie; ++i)
395 MDNode::deleteTemporary(DummyNodes[i]);
398 /// AddAliasScopeMetadata - If the inlined function has noalias arguments, then
399 /// add new alias scopes for each noalias argument, tag the mapped noalias
400 /// parameters with noalias metadata specifying the new scope, and tag all
401 /// non-derived loads, stores and memory intrinsics with the new alias scopes.
402 static void AddAliasScopeMetadata(CallSite CS, ValueToValueMapTy &VMap,
403 const DataLayout *DL, AliasAnalysis *AA) {
404 if (!EnableNoAliasConversion)
407 const Function *CalledFunc = CS.getCalledFunction();
408 SmallVector<const Argument *, 4> NoAliasArgs;
410 for (Function::const_arg_iterator I = CalledFunc->arg_begin(),
411 E = CalledFunc->arg_end(); I != E; ++I) {
412 if (I->hasNoAliasAttr() && !I->hasNUses(0))
413 NoAliasArgs.push_back(I);
416 if (NoAliasArgs.empty())
419 // To do a good job, if a noalias variable is captured, we need to know if
420 // the capture point dominates the particular use we're considering.
422 DT.recalculate(const_cast<Function&>(*CalledFunc));
424 // noalias indicates that pointer values based on the argument do not alias
425 // pointer values which are not based on it. So we add a new "scope" for each
426 // noalias function argument. Accesses using pointers based on that argument
427 // become part of that alias scope, accesses using pointers not based on that
428 // argument are tagged as noalias with that scope.
430 DenseMap<const Argument *, MDNode *> NewScopes;
431 MDBuilder MDB(CalledFunc->getContext());
433 // Create a new scope domain for this function.
435 MDB.createAnonymousAliasScopeDomain(CalledFunc->getName());
436 for (unsigned i = 0, e = NoAliasArgs.size(); i != e; ++i) {
437 const Argument *A = NoAliasArgs[i];
439 std::string Name = CalledFunc->getName();
442 Name += A->getName();
444 Name += ": argument ";
448 // Note: We always create a new anonymous root here. This is true regardless
449 // of the linkage of the callee because the aliasing "scope" is not just a
450 // property of the callee, but also all control dependencies in the caller.
451 MDNode *NewScope = MDB.createAnonymousAliasScope(NewDomain, Name);
452 NewScopes.insert(std::make_pair(A, NewScope));
455 // Iterate over all new instructions in the map; for all memory-access
456 // instructions, add the alias scope metadata.
457 for (ValueToValueMapTy::iterator VMI = VMap.begin(), VMIE = VMap.end();
458 VMI != VMIE; ++VMI) {
459 if (const Instruction *I = dyn_cast<Instruction>(VMI->first)) {
463 Instruction *NI = dyn_cast<Instruction>(VMI->second);
467 bool IsArgMemOnlyCall = false, IsFuncCall = false;
468 SmallVector<const Value *, 2> PtrArgs;
470 if (const LoadInst *LI = dyn_cast<LoadInst>(I))
471 PtrArgs.push_back(LI->getPointerOperand());
472 else if (const StoreInst *SI = dyn_cast<StoreInst>(I))
473 PtrArgs.push_back(SI->getPointerOperand());
474 else if (const VAArgInst *VAAI = dyn_cast<VAArgInst>(I))
475 PtrArgs.push_back(VAAI->getPointerOperand());
476 else if (const AtomicCmpXchgInst *CXI = dyn_cast<AtomicCmpXchgInst>(I))
477 PtrArgs.push_back(CXI->getPointerOperand());
478 else if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(I))
479 PtrArgs.push_back(RMWI->getPointerOperand());
480 else if (ImmutableCallSite ICS = ImmutableCallSite(I)) {
481 // If we know that the call does not access memory, then we'll still
482 // know that about the inlined clone of this call site, and we don't
483 // need to add metadata.
484 if (ICS.doesNotAccessMemory())
489 AliasAnalysis::ModRefBehavior MRB = AA->getModRefBehavior(ICS);
490 if (MRB == AliasAnalysis::OnlyAccessesArgumentPointees ||
491 MRB == AliasAnalysis::OnlyReadsArgumentPointees)
492 IsArgMemOnlyCall = true;
495 for (ImmutableCallSite::arg_iterator AI = ICS.arg_begin(),
496 AE = ICS.arg_end(); AI != AE; ++AI) {
497 // We need to check the underlying objects of all arguments, not just
498 // the pointer arguments, because we might be passing pointers as
500 // However, if we know that the call only accesses pointer arguments,
501 // then we only need to check the pointer arguments.
502 if (IsArgMemOnlyCall && !(*AI)->getType()->isPointerTy())
505 PtrArgs.push_back(*AI);
509 // If we found no pointers, then this instruction is not suitable for
510 // pairing with an instruction to receive aliasing metadata.
511 // However, if this is a call, this we might just alias with none of the
512 // noalias arguments.
513 if (PtrArgs.empty() && !IsFuncCall)
516 // It is possible that there is only one underlying object, but you
517 // need to go through several PHIs to see it, and thus could be
518 // repeated in the Objects list.
519 SmallPtrSet<const Value *, 4> ObjSet;
520 SmallVector<Metadata *, 4> Scopes, NoAliases;
522 SmallSetVector<const Argument *, 4> NAPtrArgs;
523 for (unsigned i = 0, ie = PtrArgs.size(); i != ie; ++i) {
524 SmallVector<Value *, 4> Objects;
525 GetUnderlyingObjects(const_cast<Value*>(PtrArgs[i]),
526 Objects, DL, /* MaxLookup = */ 0);
528 for (Value *O : Objects)
532 // Figure out if we're derived from anything that is not a noalias
534 bool CanDeriveViaCapture = false, UsesAliasingPtr = false;
535 for (const Value *V : ObjSet) {
536 // Is this value a constant that cannot be derived from any pointer
537 // value (we need to exclude constant expressions, for example, that
538 // are formed from arithmetic on global symbols).
539 bool IsNonPtrConst = isa<ConstantInt>(V) || isa<ConstantFP>(V) ||
540 isa<ConstantPointerNull>(V) ||
541 isa<ConstantDataVector>(V) || isa<UndefValue>(V);
545 // If this is anything other than a noalias argument, then we cannot
546 // completely describe the aliasing properties using alias.scope
547 // metadata (and, thus, won't add any).
548 if (const Argument *A = dyn_cast<Argument>(V)) {
549 if (!A->hasNoAliasAttr())
550 UsesAliasingPtr = true;
552 UsesAliasingPtr = true;
555 // If this is not some identified function-local object (which cannot
556 // directly alias a noalias argument), or some other argument (which,
557 // by definition, also cannot alias a noalias argument), then we could
558 // alias a noalias argument that has been captured).
559 if (!isa<Argument>(V) &&
560 !isIdentifiedFunctionLocal(const_cast<Value*>(V)))
561 CanDeriveViaCapture = true;
564 // A function call can always get captured noalias pointers (via other
565 // parameters, globals, etc.).
566 if (IsFuncCall && !IsArgMemOnlyCall)
567 CanDeriveViaCapture = true;
569 // First, we want to figure out all of the sets with which we definitely
570 // don't alias. Iterate over all noalias set, and add those for which:
571 // 1. The noalias argument is not in the set of objects from which we
572 // definitely derive.
573 // 2. The noalias argument has not yet been captured.
574 // An arbitrary function that might load pointers could see captured
575 // noalias arguments via other noalias arguments or globals, and so we
576 // must always check for prior capture.
577 for (const Argument *A : NoAliasArgs) {
578 if (!ObjSet.count(A) && (!CanDeriveViaCapture ||
579 // It might be tempting to skip the
580 // PointerMayBeCapturedBefore check if
581 // A->hasNoCaptureAttr() is true, but this is
582 // incorrect because nocapture only guarantees
583 // that no copies outlive the function, not
584 // that the value cannot be locally captured.
585 !PointerMayBeCapturedBefore(A,
586 /* ReturnCaptures */ false,
587 /* StoreCaptures */ false, I, &DT)))
588 NoAliases.push_back(NewScopes[A]);
591 if (!NoAliases.empty())
592 NI->setMetadata(LLVMContext::MD_noalias,
594 NI->getMetadata(LLVMContext::MD_noalias),
595 MDNode::get(CalledFunc->getContext(), NoAliases)));
597 // Next, we want to figure out all of the sets to which we might belong.
598 // We might belong to a set if the noalias argument is in the set of
599 // underlying objects. If there is some non-noalias argument in our list
600 // of underlying objects, then we cannot add a scope because the fact
601 // that some access does not alias with any set of our noalias arguments
602 // cannot itself guarantee that it does not alias with this access
603 // (because there is some pointer of unknown origin involved and the
604 // other access might also depend on this pointer). We also cannot add
605 // scopes to arbitrary functions unless we know they don't access any
606 // non-parameter pointer-values.
607 bool CanAddScopes = !UsesAliasingPtr;
608 if (CanAddScopes && IsFuncCall)
609 CanAddScopes = IsArgMemOnlyCall;
612 for (const Argument *A : NoAliasArgs) {
614 Scopes.push_back(NewScopes[A]);
619 LLVMContext::MD_alias_scope,
620 MDNode::concatenate(NI->getMetadata(LLVMContext::MD_alias_scope),
621 MDNode::get(CalledFunc->getContext(), Scopes)));
626 /// If the inlined function has non-byval align arguments, then
627 /// add @llvm.assume-based alignment assumptions to preserve this information.
628 static void AddAlignmentAssumptions(CallSite CS, InlineFunctionInfo &IFI) {
629 if (!PreserveAlignmentAssumptions || !IFI.DL)
632 // To avoid inserting redundant assumptions, we should check for assumptions
633 // already in the caller. To do this, we might need a DT of the caller.
635 bool DTCalculated = false;
637 Function *CalledFunc = CS.getCalledFunction();
638 for (Function::arg_iterator I = CalledFunc->arg_begin(),
639 E = CalledFunc->arg_end();
641 unsigned Align = I->getType()->isPointerTy() ? I->getParamAlignment() : 0;
642 if (Align && !I->hasByValOrInAllocaAttr() && !I->hasNUses(0)) {
644 DT.recalculate(const_cast<Function&>(*CS.getInstruction()->getParent()
649 // If we can already prove the asserted alignment in the context of the
650 // caller, then don't bother inserting the assumption.
651 Value *Arg = CS.getArgument(I->getArgNo());
652 if (getKnownAlignment(Arg, IFI.DL,
653 &IFI.ACT->getAssumptionCache(*CalledFunc),
654 CS.getInstruction(), &DT) >= Align)
657 IRBuilder<>(CS.getInstruction()).CreateAlignmentAssumption(*IFI.DL, Arg,
663 /// UpdateCallGraphAfterInlining - Once we have cloned code over from a callee
664 /// into the caller, update the specified callgraph to reflect the changes we
665 /// made. Note that it's possible that not all code was copied over, so only
666 /// some edges of the callgraph may remain.
667 static void UpdateCallGraphAfterInlining(CallSite CS,
668 Function::iterator FirstNewBlock,
669 ValueToValueMapTy &VMap,
670 InlineFunctionInfo &IFI) {
671 CallGraph &CG = *IFI.CG;
672 const Function *Caller = CS.getInstruction()->getParent()->getParent();
673 const Function *Callee = CS.getCalledFunction();
674 CallGraphNode *CalleeNode = CG[Callee];
675 CallGraphNode *CallerNode = CG[Caller];
677 // Since we inlined some uninlined call sites in the callee into the caller,
678 // add edges from the caller to all of the callees of the callee.
679 CallGraphNode::iterator I = CalleeNode->begin(), E = CalleeNode->end();
681 // Consider the case where CalleeNode == CallerNode.
682 CallGraphNode::CalledFunctionsVector CallCache;
683 if (CalleeNode == CallerNode) {
684 CallCache.assign(I, E);
685 I = CallCache.begin();
689 for (; I != E; ++I) {
690 const Value *OrigCall = I->first;
692 ValueToValueMapTy::iterator VMI = VMap.find(OrigCall);
693 // Only copy the edge if the call was inlined!
694 if (VMI == VMap.end() || VMI->second == nullptr)
697 // If the call was inlined, but then constant folded, there is no edge to
698 // add. Check for this case.
699 Instruction *NewCall = dyn_cast<Instruction>(VMI->second);
700 if (!NewCall) continue;
702 // Remember that this call site got inlined for the client of
704 IFI.InlinedCalls.push_back(NewCall);
706 // It's possible that inlining the callsite will cause it to go from an
707 // indirect to a direct call by resolving a function pointer. If this
708 // happens, set the callee of the new call site to a more precise
709 // destination. This can also happen if the call graph node of the caller
710 // was just unnecessarily imprecise.
711 if (!I->second->getFunction())
712 if (Function *F = CallSite(NewCall).getCalledFunction()) {
713 // Indirect call site resolved to direct call.
714 CallerNode->addCalledFunction(CallSite(NewCall), CG[F]);
719 CallerNode->addCalledFunction(CallSite(NewCall), I->second);
722 // Update the call graph by deleting the edge from Callee to Caller. We must
723 // do this after the loop above in case Caller and Callee are the same.
724 CallerNode->removeCallEdgeFor(CS);
727 static void HandleByValArgumentInit(Value *Dst, Value *Src, Module *M,
728 BasicBlock *InsertBlock,
729 InlineFunctionInfo &IFI) {
730 Type *AggTy = cast<PointerType>(Src->getType())->getElementType();
731 IRBuilder<> Builder(InsertBlock->begin());
734 if (IFI.DL == nullptr)
735 Size = ConstantExpr::getSizeOf(AggTy);
737 Size = Builder.getInt64(IFI.DL->getTypeStoreSize(AggTy));
739 // Always generate a memcpy of alignment 1 here because we don't know
740 // the alignment of the src pointer. Other optimizations can infer
742 Builder.CreateMemCpy(Dst, Src, Size, /*Align=*/1);
745 /// HandleByValArgument - When inlining a call site that has a byval argument,
746 /// we have to make the implicit memcpy explicit by adding it.
747 static Value *HandleByValArgument(Value *Arg, Instruction *TheCall,
748 const Function *CalledFunc,
749 InlineFunctionInfo &IFI,
750 unsigned ByValAlignment) {
751 PointerType *ArgTy = cast<PointerType>(Arg->getType());
752 Type *AggTy = ArgTy->getElementType();
754 Function *Caller = TheCall->getParent()->getParent();
756 // If the called function is readonly, then it could not mutate the caller's
757 // copy of the byval'd memory. In this case, it is safe to elide the copy and
759 if (CalledFunc->onlyReadsMemory()) {
760 // If the byval argument has a specified alignment that is greater than the
761 // passed in pointer, then we either have to round up the input pointer or
762 // give up on this transformation.
763 if (ByValAlignment <= 1) // 0 = unspecified, 1 = no particular alignment.
766 // If the pointer is already known to be sufficiently aligned, or if we can
767 // round it up to a larger alignment, then we don't need a temporary.
768 if (getOrEnforceKnownAlignment(Arg, ByValAlignment, IFI.DL,
769 &IFI.ACT->getAssumptionCache(*Caller),
770 TheCall) >= ByValAlignment)
773 // Otherwise, we have to make a memcpy to get a safe alignment. This is bad
774 // for code quality, but rarely happens and is required for correctness.
777 // Create the alloca. If we have DataLayout, use nice alignment.
780 Align = IFI.DL->getPrefTypeAlignment(AggTy);
782 // If the byval had an alignment specified, we *must* use at least that
783 // alignment, as it is required by the byval argument (and uses of the
784 // pointer inside the callee).
785 Align = std::max(Align, ByValAlignment);
787 Value *NewAlloca = new AllocaInst(AggTy, nullptr, Align, Arg->getName(),
788 &*Caller->begin()->begin());
789 IFI.StaticAllocas.push_back(cast<AllocaInst>(NewAlloca));
791 // Uses of the argument in the function should use our new alloca
796 // isUsedByLifetimeMarker - Check whether this Value is used by a lifetime
798 static bool isUsedByLifetimeMarker(Value *V) {
799 for (User *U : V->users()) {
800 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(U)) {
801 switch (II->getIntrinsicID()) {
803 case Intrinsic::lifetime_start:
804 case Intrinsic::lifetime_end:
812 // hasLifetimeMarkers - Check whether the given alloca already has
813 // lifetime.start or lifetime.end intrinsics.
814 static bool hasLifetimeMarkers(AllocaInst *AI) {
815 Type *Ty = AI->getType();
816 Type *Int8PtrTy = Type::getInt8PtrTy(Ty->getContext(),
817 Ty->getPointerAddressSpace());
819 return isUsedByLifetimeMarker(AI);
821 // Do a scan to find all the casts to i8*.
822 for (User *U : AI->users()) {
823 if (U->getType() != Int8PtrTy) continue;
824 if (U->stripPointerCasts() != AI) continue;
825 if (isUsedByLifetimeMarker(U))
831 /// updateInlinedAtInfo - Helper function used by fixupLineNumbers to
832 /// recursively update InlinedAtEntry of a DebugLoc.
833 static DebugLoc updateInlinedAtInfo(const DebugLoc &DL,
834 const DebugLoc &InlinedAtDL,
836 if (MDNode *IA = DL.getInlinedAt(Ctx)) {
837 DebugLoc NewInlinedAtDL
838 = updateInlinedAtInfo(DebugLoc::getFromDILocation(IA), InlinedAtDL, Ctx);
839 return DebugLoc::get(DL.getLine(), DL.getCol(), DL.getScope(Ctx),
840 NewInlinedAtDL.getAsMDNode(Ctx));
843 return DebugLoc::get(DL.getLine(), DL.getCol(), DL.getScope(Ctx),
844 InlinedAtDL.getAsMDNode(Ctx));
847 /// fixupLineNumbers - Update inlined instructions' line numbers to
848 /// to encode location where these instructions are inlined.
849 static void fixupLineNumbers(Function *Fn, Function::iterator FI,
850 Instruction *TheCall) {
851 DebugLoc TheCallDL = TheCall->getDebugLoc();
852 if (TheCallDL.isUnknown())
855 for (; FI != Fn->end(); ++FI) {
856 for (BasicBlock::iterator BI = FI->begin(), BE = FI->end();
858 DebugLoc DL = BI->getDebugLoc();
859 if (DL.isUnknown()) {
860 // If the inlined instruction has no line number, make it look as if it
861 // originates from the call location. This is important for
862 // ((__always_inline__, __nodebug__)) functions which must use caller
863 // location for all instructions in their function body.
865 // Don't update static allocas, as they may get moved later.
866 if (auto *AI = dyn_cast<AllocaInst>(BI))
867 if (isa<Constant>(AI->getArraySize()))
870 BI->setDebugLoc(TheCallDL);
872 BI->setDebugLoc(updateInlinedAtInfo(DL, TheCallDL, BI->getContext()));
873 if (DbgValueInst *DVI = dyn_cast<DbgValueInst>(BI)) {
874 LLVMContext &Ctx = BI->getContext();
875 MDNode *InlinedAt = BI->getDebugLoc().getInlinedAt(Ctx);
876 DVI->setOperand(2, MetadataAsValue::get(
877 Ctx, createInlinedVariable(DVI->getVariable(),
879 } else if (DbgDeclareInst *DDI = dyn_cast<DbgDeclareInst>(BI)) {
880 LLVMContext &Ctx = BI->getContext();
881 MDNode *InlinedAt = BI->getDebugLoc().getInlinedAt(Ctx);
882 DDI->setOperand(1, MetadataAsValue::get(
883 Ctx, createInlinedVariable(DDI->getVariable(),
891 /// InlineFunction - This function inlines the called function into the basic
892 /// block of the caller. This returns false if it is not possible to inline
893 /// this call. The program is still in a well defined state if this occurs
896 /// Note that this only does one level of inlining. For example, if the
897 /// instruction 'call B' is inlined, and 'B' calls 'C', then the call to 'C' now
898 /// exists in the instruction stream. Similarly this will inline a recursive
899 /// function by one level.
900 bool llvm::InlineFunction(CallSite CS, InlineFunctionInfo &IFI,
901 bool InsertLifetime) {
902 Instruction *TheCall = CS.getInstruction();
903 assert(TheCall->getParent() && TheCall->getParent()->getParent() &&
904 "Instruction not in function!");
906 // If IFI has any state in it, zap it before we fill it in.
909 const Function *CalledFunc = CS.getCalledFunction();
910 if (!CalledFunc || // Can't inline external function or indirect
911 CalledFunc->isDeclaration() || // call, or call to a vararg function!
912 CalledFunc->getFunctionType()->isVarArg()) return false;
914 // If the call to the callee cannot throw, set the 'nounwind' flag on any
915 // calls that we inline.
916 bool MarkNoUnwind = CS.doesNotThrow();
918 BasicBlock *OrigBB = TheCall->getParent();
919 Function *Caller = OrigBB->getParent();
921 // GC poses two hazards to inlining, which only occur when the callee has GC:
922 // 1. If the caller has no GC, then the callee's GC must be propagated to the
924 // 2. If the caller has a differing GC, it is invalid to inline.
925 if (CalledFunc->hasGC()) {
926 if (!Caller->hasGC())
927 Caller->setGC(CalledFunc->getGC());
928 else if (CalledFunc->getGC() != Caller->getGC())
932 // Get the personality function from the callee if it contains a landing pad.
933 Value *CalleePersonality = nullptr;
934 for (Function::const_iterator I = CalledFunc->begin(), E = CalledFunc->end();
936 if (const InvokeInst *II = dyn_cast<InvokeInst>(I->getTerminator())) {
937 const BasicBlock *BB = II->getUnwindDest();
938 const LandingPadInst *LP = BB->getLandingPadInst();
939 CalleePersonality = LP->getPersonalityFn();
943 // Find the personality function used by the landing pads of the caller. If it
944 // exists, then check to see that it matches the personality function used in
946 if (CalleePersonality) {
947 for (Function::const_iterator I = Caller->begin(), E = Caller->end();
949 if (const InvokeInst *II = dyn_cast<InvokeInst>(I->getTerminator())) {
950 const BasicBlock *BB = II->getUnwindDest();
951 const LandingPadInst *LP = BB->getLandingPadInst();
953 // If the personality functions match, then we can perform the
954 // inlining. Otherwise, we can't inline.
955 // TODO: This isn't 100% true. Some personality functions are proper
956 // supersets of others and can be used in place of the other.
957 if (LP->getPersonalityFn() != CalleePersonality)
964 // Get an iterator to the last basic block in the function, which will have
965 // the new function inlined after it.
966 Function::iterator LastBlock = &Caller->back();
968 // Make sure to capture all of the return instructions from the cloned
970 SmallVector<ReturnInst*, 8> Returns;
971 ClonedCodeInfo InlinedFunctionInfo;
972 Function::iterator FirstNewBlock;
974 { // Scope to destroy VMap after cloning.
975 ValueToValueMapTy VMap;
976 // Keep a list of pair (dst, src) to emit byval initializations.
977 SmallVector<std::pair<Value*, Value*>, 4> ByValInit;
979 assert(CalledFunc->arg_size() == CS.arg_size() &&
980 "No varargs calls can be inlined!");
982 // Calculate the vector of arguments to pass into the function cloner, which
983 // matches up the formal to the actual argument values.
984 CallSite::arg_iterator AI = CS.arg_begin();
986 for (Function::const_arg_iterator I = CalledFunc->arg_begin(),
987 E = CalledFunc->arg_end(); I != E; ++I, ++AI, ++ArgNo) {
988 Value *ActualArg = *AI;
990 // When byval arguments actually inlined, we need to make the copy implied
991 // by them explicit. However, we don't do this if the callee is readonly
992 // or readnone, because the copy would be unneeded: the callee doesn't
993 // modify the struct.
994 if (CS.isByValArgument(ArgNo)) {
995 ActualArg = HandleByValArgument(ActualArg, TheCall, CalledFunc, IFI,
996 CalledFunc->getParamAlignment(ArgNo+1));
997 if (ActualArg != *AI)
998 ByValInit.push_back(std::make_pair(ActualArg, (Value*) *AI));
1001 VMap[I] = ActualArg;
1004 // Add alignment assumptions if necessary. We do this before the inlined
1005 // instructions are actually cloned into the caller so that we can easily
1006 // check what will be known at the start of the inlined code.
1007 AddAlignmentAssumptions(CS, IFI);
1009 // We want the inliner to prune the code as it copies. We would LOVE to
1010 // have no dead or constant instructions leftover after inlining occurs
1011 // (which can happen, e.g., because an argument was constant), but we'll be
1012 // happy with whatever the cloner can do.
1013 CloneAndPruneFunctionInto(Caller, CalledFunc, VMap,
1014 /*ModuleLevelChanges=*/false, Returns, ".i",
1015 &InlinedFunctionInfo, IFI.DL, TheCall);
1017 // Remember the first block that is newly cloned over.
1018 FirstNewBlock = LastBlock; ++FirstNewBlock;
1020 // Inject byval arguments initialization.
1021 for (std::pair<Value*, Value*> &Init : ByValInit)
1022 HandleByValArgumentInit(Init.first, Init.second, Caller->getParent(),
1023 FirstNewBlock, IFI);
1025 // Update the callgraph if requested.
1027 UpdateCallGraphAfterInlining(CS, FirstNewBlock, VMap, IFI);
1029 // Update inlined instructions' line number information.
1030 fixupLineNumbers(Caller, FirstNewBlock, TheCall);
1032 // Clone existing noalias metadata if necessary.
1033 CloneAliasScopeMetadata(CS, VMap);
1035 // Add noalias metadata if necessary.
1036 AddAliasScopeMetadata(CS, VMap, IFI.DL, IFI.AA);
1038 // FIXME: We could register any cloned assumptions instead of clearing the
1039 // whole function's cache.
1041 IFI.ACT->getAssumptionCache(*Caller).clear();
1044 // If there are any alloca instructions in the block that used to be the entry
1045 // block for the callee, move them to the entry block of the caller. First
1046 // calculate which instruction they should be inserted before. We insert the
1047 // instructions at the end of the current alloca list.
1049 BasicBlock::iterator InsertPoint = Caller->begin()->begin();
1050 for (BasicBlock::iterator I = FirstNewBlock->begin(),
1051 E = FirstNewBlock->end(); I != E; ) {
1052 AllocaInst *AI = dyn_cast<AllocaInst>(I++);
1055 // If the alloca is now dead, remove it. This often occurs due to code
1057 if (AI->use_empty()) {
1058 AI->eraseFromParent();
1062 if (!isa<Constant>(AI->getArraySize()))
1065 // Keep track of the static allocas that we inline into the caller.
1066 IFI.StaticAllocas.push_back(AI);
1068 // Scan for the block of allocas that we can move over, and move them
1070 while (isa<AllocaInst>(I) &&
1071 isa<Constant>(cast<AllocaInst>(I)->getArraySize())) {
1072 IFI.StaticAllocas.push_back(cast<AllocaInst>(I));
1076 // Transfer all of the allocas over in a block. Using splice means
1077 // that the instructions aren't removed from the symbol table, then
1079 Caller->getEntryBlock().getInstList().splice(InsertPoint,
1080 FirstNewBlock->getInstList(),
1085 bool InlinedMustTailCalls = false;
1086 if (InlinedFunctionInfo.ContainsCalls) {
1087 CallInst::TailCallKind CallSiteTailKind = CallInst::TCK_None;
1088 if (CallInst *CI = dyn_cast<CallInst>(TheCall))
1089 CallSiteTailKind = CI->getTailCallKind();
1091 for (Function::iterator BB = FirstNewBlock, E = Caller->end(); BB != E;
1093 for (Instruction &I : *BB) {
1094 CallInst *CI = dyn_cast<CallInst>(&I);
1098 // We need to reduce the strength of any inlined tail calls. For
1099 // musttail, we have to avoid introducing potential unbounded stack
1100 // growth. For example, if functions 'f' and 'g' are mutually recursive
1101 // with musttail, we can inline 'g' into 'f' so long as we preserve
1102 // musttail on the cloned call to 'f'. If either the inlined call site
1103 // or the cloned call site is *not* musttail, the program already has
1104 // one frame of stack growth, so it's safe to remove musttail. Here is
1105 // a table of example transformations:
1107 // f -> musttail g -> musttail f ==> f -> musttail f
1108 // f -> musttail g -> tail f ==> f -> tail f
1109 // f -> g -> musttail f ==> f -> f
1110 // f -> g -> tail f ==> f -> f
1111 CallInst::TailCallKind ChildTCK = CI->getTailCallKind();
1112 ChildTCK = std::min(CallSiteTailKind, ChildTCK);
1113 CI->setTailCallKind(ChildTCK);
1114 InlinedMustTailCalls |= CI->isMustTailCall();
1116 // Calls inlined through a 'nounwind' call site should be marked
1119 CI->setDoesNotThrow();
1124 // Leave lifetime markers for the static alloca's, scoping them to the
1125 // function we just inlined.
1126 if (InsertLifetime && !IFI.StaticAllocas.empty()) {
1127 IRBuilder<> builder(FirstNewBlock->begin());
1128 for (unsigned ai = 0, ae = IFI.StaticAllocas.size(); ai != ae; ++ai) {
1129 AllocaInst *AI = IFI.StaticAllocas[ai];
1131 // If the alloca is already scoped to something smaller than the whole
1132 // function then there's no need to add redundant, less accurate markers.
1133 if (hasLifetimeMarkers(AI))
1136 // Try to determine the size of the allocation.
1137 ConstantInt *AllocaSize = nullptr;
1138 if (ConstantInt *AIArraySize =
1139 dyn_cast<ConstantInt>(AI->getArraySize())) {
1141 Type *AllocaType = AI->getAllocatedType();
1142 uint64_t AllocaTypeSize = IFI.DL->getTypeAllocSize(AllocaType);
1143 uint64_t AllocaArraySize = AIArraySize->getLimitedValue();
1144 assert(AllocaArraySize > 0 && "array size of AllocaInst is zero");
1145 // Check that array size doesn't saturate uint64_t and doesn't
1146 // overflow when it's multiplied by type size.
1147 if (AllocaArraySize != ~0ULL &&
1148 UINT64_MAX / AllocaArraySize >= AllocaTypeSize) {
1149 AllocaSize = ConstantInt::get(Type::getInt64Ty(AI->getContext()),
1150 AllocaArraySize * AllocaTypeSize);
1155 builder.CreateLifetimeStart(AI, AllocaSize);
1156 for (ReturnInst *RI : Returns) {
1157 // Don't insert llvm.lifetime.end calls between a musttail call and a
1158 // return. The return kills all local allocas.
1159 if (InlinedMustTailCalls &&
1160 RI->getParent()->getTerminatingMustTailCall())
1162 IRBuilder<>(RI).CreateLifetimeEnd(AI, AllocaSize);
1167 // If the inlined code contained dynamic alloca instructions, wrap the inlined
1168 // code with llvm.stacksave/llvm.stackrestore intrinsics.
1169 if (InlinedFunctionInfo.ContainsDynamicAllocas) {
1170 Module *M = Caller->getParent();
1171 // Get the two intrinsics we care about.
1172 Function *StackSave = Intrinsic::getDeclaration(M, Intrinsic::stacksave);
1173 Function *StackRestore=Intrinsic::getDeclaration(M,Intrinsic::stackrestore);
1175 // Insert the llvm.stacksave.
1176 CallInst *SavedPtr = IRBuilder<>(FirstNewBlock, FirstNewBlock->begin())
1177 .CreateCall(StackSave, "savedstack");
1179 // Insert a call to llvm.stackrestore before any return instructions in the
1180 // inlined function.
1181 for (ReturnInst *RI : Returns) {
1182 // Don't insert llvm.stackrestore calls between a musttail call and a
1183 // return. The return will restore the stack pointer.
1184 if (InlinedMustTailCalls && RI->getParent()->getTerminatingMustTailCall())
1186 IRBuilder<>(RI).CreateCall(StackRestore, SavedPtr);
1190 // If we are inlining for an invoke instruction, we must make sure to rewrite
1191 // any call instructions into invoke instructions.
1192 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall))
1193 HandleInlinedInvoke(II, FirstNewBlock, InlinedFunctionInfo);
1195 // Handle any inlined musttail call sites. In order for a new call site to be
1196 // musttail, the source of the clone and the inlined call site must have been
1197 // musttail. Therefore it's safe to return without merging control into the
1199 if (InlinedMustTailCalls) {
1200 // Check if we need to bitcast the result of any musttail calls.
1201 Type *NewRetTy = Caller->getReturnType();
1202 bool NeedBitCast = !TheCall->use_empty() && TheCall->getType() != NewRetTy;
1204 // Handle the returns preceded by musttail calls separately.
1205 SmallVector<ReturnInst *, 8> NormalReturns;
1206 for (ReturnInst *RI : Returns) {
1207 CallInst *ReturnedMustTail =
1208 RI->getParent()->getTerminatingMustTailCall();
1209 if (!ReturnedMustTail) {
1210 NormalReturns.push_back(RI);
1216 // Delete the old return and any preceding bitcast.
1217 BasicBlock *CurBB = RI->getParent();
1218 auto *OldCast = dyn_cast_or_null<BitCastInst>(RI->getReturnValue());
1219 RI->eraseFromParent();
1221 OldCast->eraseFromParent();
1223 // Insert a new bitcast and return with the right type.
1224 IRBuilder<> Builder(CurBB);
1225 Builder.CreateRet(Builder.CreateBitCast(ReturnedMustTail, NewRetTy));
1228 // Leave behind the normal returns so we can merge control flow.
1229 std::swap(Returns, NormalReturns);
1232 // If we cloned in _exactly one_ basic block, and if that block ends in a
1233 // return instruction, we splice the body of the inlined callee directly into
1234 // the calling basic block.
1235 if (Returns.size() == 1 && std::distance(FirstNewBlock, Caller->end()) == 1) {
1236 // Move all of the instructions right before the call.
1237 OrigBB->getInstList().splice(TheCall, FirstNewBlock->getInstList(),
1238 FirstNewBlock->begin(), FirstNewBlock->end());
1239 // Remove the cloned basic block.
1240 Caller->getBasicBlockList().pop_back();
1242 // If the call site was an invoke instruction, add a branch to the normal
1244 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
1245 BranchInst *NewBr = BranchInst::Create(II->getNormalDest(), TheCall);
1246 NewBr->setDebugLoc(Returns[0]->getDebugLoc());
1249 // If the return instruction returned a value, replace uses of the call with
1250 // uses of the returned value.
1251 if (!TheCall->use_empty()) {
1252 ReturnInst *R = Returns[0];
1253 if (TheCall == R->getReturnValue())
1254 TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType()));
1256 TheCall->replaceAllUsesWith(R->getReturnValue());
1258 // Since we are now done with the Call/Invoke, we can delete it.
1259 TheCall->eraseFromParent();
1261 // Since we are now done with the return instruction, delete it also.
1262 Returns[0]->eraseFromParent();
1264 // We are now done with the inlining.
1268 // Otherwise, we have the normal case, of more than one block to inline or
1269 // multiple return sites.
1271 // We want to clone the entire callee function into the hole between the
1272 // "starter" and "ender" blocks. How we accomplish this depends on whether
1273 // this is an invoke instruction or a call instruction.
1274 BasicBlock *AfterCallBB;
1275 BranchInst *CreatedBranchToNormalDest = nullptr;
1276 if (InvokeInst *II = dyn_cast<InvokeInst>(TheCall)) {
1278 // Add an unconditional branch to make this look like the CallInst case...
1279 CreatedBranchToNormalDest = BranchInst::Create(II->getNormalDest(), TheCall);
1281 // Split the basic block. This guarantees that no PHI nodes will have to be
1282 // updated due to new incoming edges, and make the invoke case more
1283 // symmetric to the call case.
1284 AfterCallBB = OrigBB->splitBasicBlock(CreatedBranchToNormalDest,
1285 CalledFunc->getName()+".exit");
1287 } else { // It's a call
1288 // If this is a call instruction, we need to split the basic block that
1289 // the call lives in.
1291 AfterCallBB = OrigBB->splitBasicBlock(TheCall,
1292 CalledFunc->getName()+".exit");
1295 // Change the branch that used to go to AfterCallBB to branch to the first
1296 // basic block of the inlined function.
1298 TerminatorInst *Br = OrigBB->getTerminator();
1299 assert(Br && Br->getOpcode() == Instruction::Br &&
1300 "splitBasicBlock broken!");
1301 Br->setOperand(0, FirstNewBlock);
1304 // Now that the function is correct, make it a little bit nicer. In
1305 // particular, move the basic blocks inserted from the end of the function
1306 // into the space made by splitting the source basic block.
1307 Caller->getBasicBlockList().splice(AfterCallBB, Caller->getBasicBlockList(),
1308 FirstNewBlock, Caller->end());
1310 // Handle all of the return instructions that we just cloned in, and eliminate
1311 // any users of the original call/invoke instruction.
1312 Type *RTy = CalledFunc->getReturnType();
1314 PHINode *PHI = nullptr;
1315 if (Returns.size() > 1) {
1316 // The PHI node should go at the front of the new basic block to merge all
1317 // possible incoming values.
1318 if (!TheCall->use_empty()) {
1319 PHI = PHINode::Create(RTy, Returns.size(), TheCall->getName(),
1320 AfterCallBB->begin());
1321 // Anything that used the result of the function call should now use the
1322 // PHI node as their operand.
1323 TheCall->replaceAllUsesWith(PHI);
1326 // Loop over all of the return instructions adding entries to the PHI node
1329 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
1330 ReturnInst *RI = Returns[i];
1331 assert(RI->getReturnValue()->getType() == PHI->getType() &&
1332 "Ret value not consistent in function!");
1333 PHI->addIncoming(RI->getReturnValue(), RI->getParent());
1338 // Add a branch to the merge points and remove return instructions.
1340 for (unsigned i = 0, e = Returns.size(); i != e; ++i) {
1341 ReturnInst *RI = Returns[i];
1342 BranchInst* BI = BranchInst::Create(AfterCallBB, RI);
1343 Loc = RI->getDebugLoc();
1344 BI->setDebugLoc(Loc);
1345 RI->eraseFromParent();
1347 // We need to set the debug location to *somewhere* inside the
1348 // inlined function. The line number may be nonsensical, but the
1349 // instruction will at least be associated with the right
1351 if (CreatedBranchToNormalDest)
1352 CreatedBranchToNormalDest->setDebugLoc(Loc);
1353 } else if (!Returns.empty()) {
1354 // Otherwise, if there is exactly one return value, just replace anything
1355 // using the return value of the call with the computed value.
1356 if (!TheCall->use_empty()) {
1357 if (TheCall == Returns[0]->getReturnValue())
1358 TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType()));
1360 TheCall->replaceAllUsesWith(Returns[0]->getReturnValue());
1363 // Update PHI nodes that use the ReturnBB to use the AfterCallBB.
1364 BasicBlock *ReturnBB = Returns[0]->getParent();
1365 ReturnBB->replaceAllUsesWith(AfterCallBB);
1367 // Splice the code from the return block into the block that it will return
1368 // to, which contains the code that was after the call.
1369 AfterCallBB->getInstList().splice(AfterCallBB->begin(),
1370 ReturnBB->getInstList());
1372 if (CreatedBranchToNormalDest)
1373 CreatedBranchToNormalDest->setDebugLoc(Returns[0]->getDebugLoc());
1375 // Delete the return instruction now and empty ReturnBB now.
1376 Returns[0]->eraseFromParent();
1377 ReturnBB->eraseFromParent();
1378 } else if (!TheCall->use_empty()) {
1379 // No returns, but something is using the return value of the call. Just
1381 TheCall->replaceAllUsesWith(UndefValue::get(TheCall->getType()));
1384 // Since we are now done with the Call/Invoke, we can delete it.
1385 TheCall->eraseFromParent();
1387 // If we inlined any musttail calls and the original return is now
1388 // unreachable, delete it. It can only contain a bitcast and ret.
1389 if (InlinedMustTailCalls && pred_begin(AfterCallBB) == pred_end(AfterCallBB))
1390 AfterCallBB->eraseFromParent();
1392 // We should always be able to fold the entry block of the function into the
1393 // single predecessor of the block...
1394 assert(cast<BranchInst>(Br)->isUnconditional() && "splitBasicBlock broken!");
1395 BasicBlock *CalleeEntry = cast<BranchInst>(Br)->getSuccessor(0);
1397 // Splice the code entry block into calling block, right before the
1398 // unconditional branch.
1399 CalleeEntry->replaceAllUsesWith(OrigBB); // Update PHI nodes
1400 OrigBB->getInstList().splice(Br, CalleeEntry->getInstList());
1402 // Remove the unconditional branch.
1403 OrigBB->getInstList().erase(Br);
1405 // Now we can remove the CalleeEntry block, which is now empty.
1406 Caller->getBasicBlockList().erase(CalleeEntry);
1408 // If we inserted a phi node, check to see if it has a single value (e.g. all
1409 // the entries are the same or undef). If so, remove the PHI so it doesn't
1410 // block other optimizations.
1412 if (Value *V = SimplifyInstruction(PHI, IFI.DL, nullptr, nullptr,
1413 &IFI.ACT->getAssumptionCache(*Caller))) {
1414 PHI->replaceAllUsesWith(V);
1415 PHI->eraseFromParent();