X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Frta.c;h=8a829b5559f4d5da7aa7675d591a4b45e3f9e0be;hb=2232b14b4acf810ae96a69d1d2a33cf150b695d9;hp=78d2dc9aa9b38880c0a52b43bcd597865ea1505d;hpb=4e530c4a63dd3cf77d715ec518e756a18892d7bd;p=libfirm diff --git a/ir/ana/rta.c b/ir/ana/rta.c index 78d2dc9aa..8a829b555 100644 --- a/ir/ana/rta.c +++ b/ir/ana/rta.c @@ -1,398 +1,255 @@ -/* -*- c -*- */ - /* - * Project: libFIRM - * File name: ir/ana/rta.c - * Purpose: Intraprozedural analyses to improve the call graph estimate. - * Author: Florian - * Modified by: - * Created: 09.06.2002 - * CVS-ID: $$ - * Copyright: (c) 1999-2004 Universität Karlsruhe - * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ /** - * Intraprozedurale Analyse zur Abschätzung der Aufrufrelation. Es - * die Menge der instantiierten Klassen bestimmt, und daraus existierende Methoden - * bestimmt. + * @file + * @brief Interprocedural analysis to improve the call graph estimate. + * @author Florian Liekweg + * @version 09.06.2002 + * @version $Id$ */ - -#ifdef HAVE_CONFIG_H -# include -#endif +#include "config.h" #include "rta.h" #include +#include #include "irnode_t.h" -#include "irprog.h" +#include "irprog_t.h" +#include "irgraph_t.h" -#include "eset.h" +#include "pset_new.h" #include "irgwalk.h" #include "irgmod.h" -#include "irvrfy.h" -#include "trvrfy.h" +#include "irverify.h" +#include "irprintf.h" +#include "debug.h" +#include "error.h" -# define TRUE 1 -# define FALSE 0 +/** The debug handle. */ +DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL;) /* base data */ -static eset *_live_classes = NULL; -static eset *_live_fields = NULL; -static eset *_called_methods = NULL; +static pset_new_t *_live_classes = NULL; /* cache computed results */ -static eset *_live_graphs = NULL; -static eset *_dead_graphs = NULL; - -/** - Initialise the static data structures. -*/ -static void init_tables (void) -{ - _live_classes = eset_create (); - _live_fields = eset_create (); - _called_methods = eset_create (); - - _live_graphs = eset_create (); - _dead_graphs = eset_create (); - - if (get_irp_main_irg ()) { - eset_insert (_live_graphs, get_irp_main_irg ()); - } - - if (get_glob_type ()) { - eset_insert (_live_classes, get_glob_type ()); - } -} +static pset_new_t *_live_graphs = NULL; /** - Enter all method and field accesses and all class allocations into - our tables. -*/ -static void rta_act (ir_node *node, void *env) + * Add a graph to the set of live graphs. + * + * @param graph the graph to add + * @return non-zero if the graph was added, zero + * if it was already in the live set + */ +static bool add_graph(ir_graph *graph) { - opcode op = get_irn_opcode (node); - - if (iro_Call == op) { /* CALL */ - entity *ent = NULL; - - ir_node *ptr = get_Call_ptr (node); - - if (iro_Sel == get_irn_opcode (ptr)) { /* CALL SEL */ - ent = get_Sel_entity (ptr); - } else if (iro_Const == get_irn_opcode (ptr)) { /* CALL CONST */ - ent = get_tarval_entity (get_Const_tarval (ptr)); - - } else if (iro_SymConst == get_irn_opcode (ptr)) { /* CALL SYMCONST */ - assert (ent && "couldn't determine entity of call to symConst"); - } - - if (ent) { - eset_insert (_called_methods, ent); - } - } else if (iro_Load == op) { /* LOAD */ - ir_node *ptr = get_Load_ptr (node); - entity *ent = NULL; - - if (iro_Sel == get_irn_opcode (ptr)) { - ent = get_Sel_entity (ptr); - } - if (ent) { - eset_insert (_live_fields, ent); - } - } else if (iro_Store == op) { /* STORE */ - ir_node *ptr = get_Store_ptr (node); - entity *ent = NULL; - - if (iro_Sel == get_irn_opcode (ptr)) { - ent = get_Sel_entity (ptr); - } - if (ent) { - eset_insert (_live_fields, ent); - } - } else if (iro_Alloc == op) { /* ALLOC */ - type *type = get_Alloc_type (node); - - eset_insert (_live_classes, type); - } -} + if (!pset_new_contains(_live_graphs, graph)) { + DB((dbg, LEVEL_2, "RTA: new graph of %+F\n", graph)); -/** - Traverse the given graph to collect method and field accesses and - object allocations. -*/ -static void rta_fill_graph (ir_graph* graph) -{ - if (NULL != graph) { - if (NULL != get_irg_end (graph)) { - current_ir_graph = graph; + pset_new_insert(_live_graphs, graph); + return true; + } - irg_walk (get_irg_end (graph), rta_act, NULL, NULL); - } - } + return false; } /** - Check whether the given graph is alive based on the contents of the - given esets. -*/ -static int is_alive (ir_graph *graph, eset *live_graphs, eset *dead_graphs) + * Add a class to the set of live classes. + * + * @param clazz the class to add + * @return non-zero if the graph was added, zero + * if it was already in the live set + */ +static bool add_class(ir_type *clazz) { - if (eset_contains (live_graphs, graph)) { - return (TRUE); - } + if (!pset_new_contains(_live_classes, clazz)) { + DB((dbg, LEVEL_2, "RTA: new class: %+F\n", clazz)); - if (eset_contains (dead_graphs, graph)) { - return (FALSE); - } + pset_new_insert(_live_classes, clazz); + return true; + } - assert (0 && "graph neither live not dead (shouldn't happen)"); + return false; } -/** - Traverse all graphs to collect method and field accesses and object allocations. - - @param rerun Whether to rely on is_alive in a second run +/** Given an entity, add all implementing graphs that belong to live classes + * to _live_graphs. + * + * Iff additions occurred, return true, else false. */ -static void rta_fill_all (int rerun) +static bool add_implementing_graphs(ir_entity *method) { - int i; - int old_ip_view = interprocedural_view; - eset *live_graphs = NULL; - eset *dead_graphs = NULL; - - interprocedural_view = 0; /* save this for later */ - - if (rerun) { - int n_graphs = get_irp_n_irgs (); - - /* force all graphs to be entered in either live_graphs or dead_graphs */ - for (i = 0; i < n_graphs; i ++) { - rta_is_alive_graph (get_irp_irg (i)); - } - - /* remember existing infos for later */ - live_graphs = _live_graphs; - dead_graphs = _dead_graphs; - - /* ensure that live_graphs and dead_graphs aren't deallocated by rta_cleanup */ - _live_graphs = NULL; - _dead_graphs = NULL; - - rta_cleanup (); - init_tables (); - } - - /* Consider all graphs, possibly taking into account existing infos */ - for (i = 0; i < get_irp_n_irgs(); i++) { - ir_graph *graph = get_irp_irg (i); - - /* Need to take care of graphs that are externally - visible. Pretend that they are called: */ - entity *ent = get_irg_entity (graph); - if (visibility_local != get_entity_visibility (ent)) { - eset_insert (_called_methods, ent); - - if (get_entity_irg (ent)) { - eset_insert (_live_graphs, get_entity_irg (ent)); - } - - eset_insert (_live_classes, get_entity_owner (ent)); - } - - /* now check the graph */ - if (rerun) { - if (is_alive (graph, live_graphs, dead_graphs)) { - rta_fill_graph (graph); - } else { - /* nothing (except debugging printf's :-) */ - } - } else { - rta_fill_graph (graph); - } - } - - if (rerun) { - /* clean up the tables that we have retained */ - eset_destroy (live_graphs); - eset_destroy (dead_graphs); - } - - interprocedural_view = old_ip_view; /* cover up our traces */ -} + size_t i; + size_t n_over = get_entity_n_overwrittenby(method); + ir_graph *graph = get_entity_irg(method); + bool change = false; -/** - Find out whether the given method could be the target of a - polymorphic call. -*/ -static int is_call_target (const entity *method) -{ - int is_target = FALSE; - int i; - int n_over; + if (NULL == graph) + graph = get_entity_irg(method); - /* The method could be the target of a polymorphic call if it is - called or if it overrides a method that is called. */ + DB((dbg, LEVEL_2, "RTA: new call to %+F\n", method)); - if (eset_contains (_called_methods, (entity*) method)) { - return (TRUE); - } + if (rta_is_alive_class(get_entity_owner(method))) { + if (NULL != graph) + change = add_graph(graph); + } - /* not called? check methods in superclass(es) */ - n_over = get_entity_n_overwrittenby ((entity*) method); - for (i = 0; !is_target && (i < n_over); i ++) { - entity *over = get_entity_overwrittenby ((entity*) method, i); - is_target |= is_call_target (over); - } + for (i = 0; i < n_over; ++i) { + ir_entity *over = get_entity_overwrittenby(method, i); + change |= add_implementing_graphs(over); + } - return (is_target); + return change; } /** - Given a method, find the firm graph that implements that method. -*/ -static ir_graph *get_implementing_graph (const entity *method) + * Walker: Enter all method accesses and all class allocations into + * our tables. + * + * Set *(int*)env to true iff (possibly) new graphs have been found. + */ +static void rta_act(ir_node *node, void *env) { - ir_graph *graph = get_entity_irg ((entity*) method); - - if (NULL == graph) { - int i; - int n_over = get_entity_n_overwrites ((entity*) method); - - for (i = 0; (NULL == graph) && (i < n_over); i ++) { - entity *over = get_entity_overwrites ((entity*) method, i); - graph = get_implementing_graph (over); - } - } - - /* we *must* always return a graph != NULL, *except* when we're used - inside remove_irg or force_description */ - /* assert (graph && "no graph"); */ - - return (graph); + bool *change = (bool*)env; + unsigned op = get_irn_opcode(node); + + if (iro_Call == op) { /* CALL */ + ir_entity *ent = NULL; + + ir_node *ptr = get_Call_ptr(node); + + /* CALL SEL */ + if (iro_Sel == get_irn_opcode(ptr)) { + ent = get_Sel_entity(ptr); + *change |= add_implementing_graphs(ent); + + /* CALL SYMCONST */ + } else if (iro_SymConst == get_irn_opcode(ptr)) { + if (get_SymConst_kind(ptr) == symconst_addr_ent) { + ir_graph *graph; + + ent = get_SymConst_entity(ptr); + graph = get_entity_irg(ent); + if (graph) { + *change |= add_graph(graph); + } else { + /* it's an external allocated thing. */ + } + } else { + /* other symconst. */ + panic("This SymConst can not be an address for a method call."); + } + + /* STRANGE */ + } else { + panic("Unexpected address expression: can not analyse, therefore can not do correct rta!"); + } + } else if (iro_Alloc == op) { /* ALLOC */ + ir_type *type = get_Alloc_type(node); + + *change |= add_class(type); + } } /** - Determine whether the give method or one of its overwriter have - been used in a call to the given graph. + Traverse the given graph to collect method accesses and + object allocations. */ -static int has_live_call (entity *method, ir_graph *graph) +static bool rta_fill_graph(ir_graph* graph) { - int has_call = FALSE; - int i, n_over; - - /* stop searching if a overwriting method comes with a new graph */ - if (get_irg_ent (graph) != method) { /* shouldn't we compare GRAPHS here????? */ - return (FALSE); - } - - /* maybe we're called (possibly through polymorphy)? */ - if (is_call_target (method)) { - return (TRUE); - } - - /* maybe we're overwritten by a method that is called? */ - n_over = get_entity_n_overwrittenby ((entity*) method); - for (i = 0; !has_call && (i < n_over); i ++) { - entity *over = get_entity_overwrittenby((entity*) method, i); - has_call |= has_live_call (over, graph); - } - - return (has_call); + bool change = false; + irg_walk_graph(graph, rta_act, NULL, &change); + return change; } /** - Determine whether the given class is live *and* uses the given - graph at some point, or has live subclasses that use the graph. -*/ -static int has_graph (type *clazz, ir_graph *graph) + * Traverse all graphs to collect method accesses and object allocations. + */ +static int rta_fill_incremental(void) { - int has_the_graph = FALSE; - int i; - int n_sub; - - if (eset_contains (_live_classes, clazz)) { - int n_meth = get_class_n_members (clazz); - - for (i = 0; i < n_meth; i ++) { - entity *member = get_class_member (clazz, i); - if (is_method_type (get_entity_type (member))) { - ir_graph *impl = get_entity_irg (member); - - if (impl == graph) { - return (TRUE); - } - } /* is_method */ - } /* all methods */ - } /* _live_classes.contains (clazz) */ - - /* our subclasses might be using that graph, no? */ - n_sub = get_class_n_subtypes (clazz); - for (i = 0; !has_the_graph && (i < n_sub); i ++) { - type *sub = get_class_subtype (clazz, i); - - has_the_graph |= has_graph (sub, graph); - } - - return (has_the_graph); + size_t i, n; + int n_runs = 0; + bool rerun = true; + + /* init_tables has added main_irg to _live_graphs */ + + /* Need to take care of graphs that are externally + visible or sticky. Pretend that they are called: */ + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) { + ir_graph *graph = get_irp_irg(i); + ir_entity *ent = get_irg_entity(graph); + ir_linkage linkage = get_entity_linkage(ent); + + if ((linkage & IR_LINKAGE_HIDDEN_USER) || entity_is_externally_visible(ent)) + pset_new_insert(_live_graphs, graph); + } + + while (rerun) { + ir_graph *graph; + pset_new_iterator_t iter; + + /* start off new */ + pset_new_t *live_graphs = _live_graphs; + _live_graphs = XMALLOC(pset_new_t); + pset_new_init(_live_graphs); + + DB((dbg, LEVEL_2, "RTA: RUN %i\n", n_runs)); + + /* collect what we have found previously */ + foreach_pset_new(live_graphs, ir_graph*, graph, iter) { + pset_new_insert(_live_graphs, graph); + } + + rerun = false; + foreach_pset_new(live_graphs, ir_graph*, graph, iter) { + DB((dbg, LEVEL_2, "RTA: RUN %i: considering graph of %+F\n", n_runs, graph)); + rerun |= rta_fill_graph(graph); + } + pset_new_destroy(live_graphs); + free(live_graphs); + ++n_runs; + } + + return n_runs; } +#ifdef DEBUG_libfirm /** - Determine whether the given method could be used in a call to the - given graph on a live class. -*/ -static int has_live_class (entity *method, ir_graph *graph) -{ - int has_class = FALSE; - int i; - int n_over; - type *clazz; - - /* stop searching when an overwriting method provides a new graph */ - if (get_implementing_graph (method) != graph) { - return (FALSE); - } - - clazz = get_entity_owner (method); - - if (has_graph (clazz, graph)) { /* this also checks whether clazz is live*/ - return (TRUE); - } - - n_over = get_entity_n_overwrittenby (method); - for (i = 0; !has_class && (i < n_over); i ++) { - entity *over = get_entity_overwrittenby (method, i); - has_class |= has_live_class (over, graph); - } - - return (has_class); -} - -/* - Count the number of graphs that we have found to be live. Since - this touches every graph of the irp, it also forces that each graph - is either in _live_graphs xor in _dead_graphs. This is useful if - we use is_alive(ir_graph*) internally. -*/ -static int stats (void) + * Count the number of graphs that we have found to be live. + */ +static size_t stats(void) { - int i; - int n_live_graphs = 0; - int n_graphs = get_irp_n_irgs(); + size_t i, n; + size_t n_live_graphs = 0; - for (i = 0; i < n_graphs; i++) { - ir_graph *graph = get_irp_irg(i); + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) { + ir_graph *graph = get_irp_irg(i); - if (rta_is_alive_graph (graph)) { - n_live_graphs ++; - } - } + if (rta_is_alive_graph(graph)) + ++n_live_graphs; + } - return (n_live_graphs); + return n_live_graphs; } +#endif /* remove a graph, part I */ /* @@ -400,248 +257,190 @@ static int stats (void) abstract now. Pretend that it wasn't there at all, and every entity that used to inherit this entity's graph is now abstract. */ -/* Since we *know* that this entity will not be called, this is OK. */ -static void force_description (entity *ent, entity *addr) -{ - int i, n_over = get_entity_n_overwrittenby (ent); - - set_entity_peculiarity (ent, peculiarity_description); - - for (i = 0; i < n_over; i ++) { - entity *over = get_entity_overwrittenby (ent, i); - - if (peculiarity_inherited == get_entity_peculiarity (over)) { - /* We rely on the fact that cse is performed on the const_code_irg. */ - entity *my_addr = - tarval_to_entity(get_Const_tarval(get_atomic_ent_value(over))); - - if (addr == my_addr) { - force_description (over, addr); - } - } else if (peculiarity_existent == get_entity_peculiarity (over)) { - /* check whether 'over' forces 'inheritance' of *our* graph: */ - ir_node *f_addr = get_atomic_ent_value (over); - entity *impl_ent = tarval_to_entity (get_Const_tarval (f_addr)); - - assert ((get_irn_op(f_addr) == op_Const) && "can't do complex addrs"); - if (impl_ent == addr) { - assert (0 && "gibt's denn sowas"); - force_description (over, addr); - } - } - } -} -/* remove a graph, part II */ -/* - Note: get_implementing_graph is not well defined here (graph->ent - could overwrite more than one superclass implementation (graph). - Since we *know* that this entity will not be called, this is OK. +/** + Initialize the static data structures. */ -static void remove_irg (ir_graph *graph) +static void init_tables(void) { - entity *ent = get_irg_entity (graph); - - /* delete the ir_graph data */ - remove_irp_irg (graph); - /* remove reference to the graph */ - set_entity_irg (ent, NULL); - /* find the implementation (graph) from *some* superclass: */ - graph = get_implementing_graph (ent); - - if (TRUE || (NULL == graph)) { /* always pretend to be 'abstract'; let the others figure this out */ - /* nothing to inherit! pretend we're abstract */ - force_description (ent, ent); - } else { - /* pretend that we inherit the implementation (graph) from some superclass: */ - set_entity_peculiarity (ent, peculiarity_inherited); - - exchange (get_atomic_ent_value (ent), - get_atomic_ent_value (get_irg_ent(graph))); - } + ir_graph *irg; + ir_segment_t segment; + + _live_classes = XMALLOC(pset_new_t); + pset_new_init(_live_classes); + _live_graphs = XMALLOC(pset_new_t); + pset_new_init(_live_graphs); + + irg = get_irp_main_irg(); + if (irg != NULL) { + /* add the main irg to the live set if one is specified */ + pset_new_insert(_live_graphs, irg); + } + + /* Find static allocated classes in all segments */ + for (segment = IR_SEGMENT_FIRST; segment <= IR_SEGMENT_LAST; ++segment) { + ir_type *tp = get_segment_type(segment); + size_t n = get_compound_n_members(tp); + size_t i; + + for (i = 0; i < n; ++i) { + ir_type *member_type = get_entity_type(get_compound_member(tp, i)); + if (is_Class_type(member_type)) + pset_new_insert(_live_classes, member_type); + } + } } -/* Initialise the RTA data structures, and perform RTA. - @param verbose Iff != 0, print statistics as we go along -*/ -void rta_init (int verbose) +/* + * Initialize the RTA data structures, and perform RTA. + */ +void rta_init(void) { - int n_live_graphs = get_irp_n_irgs (); - int n_graphs = 0; - int n_runs = 0; + int n_runs = 0; + + FIRM_DBG_REGISTER(dbg, "firm.ana.rta"); # ifdef DEBUG_libfirm - int i; - for (i = 0; i < get_irp_n_irgs(); i++) { - irg_vrfy (get_irp_irg(i)); - } - tr_vrfy (); + { + size_t i; + for (i = get_irp_n_irgs(); i > 0;) { + irg_verify(get_irp_irg(--i), 0); + } + tr_verify(); + } # endif /* defined DEBUG_libfirm */ - init_tables (); - - if (verbose) { - printf ("RTA: run %i (%i graphs to go)\n", n_runs, n_live_graphs); - } - - rta_fill_all (FALSE); + init_tables(); - while (n_graphs != n_live_graphs) { - n_graphs = n_live_graphs; - n_runs ++; - rta_fill_all (TRUE); - n_live_graphs = stats (); + n_runs = rta_fill_incremental(); - if (verbose) { - printf ("RTA: run %i (%i graphs to go)\n", n_runs, n_live_graphs); - } - } - - if (verbose) { - printf ("RTA: n_graphs = %i\n", get_irp_n_irgs ()); - printf ("RTA: n_live_graphs = %i\n", n_live_graphs); - printf ("RTA: n_runs = %i\n", n_runs); - } + DB((dbg, LEVEL_1, "RTA: n_graphs = %zu\n", get_irp_n_irgs())); + DB((dbg, LEVEL_1, "RTA: n_live_graphs = %zu\n", stats())); + DB((dbg, LEVEL_1, "RTA: n_runs = %i\n", n_runs)); # ifdef DEBUG_libfirm - for (i = 0; i < get_irp_n_irgs(); i++) { - irg_vrfy (get_irp_irg(i)); - } - tr_vrfy (); + { + size_t i; + + for (i = get_irp_n_irgs(); i > 0;) { + irg_verify(get_irp_irg(--i), 0); + } + tr_verify(); + } # endif /* defined DEBUG_libfirm */ } -/* Delete all graphs that we have found to be dead from the program */ -void rta_delete_dead_graphs () +/** + * walker for all types and entities + * + * Changes the peculiarity of entities that represents + * dead graphs to peculiarity_description. + */ +static void make_entity_to_description(type_or_ent tore, void *env) { - int i; - int n_graphs = get_irp_n_irgs (); - ir_graph *graph = NULL; + (void) env; + if (is_entity(tore.ent)) { + ir_entity *ent = tore.ent; + + if ((is_Method_type(get_entity_type(ent))) && + !entity_is_externally_visible(ent)) { + ir_graph *irg = get_entity_irg(ent); + if (irg != NULL && ! pset_new_contains(_live_graphs, irg)) { + set_entity_peculiarity(ent, peculiarity_description); + set_entity_irg(ent, NULL); + } + } + } +} - eset *dead_graphs = eset_create (); +/* Delete all graphs that we have found to be dead from the program + If verbose == 1, print statistics, if > 1, chatter about every detail +*/ +void rta_delete_dead_graphs(void) +{ + size_t i, n_dead_irgs, n_graphs = get_irp_n_irgs(); + ir_graph *irg, *next_irg, *dead_irgs; - for (i = 0; i < n_graphs; i++) { - graph = get_irp_irg(i); + irp_reserve_resources(irp, IRP_RESOURCE_IRG_LINK); - if (is_alive (graph, _live_graphs, _dead_graphs)) { - /* do nothing (except some debugging fprintf`s :-) */ - } else { -# ifdef DEBUG_libfirm - entity *ent = get_irg_entity (graph); - assert (visibility_external_visible != get_entity_visibility (ent)); -# endif /* defined DEBUG_libfirm */ + n_dead_irgs = 0; + dead_irgs = NULL; + for (i = n_graphs; i > 0;) { + irg = get_irp_irg(--i); - eset_insert (dead_graphs, graph); - } - } + if (! rta_is_alive_graph(irg)) { + set_irg_link(irg, dead_irgs); + dead_irgs = irg; + ++n_dead_irgs; + } + } - /* now delete the graphs. */ - for (graph = eset_first (dead_graphs); - graph; - graph = (ir_graph*) eset_next (dead_graphs)) { - remove_irg (graph); - } + /* Hmm, probably we need to run this only if dead_irgs is non-NULL */ + type_walk(make_entity_to_description, NULL, NULL); + for (irg = dead_irgs; irg != NULL; irg = next_irg) { + next_irg = (ir_graph*) get_irg_link(irg); + remove_irp_irg(irg); + } + + DB((dbg, LEVEL_1, "RTA: dead methods = %zu\n", n_dead_irgs)); + + irp_free_resources(irp, IRP_RESOURCE_IRG_LINK); } /* Clean up the RTA data structures. Call this after calling rta_init */ -void rta_cleanup () +void rta_cleanup(void) { # ifdef DEBUG_libfirm - int i; - for (i = 0; i < get_irp_n_irgs(); i++) { - irg_vrfy (get_irp_irg(i)); - } - tr_vrfy (); + size_t i; + for (i = get_irp_n_irgs(); i > 0;) { + irg_verify(get_irp_irg(--i), 0); + } + tr_verify(); # endif /* defined DEBUG_libfirm */ - if (_live_classes) { - eset_destroy (_live_classes); - _live_classes = NULL; - } - - if (_live_fields) { - eset_destroy (_live_fields); - _live_fields = NULL; - } - - if (_called_methods) { - eset_destroy (_called_methods); - _called_methods = NULL; - } - - if (_live_graphs) { - eset_destroy (_live_graphs); - _live_graphs = NULL; - } - - if (_dead_graphs) { - eset_destroy (_dead_graphs); - _dead_graphs = NULL; - } + if (_live_classes != NULL) { + pset_new_destroy(_live_classes); + free(_live_classes); + _live_classes = NULL; + } + + if (_live_graphs != NULL) { + pset_new_destroy(_live_graphs); + free(_live_graphs); + _live_graphs = NULL; + } } /* Say whether this class might be instantiated at any point in the program: */ -int rta_is_alive_class (type *clazz) +int rta_is_alive_class(ir_type *clazz) { - return (eset_contains (_live_classes, clazz)); + return pset_new_contains(_live_classes, clazz); } /* Say whether this graph might be run at any time in the program: */ -int rta_is_alive_graph (ir_graph *graph) +int rta_is_alive_graph(ir_graph *graph) { - if (eset_contains (_live_graphs, graph)) { - return (TRUE); - } - - if (eset_contains (_dead_graphs, graph)) { - return (FALSE); - } - - entity *meth = get_irg_ent (graph); - - if (has_live_call (meth, graph) && has_live_class (meth, graph)) { - eset_insert (_live_graphs, graph); - - return (TRUE); - } else { - eset_insert (_dead_graphs, graph); - - return (FALSE); - } + return pset_new_contains(_live_graphs, graph); } -/* Say whether there have been any accesses to this field: */ -int rta_is_alive_field (entity *field) +/* dump our opinion */ +void rta_report(void) { - return (eset_contains (_live_fields, field)); + size_t i, n; + + n = get_irp_n_types(); + for (i = 0; i < n; ++i) { + ir_type *tp = get_irp_type(i); + if (is_Class_type(tp) && rta_is_alive_class(tp)) { + ir_printf("RTA: considered allocated: %+F\n", tp); + } + } + + n = get_irp_n_irgs(); + for (i = 0; i < n; i++) { + ir_graph *irg = get_irp_irg(i); + if (rta_is_alive_graph(irg)) { + ir_printf("RTA: considered called: graph of %+F\n", irg); + } + } } - - - -/* - * $Log$ - * Revision 1.9 2004/06/17 08:56:03 liekweg - * Fixed typos in comments - * - * Revision 1.8 2004/06/17 08:33:01 liekweg - * Added comments; added remove_irg - * - * Revision 1.6 2004/06/14 13:02:03 goetz - * bugfixesbug - * - * Revision 1.5 2004/06/13 15:03:45 liekweg - * RTA auf Iterative RTA aufgebohrt --flo - * - * Revision 1.4 2004/06/12 19:35:04 liekweg - * Kommentare eingef"ugt --flo - * - * Revision 1.3 2004/06/12 17:09:46 liekweg - * RTA works, outedges breaks. "Yay." --flo - * - * Revision 1.2 2004/06/11 18:25:39 liekweg - * Added todo - * - * Revision 1.1 2004/06/11 18:24:18 liekweg - * Added RTA --flo - * - */