1 //===-- DeadArgumentElimination.cpp - Eliminate dead arguments ------------===//
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 pass deletes dead arguments from internal functions. Dead argument
11 // elimination removes arguments which are directly dead, as well as arguments
12 // only passed into function calls as dead arguments of other functions. This
13 // pass also deletes dead return values in a similar way.
15 // This pass is often useful as a cleanup pass to run after aggressive
16 // interprocedural passes, which add possibly-dead arguments or return values.
18 //===----------------------------------------------------------------------===//
20 #include "llvm/Transforms/IPO/DeadArgumentElimination.h"
21 #include "llvm/ADT/SmallVector.h"
22 #include "llvm/ADT/Statistic.h"
23 #include "llvm/ADT/StringExtras.h"
24 #include "llvm/IR/CallSite.h"
25 #include "llvm/IR/CallingConv.h"
26 #include "llvm/IR/Constant.h"
27 #include "llvm/IR/DIBuilder.h"
28 #include "llvm/IR/DebugInfo.h"
29 #include "llvm/IR/DerivedTypes.h"
30 #include "llvm/IR/Instructions.h"
31 #include "llvm/IR/IntrinsicInst.h"
32 #include "llvm/IR/LLVMContext.h"
33 #include "llvm/IR/Module.h"
34 #include "llvm/Pass.h"
35 #include "llvm/Support/Debug.h"
36 #include "llvm/Support/raw_ostream.h"
37 #include "llvm/Transforms/IPO.h"
38 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
43 #define DEBUG_TYPE "deadargelim"
45 STATISTIC(NumArgumentsEliminated, "Number of unread args removed");
46 STATISTIC(NumRetValsEliminated , "Number of unused return values removed");
47 STATISTIC(NumArgumentsReplacedWithUndef,
48 "Number of unread args replaced with undef");
50 /// DAE - The dead argument elimination pass.
52 class DAE : public ModulePass {
54 // DAH uses this to specify a different ID.
55 explicit DAE(char &ID) : ModulePass(ID) {}
58 static char ID; // Pass identification, replacement for typeid
59 DAE() : ModulePass(ID) {
60 initializeDAEPass(*PassRegistry::getPassRegistry());
63 bool runOnModule(Module &M) override {
66 DeadArgumentEliminationPass DAEP(ShouldHackArguments());
67 ModuleAnalysisManager DummyMAM;
68 PreservedAnalyses PA = DAEP.run(M, DummyMAM);
69 return !PA.areAllPreserved();
72 virtual bool ShouldHackArguments() const { return false; }
78 INITIALIZE_PASS(DAE, "deadargelim", "Dead Argument Elimination", false, false)
81 /// DAH - DeadArgumentHacking pass - Same as dead argument elimination, but
82 /// deletes arguments to functions which are external. This is only for use
84 struct DAH : public DAE {
88 bool ShouldHackArguments() const override { return true; }
93 INITIALIZE_PASS(DAH, "deadarghaX0r",
94 "Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)",
97 /// createDeadArgEliminationPass - This pass removes arguments from functions
98 /// which are not used by the body of the function.
100 ModulePass *llvm::createDeadArgEliminationPass() { return new DAE(); }
101 ModulePass *llvm::createDeadArgHackingPass() { return new DAH(); }
103 /// DeleteDeadVarargs - If this is an function that takes a ... list, and if
104 /// llvm.vastart is never called, the varargs list is dead for the function.
105 bool DeadArgumentEliminationPass::DeleteDeadVarargs(Function &Fn) {
106 assert(Fn.getFunctionType()->isVarArg() && "Function isn't varargs!");
107 if (Fn.isDeclaration() || !Fn.hasLocalLinkage()) return false;
109 // Ensure that the function is only directly called.
110 if (Fn.hasAddressTaken())
113 // Don't touch naked functions. The assembly might be using an argument, or
114 // otherwise rely on the frame layout in a way that this analysis will not
116 if (Fn.hasFnAttribute(Attribute::Naked)) {
120 // Okay, we know we can transform this function if safe. Scan its body
121 // looking for calls marked musttail or calls to llvm.vastart.
122 for (BasicBlock &BB : Fn) {
123 for (Instruction &I : BB) {
124 CallInst *CI = dyn_cast<CallInst>(&I);
127 if (CI->isMustTailCall())
129 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(CI)) {
130 if (II->getIntrinsicID() == Intrinsic::vastart)
136 // If we get here, there are no calls to llvm.vastart in the function body,
137 // remove the "..." and adjust all the calls.
139 // Start by computing a new prototype for the function, which is the same as
140 // the old function, but doesn't have isVarArg set.
141 FunctionType *FTy = Fn.getFunctionType();
143 std::vector<Type*> Params(FTy->param_begin(), FTy->param_end());
144 FunctionType *NFTy = FunctionType::get(FTy->getReturnType(),
146 unsigned NumArgs = Params.size();
148 // Create the new function body and insert it into the module...
149 Function *NF = Function::Create(NFTy, Fn.getLinkage());
150 NF->copyAttributesFrom(&Fn);
151 NF->setComdat(Fn.getComdat());
152 Fn.getParent()->getFunctionList().insert(Fn.getIterator(), NF);
155 // Loop over all of the callers of the function, transforming the call sites
156 // to pass in a smaller number of arguments into the new function.
158 std::vector<Value*> Args;
159 for (Value::user_iterator I = Fn.user_begin(), E = Fn.user_end(); I != E; ) {
163 Instruction *Call = CS.getInstruction();
165 // Pass all the same arguments.
166 Args.assign(CS.arg_begin(), CS.arg_begin() + NumArgs);
168 // Drop any attributes that were on the vararg arguments.
169 AttributeList PAL = CS.getAttributes();
170 if (!PAL.isEmpty()) {
171 SmallVector<AttributeSet, 8> ArgAttrs;
172 for (unsigned ArgNo = 0; ArgNo < NumArgs; ++ArgNo)
173 ArgAttrs.push_back(PAL.getParamAttributes(ArgNo));
174 PAL = AttributeList::get(Fn.getContext(), PAL.getFnAttributes(),
175 PAL.getRetAttributes(), ArgAttrs);
178 SmallVector<OperandBundleDef, 1> OpBundles;
179 CS.getOperandBundlesAsDefs(OpBundles);
182 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
183 NewCS = InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
184 Args, OpBundles, "", Call);
186 NewCS = CallInst::Create(NF, Args, OpBundles, "", Call);
187 cast<CallInst>(NewCS.getInstruction())
188 ->setTailCallKind(cast<CallInst>(Call)->getTailCallKind());
190 NewCS.setCallingConv(CS.getCallingConv());
191 NewCS.setAttributes(PAL);
192 NewCS->setDebugLoc(Call->getDebugLoc());
194 if (Call->extractProfTotalWeight(W))
195 NewCS->setProfWeight(W);
199 if (!Call->use_empty())
200 Call->replaceAllUsesWith(NewCS.getInstruction());
202 NewCS->takeName(Call);
204 // Finally, remove the old call from the program, reducing the use-count of
206 Call->eraseFromParent();
209 // Since we have now created the new function, splice the body of the old
210 // function right into the new function, leaving the old rotting hulk of the
212 NF->getBasicBlockList().splice(NF->begin(), Fn.getBasicBlockList());
214 // Loop over the argument list, transferring uses of the old arguments over to
215 // the new arguments, also transferring over the names as well. While we're at
216 // it, remove the dead arguments from the DeadArguments list.
218 for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(),
219 I2 = NF->arg_begin(); I != E; ++I, ++I2) {
220 // Move the name and users over to the new version.
221 I->replaceAllUsesWith(&*I2);
225 // Patch the pointer to LLVM function in debug info descriptor.
226 NF->setSubprogram(Fn.getSubprogram());
228 // Fix up any BlockAddresses that refer to the function.
229 Fn.replaceAllUsesWith(ConstantExpr::getBitCast(NF, Fn.getType()));
230 // Delete the bitcast that we just created, so that NF does not
231 // appear to be address-taken.
232 NF->removeDeadConstantUsers();
233 // Finally, nuke the old function.
234 Fn.eraseFromParent();
238 /// RemoveDeadArgumentsFromCallers - Checks if the given function has any
239 /// arguments that are unused, and changes the caller parameters to be undefined
241 bool DeadArgumentEliminationPass::RemoveDeadArgumentsFromCallers(Function &Fn) {
242 // We cannot change the arguments if this TU does not define the function or
243 // if the linker may choose a function body from another TU, even if the
244 // nominal linkage indicates that other copies of the function have the same
245 // semantics. In the below example, the dead load from %p may not have been
246 // eliminated from the linker-chosen copy of f, so replacing %p with undef
247 // in callers may introduce undefined behavior.
249 // define linkonce_odr void @f(i32* %p) {
253 if (!Fn.hasExactDefinition())
256 // Functions with local linkage should already have been handled, except the
257 // fragile (variadic) ones which we can improve here.
258 if (Fn.hasLocalLinkage() && !Fn.getFunctionType()->isVarArg())
261 // Don't touch naked functions. The assembly might be using an argument, or
262 // otherwise rely on the frame layout in a way that this analysis will not
264 if (Fn.hasFnAttribute(Attribute::Naked))
270 SmallVector<unsigned, 8> UnusedArgs;
271 for (Argument &Arg : Fn.args()) {
272 if (!Arg.hasSwiftErrorAttr() && Arg.use_empty() && !Arg.hasByValOrInAllocaAttr())
273 UnusedArgs.push_back(Arg.getArgNo());
276 if (UnusedArgs.empty())
279 bool Changed = false;
281 for (Use &U : Fn.uses()) {
282 CallSite CS(U.getUser());
283 if (!CS || !CS.isCallee(&U))
286 // Now go through all unused args and replace them with "undef".
287 for (unsigned I = 0, E = UnusedArgs.size(); I != E; ++I) {
288 unsigned ArgNo = UnusedArgs[I];
290 Value *Arg = CS.getArgument(ArgNo);
291 CS.setArgument(ArgNo, UndefValue::get(Arg->getType()));
292 ++NumArgumentsReplacedWithUndef;
300 /// Convenience function that returns the number of return values. It returns 0
301 /// for void functions and 1 for functions not returning a struct. It returns
302 /// the number of struct elements for functions returning a struct.
303 static unsigned NumRetVals(const Function *F) {
304 Type *RetTy = F->getReturnType();
305 if (RetTy->isVoidTy())
307 else if (StructType *STy = dyn_cast<StructType>(RetTy))
308 return STy->getNumElements();
309 else if (ArrayType *ATy = dyn_cast<ArrayType>(RetTy))
310 return ATy->getNumElements();
315 /// Returns the sub-type a function will return at a given Idx. Should
316 /// correspond to the result type of an ExtractValue instruction executed with
317 /// just that one Idx (i.e. only top-level structure is considered).
318 static Type *getRetComponentType(const Function *F, unsigned Idx) {
319 Type *RetTy = F->getReturnType();
320 assert(!RetTy->isVoidTy() && "void type has no subtype");
322 if (StructType *STy = dyn_cast<StructType>(RetTy))
323 return STy->getElementType(Idx);
324 else if (ArrayType *ATy = dyn_cast<ArrayType>(RetTy))
325 return ATy->getElementType();
330 /// MarkIfNotLive - This checks Use for liveness in LiveValues. If Use is not
331 /// live, it adds Use to the MaybeLiveUses argument. Returns the determined
333 DeadArgumentEliminationPass::Liveness
334 DeadArgumentEliminationPass::MarkIfNotLive(RetOrArg Use,
335 UseVector &MaybeLiveUses) {
336 // We're live if our use or its Function is already marked as live.
337 if (LiveFunctions.count(Use.F) || LiveValues.count(Use))
340 // We're maybe live otherwise, but remember that we must become live if
342 MaybeLiveUses.push_back(Use);
347 /// SurveyUse - This looks at a single use of an argument or return value
348 /// and determines if it should be alive or not. Adds this use to MaybeLiveUses
349 /// if it causes the used value to become MaybeLive.
351 /// RetValNum is the return value number to use when this use is used in a
352 /// return instruction. This is used in the recursion, you should always leave
354 DeadArgumentEliminationPass::Liveness
355 DeadArgumentEliminationPass::SurveyUse(const Use *U, UseVector &MaybeLiveUses,
356 unsigned RetValNum) {
357 const User *V = U->getUser();
358 if (const ReturnInst *RI = dyn_cast<ReturnInst>(V)) {
359 // The value is returned from a function. It's only live when the
360 // function's return value is live. We use RetValNum here, for the case
361 // that U is really a use of an insertvalue instruction that uses the
363 const Function *F = RI->getParent()->getParent();
364 if (RetValNum != -1U) {
365 RetOrArg Use = CreateRet(F, RetValNum);
366 // We might be live, depending on the liveness of Use.
367 return MarkIfNotLive(Use, MaybeLiveUses);
369 DeadArgumentEliminationPass::Liveness Result = MaybeLive;
370 for (unsigned i = 0; i < NumRetVals(F); ++i) {
371 RetOrArg Use = CreateRet(F, i);
372 // We might be live, depending on the liveness of Use. If any
373 // sub-value is live, then the entire value is considered live. This
374 // is a conservative choice, and better tracking is possible.
375 DeadArgumentEliminationPass::Liveness SubResult =
376 MarkIfNotLive(Use, MaybeLiveUses);
383 if (const InsertValueInst *IV = dyn_cast<InsertValueInst>(V)) {
384 if (U->getOperandNo() != InsertValueInst::getAggregateOperandIndex()
386 // The use we are examining is inserted into an aggregate. Our liveness
387 // depends on all uses of that aggregate, but if it is used as a return
388 // value, only index at which we were inserted counts.
389 RetValNum = *IV->idx_begin();
391 // Note that if we are used as the aggregate operand to the insertvalue,
392 // we don't change RetValNum, but do survey all our uses.
394 Liveness Result = MaybeLive;
395 for (const Use &UU : IV->uses()) {
396 Result = SurveyUse(&UU, MaybeLiveUses, RetValNum);
403 if (auto CS = ImmutableCallSite(V)) {
404 const Function *F = CS.getCalledFunction();
406 // Used in a direct call.
408 // The function argument is live if it is used as a bundle operand.
409 if (CS.isBundleOperand(U))
412 // Find the argument number. We know for sure that this use is an
413 // argument, since if it was the function argument this would be an
414 // indirect call and the we know can't be looking at a value of the
415 // label type (for the invoke instruction).
416 unsigned ArgNo = CS.getArgumentNo(U);
418 if (ArgNo >= F->getFunctionType()->getNumParams())
419 // The value is passed in through a vararg! Must be live.
422 assert(CS.getArgument(ArgNo)
423 == CS->getOperand(U->getOperandNo())
424 && "Argument is not where we expected it");
426 // Value passed to a normal call. It's only live when the corresponding
427 // argument to the called function turns out live.
428 RetOrArg Use = CreateArg(F, ArgNo);
429 return MarkIfNotLive(Use, MaybeLiveUses);
432 // Used in any other way? Value must be live.
436 /// SurveyUses - This looks at all the uses of the given value
437 /// Returns the Liveness deduced from the uses of this value.
439 /// Adds all uses that cause the result to be MaybeLive to MaybeLiveRetUses. If
440 /// the result is Live, MaybeLiveUses might be modified but its content should
441 /// be ignored (since it might not be complete).
442 DeadArgumentEliminationPass::Liveness
443 DeadArgumentEliminationPass::SurveyUses(const Value *V,
444 UseVector &MaybeLiveUses) {
445 // Assume it's dead (which will only hold if there are no uses at all..).
446 Liveness Result = MaybeLive;
448 for (const Use &U : V->uses()) {
449 Result = SurveyUse(&U, MaybeLiveUses);
456 // SurveyFunction - This performs the initial survey of the specified function,
457 // checking out whether or not it uses any of its incoming arguments or whether
458 // any callers use the return value. This fills in the LiveValues set and Uses
461 // We consider arguments of non-internal functions to be intrinsically alive as
462 // well as arguments to functions which have their "address taken".
464 void DeadArgumentEliminationPass::SurveyFunction(const Function &F) {
465 // Functions with inalloca parameters are expecting args in a particular
466 // register and memory layout.
467 if (F.getAttributes().hasAttrSomewhere(Attribute::InAlloca)) {
472 // Don't touch naked functions. The assembly might be using an argument, or
473 // otherwise rely on the frame layout in a way that this analysis will not
475 if (F.hasFnAttribute(Attribute::Naked)) {
480 unsigned RetCount = NumRetVals(&F);
481 // Assume all return values are dead
482 typedef SmallVector<Liveness, 5> RetVals;
483 RetVals RetValLiveness(RetCount, MaybeLive);
485 typedef SmallVector<UseVector, 5> RetUses;
486 // These vectors map each return value to the uses that make it MaybeLive, so
487 // we can add those to the Uses map if the return value really turns out to be
488 // MaybeLive. Initialized to a list of RetCount empty lists.
489 RetUses MaybeLiveRetUses(RetCount);
491 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
492 if (const ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator()))
493 if (RI->getNumOperands() != 0 && RI->getOperand(0)->getType()
494 != F.getFunctionType()->getReturnType()) {
495 // We don't support old style multiple return values.
500 if (!F.hasLocalLinkage() && (!ShouldHackArguments || F.isIntrinsic())) {
505 DEBUG(dbgs() << "DeadArgumentEliminationPass - Inspecting callers for fn: "
506 << F.getName() << "\n");
507 // Keep track of the number of live retvals, so we can skip checks once all
508 // of them turn out to be live.
509 unsigned NumLiveRetVals = 0;
510 // Loop all uses of the function.
511 for (const Use &U : F.uses()) {
512 // If the function is PASSED IN as an argument, its address has been
514 ImmutableCallSite CS(U.getUser());
515 if (!CS || !CS.isCallee(&U)) {
520 // If this use is anything other than a call site, the function is alive.
521 const Instruction *TheCall = CS.getInstruction();
522 if (!TheCall) { // Not a direct call site?
527 // If we end up here, we are looking at a direct call to our function.
529 // Now, check how our return value(s) is/are used in this caller. Don't
530 // bother checking return values if all of them are live already.
531 if (NumLiveRetVals == RetCount)
534 // Check all uses of the return value.
535 for (const Use &U : TheCall->uses()) {
536 if (ExtractValueInst *Ext = dyn_cast<ExtractValueInst>(U.getUser())) {
537 // This use uses a part of our return value, survey the uses of
538 // that part and store the results for this index only.
539 unsigned Idx = *Ext->idx_begin();
540 if (RetValLiveness[Idx] != Live) {
541 RetValLiveness[Idx] = SurveyUses(Ext, MaybeLiveRetUses[Idx]);
542 if (RetValLiveness[Idx] == Live)
546 // Used by something else than extractvalue. Survey, but assume that the
547 // result applies to all sub-values.
548 UseVector MaybeLiveAggregateUses;
549 if (SurveyUse(&U, MaybeLiveAggregateUses) == Live) {
550 NumLiveRetVals = RetCount;
551 RetValLiveness.assign(RetCount, Live);
554 for (unsigned i = 0; i != RetCount; ++i) {
555 if (RetValLiveness[i] != Live)
556 MaybeLiveRetUses[i].append(MaybeLiveAggregateUses.begin(),
557 MaybeLiveAggregateUses.end());
564 // Now we've inspected all callers, record the liveness of our return values.
565 for (unsigned i = 0; i != RetCount; ++i)
566 MarkValue(CreateRet(&F, i), RetValLiveness[i], MaybeLiveRetUses[i]);
568 DEBUG(dbgs() << "DeadArgumentEliminationPass - Inspecting args for fn: "
569 << F.getName() << "\n");
571 // Now, check all of our arguments.
573 UseVector MaybeLiveArgUses;
574 for (Function::const_arg_iterator AI = F.arg_begin(),
575 E = F.arg_end(); AI != E; ++AI, ++i) {
577 if (F.getFunctionType()->isVarArg()) {
578 // Variadic functions will already have a va_arg function expanded inside
579 // them, making them potentially very sensitive to ABI changes resulting
580 // from removing arguments entirely, so don't. For example AArch64 handles
581 // register and stack HFAs very differently, and this is reflected in the
582 // IR which has already been generated.
585 // See what the effect of this use is (recording any uses that cause
586 // MaybeLive in MaybeLiveArgUses).
587 Result = SurveyUses(&*AI, MaybeLiveArgUses);
591 MarkValue(CreateArg(&F, i), Result, MaybeLiveArgUses);
592 // Clear the vector again for the next iteration.
593 MaybeLiveArgUses.clear();
597 /// MarkValue - This function marks the liveness of RA depending on L. If L is
598 /// MaybeLive, it also takes all uses in MaybeLiveUses and records them in Uses,
599 /// such that RA will be marked live if any use in MaybeLiveUses gets marked
601 void DeadArgumentEliminationPass::MarkValue(const RetOrArg &RA, Liveness L,
602 const UseVector &MaybeLiveUses) {
604 case Live: MarkLive(RA); break;
607 // Note any uses of this value, so this return value can be
608 // marked live whenever one of the uses becomes live.
609 for (const auto &MaybeLiveUse : MaybeLiveUses)
610 Uses.insert(std::make_pair(MaybeLiveUse, RA));
616 /// MarkLive - Mark the given Function as alive, meaning that it cannot be
617 /// changed in any way. Additionally,
618 /// mark any values that are used as this function's parameters or by its return
619 /// values (according to Uses) live as well.
620 void DeadArgumentEliminationPass::MarkLive(const Function &F) {
621 DEBUG(dbgs() << "DeadArgumentEliminationPass - Intrinsically live fn: "
622 << F.getName() << "\n");
623 // Mark the function as live.
624 LiveFunctions.insert(&F);
625 // Mark all arguments as live.
626 for (unsigned i = 0, e = F.arg_size(); i != e; ++i)
627 PropagateLiveness(CreateArg(&F, i));
628 // Mark all return values as live.
629 for (unsigned i = 0, e = NumRetVals(&F); i != e; ++i)
630 PropagateLiveness(CreateRet(&F, i));
633 /// MarkLive - Mark the given return value or argument as live. Additionally,
634 /// mark any values that are used by this value (according to Uses) live as
636 void DeadArgumentEliminationPass::MarkLive(const RetOrArg &RA) {
637 if (LiveFunctions.count(RA.F))
638 return; // Function was already marked Live.
640 if (!LiveValues.insert(RA).second)
641 return; // We were already marked Live.
643 DEBUG(dbgs() << "DeadArgumentEliminationPass - Marking "
644 << RA.getDescription() << " live\n");
645 PropagateLiveness(RA);
648 /// PropagateLiveness - Given that RA is a live value, propagate it's liveness
649 /// to any other values it uses (according to Uses).
650 void DeadArgumentEliminationPass::PropagateLiveness(const RetOrArg &RA) {
651 // We don't use upper_bound (or equal_range) here, because our recursive call
652 // to ourselves is likely to cause the upper_bound (which is the first value
653 // not belonging to RA) to become erased and the iterator invalidated.
654 UseMap::iterator Begin = Uses.lower_bound(RA);
655 UseMap::iterator E = Uses.end();
657 for (I = Begin; I != E && I->first == RA; ++I)
660 // Erase RA from the Uses map (from the lower bound to wherever we ended up
662 Uses.erase(Begin, I);
665 // RemoveDeadStuffFromFunction - Remove any arguments and return values from F
666 // that are not in LiveValues. Transform the function and all of the callees of
667 // the function to not have these arguments and return values.
669 bool DeadArgumentEliminationPass::RemoveDeadStuffFromFunction(Function *F) {
670 // Don't modify fully live functions
671 if (LiveFunctions.count(F))
674 // Start by computing a new prototype for the function, which is the same as
675 // the old function, but has fewer arguments and a different return type.
676 FunctionType *FTy = F->getFunctionType();
677 std::vector<Type*> Params;
679 // Keep track of if we have a live 'returned' argument
680 bool HasLiveReturnedArg = false;
682 // Set up to build a new list of parameter attributes.
683 SmallVector<AttributeSet, 8> ArgAttrVec;
684 const AttributeList &PAL = F->getAttributes();
686 // Remember which arguments are still alive.
687 SmallVector<bool, 10> ArgAlive(FTy->getNumParams(), false);
688 // Construct the new parameter list from non-dead arguments. Also construct
689 // a new set of parameter attributes to correspond. Skip the first parameter
690 // attribute, since that belongs to the return value.
692 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end();
694 RetOrArg Arg = CreateArg(F, i);
695 if (LiveValues.erase(Arg)) {
696 Params.push_back(I->getType());
698 ArgAttrVec.push_back(PAL.getParamAttributes(i));
699 HasLiveReturnedArg |= PAL.hasParamAttribute(i, Attribute::Returned);
701 ++NumArgumentsEliminated;
702 DEBUG(dbgs() << "DeadArgumentEliminationPass - Removing argument " << i
703 << " (" << I->getName() << ") from " << F->getName()
708 // Find out the new return value.
709 Type *RetTy = FTy->getReturnType();
710 Type *NRetTy = nullptr;
711 unsigned RetCount = NumRetVals(F);
713 // -1 means unused, other numbers are the new index
714 SmallVector<int, 5> NewRetIdxs(RetCount, -1);
715 std::vector<Type*> RetTypes;
717 // If there is a function with a live 'returned' argument but a dead return
718 // value, then there are two possible actions:
719 // 1) Eliminate the return value and take off the 'returned' attribute on the
721 // 2) Retain the 'returned' attribute and treat the return value (but not the
722 // entire function) as live so that it is not eliminated.
724 // It's not clear in the general case which option is more profitable because,
725 // even in the absence of explicit uses of the return value, code generation
726 // is free to use the 'returned' attribute to do things like eliding
727 // save/restores of registers across calls. Whether or not this happens is
728 // target and ABI-specific as well as depending on the amount of register
729 // pressure, so there's no good way for an IR-level pass to figure this out.
731 // Fortunately, the only places where 'returned' is currently generated by
732 // the FE are places where 'returned' is basically free and almost always a
733 // performance win, so the second option can just be used always for now.
735 // This should be revisited if 'returned' is ever applied more liberally.
736 if (RetTy->isVoidTy() || HasLiveReturnedArg) {
739 // Look at each of the original return values individually.
740 for (unsigned i = 0; i != RetCount; ++i) {
741 RetOrArg Ret = CreateRet(F, i);
742 if (LiveValues.erase(Ret)) {
743 RetTypes.push_back(getRetComponentType(F, i));
744 NewRetIdxs[i] = RetTypes.size() - 1;
746 ++NumRetValsEliminated;
747 DEBUG(dbgs() << "DeadArgumentEliminationPass - Removing return value "
748 << i << " from " << F->getName() << "\n");
751 if (RetTypes.size() > 1) {
752 // More than one return type? Reduce it down to size.
753 if (StructType *STy = dyn_cast<StructType>(RetTy)) {
754 // Make the new struct packed if we used to return a packed struct
756 NRetTy = StructType::get(STy->getContext(), RetTypes, STy->isPacked());
758 assert(isa<ArrayType>(RetTy) && "unexpected multi-value return");
759 NRetTy = ArrayType::get(RetTypes[0], RetTypes.size());
761 } else if (RetTypes.size() == 1)
762 // One return type? Just a simple value then, but only if we didn't use to
763 // return a struct with that simple value before.
764 NRetTy = RetTypes.front();
765 else if (RetTypes.size() == 0)
766 // No return types? Make it void, but only if we didn't use to return {}.
767 NRetTy = Type::getVoidTy(F->getContext());
770 assert(NRetTy && "No new return type found?");
772 // The existing function return attributes.
773 AttrBuilder RAttrs(PAL.getRetAttributes());
775 // Remove any incompatible attributes, but only if we removed all return
776 // values. Otherwise, ensure that we don't have any conflicting attributes
777 // here. Currently, this should not be possible, but special handling might be
778 // required when new return value attributes are added.
779 if (NRetTy->isVoidTy())
780 RAttrs.remove(AttributeFuncs::typeIncompatible(NRetTy));
782 assert(!RAttrs.overlaps(AttributeFuncs::typeIncompatible(NRetTy)) &&
783 "Return attributes no longer compatible?");
785 AttributeSet RetAttrs = AttributeSet::get(F->getContext(), RAttrs);
787 // Reconstruct the AttributesList based on the vector we constructed.
788 assert(ArgAttrVec.size() == Params.size());
789 AttributeList NewPAL = AttributeList::get(
790 F->getContext(), PAL.getFnAttributes(), RetAttrs, ArgAttrVec);
792 // Create the new function type based on the recomputed parameters.
793 FunctionType *NFTy = FunctionType::get(NRetTy, Params, FTy->isVarArg());
799 // Create the new function body and insert it into the module...
800 Function *NF = Function::Create(NFTy, F->getLinkage());
801 NF->copyAttributesFrom(F);
802 NF->setComdat(F->getComdat());
803 NF->setAttributes(NewPAL);
804 // Insert the new function before the old function, so we won't be processing
806 F->getParent()->getFunctionList().insert(F->getIterator(), NF);
809 // Loop over all of the callers of the function, transforming the call sites
810 // to pass in a smaller number of arguments into the new function.
812 std::vector<Value*> Args;
813 while (!F->use_empty()) {
814 CallSite CS(F->user_back());
815 Instruction *Call = CS.getInstruction();
818 const AttributeList &CallPAL = CS.getAttributes();
820 // Adjust the call return attributes in case the function was changed to
822 AttrBuilder RAttrs(CallPAL.getRetAttributes());
823 RAttrs.remove(AttributeFuncs::typeIncompatible(NRetTy));
824 AttributeSet RetAttrs = AttributeSet::get(F->getContext(), RAttrs);
826 // Declare these outside of the loops, so we can reuse them for the second
827 // loop, which loops the varargs.
828 CallSite::arg_iterator I = CS.arg_begin();
830 // Loop over those operands, corresponding to the normal arguments to the
831 // original function, and add those that are still alive.
832 for (unsigned e = FTy->getNumParams(); i != e; ++I, ++i)
835 // Get original parameter attributes, but skip return attributes.
836 AttributeSet Attrs = CallPAL.getParamAttributes(i);
837 if (NRetTy != RetTy && Attrs.hasAttribute(Attribute::Returned)) {
838 // If the return type has changed, then get rid of 'returned' on the
839 // call site. The alternative is to make all 'returned' attributes on
840 // call sites keep the return value alive just like 'returned'
841 // attributes on function declaration but it's less clearly a win and
842 // this is not an expected case anyway
843 ArgAttrVec.push_back(AttributeSet::get(
845 AttrBuilder(Attrs).removeAttribute(Attribute::Returned)));
847 // Otherwise, use the original attributes.
848 ArgAttrVec.push_back(Attrs);
852 // Push any varargs arguments on the list. Don't forget their attributes.
853 for (CallSite::arg_iterator E = CS.arg_end(); I != E; ++I, ++i) {
855 ArgAttrVec.push_back(CallPAL.getParamAttributes(i));
858 // Reconstruct the AttributesList based on the vector we constructed.
859 assert(ArgAttrVec.size() == Args.size());
860 AttributeList NewCallPAL = AttributeList::get(
861 F->getContext(), CallPAL.getFnAttributes(), RetAttrs, ArgAttrVec);
863 SmallVector<OperandBundleDef, 1> OpBundles;
864 CS.getOperandBundlesAsDefs(OpBundles);
867 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
868 NewCS = InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
869 Args, OpBundles, "", Call->getParent());
871 NewCS = CallInst::Create(NF, Args, OpBundles, "", Call);
872 cast<CallInst>(NewCS.getInstruction())
873 ->setTailCallKind(cast<CallInst>(Call)->getTailCallKind());
875 NewCS.setCallingConv(CS.getCallingConv());
876 NewCS.setAttributes(NewCallPAL);
877 NewCS->setDebugLoc(Call->getDebugLoc());
879 if (Call->extractProfTotalWeight(W))
880 NewCS->setProfWeight(W);
884 Instruction *New = NewCS.getInstruction();
885 if (!Call->use_empty()) {
886 if (New->getType() == Call->getType()) {
887 // Return type not changed? Just replace users then.
888 Call->replaceAllUsesWith(New);
890 } else if (New->getType()->isVoidTy()) {
891 // Our return value has uses, but they will get removed later on.
892 // Replace by null for now.
893 if (!Call->getType()->isX86_MMXTy())
894 Call->replaceAllUsesWith(Constant::getNullValue(Call->getType()));
896 assert((RetTy->isStructTy() || RetTy->isArrayTy()) &&
897 "Return type changed, but not into a void. The old return type"
898 " must have been a struct or an array!");
899 Instruction *InsertPt = Call;
900 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
901 BasicBlock *NewEdge = SplitEdge(New->getParent(), II->getNormalDest());
902 InsertPt = &*NewEdge->getFirstInsertionPt();
905 // We used to return a struct or array. Instead of doing smart stuff
906 // with all the uses, we will just rebuild it using extract/insertvalue
907 // chaining and let instcombine clean that up.
909 // Start out building up our return value from undef
910 Value *RetVal = UndefValue::get(RetTy);
911 for (unsigned i = 0; i != RetCount; ++i)
912 if (NewRetIdxs[i] != -1) {
914 if (RetTypes.size() > 1)
915 // We are still returning a struct, so extract the value from our
917 V = ExtractValueInst::Create(New, NewRetIdxs[i], "newret",
920 // We are now returning a single element, so just insert that
922 // Insert the value at the old position
923 RetVal = InsertValueInst::Create(RetVal, V, i, "oldret", InsertPt);
925 // Now, replace all uses of the old call instruction with the return
927 Call->replaceAllUsesWith(RetVal);
932 // Finally, remove the old call from the program, reducing the use-count of
934 Call->eraseFromParent();
937 // Since we have now created the new function, splice the body of the old
938 // function right into the new function, leaving the old rotting hulk of the
940 NF->getBasicBlockList().splice(NF->begin(), F->getBasicBlockList());
942 // Loop over the argument list, transferring uses of the old arguments over to
943 // the new arguments, also transferring over the names as well.
945 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(),
946 I2 = NF->arg_begin(); I != E; ++I, ++i)
948 // If this is a live argument, move the name and users over to the new
950 I->replaceAllUsesWith(&*I2);
954 // If this argument is dead, replace any uses of it with null constants
955 // (these are guaranteed to become unused later on).
956 if (!I->getType()->isX86_MMXTy())
957 I->replaceAllUsesWith(Constant::getNullValue(I->getType()));
960 // If we change the return value of the function we must rewrite any return
961 // instructions. Check this now.
962 if (F->getReturnType() != NF->getReturnType())
963 for (BasicBlock &BB : *NF)
964 if (ReturnInst *RI = dyn_cast<ReturnInst>(BB.getTerminator())) {
967 if (NFTy->getReturnType()->isVoidTy()) {
970 assert(RetTy->isStructTy() || RetTy->isArrayTy());
971 // The original return value was a struct or array, insert
972 // extractvalue/insertvalue chains to extract only the values we need
973 // to return and insert them into our new result.
974 // This does generate messy code, but we'll let it to instcombine to
976 Value *OldRet = RI->getOperand(0);
977 // Start out building up our return value from undef
978 RetVal = UndefValue::get(NRetTy);
979 for (unsigned i = 0; i != RetCount; ++i)
980 if (NewRetIdxs[i] != -1) {
981 ExtractValueInst *EV = ExtractValueInst::Create(OldRet, i,
983 if (RetTypes.size() > 1) {
984 // We're still returning a struct, so reinsert the value into
985 // our new return value at the new index
987 RetVal = InsertValueInst::Create(RetVal, EV, NewRetIdxs[i],
990 // We are now only returning a simple value, so just return the
996 // Replace the return instruction with one returning the new return
997 // value (possibly 0 if we became void).
998 ReturnInst::Create(F->getContext(), RetVal, RI);
999 BB.getInstList().erase(RI);
1002 // Patch the pointer to LLVM function in debug info descriptor.
1003 NF->setSubprogram(F->getSubprogram());
1005 // Now that the old function is dead, delete it.
1006 F->eraseFromParent();
1011 PreservedAnalyses DeadArgumentEliminationPass::run(Module &M,
1012 ModuleAnalysisManager &) {
1013 bool Changed = false;
1015 // First pass: Do a simple check to see if any functions can have their "..."
1016 // removed. We can do this if they never call va_start. This loop cannot be
1017 // fused with the next loop, because deleting a function invalidates
1018 // information computed while surveying other functions.
1019 DEBUG(dbgs() << "DeadArgumentEliminationPass - Deleting dead varargs\n");
1020 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) {
1022 if (F.getFunctionType()->isVarArg())
1023 Changed |= DeleteDeadVarargs(F);
1026 // Second phase:loop through the module, determining which arguments are live.
1027 // We assume all arguments are dead unless proven otherwise (allowing us to
1028 // determine that dead arguments passed into recursive functions are dead).
1030 DEBUG(dbgs() << "DeadArgumentEliminationPass - Determining liveness\n");
1034 // Now, remove all dead arguments and return values from each function in
1036 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) {
1037 // Increment now, because the function will probably get removed (ie.
1038 // replaced by a new one).
1039 Function *F = &*I++;
1040 Changed |= RemoveDeadStuffFromFunction(F);
1043 // Finally, look for any unused parameters in functions with non-local
1044 // linkage and replace the passed in parameters with undef.
1046 Changed |= RemoveDeadArgumentsFromCallers(F);
1049 return PreservedAnalyses::all();
1050 return PreservedAnalyses::none();