blob: 9ecc494d9b564e1c1bd3972c83b82d58fd12cb7d [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===-- GlobalDCE.cpp - DCE unreachable internal functions ----------------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattner081ce942007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This transform is designed to eliminate unreachable internal globals from the
11// program. It uses an aggressive algorithm, searching out globals that are
12// known to be alive. After it finds all of the globals which are needed, it
13// deletes whatever is left over. This allows it to delete recursive chunks of
14// the program which are unreachable.
15//
16//===----------------------------------------------------------------------===//
17
18#define DEBUG_TYPE "globaldce"
19#include "llvm/Transforms/IPO.h"
20#include "llvm/Constants.h"
21#include "llvm/Module.h"
22#include "llvm/Pass.h"
23#include "llvm/ADT/Statistic.h"
24#include "llvm/Support/Compiler.h"
25#include <set>
26using namespace llvm;
27
Duncan Sands744917b2009-01-05 20:39:50 +000028STATISTIC(NumAliases , "Number of global aliases removed");
Dan Gohmanf17a25c2007-07-18 16:29:46 +000029STATISTIC(NumFunctions, "Number of functions removed");
30STATISTIC(NumVariables, "Number of global variables removed");
31
32namespace {
33 struct VISIBILITY_HIDDEN GlobalDCE : public ModulePass {
34 static char ID; // Pass identification, replacement for typeid
Dan Gohman26f8c272008-09-04 17:05:41 +000035 GlobalDCE() : ModulePass(&ID) {}
Duncan Sandsbd1b4502009-01-05 20:37:33 +000036
Dan Gohmanf17a25c2007-07-18 16:29:46 +000037 // run - Do the GlobalDCE pass on the specified module, optionally updating
38 // the specified callgraph to reflect the changes.
39 //
40 bool runOnModule(Module &M);
41
42 private:
43 std::set<GlobalValue*> AliveGlobals;
44
Duncan Sandsbd1b4502009-01-05 20:37:33 +000045 /// GlobalIsNeeded - mark the specific global value as needed, and
Dan Gohmanf17a25c2007-07-18 16:29:46 +000046 /// recursively mark anything that it uses as also needed.
47 void GlobalIsNeeded(GlobalValue *GV);
48 void MarkUsedGlobalsAsNeeded(Constant *C);
49
Dan Gohmanf17a25c2007-07-18 16:29:46 +000050 bool RemoveUnusedGlobalValue(GlobalValue &GV);
51 };
Dan Gohmanf17a25c2007-07-18 16:29:46 +000052}
53
Dan Gohman089efff2008-05-13 00:00:25 +000054char GlobalDCE::ID = 0;
55static RegisterPass<GlobalDCE> X("globaldce", "Dead Global Elimination");
56
Dan Gohmanf17a25c2007-07-18 16:29:46 +000057ModulePass *llvm::createGlobalDCEPass() { return new GlobalDCE(); }
58
59bool GlobalDCE::runOnModule(Module &M) {
60 bool Changed = false;
Owen Andersone1f1f822009-07-16 18:04:31 +000061 Context = &M.getContext();
62
Dan Gohmanf17a25c2007-07-18 16:29:46 +000063 // Loop over the module, adding globals which are obviously necessary.
64 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I) {
65 Changed |= RemoveUnusedGlobalValue(*I);
66 // Functions with external linkage are needed if they have a body
Chris Lattner7004abf2009-04-13 05:38:23 +000067 if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage() &&
Edwin Török6fc3a5f2009-05-23 14:06:57 +000068 !I->isDeclaration() && !I->hasAvailableExternallyLinkage())
Dan Gohmanf17a25c2007-07-18 16:29:46 +000069 GlobalIsNeeded(I);
70 }
71
72 for (Module::global_iterator I = M.global_begin(), E = M.global_end();
73 I != E; ++I) {
74 Changed |= RemoveUnusedGlobalValue(*I);
75 // Externally visible & appending globals are needed, if they have an
76 // initializer.
Chris Lattner7004abf2009-04-13 05:38:23 +000077 if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage() &&
Edwin Török6fc3a5f2009-05-23 14:06:57 +000078 !I->isDeclaration() && !I->hasAvailableExternallyLinkage())
Dan Gohmanf17a25c2007-07-18 16:29:46 +000079 GlobalIsNeeded(I);
80 }
81
Dan Gohmanf17a25c2007-07-18 16:29:46 +000082 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end();
83 I != E; ++I) {
Duncan Sandsbd1b4502009-01-05 20:37:33 +000084 Changed |= RemoveUnusedGlobalValue(*I);
85 // Externally visible aliases are needed.
Duncan Sands394c5082009-02-17 23:05:26 +000086 if (!I->hasLocalLinkage() && !I->hasLinkOnceLinkage())
Duncan Sandsbd1b4502009-01-05 20:37:33 +000087 GlobalIsNeeded(I);
Dan Gohmanf17a25c2007-07-18 16:29:46 +000088 }
89
90 // Now that all globals which are needed are in the AliveGlobals set, we loop
91 // through the program, deleting those which are not alive.
92 //
93
94 // The first pass is to drop initializers of global variables which are dead.
95 std::vector<GlobalVariable*> DeadGlobalVars; // Keep track of dead globals
96 for (Module::global_iterator I = M.global_begin(), E = M.global_end(); I != E; ++I)
97 if (!AliveGlobals.count(I)) {
98 DeadGlobalVars.push_back(I); // Keep track of dead globals
99 I->setInitializer(0);
100 }
101
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000102 // The second pass drops the bodies of functions which are dead...
103 std::vector<Function*> DeadFunctions;
104 for (Module::iterator I = M.begin(), E = M.end(); I != E; ++I)
105 if (!AliveGlobals.count(I)) {
106 DeadFunctions.push_back(I); // Keep track of dead globals
107 if (!I->isDeclaration())
108 I->deleteBody();
109 }
110
Duncan Sands394c5082009-02-17 23:05:26 +0000111 // The third pass drops targets of aliases which are dead...
112 std::vector<GlobalAlias*> DeadAliases;
113 for (Module::alias_iterator I = M.alias_begin(), E = M.alias_end(); I != E;
114 ++I)
115 if (!AliveGlobals.count(I)) {
116 DeadAliases.push_back(I);
117 I->setAliasee(0);
118 }
119
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000120 if (!DeadFunctions.empty()) {
Duncan Sandsbd1b4502009-01-05 20:37:33 +0000121 // Now that all interferences have been dropped, delete the actual objects
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000122 // themselves.
123 for (unsigned i = 0, e = DeadFunctions.size(); i != e; ++i) {
124 RemoveUnusedGlobalValue(*DeadFunctions[i]);
125 M.getFunctionList().erase(DeadFunctions[i]);
126 }
127 NumFunctions += DeadFunctions.size();
128 Changed = true;
129 }
130
131 if (!DeadGlobalVars.empty()) {
132 for (unsigned i = 0, e = DeadGlobalVars.size(); i != e; ++i) {
133 RemoveUnusedGlobalValue(*DeadGlobalVars[i]);
134 M.getGlobalList().erase(DeadGlobalVars[i]);
135 }
136 NumVariables += DeadGlobalVars.size();
137 Changed = true;
138 }
139
Duncan Sandsbd1b4502009-01-05 20:37:33 +0000140 // Now delete any dead aliases.
Duncan Sands394c5082009-02-17 23:05:26 +0000141 if (!DeadAliases.empty()) {
142 for (unsigned i = 0, e = DeadAliases.size(); i != e; ++i) {
143 RemoveUnusedGlobalValue(*DeadAliases[i]);
144 M.getAliasList().erase(DeadAliases[i]);
Duncan Sandsbd1b4502009-01-05 20:37:33 +0000145 }
Duncan Sands394c5082009-02-17 23:05:26 +0000146 NumAliases += DeadAliases.size();
147 Changed = true;
Duncan Sandsbd1b4502009-01-05 20:37:33 +0000148 }
149
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000150 // Make sure that all memory is released
151 AliveGlobals.clear();
152 return Changed;
153}
154
Devang Patel57fdf7d2008-11-11 19:16:41 +0000155/// GlobalIsNeeded - the specific global value as needed, and
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000156/// recursively mark anything that it uses as also needed.
157void GlobalDCE::GlobalIsNeeded(GlobalValue *G) {
Dan Gohmanb261a982008-07-11 20:58:19 +0000158 std::set<GlobalValue*>::iterator I = AliveGlobals.find(G);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000159
160 // If the global is already in the set, no need to reprocess it.
Dan Gohmanb261a982008-07-11 20:58:19 +0000161 if (I != AliveGlobals.end()) return;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000162
163 // Otherwise insert it now, so we do not infinitely recurse
164 AliveGlobals.insert(I, G);
165
166 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(G)) {
167 // If this is a global variable, we must make sure to add any global values
168 // referenced by the initializer to the alive set.
169 if (GV->hasInitializer())
170 MarkUsedGlobalsAsNeeded(GV->getInitializer());
Duncan Sandsbd1b4502009-01-05 20:37:33 +0000171 } else if (GlobalAlias *GA = dyn_cast<GlobalAlias>(G)) {
172 // The target of a global alias is needed.
Duncan Sandse9af8ee2009-01-07 18:45:53 +0000173 MarkUsedGlobalsAsNeeded(GA->getAliasee());
Duncan Sandsbd1b4502009-01-05 20:37:33 +0000174 } else {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000175 // Otherwise this must be a function object. We have to scan the body of
176 // the function looking for constants and global values which are used as
177 // operands. Any operands of these types must be processed to ensure that
178 // any globals used will be marked as needed.
179 Function *F = cast<Function>(G);
180 // For all basic blocks...
181 for (Function::iterator BB = F->begin(), E = F->end(); BB != E; ++BB)
182 // For all instructions...
183 for (BasicBlock::iterator I = BB->begin(), E = BB->end(); I != E; ++I)
184 // For all operands...
185 for (User::op_iterator U = I->op_begin(), E = I->op_end(); U != E; ++U)
186 if (GlobalValue *GV = dyn_cast<GlobalValue>(*U))
187 GlobalIsNeeded(GV);
188 else if (Constant *C = dyn_cast<Constant>(*U))
189 MarkUsedGlobalsAsNeeded(C);
190 }
191}
192
193void GlobalDCE::MarkUsedGlobalsAsNeeded(Constant *C) {
194 if (GlobalValue *GV = dyn_cast<GlobalValue>(C))
195 GlobalIsNeeded(GV);
196 else {
197 // Loop over all of the operands of the constant, adding any globals they
198 // use to the list of needed globals.
199 for (User::op_iterator I = C->op_begin(), E = C->op_end(); I != E; ++I)
200 MarkUsedGlobalsAsNeeded(cast<Constant>(*I));
201 }
202}
203
204// RemoveUnusedGlobalValue - Loop over all of the uses of the specified
205// GlobalValue, looking for the constant pointer ref that may be pointing to it.
206// If found, check to see if the constant pointer ref is safe to destroy, and if
207// so, nuke it. This will reduce the reference count on the global value, which
208// might make it deader.
209//
210bool GlobalDCE::RemoveUnusedGlobalValue(GlobalValue &GV) {
211 if (GV.use_empty()) return false;
212 GV.removeDeadConstantUsers();
213 return GV.use_empty();
214}