X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Frta.c;h=1e5fda8c8ab7839d05d1bc18370b02a45876ff75;hb=ff0e8d7fcb34481652f0bf521ba04b1eca5e2106;hp=fc1673e20e326cbc7f1a8c3dfdcde284775dc78e;hpb=d89eda038e37b904cdc6b4ccec5232d3b3c5a325;p=libfirm diff --git a/ir/ana/rta.c b/ir/ana/rta.c index fc1673e20..1e5fda8c8 100644 --- a/ir/ana/rta.c +++ b/ir/ana/rta.c @@ -7,27 +7,14 @@ * Author: Florian * Modified by: * Created: 09.06.2002 - * CVS-ID: $$ + * CVS-ID: $Id$ * Copyright: (c) 1999-2004 Universität Karlsruhe * Licence: This file is protected by GPL - GNU GENERAL PUBLIC LICENSE. */ -/** - * 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 -# include +# include "config.h" #endif #include "rta.h" @@ -36,15 +23,19 @@ #include "irnode_t.h" #include "irprog_t.h" +#include "irgraph_t.h" #include "eset.h" #include "irgwalk.h" #include "irgmod.h" +#include "typewalk.h" #include "irvrfy.h" #include "trvrfy.h" -# define TRUE 1 -# define FALSE 0 +# ifndef TRUE +# define TRUE 1 +# define FALSE 0 +# endif /* not defined TRUE */ /* flags */ static int verbose = 0; @@ -78,7 +69,7 @@ static ir_graph *get_implementing_graph (entity *method) /* 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)))); + || 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 */ @@ -95,6 +86,13 @@ static ir_graph *get_implementing_graph (entity *method) #endif } +/** + * 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) { if (!eset_contains (_live_graphs, graph)) { @@ -110,7 +108,14 @@ static int add_graph (ir_graph *graph) return (FALSE); } -static int add_class (type *clazz) +/** + * 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) { if (!eset_contains (_live_classes, clazz)) { if (verbose > 1) { @@ -168,7 +173,6 @@ static int add_implementing_graphs (entity *method) static void rta_act (ir_node *node, void *env) { int *change = (int*) env; - opcode op = get_irn_opcode (node); if (iro_Call == op) { /* CALL */ @@ -181,34 +185,36 @@ static void rta_act (ir_node *node, void *env) ent = get_Sel_entity (ptr); *change |= add_implementing_graphs (ent); - /* CALL SYMCONST */ + /* 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. */ - } + 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 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"); + /* Entities of kind addr_name may not be allocated in this compilation unit. + If so, the frontend built faulty Firm. So just ignore. */ + /* if (get_SymConst_name(ptr) != new_id_from_str("iro_Catch")) + assert (ent && "couldn't determine entity of call to SymConst of kind addr_name."); */ } else { - /* other symconst. */ - assert(0 && "This SymConst can not be an address for a method call."); + /* other symconst. */ + assert(0 && "This SymConst can not be an address for a method call."); } - /* STRANGE */ + /* STRANGE */ } else { DDMN(ptr); assert(0 && "Unexpected address expression: can not analyse, therefore can not do correct rta!"); } } else if (iro_Alloc == op) { /* ALLOC */ - type *type = get_Alloc_type (node); + ir_type *type = get_Alloc_type (node); *change |= add_class (type); } @@ -221,26 +227,20 @@ static void rta_act (ir_node *node, void *env) static int rta_fill_graph (ir_graph* graph) { int change = FALSE; - - current_ir_graph = graph; - irg_walk_graph (graph, rta_act, NULL, &change); - - return (change); + return change; } /** 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; + int old_ip_view = get_interprocedural_view(); - interprocedural_view = 0; /* save this for later */ + set_interprocedural_view(0); /* save this for later */ /* init_tables has added main_irg to _live_graphs */ @@ -290,14 +290,14 @@ static int rta_fill_incremental (void) n_runs ++; } - interprocedural_view = old_ip_view; /* cover up our traces */ + set_interprocedural_view(old_ip_view); /* cover up our traces */ return (n_runs); } -/* - Count the number of graphs that we have found to be live. -*/ +/** + * Count the number of graphs that we have found to be live. + */ static int stats (void) { int i; @@ -353,38 +353,52 @@ static void force_description (entity *ent, entity *addr) } /** - Initialise the static data structures. + Initialize the static data structures. */ static void init_tables (void) { - int i, n_globs = get_class_n_members(get_glob_type()); + ir_type *tp; + int i, n; _live_classes = eset_create (); - - _live_graphs = eset_create (); + _live_graphs = eset_create (); if (get_irp_main_irg ()) { eset_insert (_live_graphs, get_irp_main_irg ()); } /* 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)) + 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); } } -/* Initialise the RTA data structures, and perform RTA. - @param do_verbose If == 1, print statistics, if > 1, chatter about every detail -*/ +/* + * Initialize 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 n_runs = 0; + int i, n, n_runs = 0; + + int rem_vpi = get_visit_pseudo_irgs(); + set_visit_pseudo_irgs(1); # ifdef DEBUG_libfirm - int i; - for (i = 0; i < get_irp_n_irgs(); i++) { + n = get_irp_n_irgs(); + for (i = 0; i < n; i++) { irg_vrfy (get_irp_irg(i)); } tr_vrfy (); @@ -405,26 +419,32 @@ void rta_init (int do_verbose) } # ifdef DEBUG_libfirm - for (i = 0; i < get_irp_n_irgs(); i++) { + for (i = 0; i < n; i++) { irg_vrfy (get_irp_irg(i)); } tr_vrfy (); # endif /* defined DEBUG_libfirm */ -} + set_visit_pseudo_irgs(rem_vpi); +} -void make_entity_to_description(type_or_ent *tore, void *env) { +/** + * 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) ) { + 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); - set_atomic_ent_value(ent, new_Const(mode_P, get_tarval_null(mode_P))); + set_entity_peculiarity(ent, peculiarity_description); + set_entity_irg(ent, NULL); } } } @@ -439,10 +459,14 @@ void rta_delete_dead_graphs (void) int n_graphs = get_irp_n_irgs (); ir_graph *graph = NULL; int n_dead_graphs = 0; + ir_graph **dead_graphs; + + int rem_vpi = get_visit_pseudo_irgs(); + set_visit_pseudo_irgs(1); if (!get_optimize() || !get_opt_dead_method_elimination()) return; - ir_graph *dead_graphs[get_irp_n_irgs()]; + dead_graphs = xmalloc(sizeof(*dead_graphs) * get_irp_n_irgs()); for (i = 0; i < n_graphs; i++) { graph = get_irp_irg(i); @@ -460,7 +484,6 @@ void rta_delete_dead_graphs (void) } } - current_ir_graph = get_const_code_irg(); type_walk(make_entity_to_description, NULL, NULL); for (i = 0; i < n_dead_graphs; ++i) { remove_irp_irg (dead_graphs[i]); @@ -469,6 +492,10 @@ void rta_delete_dead_graphs (void) if (verbose) { printf ("RTA: n_dead_graphs = %i\n", n_dead_graphs); } + + set_visit_pseudo_irgs(rem_vpi); + + free(dead_graphs); } /* Clean up the RTA data structures. Call this after calling rta_init */ @@ -494,7 +521,7 @@ void rta_cleanup (void) } /* 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)); } @@ -502,11 +529,7 @@ int rta_is_alive_class (type *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); - } - - return (FALSE); + return eset_contains (_live_graphs, graph); } /* dump our opinion */ @@ -515,8 +538,8 @@ 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)) { + ir_type *tp = get_irp_type(i); + if (is_Class_type(tp) && rta_is_alive_class(tp)) { fprintf(stdout, "RTA: considered allocated: "); DDMT(tp); } } @@ -532,6 +555,47 @@ void rta_report (void) /* * $Log$ + * Revision 1.36 2006/06/05 15:58:12 beck + * added support for Thread local storage + * added more doxygen docu + * + * Revision 1.35 2006/01/13 21:51:59 beck + * renamed all types 'type' to 'ir_type' + * + * Revision 1.34 2006/01/02 15:01:16 beck + * missing include added + * + * Revision 1.33 2005/11/17 17:26:57 beck + * removed bool type and depency from stdbool.h (not C89) + * + * Revision 1.32 2005/01/05 14:24:52 beck + * renames all is_x*_type() functions to is_X*_type() to prevent name clash with EDG frontend + * + * Revision 1.31 2004/12/21 13:45:14 beck + * removed C99 constructs + * + * Revision 1.30 2004/12/02 16:16:11 beck + * fixed config.h include + * used xmalloc instead of malloc + * + * Revision 1.29 2004/11/11 13:28:08 goetz + * made pseudo irg aware + * + * Revision 1.28 2004/11/03 14:47:18 beck + * removed gloval intraprocedural_view variable and replaced by get_*() set_*() functions + * + * Revision 1.27 2004/10/21 07:23:34 goetz + * comments + * + * Revision 1.26 2004/10/20 14:59:27 liekweg + * Removed ecg + * + * 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 *