1 //===-- GlobalDCE.cpp - DCE unreachable internal functions ----------------===//
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 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.
16 //===----------------------------------------------------------------------===//
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"
28 STATISTIC(NumAliases
, "Number of global aliases removed");
29 STATISTIC(NumFunctions
, "Number of functions removed");
30 STATISTIC(NumVariables
, "Number of global variables removed");
33 struct VISIBILITY_HIDDEN GlobalDCE
: public ModulePass
{
34 static char ID
; // Pass identification, replacement for typeid
35 GlobalDCE() : ModulePass(&ID
) {}
37 // run - Do the GlobalDCE pass on the specified module, optionally updating
38 // the specified callgraph to reflect the changes.
40 bool runOnModule(Module
&M
);
43 std::set
<GlobalValue
*> AliveGlobals
;
45 /// GlobalIsNeeded - mark the specific global value as needed, and
46 /// recursively mark anything that it uses as also needed.
47 void GlobalIsNeeded(GlobalValue
*GV
);
48 void MarkUsedGlobalsAsNeeded(Constant
*C
);
50 bool RemoveUnusedGlobalValue(GlobalValue
&GV
);
54 char GlobalDCE::ID
= 0;
55 static RegisterPass
<GlobalDCE
> X("globaldce", "Dead Global Elimination");
57 ModulePass
*llvm::createGlobalDCEPass() { return new GlobalDCE(); }
59 bool GlobalDCE::runOnModule(Module
&M
) {
62 // Loop over the module, adding globals which are obviously necessary.
63 for (Module::iterator I
= M
.begin(), E
= M
.end(); I
!= E
; ++I
) {
64 Changed
|= RemoveUnusedGlobalValue(*I
);
65 // Functions with external linkage are needed if they have a body
66 if (!I
->hasLocalLinkage() && !I
->hasLinkOnceLinkage() &&
67 !I
->isDeclaration() && !I
->hasAvailableExternallyLinkage())
71 for (Module::global_iterator I
= M
.global_begin(), E
= M
.global_end();
73 Changed
|= RemoveUnusedGlobalValue(*I
);
74 // Externally visible & appending globals are needed, if they have an
76 if (!I
->hasLocalLinkage() && !I
->hasLinkOnceLinkage() &&
77 !I
->isDeclaration() && !I
->hasAvailableExternallyLinkage())
81 for (Module::alias_iterator I
= M
.alias_begin(), E
= M
.alias_end();
83 Changed
|= RemoveUnusedGlobalValue(*I
);
84 // Externally visible aliases are needed.
85 if (!I
->hasLocalLinkage() && !I
->hasLinkOnceLinkage())
89 // Now that all globals which are needed are in the AliveGlobals set, we loop
90 // through the program, deleting those which are not alive.
93 // The first pass is to drop initializers of global variables which are dead.
94 std::vector
<GlobalVariable
*> DeadGlobalVars
; // Keep track of dead globals
95 for (Module::global_iterator I
= M
.global_begin(), E
= M
.global_end(); I
!= E
; ++I
)
96 if (!AliveGlobals
.count(I
)) {
97 DeadGlobalVars
.push_back(I
); // Keep track of dead globals
101 // The second pass drops the bodies of functions which are dead...
102 std::vector
<Function
*> DeadFunctions
;
103 for (Module::iterator I
= M
.begin(), E
= M
.end(); I
!= E
; ++I
)
104 if (!AliveGlobals
.count(I
)) {
105 DeadFunctions
.push_back(I
); // Keep track of dead globals
106 if (!I
->isDeclaration())
110 // The third pass drops targets of aliases which are dead...
111 std::vector
<GlobalAlias
*> DeadAliases
;
112 for (Module::alias_iterator I
= M
.alias_begin(), E
= M
.alias_end(); I
!= E
;
114 if (!AliveGlobals
.count(I
)) {
115 DeadAliases
.push_back(I
);
119 if (!DeadFunctions
.empty()) {
120 // Now that all interferences have been dropped, delete the actual objects
122 for (unsigned i
= 0, e
= DeadFunctions
.size(); i
!= e
; ++i
) {
123 RemoveUnusedGlobalValue(*DeadFunctions
[i
]);
124 M
.getFunctionList().erase(DeadFunctions
[i
]);
126 NumFunctions
+= DeadFunctions
.size();
130 if (!DeadGlobalVars
.empty()) {
131 for (unsigned i
= 0, e
= DeadGlobalVars
.size(); i
!= e
; ++i
) {
132 RemoveUnusedGlobalValue(*DeadGlobalVars
[i
]);
133 M
.getGlobalList().erase(DeadGlobalVars
[i
]);
135 NumVariables
+= DeadGlobalVars
.size();
139 // Now delete any dead aliases.
140 if (!DeadAliases
.empty()) {
141 for (unsigned i
= 0, e
= DeadAliases
.size(); i
!= e
; ++i
) {
142 RemoveUnusedGlobalValue(*DeadAliases
[i
]);
143 M
.getAliasList().erase(DeadAliases
[i
]);
145 NumAliases
+= DeadAliases
.size();
149 // Make sure that all memory is released
150 AliveGlobals
.clear();
152 // Remove dead metadata.
153 Changed
|= M
.getContext().RemoveDeadMetadata();
157 /// GlobalIsNeeded - the specific global value as needed, and
158 /// recursively mark anything that it uses as also needed.
159 void GlobalDCE::GlobalIsNeeded(GlobalValue
*G
) {
160 std::set
<GlobalValue
*>::iterator I
= AliveGlobals
.find(G
);
162 // If the global is already in the set, no need to reprocess it.
163 if (I
!= AliveGlobals
.end()) return;
165 // Otherwise insert it now, so we do not infinitely recurse
166 AliveGlobals
.insert(I
, G
);
168 if (GlobalVariable
*GV
= dyn_cast
<GlobalVariable
>(G
)) {
169 // If this is a global variable, we must make sure to add any global values
170 // referenced by the initializer to the alive set.
171 if (GV
->hasInitializer())
172 MarkUsedGlobalsAsNeeded(GV
->getInitializer());
173 } else if (GlobalAlias
*GA
= dyn_cast
<GlobalAlias
>(G
)) {
174 // The target of a global alias is needed.
175 MarkUsedGlobalsAsNeeded(GA
->getAliasee());
177 // Otherwise this must be a function object. We have to scan the body of
178 // the function looking for constants and global values which are used as
179 // operands. Any operands of these types must be processed to ensure that
180 // any globals used will be marked as needed.
181 Function
*F
= cast
<Function
>(G
);
182 // For all basic blocks...
183 for (Function::iterator BB
= F
->begin(), E
= F
->end(); BB
!= E
; ++BB
)
184 // For all instructions...
185 for (BasicBlock::iterator I
= BB
->begin(), E
= BB
->end(); I
!= E
; ++I
)
186 // For all operands...
187 for (User::op_iterator U
= I
->op_begin(), E
= I
->op_end(); U
!= E
; ++U
)
188 if (GlobalValue
*GV
= dyn_cast
<GlobalValue
>(*U
))
190 else if (Constant
*C
= dyn_cast
<Constant
>(*U
))
191 MarkUsedGlobalsAsNeeded(C
);
195 void GlobalDCE::MarkUsedGlobalsAsNeeded(Constant
*C
) {
196 if (GlobalValue
*GV
= dyn_cast
<GlobalValue
>(C
))
199 // Loop over all of the operands of the constant, adding any globals they
200 // use to the list of needed globals.
201 for (User::op_iterator I
= C
->op_begin(), E
= C
->op_end(); I
!= E
; ++I
)
202 MarkUsedGlobalsAsNeeded(cast
<Constant
>(*I
));
206 // RemoveUnusedGlobalValue - Loop over all of the uses of the specified
207 // GlobalValue, looking for the constant pointer ref that may be pointing to it.
208 // If found, check to see if the constant pointer ref is safe to destroy, and if
209 // so, nuke it. This will reduce the reference count on the global value, which
210 // might make it deader.
212 bool GlobalDCE::RemoveUnusedGlobalValue(GlobalValue
&GV
) {
213 if (GV
.use_empty()) return false;
214 GV
.removeDeadConstantUsers();
215 return GV
.use_empty();