1 //===- CloneFunction.cpp - Clone a function into another function ---------===//
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 the CloneFunctionInto interface, which is used as the
11 // low-level function cloner. This is used by the CloneFunction and function
12 // inliner to do the dirty work of copying the body of a function around.
14 //===----------------------------------------------------------------------===//
16 #include "llvm/Transforms/Utils/Cloning.h"
17 #include "llvm/ADT/SmallVector.h"
18 #include "llvm/Analysis/ConstantFolding.h"
19 #include "llvm/Analysis/InstructionSimplify.h"
20 #include "llvm/IR/CFG.h"
21 #include "llvm/IR/Constants.h"
22 #include "llvm/IR/DebugInfo.h"
23 #include "llvm/IR/DerivedTypes.h"
24 #include "llvm/IR/Function.h"
25 #include "llvm/IR/GlobalVariable.h"
26 #include "llvm/IR/Instructions.h"
27 #include "llvm/IR/IntrinsicInst.h"
28 #include "llvm/IR/LLVMContext.h"
29 #include "llvm/IR/Metadata.h"
30 #include "llvm/IR/Module.h"
31 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
32 #include "llvm/Transforms/Utils/Local.h"
33 #include "llvm/Transforms/Utils/ValueMapper.h"
37 // CloneBasicBlock - See comments in Cloning.h
38 BasicBlock *llvm::CloneBasicBlock(const BasicBlock *BB,
39 ValueToValueMapTy &VMap,
40 const Twine &NameSuffix, Function *F,
41 ClonedCodeInfo *CodeInfo) {
42 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F);
43 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix);
45 bool hasCalls = false, hasDynamicAllocas = false, hasStaticAllocas = false;
47 // Loop over all instructions, and copy them over.
48 for (BasicBlock::const_iterator II = BB->begin(), IE = BB->end();
50 Instruction *NewInst = II->clone();
52 NewInst->setName(II->getName()+NameSuffix);
53 NewBB->getInstList().push_back(NewInst);
54 VMap[II] = NewInst; // Add instruction map to value.
56 hasCalls |= (isa<CallInst>(II) && !isa<DbgInfoIntrinsic>(II));
57 if (const AllocaInst *AI = dyn_cast<AllocaInst>(II)) {
58 if (isa<ConstantInt>(AI->getArraySize()))
59 hasStaticAllocas = true;
61 hasDynamicAllocas = true;
66 CodeInfo->ContainsCalls |= hasCalls;
67 CodeInfo->ContainsDynamicAllocas |= hasDynamicAllocas;
68 CodeInfo->ContainsDynamicAllocas |= hasStaticAllocas &&
69 BB != &BB->getParent()->getEntryBlock();
74 // Clone OldFunc into NewFunc, transforming the old arguments into references to
77 void llvm::CloneFunctionInto(Function *NewFunc, const Function *OldFunc,
78 ValueToValueMapTy &VMap,
79 bool ModuleLevelChanges,
80 SmallVectorImpl<ReturnInst*> &Returns,
81 const char *NameSuffix, ClonedCodeInfo *CodeInfo,
82 ValueMapTypeRemapper *TypeMapper,
83 ValueMaterializer *Materializer) {
84 assert(NameSuffix && "NameSuffix cannot be null!");
87 for (Function::const_arg_iterator I = OldFunc->arg_begin(),
88 E = OldFunc->arg_end(); I != E; ++I)
89 assert(VMap.count(I) && "No mapping from source argument specified!");
92 // Copy all attributes other than those stored in the AttributeSet. We need
93 // to remap the parameter indices of the AttributeSet.
94 AttributeSet NewAttrs = NewFunc->getAttributes();
95 NewFunc->copyAttributesFrom(OldFunc);
96 NewFunc->setAttributes(NewAttrs);
98 AttributeSet OldAttrs = OldFunc->getAttributes();
99 // Clone any argument attributes that are present in the VMap.
100 for (const Argument &OldArg : OldFunc->args())
101 if (Argument *NewArg = dyn_cast<Argument>(VMap[&OldArg])) {
103 OldAttrs.getParamAttributes(OldArg.getArgNo() + 1);
104 if (attrs.getNumSlots() > 0)
105 NewArg->addAttr(attrs);
108 NewFunc->setAttributes(
109 NewFunc->getAttributes()
110 .addAttributes(NewFunc->getContext(), AttributeSet::ReturnIndex,
111 OldAttrs.getRetAttributes())
112 .addAttributes(NewFunc->getContext(), AttributeSet::FunctionIndex,
113 OldAttrs.getFnAttributes()));
115 // Loop over all of the basic blocks in the function, cloning them as
116 // appropriate. Note that we save BE this way in order to handle cloning of
117 // recursive functions into themselves.
119 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
121 const BasicBlock &BB = *BI;
123 // Create a new basic block and copy instructions into it!
124 BasicBlock *CBB = CloneBasicBlock(&BB, VMap, NameSuffix, NewFunc, CodeInfo);
126 // Add basic block mapping.
129 // It is only legal to clone a function if a block address within that
130 // function is never referenced outside of the function. Given that, we
131 // want to map block addresses from the old function to block addresses in
132 // the clone. (This is different from the generic ValueMapper
133 // implementation, which generates an invalid blockaddress when
134 // cloning a function.)
135 if (BB.hasAddressTaken()) {
136 Constant *OldBBAddr = BlockAddress::get(const_cast<Function*>(OldFunc),
137 const_cast<BasicBlock*>(&BB));
138 VMap[OldBBAddr] = BlockAddress::get(NewFunc, CBB);
141 // Note return instructions for the caller.
142 if (ReturnInst *RI = dyn_cast<ReturnInst>(CBB->getTerminator()))
143 Returns.push_back(RI);
146 // Loop over all of the instructions in the function, fixing up operand
147 // references as we go. This uses VMap to do all the hard work.
148 for (Function::iterator BB = cast<BasicBlock>(VMap[OldFunc->begin()]),
149 BE = NewFunc->end(); BB != BE; ++BB)
150 // Loop over all instructions, fixing each one as we find it...
151 for (BasicBlock::iterator II = BB->begin(); II != BB->end(); ++II)
152 RemapInstruction(II, VMap,
153 ModuleLevelChanges ? RF_None : RF_NoModuleLevelChanges,
154 TypeMapper, Materializer);
157 // Find the MDNode which corresponds to the DISubprogram data that described F.
158 static MDNode* FindSubprogram(const Function *F, DebugInfoFinder &Finder) {
159 for (DISubprogram Subprogram : Finder.subprograms()) {
160 if (Subprogram.describes(F)) return Subprogram;
165 // Add an operand to an existing MDNode. The new operand will be added at the
166 // back of the operand list.
167 static void AddOperand(DICompileUnit CU, DIArray SPs, Metadata *NewSP) {
168 SmallVector<Metadata *, 16> NewSPs;
169 NewSPs.reserve(SPs->getNumOperands() + 1);
170 for (unsigned I = 0, E = SPs->getNumOperands(); I != E; ++I)
171 NewSPs.push_back(SPs->getOperand(I));
172 NewSPs.push_back(NewSP);
173 CU.replaceSubprograms(DIArray(MDNode::get(CU->getContext(), NewSPs)));
176 // Clone the module-level debug info associated with OldFunc. The cloned data
177 // will point to NewFunc instead.
178 static void CloneDebugInfoMetadata(Function *NewFunc, const Function *OldFunc,
179 ValueToValueMapTy &VMap) {
180 DebugInfoFinder Finder;
181 Finder.processModule(*OldFunc->getParent());
183 const MDNode *OldSubprogramMDNode = FindSubprogram(OldFunc, Finder);
184 if (!OldSubprogramMDNode) return;
186 // Ensure that OldFunc appears in the map.
187 // (if it's already there it must point to NewFunc anyway)
188 VMap[OldFunc] = NewFunc;
189 DISubprogram NewSubprogram(MapMetadata(OldSubprogramMDNode, VMap));
191 for (DICompileUnit CU : Finder.compile_units()) {
192 DIArray Subprograms(CU.getSubprograms());
194 // If the compile unit's function list contains the old function, it should
195 // also contain the new one.
196 for (unsigned i = 0; i < Subprograms.getNumElements(); i++) {
197 if ((MDNode*)Subprograms.getElement(i) == OldSubprogramMDNode) {
198 AddOperand(CU, Subprograms, NewSubprogram);
205 /// CloneFunction - Return a copy of the specified function, but without
206 /// embedding the function into another module. Also, any references specified
207 /// in the VMap are changed to refer to their mapped value instead of the
208 /// original one. If any of the arguments to the function are in the VMap,
209 /// the arguments are deleted from the resultant function. The VMap is
210 /// updated to include mappings from all of the instructions and basicblocks in
211 /// the function from their old to new values.
213 Function *llvm::CloneFunction(const Function *F, ValueToValueMapTy &VMap,
214 bool ModuleLevelChanges,
215 ClonedCodeInfo *CodeInfo) {
216 std::vector<Type*> ArgTypes;
218 // The user might be deleting arguments to the function by specifying them in
219 // the VMap. If so, we need to not add the arguments to the arg ty vector
221 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
223 if (VMap.count(I) == 0) // Haven't mapped the argument to anything yet?
224 ArgTypes.push_back(I->getType());
226 // Create a new function type...
227 FunctionType *FTy = FunctionType::get(F->getFunctionType()->getReturnType(),
228 ArgTypes, F->getFunctionType()->isVarArg());
230 // Create the new function...
231 Function *NewF = Function::Create(FTy, F->getLinkage(), F->getName());
233 // Loop over the arguments, copying the names of the mapped arguments over...
234 Function::arg_iterator DestI = NewF->arg_begin();
235 for (Function::const_arg_iterator I = F->arg_begin(), E = F->arg_end();
237 if (VMap.count(I) == 0) { // Is this argument preserved?
238 DestI->setName(I->getName()); // Copy the name over...
239 VMap[I] = DestI++; // Add mapping to VMap
242 if (ModuleLevelChanges)
243 CloneDebugInfoMetadata(NewF, F, VMap);
245 SmallVector<ReturnInst*, 8> Returns; // Ignore returns cloned.
246 CloneFunctionInto(NewF, F, VMap, ModuleLevelChanges, Returns, "", CodeInfo);
253 /// PruningFunctionCloner - This class is a private class used to implement
254 /// the CloneAndPruneFunctionInto method.
255 struct PruningFunctionCloner {
257 const Function *OldFunc;
258 ValueToValueMapTy &VMap;
259 bool ModuleLevelChanges;
260 const char *NameSuffix;
261 ClonedCodeInfo *CodeInfo;
262 CloningDirector *Director;
263 ValueMapTypeRemapper *TypeMapper;
264 ValueMaterializer *Materializer;
267 PruningFunctionCloner(Function *newFunc, const Function *oldFunc,
268 ValueToValueMapTy &valueMap, bool moduleLevelChanges,
269 const char *nameSuffix, ClonedCodeInfo *codeInfo,
270 CloningDirector *Director)
271 : NewFunc(newFunc), OldFunc(oldFunc), VMap(valueMap),
272 ModuleLevelChanges(moduleLevelChanges), NameSuffix(nameSuffix),
273 CodeInfo(codeInfo), Director(Director) {
274 // These are optional components. The Director may return null.
276 TypeMapper = Director->getTypeRemapper();
277 Materializer = Director->getValueMaterializer();
279 TypeMapper = nullptr;
280 Materializer = nullptr;
284 /// CloneBlock - The specified block is found to be reachable, clone it and
285 /// anything that it can reach.
286 void CloneBlock(const BasicBlock *BB,
287 BasicBlock::const_iterator StartingInst,
288 std::vector<const BasicBlock*> &ToClone);
292 /// CloneBlock - The specified block is found to be reachable, clone it and
293 /// anything that it can reach.
294 void PruningFunctionCloner::CloneBlock(const BasicBlock *BB,
295 BasicBlock::const_iterator StartingInst,
296 std::vector<const BasicBlock*> &ToClone){
297 WeakVH &BBEntry = VMap[BB];
299 // Have we already cloned this block?
302 // Nope, clone it now.
304 BBEntry = NewBB = BasicBlock::Create(BB->getContext());
305 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix);
307 // It is only legal to clone a function if a block address within that
308 // function is never referenced outside of the function. Given that, we
309 // want to map block addresses from the old function to block addresses in
310 // the clone. (This is different from the generic ValueMapper
311 // implementation, which generates an invalid blockaddress when
312 // cloning a function.)
314 // Note that we don't need to fix the mapping for unreachable blocks;
315 // the default mapping there is safe.
316 if (BB->hasAddressTaken()) {
317 Constant *OldBBAddr = BlockAddress::get(const_cast<Function*>(OldFunc),
318 const_cast<BasicBlock*>(BB));
319 VMap[OldBBAddr] = BlockAddress::get(NewFunc, NewBB);
322 bool hasCalls = false, hasDynamicAllocas = false, hasStaticAllocas = false;
324 // Loop over all instructions, and copy them over, DCE'ing as we go. This
325 // loop doesn't include the terminator.
326 for (BasicBlock::const_iterator II = StartingInst, IE = --BB->end();
328 // If the "Director" remaps the instruction, don't clone it.
330 CloningDirector::CloningAction Action
331 = Director->handleInstruction(VMap, II, NewBB);
332 // If the cloning director says stop, we want to stop everything, not
333 // just break out of the loop (which would cause the terminator to be
334 // cloned). The cloning director is responsible for inserting a proper
335 // terminator into the new basic block in this case.
336 if (Action == CloningDirector::StopCloningBB)
338 // If the cloning director says skip, continue to the next instruction.
339 // In this case, the cloning director is responsible for mapping the
340 // skipped instruction to some value that is defined in the new
342 if (Action == CloningDirector::SkipInstruction)
346 Instruction *NewInst = II->clone();
348 // Eagerly remap operands to the newly cloned instruction, except for PHI
349 // nodes for which we defer processing until we update the CFG.
350 if (!isa<PHINode>(NewInst)) {
351 RemapInstruction(NewInst, VMap,
352 ModuleLevelChanges ? RF_None : RF_NoModuleLevelChanges,
353 TypeMapper, Materializer);
355 // If we can simplify this instruction to some other value, simply add
356 // a mapping to that value rather than inserting a new instruction into
359 SimplifyInstruction(NewInst, BB->getModule()->getDataLayout())) {
360 // On the off-chance that this simplifies to an instruction in the old
361 // function, map it back into the new function.
362 if (Value *MappedV = VMap.lookup(V))
372 NewInst->setName(II->getName()+NameSuffix);
373 VMap[II] = NewInst; // Add instruction map to value.
374 NewBB->getInstList().push_back(NewInst);
375 hasCalls |= (isa<CallInst>(II) && !isa<DbgInfoIntrinsic>(II));
376 if (const AllocaInst *AI = dyn_cast<AllocaInst>(II)) {
377 if (isa<ConstantInt>(AI->getArraySize()))
378 hasStaticAllocas = true;
380 hasDynamicAllocas = true;
384 // Finally, clone over the terminator.
385 const TerminatorInst *OldTI = BB->getTerminator();
386 bool TerminatorDone = false;
388 CloningDirector::CloningAction Action
389 = Director->handleInstruction(VMap, OldTI, NewBB);
390 // If the cloning director says stop, we want to stop everything, not
391 // just break out of the loop (which would cause the terminator to be
392 // cloned). The cloning director is responsible for inserting a proper
393 // terminator into the new basic block in this case.
394 if (Action == CloningDirector::StopCloningBB)
396 assert(Action != CloningDirector::SkipInstruction &&
397 "SkipInstruction is not valid for terminators.");
399 if (const BranchInst *BI = dyn_cast<BranchInst>(OldTI)) {
400 if (BI->isConditional()) {
401 // If the condition was a known constant in the callee...
402 ConstantInt *Cond = dyn_cast<ConstantInt>(BI->getCondition());
403 // Or is a known constant in the caller...
405 Value *V = VMap[BI->getCondition()];
406 Cond = dyn_cast_or_null<ConstantInt>(V);
409 // Constant fold to uncond branch!
411 BasicBlock *Dest = BI->getSuccessor(!Cond->getZExtValue());
412 VMap[OldTI] = BranchInst::Create(Dest, NewBB);
413 ToClone.push_back(Dest);
414 TerminatorDone = true;
417 } else if (const SwitchInst *SI = dyn_cast<SwitchInst>(OldTI)) {
418 // If switching on a value known constant in the caller.
419 ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition());
420 if (!Cond) { // Or known constant after constant prop in the callee...
421 Value *V = VMap[SI->getCondition()];
422 Cond = dyn_cast_or_null<ConstantInt>(V);
424 if (Cond) { // Constant fold to uncond branch!
425 SwitchInst::ConstCaseIt Case = SI->findCaseValue(Cond);
426 BasicBlock *Dest = const_cast<BasicBlock*>(Case.getCaseSuccessor());
427 VMap[OldTI] = BranchInst::Create(Dest, NewBB);
428 ToClone.push_back(Dest);
429 TerminatorDone = true;
433 if (!TerminatorDone) {
434 Instruction *NewInst = OldTI->clone();
435 if (OldTI->hasName())
436 NewInst->setName(OldTI->getName()+NameSuffix);
437 NewBB->getInstList().push_back(NewInst);
438 VMap[OldTI] = NewInst; // Add instruction map to value.
440 // Recursively clone any reachable successor blocks.
441 const TerminatorInst *TI = BB->getTerminator();
442 for (unsigned i = 0, e = TI->getNumSuccessors(); i != e; ++i)
443 ToClone.push_back(TI->getSuccessor(i));
447 CodeInfo->ContainsCalls |= hasCalls;
448 CodeInfo->ContainsDynamicAllocas |= hasDynamicAllocas;
449 CodeInfo->ContainsDynamicAllocas |= hasStaticAllocas &&
450 BB != &BB->getParent()->front();
454 /// CloneAndPruneIntoFromInst - This works like CloneAndPruneFunctionInto, except
455 /// that it does not clone the entire function. Instead it starts at an
456 /// instruction provided by the caller and copies (and prunes) only the code
457 /// reachable from that instruction.
458 void llvm::CloneAndPruneIntoFromInst(Function *NewFunc, const Function *OldFunc,
459 const Instruction *StartingInst,
460 ValueToValueMapTy &VMap,
461 bool ModuleLevelChanges,
462 SmallVectorImpl<ReturnInst *> &Returns,
463 const char *NameSuffix,
464 ClonedCodeInfo *CodeInfo,
465 CloningDirector *Director) {
466 assert(NameSuffix && "NameSuffix cannot be null!");
468 ValueMapTypeRemapper *TypeMapper = nullptr;
469 ValueMaterializer *Materializer = nullptr;
472 TypeMapper = Director->getTypeRemapper();
473 Materializer = Director->getValueMaterializer();
477 // If the cloning starts at the begining of the function, verify that
478 // the function arguments are mapped.
480 for (Function::const_arg_iterator II = OldFunc->arg_begin(),
481 E = OldFunc->arg_end(); II != E; ++II)
482 assert(VMap.count(II) && "No mapping from source argument specified!");
485 PruningFunctionCloner PFC(NewFunc, OldFunc, VMap, ModuleLevelChanges,
486 NameSuffix, CodeInfo, Director);
487 const BasicBlock *StartingBB;
489 StartingBB = StartingInst->getParent();
491 StartingBB = &OldFunc->getEntryBlock();
492 StartingInst = StartingBB->begin();
495 // Clone the entry block, and anything recursively reachable from it.
496 std::vector<const BasicBlock*> CloneWorklist;
497 PFC.CloneBlock(StartingBB, StartingInst, CloneWorklist);
498 while (!CloneWorklist.empty()) {
499 const BasicBlock *BB = CloneWorklist.back();
500 CloneWorklist.pop_back();
501 PFC.CloneBlock(BB, BB->begin(), CloneWorklist);
504 // Loop over all of the basic blocks in the old function. If the block was
505 // reachable, we have cloned it and the old block is now in the value map:
506 // insert it into the new function in the right order. If not, ignore it.
508 // Defer PHI resolution until rest of function is resolved.
509 SmallVector<const PHINode*, 16> PHIToResolve;
510 for (Function::const_iterator BI = OldFunc->begin(), BE = OldFunc->end();
513 BasicBlock *NewBB = cast_or_null<BasicBlock>(V);
514 if (!NewBB) continue; // Dead block.
516 // Add the new block to the new function.
517 NewFunc->getBasicBlockList().push_back(NewBB);
519 // Handle PHI nodes specially, as we have to remove references to dead
521 for (BasicBlock::const_iterator I = BI->begin(), E = BI->end(); I != E; ++I)
522 if (const PHINode *PN = dyn_cast<PHINode>(I))
523 PHIToResolve.push_back(PN);
527 // Finally, remap the terminator instructions, as those can't be remapped
528 // until all BBs are mapped.
529 RemapInstruction(NewBB->getTerminator(), VMap,
530 ModuleLevelChanges ? RF_None : RF_NoModuleLevelChanges,
531 TypeMapper, Materializer);
534 // Defer PHI resolution until rest of function is resolved, PHI resolution
535 // requires the CFG to be up-to-date.
536 for (unsigned phino = 0, e = PHIToResolve.size(); phino != e; ) {
537 const PHINode *OPN = PHIToResolve[phino];
538 unsigned NumPreds = OPN->getNumIncomingValues();
539 const BasicBlock *OldBB = OPN->getParent();
540 BasicBlock *NewBB = cast<BasicBlock>(VMap[OldBB]);
542 // Map operands for blocks that are live and remove operands for blocks
544 for (; phino != PHIToResolve.size() &&
545 PHIToResolve[phino]->getParent() == OldBB; ++phino) {
546 OPN = PHIToResolve[phino];
547 PHINode *PN = cast<PHINode>(VMap[OPN]);
548 for (unsigned pred = 0, e = NumPreds; pred != e; ++pred) {
549 Value *V = VMap[PN->getIncomingBlock(pred)];
550 if (BasicBlock *MappedBlock = cast_or_null<BasicBlock>(V)) {
551 Value *InVal = MapValue(PN->getIncomingValue(pred),
553 ModuleLevelChanges ? RF_None : RF_NoModuleLevelChanges);
554 assert(InVal && "Unknown input value?");
555 PN->setIncomingValue(pred, InVal);
556 PN->setIncomingBlock(pred, MappedBlock);
558 PN->removeIncomingValue(pred, false);
559 --pred, --e; // Revisit the next entry.
564 // The loop above has removed PHI entries for those blocks that are dead
565 // and has updated others. However, if a block is live (i.e. copied over)
566 // but its terminator has been changed to not go to this block, then our
567 // phi nodes will have invalid entries. Update the PHI nodes in this
569 PHINode *PN = cast<PHINode>(NewBB->begin());
570 NumPreds = std::distance(pred_begin(NewBB), pred_end(NewBB));
571 if (NumPreds != PN->getNumIncomingValues()) {
572 assert(NumPreds < PN->getNumIncomingValues());
573 // Count how many times each predecessor comes to this block.
574 std::map<BasicBlock*, unsigned> PredCount;
575 for (pred_iterator PI = pred_begin(NewBB), E = pred_end(NewBB);
579 // Figure out how many entries to remove from each PHI.
580 for (unsigned i = 0, e = PN->getNumIncomingValues(); i != e; ++i)
581 ++PredCount[PN->getIncomingBlock(i)];
583 // At this point, the excess predecessor entries are positive in the
584 // map. Loop over all of the PHIs and remove excess predecessor
586 BasicBlock::iterator I = NewBB->begin();
587 for (; (PN = dyn_cast<PHINode>(I)); ++I) {
588 for (std::map<BasicBlock*, unsigned>::iterator PCI =PredCount.begin(),
589 E = PredCount.end(); PCI != E; ++PCI) {
590 BasicBlock *Pred = PCI->first;
591 for (unsigned NumToRemove = PCI->second; NumToRemove; --NumToRemove)
592 PN->removeIncomingValue(Pred, false);
597 // If the loops above have made these phi nodes have 0 or 1 operand,
598 // replace them with undef or the input value. We must do this for
599 // correctness, because 0-operand phis are not valid.
600 PN = cast<PHINode>(NewBB->begin());
601 if (PN->getNumIncomingValues() == 0) {
602 BasicBlock::iterator I = NewBB->begin();
603 BasicBlock::const_iterator OldI = OldBB->begin();
604 while ((PN = dyn_cast<PHINode>(I++))) {
605 Value *NV = UndefValue::get(PN->getType());
606 PN->replaceAllUsesWith(NV);
607 assert(VMap[OldI] == PN && "VMap mismatch");
609 PN->eraseFromParent();
615 // Make a second pass over the PHINodes now that all of them have been
616 // remapped into the new function, simplifying the PHINode and performing any
617 // recursive simplifications exposed. This will transparently update the
618 // WeakVH in the VMap. Notably, we rely on that so that if we coalesce
619 // two PHINodes, the iteration over the old PHIs remains valid, and the
620 // mapping will just map us to the new node (which may not even be a PHI
622 for (unsigned Idx = 0, Size = PHIToResolve.size(); Idx != Size; ++Idx)
623 if (PHINode *PN = dyn_cast<PHINode>(VMap[PHIToResolve[Idx]]))
624 recursivelySimplifyInstruction(PN);
626 // Now that the inlined function body has been fully constructed, go through
627 // and zap unconditional fall-through branches. This happen all the time when
628 // specializing code: code specialization turns conditional branches into
629 // uncond branches, and this code folds them.
630 Function::iterator Begin = cast<BasicBlock>(VMap[StartingBB]);
631 Function::iterator I = Begin;
632 while (I != NewFunc->end()) {
633 // Check if this block has become dead during inlining or other
634 // simplifications. Note that the first block will appear dead, as it has
635 // not yet been wired up properly.
636 if (I != Begin && (pred_begin(I) == pred_end(I) ||
637 I->getSinglePredecessor() == I)) {
638 BasicBlock *DeadBB = I++;
639 DeleteDeadBlock(DeadBB);
643 // We need to simplify conditional branches and switches with a constant
644 // operand. We try to prune these out when cloning, but if the
645 // simplification required looking through PHI nodes, those are only
646 // available after forming the full basic block. That may leave some here,
647 // and we still want to prune the dead code as early as possible.
648 ConstantFoldTerminator(I);
650 BranchInst *BI = dyn_cast<BranchInst>(I->getTerminator());
651 if (!BI || BI->isConditional()) { ++I; continue; }
653 BasicBlock *Dest = BI->getSuccessor(0);
654 if (!Dest->getSinglePredecessor()) {
658 // We shouldn't be able to get single-entry PHI nodes here, as instsimplify
659 // above should have zapped all of them..
660 assert(!isa<PHINode>(Dest->begin()));
662 // We know all single-entry PHI nodes in the inlined function have been
663 // removed, so we just need to splice the blocks.
664 BI->eraseFromParent();
666 // Make all PHI nodes that referred to Dest now refer to I as their source.
667 Dest->replaceAllUsesWith(I);
669 // Move all the instructions in the succ to the pred.
670 I->getInstList().splice(I->end(), Dest->getInstList());
672 // Remove the dest block.
673 Dest->eraseFromParent();
675 // Do not increment I, iteratively merge all things this block branches to.
678 // Make a final pass over the basic blocks from theh old function to gather
679 // any return instructions which survived folding. We have to do this here
680 // because we can iteratively remove and merge returns above.
681 for (Function::iterator I = cast<BasicBlock>(VMap[StartingBB]),
684 if (ReturnInst *RI = dyn_cast<ReturnInst>(I->getTerminator()))
685 Returns.push_back(RI);
689 /// CloneAndPruneFunctionInto - This works exactly like CloneFunctionInto,
690 /// except that it does some simple constant prop and DCE on the fly. The
691 /// effect of this is to copy significantly less code in cases where (for
692 /// example) a function call with constant arguments is inlined, and those
693 /// constant arguments cause a significant amount of code in the callee to be
694 /// dead. Since this doesn't produce an exact copy of the input, it can't be
695 /// used for things like CloneFunction or CloneModule.
696 void llvm::CloneAndPruneFunctionInto(Function *NewFunc, const Function *OldFunc,
697 ValueToValueMapTy &VMap,
698 bool ModuleLevelChanges,
699 SmallVectorImpl<ReturnInst*> &Returns,
700 const char *NameSuffix,
701 ClonedCodeInfo *CodeInfo,
702 Instruction *TheCall) {
703 CloneAndPruneIntoFromInst(NewFunc, OldFunc, OldFunc->front().begin(), VMap,
704 ModuleLevelChanges, Returns, NameSuffix, CodeInfo,