X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Frta.c;h=bcee4f3b0e58e2058f35b1141767c82f3ce54b69;hb=c28b0f0f320bb045a53900576d9926916b22176f;hp=fc721be0cb00be5f14d8d01d1c8189dd5b7a9604;hpb=cfc4e077f8ed34530acc8f0a58a2d8431ea16fc2;p=libfirm

diff --git a/ir/ana/rta.c b/ir/ana/rta.c
index fc721be0c..bcee4f3b0 100644
--- a/ir/ana/rta.c
+++ b/ir/ana/rta.c
@@ -3,19 +3,27 @@
 /*
  * Project:     libFIRM
  * File name:   ir/ana/rta.c
- * Purpose:     Intraprozedural analyses to improve the call graph estimate.
+ * Purpose:     Interprocedural analysis to improve the call graph estimate.
  * Author:      Florian
  * Modified by:
  * Created:     09.06.2002
- * CVS-ID:      $$
+ * CVS-ID:      $Id$
  * Copyright:   (c) 1999-2004 Universität Karlsruhe
- * Licence:     This file protected by GPL -  GNU GENERAL PUBLIC LICENSE.
+ * Licence:     This file is protected by GPL -  GNU GENERAL PUBLIC LICENSE.
  */
 
 /**
- * Intraprozedurale Analyse zur Abschätzung der Aufrufrelation. Es
- * die Menge der instantiierten Klassen bestimmt, und daraus existierende Methoden
- * bestimmt.
+ * Intraprozedurale Analyse zur Abschätzung der Aufrufrelation. Es wird
+ * die Menge der instantiierten Klassen bestimmt, und daraus eine Abschätzung
+ * der aufgerufenen Methoden.
+ *
+ * Voraussetzung ist, dass das Programm keine Methodenzeiger handhaben kann.
+ * In diesem Fall koennten Methoden verloren gehen.  Oder wir muessen nach
+ * allen "freien" Methoden suchen (siehe cgana).
+ *
+ * @@@ Die Analyse sollte wissen, von welchen Klassen Instanzen ausserhalb
+ * der Uebersetzungseinheit alloziert werden koennen.  Diese muessen in
+ * die initiale Menge allozierter Klassen aufgenommern werden.
  */
 
 #ifdef HAVE_CONFIG_H
@@ -25,439 +33,567 @@
 #include "rta.h"
 
 #include <stdlib.h>
-#include "cgana.h"              /* get_implementation */
 
 #include "irnode_t.h"
-#include "irprog.h"
+#include "irprog_t.h"
 
 #include "eset.h"
-/* #include "pmap.h" */
-/* #include "array.h" */
 #include "irgwalk.h"
-/* #include "ircons.h" */
-/* #include "irgmod.h" */
-/* #include "irflag_t.h" */
+#include "irgmod.h"
+#include "irvrfy.h"
+#include "trvrfy.h"
 
-/* #include "dbginfo_t.h" */
+# ifndef TRUE
+#  define TRUE 1
+#  define FALSE 0
+# endif /* not defined TRUE */
+
+/* flags */
+static int verbose     = 0;
 
-# define TRUE 1
-# define FALSE 0
 
 /* base data */
 static eset *_live_classes   = NULL;
-static eset *_live_fields    = NULL;
-static eset *_called_methods = NULL;
 
 /* cache computed results */
 static eset *_live_graphs    = NULL;
-static eset *_dead_graphs    = NULL;
-
-/* now the meat */
 
