X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fana%2Fcgana.c;h=759e9af5721993645b50a99bdec077b519d9f05d;hb=847c1b62a1eae1e8055645996049f7f5db0a0d8b;hp=73b6f7d8b3d77a5684661f2dabfcdf8bf11e9f56;hpb=fdf0a6d1b4651dcc548d79d3aa540e3d7f876505;p=libfirm diff --git a/ir/ana/cgana.c b/ir/ana/cgana.c index 73b6f7d8b..759e9af57 100644 --- a/ir/ana/cgana.c +++ b/ir/ana/cgana.c @@ -1,755 +1,833 @@ /* - * 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. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. */ /** - * 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. + * @file + * @brief Intraprozedural analyses to estimate the call graph. + * @author Hubert Schmid + * @date 09.06.2002 + * @brief + * 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 -#endif +#include "config.h" -#include -#include "cgana.h" -#include "rta.h" +#include +#include "cgana.h" -#include "eset.h" -#include "pmap.h" -#include "array.h" -#include "irprog.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 "irnode_t.h" -#include "irflag_t.h" +#include "iropt.h" +#include "irtools.h" +#include "irflag_t.h" #include "dbginfo_t.h" +#include "iropt_dbg.h" -/* Eindeutige Adresse zur Markierung von besuchten Knoten und zur - * Darstellung der unbekannten Methode. */ -static void * MARK = &MARK; - +#include "pmap.h" +#include "array.h" +#include "error.h" +#include "irdump.h" -/* --- sel methods ---------------------------------------------------------- */ +/* unambiguous address used as a mark. */ +static void *MARK = &MARK; +static pset *entities = NULL; -static eset * entities = NULL; +/*--------------------------------------------------------------------------*/ +/* The analysis */ +/*--------------------------------------------------------------------------*/ -/* Bestimmt die eindeutige Methode, die die Methode für den - * übergebenene (dynamischen) Typ überschreibt. */ -entity * get_implementation(type * class, entity * method) { - int i; - 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) != peculiarity_description && get_entity_owner(e) == class) { - return e; - } - } - 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 && "implementation not found"); - return NULL; -} +/*--------------------------------------------------------------------------*/ +/* Initialize datastructures, remove unwanted constructs, optimize */ +/* call target computations. */ +/*--------------------------------------------------------------------------*/ -/* 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"); - - if (intern_get_irn_op(addr) == op_Const) { - 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); - } - 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) { - int i; - 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); - } - } - } - 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) == 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); - } - } - } - /** recursive descend **/ - for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i) - collect_impls(get_entity_overwrittenby(method, i), set, size, open); +/** Collect the entity representing the implementation of this + * method (not the same if inherited) and all entities for overwriting + * implementations in parameter set. + * A recursive descend in the overwritten relation. + * Cycle-free, therefore must terminate. + * + * @param method the overwritten method + * @param set A set of entities. + * + * @return Number of entities in set. + */ +static size_t collect_impls(ir_entity *method, pset *set) +{ + size_t i; + size_t size = 0; + + if (get_entity_irg(method) != NULL) { + /* has an implementation */ + pset_insert_ptr(set, method); + ++size; + } + + /*- recursive descent -*/ + for (i = get_entity_n_overwrittenby(method); i > 0;) + size += collect_impls(get_entity_overwrittenby(method, --i), set); + return size; } - -/* 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. */ -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_impls(method, set, &size, &open); - /** - Vorgaenger einfuegen. **/ - if (size == 0 && !open) { - /* keine implementierte überschriebene Methode */ - arr = NULL; - } else if (open) { - entity * ent; - arr = NEW_ARR_F(entity *, size + 1); - arr[0] = NULL; /* Represents open method */ - for (ent = eset_first(set); size > 0; ent = eset_next(set), --size) - arr[size] = ent; - } else { - entity * ent; - arr = NEW_ARR_F(entity *, size); - for (size -= 1, ent = eset_first(set); size >= 0; ent = eset_next(set), --size) - arr[size] = ent; - } - eset_destroy(set); - return arr; + * Determine all methods that overwrite the given method (and implement it). + * The returned array must be freed by the caller (see DEL_ARR_F). + * If the set of overwriting methods is empty, returns NULL. + * + * @param method the method + */ +static ir_entity **get_impl_methods(ir_entity *method) +{ + ir_entity **arr; + pset *set = pset_new_ptr_default(); + size_t size; + + /* Collect all method entities that can be called here */ + size = collect_impls(method, set); + + if (size == 0) { + /* no overwriting methods found */ + arr = NULL; + } else { + arr = NEW_ARR_F(ir_entity *, size); + foreach_pset(set, ir_entity, ent) { + arr[--size] = ent; + } + } + del_pset(set); + return arr; } - -/* 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 (intern_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 (entry != NULL) { /* Method is declared in the compiled code */ - 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 (intern_get_irn_op(node) == op_Sel && - is_method_type(get_entity_type(get_Sel_entity(node)))) { - entity * ent = get_Sel_entity(node); - if (get_opt_optimize() && get_opt_dyn_meth_dispatch() && - (intern_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. */ -#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) != 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 (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) == 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); - +/** 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) +{ + ir_entity **arr; + (void)env; + + /* Call standard optimizations */ + if (is_Sel(node)) { + ir_node *new_node = optimize_in_place(node); + if (node != new_node) { + exchange(node, new_node); + node = new_node; + } + } + + if (is_Sel(node) && is_Method_type(get_entity_type(get_Sel_entity(node)))) { + ir_entity *ent = get_SymConst_entity(get_atomic_ent_value(get_Sel_entity(node))); + + if (!pset_find_ptr(entities, ent)) { + /* Entity not yet handled. Find all (internal or external) + * implemented methods that overwrites this entity. + * This set is stored in the entity link. */ + set_entity_link(ent, get_impl_methods(ent)); + pset_insert_ptr(entities, ent); + } + + /* -- As an add on we get an optimization that removes polymorphic calls. + This optimization is more powerful than that in transform_node_Sel(). -- */ + arr = (ir_entity**) get_entity_link(ent); + if (arr == NULL) { + /* + * The Sel node never returns a pointer to a usable method. + * We could not call it, but it may be description: + * We call a method in a dead part of the program. + */ + assert(get_entity_irg(ent) == NULL); + } #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"); + else if (get_opt_closed_world() && get_opt_dyn_meth_dispatch() && + (ARR_LEN(arr) == 1 && arr[0] != NULL)) { + ir_node *new_node; + + /* + * The Sel node returns only one possible method. + * So we could replace the Sel node by a SymConst. + * This method must exists. + */ + assert(get_entity_irg(arr[0]) != NULL); + new_node = copy_const_value(get_irn_dbg_info(node), get_atomic_ent_value(arr[0]), get_nodes_block(node)); + DBG_OPT_POLY(node, new_node); + exchange(node, new_node); + } #endif + } +} - 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)); - new_node = copy_const_value(get_atomic_ent_value(arr[0])); DBG_OPT_POLY; - exchange (node, new_node); - } - } - } - } +/** + * Initialize auxiliary data structures. + * + * Computes a set of entities that overwrite an entity and contain + * an implementation. 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) +{ + size_t i, n; + pmap *ldname_map = pmap_create(); /* Map entity names to entities: to replace + SymConst(name) by SymConst(ent). */ + assert(entities == NULL); + entities = pset_new_ptr_default(); + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) { + ir_entity * ent = get_irg_entity(get_irp_irg(i)); + /* only external visible methods are allowed to call by a SymConst_ptr_name */ + if (entity_is_externally_visible(ent)) { + pmap_insert(ldname_map, (void *)get_entity_ld_ident(ent), ent); + } + } + + all_irg_walk(sel_methods_walker, NULL, NULL); + pmap_destroy(ldname_map); } +/*--------------------------------------------------------------------------*/ +/* Find free methods. + * + * We expect that each entity has an array with all implementations in its + * link field. */ +/*--------------------------------------------------------------------------*/ -/* 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(); - 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) != 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); +/** + * Returns an array of all methods that could be called at a Sel node. + * This array contains every entry only once. + * + * @param sel the Sel node + */ +static ir_entity ** get_Sel_arr(ir_node * sel) +{ + static ir_entity ** NULL_ARRAY = NULL; + + ir_entity *const ent = get_Sel_entity(sel); + assert(is_Method_type(get_entity_type(ent))); /* what else? */ + + ir_entity **const arr = (ir_entity**)get_entity_link(ent); + if (arr) { + return arr; + } else { + /* "NULL" zeigt an, dass keine Implementierung existiert. Dies + * kann f�r polymorphe (abstrakte) Methoden passieren. */ + if (!NULL_ARRAY) { + NULL_ARRAY = NEW_ARR_F(ir_entity *, 0); + } + return NULL_ARRAY; + } } -/*****************************************************************************/ - -/* 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; +/** + * Returns the number of possible called methods at a Sel node. + * + * @param sel the Sel node + */ +static size_t get_Sel_n_methods(ir_node * sel) +{ + return ARR_LEN(get_Sel_arr(sel)); } - -/* 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. */ -static entity ** get_Sel_arr(ir_node * sel) { - static entity ** NULL_ARRAY = NULL; - entity * ent; - entity ** arr; - assert(sel && intern_get_irn_op(sel) == op_Sel); - ent = get_Sel_entity(sel); - assert(is_method_type(get_entity_type(ent))); /* what else? */ - arr = get_entity_link(ent); - if (arr) { - return arr; - } else { - /* "NULL" zeigt an, dass keine Implementierung existiert. Dies - * kann für polymorphe (abstrakte) Methoden passieren. */ - if (!NULL_ARRAY) { - NULL_ARRAY = NEW_ARR_F(entity *, 0); - } - return NULL_ARRAY; - } +/** + * Returns the ith possible called method entity at a Sel node. + */ +static ir_entity * get_Sel_method(ir_node * sel, size_t pos) +{ + ir_entity ** arr = get_Sel_arr(sel); + assert(pos < ARR_LEN(arr)); + return arr[pos]; } - -static int get_Sel_n_methods(ir_node * sel) { - return ARR_LEN(get_Sel_arr(sel)); +/* forward */ +static void free_mark(ir_node *node, pset *set); + +static void free_mark_proj(ir_node *node, long n, pset *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 && is_Tuple(pred)) { + 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 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]; +/** + * Called for predecessors nodes of "interesting" ones. + * Interesting ones include all nodes that can somehow make + * a method visible. + * + * If a method (or a set of methods in case of polymorph calls) gets visible, + * add it to the set of 'free' methods + * + * @param node the current visited node + * @param set the set of all free methods + */ +static void free_mark(ir_node *node, pset *set) +{ + if (get_irn_link(node) == MARK) + return; /* already visited */ + + set_irn_link(node, MARK); + + switch (get_irn_opcode(node)) { + case iro_Sel: { + ir_entity *ent = get_Sel_entity(node); + if (is_method_entity(ent)) { + size_t i, n; + for (i = 0, n = get_Sel_n_methods(node); i < n; ++i) { + pset_insert_ptr(set, get_Sel_method(node, i)); + } + } + break; + } + case iro_SymConst: + if (get_SymConst_kind(node) == symconst_addr_ent) { + ir_entity *ent = get_SymConst_entity(node); + if (is_method_entity(ent)) { + pset_insert_ptr(set, ent); + } + } + break; + + case iro_Phi: + { + int i, n; + for (i = 0, n = get_Phi_n_preds(node); i < n; ++i) { + free_mark(get_Phi_pred(node, i), set); + } + break; + } + case iro_Proj: + free_mark_proj(get_Proj_pred(node), get_Proj_proj(node), set); + break; + default: + /* nothing: */ + break; + } } - - -/* --- 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); - if (get_irn_link(node) == MARK) { - /* already visited */ - return; - } - set_irn_link(node, MARK); - - switch (intern_get_irn_opcode(node)) { - case iro_Proj: { - /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein - * op_Tuple oder ein Knoten, der eine "freie Methode" - * zurückgibt. */ - ir_node * pred = get_Proj_pred(node); - if (get_irn_link(pred) != MARK) { - if (intern_get_irn_op(pred) == op_Tuple) { - callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods); - } else { - eset_insert(methods, MARK); /* free method -> unknown */ - } - } - break; - } - - case iro_Tuple: - callee_ana_node(get_Tuple_pred(node, n), methods); - break; - - case iro_Id: - callee_ana_proj(get_Id_pred(node), n, methods); - break; - - default: - eset_insert(methods, MARK); /* free method -> unknown */ - break; - } - - set_irn_link(node, NULL); +/** + * post-walker. Find method addresses. + */ +static void free_ana_walker(ir_node *node, void *env) +{ + pset *set = (pset*) env; + + if (get_irn_link(node) == MARK) { + /* already visited */ + 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; + case iro_Call: + { + size_t i, n; + /* we must handle Call nodes specially, because their call address input + do not expose a method address. */ + set_irn_link(node, MARK); + for (i = 0, n = get_Call_n_params(node); i < n; ++i) { + ir_node *pred = get_Call_param(node, i); + if (mode_is_reference(get_irn_mode(pred))) { + free_mark(pred, set); + } + } + break; + } + default: { + int i; + /* other nodes: Alle anderen Knoten nehmen wir als Verr�ter an, bis + * jemand das Gegenteil implementiert. */ + 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; + } + } } - -static void callee_ana_node(ir_node * node, eset * methods) { - int i; - - assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node)); - /* rekursion verhindern */ - if (get_irn_link(node) == MARK) { - /* already visited */ - return; - } - set_irn_link(node, MARK); - - switch (intern_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 = tarval_to_entity(get_Const_tarval(node)); - assert(ent && is_method_type(get_entity_type(ent))); - if (get_entity_visibility(ent) != visibility_external_allocated) { - assert(get_entity_irg(ent)); - eset_insert(methods, ent); - } else { - 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); - } else { - eset_insert(methods, MARK); - } - } - break; - - case iro_Bad: - /* nothing */ - break; - - case iro_Phi: /* Vereinigung */ - for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) { - callee_ana_node(get_Phi_pred(node, i), methods); - } - break; - - case iro_Id: - callee_ana_node(get_Id_pred(node), methods); - break; - - case iro_Proj: - callee_ana_proj(get_Proj_pred(node), get_Proj_proj(node), methods); - break; - - case iro_Add: - case iro_Sub: - case iro_Conv: - /* extern */ - eset_insert(methods, MARK); /* free method -> unknown */ - break; - - default: - assert(0 && "invalid opcode or opcode not implemented"); - break; - } - - set_irn_link(node, NULL); +/** + * Add all method addresses in global new style initializers to the set. + * + * @note + * We do NOT check the type here, just if it's an entity address. + * The reason for this is code like: + * + * void *p = function; + * + * which is sometimes used to anchor functions. + */ +static void add_method_address_inititializer(ir_initializer_t *initializer, + pset *set) +{ + ir_node *n; + size_t i; + + switch (initializer->kind) { + case IR_INITIALIZER_CONST: + n = initializer->consti.value; + + /* let's check if it's the address of a function */ + if (is_SymConst_addr_ent(n)) { + ir_entity *ent = get_SymConst_entity(n); + + if (is_Method_type(get_entity_type(ent))) + pset_insert_ptr(set, ent); + } + return; + case IR_INITIALIZER_TARVAL: + case IR_INITIALIZER_NULL: + return; + case IR_INITIALIZER_COMPOUND: + for (i = 0; i < initializer->compound.n_initializers; ++i) { + ir_initializer_t *sub_initializer + = initializer->compound.initializers[i]; + add_method_address_inititializer(sub_initializer, set); + } + return; + } + panic("invalid initializer found"); } - -static void callee_walker(ir_node * call, void * env) { - if (intern_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); - if (eset_contains(methods, MARK)) { /* unknown method */ - ARR_APP1(entity *, arr, NULL); - } - for (ent = eset_first(methods); ent; ent = eset_next(methods)) { - if (ent != MARK) { - ARR_APP1(entity *, arr, ent); - } - } - if (ARR_LEN(arr) == 0) { - /* 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 { - set_Call_callee_arr(call, ARR_LEN(arr), arr); - } - DEL_ARR_F(arr); - eset_destroy(methods); - } +/** + * Add all method addresses in global initializers to the set. + * + * @note + * We do NOT check the type here, just if it's an entity address. + * The reason for this is code like: + * + * void *p = function; + * + * which is sometimes used to anchor functions. + */ +static void add_method_address(ir_entity *ent, pset *set) +{ + ir_type *tp; + + /* ignore methods: these of course reference their addresses + * TODO: remove this later once this incorrect self-initialisation is gone + */ + tp = get_entity_type(ent); + if (is_Method_type(tp)) + return; + + if (ent->initializer != NULL) { + add_method_address_inititializer(get_entity_initializer(ent), set); + } } +/** + * returns a list of 'free' methods, i.e., the methods that can be called + * from external or via function pointers. + * + * 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 size_t get_free_methods(ir_entity ***free_methods) +{ + pset *free_set = pset_new_ptr_default(); + size_t i, n, j, m; + ir_entity **arr; + ir_graph *irg; + ir_type *tp; + size_t length; + + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) { + ir_linkage linkage; + irg = get_irp_irg(i); + ir_entity *const ent = get_irg_entity(irg); + linkage = get_entity_linkage(ent); + + if ((linkage & IR_LINKAGE_HIDDEN_USER) || entity_is_externally_visible(ent)) { + pset_insert_ptr(free_set, ent); + } + + ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK); + /* Find all method entities that gets "visible" through this graphs, + * for instance because their address is stored. */ + irg_walk_graph(irg, firm_clear_link, free_ana_walker, free_set); + ir_free_resources(irg, IR_RESOURCE_IRN_LINK); + } + + /* insert all methods that are used in global variables initializers */ + tp = get_glob_type(); + for (j = 0, m = get_class_n_members(tp); j < m; ++j) { + ir_entity *const ent = get_class_member(tp, j); + add_method_address(ent, free_set); + } + tp = get_tls_type(); + for (j = 0, m = get_compound_n_members(tp); j < m; ++j) { + ir_entity *const ent = get_compound_member(tp, j); + add_method_address(ent, free_set); + } + + /* the main program is even then "free", if it's not external visible. */ + irg = get_irp_main_irg(); + if (irg != NULL) + pset_insert_ptr(free_set, get_irg_entity(irg)); + + /* Finally, transform the set into an array. */ + length = pset_count(free_set); + arr = XMALLOCN(ir_entity*, length); + i = 0; + foreach_pset(free_set, ir_entity, ent) { + arr[i++] = ent; + } + del_pset(free_set); + + *free_methods = arr; + return length; +} -/* 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 - * muss bereits aufgebaut sein. */ -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); - set_irg_callee_info_state(get_irp_irg(i), irg_callee_info_consistent); - } +/*--------------------------------------------------------------------------*/ +/* Callee analysis. */ +/*--------------------------------------------------------------------------*/ + +static void callee_ana_node(ir_node *node, pset *methods); + +static void callee_ana_proj(ir_node *node, long n, pset *methods) +{ + 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 eine "freie Methode" + * zur�ckgibt. */ + ir_node *pred = get_Proj_pred(node); + if (get_irn_link(pred) != MARK) { + if (is_Tuple(pred)) { + callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods); + } else { + pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */ + } + } + break; + } + + case iro_Tuple: + callee_ana_node(get_Tuple_pred(node, n), methods); + break; + + default: + pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */ + break; + } } +/** + * Analyse a Call address. + * + * @param node the node representing the call address + * @param methods after call contains the set of all possibly called entities + */ +static void callee_ana_node(ir_node *node, pset *methods) +{ + assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node)); + /* Beware of recursion */ + if (get_irn_link(node) == MARK) { + /* already visited */ + return; + } + set_irn_link(node, MARK); + + switch (get_irn_opcode(node)) { + case iro_Const: + /* A direct address call. We tread this as an external + call and ignore it completely. */ + pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */ + break; + + case iro_SymConst: { + ir_entity *ent = get_SymConst_entity(node); + assert(ent && is_method_entity(ent)); + pset_insert_ptr(methods, ent); + break; + } + + case iro_Sel: { + /* polymorphic method */ + size_t i, n; + for (i = 0, n = get_Sel_n_methods(node); i < n; ++i) { + ir_entity *ent = get_Sel_method(node, i); + if (ent != NULL) { + pset_insert_ptr(methods, ent); + } else { + pset_insert_ptr(methods, get_unknown_entity()); + } + } + break; + } + + case iro_Bad: + /* nothing */ + break; + + case iro_Phi: { + int i; + for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) { + callee_ana_node(get_Phi_pred(node, i), 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; + + case iro_Proj: + callee_ana_proj(get_Proj_pred(node), get_Proj_proj(node), methods); + break; + + case iro_Add: + case iro_Sub: + case iro_Conv: + /* extern */ + pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */ + break; + + default: + assert(0 && "invalid opcode or opcode not implemented"); + break; + } +} +/** + * Walker: Analyses every Call node and calculates an array of possible + * callees for that call. + */ +static void callee_walker(ir_node *call, void *env) +{ + (void) env; + if (is_Call(call)) { + pset *methods = pset_new_ptr_default(); + ir_entity **arr; + size_t i; + + callee_ana_node(get_Call_ptr(call), methods); + arr = NEW_ARR_F(ir_entity*, pset_count(methods)); + i = 0; + foreach_pset(methods, ir_entity, ent) { + arr[i] = ent; + /* we want the unknown_entity on the zero position for easy tests later */ + if (is_unknown_entity(ent)) { + arr[i] = arr[0]; + arr[0] = get_unknown_entity(); + } + ++i; + } + set_Call_callee_arr(call, ARR_LEN(arr), arr); + DEL_ARR_F(arr); + del_pset(methods); + } +} -/* --- 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 (intern_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 && intern_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); +/** + * Walker: Removes all tuple. + */ +static void remove_Tuples(ir_node *proj, void *env) +{ + ir_node *nn; + (void) env; + if (! is_Proj(proj)) return; + + nn = skip_Tuple(proj); + if (nn != proj) exchange(proj, nn); } -static void free_mark(ir_node * node, eset * set) { - int i; - assert(mode_is_reference(get_irn_mode(node))); - if (get_irn_link(node) == MARK) { - return; /* already visited */ - } - set_irn_link(node, MARK); - switch (intern_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); - 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; - } - 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); +/** + * Determine for every Call the set of possibly called methods and stores it + * inside the Call (@see set_Call_callee()). + * Uses the sel_methods set with much be already calculated. + */ +static void callee_ana(void) +{ + size_t i, n; + /* analyse all graphs */ + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) { + ir_graph *irg = get_irp_irg(i); + irg_walk_graph(irg, callee_walker, remove_Tuples, NULL); + set_irg_callee_info_state(irg, irg_callee_info_consistent); + } + set_irp_callee_info_state(irg_callee_info_consistent); } +/*--------------------------------------------------------------------------*/ +/* Cleanup after analyses. */ +/*--------------------------------------------------------------------------*/ + +/** Frees intermediate data structures. */ +static void sel_methods_dispose(void) +{ + assert(entities); + foreach_pset(entities, ir_entity, ent) { + ir_entity **arr = (ir_entity**) get_entity_link(ent); + if (arr != NULL) { + DEL_ARR_F(arr); + } + set_entity_link(ent, NULL); + } + del_pset(entities); + entities = 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 (intern_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(intern_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 = intern_get_irn_arity(node) - 1; i >= 0; --i) { - ir_node * pred = get_irn_n(node, i); - if (mode_is_reference(intern_get_irn_mode(pred))) { - free_mark(pred, set); - } - } - break; - } - set_irn_link(node, NULL); +static void destruct_walker(ir_node * node, void * env) +{ + (void) env; + if (is_Call(node)) { + remove_Call_callee_arr(node); + } } +size_t cgana(ir_entity ***free_methods) +{ + size_t length; + /* Optimize Sel/SymConst nodes and compute all methods that implement an entity. */ + sel_methods_init(); + length = get_free_methods(free_methods); + callee_ana(); + sel_methods_dispose(); + return length; +} -/* 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) != 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 dann frei, wenn es nicht "external - * visible" ist. */ - 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); - } - eset_destroy(set); - - return arr; +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 cgana(int *length, entity ***free_methods) { - entity ** free_meths; - int i; - - sel_methods_init(); - free_meths = get_free_methods(); - callee_ana(); - sel_methods_dispose(); - - /* 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]; - DEL_ARR_F(free_meths); +void free_irp_callee_info(void) +{ + size_t i, n; + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) { + free_callee_info(get_irp_irg(i)); + } } -/* 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 +void opt_call_addrs(void) +{ + /* 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 referring to the corresponding entity. + * - Sel nodes, that select entities that are not overwritten are + * replaced by Const nodes referring 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 referring to the entity that implements the method in + * the type given by the Alloc node. + */ + sel_methods_init(); + sel_methods_dispose(); }