X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Fcgana.c;h=0bab083c6e2c22599cdf44edee985d104a074400;hb=6d3cc33efb41b34b6d392c489921855f32c9baf5;hp=8feffccc9d8cdad2aafe60e58f690456a91fbe8e;hpb=60422e4e3eb0e6ea11021f4026dbb4a38bc180e8;p=libfirm diff --git a/ir/ana/cgana.c b/ir/ana/cgana.c index 8feffccc9..0bab083c6 100644 --- a/ir/ana/cgana.c +++ b/ir/ana/cgana.c @@ -1,15 +1,28 @@ -/* ------------------------------------------------------------------- - * $Id$ - * ------------------------------------------------------------------- - * Intraprozedurale Analyse zur Abschätzung der Aufrulrelation. Es +/* + * 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 Aufrufrelation. Es * wird eine Menge von freien Methoden und anschließend die an den * Call-Operationen aufrufbaren Methoden bestimmt. * - * Erstellt: Hubert Schmid, 09.06.2002 - * ---------------------------------------------------------------- */ + */ +#ifdef HAVE_CONFIG_H +# include +#endif -#include "stdlib.h" +#include #include "cgana.h" +#include "rta.h" #include "eset.h" @@ -19,11 +32,13 @@ #include "irgwalk.h" #include "ircons.h" #include "irgmod.h" -#include "xprintf.h" -#include "irnode.h" +#include "irnode_t.h" +#include "irflag_t.h" #include "dbginfo_t.h" +#include "irdump.h" + /* Eindeutige Adresse zur Markierung von besuchten Knoten und zur * Darstellung der unbekannten Methode. */ static void * MARK = &MARK; @@ -36,17 +51,17 @@ static void * MARK = &MARK; static eset * entities = NULL; -/* Bestimmt die eindeutige Methode, die die Methode für den - * übergebenene (dynamischen) Typ überschreibt. */ +/** Bestimmt die eindeutige Methode, die die Methode für den + * übergebenen (dynamischen) Typ überschreibt. */ static entity * get_implementation(type * class, entity * method) { int i; - if (get_entity_peculiarity(method) != description && + if (get_entity_peculiarity(method) != peculiarity_description && get_entity_owner(method) == class) { return method; } for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i) { entity * e = get_entity_overwrittenby(method, i); - if (get_entity_peculiarity(e) != description && get_entity_owner(e) == class) { + if (get_entity_peculiarity(e) != peculiarity_description && get_entity_owner(e) == class) { return e; } } @@ -56,57 +71,74 @@ static entity * get_implementation(type * class, entity * method) { return e; } } - assert(0 && "implemenation not found"); + assert(0 && "implementation not found"); + return NULL; } -/* Returns the entity that contains the implementation of the inherited - entity if available, else returns the entity passed. */ -entity *get_inherited_methods_implementation(entity *inh_meth) { +/** Returns the entity that contains the implementation of the inherited + entity if available, else returns the entity passed. */ +static entity *get_inherited_methods_implementation(entity *inh_meth) { entity *impl_meth = NULL; ir_node *addr = get_atomic_ent_value(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 -- address of method should be straight constant!"); + } + if (impl_meth && (get_entity_peculiarity(impl_meth) != peculiarity_existent)) { + /* + printf("this_meth: "); DDMEO(inh_meth); + printf("impl meth: "); DDMEO(impl_meth); + assert(!impl_meth || get_entity_peculiarity(impl_meth) == peculiarity_existent); + */ + impl_meth = NULL; } - - assert(!impl_meth || get_entity_peculiarity(impl_meth) == existent); return impl_meth? impl_meth : inh_meth; } -/* 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) { +/** 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. + * + * @param method + * @param set A set of entities. + * @param size Number of entities in set. + * @param open + */ +static void collect_impls(entity *method, eset *set, int *size, bool *open) { int i; - if (get_entity_peculiarity(method) == existent) { - if (get_entity_visibility(method) == external_allocated) { + + if (get_entity_peculiarity(method) == peculiarity_existent) { + if (get_entity_visibility(method) == visibility_external_allocated) { assert(get_entity_irg(method) == NULL); *open = true; } else { assert(get_entity_irg(method) != NULL); if (!eset_contains(set, method)) { - eset_insert(set, method); - ++(*size); + eset_insert(set, method); + ++(*size); } } } - if (get_entity_peculiarity(method) == inherited) { + + if (get_entity_peculiarity(method) == peculiarity_inherited) { entity *impl_ent = get_inherited_methods_implementation(method); assert(impl_ent && "no implementation for inherited entity"); - if (get_entity_visibility(impl_ent) == external_allocated) { + if (get_entity_visibility(impl_ent) == visibility_external_allocated) { assert(get_entity_irg(impl_ent) == NULL); *open = true; } else { assert(get_entity_irg(impl_ent) != NULL); if (!eset_contains(set, impl_ent)) { - eset_insert(set, impl_ent); - ++(*size); + eset_insert(set, impl_ent); + ++(*size); } } } @@ -116,24 +148,26 @@ void collect_impls(entity *method, eset *set, int *size, bool *open) { } -/* Alle Methoden bestimmen, die die übergebene Methode überschreiben - * (und implementieren). In der zurückgegebenen Reihung kommt jede - * Methode nur einmal vor. Der Wert 'NULL' steht für unbekannte - * (externe) Methoden. Die zurückgegebene Reihung muß vom Aufrufer - * wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es überhaupt - * keine Methoden, die die "method" überschreiben, so gibt die Methode - * "NULL" zurück. */ +/** Alle Methoden bestimmen, die die übergebene Methode überschreiben + * (und implementieren). In der zurückgegebenen Reihung kommt jede + * Methode nur einmal vor. Der Wert 'NULL' steht für unbekannte + * (externe) Methoden. Die zurückgegebene Reihung muß vom Aufrufer + * wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es überhaupt + * keine Methoden, die "method" überschreiben, so gibt die Methode + * "NULL" zurück. + * + * @param method + */ static entity ** get_impl_methods(entity * method) { eset * set = eset_create(); int size = 0; entity ** arr; bool open = false; - /** Collect all method entities that can be called here **/ + /* Collect all method entities that can be called here */ collect_impls(method, set, &size, &open); -/** - Vorgaenger einfuegen. **/ + /* Vorgaenger einfuegen. */ if (size == 0 && !open) { /* keine implementierte überschriebene Methode */ arr = NULL; @@ -157,114 +191,146 @@ 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); \ +#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) +#define DBG_OPT_POLY \ + __dbg_info_merge_pair(new_node, node, dbg_rem_poly_call) + +/** Analyse address computations. + * + * - If the node is a SymConst replace it by Const(ent) if possible. + * - If the node is a Sel: + * * If the pointer to the Sel comes directly from an Alloc node + * replace the Sel by a Const(ent). + * + * + * @param node The node to analyze + * @param ldname_map A map that mapps names of entities to the entities. + */ 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 * ersetzen. */ if (get_SymConst_kind(node) == linkage_ptr_info) { - pmap_entry * entry = pmap_find(ldname_map, (void *) get_SymConst_ptrinfo(node)); + 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 */ - ir_node *new_node; - assert(get_entity_irg(ent)); - set_irg_current_block(current_ir_graph, get_nodes_Block(node)); - new_node = new_d_Const(get_irn_dbg_info(node), - mode_P, tarval_P_from_entity(ent)); DBG_OPT_NORMALIZE; - exchange(node, new_node); - } + entity *ent = entry->value; + if (get_opt_normalize() && (get_entity_visibility(ent) != visibility_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)); + 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)))) { + 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_opt_optimize() && get_opt_dyn_meth_dispatch() && + (get_irn_op(skip_Proj(get_Sel_ptr(node))) == op_Alloc)) { ir_node *new_node; + entity *called_ent; /* We know which method will be called, no dispatch necessary. */ - assert(get_entity_peculiarity(ent) != description); +#if 0 + assert(get_entity_peculiarity(ent) != peculiarity_description); set_irg_current_block(current_ir_graph, get_nodes_Block(node)); + /* @@@ Is this correct?? Alloc could reference a subtype of the owner + of Sel that overwrites the method referenced in Sel. */ + /* @@@ Yes, this is wrong. GL, 10.3.04 */ new_node = copy_const_value(get_atomic_ent_value(ent)); DBG_OPT_POLY_ALLOC; +#else + called_ent = resolve_ent_polymorphy(get_Alloc_type(skip_Proj(get_Sel_ptr(node))), ent); + set_irg_current_block(current_ir_graph, get_nodes_Block(node)); + /* called_ent may not be description: has no Address/Const to Call! */ + assert(get_entity_peculiarity(called_ent) != peculiarity_description); + new_node = copy_const_value(get_atomic_ent_value(called_ent)); DBG_OPT_POLY_ALLOC; +#endif exchange (node, new_node); } else { - assert(get_entity_peculiarity(ent) != inherited); + assert(get_entity_peculiarity(ent) != peculiarity_inherited); if (!eset_contains(entities, ent)) { - /* Entity noch nicht behandelt. Alle (intern oder extern) - * implementierten Methoden suchen, die diese Entity - * überschreiben. Die Menge an entity.link speichern. */ - set_entity_link(ent, get_impl_methods(ent)); - eset_insert(entities, ent); + /* Entity noch nicht behandelt. Alle (intern oder extern) + * implementierten Methoden suchen, die diese Entity + * überschreiben. Die Menge an entity.link speichern. */ + set_entity_link(ent, get_impl_methods(ent)); + eset_insert(entities, ent); } if (get_entity_link(ent) == NULL) { - /* Die Sel-Operation kann nie einen Zeiger auf eine aufrufbare - * Methode zurückgeben. Damit ist sie insbesondere nicht - * ausführbar und nicht erreichbar. */ - /* Gib eine Warnung aus wenn die Entitaet eine Beschreibung ist - 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))); - } else { - exchange(node, new_Bad()); - } + /* Die Sel-Operation kann nie einen Zeiger auf eine aufrufbare + * Methode zurückgeben. Damit ist sie insbesondere nicht + * ausführbar und nicht erreichbar. */ + /* Gib eine Warnung aus wenn die Entitaet eine Beschreibung ist + fuer die es keine Implementierung gibt. */ + if (get_entity_peculiarity(ent) == peculiarity_description) { + /* @@@ GL Methode um Fehler anzuzeigen aufrufen! */ + printf("WARNING: Calling method description %s\n in method %s\n of class %s\n which has " + "no implementation!\n", get_entity_name(ent), + get_entity_name(get_irg_ent(current_ir_graph)), + get_type_name(get_entity_owner(get_irg_ent(current_ir_graph)))); + printf("This happens when compiling a Java Interface that's never really used, i.e., " + "no class implementing the interface is ever used.\n"); + } else { + exchange(node, new_Bad()); + } } else { - entity ** arr = get_entity_link(ent); + entity ** arr = get_entity_link(ent); #if 0 - int i; - printf("\nCall site "); DDMN(node); - printf(" in "); DDME(get_irg_ent(current_ir_graph)); - printf(" can call:\n"); - for (i = 0; i < ARR_LEN(arr); i++) { - printf(" - "); DDME(arr[i]); - printf(" with owner "); DDMT(get_entity_owner(arr[i])); - } - printf("\n"); + int i; + printf("\nCall site "); DDMN(node); + printf(" in "); DDME(get_irg_ent(current_ir_graph)); + printf(" can call:\n"); + for (i = 0; i < ARR_LEN(arr); i++) { + printf(" - "); DDME(arr[i]); + printf(" with owner "); DDMT(get_entity_owner(arr[i])); + } + printf("\n"); #endif - if (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)); - new_node = copy_const_value(get_atomic_ent_value(arr[0])); DBG_OPT_POLY; - exchange (node, new_node); - } + if (get_opt_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)); + /* assert(get_entity_peculiarity(tarval_to_entity(get_Const_tarval(get_atomic_ent_value(arr[0])))) == peculiarity_existent); */ + new_node = copy_const_value(get_atomic_ent_value(arr[0])); DBG_OPT_POLY; + exchange (node, new_node); + } } } } } -/* Datenstruktur initialisieren. Zusätzlich werden alle - * SymConst-Operationen, die auf interne Methoden verweisen, durch - * Const-Operationen ersetzt. */ +/** Datenstruktur initialisieren. Zusätzlich werden alle + * SymConst-Operationen, die auf interne Methoden verweisen, durch + * Const-Operationen ersetzt. */ static void sel_methods_init(void) { int i; - pmap * ldname_map = pmap_create(); + pmap * ldname_map = pmap_create(); /* Map entitiy names to entities: to replace SymConst by Const(ent). */ 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 Methode können überhaupt mit SymConst * aufgerufen werden. */ - if (get_entity_visibility(ent) != local) { + if (get_entity_visibility(ent) != visibility_local) { pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent); } } @@ -349,9 +415,9 @@ static void callee_ana_proj(ir_node * node, long n, eset * methods) { ir_node * pred = get_Proj_pred(node); if (get_irn_link(pred) != MARK) { if (get_irn_op(pred) == op_Tuple) { - callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods); + callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods); } else { - eset_insert(methods, MARK); /* free method -> unknown */ + eset_insert(methods, MARK); /* free method -> unknown */ } } break; @@ -377,7 +443,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 */ @@ -393,10 +459,13 @@ 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)); + if (get_entity_visibility(ent) != visibility_external_allocated) { + if (!get_entity_irg(ent)) { + dump_entity(ent); + assert(get_entity_irg(ent)); + } eset_insert(methods, ent); } else { eset_insert(methods, MARK); /* free method -> unknown */ @@ -409,9 +478,9 @@ static void callee_ana_node(ir_node * node, eset * methods) { for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) { entity * ent = get_Sel_method(node, i); if (ent) { - eset_insert(methods, ent); + eset_insert(methods, ent); } else { - eset_insert(methods, MARK); + eset_insert(methods, MARK); } } break; @@ -461,7 +530,7 @@ static void callee_walker(ir_node * call, void * env) { } for (ent = eset_first(methods); ent; ent = eset_next(methods)) { if (ent != MARK) { - ARR_APP1(entity *, arr, ent); + ARR_APP1(entity *, arr, ent); } } if (ARR_LEN(arr) == 0) { @@ -470,7 +539,16 @@ static void callee_walker(ir_node * call, void * env) { * konnte. Wir ersetzen die Call-Operation ebenfalls durch * eine Bad-Operation. Die Verlinkung muss wiederhergestellt * werden! */ - exchange(call, new_Bad()); + /* exchange(call, new_Bad()); invalid firm */ + + ir_node *mem = get_Call_mem(call); + turn_into_tuple (call, 5 /* pn_Call_max */); + set_Tuple_pred(call, pn_Call_M_regular , mem); + set_Tuple_pred(call, pn_Call_T_result , new_Bad()); + set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad()); + set_Tuple_pred(call, pn_Call_X_except , new_Bad()); /* new_Jmp() ?? new_Raise() ?? */ + set_Tuple_pred(call, pn_Call_M_except , mem); + } else { set_Call_callee_arr(call, ARR_LEN(arr), arr); } @@ -489,6 +567,7 @@ static void callee_ana(void) { /* Alle Graphen analysieren. */ for (i = get_irp_n_irgs() - 1; i >= 0; --i) { irg_walk_graph(get_irp_irg(i), callee_walker, NULL, NULL); + set_irg_callee_info_state(get_irp_irg(i), irg_callee_info_consistent); } } @@ -545,7 +624,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 */ } @@ -555,7 +634,7 @@ static void free_mark(ir_node * node, eset * set) { entity * ent = get_Sel_entity(node); if (is_method_type(get_entity_type(ent))) { for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) { - eset_insert(set, get_Sel_method(node, i)); + eset_insert(set, get_Sel_method(node, i)); } } break; @@ -565,9 +644,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; } @@ -613,8 +694,8 @@ 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) { - free_mark(pred, set); + if (mode_is_reference(get_irn_mode(pred))) { + free_mark(pred, set); } } break; @@ -624,8 +705,8 @@ 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) { - free_mark(pred, set); + if (mode_is_reference(get_irn_mode(pred))) { + free_mark(pred, set); } } break; @@ -644,20 +725,24 @@ static entity ** get_free_methods(void) { int i; entity ** arr = NEW_ARR_F(entity *, 0); entity * ent; + for (i = get_irp_n_irgs() - 1; i >= 0; --i) { ir_graph * irg = get_irp_irg(i); entity * ent = get_irg_ent(irg); /* insert "external visible" methods. */ - if (get_entity_visibility(ent) != local) { + if (get_entity_visibility(ent) != visibility_local) { eset_insert(set, ent); } + /* Finde alle Methoden die in dieser Methode extern sichtbar werden, + z.B. da die Adresse einer Methode abgespeichert wird. */ irg_walk_graph(irg, NULL, (irg_walk_func *) free_ana_walker, set); } - /* Hauptprogramm ist auch frei, auch wenn es nicht "external + /* Hauptprogramm ist auch dann frei, wenn es nicht "external * visible" ist. */ - if(get_irp_main_irg()) { + if (get_irp_main_irg()) { eset_insert(set, get_irg_ent(get_irp_main_irg())); } + /* Wandle Menge in Feld um. Effizienter. */ for (ent = eset_first(set); ent; ent = eset_next(set)) { ARR_APP1(entity *, arr, ent); } @@ -683,13 +768,34 @@ void cgana(int *length, entity ***free_methods) { DEL_ARR_F(free_meths); } + + +static void destruct_walker(ir_node * node, void * env) { + if (get_irn_op(node) == op_Call) { + remove_Call_callee_arr(node); + } +} + +void free_callee_info(ir_graph *irg) { + irg_walk_graph(irg, destruct_walker, NULL, NULL); + set_irg_callee_info_state(irg, irg_callee_info_none); +} + + /* 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. */ + * + * This optimization performs the following transformations for + * all ir graphs: + * - All SymConst operations that refer to intern methods are replaced + * by Const operations refering to the corresponding entity. + * - Sel nodes, that select entities that are not overwritten are + * replaced by Const nodes refering to the selected entity. + * - Sel nodes, for witch no method exists at all are replaced by Bad + * nodes. + * - Sel nodes with a pointer input that is an Alloc node are replaced + * by Const nodes refering to the entity that implements the method in + * the type given by the Alloc node. + */ void opt_call_addrs(void) { sel_methods_init(); sel_methods_dispose();