-static void init_tables ()
+/**
+   Given a method, find the firm graph that implements that method.
+*/
+static ir_graph *get_implementing_graph (entity *method)
 {
-  _live_classes   = eset_create ();
-  _live_fields    = eset_create ();
-  _called_methods = eset_create ();
+#if 0
+  ir_graph *graph = get_entity_irg ((entity*) method);
 
-  _live_graphs = eset_create ();
-  _dead_graphs = eset_create ();
+  /* Search upwards in the overwrites graph. */
+  /* GL: this will not work for multiple inheritance */
+  if (NULL == graph) {
+    int i;
+    int n_over = get_entity_n_overwrites ((entity*) method);
 
-  if (get_irp_main_irg ()) {
-    eset_insert (_live_graphs, get_irp_main_irg ());
+    for (i = 0; (NULL == graph) && (i < n_over); i ++) {
+      entity *over = get_entity_overwrites ((entity*) method, i);
+      graph = get_implementing_graph (over);
+    }
+  }
+
+  /* GL   this is not valid in our remove irg algorithm ... which we removed by now ...  */
+  assert(get_entity_peculiarity(method) == peculiarity_description
+     || graph == get_entity_irg(get_SymConst_entity(get_atomic_ent_value(method))));
+
+  /* we *must* always return a graph != NULL, *except* when we're used
+     inside remove_irg or force_description */
+  /* assert (graph && "no graph"); */
+
+  return (graph);
+#else
+  ir_graph *graph = NULL;
+
+  if (get_entity_peculiarity(method) != peculiarity_description)
+    graph = get_entity_irg(get_SymConst_entity(get_atomic_ent_value(method)));
+
+  return graph;
+#endif
+}
+
+static int add_graph (ir_graph *graph)
+{
+  if (!eset_contains (_live_graphs, graph)) {
+    if (verbose > 1) {
+      fprintf(stdout, "RTA:        new graph of ");
+      DDMEO(get_irg_entity (graph));
+    }
+
+    eset_insert (_live_graphs, graph);
+    return (TRUE);
   }
 
-  if (get_glob_type ()) {
-    eset_insert (_live_classes, get_glob_type ());
+  return (FALSE);
+}
+
+static int add_class (type *clazz)
+{
+  if (!eset_contains (_live_classes, clazz)) {
+    if (verbose > 1) {
+      fprintf(stdout, "RTA:        new class: ");
+      DDMT(clazz);
+    }
+
+    eset_insert (_live_classes, clazz);
+    return (TRUE);
   }
 
+  return (FALSE);
 }
 
-/**
-   Enter all method and field accesses and all class allocations into our tables.
+/** 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_act (ir_node *node, void *env)
+static int add_implementing_graphs (entity *method)
 {
-  opcode op = get_irn_opcode (node);
+  int i;
+  int n_over = get_entity_n_overwrittenby (method);
+  ir_graph *graph = get_entity_irg (method);
+  int change = FALSE;
 
-  if (iro_Call == op) {
-    entity *ent = NULL;
+  if (NULL == graph) {
+    graph = get_implementing_graph (method);
+  }
 
-    ir_node *ptr = get_Call_ptr (node);
+  if (verbose > 1) {
+    fprintf(stdout, "RTA:        new call to ");
+    DDMEO(method);
+  }
 
-    if (iro_Sel == get_irn_opcode (ptr)) {
-      ent = get_Sel_entity (ptr);
-    } else if (iro_Const == get_irn_opcode (ptr)) {
-      ent = get_tarval_entity (get_Const_tarval (ptr));
+  if (rta_is_alive_class (get_entity_owner (method))) {
+    if (NULL != graph) {
+      change = add_graph (graph);
     }
+  }
 
-    /* assert (ent); */
+  for (i = 0; i < n_over; i ++) {
+    entity *over = get_entity_overwrittenby (method, i);
+    change |= add_implementing_graphs (over);
+  }
 
-    if (ent) {
-      eset_insert (_called_methods, ent);
-    }
-  } else if (iro_Load  == op) {
-    ir_node *ptr = get_Load_ptr (node);
-    entity  *ent = NULL;
+  return (change);
+}
 
-    if (iro_Sel == get_irn_opcode (ptr)) {
-      ent = get_Sel_entity (ptr);
-    }
-    if (ent) {
-      eset_insert (_live_fields, ent);
-    }
-  } else  if (iro_Store == op) {
-    ir_node *ptr = get_Store_ptr (node);
-    entity  *ent = NULL;
+/** 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 *change = (int*) env;
+
+  opcode op = get_irn_opcode (node);
 
+  if (iro_Call == op) {         /* CALL */
+    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) {
+    ent = get_SymConst_entity (ptr);
+    ir_graph *graph = get_entity_irg (ent);
+    if (graph) {
+      *change |= add_graph (graph);
+    } else {
+      /* it's an external allocated thing. */
     }
-    if (ent) {
-      eset_insert (_live_fields, ent);
+      } else if (get_SymConst_kind(ptr) == symconst_addr_name) {
+    /* If this SymConst refers to a method the method is external_visible
+       and therefore must be considered live anyways. */
+    if (get_SymConst_name(ptr) != new_id_from_str("iro_Catch"))
+      assert (ent && "couldn't determine entity of call to symConst");
+      } else {
+    /* other symconst. */
+    assert(0 && "This SymConst can not be an address for a method call.");
+      }
+
+    /* STRANGE */
+    } else {
+      DDMN(ptr);
+      assert(0 && "Unexpected address expression: can not analyse, therefore can not do correct rta!");
     }
