Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 1 | //===-- DeadArgumentElimination.cpp - Eliminate dead arguments ------------===// |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame^] | 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 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. |
| 13 | // |
| 14 | // This pass is often useful as a cleanup pass to run after aggressive |
| 15 | // interprocedural passes, which add possibly-dead arguments. |
| 16 | // |
| 17 | //===----------------------------------------------------------------------===// |
| 18 | |
| 19 | #include "llvm/Transforms/IPO.h" |
| 20 | #include "llvm/Module.h" |
| 21 | #include "llvm/Pass.h" |
| 22 | #include "llvm/DerivedTypes.h" |
| 23 | #include "llvm/Constant.h" |
| 24 | #include "llvm/iOther.h" |
| 25 | #include "llvm/iTerminators.h" |
| 26 | #include "llvm/Support/CallSite.h" |
Chris Lattner | 8abcd56 | 2003-08-01 22:15:03 +0000 | [diff] [blame] | 27 | #include "Support/Debug.h" |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 28 | #include "Support/Statistic.h" |
| 29 | #include "Support/iterator" |
| 30 | #include <set> |
| 31 | |
| 32 | namespace { |
| 33 | Statistic<> NumArgumentsEliminated("deadargelim", "Number of args removed"); |
| 34 | |
| 35 | struct DAE : public Pass { |
Chris Lattner | 2ab04f7 | 2003-06-25 04:12:49 +0000 | [diff] [blame] | 36 | DAE(bool DFEF = false) : DeleteFromExternalFunctions(DFEF) {} |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 37 | bool run(Module &M); |
Chris Lattner | 2ab04f7 | 2003-06-25 04:12:49 +0000 | [diff] [blame] | 38 | |
| 39 | private: |
| 40 | bool DeleteFromExternalFunctions; |
| 41 | bool FunctionArgumentsIntrinsicallyAlive(const Function &F); |
| 42 | void RemoveDeadArgumentsFromFunction(Function *F, |
| 43 | std::set<Argument*> &DeadArguments); |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 44 | }; |
| 45 | RegisterOpt<DAE> X("deadargelim", "Dead Argument Elimination"); |
| 46 | } |
| 47 | |
Chris Lattner | 2ab04f7 | 2003-06-25 04:12:49 +0000 | [diff] [blame] | 48 | /// createDeadArgEliminationPass - This pass removes arguments from functions |
| 49 | /// which are not used by the body of the function. If |
| 50 | /// DeleteFromExternalFunctions is true, the pass will modify functions that |
| 51 | /// have external linkage, which is not usually safe (this is used by bugpoint |
| 52 | /// to reduce testcases). |
| 53 | /// |
| 54 | Pass *createDeadArgEliminationPass(bool DeleteFromExternalFunctions) { |
| 55 | return new DAE(DeleteFromExternalFunctions); |
| 56 | } |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 57 | |
| 58 | |
| 59 | // FunctionArgumentsIntrinsicallyAlive - Return true if the arguments of the |
| 60 | // specified function are intrinsically alive. |
| 61 | // |
| 62 | // We consider arguments of non-internal functions to be intrinsically alive as |
| 63 | // well as arguments to functions which have their "address taken". |
| 64 | // |
Chris Lattner | 2ab04f7 | 2003-06-25 04:12:49 +0000 | [diff] [blame] | 65 | bool DAE::FunctionArgumentsIntrinsicallyAlive(const Function &F) { |
| 66 | if (!F.hasInternalLinkage() && !DeleteFromExternalFunctions) return true; |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 67 | |
| 68 | for (Value::use_const_iterator I = F.use_begin(), E = F.use_end(); I!=E; ++I){ |
| 69 | // If this use is anything other than a call site, the function is alive. |
| 70 | CallSite CS = CallSite::get(const_cast<User*>(*I)); |
| 71 | if (!CS.getInstruction()) return true; // Not a valid call site? |
| 72 | |
| 73 | // If the function is PASSED IN as an argument, its address has been taken |
| 74 | for (CallSite::arg_iterator AI = CS.arg_begin(), E = CS.arg_end(); AI != E; |
| 75 | ++AI) |
| 76 | if (AI->get() == &F) return true; |
| 77 | } |
| 78 | return false; |
| 79 | } |
| 80 | |
| 81 | namespace { |
| 82 | enum ArgumentLiveness { Alive, MaybeLive, Dead }; |
| 83 | } |
| 84 | |
| 85 | // getArgumentLiveness - Inspect an argument, determining if is known Alive |
| 86 | // (used in a computation), MaybeLive (only passed as an argument to a call), or |
| 87 | // Dead (not used). |
| 88 | static ArgumentLiveness getArgumentLiveness(const Argument &A) { |
| 89 | if (A.use_empty()) return Dead; // First check, directly dead? |
| 90 | |
| 91 | // Scan through all of the uses, looking for non-argument passing uses. |
| 92 | for (Value::use_const_iterator I = A.use_begin(), E = A.use_end(); I!=E;++I) { |
| 93 | CallSite CS = CallSite::get(const_cast<User*>(*I)); |
| 94 | if (!CS.getInstruction()) { |
| 95 | // If its used by something that is not a call or invoke, it's alive! |
| 96 | return Alive; |
| 97 | } |
| 98 | // If it's an indirect call, mark it alive... |
| 99 | Function *Callee = CS.getCalledFunction(); |
| 100 | if (!Callee) return Alive; |
| 101 | |
Chris Lattner | 5d3c145 | 2003-06-18 16:25:51 +0000 | [diff] [blame] | 102 | // Check to see if it's passed through a va_arg area: if so, we cannot |
| 103 | // remove it. |
| 104 | unsigned NumFixedArgs = Callee->getFunctionType()->getNumParams(); |
| 105 | for (CallSite::arg_iterator AI = CS.arg_begin()+NumFixedArgs; |
| 106 | AI != CS.arg_end(); ++AI) |
| 107 | if (AI->get() == &A) // If passed through va_arg area, we cannot remove it |
| 108 | return Alive; |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 109 | } |
| 110 | |
| 111 | return MaybeLive; // It must be used, but only as argument to a function |
| 112 | } |
| 113 | |
| 114 | // isMaybeLiveArgumentNowAlive - Check to see if Arg is alive. At this point, |
| 115 | // we know that the only uses of Arg are to be passed in as an argument to a |
| 116 | // function call. Check to see if the formal argument passed in is in the |
| 117 | // LiveArguments set. If so, return true. |
| 118 | // |
| 119 | static bool isMaybeLiveArgumentNowAlive(Argument *Arg, |
| 120 | const std::set<Argument*> &LiveArguments) { |
| 121 | for (Value::use_iterator I = Arg->use_begin(), E = Arg->use_end(); I!=E; ++I){ |
| 122 | CallSite CS = CallSite::get(*I); |
| 123 | |
| 124 | // We know that this can only be used for direct calls... |
| 125 | Function *Callee = cast<Function>(CS.getCalledValue()); |
| 126 | |
| 127 | // Loop over all of the arguments (because Arg may be passed into the call |
| 128 | // multiple times) and check to see if any are now alive... |
| 129 | CallSite::arg_iterator CSAI = CS.arg_begin(); |
| 130 | for (Function::aiterator AI = Callee->abegin(), E = Callee->aend(); |
| 131 | AI != E; ++AI, ++CSAI) |
| 132 | // If this is the argument we are looking for, check to see if it's alive |
| 133 | if (*CSAI == Arg && LiveArguments.count(AI)) |
| 134 | return true; |
| 135 | } |
| 136 | return false; |
| 137 | } |
| 138 | |
| 139 | // MarkArgumentLive - The MaybeLive argument 'Arg' is now known to be alive. |
| 140 | // Mark it live in the specified sets and recursively mark arguments in callers |
| 141 | // live that are needed to pass in a value. |
| 142 | // |
| 143 | static void MarkArgumentLive(Argument *Arg, |
| 144 | std::set<Argument*> &MaybeLiveArguments, |
| 145 | std::set<Argument*> &LiveArguments, |
| 146 | const std::multimap<Function*, CallSite> &CallSites) { |
| 147 | DEBUG(std::cerr << " MaybeLive argument now live: " << Arg->getName()<<"\n"); |
| 148 | assert(MaybeLiveArguments.count(Arg) && !LiveArguments.count(Arg) && |
| 149 | "Arg not MaybeLive?"); |
| 150 | MaybeLiveArguments.erase(Arg); |
| 151 | LiveArguments.insert(Arg); |
| 152 | |
| 153 | // Loop over all of the call sites of the function, making any arguments |
| 154 | // passed in to provide a value for this argument live as necessary. |
| 155 | // |
| 156 | Function *Fn = Arg->getParent(); |
| 157 | unsigned ArgNo = std::distance(Fn->abegin(), Function::aiterator(Arg)); |
| 158 | |
| 159 | std::multimap<Function*, CallSite>::const_iterator I = |
| 160 | CallSites.lower_bound(Fn); |
| 161 | for (; I != CallSites.end() && I->first == Fn; ++I) { |
| 162 | const CallSite &CS = I->second; |
| 163 | if (Argument *ActualArg = dyn_cast<Argument>(*(CS.arg_begin()+ArgNo))) |
| 164 | if (MaybeLiveArguments.count(ActualArg)) |
| 165 | MarkArgumentLive(ActualArg, MaybeLiveArguments, LiveArguments, |
| 166 | CallSites); |
| 167 | } |
| 168 | } |
| 169 | |
| 170 | // RemoveDeadArgumentsFromFunction - We know that F has dead arguments, as |
| 171 | // specified by the DeadArguments list. Transform the function and all of the |
| 172 | // callees of the function to not have these arguments. |
| 173 | // |
Chris Lattner | 2ab04f7 | 2003-06-25 04:12:49 +0000 | [diff] [blame] | 174 | void DAE::RemoveDeadArgumentsFromFunction(Function *F, |
| 175 | std::set<Argument*> &DeadArguments){ |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 176 | // Start by computing a new prototype for the function, which is the same as |
| 177 | // the old function, but has fewer arguments. |
| 178 | const FunctionType *FTy = F->getFunctionType(); |
| 179 | std::vector<const Type*> Params; |
| 180 | |
| 181 | for (Function::aiterator I = F->abegin(), E = F->aend(); I != E; ++I) |
| 182 | if (!DeadArguments.count(I)) |
| 183 | Params.push_back(I->getType()); |
| 184 | |
| 185 | FunctionType *NFTy = FunctionType::get(FTy->getReturnType(), Params, |
| 186 | FTy->isVarArg()); |
| 187 | |
| 188 | // Create the new function body and insert it into the module... |
Chris Lattner | 2ab04f7 | 2003-06-25 04:12:49 +0000 | [diff] [blame] | 189 | Function *NF = new Function(NFTy, F->getLinkage(), F->getName()); |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 190 | F->getParent()->getFunctionList().insert(F, NF); |
| 191 | |
| 192 | // Loop over all of the callers of the function, transforming the call sites |
| 193 | // to pass in a smaller number of arguments into the new function. |
| 194 | // |
| 195 | while (!F->use_empty()) { |
| 196 | CallSite CS = CallSite::get(F->use_back()); |
| 197 | Instruction *Call = CS.getInstruction(); |
| 198 | CS.setCalledFunction(NF); // Reduce the uses count of F |
| 199 | |
| 200 | // Loop over the operands, deleting dead ones... |
| 201 | CallSite::arg_iterator AI = CS.arg_begin(); |
| 202 | for (Function::aiterator I = F->abegin(), E = F->aend(); I != E; ++I) |
| 203 | if (DeadArguments.count(I)) { // Remove operands for dead arguments |
| 204 | AI = Call->op_erase(AI); |
| 205 | } else { |
| 206 | ++AI; // Leave live operands alone... |
| 207 | } |
| 208 | } |
| 209 | |
| 210 | // Since we have now created the new function, splice the body of the old |
| 211 | // function right into the new function, leaving the old rotting hulk of the |
| 212 | // function empty. |
| 213 | NF->getBasicBlockList().splice(NF->begin(), F->getBasicBlockList()); |
| 214 | |
| 215 | // Loop over the argument list, transfering uses of the old arguments over to |
| 216 | // the new arguments, also transfering over the names as well. While we're at |
| 217 | // it, remove the dead arguments from the DeadArguments list. |
| 218 | // |
| 219 | for (Function::aiterator I = F->abegin(), E = F->aend(), I2 = NF->abegin(); |
| 220 | I != E; ++I) |
| 221 | if (!DeadArguments.count(I)) { |
| 222 | // If this is a live argument, move the name and users over to the new |
| 223 | // version. |
| 224 | I->replaceAllUsesWith(I2); |
| 225 | I2->setName(I->getName()); |
| 226 | ++I2; |
| 227 | } else { |
| 228 | // If this argument is dead, replace any uses of it with null constants |
| 229 | // (these are guaranteed to only be operands to call instructions which |
| 230 | // will later be simplified). |
| 231 | I->replaceAllUsesWith(Constant::getNullValue(I->getType())); |
| 232 | DeadArguments.erase(I); |
| 233 | } |
| 234 | |
| 235 | // Now that the old function is dead, delete it. |
| 236 | F->getParent()->getFunctionList().erase(F); |
| 237 | } |
| 238 | |
| 239 | bool DAE::run(Module &M) { |
| 240 | // First phase: loop through the module, determining which arguments are live. |
| 241 | // We assume all arguments are dead unless proven otherwise (allowing us to |
Misha Brukman | 8b2bd4e | 2003-10-10 17:57:28 +0000 | [diff] [blame] | 242 | // determine that dead arguments passed into recursive functions are dead). |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 243 | // |
| 244 | std::set<Argument*> LiveArguments, MaybeLiveArguments, DeadArguments; |
| 245 | std::multimap<Function*, CallSite> CallSites; |
| 246 | |
| 247 | DEBUG(std::cerr << "DAE - Determining liveness\n"); |
| 248 | for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) { |
| 249 | Function &Fn = *I; |
| 250 | // If the function is intrinsically alive, just mark the arguments alive. |
| 251 | if (FunctionArgumentsIntrinsicallyAlive(Fn)) { |
| 252 | for (Function::aiterator AI = Fn.abegin(), E = Fn.aend(); AI != E; ++AI) |
| 253 | LiveArguments.insert(AI); |
| 254 | DEBUG(std::cerr << " Args intrinsically live for fn: " << Fn.getName() |
| 255 | << "\n"); |
| 256 | } else { |
| 257 | DEBUG(std::cerr << " Inspecting args for fn: " << Fn.getName() << "\n"); |
| 258 | |
| 259 | // If it is not intrinsically alive, we know that all users of the |
| 260 | // function are call sites. Mark all of the arguments live which are |
| 261 | // directly used, and keep track of all of the call sites of this function |
| 262 | // if there are any arguments we assume that are dead. |
| 263 | // |
| 264 | bool AnyMaybeLiveArgs = false; |
| 265 | for (Function::aiterator AI = Fn.abegin(), E = Fn.aend(); AI != E; ++AI) |
| 266 | switch (getArgumentLiveness(*AI)) { |
| 267 | case Alive: |
| 268 | DEBUG(std::cerr << " Arg live by use: " << AI->getName() << "\n"); |
| 269 | LiveArguments.insert(AI); |
| 270 | break; |
| 271 | case Dead: |
Misha Brukman | 250f976 | 2003-09-11 15:31:17 +0000 | [diff] [blame] | 272 | DEBUG(std::cerr << " Arg definitely dead: " <<AI->getName()<<"\n"); |
Chris Lattner | 13bf28c | 2003-06-17 22:21:05 +0000 | [diff] [blame] | 273 | DeadArguments.insert(AI); |
| 274 | break; |
| 275 | case MaybeLive: |
| 276 | DEBUG(std::cerr << " Arg only passed to calls: " |
| 277 | << AI->getName() << "\n"); |
| 278 | AnyMaybeLiveArgs = true; |
| 279 | MaybeLiveArguments.insert(AI); |
| 280 | break; |
| 281 | } |
| 282 | |
| 283 | // If there are any "MaybeLive" arguments, we need to check callees of |
| 284 | // this function when/if they become alive. Record which functions are |
| 285 | // callees... |
| 286 | if (AnyMaybeLiveArgs) |
| 287 | for (Value::use_iterator I = Fn.use_begin(), E = Fn.use_end(); |
| 288 | I != E; ++I) |
| 289 | CallSites.insert(std::make_pair(&Fn, CallSite::get(*I))); |
| 290 | } |
| 291 | } |
| 292 | |
| 293 | // Now we loop over all of the MaybeLive arguments, promoting them to be live |
| 294 | // arguments if one of the calls that uses the arguments to the calls they are |
| 295 | // passed into requires them to be live. Of course this could make other |
| 296 | // arguments live, so process callers recursively. |
| 297 | // |
| 298 | // Because elements can be removed from the MaybeLiveArguments list, copy it |
| 299 | // to a temporary vector. |
| 300 | // |
| 301 | std::vector<Argument*> TmpArgList(MaybeLiveArguments.begin(), |
| 302 | MaybeLiveArguments.end()); |
| 303 | for (unsigned i = 0, e = TmpArgList.size(); i != e; ++i) { |
| 304 | Argument *MLA = TmpArgList[i]; |
| 305 | if (MaybeLiveArguments.count(MLA) && |
| 306 | isMaybeLiveArgumentNowAlive(MLA, LiveArguments)) { |
| 307 | MarkArgumentLive(MLA, MaybeLiveArguments, LiveArguments, CallSites); |
| 308 | } |
| 309 | } |
| 310 | |
| 311 | // Recover memory early... |
| 312 | CallSites.clear(); |
| 313 | |
| 314 | // At this point, we know that all arguments in DeadArguments and |
| 315 | // MaybeLiveArguments are dead. If the two sets are empty, there is nothing |
| 316 | // to do. |
| 317 | if (MaybeLiveArguments.empty() && DeadArguments.empty()) |
| 318 | return false; |
| 319 | |
| 320 | // Otherwise, compact into one set, and start eliminating the arguments from |
| 321 | // the functions. |
| 322 | DeadArguments.insert(MaybeLiveArguments.begin(), MaybeLiveArguments.end()); |
| 323 | MaybeLiveArguments.clear(); |
| 324 | |
| 325 | NumArgumentsEliminated += DeadArguments.size(); |
| 326 | while (!DeadArguments.empty()) |
| 327 | RemoveDeadArgumentsFromFunction((*DeadArguments.begin())->getParent(), |
| 328 | DeadArguments); |
| 329 | return true; |
| 330 | } |