-/* -*- 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-2008 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 <config.h>
-#endif
+#include "config.h"
#include "rta.h"
#include <stdlib.h>
#include "irnode_t.h"
-#include "irprog.h"
+#include "irprog_t.h"
+#include "irgraph_t.h"
#include "eset.h"
#include "irgwalk.h"
#include "irgmod.h"
#include "irvrfy.h"
-#include "trvrfy.h"
+#include "irprintf.h"
+#include "debug.h"
+#include "error.h"
+
+# ifndef TRUE
+# define TRUE 1
+# define FALSE 0
+# endif /* not defined TRUE */
-# 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 eset *_live_classes = NULL;
/* cache computed results */
-static eset *_live_graphs = NULL;
-static eset *_dead_graphs = NULL;
-
-static int whole_world = 0;
-static int verbose = 0;
+static eset *_live_graphs = NULL;
/**
- Initialise the static data structures.
-*/
-static void init_tables (void)
+ * 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 int add_graph(ir_graph *graph)
{
- _live_classes = eset_create ();
- _live_fields = eset_create ();
- _called_methods = eset_create ();
+ if (!eset_contains(_live_graphs, graph)) {
+ DB((dbg, LEVEL_2, "RTA: new graph of %+F\n", graph));
- _live_graphs = eset_create ();
- _dead_graphs = eset_create ();
+ eset_insert(_live_graphs, graph);
+ return TRUE;
+ }
- if (get_irp_main_irg ()) {
- eset_insert (_live_graphs, get_irp_main_irg ());
- }
-
- if (get_glob_type ()) {
- eset_insert (_live_classes, get_glob_type ());
- }
+ return FALSE;
}
/**
- Enter all method and field accesses and all class allocations into
- our tables.
-*/
-static void rta_act (ir_node *node, void *env)
+ * 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 int add_class(ir_type *clazz)
{
- 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);
- eset_insert (_called_methods, ent);
- } else if (iro_Const == get_irn_opcode (ptr)) { /* CALL CONST */
- ent = get_tarval_entity (get_Const_tarval (ptr));
- ir_graph *graph = get_entity_irg (ent);
-
- eset_insert (_live_graphs, graph);
- } else if (iro_SymConst == get_irn_opcode (ptr)) { /* CALL SYMCONST */
- /* If this SymConst refers to a method the method is external_visible
- and therefore must be considered live anyways. */
- /* assert (ent && "couldn't determine entity of call to symConst"); */
- }
- } 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 (!eset_contains(_live_classes, clazz)) {
+ DB((dbg, LEVEL_2, "RTA: new class: %+F\n", clazz));
-/**
- 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;
+ eset_insert(_live_classes, clazz);
+ 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.
+/** Given an entity, add all implementing graphs that belong to live classes
+ * to _live_graphs.
+ *
+ * Iff additions occurred, return TRUE, else FALSE.
*/
-static int is_alive (ir_graph *graph, eset *live_graphs, eset *dead_graphs)
+static int add_implementing_graphs(ir_entity *method)
{
- if (eset_contains (live_graphs, graph)) {
- return (TRUE);
- }
+ int i;
+ int n_over = get_entity_n_overwrittenby(method);
+ ir_graph *graph = get_entity_irg(method);
+ int change = FALSE;
- if (eset_contains (dead_graphs, graph)) {
- return (FALSE);
- }
+ if (NULL == graph)
+ graph = get_entity_irg(method);
- assert (0 && "graph neither live not dead (shouldn't happen)");
-}
+ DB((dbg, LEVEL_2, "RTA: new call to %+F\n", method));
-/**
- Traverse all graphs to collect method and field accesses and object allocations.
+ if (rta_is_alive_class(get_entity_owner(method))) {
+ if (NULL != graph)
+ change = add_graph(graph);
+ }
- @param rerun Whether to rely on is_alive in a second run
-*/
-static void rta_fill_all (int rerun)
-{
- 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);
-
- if (! whole_world) {
- /* Need to take care of graphs that are externally
- visible. Pretend that they are called: */
- entity *ent = get_irg_entity (graph);
- if (visibility_external_visible == 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 */
-}
+ for (i = 0; i < n_over; ++i) {
+ ir_entity *over = get_entity_overwrittenby(method, i);
+ change |= add_implementing_graphs(over);
+ }
-/**
- Given a method, find the firm graph that implements that method.
-*/
-static ir_graph *get_implementing_graph (entity *method)
-{
- 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);
+ return change;
}
-/* -------------------------------------------------------------------
- Method Calls
- ------------------------------------------------------------------- */
/**
- Find out whether the given method could be the target of a
- polymorphic call.
-*/
-static int has_live_upcall (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)
{
- int is_target = FALSE;
- int i;
- int n_over;
-
- /* The method could be the target of a polymorphic call if it is
- called or if it overrides a method that is called. */
-
- if (eset_contains (_called_methods, (entity*) method)) {
- return (TRUE);
- }
-
- /* not called? check methods in superclass(es) */
- n_over = get_entity_n_overwrites ((entity*) method);
- for (i = 0; !is_target && (i < n_over); i ++) {
- entity *over = get_entity_overwrites ((entity*) method, i);
- is_target |= has_live_upcall (over);
- }
-
- return (is_target);
+ int *change = (int *)env;
+ ir_opcode 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 wether the given method is called through polymorphy with
- the given graph
+ Traverse the given graph to collect method accesses and
+ object allocations.
*/
-static int has_live_downcall (entity *method, ir_graph *graph)
+static int rta_fill_graph(ir_graph* graph)
{
- int has_downcall = FALSE;
- int i, n_over;
-
- if (graph != get_entity_irg ((entity*) method)) {
- return (FALSE);
- }
-
- if (eset_contains (_called_methods, 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_downcall && (i < n_over); i ++) {
- entity *over = get_entity_overwrittenby ((entity*) method, i);
- has_downcall |= has_live_downcall (over, graph);
- }
-
- return (has_downcall);
+ int change = FALSE;
+ irg_walk_graph(graph, rta_act, NULL, &change);
+ return change;
}
/**
- Determine whether the given method or one of its overwriters have
- been used in a call to the given graph.
-*/
-static int has_live_call (entity *method, ir_graph *graph)
-{
- /* maybe we're called (possibly through polymorphy)? */
- if (has_live_upcall (method)) {
- return (TRUE);
- }
-
- /* maybe our subclasses have seen a call? */
- if (has_live_downcall (method, graph)) {
- return (TRUE);
- }
-
- return (FALSE);
-}
-
-/* -------------------------------------------------------------------
- Class Instantiations
- ------------------------------------------------------------------- */
-static int has_live_superclass (entity *method, ir_graph *graph)
+ * Traverse all graphs to collect method accesses and object allocations.
+ */
+static int rta_fill_incremental(void)
{
- int has_super = FALSE;
- int i;
- int n_over;
+ int i;
+ int n_runs = 0;
+ int rerun = TRUE;
+#ifdef INTERPROCEDURAL_VIEW
+ int old_ip_view = get_interprocedural_view();
- /* The method could be the target of a polymorphic call if it is
- called or if it overrides a method that is called. */
-
- if (eset_contains (_live_classes, get_entity_owner (method))) {
- return (TRUE);
- }
-
- /* not allocated? check methods in superclass(es) */
- n_over = get_entity_n_overwrites ((entity*) method);
- for (i = 0; !has_super && (i < n_over); i ++) {
- entity *over = get_entity_overwrites ((entity*) method, i);
- has_super |= has_live_superclass (over, graph);
- }
+ set_interprocedural_view(0); /* save this for later */
+#endif
- return (has_super);
-}
+ /* 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 = get_irp_n_irgs() - 1; i >= 0; --i) {
+ ir_graph *graph = get_irp_irg(i);
+ ir_entity *ent = get_irg_entity(graph);
+ ir_linkage linkage = get_entity_linkage(ent);
+
+ if (entity_is_externally_visible(ent)
+ || (linkage & IR_LINKAGE_HIDDEN_USER)) {
+ eset_insert(_live_graphs, graph);
+ }
+ }
+
+ while (rerun) {
+ ir_graph *graph;
+
+ /* start off new */
+ eset *live_graphs = _live_graphs;
+ _live_graphs = eset_create();
+
+ DB((dbg, LEVEL_2, "RTA: RUN %i\n", n_runs));
+
+ /* collect what we have found previously */
+ eset_insert_all(_live_graphs, live_graphs);
+
+ rerun = FALSE;
+ for (graph = eset_first(live_graphs);
+ graph != NULL;
+ graph = eset_next(live_graphs)) {
+ DB((dbg, LEVEL_2, "RTA: RUN %i: considering graph of %+F\n", n_runs, graph));
+ rerun |= rta_fill_graph(graph);
+ }
+ eset_destroy(live_graphs);
+ ++n_runs;
+ }
+
+#ifdef INTERPROCEDURAL_VIEW
+ set_interprocedural_view(old_ip_view); /* cover up our traces */
+#endif
-static int has_live_subclass (entity *method, ir_graph *graph)
-{
- int has_sub = FALSE;
- int i;
- int n_over;
-
- /* a class that doesn't use the graph in question can't help here: */
- ir_graph *impl = get_implementing_graph (method);
-
- /* this function is only called starting at 'graph's method, and
- we're checking *downwards*, so impl must be != NULL */
- assert (impl);
- if (impl != graph) {
- return (FALSE);
- }
-
- /* otherwise, an instantiated class helps a lot! */
- if (rta_is_alive_class (get_entity_owner (method))) {
- return (TRUE);
- }
-
- /* maybe our subclasses use this graph *and* have been instantiated ? */
- n_over = get_entity_n_overwrittenby ((entity*) method);
- for (i = 0; !has_sub && (i < n_over); i ++) {
- entity *over = get_entity_overwrittenby ((entity*) method, i);
- has_sub |= has_live_subclass (over, graph);
- }
-
- return (has_sub);
+ 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)
-{
- /* maybe we're called (possibly through polymorphy)? */
- if (has_live_superclass (method, graph)) {
- return (TRUE);
- }
-
- /* maybe our subclasses have seen a call? */
- if (has_live_subclass (method, graph)) {
- return (TRUE);
- }
-
- return (FALSE);
-
-}
-
-/*
- 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 int stats(void)
{
- int i;
- int n_live_graphs = 0;
- int n_graphs = get_irp_n_irgs();
+ int i;
+ int n_live_graphs = 0;
- for (i = 0; i < n_graphs; i++) {
- ir_graph *graph = get_irp_irg(i);
+ for (i = get_irp_n_irgs() - 1; i >= 0; --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 */
/*
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);
-
-/* DDMEO (get_irg_ent(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_type *tp;
+ int i, n;
+ ir_graph *irg;
+
+ _live_classes = eset_create();
+ _live_graphs = eset_create();
+
+ irg = get_irp_main_irg();
+ if (irg != NULL) {
+ /* add the main irg to the live set if one is specified */
+ eset_insert(_live_graphs, irg);
+ }
+
+ /* Find static allocated classes */
+ tp = get_glob_type();
+ n = get_class_n_members(tp);
+ for (i = 0; i < n; ++i) {
+ ir_type *member_type = get_entity_type(get_class_member(tp, i));
+ if (is_Class_type(member_type))
+ eset_insert(_live_classes, member_type);
+ }
+
+ tp = get_tls_type();
+ n = get_struct_n_members(tp);
+ for (i = 0; i < n; ++i) {
+ ir_type *member_type = get_entity_type(get_struct_member(tp, i));
+ if (is_Class_type(member_type))
+ eset_insert(_live_classes, member_type);
+ }
+
+ /** @FIXME: add constructors/destructors */
}
-/* Initialise the RTA data structures, and perform RTA.
- @param do_verbose Iff != 0, print statistics as we go along
- @param do_whole_world Iff != 0, assume whole-world
-*/
-void rta_init (int do_verbose, int do_whole_world)
+/*
+ * 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;
+ int rem_vpi = get_visit_pseudo_irgs();
+ set_visit_pseudo_irgs(1);
- whole_world = do_whole_world;
- verbose = do_verbose;
+ 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 ();
+ {
+ int i;
+ for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
+ irg_vrfy(get_irp_irg(i));
+ }
+ tr_vrfy();
+ }
# endif /* defined DEBUG_libfirm */
- init_tables ();
-
- if (verbose && whole_world) {
- printf ("RTA: whole-world assumption\n");
- }
+ init_tables();
- if (verbose) {
- printf ("RTA: run %i (%i graphs to go)\n", n_runs, n_live_graphs);
- }
+ n_runs = rta_fill_incremental();
- rta_fill_all (FALSE);
-
- while (n_graphs != n_live_graphs) {
- n_graphs = n_live_graphs;
- n_runs ++;
- rta_fill_all (TRUE);
- n_live_graphs = stats ();
-
- 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 = %i\n", get_irp_n_irgs()));
+ DB((dbg, LEVEL_1, "RTA: n_live_graphs = %i\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 ();
+ {
+ int i;
+
+ for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
+ irg_vrfy(get_irp_irg(i));
+ }
+ tr_vrfy();
+ }
# endif /* defined DEBUG_libfirm */
+
+ set_visit_pseudo_irgs(rem_vpi);
}
-/* Delete all graphs that we have found to be dead from the program */
-void rta_delete_dead_graphs (void)
+/**
+ * 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 && ! eset_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)
+{
+ int 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);
+ int rem_vpi = get_visit_pseudo_irgs();
+ set_visit_pseudo_irgs(1);
- 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 (whole_world ||
- (visibility_external_visible != get_entity_visibility (ent)));
-# endif /* defined DEBUG_libfirm */
+ irp_reserve_resources(irp, IR_RESOURCE_IRG_LINK);
+
+ n_dead_irgs = 0;
+ dead_irgs = NULL;
+ for (i = n_graphs - 1; i >= 0; --i) {
+ 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)) {
+ /* 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 = get_irg_link(irg);
+ remove_irp_irg(irg);
+ }
- if (verbose) {
- fprintf(stdout, "RTA: removing graph of ");
- DDMEO(get_irg_ent (graph));
- }
+ DB((dbg, LEVEL_1, "RTA: dead methods = %i\n", n_dead_irgs));
- remove_irg (graph);
- }
+ irp_free_resources(irp, IR_RESOURCE_IRG_LINK);
+ set_visit_pseudo_irgs(rem_vpi);
}
/* Clean up the RTA data structures. Call this after calling rta_init */
-void rta_cleanup (void)
+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 ();
+ int i;
+ for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
+ irg_vrfy(get_irp_irg(i));
+ }
+ tr_vrfy();
# 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) {
+ eset_destroy(_live_classes);
+ _live_classes = NULL;
+ }
+
+ if (_live_graphs != NULL) {
+ eset_destroy(_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 eset_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)
{
- int has_call = FALSE;
- int has_class = FALSE;
-
- if (eset_contains (_live_graphs, graph)) {
- return (TRUE);
- }
-
- if (eset_contains (_dead_graphs, graph)) {
- return (FALSE);
- }
-
- entity *meth = get_irg_ent (graph);
-
- has_call = has_live_call (meth, graph);
- has_class = has_live_class (meth, graph);
-
- if (has_call && has_class) {
- eset_insert (_live_graphs, graph);
-
- return (TRUE);
- } else {
- eset_insert (_dead_graphs, graph);
-
- return (FALSE);
- }
-}
-
-/* Say whether there have been any accesses to this field: */
-int rta_is_alive_field (entity *field)
-{
- return (eset_contains (_live_fields, field));
+ return eset_contains(_live_graphs, graph);
}
/* dump our opinion */
-void rta_report (void)
+void rta_report(void)
{
- int i;
-
- for (i = 0; i < get_irp_n_types(); ++i) {
- type *tp = get_irp_type(i);
- if (is_class_type(tp) && rta_is_alive_class(tp)) {
- fprintf(stdout, "RTA: considered allocated: "); DDMT(tp);
- }
- }
-
- for (i = 0; i < get_irp_n_irgs(); i++) {
- if (rta_is_alive_graph (get_irp_irg(i))) {
- fprintf(stdout, "RTA: considered called: graph of ");
- DDMEO(get_irg_ent (get_irp_irg(i)));
- }
- }
+ int 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.14 2004/06/18 13:12:43 liekweg
- * final bug fix (calls via consts)
- *
- * Revision 1.13 2004/06/17 16:34:33 liekweg
- * removed DD*s
- *
- * Revision 1.12 2004/06/17 16:33:33 liekweg
- * minor bug fix
- *
- * Revision 1.11 2004/06/17 14:21:13 liekweg
- * major bugfix
- *
- * Revision 1.10 2004/06/17 10:31:41 goetz
- * irscc: bugfix, can now deal with loops not reachable from start
- * cgana: bugfix, skip_Tuple
- * rta: improved
- *
- * 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
- *
- */
projects / libfirm / blobdiff