/*
* 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: $$
* 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.
+ * die Menge der instantiierten Klassen bestimmt, und daraus eine Abschätzung
+ * der aufgerufenen Methoden bestimmt.
*/
#ifdef HAVE_CONFIG_H
#include <stdlib.h>
#include "irnode_t.h"
-#include "irprog.h"
+#include "irprog_t.h"
#include "eset.h"
#include "irgwalk.h"
/* 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;
static int whole_world = 0;
static int verbose = 0;
/**
- Initialise the static data structures.
+ Given a method, find the firm graph that implements that method.
*/
-static void init_tables (void)
+static ir_graph *get_implementing_graph (entity *method)
{
- _live_classes = eset_create ();
- _live_fields = eset_create ();
- _called_methods = eset_create ();
+ ir_graph *graph = get_entity_irg ((entity*) method);
- _live_graphs = eset_create ();
- _dead_graphs = eset_create ();
+ 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);
+ }
}
- if (get_glob_type ()) {
- eset_insert (_live_classes, get_glob_type ());
- }
+ /* we *must* always return a graph != NULL, *except* when we're used
+ inside remove_irg or force_description */
+ /* assert (graph && "no graph"); */
+
+ return (graph);
}
-/**
- Enter all method and field accesses and all class allocations into
- our tables.
-*/
-static void rta_act (ir_node *node, void *env)
+static int 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);
- 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);
+ if (!eset_contains (_live_graphs, graph)) {
+ if (verbose > 1) {
+ fprintf(stdout, "RTA: new graph of ");
+ DDMEO(get_irg_ent (graph));
}
- } else if (iro_Alloc == op) { /* ALLOC */
- type *type = get_Alloc_type (node);
- eset_insert (_live_classes, type);
+ eset_insert (_live_graphs, graph);
+ return (TRUE);
}
-}
-
-/**
- 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;
- 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)
+static int add_class (type *clazz)
{
- if (eset_contains (live_graphs, graph)) {
- return (TRUE);
+ if (!eset_contains (_live_classes, clazz)) {
+ if (verbose > 1) {
+ fprintf(stdout, "RTA: new class: ");
+ DDMT(clazz);
}
- if (eset_contains (dead_graphs, graph)) {
- return (FALSE);
+ eset_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.
+ Given an entity, add all implementing graphs that belong to live classes to _live_graphs.
- @param rerun Whether to rely on is_alive in a second run
+ Iff additions occurred, return TRUE, else FALSE.
*/
-static void rta_fill_all (int rerun)
+static int add_implementing_graphs (entity *method)
{
int i;
- int old_ip_view = interprocedural_view;
- eset *live_graphs = NULL;
- eset *dead_graphs = NULL;
+ int n_over = get_entity_n_overwrittenby (method);
+ ir_graph *graph = get_entity_irg (method);
+ int change = FALSE;
- 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 ();
+ if (NULL == graph) {
+ graph = get_implementing_graph (method);
}
- /* 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)); */
- }
- }
+ if (verbose > 1) {
+ fprintf(stdout, "RTA: new call to ");
+ DDMEO(method);
+ }
- /* 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 (rta_is_alive_class (get_entity_owner (method))) {
+ if (NULL != graph) {
+ change = add_graph (graph);
}
}
- if (rerun) {
- /* clean up the tables that we have retained */
- eset_destroy (live_graphs);
- eset_destroy (dead_graphs);
+ for (i = 0; i < n_over; i ++) {
+ entity *over = get_entity_overwrittenby (method, i);
+ change |= add_implementing_graphs (over);
}
- interprocedural_view = old_ip_view; /* cover up our traces */
+ return (change);
}
/**
- Given a method, find the firm graph that implements that method.
+ Enter all method accesses and all class allocations into
+ our tables.
+
+ Set *(int*)env to true iff (possibly) new graphs have been found.
*/
-static ir_graph *get_implementing_graph (entity *method)
+static void rta_act (ir_node *node, void *env)
{
- ir_graph *graph = get_entity_irg ((entity*) method);
+ int *change = (int*) env;
- 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"); */
+ opcode op = get_irn_opcode (node);
- return (graph);
-}
+ if (iro_Call == op) { /* CALL */
+ entity *ent = NULL;
-/* -------------------------------------------------------------------
- Method Calls
- ------------------------------------------------------------------- */
-/**
- Find out whether the given method could be the target of a
- polymorphic call.
-*/
-static int has_live_upcall (entity *method)
-{
- int is_target = FALSE;
- int i;
- int n_over;
+ ir_node *ptr = get_Call_ptr (node);
- /* The method could be the target of a polymorphic call if it is
- called or if it overrides a method that is called. */
+ if (iro_Sel == get_irn_opcode (ptr)) { /* CALL SEL */
+ ent = get_Sel_entity (ptr);
+ *change = add_implementing_graphs (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);
+ /* don't use get_implementing_graph on a Const! */
+ if (graph) {
+ *change = add_graph (graph);
+ } else {
+ /* it's an external allocated thing. */
+ }
+ } else if (iro_SymConst == get_irn_opcode (ptr)) { /* CALL SYMCONST */
+ if (get_SymConst_kind(ptr) == symconst_addr_ent) {
+ ent = get_SymConst_entity (ptr);
+ ir_graph *graph = get_entity_irg (ent);
+ /* don't use get_implementing_graph on a SymConst! */
+ if (graph) {
+ *change = add_graph (graph);
+ } else {
+ /* it's an external allocated thing. */
+ }
+ } 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. */
+ /* assert (ent && "couldn't determine entity of call to symConst"); */
+ } else {
+ /* other symconst. */
+ }
- if (eset_contains (_called_methods, (entity*) method)) {
- return (TRUE);
- }
+ }
+ } else if (iro_Alloc == op) { /* ALLOC */
+ type *type = get_Alloc_type (node);
- /* 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);
+ *change = add_class (type);
}
-
- return (is_target);
}
/**
- 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);
- }
+ int change = FALSE;
- if (eset_contains (_called_methods, method)) {
- return (TRUE);
- }
+ current_ir_graph = graph;
- /* 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);
- }
+ irg_walk (get_irg_end (graph), rta_act, NULL, &change);
- return (has_downcall);
+ return (change);
}
/**
- Determine whether the given method or one of its overwriters have
- been used in a call to the given graph.
+ Traverse all graphs to collect method accesses and object allocations.
+
+ @param rerun Whether to rely on is_alive in a second run
*/
-static int has_live_call (entity *method, ir_graph *graph)
+static int rta_fill_incremental (void)
{
- /* maybe we're called (possibly through polymorphy)? */
- if (has_live_upcall (method)) {
- return (TRUE);
- }
+ int i;
+ int n_runs = 0;
+ int rerun = TRUE;
+ int old_ip_view = interprocedural_view;
- /* maybe our subclasses have seen a call? */
- if (has_live_downcall (method, graph)) {
- return (TRUE);
- }
+ interprocedural_view = 0; /* save this for later */
- return (FALSE);
-}
+ /* init_tables has added main_irg to _live_graphs */
-/* -------------------------------------------------------------------
- Class Instantiations
- ------------------------------------------------------------------- */
-static int has_live_superclass (entity *method, ir_graph *graph)
-{
- int has_super = FALSE;
- int i;
- int n_over;
+ /* Need to take care of graphs that are externally
+ visible or sticky. Pretend that they are called: */
- /* The method could be the target of a polymorphic call if it is
- called or if it overrides a method that is called. */
+ for (i = 0; i < get_irp_n_irgs(); i++) {
+ ir_graph *graph = get_irp_irg (i);
+ entity *ent = get_irg_entity (graph);
- if (eset_contains (_live_classes, get_entity_owner (method))) {
- return (TRUE);
+ if (((!whole_world) &&
+ (visibility_external_visible == get_entity_visibility (ent))) ||
+ (stickyness_sticky == get_entity_stickyness (ent))) {
+ eset_insert (_live_graphs, graph);
+ }
}
- /* 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);
- }
+ while (rerun) {
+ ir_graph *graph;
- return (has_super);
-}
+ /* start off new */
+ eset *live_graphs = _live_graphs;
+ _live_graphs = eset_create ();
-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);
+ if (verbose > 1) {
+ fprintf(stdout, "RTA: RUN %i\n", n_runs);
+ }
- /* 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);
- }
+ /* collect what we have found previously */
+ eset_insert_all (_live_graphs, live_graphs);
- /* otherwise, an instantiated class helps a lot! */
- if (rta_is_alive_class (get_entity_owner (method))) {
- return (TRUE);
- }
+ rerun = FALSE;
- /* 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);
- }
+ for (graph = eset_first (live_graphs);
+ graph;
+ graph = eset_next (live_graphs)) {
- return (has_sub);
-}
+ if (verbose > 1) {
+ fprintf(stdout, "RTA: RUN %i: considering graph of ", n_runs);
+ DDMEO(get_irg_ent (graph));
+ }
+ rerun |= rta_fill_graph (graph);
+ }
-/**
- 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);
- }
+ eset_destroy (live_graphs);
- /* maybe our subclasses have seen a call? */
- if (has_live_subclass (method, graph)) {
- return (TRUE);
+ n_runs ++;
}
- return (FALSE);
+ interprocedural_view = old_ip_view; /* cover up our traces */
+ return (n_runs);
}
/*
- 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.
+ Count the number of graphs that we have found to be live.
*/
static int stats (void)
{
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)));
+ 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 = tarval_to_entity (get_Const_tarval (f_addr));
+ entity *impl_ent = get_SymConst_entity (f_addr);
- assert ((get_irn_op(f_addr) == op_Const) && "can't do complex addrs");
+ 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);
static void remove_irg (ir_graph *graph)
{
entity *ent = get_irg_entity (graph);
+ peculiarity pec = get_entity_peculiarity (ent);
-/* DDMEO (get_irg_ent(graph)); */
+ /* DDMEO (get_irg_ent(graph)); */
/* delete the ir_graph data */
+ set_entity_peculiarity (ent, peculiarity_description);
remove_irp_irg (graph);
- /* remove reference to the graph */
- set_entity_irg (ent, NULL);
+ /* remove_irp_irg also removes the entities' reference to the graph */
+ /*
+ if (NULL != get_entity_irg (ent)) {
+ set_entity_irg (ent, NULL);
+ }
+ */
+ set_entity_peculiarity (ent, pec);
+
/* find the implementation (graph) from *some* superclass: */
graph = get_implementing_graph (ent);
}
}
+/**
+ Initialise the static data structures.
+*/
+static void init_tables (void)
+{
+ _live_classes = eset_create ();
+
+ _live_graphs = eset_create ();
+
+ if (get_irp_main_irg ()) {
+ eset_insert (_live_graphs, get_irp_main_irg ());
+ }
+
+ /* Adding the GlobalType is pointless, since its methods are always
+ called via a constant */
+ /*
+ if (get_glob_type ()) {
+ eset_insert (_live_classes, get_glob_type ());
+ }
+ */
+}
+
/* Initialise the RTA data structures, and perform RTA.
- @param do_verbose Iff != 0, print statistics as we go along
+ @param do_verbose If == 1, print statistics, if > 1, chatter about every detail
@param do_whole_world Iff != 0, assume whole-world
*/
void rta_init (int do_verbose, int do_whole_world)
{
- int n_live_graphs = get_irp_n_irgs ();
- int n_graphs = 0;
int n_runs = 0;
- whole_world = do_whole_world;
- verbose = do_verbose;
-
# ifdef DEBUG_libfirm
int i;
for (i = 0; i < get_irp_n_irgs(); i++) {
tr_vrfy ();
# endif /* defined DEBUG_libfirm */
+ whole_world = do_whole_world;
+ verbose = do_verbose;
+
init_tables ();
- if (verbose && whole_world) {
- printf ("RTA: whole-world assumption\n");
- }
+ n_runs = rta_fill_incremental ();
if (verbose) {
- 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 ();
+ int n_live_graphs = stats ();
- if (verbose) {
- printf ("RTA: run %i (%i graphs to go)\n", n_runs, n_live_graphs);
+ if (whole_world) {
+ printf ("RTA: whole-world assumption\n");
}
- }
-
- 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);
# endif /* defined DEBUG_libfirm */
}
-/* Delete all graphs that we have found to be dead from the program */
+/* 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_graphs = get_irp_n_irgs ();
ir_graph *graph = NULL;
+ int n_dead_graphs = 0;
+
+ if (!get_optimize() || !get_opt_dead_method_elimination()) return;
eset *dead_graphs = eset_create ();
for (i = 0; i < n_graphs; i++) {
graph = get_irp_irg(i);
- if (is_alive (graph, _live_graphs, _dead_graphs)) {
+ if (rta_is_alive_graph (graph)) {
/* do nothing (except some debugging fprintf`s :-) */
} else {
# ifdef DEBUG_libfirm
(visibility_external_visible != get_entity_visibility (ent)));
# endif /* defined DEBUG_libfirm */
+ n_dead_graphs ++;
eset_insert (dead_graphs, graph);
}
}
graph;
graph = (ir_graph*) eset_next (dead_graphs)) {
- if (verbose) {
+ if ((verbose > 1) || get_opt_dead_method_elimination_verbose ()) {
fprintf(stdout, "RTA: removing graph of ");
DDMEO(get_irg_ent (graph));
}
remove_irg (graph);
}
+
+ if (verbose) {
+ printf ("RTA: n_dead_graphs = %i\n", n_dead_graphs);
+ }
}
/* Clean up the RTA data structures. Call this after calling rta_init */
_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: */
/* Say whether this graph might be run at any time in the program: */
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 (FALSE);
}
/* dump our opinion */
/*
* $Log$
+ * 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)
*
projects / libfirm / blobdiff