-  } else if (iro_Alloc == op) {
+
+  } else if (iro_Alloc == op) { /* ALLOC */
     type *type = get_Alloc_type (node);
 
-    eset_insert (_live_classes, type);
+    *change |= add_class (type);
   }
 }
 
 /**
-Traverse the given graph to collect method and field accesses and object allocations.
+   Traverse the given graph to collect method accesses and
+   object allocations.
 */
-static void rta_fill_graph (ir_graph* graph)
+static int rta_fill_graph (ir_graph* graph)
 {
-  if (NULL != graph) {
-    if (NULL != get_irg_end_block (graph)) {
-      irg_walk (get_irg_end_block (graph), rta_act, NULL, NULL);
-    }
-  }
-}
+  int change = FALSE;
 
-static int is_alive (ir_graph *graph, eset *live_graphs, eset *dead_graphs)
-{
-  if (eset_contains (live_graphs, graph)) {
-    return (TRUE);
-  }
+  current_ir_graph = graph;
 
-  if (eset_contains (dead_graphs, graph)) {
-    return (FALSE);
-  }
+  irg_walk_graph (graph, rta_act, NULL, &change);
 
-  assert (0 && "what's up");
+  return (change);
 }
 
-/**
-   Traverse all graphs to collect method and field accesses and object allocations.
-
-   @param rerun Whether to rely on is_alive in a second run
-*/
-static void rta_fill_all (int rerun)
+/** Traverse all graphs to collect method accesses and object allocations.
+ *
+ *  @param rerun Whether to rely on is_alive in a second run
+ */
+static int rta_fill_incremental (void)
 {
   int i;
+  int n_runs = 0;
+  int rerun  = TRUE;
   int old_ip_view = interprocedural_view;
-  eset *live_graphs = NULL;
-  eset *dead_graphs = NULL;
 
-  interprocedural_view = 0;
+  interprocedural_view = 0;     /* save this for later */
 
-  if (rerun) {
-    int i;
-    int n_graphs = get_irp_n_irgs ();
+  /* 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; i < get_irp_n_irgs(); i++) {
+    ir_graph *graph = get_irp_irg (i);
+    entity *ent = get_irg_entity (graph);
 
-    /* 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));
+    if ((visibility_external_visible == get_entity_visibility (ent)) ||
+        (stickyness_sticky == get_entity_stickyness (ent))) {
+      eset_insert (_live_graphs, graph);
+      // printf("external visible: "); DDMG(graph);
     }
+  }
 
-    /* remember existing infos for later */
-    live_graphs = _live_graphs;
-    dead_graphs = _dead_graphs;
+  while (rerun) {
+    ir_graph *graph;
 
-    /* ensure that live_graphs and dead_graphs aren't deallocated by rta_cleanup */
-    _live_graphs = NULL;
-    _dead_graphs = NULL;
+    /* start off new */
+    eset *live_graphs = _live_graphs;
+    _live_graphs = eset_create ();
 
-    rta_cleanup ();
-    init_tables ();
-  }
+    if (verbose > 1) {
+      fprintf(stdout, "RTA: RUN %i\n", n_runs);
+    }
 
-  /* 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);
+    /* collect what we have found previously */
+    eset_insert_all (_live_graphs, live_graphs);
+
+    rerun = FALSE;
+    for (graph = eset_first (live_graphs);
+         graph;
+         graph = eset_next (live_graphs)) {
 
-    if (!rerun || is_alive (graph, live_graphs, dead_graphs)) {
-      rta_fill_graph (graph);
+      if (verbose > 1) {
+        fprintf(stdout, "RTA: RUN %i: considering graph of ", n_runs);
+        DDMEO(get_irg_entity (graph));
+      }
+
+      rerun |= rta_fill_graph (graph);
     }
-  }
 
-  if (rerun) {
-    /* clean up the tables that we have retained */
     eset_destroy (live_graphs);
-    eset_destroy (dead_graphs);
+
+    n_runs ++;
   }
 
-  interprocedural_view = old_ip_view;
+  interprocedural_view = old_ip_view; /* cover up our traces */
+
+  return (n_runs);
 }
 
-/**
-   Find out whether the given method could be the target of a
-   polymorphic call.
+/*
+   Count the number of graphs that we have found to be live.
 */
-static int is_call_target (const entity *method)
+static int stats (void)
 {
-  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. */
+  int n_live_graphs = 0;
+  int n_graphs = get_irp_n_irgs();
 
-  if (eset_contains (_called_methods, (entity*) method)) {
-    return (TRUE);
-  }
+  for (i = 0; i < n_graphs; i++) {
+    ir_graph *graph = get_irp_irg(i);
 
-  /* 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);
+    if (rta_is_alive_graph (graph)) {
+      n_live_graphs ++;
+    }
   }
 
-  return (is_target);
+  return (n_live_graphs);
 }
 
-/**
-   Given a method, find the firm graph that implements that method.
+/* remove a graph, part I */
+/*
+   We removed the first graph to implement the entity, so we're
+   abstract now.  Pretend that it wasn't there at all, and every
+   entity that used to inherit this entity's graph is now abstract.
 */
-static ir_graph *get_implementing_graph (const entity *method)
+/* Since we *know* that this entity will not be called, this is OK. */
+static void force_description (entity *ent, entity *addr)
 {
-  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);
+  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 = get_SymConst_entity(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 = get_SymConst_entity (f_addr);
+
+      assert ((get_irn_op(f_addr) == op_SymConst) && "can't do complex addrs");
+      if (impl_ent == addr) {
+        assert (0 && "gibt's denn sowas");
+        force_description (over, addr);
+      }
     }
   }
-
-  assert (graph && "no graph");
-
-  return (graph);
 }
 
 /**
-   Determine whether the give method or one of its overwriter have
-   been used in a call to the given graph.
+   Initialise the static data structures.
 */
-static int has_live_call (entity *method, ir_graph *graph)
+static void init_tables (void)
 {
-  int has_call = FALSE;
-  int i, n_over;
+  int i, n_globs = get_class_n_members(get_glob_type());
 
-  /* stop searching if a overwriting method comes with a new graph */
-  if (get_irg_ent (graph) != method) {
-    return (FALSE);
-  }
+  _live_classes = eset_create ();
+  _live_graphs  = eset_create ();
 
-  /* maybe we're called (possibly through polymorphy)? */
-  if (is_call_target (method)) {
-    return (TRUE);
+  if (get_irp_main_irg ()) {
+    eset_insert (_live_graphs, get_irp_main_irg ());
   }
 
-  /* 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);
+  /* Find static allocated classes */
+  for (i = 0; i < n_globs; ++i) {
+    type *member_type = get_entity_type(get_class_member(get_glob_type(), i));
+    if (is_class_type(member_type))
+      eset_insert(_live_classes, member_type);
   }
-
-  return (has_call);
 }
 
-/**
-   Determine whether the given class is live *and* uses the given
-   graph at some point.
-*/
-static int has_graph (type *clazz, ir_graph *graph)
+/*
+ * Initialise the RTA data structures, and perform RTA.
+ * do_verbose If == 1, print statistics, if > 1, chatter about every detail
+ */
+void rta_init (int do_verbose)
 {
-  int has_the_graph = FALSE;
+  int n_runs = 0;
+
+# ifdef DEBUG_libfirm
   int i;
-  int n_sub;
+  for (i = 0; i < get_irp_n_irgs(); i++) {
+    irg_vrfy (get_irp_irg(i));
+  }
+  tr_vrfy ();
+# endif /* defined DEBUG_libfirm */
 
-  if (eset_contains (_live_classes, clazz)) {
-    int n_meth = get_class_n_members (clazz);
+  verbose = do_verbose;
 
-    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);
+  init_tables ();
 
-        if (impl == graph) {
-          return (TRUE);
-        }
-      } /* is_method */
-    } /* all methods */
-  } /* _live_classes.contains (clazz) */
+  n_runs = rta_fill_incremental ();
 
