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.h"
21 #include "llvm/ADT/DenseMap.h"
22 #include "llvm/ADT/SmallVector.h"
23 #include "llvm/ADT/Statistic.h"
24 #include "llvm/ADT/StringExtras.h"
25 #include "llvm/IR/CallSite.h"
26 #include "llvm/IR/CallingConv.h"
27 #include "llvm/IR/Constant.h"
28 #include "llvm/IR/DIBuilder.h"
29 #include "llvm/IR/DebugInfo.h"
30 #include "llvm/IR/DerivedTypes.h"
31 #include "llvm/IR/Instructions.h"
32 #include "llvm/IR/IntrinsicInst.h"
33 #include "llvm/IR/LLVMContext.h"
34 #include "llvm/IR/Module.h"
35 #include "llvm/Pass.h"
36 #include "llvm/Support/Debug.h"
37 #include "llvm/Support/raw_ostream.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 {
55 /// Struct that represents (part of) either a return value or a function
56 /// argument. Used so that arguments and return values can be used
59 RetOrArg(const Function *F, unsigned Idx, bool IsArg) : F(F), Idx(Idx),
65 /// Make RetOrArg comparable, so we can put it into a map.
66 bool operator<(const RetOrArg &O) const {
67 return std::tie(F, Idx, IsArg) < std::tie(O.F, O.Idx, O.IsArg);
70 /// Make RetOrArg comparable, so we can easily iterate the multimap.
71 bool operator==(const RetOrArg &O) const {
72 return F == O.F && Idx == O.Idx && IsArg == O.IsArg;
75 std::string getDescription() const {
76 return std::string((IsArg ? "Argument #" : "Return value #"))
77 + utostr(Idx) + " of function " + F->getName().str();
81 /// Liveness enum - During our initial pass over the program, we determine
82 /// that things are either alive or maybe alive. We don't mark anything
83 /// explicitly dead (even if we know they are), since anything not alive
84 /// with no registered uses (in Uses) will never be marked alive and will
85 /// thus become dead in the end.
86 enum Liveness { Live, MaybeLive };
88 /// Convenience wrapper
89 RetOrArg CreateRet(const Function *F, unsigned Idx) {
90 return RetOrArg(F, Idx, false);
92 /// Convenience wrapper
93 RetOrArg CreateArg(const Function *F, unsigned Idx) {
94 return RetOrArg(F, Idx, true);
97 typedef std::multimap<RetOrArg, RetOrArg> UseMap;
98 /// This maps a return value or argument to any MaybeLive return values or
99 /// arguments it uses. This allows the MaybeLive values to be marked live
100 /// when any of its users is marked live.
101 /// For example (indices are left out for clarity):
102 /// - Uses[ret F] = ret G
103 /// This means that F calls G, and F returns the value returned by G.
104 /// - Uses[arg F] = ret G
105 /// This means that some function calls G and passes its result as an
107 /// - Uses[ret F] = arg F
108 /// This means that F returns one of its own arguments.
109 /// - Uses[arg F] = arg G
110 /// This means that G calls F and passes one of its own (G's) arguments
114 typedef std::set<RetOrArg> LiveSet;
115 typedef std::set<const Function*> LiveFuncSet;
117 /// This set contains all values that have been determined to be live.
119 /// This set contains all values that are cannot be changed in any way.
120 LiveFuncSet LiveFunctions;
122 typedef SmallVector<RetOrArg, 5> UseVector;
124 // Map each LLVM function to corresponding metadata with debug info. If
125 // the function is replaced with another one, we should patch the pointer
126 // to LLVM function in metadata.
127 // As the code generation for module is finished (and DIBuilder is
128 // finalized) we assume that subprogram descriptors won't be changed, and
129 // they are stored in map for short duration anyway.
130 DenseMap<const Function *, DISubprogram> FunctionDIs;
133 // DAH uses this to specify a different ID.
134 explicit DAE(char &ID) : ModulePass(ID) {}
137 static char ID; // Pass identification, replacement for typeid
138 DAE() : ModulePass(ID) {
139 initializeDAEPass(*PassRegistry::getPassRegistry());
142 bool runOnModule(Module &M) override;
144 virtual bool ShouldHackArguments() const { return false; }
147 Liveness MarkIfNotLive(RetOrArg Use, UseVector &MaybeLiveUses);
148 Liveness SurveyUse(const Use *U, UseVector &MaybeLiveUses,
149 unsigned RetValNum = -1U);
150 Liveness SurveyUses(const Value *V, UseVector &MaybeLiveUses);
152 void SurveyFunction(const Function &F);
153 void MarkValue(const RetOrArg &RA, Liveness L,
154 const UseVector &MaybeLiveUses);
155 void MarkLive(const RetOrArg &RA);
156 void MarkLive(const Function &F);
157 void PropagateLiveness(const RetOrArg &RA);
158 bool RemoveDeadStuffFromFunction(Function *F);
159 bool DeleteDeadVarargs(Function &Fn);
160 bool RemoveDeadArgumentsFromCallers(Function &Fn);
166 INITIALIZE_PASS(DAE, "deadargelim", "Dead Argument Elimination", false, false)
169 /// DAH - DeadArgumentHacking pass - Same as dead argument elimination, but
170 /// deletes arguments to functions which are external. This is only for use
172 struct DAH : public DAE {
176 bool ShouldHackArguments() const override { return true; }
181 INITIALIZE_PASS(DAH, "deadarghaX0r",
182 "Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)",
185 /// createDeadArgEliminationPass - This pass removes arguments from functions
186 /// which are not used by the body of the function.
188 ModulePass *llvm::createDeadArgEliminationPass() { return new DAE(); }
189 ModulePass *llvm::createDeadArgHackingPass() { return new DAH(); }
191 /// DeleteDeadVarargs - If this is an function that takes a ... list, and if
192 /// llvm.vastart is never called, the varargs list is dead for the function.
193 bool DAE::DeleteDeadVarargs(Function &Fn) {
194 assert(Fn.getFunctionType()->isVarArg() && "Function isn't varargs!");
195 if (Fn.isDeclaration() || !Fn.hasLocalLinkage()) return false;
197 // Ensure that the function is only directly called.
198 if (Fn.hasAddressTaken())
201 // Okay, we know we can transform this function if safe. Scan its body
202 // looking for calls marked musttail or calls to llvm.vastart.
203 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
204 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
205 CallInst *CI = dyn_cast<CallInst>(I);
208 if (CI->isMustTailCall())
210 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(CI)) {
211 if (II->getIntrinsicID() == Intrinsic::vastart)
217 // If we get here, there are no calls to llvm.vastart in the function body,
218 // remove the "..." and adjust all the calls.
220 // Start by computing a new prototype for the function, which is the same as
221 // the old function, but doesn't have isVarArg set.
222 FunctionType *FTy = Fn.getFunctionType();
224 std::vector<Type*> Params(FTy->param_begin(), FTy->param_end());
225 FunctionType *NFTy = FunctionType::get(FTy->getReturnType(),
227 unsigned NumArgs = Params.size();
229 // Create the new function body and insert it into the module...
230 Function *NF = Function::Create(NFTy, Fn.getLinkage());
231 NF->copyAttributesFrom(&Fn);
232 Fn.getParent()->getFunctionList().insert(&Fn, NF);
235 // Loop over all of the callers of the function, transforming the call sites
236 // to pass in a smaller number of arguments into the new function.
238 std::vector<Value*> Args;
239 for (Value::user_iterator I = Fn.user_begin(), E = Fn.user_end(); I != E; ) {
243 Instruction *Call = CS.getInstruction();
245 // Pass all the same arguments.
246 Args.assign(CS.arg_begin(), CS.arg_begin() + NumArgs);
248 // Drop any attributes that were on the vararg arguments.
249 AttributeSet PAL = CS.getAttributes();
250 if (!PAL.isEmpty() && PAL.getSlotIndex(PAL.getNumSlots() - 1) > NumArgs) {
251 SmallVector<AttributeSet, 8> AttributesVec;
252 for (unsigned i = 0; PAL.getSlotIndex(i) <= NumArgs; ++i)
253 AttributesVec.push_back(PAL.getSlotAttributes(i));
254 if (PAL.hasAttributes(AttributeSet::FunctionIndex))
255 AttributesVec.push_back(AttributeSet::get(Fn.getContext(),
256 PAL.getFnAttributes()));
257 PAL = AttributeSet::get(Fn.getContext(), AttributesVec);
261 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
262 New = InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
264 cast<InvokeInst>(New)->setCallingConv(CS.getCallingConv());
265 cast<InvokeInst>(New)->setAttributes(PAL);
267 New = CallInst::Create(NF, Args, "", Call);
268 cast<CallInst>(New)->setCallingConv(CS.getCallingConv());
269 cast<CallInst>(New)->setAttributes(PAL);
270 if (cast<CallInst>(Call)->isTailCall())
271 cast<CallInst>(New)->setTailCall();
273 New->setDebugLoc(Call->getDebugLoc());
277 if (!Call->use_empty())
278 Call->replaceAllUsesWith(New);
282 // Finally, remove the old call from the program, reducing the use-count of
284 Call->eraseFromParent();
287 // Since we have now created the new function, splice the body of the old
288 // function right into the new function, leaving the old rotting hulk of the
290 NF->getBasicBlockList().splice(NF->begin(), Fn.getBasicBlockList());
292 // Loop over the argument list, transferring uses of the old arguments over to
293 // the new arguments, also transferring over the names as well. While we're at
294 // it, remove the dead arguments from the DeadArguments list.
296 for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(),
297 I2 = NF->arg_begin(); I != E; ++I, ++I2) {
298 // Move the name and users over to the new version.
299 I->replaceAllUsesWith(I2);
303 // Patch the pointer to LLVM function in debug info descriptor.
304 auto DI = FunctionDIs.find(&Fn);
305 if (DI != FunctionDIs.end()) {
306 DISubprogram SP = DI->second;
307 SP.replaceFunction(NF);
308 // Ensure the map is updated so it can be reused on non-varargs argument
309 // eliminations of the same function.
310 FunctionDIs.erase(DI);
311 FunctionDIs[NF] = SP;
314 // Fix up any BlockAddresses that refer to the function.
315 Fn.replaceAllUsesWith(ConstantExpr::getBitCast(NF, Fn.getType()));
316 // Delete the bitcast that we just created, so that NF does not
317 // appear to be address-taken.
318 NF->removeDeadConstantUsers();
319 // Finally, nuke the old function.
320 Fn.eraseFromParent();
324 /// RemoveDeadArgumentsFromCallers - Checks if the given function has any
325 /// arguments that are unused, and changes the caller parameters to be undefined
327 bool DAE::RemoveDeadArgumentsFromCallers(Function &Fn)
329 if (Fn.isDeclaration() || Fn.mayBeOverridden())
332 // Functions with local linkage should already have been handled, except the
333 // fragile (variadic) ones which we can improve here.
334 if (Fn.hasLocalLinkage() && !Fn.getFunctionType()->isVarArg())
337 // If a function seen at compile time is not necessarily the one linked to
338 // the binary being built, it is illegal to change the actual arguments
339 // passed to it. These functions can be captured by isWeakForLinker().
340 // *NOTE* that mayBeOverridden() is insufficient for this purpose as it
341 // doesn't include linkage types like AvailableExternallyLinkage and
342 // LinkOnceODRLinkage. Take link_odr* as an example, it indicates a set of
343 // *EQUIVALENT* globals that can be merged at link-time. However, the
344 // semantic of *EQUIVALENT*-functions includes parameters. Changing
345 // parameters breaks this assumption.
347 if (Fn.isWeakForLinker())
353 SmallVector<unsigned, 8> UnusedArgs;
354 for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end();
358 if (Arg->use_empty() && !Arg->hasByValOrInAllocaAttr())
359 UnusedArgs.push_back(Arg->getArgNo());
362 if (UnusedArgs.empty())
365 bool Changed = false;
367 for (Use &U : Fn.uses()) {
368 CallSite CS(U.getUser());
369 if (!CS || !CS.isCallee(&U))
372 // Now go through all unused args and replace them with "undef".
373 for (unsigned I = 0, E = UnusedArgs.size(); I != E; ++I) {
374 unsigned ArgNo = UnusedArgs[I];
376 Value *Arg = CS.getArgument(ArgNo);
377 CS.setArgument(ArgNo, UndefValue::get(Arg->getType()));
378 ++NumArgumentsReplacedWithUndef;
386 /// Convenience function that returns the number of return values. It returns 0
387 /// for void functions and 1 for functions not returning a struct. It returns
388 /// the number of struct elements for functions returning a struct.
389 static unsigned NumRetVals(const Function *F) {
390 Type *RetTy = F->getReturnType();
391 if (RetTy->isVoidTy())
393 else if (StructType *STy = dyn_cast<StructType>(RetTy))
394 return STy->getNumElements();
395 else if (ArrayType *ATy = dyn_cast<ArrayType>(RetTy))
396 return ATy->getNumElements();
401 /// Returns the sub-type a function will return at a given Idx. Should
402 /// correspond to the result type of an ExtractValue instruction executed with
403 /// just that one Idx (i.e. only top-level structure is considered).
404 static Type *getRetComponentType(const Function *F, unsigned Idx) {
405 Type *RetTy = F->getReturnType();
406 assert(!RetTy->isVoidTy() && "void type has no subtype");
408 if (StructType *STy = dyn_cast<StructType>(RetTy))
409 return STy->getElementType(Idx);
410 else if (ArrayType *ATy = dyn_cast<ArrayType>(RetTy))
411 return ATy->getElementType();
416 /// MarkIfNotLive - This checks Use for liveness in LiveValues. If Use is not
417 /// live, it adds Use to the MaybeLiveUses argument. Returns the determined
419 DAE::Liveness DAE::MarkIfNotLive(RetOrArg Use, UseVector &MaybeLiveUses) {
420 // We're live if our use or its Function is already marked as live.
421 if (LiveFunctions.count(Use.F) || LiveValues.count(Use))
424 // We're maybe live otherwise, but remember that we must become live if
426 MaybeLiveUses.push_back(Use);
431 /// SurveyUse - This looks at a single use of an argument or return value
432 /// and determines if it should be alive or not. Adds this use to MaybeLiveUses
433 /// if it causes the used value to become MaybeLive.
435 /// RetValNum is the return value number to use when this use is used in a
436 /// return instruction. This is used in the recursion, you should always leave
438 DAE::Liveness DAE::SurveyUse(const Use *U,
439 UseVector &MaybeLiveUses, unsigned RetValNum) {
440 const User *V = U->getUser();
441 if (const ReturnInst *RI = dyn_cast<ReturnInst>(V)) {
442 // The value is returned from a function. It's only live when the
443 // function's return value is live. We use RetValNum here, for the case
444 // that U is really a use of an insertvalue instruction that uses the
446 const Function *F = RI->getParent()->getParent();
447 if (RetValNum != -1U) {
448 RetOrArg Use = CreateRet(F, RetValNum);
449 // We might be live, depending on the liveness of Use.
450 return MarkIfNotLive(Use, MaybeLiveUses);
452 DAE::Liveness Result;
453 for (unsigned i = 0; i < NumRetVals(F); ++i) {
454 RetOrArg Use = CreateRet(F, i);
455 // We might be live, depending on the liveness of Use. All Results
456 // should be the same since they depend only on F.
457 Result = MarkIfNotLive(Use, MaybeLiveUses);
462 if (const InsertValueInst *IV = dyn_cast<InsertValueInst>(V)) {
463 if (U->getOperandNo() != InsertValueInst::getAggregateOperandIndex()
465 // The use we are examining is inserted into an aggregate. Our liveness
466 // depends on all uses of that aggregate, but if it is used as a return
467 // value, only index at which we were inserted counts.
468 RetValNum = *IV->idx_begin();
470 // Note that if we are used as the aggregate operand to the insertvalue,
471 // we don't change RetValNum, but do survey all our uses.
473 Liveness Result = MaybeLive;
474 for (const Use &UU : IV->uses()) {
475 Result = SurveyUse(&UU, MaybeLiveUses, RetValNum);
482 if (ImmutableCallSite CS = V) {
483 const Function *F = CS.getCalledFunction();
485 // Used in a direct call.
487 // Find the argument number. We know for sure that this use is an
488 // argument, since if it was the function argument this would be an
489 // indirect call and the we know can't be looking at a value of the
490 // label type (for the invoke instruction).
491 unsigned ArgNo = CS.getArgumentNo(U);
493 if (ArgNo >= F->getFunctionType()->getNumParams())
494 // The value is passed in through a vararg! Must be live.
497 assert(CS.getArgument(ArgNo)
498 == CS->getOperand(U->getOperandNo())
499 && "Argument is not where we expected it");
501 // Value passed to a normal call. It's only live when the corresponding
502 // argument to the called function turns out live.
503 RetOrArg Use = CreateArg(F, ArgNo);
504 return MarkIfNotLive(Use, MaybeLiveUses);
507 // Used in any other way? Value must be live.
511 /// SurveyUses - This looks at all the uses of the given value
512 /// Returns the Liveness deduced from the uses of this value.
514 /// Adds all uses that cause the result to be MaybeLive to MaybeLiveRetUses. If
515 /// the result is Live, MaybeLiveUses might be modified but its content should
516 /// be ignored (since it might not be complete).
517 DAE::Liveness DAE::SurveyUses(const Value *V, UseVector &MaybeLiveUses) {
518 // Assume it's dead (which will only hold if there are no uses at all..).
519 Liveness Result = MaybeLive;
521 for (const Use &U : V->uses()) {
522 Result = SurveyUse(&U, MaybeLiveUses);
529 // SurveyFunction - This performs the initial survey of the specified function,
530 // checking out whether or not it uses any of its incoming arguments or whether
531 // any callers use the return value. This fills in the LiveValues set and Uses
534 // We consider arguments of non-internal functions to be intrinsically alive as
535 // well as arguments to functions which have their "address taken".
537 void DAE::SurveyFunction(const Function &F) {
538 // Functions with inalloca parameters are expecting args in a particular
539 // register and memory layout.
540 if (F.getAttributes().hasAttrSomewhere(Attribute::InAlloca)) {
545 unsigned RetCount = NumRetVals(&F);
546 // Assume all return values are dead
547 typedef SmallVector<Liveness, 5> RetVals;
548 RetVals RetValLiveness(RetCount, MaybeLive);
550 typedef SmallVector<UseVector, 5> RetUses;
551 // These vectors map each return value to the uses that make it MaybeLive, so
552 // we can add those to the Uses map if the return value really turns out to be
553 // MaybeLive. Initialized to a list of RetCount empty lists.
554 RetUses MaybeLiveRetUses(RetCount);
556 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
557 if (const ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator()))
558 if (RI->getNumOperands() != 0 && RI->getOperand(0)->getType()
559 != F.getFunctionType()->getReturnType()) {
560 // We don't support old style multiple return values.
565 if (!F.hasLocalLinkage() && (!ShouldHackArguments() || F.isIntrinsic())) {
570 DEBUG(dbgs() << "DAE - Inspecting callers for fn: " << F.getName() << "\n");
571 // Keep track of the number of live retvals, so we can skip checks once all
572 // of them turn out to be live.
573 unsigned NumLiveRetVals = 0;
574 // Loop all uses of the function.
575 for (const Use &U : F.uses()) {
576 // If the function is PASSED IN as an argument, its address has been
578 ImmutableCallSite CS(U.getUser());
579 if (!CS || !CS.isCallee(&U)) {
584 // If this use is anything other than a call site, the function is alive.
585 const Instruction *TheCall = CS.getInstruction();
586 if (!TheCall) { // Not a direct call site?
591 // If we end up here, we are looking at a direct call to our function.
593 // Now, check how our return value(s) is/are used in this caller. Don't
594 // bother checking return values if all of them are live already.
595 if (NumLiveRetVals == RetCount)
598 // Check all uses of the return value.
599 for (const Use &U : TheCall->uses()) {
600 if (ExtractValueInst *Ext = dyn_cast<ExtractValueInst>(U.getUser())) {
601 // This use uses a part of our return value, survey the uses of
602 // that part and store the results for this index only.
603 unsigned Idx = *Ext->idx_begin();
604 if (RetValLiveness[Idx] != Live) {
605 RetValLiveness[Idx] = SurveyUses(Ext, MaybeLiveRetUses[Idx]);
606 if (RetValLiveness[Idx] == Live)
610 // Used by something else than extractvalue. Survey, but assume that the
611 // result applies to all sub-values.
612 UseVector MaybeLiveAggregateUses;
613 if (SurveyUse(&U, MaybeLiveAggregateUses) == Live) {
614 NumLiveRetVals = RetCount;
615 RetValLiveness.assign(RetCount, Live);
618 for (unsigned i = 0; i != RetCount; ++i) {
619 if (RetValLiveness[i] != Live)
620 MaybeLiveRetUses[i].append(MaybeLiveAggregateUses.begin(),
621 MaybeLiveAggregateUses.end());
628 // Now we've inspected all callers, record the liveness of our return values.
629 for (unsigned i = 0; i != RetCount; ++i)
630 MarkValue(CreateRet(&F, i), RetValLiveness[i], MaybeLiveRetUses[i]);
632 DEBUG(dbgs() << "DAE - Inspecting args for fn: " << F.getName() << "\n");
634 // Now, check all of our arguments.
636 UseVector MaybeLiveArgUses;
637 for (Function::const_arg_iterator AI = F.arg_begin(),
638 E = F.arg_end(); AI != E; ++AI, ++i) {
640 if (F.getFunctionType()->isVarArg()) {
641 // Variadic functions will already have a va_arg function expanded inside
642 // them, making them potentially very sensitive to ABI changes resulting
643 // from removing arguments entirely, so don't. For example AArch64 handles
644 // register and stack HFAs very differently, and this is reflected in the
645 // IR which has already been generated.
648 // See what the effect of this use is (recording any uses that cause
649 // MaybeLive in MaybeLiveArgUses).
650 Result = SurveyUses(AI, MaybeLiveArgUses);
654 MarkValue(CreateArg(&F, i), Result, MaybeLiveArgUses);
655 // Clear the vector again for the next iteration.
656 MaybeLiveArgUses.clear();
660 /// MarkValue - This function marks the liveness of RA depending on L. If L is
661 /// MaybeLive, it also takes all uses in MaybeLiveUses and records them in Uses,
662 /// such that RA will be marked live if any use in MaybeLiveUses gets marked
664 void DAE::MarkValue(const RetOrArg &RA, Liveness L,
665 const UseVector &MaybeLiveUses) {
667 case Live: MarkLive(RA); break;
670 // Note any uses of this value, so this return value can be
671 // marked live whenever one of the uses becomes live.
672 for (UseVector::const_iterator UI = MaybeLiveUses.begin(),
673 UE = MaybeLiveUses.end(); UI != UE; ++UI)
674 Uses.insert(std::make_pair(*UI, RA));
680 /// MarkLive - Mark the given Function as alive, meaning that it cannot be
681 /// changed in any way. Additionally,
682 /// mark any values that are used as this function's parameters or by its return
683 /// values (according to Uses) live as well.
684 void DAE::MarkLive(const Function &F) {
685 DEBUG(dbgs() << "DAE - Intrinsically live fn: " << F.getName() << "\n");
686 // Mark the function as live.
687 LiveFunctions.insert(&F);
688 // Mark all arguments as live.
689 for (unsigned i = 0, e = F.arg_size(); i != e; ++i)
690 PropagateLiveness(CreateArg(&F, i));
691 // Mark all return values as live.
692 for (unsigned i = 0, e = NumRetVals(&F); i != e; ++i)
693 PropagateLiveness(CreateRet(&F, i));
696 /// MarkLive - Mark the given return value or argument as live. Additionally,
697 /// mark any values that are used by this value (according to Uses) live as
699 void DAE::MarkLive(const RetOrArg &RA) {
700 if (LiveFunctions.count(RA.F))
701 return; // Function was already marked Live.
703 if (!LiveValues.insert(RA).second)
704 return; // We were already marked Live.
706 DEBUG(dbgs() << "DAE - Marking " << RA.getDescription() << " live\n");
707 PropagateLiveness(RA);
710 /// PropagateLiveness - Given that RA is a live value, propagate it's liveness
711 /// to any other values it uses (according to Uses).
712 void DAE::PropagateLiveness(const RetOrArg &RA) {
713 // We don't use upper_bound (or equal_range) here, because our recursive call
714 // to ourselves is likely to cause the upper_bound (which is the first value
715 // not belonging to RA) to become erased and the iterator invalidated.
716 UseMap::iterator Begin = Uses.lower_bound(RA);
717 UseMap::iterator E = Uses.end();
719 for (I = Begin; I != E && I->first == RA; ++I)
722 // Erase RA from the Uses map (from the lower bound to wherever we ended up
724 Uses.erase(Begin, I);
727 // RemoveDeadStuffFromFunction - Remove any arguments and return values from F
728 // that are not in LiveValues. Transform the function and all of the callees of
729 // the function to not have these arguments and return values.
731 bool DAE::RemoveDeadStuffFromFunction(Function *F) {
732 // Don't modify fully live functions
733 if (LiveFunctions.count(F))
736 // Start by computing a new prototype for the function, which is the same as
737 // the old function, but has fewer arguments and a different return type.
738 FunctionType *FTy = F->getFunctionType();
739 std::vector<Type*> Params;
741 // Keep track of if we have a live 'returned' argument
742 bool HasLiveReturnedArg = false;
744 // Set up to build a new list of parameter attributes.
745 SmallVector<AttributeSet, 8> AttributesVec;
746 const AttributeSet &PAL = F->getAttributes();
748 // Remember which arguments are still alive.
749 SmallVector<bool, 10> ArgAlive(FTy->getNumParams(), false);
750 // Construct the new parameter list from non-dead arguments. Also construct
751 // a new set of parameter attributes to correspond. Skip the first parameter
752 // attribute, since that belongs to the return value.
754 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end();
756 RetOrArg Arg = CreateArg(F, i);
757 if (LiveValues.erase(Arg)) {
758 Params.push_back(I->getType());
761 // Get the original parameter attributes (skipping the first one, that is
762 // for the return value.
763 if (PAL.hasAttributes(i + 1)) {
764 AttrBuilder B(PAL, i + 1);
765 if (B.contains(Attribute::Returned))
766 HasLiveReturnedArg = true;
768 push_back(AttributeSet::get(F->getContext(), Params.size(), B));
771 ++NumArgumentsEliminated;
772 DEBUG(dbgs() << "DAE - Removing argument " << i << " (" << I->getName()
773 << ") from " << F->getName() << "\n");
777 // Find out the new return value.
778 Type *RetTy = FTy->getReturnType();
779 Type *NRetTy = nullptr;
780 unsigned RetCount = NumRetVals(F);
782 // -1 means unused, other numbers are the new index
783 SmallVector<int, 5> NewRetIdxs(RetCount, -1);
784 std::vector<Type*> RetTypes;
786 // If there is a function with a live 'returned' argument but a dead return
787 // value, then there are two possible actions:
788 // 1) Eliminate the return value and take off the 'returned' attribute on the
790 // 2) Retain the 'returned' attribute and treat the return value (but not the
791 // entire function) as live so that it is not eliminated.
793 // It's not clear in the general case which option is more profitable because,
794 // even in the absence of explicit uses of the return value, code generation
795 // is free to use the 'returned' attribute to do things like eliding
796 // save/restores of registers across calls. Whether or not this happens is
797 // target and ABI-specific as well as depending on the amount of register
798 // pressure, so there's no good way for an IR-level pass to figure this out.
800 // Fortunately, the only places where 'returned' is currently generated by
801 // the FE are places where 'returned' is basically free and almost always a
802 // performance win, so the second option can just be used always for now.
804 // This should be revisited if 'returned' is ever applied more liberally.
805 if (RetTy->isVoidTy() || HasLiveReturnedArg) {
808 // Look at each of the original return values individually.
809 for (unsigned i = 0; i != RetCount; ++i) {
810 RetOrArg Ret = CreateRet(F, i);
811 if (LiveValues.erase(Ret)) {
812 RetTypes.push_back(getRetComponentType(F, i));
813 NewRetIdxs[i] = RetTypes.size() - 1;
815 ++NumRetValsEliminated;
816 DEBUG(dbgs() << "DAE - Removing return value " << i << " from "
817 << F->getName() << "\n");
820 if (RetTypes.size() > 1) {
821 // More than one return type? Reduce it down to size.
822 if (StructType *STy = dyn_cast<StructType>(RetTy)) {
823 // Make the new struct packed if we used to return a packed struct
825 NRetTy = StructType::get(STy->getContext(), RetTypes, STy->isPacked());
827 assert(isa<ArrayType>(RetTy) && "unexpected multi-value return");
828 NRetTy = ArrayType::get(RetTypes[0], RetTypes.size());
830 } else if (RetTypes.size() == 1)
831 // One return type? Just a simple value then, but only if we didn't use to
832 // return a struct with that simple value before.
833 NRetTy = RetTypes.front();
834 else if (RetTypes.size() == 0)
835 // No return types? Make it void, but only if we didn't use to return {}.
836 NRetTy = Type::getVoidTy(F->getContext());
839 assert(NRetTy && "No new return type found?");
841 // The existing function return attributes.
842 AttributeSet RAttrs = PAL.getRetAttributes();
844 // Remove any incompatible attributes, but only if we removed all return
845 // values. Otherwise, ensure that we don't have any conflicting attributes
846 // here. Currently, this should not be possible, but special handling might be
847 // required when new return value attributes are added.
848 if (NRetTy->isVoidTy())
850 AttributeSet::get(NRetTy->getContext(), AttributeSet::ReturnIndex,
851 AttrBuilder(RAttrs, AttributeSet::ReturnIndex).
852 removeAttributes(AttributeFuncs::
853 typeIncompatible(NRetTy, AttributeSet::ReturnIndex),
854 AttributeSet::ReturnIndex));
856 assert(!AttrBuilder(RAttrs, AttributeSet::ReturnIndex).
857 hasAttributes(AttributeFuncs::
858 typeIncompatible(NRetTy, AttributeSet::ReturnIndex),
859 AttributeSet::ReturnIndex) &&
860 "Return attributes no longer compatible?");
862 if (RAttrs.hasAttributes(AttributeSet::ReturnIndex))
863 AttributesVec.push_back(AttributeSet::get(NRetTy->getContext(), RAttrs));
865 if (PAL.hasAttributes(AttributeSet::FunctionIndex))
866 AttributesVec.push_back(AttributeSet::get(F->getContext(),
867 PAL.getFnAttributes()));
869 // Reconstruct the AttributesList based on the vector we constructed.
870 AttributeSet NewPAL = AttributeSet::get(F->getContext(), AttributesVec);
872 // Create the new function type based on the recomputed parameters.
873 FunctionType *NFTy = FunctionType::get(NRetTy, Params, FTy->isVarArg());
879 // Create the new function body and insert it into the module...
880 Function *NF = Function::Create(NFTy, F->getLinkage());
881 NF->copyAttributesFrom(F);
882 NF->setAttributes(NewPAL);
883 // Insert the new function before the old function, so we won't be processing
885 F->getParent()->getFunctionList().insert(F, NF);
888 // Loop over all of the callers of the function, transforming the call sites
889 // to pass in a smaller number of arguments into the new function.
891 std::vector<Value*> Args;
892 while (!F->use_empty()) {
893 CallSite CS(F->user_back());
894 Instruction *Call = CS.getInstruction();
896 AttributesVec.clear();
897 const AttributeSet &CallPAL = CS.getAttributes();
899 // The call return attributes.
900 AttributeSet RAttrs = CallPAL.getRetAttributes();
902 // Adjust in case the function was changed to return void.
904 AttributeSet::get(NF->getContext(), AttributeSet::ReturnIndex,
905 AttrBuilder(RAttrs, AttributeSet::ReturnIndex).
906 removeAttributes(AttributeFuncs::
907 typeIncompatible(NF->getReturnType(),
908 AttributeSet::ReturnIndex),
909 AttributeSet::ReturnIndex));
910 if (RAttrs.hasAttributes(AttributeSet::ReturnIndex))
911 AttributesVec.push_back(AttributeSet::get(NF->getContext(), RAttrs));
913 // Declare these outside of the loops, so we can reuse them for the second
914 // loop, which loops the varargs.
915 CallSite::arg_iterator I = CS.arg_begin();
917 // Loop over those operands, corresponding to the normal arguments to the
918 // original function, and add those that are still alive.
919 for (unsigned e = FTy->getNumParams(); i != e; ++I, ++i)
922 // Get original parameter attributes, but skip return attributes.
923 if (CallPAL.hasAttributes(i + 1)) {
924 AttrBuilder B(CallPAL, i + 1);
925 // If the return type has changed, then get rid of 'returned' on the
926 // call site. The alternative is to make all 'returned' attributes on
927 // call sites keep the return value alive just like 'returned'
928 // attributes on function declaration but it's less clearly a win
929 // and this is not an expected case anyway
930 if (NRetTy != RetTy && B.contains(Attribute::Returned))
931 B.removeAttribute(Attribute::Returned);
933 push_back(AttributeSet::get(F->getContext(), Args.size(), B));
937 // Push any varargs arguments on the list. Don't forget their attributes.
938 for (CallSite::arg_iterator E = CS.arg_end(); I != E; ++I, ++i) {
940 if (CallPAL.hasAttributes(i + 1)) {
941 AttrBuilder B(CallPAL, i + 1);
943 push_back(AttributeSet::get(F->getContext(), Args.size(), B));
947 if (CallPAL.hasAttributes(AttributeSet::FunctionIndex))
948 AttributesVec.push_back(AttributeSet::get(Call->getContext(),
949 CallPAL.getFnAttributes()));
951 // Reconstruct the AttributesList based on the vector we constructed.
952 AttributeSet NewCallPAL = AttributeSet::get(F->getContext(), AttributesVec);
955 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
956 New = InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
958 cast<InvokeInst>(New)->setCallingConv(CS.getCallingConv());
959 cast<InvokeInst>(New)->setAttributes(NewCallPAL);
961 New = CallInst::Create(NF, Args, "", Call);
962 cast<CallInst>(New)->setCallingConv(CS.getCallingConv());
963 cast<CallInst>(New)->setAttributes(NewCallPAL);
964 if (cast<CallInst>(Call)->isTailCall())
965 cast<CallInst>(New)->setTailCall();
967 New->setDebugLoc(Call->getDebugLoc());
971 if (!Call->use_empty()) {
972 if (New->getType() == Call->getType()) {
973 // Return type not changed? Just replace users then.
974 Call->replaceAllUsesWith(New);
976 } else if (New->getType()->isVoidTy()) {
977 // Our return value has uses, but they will get removed later on.
978 // Replace by null for now.
979 if (!Call->getType()->isX86_MMXTy())
980 Call->replaceAllUsesWith(Constant::getNullValue(Call->getType()));
982 assert((RetTy->isStructTy() || RetTy->isArrayTy()) &&
983 "Return type changed, but not into a void. The old return type"
984 " must have been a struct or an array!");
985 Instruction *InsertPt = Call;
986 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
987 BasicBlock::iterator IP = II->getNormalDest()->begin();
988 while (isa<PHINode>(IP)) ++IP;
992 // We used to return a struct or array. Instead of doing smart stuff
993 // with all the uses, we will just rebuild it using extract/insertvalue
994 // chaining and let instcombine clean that up.
996 // Start out building up our return value from undef
997 Value *RetVal = UndefValue::get(RetTy);
998 for (unsigned i = 0; i != RetCount; ++i)
999 if (NewRetIdxs[i] != -1) {
1001 if (RetTypes.size() > 1)
1002 // We are still returning a struct, so extract the value from our
1004 V = ExtractValueInst::Create(New, NewRetIdxs[i], "newret",
1007 // We are now returning a single element, so just insert that
1009 // Insert the value at the old position
1010 RetVal = InsertValueInst::Create(RetVal, V, i, "oldret", InsertPt);
1012 // Now, replace all uses of the old call instruction with the return
1014 Call->replaceAllUsesWith(RetVal);
1015 New->takeName(Call);
1019 // Finally, remove the old call from the program, reducing the use-count of
1021 Call->eraseFromParent();
1024 // Since we have now created the new function, splice the body of the old
1025 // function right into the new function, leaving the old rotting hulk of the
1027 NF->getBasicBlockList().splice(NF->begin(), F->getBasicBlockList());
1029 // Loop over the argument list, transferring uses of the old arguments over to
1030 // the new arguments, also transferring over the names as well.
1032 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(),
1033 I2 = NF->arg_begin(); I != E; ++I, ++i)
1035 // If this is a live argument, move the name and users over to the new
1037 I->replaceAllUsesWith(I2);
1041 // If this argument is dead, replace any uses of it with null constants
1042 // (these are guaranteed to become unused later on).
1043 if (!I->getType()->isX86_MMXTy())
1044 I->replaceAllUsesWith(Constant::getNullValue(I->getType()));
1047 // If we change the return value of the function we must rewrite any return
1048 // instructions. Check this now.
1049 if (F->getReturnType() != NF->getReturnType())
1050 for (Function::iterator BB = NF->begin(), E = NF->end(); BB != E; ++BB)
1051 if (ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator())) {
1054 if (NFTy->getReturnType()->isVoidTy()) {
1057 assert(RetTy->isStructTy() || RetTy->isArrayTy());
1058 // The original return value was a struct or array, insert
1059 // extractvalue/insertvalue chains to extract only the values we need
1060 // to return and insert them into our new result.
1061 // This does generate messy code, but we'll let it to instcombine to
1063 Value *OldRet = RI->getOperand(0);
1064 // Start out building up our return value from undef
1065 RetVal = UndefValue::get(NRetTy);
1066 for (unsigned i = 0; i != RetCount; ++i)
1067 if (NewRetIdxs[i] != -1) {
1068 ExtractValueInst *EV = ExtractValueInst::Create(OldRet, i,
1070 if (RetTypes.size() > 1) {
1071 // We're still returning a struct, so reinsert the value into
1072 // our new return value at the new index
1074 RetVal = InsertValueInst::Create(RetVal, EV, NewRetIdxs[i],
1077 // We are now only returning a simple value, so just return the
1083 // Replace the return instruction with one returning the new return
1084 // value (possibly 0 if we became void).
1085 ReturnInst::Create(F->getContext(), RetVal, RI);
1086 BB->getInstList().erase(RI);
1089 // Patch the pointer to LLVM function in debug info descriptor.
1090 auto DI = FunctionDIs.find(F);
1091 if (DI != FunctionDIs.end())
1092 DI->second.replaceFunction(NF);
1094 // Now that the old function is dead, delete it.
1095 F->eraseFromParent();
1100 bool DAE::runOnModule(Module &M) {
1101 bool Changed = false;
1103 // Collect debug info descriptors for functions.
1104 FunctionDIs = makeSubprogramMap(M);
1106 // First pass: Do a simple check to see if any functions can have their "..."
1107 // removed. We can do this if they never call va_start. This loop cannot be
1108 // fused with the next loop, because deleting a function invalidates
1109 // information computed while surveying other functions.
1110 DEBUG(dbgs() << "DAE - Deleting dead varargs\n");
1111 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) {
1113 if (F.getFunctionType()->isVarArg())
1114 Changed |= DeleteDeadVarargs(F);
1117 // Second phase:loop through the module, determining which arguments are live.
1118 // We assume all arguments are dead unless proven otherwise (allowing us to
1119 // determine that dead arguments passed into recursive functions are dead).
1121 DEBUG(dbgs() << "DAE - Determining liveness\n");
1125 // Now, remove all dead arguments and return values from each function in
1127 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) {
1128 // Increment now, because the function will probably get removed (ie.
1129 // replaced by a new one).
1131 Changed |= RemoveDeadStuffFromFunction(F);
1134 // Finally, look for any unused parameters in functions with non-local
1135 // linkage and replace the passed in parameters with undef.
1137 Changed |= RemoveDeadArgumentsFromCallers(F);