X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Fcgana.c;h=65dbaf13b132199280276d2951383404d55ad552;hb=24404dae722e4648ab1b53740b8a891c0c1da01a;hp=baa7059708e196764f144bc5d4b155081e5d611f;hpb=29cdaadd2ec709a2e9bcd7b6e5be46acfffe8426;p=libfirm diff --git a/ir/ana/cgana.c b/ir/ana/cgana.c index baa705970..65dbaf13b 100644 --- a/ir/ana/cgana.c +++ b/ir/ana/cgana.c @@ -1,132 +1,139 @@ -/* ------------------------------------------------------------------- - * $Id$ - * ------------------------------------------------------------------- - * 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. +/* + * 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. + */ + +/** @file cgana.c * - * Erstellt: Hubert Schmid, 09.06.2002 - * ---------------------------------------------------------------- */ + * Interprocedural analysis to estimate the calling relation. + * + * This analysis computes all entities representing methods that + * can be called at a Call node. Further it computes a set of + * methods that are 'free', i.e., their adress is handled by + * the program directly, or they are visible external. + */ + +#ifdef HAVE_CONFIG_H +# include "config.h" +#endif + +#ifdef HAVE_STRING_H +# include +#endif -#include "stdlib.h" #include "cgana.h" +#include "rta.h" +#include "xmalloc.h" +#include "irnode_t.h" +#include "irmode_t.h" +#include "irprog_t.h" +#include "irgwalk.h" +#include "ircons.h" +#include "irgmod.h" +#include "iropt.h" + +#include "irflag_t.h" +#include "dbginfo_t.h" +#include "iropt_dbg.h" #include "eset.h" #include "pmap.h" #include "array.h" -#include "irprog.h" -#include "irgwalk.h" -#include "ircons.h" -#include "irgmod.h" -#include "xprintf.h" + +#include "irdump.h" + +#include "irhooks.h" + /* Eindeutige Adresse zur Markierung von besuchten Knoten und zur * Darstellung der unbekannten Methode. */ -static void * MARK = &MARK; +static void *MARK = &MARK; +static eset *entities = NULL; +/*--------------------------------------------------------------------------*/ +/* The analysis */ +/*--------------------------------------------------------------------------*/ -/* --- sel methods ---------------------------------------------------------- */ +/*--------------------------------------------------------------------------*/ +/* Initialize datastructures, remove unwanted constructs, optimize */ +/* call target computations. */ +/*--------------------------------------------------------------------------*/ -static eset * entities = NULL; +/** 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) { + assert(get_atomic_ent_value(inh_meth) && "constant entity without value"); + assert((get_irn_op(get_atomic_ent_value(inh_meth)) == op_SymConst) && + (get_SymConst_kind(get_atomic_ent_value(inh_meth)) == symconst_addr_ent) && + "Complex constant values not supported -- address of method should be straight constant!"); + return get_SymConst_entity(get_atomic_ent_value(inh_meth)); +} -/* Bestimmt die eindeutige Methode, die die Methode für den - * übergebenene (dynamischen) Typ überschreibt. */ -static entity * get_implementation(type * class, entity * method) { +/** 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) != 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) { - return e; - } - } - for (i = get_class_n_supertype(class) - 1; i >= 0; --i) { - entity * e = get_implementation(get_class_supertype(class, i), method); - if (e) { - return e; - } - } - assert(0 && "implemenation not found"); -} + entity *impl; -/* 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) { - entity *impl_meth = NULL; - ir_node *addr = get_atomic_ent_value(inh_meth); - assert(addr && "constant entity without value"); + /* Add the implementation to the set if it contains an irg, else + remember that there are more methods called. */ + impl = method; + if (get_entity_peculiarity(method) == peculiarity_inherited) + impl = get_inherited_methods_implementation(method); - if (get_irn_op(addr) == op_Const) { - impl_meth = get_tv_entity(get_Const_tarval(addr)); + if (get_entity_peculiarity(method) != peculiarity_description) { + eset_insert(set, impl); + ++(*size); } - assert(!impl_meth || get_entity_peculiarity(impl_meth) == existent); - return impl_meth? impl_meth : inh_meth; -} - - -/* 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; - if (get_entity_peculiarity(method) == existent) { - if (get_entity_visibility(method) == 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); - } - } - } - if (get_entity_peculiarity(method) == 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) { - 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); - } - } - } - /** recursive descend **/ + /*- recursive descent -*/ 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); } - -/* 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); - /** Gefunden Entitaeten in ein Feld kopieren, ev. Unbekannten - Vorgaenger einfuegen. **/ + /* Vorgaenger einfuegen. */ if (size == 0 && !open) { /* keine implementierte überschriebene Methode */ arr = NULL; @@ -146,131 +153,135 @@ static entity ** get_impl_methods(entity * method) { return arr; } +/** Analyze address computations. + * + * Compute for all Sel nodes the set of methods that can be selected. + * For each entity we store the set of subentities in the link field. + * + * Further do some optimizations: + * - Call standard optimizations for Sel nodes: this removes polymorphic + * calls. + * - If the node is a SymConst(name) replace it by SymConst(ent) if possible. + * For this we precomputed a map name->entity. Nowadays, we no more support + * this and assert. + * - If the node is a Sel: + * If we found only a single method that can be called, replace the Sel + * by a SymConst. This is more powerful than the analysis in opt_polymorphy, + * as here we walk the type graph. In opt_polymorphy we only apply a local + * pattern. + * + * @param node The node to analyze + * @param env A map that maps names of entities to the entities. + */ +static void sel_methods_walker(ir_node * node, void *env) { + pmap *ldname_map = env; + + /* Call standard optimizations */ + if (get_irn_op(node) == op_Sel) { + ir_node *new_node = optimize_in_place(node); + if (node != new_node) exchange(node, new_node); + } -static void sel_methods_walker(ir_node * node, pmap * ldname_map) { + /* replace SymConst(name)-operations by SymConst(ent) */ 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)); + if (get_SymConst_kind(node) == symconst_addr_name) { + pmap_entry * entry = pmap_find(ldname_map, (void *) get_SymConst_name(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 */ - 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))); - } + assert(0 && "There should not be a SymConst[addr_name] addressing a method with an implementation" + "in this compilation unit. Use a SymConst[addr_ent]."); } } - } 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) { - /* 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))); - } else { - assert(get_entity_peculiarity(ent) != 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); - } - 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()); - } - } else { - 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"); -#endif + } + else if (get_irn_op(node) == op_Sel && + is_Method_type(get_entity_type(get_Sel_entity(node)))) { + entity * ent = get_SymConst_entity(get_atomic_ent_value(get_Sel_entity(node))); + 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); + } - if (ARR_LEN(arr) == 1 && arr[0] != NULL) { - /* 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]))); - } + /* -- As an add on we get an optimization that removes polymorphic calls. + This optimization is more powerful than that in transform_node_Sel. -- */ + 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. */ + /* It may be description: We call a method in a dead part of the program. */ + assert (get_entity_peculiarity(ent) == peculiarity_description); + } else { + entity ** arr = get_entity_link(ent); + 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(get_SymConst_entity(get_atomic_ent_value(arr[0]))) == + peculiarity_existent); + new_node = copy_const_value(get_atomic_ent_value(arr[0])); + DBG_OPT_POLY(node, new_node); + exchange (node, new_node); } } } } - -/* Datenstruktur initialisieren. Zusätzlich werden alle - * SymConst-Operationen, die auf interne Methoden verweisen, durch - * Const-Operationen ersetzt. */ +/** Initialize auxiliary data structures. + * + * Computes a set of entities that overwrite an entity and contain + * an impelementation. The set is stored in the entity's link field. + * + * Further replaces Sel nodes where this set contains exactly one + * method by SymConst nodes. + * Finally asserts if there is a SymConst(name) if there could be a + * SymConst(ent). */ static void sel_methods_init(void) { int i; - pmap * ldname_map = pmap_create(); + pmap * ldname_map = pmap_create(); /* Map entity names to entities: to replace + SymConst(name) by SymConst(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 + entity * ent = get_irg_entity(get_irp_irg(i)); + /* Nur extern sichtbare Methoden können überhaupt mit SymConst_ptr_name * 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); } } - all_irg_walk((irg_walk_func) sel_methods_walker, NULL, ldname_map); - pmap_destroy(ldname_map); -} -/*****************************************************************************/ - -/* Datenstruktur freigeben. */ -static void sel_methods_dispose(void) { - entity * ent; - assert(entities); - for (ent = eset_first(entities); ent; ent = eset_next(entities)) { - entity ** arr = get_entity_link(ent); - if (arr) { - DEL_ARR_F(arr); - } - set_entity_link(ent, NULL); - } - eset_destroy(entities); - entities = NULL; + all_irg_walk(sel_methods_walker, NULL, ldname_map); + pmap_destroy(ldname_map); } - -/* Gibt die Menge aller Methoden zurück, die an diesem Sel-Knoten - * zurückgegeben werden können. Die Liste enthält keine doppelten - * Einträge. */ +/*--------------------------------------------------------------------------*/ +/* Find free methods. + * + * We expect that each entity has an array with all implementations in its + * link field. */ +/*--------------------------------------------------------------------------*/ + +/** + * Returns an array of all methods that could be called at a Sel node. + * This array contains every entry only once. + */ static entity ** get_Sel_arr(ir_node * sel) { static entity ** NULL_ARRAY = NULL; entity * ent; entity ** arr; + assert(sel && get_irn_op(sel) == op_Sel); ent = get_Sel_entity(sel); - assert(is_method_type(get_entity_type(ent))); /* what else? */ + ent = get_inherited_methods_implementation(ent); + + assert(is_Method_type(get_entity_type(ent))); /* what else? */ arr = get_entity_link(ent); if (arr) { return arr; @@ -284,25 +295,211 @@ static entity ** get_Sel_arr(ir_node * sel) { } } - +/** + * Returns the number of possible called methods at a Sel node. + */ static int get_Sel_n_methods(ir_node * sel) { return ARR_LEN(get_Sel_arr(sel)); } - +/** + * Returns the ith possible called method entity at a Sel node. + */ static entity * get_Sel_method(ir_node * sel, int pos) { entity ** arr = get_Sel_arr(sel); assert(pos >= 0 && pos < ARR_LEN(arr)); return arr[pos]; } +static void free_mark(ir_node * node, eset * set); +static void free_mark_proj(ir_node * node, long n, eset * set) { + assert(get_irn_mode(node) == mode_T); + if (get_irn_link(node) == MARK) { + /* already visited */ + return; + } + set_irn_link(node, MARK); + switch (get_irn_opcode(node)) { + case iro_Proj: { + /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein + * op_Tuple oder ein Knoten, der in "free_ana_walker" behandelt + * wird. */ + ir_node * pred = get_Proj_pred(node); + if (get_irn_link(pred) != MARK && get_irn_op(pred) == op_Tuple) { + free_mark_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, set); + } else { + /* nothing: da in "free_ana_walker" behandelt. */ + } + break; + } -/* --- callee analysis ------------------------------------------------------ */ + case iro_Tuple: + free_mark(get_Tuple_pred(node, n), set); + break; + case iro_Id: + free_mark_proj(get_Id_pred(node), n, set); + break; + + case iro_Start: + case iro_Alloc: + case iro_Load: + /* nothing: Die Operationen werden in "free_ana_walker" selbst + * behandelt. */ + break; + + default: + assert(0 && "unexpected opcode or opcode not implemented"); + break; + } + set_irn_link(node, NULL); +} -static void callee_ana_node(ir_node * node, eset * methods); +static void free_mark(ir_node * node, eset * set) { + int i; + + if (get_irn_link(node) == MARK) { + return; /* already visited */ + } + set_irn_link(node, MARK); + switch (get_irn_opcode(node)) { + case iro_Sel: { + 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)); + } + } + break; + } + case iro_SymConst: + if (get_SymConst_kind(node) == symconst_addr_ent) { + entity * ent = get_SymConst_entity(node); + if (is_Method_type(get_entity_type(ent))) { + eset_insert(set, ent); + } + } else { + assert(get_SymConst_kind(node) == symconst_addr_name); + /* nothing: SymConst points to extern method */ + } + break; + + case iro_Phi: + for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) { + free_mark(get_Phi_pred(node, i), set); + } + break; + case iro_Id: + free_mark(get_Id_pred(node), set); + break; + case iro_Proj: + free_mark_proj(get_Proj_pred(node), get_Proj_proj(node), set); + break; + default: + /* nothing: Wird unten behandelt! */ + break; + } + set_irn_link(node, NULL); +} + + +static void free_ana_walker(ir_node * node, eset * set) { + int i; + if (get_irn_link(node) == MARK) { + /* bereits in einem Zyklus besucht. */ + return; + } + switch (get_irn_opcode(node)) { + /* special nodes */ + case iro_Sel: + case iro_SymConst: + case iro_Const: + case iro_Phi: + case iro_Id: + case iro_Proj: + case iro_Tuple: + /* nothing */ + break; + /* Sonderbehandlung, da der Funktionszeigereingang natürlich kein + * Verräter ist. */ + case iro_Call: + set_irn_link(node, MARK); + for (i = get_Call_arity(node) - 1; i >= 0; --i) { + ir_node * pred = get_Call_param(node, i); + if (mode_is_reference(get_irn_mode(pred))) { + free_mark(pred, set); + } + } + break; + /* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis + * jemand das Gegenteil implementiert. */ + default: + set_irn_link(node, MARK); + for (i = get_irn_arity(node) - 1; i >= 0; --i) { + ir_node * pred = get_irn_n(node, i); + if (mode_is_reference(get_irn_mode(pred))) { + free_mark(pred, set); + } + } + break; + } + set_irn_link(node, NULL); +} + +/* Die Datenstrukturen für sel-Methoden (sel_methods) muß vor dem + * Aufruf von "get_free_methods" aufgebaut sein. Die (internen) + * SymConst(name)-Operationen müssen in passende SymConst(ent)-Operationen + * umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer + * auf eine echt externe Methode. */ +static entity ** get_free_methods(void) +{ + eset * set = eset_create(); + 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_entity(irg); + /* insert "external visible" methods. */ + 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); + } + + /* insert sticky methods, too */ + for (i = get_irp_n_irgs() - 1; i >= 0; --i) { + entity * ent = get_irg_entity(get_irp_irg(i)); + /* insert "external visible" methods. */ + if (get_entity_stickyness (ent) == stickyness_sticky) { + eset_insert(set, ent); + } + } + + /* Hauptprogramm ist auch dann frei, wenn es nicht "external + * visible" ist. */ + if (get_irp_main_irg()) { + eset_insert(set, get_irg_entity(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); + } + eset_destroy(set); + + return arr; +} + +/*--------------------------------------------------------------------------*/ +/* Callee analysis. */ +/*--------------------------------------------------------------------------*/ + +static void callee_ana_node(ir_node * node, eset * methods); static void callee_ana_proj(ir_node * node, long n, eset * methods) { assert(get_irn_mode(node) == mode_T); @@ -320,9 +517,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; @@ -348,7 +545,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 */ @@ -358,31 +555,24 @@ static void callee_ana_node(ir_node * node, eset * methods) { switch (get_irn_opcode(node)) { case iro_SymConst: - /* externe Methode (wegen fix_symconst!) */ - eset_insert(methods, MARK); /* free method -> unknown */ - break; - - case iro_Const: { - /* interne Methode */ - entity * ent = get_Const_tarval(node)->u.p.ent; - assert(ent && is_method_type(get_entity_type(ent))); - if (get_entity_visibility(ent) != external_allocated) { - assert(get_entity_irg(ent)); + if (get_SymConst_kind(node) == symconst_addr_ent) { + entity * ent = get_SymConst_entity(node); + assert(ent && is_Method_type(get_entity_type(ent))); eset_insert(methods, ent); } else { + assert(get_SymConst_kind(node) == symconst_addr_name); + /* externe Methode (wegen fix_symconst!) */ eset_insert(methods, MARK); /* free method -> unknown */ } break; - } - case iro_Sel: /* polymorphe Methode */ 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; @@ -397,6 +587,11 @@ static void callee_ana_node(ir_node * node, eset * methods) { } break; + case iro_Mux: + callee_ana_node(get_Mux_false(node), methods); + callee_ana_node(get_Mux_true(node), methods); + break; + case iro_Id: callee_ana_node(get_Id_pred(node), methods); break; @@ -420,29 +615,41 @@ static void callee_ana_node(ir_node * node, eset * methods) { set_irn_link(node, NULL); } - +/* */ static void callee_walker(ir_node * call, void * env) { if (get_irn_op(call) == op_Call) { eset * methods = eset_create(); entity * ent; entity ** arr = NEW_ARR_F(entity *, 0); - callee_ana_node(skip_nop(get_Call_ptr(call)), methods); + assert(get_irn_op(get_Call_ptr(call)) != op_Id); + callee_ana_node(get_Call_ptr(call), methods); if (eset_contains(methods, MARK)) { /* unknown method */ - ARR_APP1(entity *, arr, NULL); + ARR_APP1(entity *, arr, unknown_entity); } 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) { +#if 0 /* This generates Bad nodes when we don't want it. + Call it with a check for valid cgana information in local_optimize. */ + if (ARR_LEN(arr) == 0 && get_opt_optimize() && get_opt_dyn_meth_dispatch()) { /* Kann vorkommen, wenn der Vorgänger beispielsweise eine * Sel-Operation war, die keine Methoden zurückgeben * konnte. Wir ersetzen die Call-Operation ebenfalls durch * eine Bad-Operation. Die Verlinkung muss wiederhergestellt * werden! */ - exchange(call, new_Bad()); - } else { + 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 , new_Bad()); + + } else +#endif + { set_Call_callee_arr(call, ARR_LEN(arr), arr); } DEL_ARR_F(arr); @@ -451,6 +658,15 @@ static void callee_walker(ir_node * call, void * env) { } +static void remove_Tuples(ir_node * proj, void * env) { + ir_node *new; + if (get_irn_opcode(proj) != iro_Proj) return; + + new = skip_Tuple(proj); + if (new != proj) exchange(proj, new); +} + + /* Bestimmt für jede Call-Operation die Menge der aufrufbaren Methode * und speichert das Ergebnis in der Call-Operation. (siehe * "set_Call_callee"). "sel_methods" wird für den Aufbau benötigt und @@ -459,186 +675,49 @@ static void callee_ana(void) { int i; /* Alle Graphen analysieren. */ for (i = get_irp_n_irgs() - 1; i >= 0; --i) { - irg_walk_graph(get_irp_irg(i), callee_walker, NULL, NULL); + irg_walk_graph(get_irp_irg(i), callee_walker, remove_Tuples, NULL); + set_irg_callee_info_state(get_irp_irg(i), irg_callee_info_consistent); } + set_irp_callee_info_state(irg_callee_info_consistent); } +/*--------------------------------------------------------------------------*/ +/* Cleanup after analyses. */ +/*--------------------------------------------------------------------------*/ - -/* --- free method analysis ------------------------------------------------- */ - - -static void free_mark(ir_node * node, eset * set); - -static void free_mark_proj(ir_node * node, long n, eset * set) { - assert(get_irn_mode(node) == mode_T); - if (get_irn_link(node) == MARK) { - /* already visited */ - return; - } - set_irn_link(node, MARK); - switch (get_irn_opcode(node)) { - case iro_Proj: { - /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein - * op_Tuple oder ein Knoten, der in "free_ana_walker" behandelt - * wird. */ - ir_node * pred = get_Proj_pred(node); - if (get_irn_link(pred) != MARK && get_irn_op(pred) == op_Tuple) { - free_mark_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, set); - } else { - /* nothing: da in "free_ana_walker" behandelt. */ - } - break; - } - - case iro_Tuple: - free_mark(get_Tuple_pred(node, n), set); - break; - - case iro_Id: - free_mark_proj(get_Id_pred(node), n, set); - break; - - case iro_Start: - case iro_Alloc: - case iro_Load: - /* nothing: Die Operationen werden in "free_ana_walker" selbst - * behandelt. */ - break; - - default: - assert(0 && "unexpected opcode or opcode not implemented"); - break; - } - set_irn_link(node, NULL); -} - - -static void free_mark(ir_node * node, eset * set) { - int i; - assert(get_irn_mode(node) == mode_p); - if (get_irn_link(node) == MARK) { - return; /* already visited */ - } - set_irn_link(node, MARK); - switch (get_irn_opcode(node)) { - case iro_Sel: { - 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)); - } - } - break; - } - case iro_SymConst: - /* nothing: SymConst points to extern method */ - 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); - } - break; - } - case iro_Phi: - for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) { - free_mark(get_Phi_pred(node, i), set); +/** Frees intermediate data structures. */ +static void sel_methods_dispose(void) { + entity * ent; + assert(entities); + for (ent = eset_first(entities); ent; ent = eset_next(entities)) { + entity ** arr = get_entity_link(ent); + if (arr) { + DEL_ARR_F(arr); } - break; - case iro_Id: - free_mark(get_Id_pred(node), set); - break; - case iro_Proj: - free_mark_proj(get_Proj_pred(node), get_Proj_proj(node), set); - break; - default: - /* nothing: Wird unten behandelt! */ - break; + set_entity_link(ent, NULL); } - set_irn_link(node, NULL); + eset_destroy(entities); + entities = NULL; } +/*--------------------------------------------------------------------------*/ +/* Freeing the callee arrays. */ +/*--------------------------------------------------------------------------*/ -static void free_ana_walker(ir_node * node, eset * set) { - int i; - if (get_irn_link(node) == MARK) { - /* bereits in einem Zyklus besucht. */ - return; +static void destruct_walker(ir_node * node, void * env) { + if (get_irn_op(node) == op_Call) { + remove_Call_callee_arr(node); } - switch (get_irn_opcode(node)) { - /* special nodes */ - case iro_Sel: - case iro_SymConst: - case iro_Const: - case iro_Phi: - case iro_Id: - case iro_Proj: - case iro_Tuple: - /* nothing */ - break; - /* Sonderbehandlung, da der Funktionszeigereingang natürlich kein - * Verräter ist. */ - case iro_Call: - 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); - } - } - break; - /* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis - * jemand das Gegenteil implementiert. */ - default: - 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); - } - } - break; - } - set_irn_link(node, NULL); } - -/* Die Datenstrukturen für sel-Methoden (sel_methods) muß vor dem - * Aufruf von "get_free_methods" aufgebaut sein. Die (internen) - * SymConst-Operationen müssen in passende Const-Operationen - * umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer - * auf eine echt externe Methode. */ -static entity ** get_free_methods(void) { - eset * set = eset_create(); - 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) { - eset_insert(set, ent); - } - 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())); - for (ent = eset_first(set); ent; ent = eset_next(set)) { - ARR_APP1(entity *, arr, ent); - } - eset_destroy(set); - - return arr; -} +/*--------------------------------------------------------------------------*/ +/* Main drivers. */ +/*--------------------------------------------------------------------------*/ void cgana(int *length, entity ***free_methods) { - entity ** free_meths; - int i; + entity ** free_meths, **p; + /* Optimize Sel/SymConst nodes and compute all methods that implement an entity. */ sel_methods_init(); free_meths = get_free_methods(); callee_ana(); @@ -646,8 +725,42 @@ void cgana(int *length, entity ***free_methods) { /* Convert the flexible array to an array that can be handled by standard C. */ - *length = ARR_LEN(free_meths); - *free_methods = (entity **)malloc(sizeof(entity *) * (*length)); - for (i = 0; i < (*length); i++) (*free_methods)[i] = free_meths[i]; + p = xmalloc(sizeof(*p) * ARR_LEN(free_meths)); + memcpy(p, free_meths, ARR_LEN(free_meths) * sizeof(*p)); + + *length = ARR_LEN(free_meths); + *free_methods = p; + DEL_ARR_F(free_meths); } + +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); +} + +void free_irp_callee_info(void) { + int i, n_irgs = get_irp_n_irgs(); + for (i = 0; i < n_irgs; ++i) { + free_callee_info(get_irp_irg(i)); + } +} + +/* Optimize the address expressions passed to call nodes. + * + * 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 which 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(); +}