-  /* 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);
+  if (verbose) {
+    int n_live_graphs = stats ();
 
-    has_the_graph |= has_graph (sub, graph);
+    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);
   }
 
-  return (has_the_graph);
+# ifdef DEBUG_libfirm
+  for (i = 0; i < get_irp_n_irgs(); i++) {
+    irg_vrfy (get_irp_irg(i));
+  }
+  tr_vrfy ();
+# endif /* defined DEBUG_libfirm */
 }
 
 /**
-   Determine wether 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;
-
-  /* const char *name = get_entity_name (method); */
-
-  /* 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);
+ * 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) {
+  if (get_kind(tore) == k_entity) {
+    entity *ent = (entity *)tore;
+
+    if ((is_method_type(get_entity_type(ent)))                        &&
+    (get_entity_peculiarity(ent) != peculiarity_description)      &&
+    (get_entity_visibility(ent)  != visibility_external_allocated)   ) {
+      ir_graph *irg = get_entity_irg(get_SymConst_entity(get_atomic_ent_value(ent)));
+      if (!eset_contains (_live_graphs, irg)) {
+    set_entity_peculiarity(ent, peculiarity_description);
+    set_entity_irg(ent, NULL);
+      }
+    }
   }
-
-  return (has_class);
 }
 
-static int stats ()
+/* 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;
-  int n_live_graphs = 0;
-  int n_graphs = get_irp_n_irgs();
+  int n_graphs = get_irp_n_irgs ();
+  ir_graph *graph = NULL;
+  int n_dead_graphs = 0;
+
+  if (!get_optimize() || !get_opt_dead_method_elimination()) return;
+
+  ir_graph *dead_graphs[get_irp_n_irgs()];
 
   for (i = 0; i < n_graphs; i++) {
-    ir_graph *graph = get_irp_irg(i);
+    graph = get_irp_irg(i);
 
     if (rta_is_alive_graph (graph)) {
-      n_live_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 */
+
+      dead_graphs[n_dead_graphs] = graph;
+      n_dead_graphs ++;
     }
   }
 
