DeadArgumentElimination.cpp revision 3715e45da564e1c92410bf7b2d799d998664ff44
1//===-- DeadArgumentElimination.cpp - Eliminate dead arguments ------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9// 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. 14// 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. 17// 18//===----------------------------------------------------------------------===// 19 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" 36#include <map> 37#include <set> 38using namespace llvm; 39 40STATISTIC(NumArgumentsEliminated, "Number of unread args removed"); 41STATISTIC(NumRetValsEliminated , "Number of unused return values removed"); 42 43namespace { 44 /// DAE - The dead argument elimination pass. 45 /// 46 class DAE : public ModulePass { 47 public: 48 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 51 /// interchangably. 52 struct RetOrArg { 53 RetOrArg(const Function *F, unsigned Idx, bool IsArg) : F(F), Idx(Idx), 54 IsArg(IsArg) {} 55 const Function *F; 56 unsigned Idx; 57 bool IsArg; 58 59 /// Make RetOrArg comparable, so we can put it into a map. 60 bool operator<(const RetOrArg &O) const { 61 if (F != O.F) 62 return F < O.F; 63 else if (Idx != O.Idx) 64 return Idx < O.Idx; 65 else 66 return IsArg < O.IsArg; 67 } 68 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; 72 } 73 74 std::string getDescription() const { 75 return std::string((IsArg ? "Argument #" : "Return value #")) 76 + utostr(Idx) + " of function " + F->getNameStr(); 77 } 78 }; 79 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 }; 86 87 /// Convenience wrapper 88 RetOrArg CreateRet(const Function *F, unsigned Idx) { 89 return RetOrArg(F, Idx, false); 90 } 91 /// Convenience wrapper 92 RetOrArg CreateArg(const Function *F, unsigned Idx) { 93 return RetOrArg(F, Idx, true); 94 } 95 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 105 /// argument to F. 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 110 /// directly to F. 111 UseMap Uses; 112 113 typedef std::set<RetOrArg> LiveSet; 114 typedef std::set<const Function*> LiveFuncSet; 115 116 /// This set contains all values that have been determined to be live. 117 LiveSet LiveValues; 118 /// This set contains all values that are cannot be changed in any way. 119 LiveFuncSet LiveFunctions; 120 121 typedef SmallVector<RetOrArg, 5> UseVector; 122 123 public: 124 static char ID; // Pass identification, replacement for typeid 125 DAE() : ModulePass(&ID) {} 126 bool runOnModule(Module &M); 127 128 virtual bool ShouldHackArguments() const { return false; } 129 130 private: 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); 135 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); 144 }; 145} 146 147 148char DAE::ID = 0; 149static RegisterPass<DAE> 150X("deadargelim", "Dead Argument Elimination"); 151 152namespace { 153 /// DAH - DeadArgumentHacking pass - Same as dead argument elimination, but 154 /// deletes arguments to functions which are external. This is only for use 155 /// by bugpoint. 156 struct DAH : public DAE { 157 static char ID; 158 virtual bool ShouldHackArguments() const { return true; } 159 }; 160} 161 162char DAH::ID = 0; 163static RegisterPass<DAH> 164Y("deadarghaX0r", "Dead Argument Hacking (BUGPOINT USE ONLY; DO NOT USE)"); 165 166/// createDeadArgEliminationPass - This pass removes arguments from functions 167/// which are not used by the body of the function. 168/// 169ModulePass *llvm::createDeadArgEliminationPass() { return new DAE(); } 170ModulePass *llvm::createDeadArgHackingPass() { return new DAH(); } 171 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. 174bool DAE::DeleteDeadVarargs(Function &Fn) { 175 assert(Fn.getFunctionType()->isVarArg() && "Function isn't varargs!"); 176 if (Fn.isDeclaration() || !Fn.hasLocalLinkage()) return false; 177 178 // Ensure that the function is only directly called. 179 if (Fn.hasAddressTaken()) 180 return false; 181 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) 188 return false; 189 } 190 } 191 } 192 193 // If we get here, there are no calls to llvm.vastart in the function body, 194 // remove the "..." and adjust all the calls. 195 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(); 199 200 std::vector<const Type*> Params(FTy->param_begin(), FTy->param_end()); 201 FunctionType *NFTy = FunctionType::get(FTy->getReturnType(), 202 Params, false); 203 unsigned NumArgs = Params.size(); 204 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); 209 NF->takeName(&Fn); 210 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. 213 // 214 std::vector<Value*> Args; 215 while (!Fn.use_empty()) { 216 CallSite CS = CallSite::get(Fn.use_back()); 217 Instruction *Call = CS.getInstruction(); 218 219 // Pass all the same arguments. 220 Args.assign(CS.arg_begin(), CS.arg_begin()+NumArgs); 221 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()); 231 } 232 233 Instruction *New; 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); 239 } else { 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(); 245 } 246 Args.clear(); 247 248 if (!Call->use_empty()) 249 Call->replaceAllUsesWith(New); 250 251 New->takeName(Call); 252 253 // Finally, remove the old call from the program, reducing the use-count of 254 // F. 255 Call->eraseFromParent(); 256 } 257 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 260 // function empty. 261 NF->getBasicBlockList().splice(NF->begin(), Fn.getBasicBlockList()); 262 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. 266 // 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); 271 I2->takeName(I); 272 } 273 274 // Finally, nuke the old function. 275 Fn.eraseFromParent(); 276 return true; 277} 278 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. 282static unsigned NumRetVals(const Function *F) { 283 if (F->getReturnType()->isVoidTy()) 284 return 0; 285 else if (const StructType *STy = dyn_cast<StructType>(F->getReturnType())) 286 return STy->getNumElements(); 287 else 288 return 1; 289} 290 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 293/// liveness of Use. 294DAE::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)) 297 return Live; 298 299 // We're maybe live otherwise, but remember that we must become live if 300 // Use becomes live. 301 MaybeLiveUses.push_back(Use); 302 return MaybeLive; 303} 304 305 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. 309/// 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 312/// it at 0. 313DAE::Liveness DAE::SurveyUse(Value::const_use_iterator U, 314 UseVector &MaybeLiveUses, unsigned RetValNum) { 315 const User *V = *U; 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 320 // orginal Use. 321 RetOrArg Use = CreateRet(RI->getParent()->getParent(), RetValNum); 322 // We might be live, depending on the liveness of Use. 323 return MarkIfNotLive(Use, MaybeLiveUses); 324 } 325 if (const InsertValueInst *IV = dyn_cast<InsertValueInst>(V)) { 326 if (U.getOperandNo() != InsertValueInst::getAggregateOperandIndex() 327 && IV->hasIndices()) 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(); 332 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. 335 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); 340 if (Result == Live) 341 break; 342 } 343 return Result; 344 } 345 346 if (ImmutableCallSite CS = V) { 347 const Function *F = CS.getCalledFunction(); 348 if (F) { 349 // Used in a direct call. 350 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); 356 357 if (ArgNo >= F->getFunctionType()->getNumParams()) 358 // The value is passed in through a vararg! Must be live. 359 return Live; 360 361 assert(CS.getArgument(ArgNo) 362 == CS->getOperand(U.getOperandNo()) 363 && "Argument is not where we expected it"); 364 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); 369 } 370 } 371 // Used in any other way? Value must be live. 372 return Live; 373} 374 375/// SurveyUses - This looks at all the uses of the given value 376/// Returns the Liveness deduced from the uses of this value. 377/// 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). 381DAE::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; 384 // Check each use. 385 for (Value::const_use_iterator I = V->use_begin(), 386 E = V->use_end(); I != E; ++I) { 387 Result = SurveyUse(I, MaybeLiveUses); 388 if (Result == Live) 389 break; 390 } 391 return Result; 392} 393 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 397// map. 398// 399// We consider arguments of non-internal functions to be intrinsically alive as 400// well as arguments to functions which have their "address taken". 401// 402void 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); 407 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); 413 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. 419 MarkLive(F); 420 return; 421 } 422 423 if (!F.hasLocalLinkage() && (!ShouldHackArguments() || F.isIntrinsic())) { 424 MarkLive(F); 425 return; 426 } 427 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(); 435 I != E; ++I) { 436 // If the function is PASSED IN as an argument, its address has been 437 // taken. 438 ImmutableCallSite CS(*I); 439 if (!CS || !CS.isCallee(I)) { 440 MarkLive(F); 441 return; 442 } 443 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? 447 MarkLive(F); 448 return; 449 } 450 451 // If we end up here, we are looking at a direct call to our function. 452 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) { 456 if (STy) { 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) 468 NumLiveRetVals++; 469 } 470 } else { 471 // Used by something else than extractvalue. Mark all return 472 // values as live. 473 for (unsigned i = 0; i != RetCount; ++i ) 474 RetValLiveness[i] = Live; 475 NumLiveRetVals = RetCount; 476 break; 477 } 478 } 479 } else { 480 // Single return value 481 RetValLiveness[0] = SurveyUses(TheCall, MaybeLiveRetUses[0]); 482 if (RetValLiveness[0] == Live) 483 NumLiveRetVals = RetCount; 484 } 485 } 486 } 487 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]); 491 492 DEBUG(dbgs() << "DAE - Inspecting args for fn: " << F.getName() << "\n"); 493 494 // Now, check all of our arguments. 495 unsigned i = 0; 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); 502 // Mark the result. 503 MarkValue(CreateArg(&F, i), Result, MaybeLiveArgUses); 504 // Clear the vector again for the next iteration. 505 MaybeLiveArgUses.clear(); 506 } 507} 508 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 512/// live later on. 513void DAE::MarkValue(const RetOrArg &RA, Liveness L, 514 const UseVector &MaybeLiveUses) { 515 switch (L) { 516 case Live: MarkLive(RA); break; 517 case MaybeLive: 518 { 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)); 524 break; 525 } 526 } 527} 528 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. 533void 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)); 543} 544 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 547/// well. 548void DAE::MarkLive(const RetOrArg &RA) { 549 if (LiveFunctions.count(RA.F)) 550 return; // Function was already marked Live. 551 552 if (!LiveValues.insert(RA).second) 553 return; // We were already marked Live. 554 555 DEBUG(dbgs() << "DAE - Marking " << RA.getDescription() << " live\n"); 556 PropagateLiveness(RA); 557} 558 559/// PropagateLiveness - Given that RA is a live value, propagate it's liveness 560/// to any other values it uses (according to Uses). 561void 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(); 567 UseMap::iterator I; 568 for (I = Begin; I != E && I->first == RA; ++I) 569 MarkLive(I->second); 570 571 // Erase RA from the Uses map (from the lower bound to wherever we ended up 572 // after the loop). 573 Uses.erase(Begin, I); 574} 575 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. 579// 580bool DAE::RemoveDeadStuffFromFunction(Function *F) { 581 // Don't modify fully live functions 582 if (LiveFunctions.count(F)) 583 return false; 584 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; 589 590 // Set up to build a new list of parameter attributes. 591 SmallVector<AttributeWithIndex, 8> AttributesVec; 592 const AttrListPtr &PAL = F->getAttributes(); 593 594 // The existing function return attributes. 595 Attributes RAttrs = PAL.getRetAttributes(); 596 Attributes FnAttrs = PAL.getFnAttributes(); 597 598 // Find out the new return value. 599 600 const Type *RetTy = FTy->getReturnType(); 601 const Type *NRetTy = NULL; 602 unsigned RetCount = NumRetVals(F); 603 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()) { 608 NRetTy = RetTy; 609 } else { 610 const StructType *STy = dyn_cast<StructType>(RetTy); 611 if (STy) 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; 618 } else { 619 ++NumRetValsEliminated; 620 DEBUG(dbgs() << "DAE - Removing return value " << i << " from " 621 << F->getName() << "\n"); 622 } 623 } 624 else 625 // We used to return a single value. 626 if (LiveValues.erase(CreateRet(F, 0))) { 627 RetTypes.push_back(RetTy); 628 NewRetIdxs[0] = 0; 629 } else { 630 DEBUG(dbgs() << "DAE - Removing return value from " << F->getName() 631 << "\n"); 632 ++NumRetValsEliminated; 633 } 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 640 // already. 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()); 649 } 650 651 assert(NRetTy && "No new return type found?"); 652 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); 659 else 660 assert((RAttrs & Attribute::typeIncompatible(NRetTy)) == 0 661 && "Return attributes no longer compatible?"); 662 663 if (RAttrs) 664 AttributesVec.push_back(AttributeWithIndex::get(0, RAttrs)); 665 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. 671 unsigned i = 0; 672 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); 673 I != E; ++I, ++i) { 674 RetOrArg Arg = CreateArg(F, i); 675 if (LiveValues.erase(Arg)) { 676 Params.push_back(I->getType()); 677 ArgAlive[i] = true; 678 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)); 683 } else { 684 ++NumArgumentsEliminated; 685 DEBUG(dbgs() << "DAE - Removing argument " << i << " (" << I->getName() 686 << ") from " << F->getName() << "\n"); 687 } 688 } 689 690 if (FnAttrs != Attribute::None) 691 AttributesVec.push_back(AttributeWithIndex::get(~0, FnAttrs)); 692 693 // Reconstruct the AttributesList based on the vector we constructed. 694 AttrListPtr NewPAL = AttrListPtr::get(AttributesVec.begin(), 695 AttributesVec.end()); 696 697 // Create the new function type based on the recomputed parameters. 698 FunctionType *NFTy = FunctionType::get(NRetTy, Params, FTy->isVarArg()); 699 700 // No change? 701 if (NFTy == FTy) 702 return false; 703 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 709 // it again. 710 F->getParent()->getFunctionList().insert(F, NF); 711 NF->takeName(F); 712 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. 715 // 716 std::vector<Value*> Args; 717 while (!F->use_empty()) { 718 CallSite CS = CallSite::get(F->use_back()); 719 Instruction *Call = CS.getInstruction(); 720 721 AttributesVec.clear(); 722 const AttrListPtr &CallPAL = CS.getAttributes(); 723 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()); 729 if (RAttrs) 730 AttributesVec.push_back(AttributeWithIndex::get(0, RAttrs)); 731 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(); 735 unsigned i = 0; 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) 739 if (ArgAlive[i]) { 740 Args.push_back(*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)); 744 } 745 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) { 748 Args.push_back(*I); 749 if (Attributes Attrs = CallPAL.getParamAttributes(i + 1)) 750 AttributesVec.push_back(AttributeWithIndex::get(Args.size(), Attrs)); 751 } 752 753 if (FnAttrs != Attribute::None) 754 AttributesVec.push_back(AttributeWithIndex::get(~0, FnAttrs)); 755 756 // Reconstruct the AttributesList based on the vector we constructed. 757 AttrListPtr NewCallPAL = AttrListPtr::get(AttributesVec.begin(), 758 AttributesVec.end()); 759 760 Instruction *New; 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); 766 } else { 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(); 772 } 773 Args.clear(); 774 775 if (!Call->use_empty()) { 776 if (New->getType() == Call->getType()) { 777 // Return type not changed? Just replace users then. 778 Call->replaceAllUsesWith(New); 779 New->takeName(Call); 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())); 784 } else { 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; 792 InsertPt = IP; 793 } 794 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. 798 // 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) { 803 Value *V; 804 if (RetTypes.size() > 1) 805 // We are still returning a struct, so extract the value from our 806 // return value 807 V = ExtractValueInst::Create(New, NewRetIdxs[i], "newret", 808 InsertPt); 809 else 810 // We are now returning a single element, so just insert that 811 V = New; 812 // Insert the value at the old position 813 RetVal = InsertValueInst::Create(RetVal, V, i, "oldret", InsertPt); 814 } 815 // Now, replace all uses of the old call instruction with the return 816 // struct we built 817 Call->replaceAllUsesWith(RetVal); 818 New->takeName(Call); 819 } 820 } 821 822 // Finally, remove the old call from the program, reducing the use-count of 823 // F. 824 Call->eraseFromParent(); 825 } 826 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 829 // function empty. 830 NF->getBasicBlockList().splice(NF->begin(), F->getBasicBlockList()); 831 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. 834 i = 0; 835 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(), 836 I2 = NF->arg_begin(); I != E; ++I, ++i) 837 if (ArgAlive[i]) { 838 // If this is a live argument, move the name and users over to the new 839 // version. 840 I->replaceAllUsesWith(I2); 841 I2->takeName(I); 842 ++I2; 843 } else { 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())); 847 } 848 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())) { 854 Value *RetVal; 855 856 if (NFTy->getReturnType() == Type::getVoidTy(F->getContext())) { 857 RetVal = 0; 858 } else { 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 864 // clean that up. 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, 871 "oldret", RI); 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 875 876 RetVal = InsertValueInst::Create(RetVal, EV, NewRetIdxs[i], 877 "newret", RI); 878 } else { 879 // We are now only returning a simple value, so just return the 880 // extracted value. 881 RetVal = EV; 882 } 883 } 884 } 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); 889 } 890 891 // Now that the old function is dead, delete it. 892 F->eraseFromParent(); 893 894 return true; 895} 896 897bool DAE::RemoveDeadParamsFromCallersOf(Function *F) { 898 // Don't modify fully live functions 899 if (LiveFunctions.count(F)) 900 return false; 901 902 // Make a list of the dead arguments. 903 SmallVector<int, 10> ArgDead; 904 unsigned i = 0; 905 for (Function::arg_iterator I = F->arg_begin(), E = F->arg_end(); 906 I != E; ++I, ++i) { 907 RetOrArg Arg = CreateArg(F, i); 908 if (!LiveValues.count(Arg)) 909 ArgDead.push_back(i); 910 } 911 if (ArgDead.empty()) 912 return false; 913 914 bool MadeChange = false; 915 for (Function::use_iterator I = F->use_begin(), E = F->use_end(); 916 I != E; ++I) { 917 CallSite CS = CallSite::get(*I); 918 if (CS.getInstruction() && CS.isCallee(I)) { 919 for (unsigned i = 0, e = ArgDead.size(); i != e; ++i) { 920 Value *A = CS.getArgument(ArgDead[i]); 921 if (!isa<UndefValue>(A)) { 922 ++NumParametersEliminated; 923 MadeChange = true; 924 CS.setArgument(ArgDead[i], UndefValue::get(A->getType())); 925 RecursivelyDeleteTriviallyDeadInstructions(A); 926 } 927 } 928 } 929 } 930 931 return MadeChange; 932} 933 934bool DAE::runOnModule(Module &M) { 935 bool Changed = false; 936 937 // First pass: Do a simple check to see if any functions can have their "..." 938 // removed. We can do this if they never call va_start. This loop cannot be 939 // fused with the next loop, because deleting a function invalidates 940 // information computed while surveying other functions. 941 DEBUG(dbgs() << "DAE - Deleting dead varargs\n"); 942 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) { 943 Function &F = *I++; 944 if (F.getFunctionType()->isVarArg()) 945 Changed |= DeleteDeadVarargs(F); 946 } 947 948 // Second phase:loop through the module, determining which arguments are live. 949 // We assume all arguments are dead unless proven otherwise (allowing us to 950 // determine that dead arguments passed into recursive functions are dead). 951 // 952 DEBUG(dbgs() << "DAE - Determining liveness\n"); 953 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) 954 SurveyFunction(*I); 955 956 // Now, remove all dead arguments and return values from each function in 957 // turn. 958 for (Module::iterator I = M.begin(), E = M.end(); I != E; ) { 959 // Increment now, because the function will probably get removed (ie. 960 // replaced by a new one). 961 Function *F = I++; 962 Changed |= RemoveDeadStuffFromFunction(F); 963 } 964 return Changed; 965} 966