X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;ds=sidebyside;f=ir%2Fana%2Fcgana.c;h=a4052fadef085d893a14f9e35e39270b830bb65e;hb=b451899be294500fe974c6e97febc59cabdda114;hp=68799bc408823e0ee48d3dbde0c1a0a5a604138e;hpb=e78f164c3a0654b8567ff0fcba69b3ca68f07ab5;p=libfirm diff --git a/ir/ana/cgana.c b/ir/ana/cgana.c index 68799bc40..a4052fade 100644 --- a/ir/ana/cgana.c +++ b/ir/ana/cgana.c @@ -1,5 +1,5 @@ /* - * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved. + * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved. * * This file is part of libFirm. * @@ -22,8 +22,7 @@ * @brief Intraprozedural analyses to estimate the call graph. * @author Hubert Schmid * @date 09.06.2002 - * @version $Id$ - * @summary + * @brief * Interprocedural analysis to estimate the calling relation. * * This analysis computes all entities representing methods that @@ -31,16 +30,11 @@ * 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 +#include "config.h" -#ifdef HAVE_STRING_H -# include -#endif +#include #include "cgana.h" -#include "rta.h" #include "xmalloc.h" #include "irnode_t.h" @@ -50,25 +44,22 @@ #include "ircons.h" #include "irgmod.h" #include "iropt.h" +#include "irtools.h" #include "irflag_t.h" #include "dbginfo_t.h" #include "iropt_dbg.h" -#include "eset.h" #include "pmap.h" #include "array.h" +#include "error.h" #include "irdump.h" -#include "irhooks.h" - - - /* unambiguous address used as a mark. */ static void *MARK = &MARK; -static eset *entities = NULL; +static pset *entities = NULL; /*--------------------------------------------------------------------------*/ /* The analysis */ @@ -80,86 +71,60 @@ static eset *entities = NULL; /* call target computations. */ /*--------------------------------------------------------------------------*/ -/** Returns the entity that contains the implementation of the inherited - * entity if available, else returns the entity passed. */ -static ir_entity *get_inherited_methods_implementation(ir_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)); -} - /** Collect the entity representing the implementation of this * method (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. + * implementations in parameter set. * A recursive descend in the overwritten relation. * Cycle-free, therefore must terminate. * - * @param method + * @param method the overwritten method * @param set A set of entities. - * @param size Number of entities in set. - * @param open + * + * @return Number of entities in set. */ -static void collect_impls(ir_entity *method, eset *set, int *size, int *open) { - int i; - ir_entity *impl; - - /* 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); +static size_t collect_impls(ir_entity *method, pset *set) +{ + size_t i; + size_t size = 0; - if (get_entity_peculiarity(method) != peculiarity_description) { - eset_insert(set, impl); - ++(*size); + if (get_entity_irg(method) != NULL) { + /* has an implementation */ + pset_insert_ptr(set, method); + ++size; } /*- recursive descent -*/ - for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i) - collect_impls(get_entity_overwrittenby(method, i), set, size, open); + 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 "method" überschreiben, so gibt die Methode - * "NULL" zurück. +/** + * 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 + * @param method the method */ -static ir_entity ** get_impl_methods(ir_entity * method) { - eset * set = eset_create(); - int size = 0; - ir_entity ** arr; - int open = 0; +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 */ - collect_impls(method, set, &size, &open); + size = collect_impls(method, set); - /* Vorgaenger einfuegen. */ - if (size == 0 && !open) { - /* keine implementierte überschriebene Methode */ + if (size == 0) { + /* no overwriting methods found */ arr = NULL; - } else if (open) { - ir_entity * ent; - arr = NEW_ARR_F(ir_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 { - ir_entity * ent; arr = NEW_ARR_F(ir_entity *, size); - for (size -= 1, ent = eset_first(set); size >= 0; ent = eset_next(set), --size) - arr[size] = ent; + foreach_pset(set, ir_entity, ent) { + arr[--size] = ent; + } } - eset_destroy(set); + del_pset(set); return arr; } @@ -180,97 +145,91 @@ static ir_entity ** get_impl_methods(ir_entity * method) { * 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. + * @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; +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) + if (node != new_node) { exchange(node, new_node); + node = new_node; + } } - /* replace SymConst(name)-operations by SymConst(ent) */ - if (get_irn_op(node) == op_SymConst) { - 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 */ - 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]."); - } + 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); } - } - else if (get_irn_op(node) == op_Sel && - is_Method_type(get_entity_type(get_Sel_entity(node)))) { - ir_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 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)); - eset_insert(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 = 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_peculiarity(ent) == peculiarity_description); - } - else if (get_opt_optimize() && 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. - */ - 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_irn_dbg_info(node), get_atomic_ent_value(arr[0])); - DBG_OPT_POLY(node, new_node); - exchange(node, new_node); - } + /* -- 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 + 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 } } -/** Initialize auxiliary data structures. +/** + * 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. + * 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) { - int i; - pmap * ldname_map = pmap_create(); /* Map entity names to entities: to replace - SymConst(name) by SymConst(ent). */ + * 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 = eset_create(); - for (i = get_irp_n_irgs() - 1; i >= 0; --i) { + 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 (get_entity_visibility(ent) != visibility_local) { - pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent); + if (entity_is_externally_visible(ent)) { + pmap_insert(ldname_map, (void *)get_entity_ld_ident(ent), ent); } } - all_irg_walk(sel_methods_walker, NULL, ldname_map); + all_irg_walk(sel_methods_walker, NULL, NULL); pmap_destroy(ldname_map); } @@ -287,22 +246,22 @@ static void sel_methods_init(void) { * * @param sel the Sel node */ -static ir_entity ** get_Sel_arr(ir_node * sel) { +static ir_entity ** get_Sel_arr(ir_node * sel) +{ static ir_entity ** NULL_ARRAY = NULL; ir_entity * ent; ir_entity ** arr; assert(is_Sel(sel)); ent = get_Sel_entity(sel); - ent = get_inherited_methods_implementation(ent); assert(is_Method_type(get_entity_type(ent))); /* what else? */ - arr = get_entity_link(ent); + 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. */ + * kann f�r polymorphe (abstrakte) Methoden passieren. */ if (!NULL_ARRAY) { NULL_ARRAY = NEW_ARR_F(ir_entity *, 0); } @@ -315,22 +274,26 @@ static ir_entity ** get_Sel_arr(ir_node * sel) { * * @param sel the Sel node */ -static int get_Sel_n_methods(ir_node * sel) { +static size_t 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 ir_entity * get_Sel_method(ir_node * sel, int pos) { +static ir_entity * get_Sel_method(ir_node * sel, size_t pos) +{ ir_entity ** arr = get_Sel_arr(sel); - assert(pos >= 0 && pos < ARR_LEN(arr)); + assert(pos < ARR_LEN(arr)); return arr[pos]; } -static void free_mark(ir_node * node, eset * set); +/* forward */ +static void free_mark(ir_node *node, pset *set); -static void free_mark_proj(ir_node * node, long n, eset * 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 */ @@ -343,7 +306,7 @@ static void free_mark_proj(ir_node * node, long n, eset * set) { * 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) { + 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. */ @@ -370,7 +333,7 @@ static void free_mark_proj(ir_node * node, long n, eset * set) { assert(0 && "unexpected opcode or opcode not implemented"); break; } - set_irn_link(node, NULL); + // set_irn_link(node, NULL); } /** @@ -384,9 +347,8 @@ static void free_mark_proj(ir_node * node, long n, eset * set) { * @param node the current visited node * @param set the set of all free methods */ -static void free_mark(ir_node *node, eset * set) { - int i; - +static void free_mark(ir_node *node, pset *set) +{ if (get_irn_link(node) == MARK) return; /* already visited */ @@ -394,50 +356,47 @@ static void free_mark(ir_node *node, eset * set) { switch (get_irn_opcode(node)) { case iro_Sel: { - ir_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)); + 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_type(get_entity_type(ent))) { - eset_insert(set, ent); + ir_entity *ent = get_SymConst_entity(node); + if (is_method_entity(ent)) { + pset_insert_ptr(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) { + { + 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_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! */ + /* nothing: */ break; } - set_irn_link(node, NULL); } /** * post-walker. Find method addresses. */ -static void free_ana_walker(ir_node *node, void *env) { - eset *set = env; - int i; +static void free_ana_walker(ir_node *node, void *env) +{ + pset *set = (pset*) env; if (get_irn_link(node) == MARK) { /* already visited */ @@ -454,80 +413,103 @@ static void free_ana_walker(ir_node *node, void *env) { case iro_Tuple: /* nothing */ break; - /* Sonderbehandlung, da der Funktionszeigereingang natürlich kein - * Verräter ist. */ 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 = get_Call_n_params(node) - 1; i >= 0; --i) { + 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; - /* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis + } + default: { + int i; + /* 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); + 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); + } } /** - * Add all method addresses in global initializers to the set. + * Add all method addresses in global new style initializers to the set. * * @note - * We do NOT check the type here, just it it's an entity address. + * 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, eset *set) +static void add_method_address_inititializer(ir_initializer_t *initializer, + pset *set) { ir_node *n; - ir_type *tp; - int i; - - /* do not check uninitialized values */ - if (get_entity_variability(ent) == variability_uninitialized) - return; - - if (is_atomic_entity(ent)) { - tp = get_entity_type(ent); + size_t i; - /* ignore methods: these of course reference it's address */ - if (is_Method_type(tp)) - return; + switch (initializer->kind) { + case IR_INITIALIZER_CONST: + n = initializer->consti.value; /* let's check if it's the address of a function */ - n = get_atomic_ent_value(ent); - if (is_SymConst(n) && get_SymConst_kind(n) == symconst_addr_ent) { - ent = get_SymConst_entity(n); + if (is_SymConst_addr_ent(n)) { + ir_entity *ent = get_SymConst_entity(n); if (is_Method_type(get_entity_type(ent))) - eset_insert(set, ent); + pset_insert_ptr(set, ent); } - } else { - for (i = get_compound_ent_n_values(ent) - 1; i >= 0; --i) { - n = get_compound_ent_value(ent, i); + 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"); +} - /* let's check if it's the address of a function */ - if (is_SymConst(n) && get_SymConst_kind(n) == symconst_addr_ent) { - ir_entity *ent = get_SymConst_entity(n); +/** + * 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; - if (is_Method_type(get_entity_type(ent))) - eset_insert(set, ent); - } - } + /* 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); } } @@ -535,71 +517,76 @@ static void add_method_address(ir_entity *ent, eset *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 + * 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 + * 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 ir_entity ** get_free_methods(void) +static size_t get_free_methods(ir_entity ***free_methods) { - eset *free_set = eset_create(); - int i; - ir_entity **arr = NEW_ARR_F(ir_entity *, 0); - ir_entity *ent; + pset *free_set = pset_new_ptr_default(); + size_t i, n, j, m; + ir_entity **arr; ir_graph *irg; - ir_type *glob; + ir_type *tp; + size_t length; - for (i = get_irp_n_irgs() - 1; i >= 0; --i) { + for (i = 0, n = get_irp_n_irgs(); i < n; ++i) { + ir_linkage linkage; irg = get_irp_irg(i); - ent = get_irg_entity(irg); - /* insert "external visible" methods. */ - if (get_entity_visibility(ent) != visibility_local) { - eset_insert(free_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, free_ana_walker, free_set); - } + ir_entity *const ent = get_irg_entity(irg); + linkage = get_entity_linkage(ent); - /* insert sticky methods, too */ - for (i = get_irp_n_irgs() - 1; i >= 0; --i) { - ent = get_irg_entity(get_irp_irg(i)); - /* insert "sticky" methods. */ - if (get_entity_stickyness (ent) == stickyness_sticky) { - eset_insert(free_set, 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 */ - glob = get_glob_type(); - for (i = get_class_n_members(glob) - 1; i >= 0; --i) { - ent = get_class_member(glob, i); - + 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) - eset_insert(free_set, get_irg_entity(irg)); + if (irg != NULL) + pset_insert_ptr(free_set, get_irg_entity(irg)); /* Finally, transform the set into an array. */ - for (ent = eset_first(free_set); ent; ent = eset_next(free_set)) { - ARR_APP1(ir_entity *, arr, ent); + length = pset_count(free_set); + arr = XMALLOCN(ir_entity*, length); + i = 0; + foreach_pset(free_set, ir_entity, ent) { + arr[i++] = ent; } - eset_destroy(free_set); + del_pset(free_set); - return arr; + *free_methods = arr; + return length; } /*--------------------------------------------------------------------------*/ /* Callee analysis. */ /*--------------------------------------------------------------------------*/ -static void callee_ana_node(ir_node * node, eset * methods); +static void callee_ana_node(ir_node *node, pset *methods); -static void callee_ana_proj(ir_node * node, long n, eset * 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 */ @@ -611,32 +598,26 @@ static void callee_ana_proj(ir_node * node, long n, eset * methods) { 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); + * zur�ckgibt. */ + ir_node *pred = get_Proj_pred(node); if (get_irn_link(pred) != MARK) { - if (get_irn_op(pred) == op_Tuple) { + if (is_Tuple(pred)) { callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods); } else { - eset_insert(methods, MARK); /* free method -> unknown */ + pset_insert_ptr(methods, get_unknown_entity()); /* 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 */ + pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */ break; } - - set_irn_link(node, NULL); } /** @@ -645,9 +626,8 @@ static void callee_ana_proj(ir_node * node, long n, eset * methods) { * @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, eset *methods) { - int i; - +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) { @@ -659,54 +639,48 @@ static void callee_ana_node(ir_node *node, eset *methods) { switch (get_irn_opcode(node)) { case iro_Const: /* A direct address call. We tread this as an external - call and ignore it completely. */ - eset_insert(methods, MARK); /* free method -> unknown */ + call and ignore it completely. */ + pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */ break; - case iro_SymConst: - if (get_SymConst_kind(node) == symconst_addr_ent) { - ir_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 */ - } + + 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: - /* polymorphe Methode */ - for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) { - ir_entity * ent = get_Sel_method(node, i); - if (ent) { - eset_insert(methods, ent); + } + + 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 { - eset_insert(methods, MARK); + pset_insert_ptr(methods, get_unknown_entity()); } } break; + } case iro_Bad: /* nothing */ break; - case iro_Phi: + 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_Psi: - for (i = get_Psi_n_conds(node) - 1; i >= 0; --i) { - callee_ana_node(get_Psi_val(node, i), methods); - } - callee_ana_node(get_Psi_default(node), methods); - break; - case iro_Id: callee_ana_node(get_Id_pred(node), methods); break; @@ -719,69 +693,50 @@ static void callee_ana_node(ir_node *node, eset *methods) { case iro_Sub: case iro_Conv: /* extern */ - eset_insert(methods, MARK); /* free method -> unknown */ + pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */ break; default: assert(0 && "invalid opcode or opcode not implemented"); break; } - - set_irn_link(node, NULL); } /** - * Walker: Analyses every call node and calculates an array of possible + * Walker: Analyses every Call node and calculates an array of possible * callees for that call. */ -static void callee_walker(ir_node * call, void * env) { +static void callee_walker(ir_node *call, void *env) +{ (void) env; if (is_Call(call)) { - eset * methods = eset_create(); - ir_entity * ent; - ir_entity ** arr = NEW_ARR_F(ir_entity *, 0); - assert(get_irn_op(get_Call_ptr(call)) != op_Id); + pset *methods = pset_new_ptr_default(); + ir_entity **arr; + size_t i; + callee_ana_node(get_Call_ptr(call), methods); - if (eset_contains(methods, MARK)) { /* unknown method */ - ARR_APP1(ir_entity *, arr, unknown_entity); - } - for (ent = eset_first(methods); ent; ent = eset_next(methods)) { - if (ent != MARK) { - ARR_APP1(ir_entity *, arr, ent); + 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; } -#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_closed_world() && 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! */ - ir_node *mem = get_Call_mem(call); - ir_node *blk = get_nodes_block(call); - turn_into_tuple (call, 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_regular , new_r_Jmp(current_ir_graph, blk)); - 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); - } + set_Call_callee_arr(call, ARR_LEN(arr), arr); DEL_ARR_F(arr); - eset_destroy(methods); + del_pset(methods); } } /** * Walker: Removes all tuple. */ -static void remove_Tuples(ir_node *proj, void *env) { +static void remove_Tuples(ir_node *proj, void *env) +{ ir_node *nn; (void) env; if (! is_Proj(proj)) return; @@ -791,14 +746,16 @@ static void remove_Tuples(ir_node *proj, void *env) { } -/* 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) { +/** + * 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); @@ -811,82 +768,69 @@ static void callee_ana(void) { /*--------------------------------------------------------------------------*/ /** Frees intermediate data structures. */ -static void sel_methods_dispose(void) { - ir_entity * ent; +static void sel_methods_dispose(void) +{ assert(entities); - for (ent = eset_first(entities); ent; ent = eset_next(entities)) { - ir_entity ** arr = get_entity_link(ent); - if (arr) { + 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); } - eset_destroy(entities); + del_pset(entities); entities = NULL; } -/*--------------------------------------------------------------------------*/ -/* Freeing the callee arrays. */ -/*--------------------------------------------------------------------------*/ - -static void destruct_walker(ir_node * node, void * env) { +static void destruct_walker(ir_node * node, void * env) +{ (void) env; if (is_Call(node)) { remove_Call_callee_arr(node); } } -/*--------------------------------------------------------------------------*/ -/* Main drivers. */ -/*--------------------------------------------------------------------------*/ - -void cgana(int *length, ir_entity ***free_methods) { - ir_entity ** free_meths, **p; - +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(); - free_meths = get_free_methods(); + length = get_free_methods(free_methods); callee_ana(); sel_methods_dispose(); - - /* Convert the flexible array to an array that can be handled - by standard C. */ - 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); + return length; } -void free_callee_info(ir_graph *irg) { +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; - for (i = get_irp_n_irgs() - 1; i >= 0; --i) { +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. - * - * 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. - */ -void opt_call_addrs(void) { +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(); }