-  return (n_live_graphs);
-}
-
-void rta_init (int verbose)
-{
-  int n_live_graphs = get_irp_n_irgs ();
-  int n_graphs = 0;
-  int n_runs = 0;
-
-  init_tables ();
-
-  printf ("RTA: run %i (%i graphs to go)\n", n_runs, n_live_graphs);
-  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);
-    }
+  type_walk(make_entity_to_description, NULL, NULL);
+  for (i = 0; i < n_dead_graphs; ++i) {
+    remove_irp_irg (dead_graphs[i]);
   }
 
   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);
+    printf ("RTA: n_dead_graphs = %i\n", n_dead_graphs);
   }
 }
 
-void rta_cleanup ()
+/* Clean up the RTA data structures.  Call this after calling rta_init */
+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 ();
+# 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;
-  }
 }
 
+/* Say whether this class might be instantiated at any point in the program: */
 int  rta_is_alive_class  (type   *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)
 {
-  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 eset_contains (_live_graphs, graph);
+}
 
-    return (TRUE);
-  } else {
-    eset_insert (_dead_graphs, graph);
+/* dump our opinion */
+void rta_report (void)
+{
+  int i;
 
-    return (FALSE);
+  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);
+    }
   }
-}
 
-int  rta_is_alive_field  (entity *field)
-{
-  return (eset_contains (_live_fields, field));
+  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_entity (get_irp_irg(i)));
+    }
+  }
 }
 
 
-
 /*
  * $Log$
+ * Revision 1.25  2004/10/18 12:47:08  liekweg
+ * avoid warning
+ *
+ * Revision 1.24  2004/09/24 13:59:04  beck
+ * fixed doxygen comments, removed initialization for description entities
+ *
+ * Revision 1.23  2004/08/19 16:51:02  goetz
+ * fixed some errors, pushed closer to inteded firm semantics
+ *
+ * Revision 1.22  2004/08/13 08:57:15  beyhan
+ * normalized names of functions, enums ...
+ * added suffix as argument to dumpers, removed global variable
+ * removed support for tarval/Const
+ *
+ * Revision 1.21  2004/07/08 15:50:56  goetz
+ * firmstat added
+ *
+ * Revision 1.20  2004/07/08 11:17:40  goetz
+ * *** empty log message ***
+ *
+ * Revision 1.19  2004/07/06 12:30:37  beyhan
+ * new SymConst semantics
+ *
+ * Revision 1.18  2004/06/27 21:17:41  liekweg
+ * Added comment
+ *
+ * Revision 1.17  2004/06/25 13:45:13  liekweg
+ * observe stickyness; minor refactoring
+ *
+ * Revision 1.16  2004/06/24 06:42:14  goetz
+ * test of firm flags
+ *
+ * Revision 1.15  2004/06/18 15:47:19  liekweg
+ * minor bug fix (go forward, not backward) --flo
+ *
+ * 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
  *