2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Removal of unreachable methods.
23 * @author Matthias Braun
28 #include "iroptimize.h"
39 DEBUG_ONLY(static firm_dbg_module_t *dbg);
41 static void visit_entity(ir_entity *entity);
43 static void visit_node(ir_node *node, void *env)
48 if (is_SymConst(node)) {
49 if (!SYMCONST_HAS_ENT(get_SymConst_kind(node)))
51 entity = get_SymConst_entity(node);
52 } else if (is_Sel(node)) {
53 entity = get_Sel_entity(node);
61 static void start_visit_node(ir_node *node)
63 ir_graph *irg = get_irn_irg(node);
65 if (get_irg_visited(irg) < get_max_irg_visited()) {
66 set_irg_visited(irg, get_max_irg_visited());
68 irg_walk_2(node, visit_node, NULL, NULL);
71 static void visit_initializer(ir_initializer_t *initializer)
73 switch (initializer->kind) {
74 case IR_INITIALIZER_CONST:
75 start_visit_node(initializer->consti.value);
77 case IR_INITIALIZER_TARVAL:
78 case IR_INITIALIZER_NULL:
81 case IR_INITIALIZER_COMPOUND: {
83 for (i = 0; i < initializer->compound.n_initializers; ++i) {
84 ir_initializer_t *subinitializer
85 = initializer->compound.initializers[i];
86 visit_initializer(subinitializer);
91 panic("invalid initializer found");
94 static void visit_entity(ir_entity *entity)
98 if (entity_visited(entity))
100 mark_entity_visited(entity);
102 if (entity->initializer != NULL) {
103 visit_initializer(entity->initializer);
104 } else if (entity_has_compound_ent_values(entity)) {
106 size_t n_members = get_compound_ent_n_values(entity);
107 for (i = 0; i < n_members; ++i) {
108 ir_node *node = get_compound_ent_value(entity, i);
109 start_visit_node(node);
113 irg = get_entity_irg(entity);
115 start_visit_node(get_irg_end(irg));
119 static void visit_segment(ir_type *segment)
121 int n_entities = get_compound_n_members(segment);
124 for (i = 0; i < n_entities; ++i) {
125 ir_entity *entity = get_compound_member(segment, i);
126 if (get_entity_visibility(entity) != ir_visibility_default
127 && !(get_entity_linkage(entity) & IR_LINKAGE_HIDDEN_USER))
130 visit_entity(entity);
134 static void garbage_collect_in_segment(ir_type *segment)
138 for (i = get_compound_n_members(segment)-1; i >= 0; --i) {
139 ir_entity *entity = get_compound_member(segment, i);
141 if (entity_visited(entity))
144 DB((dbg, LEVEL_1, " removing entity %+F\n", entity));
150 void garbage_collect_entities(void)
155 FIRM_DBG_REGISTER(dbg, "firm.opt.garbagecollect");
157 /* start a type walk for all externally visible entities */
158 irp_reserve_resources(irp, IR_RESOURCE_TYPE_VISITED);
159 inc_master_type_visited();
160 inc_max_irg_visited();
162 for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; ++s) {
163 ir_type *type = get_segment_type(s);
164 mark_type_visited(type);
169 /* remove graphs of non-visited functions
170 * (we have to count backwards so we can safely call remove_irp_irg
171 * while iterating) */
172 for (i = get_irp_n_irgs(); i > 0;) {
173 ir_graph *irg = get_irp_irg(--i);
174 ir_entity *entity = get_irg_entity(irg);
176 if (entity_visited(entity))
179 DB((dbg, LEVEL_1, " freeing method %+F\n", entity));
183 /* we can now remove all non-visited (global) entities */
184 for (s = IR_SEGMENT_FIRST; s <= IR_SEGMENT_LAST; ++s) {
185 ir_type *type = get_segment_type(s);
186 garbage_collect_in_segment(type);
188 irp_free_resources(irp, IR_RESOURCE_TYPE_VISITED);
191 ir_prog_pass_t *garbage_collect_entities_pass(const char *name)
193 return def_prog_pass(name ? name : "garbage_collect",
194 garbage_collect_entities);