X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Fcgana.c;h=5baf5c1365cb3bb336b661befe64c6bfbb2c7239;hb=a973f767f5995ec8ac72d662fb982dfb8594bf5c;hp=34fc09563ffe529f53fb46f07e0b1257d5995254;hpb=67e3ef5e7088c2254daeb2a72e0950bef6ca0256;p=libfirm diff --git a/ir/ana/cgana.c b/ir/ana/cgana.c index 34fc09563..5baf5c136 100644 --- a/ir/ana/cgana.c +++ b/ir/ana/cgana.c @@ -1,14 +1,23 @@ -/* ------------------------------------------------------------------- - * $Id$ - * ------------------------------------------------------------------- +/* + * Project: libFIRM + * File name: ir/ana/cgana.c + * Purpose: Intraprozedural analyses to estimate the call graph. + * Author: Hubert Schmid + * Modified by: + * Created: 09.06.2002 + * CVS-ID: $Id$ + * Copyright: (c) 1999-2003 Universität Karlsruhe + * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE. + */ + +/** * Intraprozedurale Analyse zur Abschätzung der Aufrulrelation. Es * wird eine Menge von freien Methoden und anschließend die an den * Call-Operationen aufrufbaren Methoden bestimmt. * - * Erstellt: Hubert Schmid, 09.06.2002 - * ---------------------------------------------------------------- */ + */ -#include "stdlib.h" +#include #include "cgana.h" @@ -19,8 +28,10 @@ #include "irgwalk.h" #include "ircons.h" #include "irgmod.h" -#include "xprintf.h" +#include "irnode.h" +#include "irflag.h" +#include "dbginfo_t.h" /* Eindeutige Adresse zur Markierung von besuchten Knoten und zur * Darstellung der unbekannten Methode. */ @@ -48,13 +59,14 @@ static entity * get_implementation(type * class, entity * method) { return e; } } - for (i = get_class_n_supertype(class) - 1; i >= 0; --i) { + for (i = get_class_n_supertypes(class) - 1; i >= 0; --i) { entity * e = get_implementation(get_class_supertype(class, i), method); if (e) { return e; } } assert(0 && "implemenation not found"); + return NULL; } /* Returns the entity that contains the implementation of the inherited @@ -65,15 +77,25 @@ entity *get_inherited_methods_implementation(entity *inh_meth) { assert(addr && "constant entity without value"); if (get_irn_op(addr) == op_Const) { - impl_meth = get_tv_entity(get_Const_tarval(addr)); + impl_meth = tarval_to_entity(get_Const_tarval(addr)); + } else { + assert(0 && "Complex constant values not supported -- adress of method should be straight constant!"); + } + if (impl_meth && (get_entity_peculiarity(impl_meth) != existent)) { + printf("this_meth: "); DDMEO(inh_meth); + printf("impl meth: "); DDMEO(impl_meth); + assert(!impl_meth || get_entity_peculiarity(impl_meth) == existent); } - - assert(!impl_meth || get_entity_peculiarity(impl_meth) == existent); return impl_meth? impl_meth : inh_meth; } -/* A recursive descend in the overwritten relation. +/* Collect the entity representing the implementation of this + entity (not the same if inherited) and all entities for overwriting + implementations in "set". + If the implementation of the method is not included in the + compilation unit "open" is set to true. + A recursive descend in the overwritten relation. Cycle-free, therefore must terminate. */ void collect_impls(entity *method, eset *set, int *size, bool *open) { int i; @@ -86,8 +108,6 @@ void collect_impls(entity *method, eset *set, int *size, bool *open) { if (!eset_contains(set, method)) { eset_insert(set, method); ++(*size); - //printf("Adding existent method %d ", *size); DDME(method); - //printf(" with owner "); DDMT(get_entity_owner(method)); } } } @@ -102,14 +122,12 @@ void collect_impls(entity *method, eset *set, int *size, bool *open) { if (!eset_contains(set, impl_ent)) { eset_insert(set, impl_ent); ++(*size); - // printf("Adding inherited method %d ", *size); DDME(impl_ent); - //printf(" with owner "); DDMT(get_entity_owner(impl_ent)); } } } /** recursive descend **/ for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i) - collect_impls(get_entity_overwrittenby(method, i) ,set, size, open); + collect_impls(get_entity_overwrittenby(method, i), set, size, open); } @@ -129,10 +147,7 @@ static entity ** get_impl_methods(entity * method) { /** Collect all method entities that can be called here **/ collect_impls(method, set, &size, &open); - - //printf("Size is %d \n\n", size); - - /** Gefunden Entitaeten in ein Feld kopieren, ev. Unbekannten +/** Vorgaenger einfuegen. **/ if (size == 0 && !open) { /* keine implementierte überschriebene Methode */ @@ -154,6 +169,22 @@ static entity ** get_impl_methods(entity * method) { } +/* debug makros used in sel_methods_walker */ +#define SIZ(x) sizeof(x)/sizeof((x)[0]) + +#define DBG_OPT_NORMALIZE \ + __dbg_info_merge_pair(new_node, node, dbg_const_eval) +#define DBG_OPT_POLY_ALLOC \ + do { \ + ir_node *ons[2]; \ + ons[0] = node; \ + ons[1] = skip_Proj(get_Sel_ptr(node)); \ + __dbg_info_merge_sets(&new_node, 1, ons, SIZ(ons), dbg_rem_poly_call); \ + } while(0) +#define DBG_OPT_POLY \ + __dbg_info_merge_pair(new_node, node, dbg_rem_poly_call) + + static void sel_methods_walker(ir_node * node, pmap * ldname_map) { if (get_irn_op(node) == op_SymConst) { /* Wenn möglich SymConst-Operation durch Const-Operation @@ -162,22 +193,29 @@ static void sel_methods_walker(ir_node * node, pmap * ldname_map) { pmap_entry * entry = pmap_find(ldname_map, (void *) get_SymConst_ptrinfo(node)); if (entry != NULL) { /* Method is declared in the compiled code */ entity * ent = entry->value; - if (get_entity_visibility(ent) != external_allocated) { /* Meth. is defined */ + if (get_opt_normalize() && (get_entity_visibility(ent) != external_allocated)) { /* Meth. is defined */ + ir_node *new_node; assert(get_entity_irg(ent)); set_irg_current_block(current_ir_graph, get_nodes_Block(node)); - exchange(node, new_d_Const(get_irn_dbg_info(node), - mode_p, tarval_p_from_entity(ent))); + new_node = new_d_Const(get_irn_dbg_info(node), + mode_P_mach, new_tarval_from_entity(ent, mode_P_mach)); DBG_OPT_NORMALIZE; + exchange(node, new_node); } } } } else if (get_irn_op(node) == op_Sel && is_method_type(get_entity_type(get_Sel_entity(node)))) { entity * ent = get_Sel_entity(node); - if (get_irn_op(skip_Proj(get_Sel_ptr(node))) == op_Alloc) { + if (get_optimize() && get_opt_dyn_meth_dispatch() && + (get_irn_op(skip_Proj(get_Sel_ptr(node))) == op_Alloc)) { + ir_node *new_node; /* We know which method will be called, no dispatch necessary. */ assert(get_entity_peculiarity(ent) != description); set_irg_current_block(current_ir_graph, get_nodes_Block(node)); - exchange (node, copy_const_value(get_atomic_ent_value(ent))); + /* @@@ Is this correct?? Alloc could reference a subtype of the owner + of Sel that overwrites the method referenced in Sel. */ + new_node = copy_const_value(get_atomic_ent_value(ent)); DBG_OPT_POLY_ALLOC; + exchange (node, new_node); } else { assert(get_entity_peculiarity(ent) != inherited); if (!eset_contains(entities, ent)) { @@ -195,9 +233,9 @@ static void sel_methods_walker(ir_node * node, pmap * ldname_map) { fuer die es keine Implementierung gibt. */ if (get_entity_peculiarity(ent) == description) { /* @@@ GL Methode um Fehler anzuzeigen aufrufen! */ - xprintf("WARNING: Calling method description %I in method %I which has " - "no implementation!\n", get_entity_ident(ent), - get_entity_ident(get_irg_ent(current_ir_graph))); + printf("WARNING: Calling method description %s in method %s which has " + "no implementation!\n", get_entity_name(ent), + get_entity_name(get_irg_ent(current_ir_graph))); } else { exchange(node, new_Bad()); } @@ -216,13 +254,16 @@ static void sel_methods_walker(ir_node * node, pmap * ldname_map) { printf("\n"); #endif - if (ARR_LEN(arr) == 1 && arr[0] != NULL) { + if (get_optimize() && get_opt_dyn_meth_dispatch() && + (ARR_LEN(arr) == 1 && arr[0] != NULL)) { + ir_node *new_node; /* Die Sel-Operation kann immer nur einen Wert auf eine * interne Methode zurückgeben. Wir können daher die * Sel-Operation durch eine Const- bzw. SymConst-Operation * ersetzen. */ set_irg_current_block(current_ir_graph, get_nodes_Block(node)); - exchange (node, copy_const_value(get_atomic_ent_value(arr[0]))); + new_node = copy_const_value(get_atomic_ent_value(arr[0])); DBG_OPT_POLY; + exchange (node, new_node); } } } @@ -246,7 +287,7 @@ static void sel_methods_init(void) { pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent); } } - all_irg_walk((irg_walk_func) sel_methods_walker, NULL, ldname_map); + all_irg_walk((irg_walk_func *) sel_methods_walker, NULL, ldname_map); pmap_destroy(ldname_map); } @@ -355,7 +396,7 @@ static void callee_ana_proj(ir_node * node, long n, eset * methods) { static void callee_ana_node(ir_node * node, eset * methods) { int i; - assert((get_irn_mode(node) == mode_p) || is_Bad(node)); + assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node)); /* rekursion verhindern */ if (get_irn_link(node) == MARK) { /* already visited */ @@ -371,7 +412,7 @@ static void callee_ana_node(ir_node * node, eset * methods) { case iro_Const: { /* interne Methode */ - entity * ent = get_Const_tarval(node)->u.p.ent; + entity * ent = tarval_to_entity(get_Const_tarval(node)); assert(ent && is_method_type(get_entity_type(ent))); if (get_entity_visibility(ent) != external_allocated) { assert(get_entity_irg(ent)); @@ -523,7 +564,7 @@ static void free_mark_proj(ir_node * node, long n, eset * set) { static void free_mark(ir_node * node, eset * set) { int i; - assert(get_irn_mode(node) == mode_p); + assert(mode_is_reference(get_irn_mode(node))); if (get_irn_link(node) == MARK) { return; /* already visited */ } @@ -543,9 +584,11 @@ static void free_mark(ir_node * node, eset * set) { break; case iro_Const: { tarval * val = get_Const_tarval(node); - entity * ent = val->u.p.ent; - if (ent != NULL && is_method_type(get_entity_type(ent))) { - eset_insert(set, ent); + if (tarval_is_entity(val)) { /* filter null pointer */ + entity * ent = tarval_to_entity(val); + if (is_method_type(get_entity_type(ent))) { + eset_insert(set, ent); + } } break; } @@ -591,7 +634,7 @@ static void free_ana_walker(ir_node * node, eset * set) { set_irn_link(node, MARK); for (i = get_Call_arity(node) - 1; i >= 0; --i) { ir_node * pred = get_Call_param(node, i); - if (get_irn_mode(pred) == mode_p) { + if (mode_is_reference(get_irn_mode(pred))) { free_mark(pred, set); } } @@ -602,7 +645,7 @@ static void free_ana_walker(ir_node * node, eset * set) { set_irn_link(node, MARK); for (i = get_irn_arity(node) - 1; i >= 0; --i) { ir_node * pred = get_irn_n(node, i); - if (get_irn_mode(pred) == mode_p) { + if (mode_is_reference(get_irn_mode(pred))) { free_mark(pred, set); } } @@ -629,11 +672,13 @@ static entity ** get_free_methods(void) { if (get_entity_visibility(ent) != local) { eset_insert(set, ent); } - irg_walk_graph(irg, NULL, (irg_walk_func) free_ana_walker, set); + irg_walk_graph(irg, NULL, (irg_walk_func *) free_ana_walker, set); } /* Hauptprogramm ist auch frei, auch wenn es nicht "external * visible" ist. */ - eset_insert(set, get_irg_ent(get_irp_main_irg())); + if(get_irp_main_irg()) { + eset_insert(set, get_irg_ent(get_irp_main_irg())); + } for (ent = eset_first(set); ent; ent = eset_next(set)) { ARR_APP1(entity *, arr, ent); } @@ -658,3 +703,31 @@ void cgana(int *length, entity ***free_methods) { for (i = 0; i < (*length); i++) (*free_methods)[i] = free_meths[i]; DEL_ARR_F(free_meths); } + +/* Optimize the address expressions passed to call nodes. + * Alle SymConst-Operationen, die auf interne Methoden verweisen, + * werden durch Const-Operationen ersetzt. + * Sel Knoten deren entitaeten nicht ueberschrieben werden, werden + * durch Const ersetzt. + * Sel Knoten, fuer die keine Implementierung existiert, werden + * durch Bad ersetzt. */ +void opt_call_addrs(void) { + sel_methods_init(); + sel_methods_dispose(); +#if 0 + int i; + pmap * ldname_map = pmap_create(); + assert(entities == NULL); + entities = eset_create(); + for (i = get_irp_n_irgs() - 1; i >= 0; --i) { + entity * ent = get_irg_ent(get_irp_irg(i)); + /* Nur extern sichtbare Methoden können überhaupt mit SymConst + * aufgerufen werden. */ + if (get_entity_visibility(ent) != local) { + pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent); + } + } + all_irg_walk((irg_walk_func *) sel_methods_walker, NULL, ldname_map); + pmap_destroy(ldname_map); +#endif +}