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 #define DEBUG_TYPE "deadargelim"
21 #include "llvm/Transforms/IPO.h"
22 #include "llvm/CallingConv.h"
23 #include "llvm/Constant.h"
24 #include "llvm/DerivedTypes.h"
25 #include "llvm/Instructions.h"
26 #include "llvm/IntrinsicInst.h"
27 #include "llvm/LLVMContext.h"
28 #include "llvm/Module.h"
29 #include "llvm/Pass.h"
30 #include "llvm/Support/CallSite.h"
31 #include "llvm/Support/Debug.h"
32 #include "llvm/Support/raw_ostream.h"
33 #include "llvm/ADT/SmallVector.h"
34 #include "llvm/ADT/Statistic.h"
35 #include "llvm/ADT/StringExtras.h"
40 STATISTIC(NumArgumentsEliminated, "Number of unread args removed");
41 STATISTIC(NumRetValsEliminated , "Number of unused return values removed");
44 /// DAE - The dead argument elimination pass.
46 class DAE : public ModulePass {
49 /// Struct that represents (part of) either a return value or a function
50 /// argument. Used so that arguments and return values can be used
53 RetOrArg(const Function *F, unsigned Idx, bool IsArg) : F(F), Idx(Idx),
59 /// Make RetOrArg comparable, so we can put it into a map.
60 bool operator<(const RetOrArg &O) const {
63 else if (Idx != O.Idx)
66 return IsArg < O.IsArg;
69 /// Make RetOrArg comparable, so we can easily iterate the multimap.
70 bool operator==(const RetOrArg &O) const {
71 return F == O.F && Idx == O.Idx && IsArg == O.IsArg;
74 std::string getDescription() const {
75 return std::string((IsArg ? "Argument #" : "Return value #"))
76 + utostr(Idx) + " of function " + F->getNameStr();
80 /// Liveness enum - During our initial pass over the program, we determine
81 /// that things are either alive or maybe alive. We don't mark anything
82 /// explicitly dead (even if we know they are), since anything not alive
83 /// with no registered uses (in Uses) will never be marked alive and will
84 /// thus become dead in the end.
85 enum Liveness { Live, MaybeLive };
87 /// Convenience wrapper
88 RetOrArg CreateRet(const Function *F, unsigned Idx) {
89 return RetOrArg(F, Idx, false);
91 /// Convenience wrapper
92 RetOrArg CreateArg(const Function *F, unsigned Idx) {
93 return RetOrArg(F, Idx, true);
96 typedef std::multimap<RetOrArg, RetOrArg> UseMap;
97 /// This maps a return value or argument to any MaybeLive return values or
98 /// arguments it uses. This allows the MaybeLive values to be marked live
99 /// when any of its users is marked live.
100 /// For example (indices are left out for clarity):
101 /// - Uses[ret F] = ret G
102 /// This means that F calls G, and F returns the value returned by G.
103 /// - Uses[arg F] = ret G
104 /// This means that some function calls G and passes its result as an
106 /// - Uses[ret F] = arg F
107 /// This means that F returns one of its own arguments.
108 /// - Uses[arg F] = arg G
109 /// This means that G calls F and passes one of its own (G's) arguments
113 typedef std::set<RetOrArg> LiveSet;
114 typedef std::set<const Function*> LiveFuncSet;
116 /// This set contains all values that have been determined to be live.
118 /// This set contains all values that are cannot be changed in any way.
119 LiveFuncSet LiveFunctions;
121 typedef SmallVector<RetOrArg, 5> UseVector;
124 static char ID; // Pass identification, replacement for typeid
125 DAE() : ModulePass(&ID) {}
126 bool runOnModule(Module &M);
128 virtual bool ShouldHackArguments() const { return false; }
131 Liveness MarkIfNotLive(RetOrArg Use, UseVector &MaybeLiveUses);
132 Liveness SurveyUse(Value::const_use_iterator U, UseVector &MaybeLiveUses,
133 unsigned RetValNum = 0);
134 Liveness SurveyUses(const Value *V, UseVector &MaybeLiveUses);
136 void SurveyFunction(const Function &F);
137 void MarkValue(const RetOrArg &RA, Liveness L,
138 const UseVector &MaybeLiveUses);
139 void MarkLive(const RetOrArg &RA);
140 void MarkLive(const Function &F);
141 void PropagateLiveness(const RetOrArg &RA);
142 bool RemoveDeadStuffFromFunction(Function *F);
143 bool DeleteDeadVarargs(Function &Fn);
149 static RegisterPass<DAE>
150 X("deadargelim", "Dead Argument Elimination");
153 /// DAH - DeadArgumentHacking pass - Same as dead argument elimination, but
154 /// deletes arguments to functions which are external. This is only for use
156 struct DAH : public DAE {
158 virtual bool ShouldHackArguments() const { return true; }
163 static RegisterPass<DAH>
164 Y("deadarghaX0r", "Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)");
166 /// createDeadArgEliminationPass - This pass removes arguments from functions
167 /// which are not used by the body of the function.
169 ModulePass *llvm::createDeadArgEliminationPass() { return new DAE(); }
170 ModulePass *llvm::createDeadArgHackingPass() { return new DAH(); }
172 /// DeleteDeadVarargs - If this is an function that takes a ... list, and if
173 /// llvm.vastart is never called, the varargs list is dead for the function.
174 bool DAE::DeleteDeadVarargs(Function &Fn) {
175 assert(Fn.getFunctionType()->isVarArg() && "Function isn't varargs!");
176 if (Fn.isDeclaration() || !Fn.hasLocalLinkage()) return false;
178 // Ensure that the function is only directly called.
179 if (Fn.hasAddressTaken())
182 // Okay, we know we can transform this function if safe. Scan its body
183 // looking for calls to llvm.vastart.
184 for (Function::iterator BB = Fn.begin(), E = Fn.end(); BB != E; ++BB) {
185 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I) {
186 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
187 if (II->getIntrinsicID() == Intrinsic::vastart)
193 // If we get here, there are no calls to llvm.vastart in the function body,
194 // remove the "..." and adjust all the calls.
196 // Start by computing a new prototype for the function, which is the same as
197 // the old function, but doesn't have isVarArg set.
198 const FunctionType *FTy = Fn.getFunctionType();
200 std::vector<const Type*> Params(FTy->param_begin(), FTy->param_end());
201 FunctionType *NFTy = FunctionType::get(FTy->getReturnType(),
203 unsigned NumArgs = Params.size();
205 // Create the new function body and insert it into the module...
206 Function *NF = Function::Create(NFTy, Fn.getLinkage());
207 NF->copyAttributesFrom(&Fn);
208 Fn.getParent()->getFunctionList().insert(&Fn, NF);
211 // Loop over all of the callers of the function, transforming the call sites
212 // to pass in a smaller number of arguments into the new function.
214 std::vector<Value*> Args;
215 while (!Fn.use_empty()) {
216 CallSite CS = CallSite::get(Fn.use_back());
217 Instruction *Call = CS.getInstruction();
219 // Pass all the same arguments.
220 Args.assign(CS.arg_begin(), CS.arg_begin()+NumArgs);
222 // Drop any attributes that were on the vararg arguments.
223 AttrListPtr PAL = CS.getAttributes();
224 if (!PAL.isEmpty() && PAL.getSlot(PAL.getNumSlots() - 1).Index > NumArgs) {
225 SmallVector<AttributeWithIndex, 8> AttributesVec;
226 for (unsigned i = 0; PAL.getSlot(i).Index <= NumArgs; ++i)
227 AttributesVec.push_back(PAL.getSlot(i));
228 if (Attributes FnAttrs = PAL.getFnAttributes())
229 AttributesVec.push_back(AttributeWithIndex::get(~0, FnAttrs));
230 PAL = AttrListPtr::get(AttributesVec.begin(), AttributesVec.end());
234 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
235 New = InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
236 Args.begin(), Args.end(), "", Call);
237 cast<InvokeInst>(New)->setCallingConv(CS.getCallingConv());
238 cast<InvokeInst>(New)->setAttributes(PAL);
240 New = CallInst::Create(NF, Args.begin(), Args.end(), "", Call);
241 cast<CallInst>(New)->setCallingConv(CS.getCallingConv());
242 cast<CallInst>(New)->setAttributes(PAL);
243 if (cast<CallInst>(Call)->isTailCall())
244 cast<CallInst>(New)->setTailCall();
248 if (!Call->use_empty())
249 Call->replaceAllUsesWith(New);
253 // Finally, remove the old call from the program, reducing the use-count of
255 Call->eraseFromParent();
258 // Since we have now created the new function, splice the body of the old
259 // function right into the new function, leaving the old rotting hulk of the
261 NF->getBasicBlockList().splice(NF->begin(), Fn.getBasicBlockList());
263 // Loop over the argument list, transfering uses of the old arguments over to
264 // the new arguments, also transfering over the names as well. While we're at
265 // it, remove the dead arguments from the DeadArguments list.
267 for (Function::arg_iterator I = Fn.arg_begin(), E = Fn.arg_end(),
268 I2 = NF->arg_begin(); I != E; ++I, ++I2) {
269 // Move the name and users over to the new version.
270 I->replaceAllUsesWith(I2);
274 // Finally, nuke the old function.
275 Fn.eraseFromParent();
279 /// Convenience function that returns the number of return values. It returns 0
280 /// for void functions and 1 for functions not returning a struct. It returns
281 /// the number of struct elements for functions returning a struct.
282 static unsigned NumRetVals(const Function *F) {
283 if (F->getReturnType()->isVoidTy())
285 else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType()))
286 return STy->getNumElements();
291 /// MarkIfNotLive - This checks Use for liveness in LiveValues. If Use is not
292 /// live, it adds Use to the MaybeLiveUses argument. Returns the determined
294 DAE::Liveness DAE::MarkIfNotLive(RetOrArg Use, UseVector &MaybeLiveUses) {
295 // We're live if our use or its Function is already marked as live.
296 if (LiveFunctions.count(Use.F) || LiveValues.count(Use))
299 // We're maybe live otherwise, but remember that we must become live if
301 MaybeLiveUses.push_back(Use);
306 /// SurveyUse - This looks at a single use of an argument or return value
307 /// and determines if it should be alive or not. Adds this use to MaybeLiveUses
308 /// if it causes the used value to become MaybeLive.
310 /// RetValNum is the return value number to use when this use is used in a
311 /// return instruction. This is used in the recursion, you should always leave
313 DAE::Liveness DAE::SurveyUse(Value::const_use_iterator U,
314 UseVector &MaybeLiveUses, unsigned RetValNum) {
316 if (const ReturnInst *RI = dyn_cast<ReturnInst>(V)) {
317 // The value is returned from a function. It's only live when the
318 // function's return value is live. We use RetValNum here, for the case
319 // that U is really a use of an insertvalue instruction that uses the
321 RetOrArg Use = CreateRet(RI->getParent()->getParent(), RetValNum);
322 // We might be live, depending on the liveness of Use.
323 return MarkIfNotLive(Use, MaybeLiveUses);
325 if (const InsertValueInst *IV = dyn_cast<InsertValueInst>(V)) {
326 if (U.getOperandNo() != InsertValueInst::getAggregateOperandIndex()
328 // The use we are examining is inserted into an aggregate. Our liveness
329 // depends on all uses of that aggregate, but if it is used as a return
330 // value, only index at which we were inserted counts.
331 RetValNum = *IV->idx_begin();
333 // Note that if we are used as the aggregate operand to the insertvalue,
334 // we don't change RetValNum, but do survey all our uses.
336 Liveness Result = MaybeLive;
337 for (Value::const_use_iterator I = IV->use_begin(),
338 E = V->use_end(); I != E; ++I) {
339 Result = SurveyUse(I, MaybeLiveUses, RetValNum);
346 if (ImmutableCallSite CS = V) {
347 const Function *F = CS.getCalledFunction();
349 // Used in a direct call.
351 // Find the argument number. We know for sure that this use is an
352 // argument, since if it was the function argument this would be an
353 // indirect call and the we know can't be looking at a value of the
354 // label type (for the invoke instruction).
355 unsigned ArgNo = CS.getArgumentNo(U);
357 if (ArgNo >= F->getFunctionType()->getNumParams())
358 // The value is passed in through a vararg! Must be live.
361 assert(CS.getArgument(ArgNo)
362 == CS->getOperand(U.getOperandNo())
363 && "Argument is not where we expected it");
365 // Value passed to a normal call. It's only live when the corresponding
366 // argument to the called function turns out live.
367 RetOrArg Use = CreateArg(F, ArgNo);
368 return MarkIfNotLive(Use, MaybeLiveUses);
371 // Used in any other way? Value must be live.
375 /// SurveyUses - This looks at all the uses of the given value
376 /// Returns the Liveness deduced from the uses of this value.
378 /// Adds all uses that cause the result to be MaybeLive to MaybeLiveRetUses. If
379 /// the result is Live, MaybeLiveUses might be modified but its content should
380 /// be ignored (since it might not be complete).
381 DAE::Liveness DAE::SurveyUses(const Value *V, UseVector &MaybeLiveUses) {
382 // Assume it's dead (which will only hold if there are no uses at all..).
383 Liveness Result = MaybeLive;
385 for (Value::const_use_iterator I = V->use_begin(),
386 E = V->use_end(); I != E; ++I) {
387 Result = SurveyUse(I, MaybeLiveUses);
394 // SurveyFunction - This performs the initial survey of the specified function,
395 // checking out whether or not it uses any of its incoming arguments or whether
396 // any callers use the return value. This fills in the LiveValues set and Uses
399 // We consider arguments of non-internal functions to be intrinsically alive as
400 // well as arguments to functions which have their "address taken".
402 void DAE::SurveyFunction(const Function &F) {
403 unsigned RetCount = NumRetVals(&F);
404 // Assume all return values are dead
405 typedef SmallVector<Liveness, 5> RetVals;
406 RetVals RetValLiveness(RetCount, MaybeLive);
408 typedef SmallVector<UseVector, 5> RetUses;
409 // These vectors map each return value to the uses that make it MaybeLive, so
410 // we can add those to the Uses map if the return value really turns out to be
411 // MaybeLive. Initialized to a list of RetCount empty lists.
412 RetUses MaybeLiveRetUses(RetCount);
414 for (Function::const_iterator BB = F.begin(), E = F.end(); BB != E; ++BB)
415 if (const ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator()))
416 if (RI->getNumOperands() != 0 && RI->getOperand(0)->getType()
417 != F.getFunctionType()->getReturnType()) {
418 // We don't support old style multiple return values.
423 if (!F.hasLocalLinkage() && (!ShouldHackArguments() || F.isIntrinsic())) {
428 DEBUG(dbgs() << "DAE - Inspecting callers for fn: " << F.getName() << "\n");
429 // Keep track of the number of live retvals, so we can skip checks once all
430 // of them turn out to be live.
431 unsigned NumLiveRetVals = 0;
432 const Type *STy = dyn_cast<StructType>(F.getReturnType());
433 // Loop all uses of the function.
434 for (Value::const_use_iterator I = F.use_begin(), E = F.use_end();
436 // If the function is PASSED IN as an argument, its address has been
438 ImmutableCallSite CS(*I);
439 if (!CS || !CS.isCallee(I)) {
444 // If this use is anything other than a call site, the function is alive.
445 const Instruction *TheCall = CS.getInstruction();
446 if (!TheCall) { // Not a direct call site?
451 // If we end up here, we are looking at a direct call to our function.
453 // Now, check how our return value(s) is/are used in this caller. Don't
454 // bother checking return values if all of them are live already.
455 if (NumLiveRetVals != RetCount) {
457 // Check all uses of the return value.
458 for (Value::const_use_iterator I = TheCall->use_begin(),
459 E = TheCall->use_end(); I != E; ++I) {
460 const ExtractValueInst *Ext = dyn_cast<ExtractValueInst>(*I);
461 if (Ext && Ext->hasIndices()) {
462 // This use uses a part of our return value, survey the uses of
463 // that part and store the results for this index only.
464 unsigned Idx = *Ext->idx_begin();
465 if (RetValLiveness[Idx] != Live) {
466 RetValLiveness[Idx] = SurveyUses(Ext, MaybeLiveRetUses[Idx]);
467 if (RetValLiveness[Idx] == Live)
471 // Used by something else than extractvalue. Mark all return
473 for (unsigned i = 0; i != RetCount; ++i )
474 RetValLiveness[i] = Live;
475 NumLiveRetVals = RetCount;
480 // Single return value
481 RetValLiveness[0] = SurveyUses(TheCall, MaybeLiveRetUses[0]);
482 if (RetValLiveness[0] == Live)
483 NumLiveRetVals = RetCount;
488 // Now we've inspected all callers, record the liveness of our return values.
489 for (unsigned i = 0; i != RetCount; ++i)
490 MarkValue(CreateRet(&F, i), RetValLiveness[i], MaybeLiveRetUses[i]);
492 DEBUG(dbgs() << "DAE - Inspecting args for fn: " << F.getName() << "\n");
494 // Now, check all of our arguments.
496 UseVector MaybeLiveArgUses;
497 for (Function::const_arg_iterator AI = F.arg_begin(),
498 E = F.arg_end(); AI != E; ++AI, ++i) {
499 // See what the effect of this use is (recording any uses that cause
500 // MaybeLive in MaybeLiveArgUses).
501 Liveness Result = SurveyUses(AI, MaybeLiveArgUses);
503 MarkValue(CreateArg(&F, i), Result, MaybeLiveArgUses);
504 // Clear the vector again for the next iteration.
505 MaybeLiveArgUses.clear();
509 /// MarkValue - This function marks the liveness of RA depending on L. If L is
510 /// MaybeLive, it also takes all uses in MaybeLiveUses and records them in Uses,
511 /// such that RA will be marked live if any use in MaybeLiveUses gets marked
513 void DAE::MarkValue(const RetOrArg &RA, Liveness L,
514 const UseVector &MaybeLiveUses) {
516 case Live: MarkLive(RA); break;
519 // Note any uses of this value, so this return value can be
520 // marked live whenever one of the uses becomes live.
521 for (UseVector::const_iterator UI = MaybeLiveUses.begin(),
522 UE = MaybeLiveUses.end(); UI != UE; ++UI)
523 Uses.insert(std::make_pair(*UI, RA));
529 /// MarkLive - Mark the given Function as alive, meaning that it cannot be
530 /// changed in any way. Additionally,
531 /// mark any values that are used as this function's parameters or by its return
532 /// values (according to Uses) live as well.
533 void DAE::MarkLive(const Function &F) {
534 DEBUG(dbgs() << "DAE - Intrinsically live fn: " << F.getName() << "\n");
535 // Mark the function as live.
536 LiveFunctions.insert(&F);
537 // Mark all arguments as live.
538 for (unsigned i = 0, e = F.arg_size(); i != e; ++i)
539 PropagateLiveness(CreateArg(&F, i));
540 // Mark all return values as live.
541 for (unsigned i = 0, e = NumRetVals(&F); i != e; ++i)
542 PropagateLiveness(CreateRet(&F, i));
545 /// MarkLive - Mark the given return value or argument as live. Additionally,
546 /// mark any values that are used by this value (according to Uses) live as
548 void DAE::MarkLive(const RetOrArg &RA) {
549 if (LiveFunctions.count(RA.F))
550 return; // Function was already marked Live.
552 if (!LiveValues.insert(RA).second)
553 return; // We were already marked Live.
555 DEBUG(dbgs() << "DAE - Marking " << RA.getDescription() << " live\n");
556 PropagateLiveness(RA);
559 /// PropagateLiveness - Given that RA is a live value, propagate it's liveness
560 /// to any other values it uses (according to Uses).
561 void DAE::PropagateLiveness(const RetOrArg &RA) {
562 // We don't use upper_bound (or equal_range) here, because our recursive call
563 // to ourselves is likely to cause the upper_bound (which is the first value
564 // not belonging to RA) to become erased and the iterator invalidated.
565 UseMap::iterator Begin = Uses.lower_bound(RA);
566 UseMap::iterator E = Uses.end();
568 for (I = Begin; I != E && I->first == RA; ++I)
571 // Erase RA from the Uses map (from the lower bound to wherever we ended up
573 Uses.erase(Begin, I);
576 // RemoveDeadStuffFromFunction - Remove any arguments and return values from F
577 // that are not in LiveValues. Transform the function and all of the callees of
578 // the function to not have these arguments and return values.
580 bool DAE::RemoveDeadStuffFromFunction(Function *F) {
581 // Don't modify fully live functions
582 if (LiveFunctions.count(F))
585 // Start by computing a new prototype for the function, which is the same as
586 // the old function, but has fewer arguments and a different return type.
587 const FunctionType *FTy = F->getFunctionType();
588 std::vector<const Type*> Params;
590 // Set up to build a new list of parameter attributes.
591 SmallVector<AttributeWithIndex, 8> AttributesVec;
592 const AttrListPtr &PAL = F->getAttributes();
594 // The existing function return attributes.
595 Attributes RAttrs = PAL.getRetAttributes();
596 Attributes FnAttrs = PAL.getFnAttributes();
598 // Find out the new return value.
600 const Type *RetTy = FTy->getReturnType();
601 const Type *NRetTy = NULL;
602 unsigned RetCount = NumRetVals(F);
604 // -1 means unused, other numbers are the new index
605 SmallVector<int, 5> NewRetIdxs(RetCount, -1);
606 std::vector<const Type*> RetTypes;
607 if (RetTy->isVoidTy()) {
610 const StructType *STy = dyn_cast<StructType>(RetTy);
612 // Look at each of the original return values individually.
613 for (unsigned i = 0; i != RetCount; ++i) {
614 RetOrArg Ret = CreateRet(F, i);
615 if (LiveValues.erase(Ret)) {
616 RetTypes.push_back(STy->getElementType(i));
617 NewRetIdxs[i] = RetTypes.size() - 1;
619 ++NumRetValsEliminated;
620 DEBUG(dbgs() << "DAE - Removing return value " << i << " from "
621 << F->getName() << "\n");
625 // We used to return a single value.
626 if (LiveValues.erase(CreateRet(F, 0))) {
627 RetTypes.push_back(RetTy);
630 DEBUG(dbgs() << "DAE - Removing return value from " << F->getName()
632 ++NumRetValsEliminated;
634 if (RetTypes.size() > 1)
635 // More than one return type? Return a struct with them. Also, if we used
636 // to return a struct and didn't change the number of return values,
637 // return a struct again. This prevents changing {something} into
638 // something and {} into void.
639 // Make the new struct packed if we used to return a packed struct
641 NRetTy = StructType::get(STy->getContext(), RetTypes, STy->isPacked());
642 else if (RetTypes.size() == 1)
643 // One return type? Just a simple value then, but only if we didn't use to
644 // return a struct with that simple value before.
645 NRetTy = RetTypes.front();
646 else if (RetTypes.size() == 0)
647 // No return types? Make it void, but only if we didn't use to return {}.
648 NRetTy = Type::getVoidTy(F->getContext());
651 assert(NRetTy && "No new return type found?");
653 // Remove any incompatible attributes, but only if we removed all return
654 // values. Otherwise, ensure that we don't have any conflicting attributes
655 // here. Currently, this should not be possible, but special handling might be
656 // required when new return value attributes are added.
657 if (NRetTy->isVoidTy())
658 RAttrs &= ~Attribute::typeIncompatible(NRetTy);
660 assert((RAttrs & Attribute::typeIncompatible(NRetTy)) == 0
661 && "Return attributes no longer compatible?");
664 AttributesVec.push_back(AttributeWithIndex::get(0, RAttrs));
666 // Remember which arguments are still alive.
667 SmallVector<bool, 10> ArgAlive(FTy->getNumParams(), false);
668 // Construct the new parameter list from non-dead arguments. Also construct
669 // a new set of parameter attributes to correspond. Skip the first parameter
670 // attribute, since that belongs to the return value.
672 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end();
674 RetOrArg Arg = CreateArg(F, i);
675 if (LiveValues.erase(Arg)) {
676 Params.push_back(I->getType());
679 // Get the original parameter attributes (skipping the first one, that is
680 // for the return value.
681 if (Attributes Attrs = PAL.getParamAttributes(i + 1))
682 AttributesVec.push_back(AttributeWithIndex::get(Params.size(), Attrs));
684 ++NumArgumentsEliminated;
685 DEBUG(dbgs() << "DAE - Removing argument " << i << " (" << I->getName()
686 << ") from " << F->getName() << "\n");
690 if (FnAttrs != Attribute::None)
691 AttributesVec.push_back(AttributeWithIndex::get(~0, FnAttrs));
693 // Reconstruct the AttributesList based on the vector we constructed.
694 AttrListPtr NewPAL = AttrListPtr::get(AttributesVec.begin(),
695 AttributesVec.end());
697 // Create the new function type based on the recomputed parameters.
698 FunctionType *NFTy = FunctionType::get(NRetTy, Params, FTy->isVarArg());
704 // Create the new function body and insert it into the module...
705 Function *NF = Function::Create(NFTy, F->getLinkage());
706 NF->copyAttributesFrom(F);
707 NF->setAttributes(NewPAL);
708 // Insert the new function before the old function, so we won't be processing
710 F->getParent()->getFunctionList().insert(F, NF);
713 // Loop over all of the callers of the function, transforming the call sites
714 // to pass in a smaller number of arguments into the new function.
716 std::vector<Value*> Args;
717 while (!F->use_empty()) {
718 CallSite CS = CallSite::get(F->use_back());
719 Instruction *Call = CS.getInstruction();
721 AttributesVec.clear();
722 const AttrListPtr &CallPAL = CS.getAttributes();
724 // The call return attributes.
725 Attributes RAttrs = CallPAL.getRetAttributes();
726 Attributes FnAttrs = CallPAL.getFnAttributes();
727 // Adjust in case the function was changed to return void.
728 RAttrs &= ~Attribute::typeIncompatible(NF->getReturnType());
730 AttributesVec.push_back(AttributeWithIndex::get(0, RAttrs));
732 // Declare these outside of the loops, so we can reuse them for the second
733 // loop, which loops the varargs.
734 CallSite::arg_iterator I = CS.arg_begin();
736 // Loop over those operands, corresponding to the normal arguments to the
737 // original function, and add those that are still alive.
738 for (unsigned e = FTy->getNumParams(); i != e; ++I, ++i)
741 // Get original parameter attributes, but skip return attributes.
742 if (Attributes Attrs = CallPAL.getParamAttributes(i + 1))
743 AttributesVec.push_back(AttributeWithIndex::get(Args.size(), Attrs));
746 // Push any varargs arguments on the list. Don't forget their attributes.
747 for (CallSite::arg_iterator E = CS.arg_end(); I != E; ++I, ++i) {
749 if (Attributes Attrs = CallPAL.getParamAttributes(i + 1))
750 AttributesVec.push_back(AttributeWithIndex::get(Args.size(), Attrs));
753 if (FnAttrs != Attribute::None)
754 AttributesVec.push_back(AttributeWithIndex::get(~0, FnAttrs));
756 // Reconstruct the AttributesList based on the vector we constructed.
757 AttrListPtr NewCallPAL = AttrListPtr::get(AttributesVec.begin(),
758 AttributesVec.end());
761 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
762 New = InvokeInst::Create(NF, II->getNormalDest(), II->getUnwindDest(),
763 Args.begin(), Args.end(), "", Call);
764 cast<InvokeInst>(New)->setCallingConv(CS.getCallingConv());
765 cast<InvokeInst>(New)->setAttributes(NewCallPAL);
767 New = CallInst::Create(NF, Args.begin(), Args.end(), "", Call);
768 cast<CallInst>(New)->setCallingConv(CS.getCallingConv());
769 cast<CallInst>(New)->setAttributes(NewCallPAL);
770 if (cast<CallInst>(Call)->isTailCall())
771 cast<CallInst>(New)->setTailCall();
775 if (!Call->use_empty()) {
776 if (New->getType() == Call->getType()) {
777 // Return type not changed? Just replace users then.
778 Call->replaceAllUsesWith(New);
780 } else if (New->getType()->isVoidTy()) {
781 // Our return value has uses, but they will get removed later on.
782 // Replace by null for now.
783 Call->replaceAllUsesWith(Constant::getNullValue(Call->getType()));
785 assert(RetTy->isStructTy() &&
786 "Return type changed, but not into a void. The old return type"
787 " must have been a struct!");
788 Instruction *InsertPt = Call;
789 if (InvokeInst *II = dyn_cast<InvokeInst>(Call)) {
790 BasicBlock::iterator IP = II->getNormalDest()->begin();
791 while (isa<PHINode>(IP)) ++IP;
795 // We used to return a struct. Instead of doing smart stuff with all the
796 // uses of this struct, we will just rebuild it using
797 // extract/insertvalue chaining and let instcombine clean that up.
799 // Start out building up our return value from undef
800 Value *RetVal = UndefValue::get(RetTy);
801 for (unsigned i = 0; i != RetCount; ++i)
802 if (NewRetIdxs[i] != -1) {
804 if (RetTypes.size() > 1)
805 // We are still returning a struct, so extract the value from our
807 V = ExtractValueInst::Create(New, NewRetIdxs[i], "newret",
810 // We are now returning a single element, so just insert that
812 // Insert the value at the old position
813 RetVal = InsertValueInst::Create(RetVal, V, i, "oldret", InsertPt);
815 // Now, replace all uses of the old call instruction with the return
817 Call->replaceAllUsesWith(RetVal);
822 // Finally, remove the old call from the program, reducing the use-count of
824 Call->eraseFromParent();
827 // Since we have now created the new function, splice the body of the old
828 // function right into the new function, leaving the old rotting hulk of the
830 NF->getBasicBlockList().splice(NF->begin(), F->getBasicBlockList());
832 // Loop over the argument list, transfering uses of the old arguments over to
833 // the new arguments, also transfering over the names as well.
835 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(),
836 I2 = NF->arg_begin(); I != E; ++I, ++i)
838 // If this is a live argument, move the name and users over to the new
840 I->replaceAllUsesWith(I2);
844 // If this argument is dead, replace any uses of it with null constants
845 // (these are guaranteed to become unused later on).
846 I->replaceAllUsesWith(Constant::getNullValue(I->getType()));
849 // If we change the return value of the function we must rewrite any return
850 // instructions. Check this now.
851 if (F->getReturnType() != NF->getReturnType())
852 for (Function::iterator BB = NF->begin(), E = NF->end(); BB != E; ++BB)
853 if (ReturnInst *RI = dyn_cast<ReturnInst>(BB->getTerminator())) {
856 if (NFTy->getReturnType() == Type::getVoidTy(F->getContext())) {
859 assert (RetTy->isStructTy());
860 // The original return value was a struct, insert
861 // extractvalue/insertvalue chains to extract only the values we need
862 // to return and insert them into our new result.
863 // This does generate messy code, but we'll let it to instcombine to
865 Value *OldRet = RI->getOperand(0);
866 // Start out building up our return value from undef
867 RetVal = UndefValue::get(NRetTy);
868 for (unsigned i = 0; i != RetCount; ++i)
869 if (NewRetIdxs[i] != -1) {
870 ExtractValueInst *EV = ExtractValueInst::Create(OldRet, i,
872 if (RetTypes.size() > 1) {
873 // We're still returning a struct, so reinsert the value into
874 // our new return value at the new index
876 RetVal = InsertValueInst::Create(RetVal, EV, NewRetIdxs[i],
879 // We are now only returning a simple value, so just return the
885 // Replace the return instruction with one returning the new return
886 // value (possibly 0 if we became void).
887 ReturnInst::Create(F->getContext(), RetVal, RI);
888 BB->getInstList().erase(RI);
891 // Now that the old function is dead, delete it.
892 F->eraseFromParent();
897 bool DAE::runOnModule(Module &M) {
898 bool Changed = false;
900 // First pass: Do a simple check to see if any functions can have their "..."
901 // removed. We can do this if they never call va_start. This loop cannot be
902 // fused with the next loop, because deleting a function invalidates
903 // information computed while surveying other functions.
904 DEBUG(dbgs() << "DAE - Deleting dead varargs\n");
905 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) {
907 if (F.getFunctionType()->isVarArg())
908 Changed |= DeleteDeadVarargs(F);
911 // Second phase:loop through the module, determining which arguments are live.
912 // We assume all arguments are dead unless proven otherwise (allowing us to
913 // determine that dead arguments passed into recursive functions are dead).
915 DEBUG(dbgs() << "DAE - Determining liveness\n");
916 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
919 // Now, remove all dead arguments and return values from each function in
921 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) {
922 // Increment now, because the function will probably get removed (ie.
923 // replaced by a new one).
925 Changed |= RemoveDeadStuffFromFunction(F);