#include "dbginfo_t.h"
#include "iropt_dbg.h"
-#include "eset.h"
#include "pmap.h"
#include "array.h"
#include "error.h"
/* unambiguous address used as a mark. */
static void *MARK = &MARK;
-static eset *entities = NULL;
+static pset *entities = NULL;
/*--------------------------------------------------------------------------*/
/* The analysis */
*
* @return Number of entities in set.
*/
-static size_t collect_impls(ir_entity *method, eset *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 */
- eset_insert(set, method);
+ pset_insert_ptr(set, method);
++size;
}
static ir_entity **get_impl_methods(ir_entity *method)
{
ir_entity **arr;
- eset *set = eset_create();
+ pset *set = pset_new_ptr_default();
size_t size;
/* Collect all method entities that can be called here */
/* no overwriting methods found */
arr = NULL;
} else {
- ir_entity * ent;
arr = NEW_ARR_F(ir_entity *, size);
- for (ent = (ir_entity*) eset_first(set); size > 0; ent = (ir_entity*) eset_next(set))
+ foreach_pset(set, ir_entity, ent) {
arr[--size] = ent;
+ }
}
- eset_destroy(set);
+ del_pset(set);
return arr;
}
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 (!eset_contains(entities, ent)) {
+ 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));
- eset_insert(entities, ent);
+ pset_insert_ptr(entities, ent);
}
/* -- As an add on we get an optimization that removes polymorphic calls.
pmap *ldname_map = pmap_create(); /* Map entity names to entities: to replace
SymConst(name) by SymConst(ent). */
assert(entities == NULL);
- entities = eset_create();
+ 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 */
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);
+ ir_entity *const ent = get_Sel_entity(sel);
assert(is_Method_type(get_entity_type(ent))); /* what else? */
- arr = (ir_entity**) get_entity_link(ent);
+
+ ir_entity **const arr = (ir_entity**)get_entity_link(ent);
if (arr) {
return arr;
} else {
}
/* forward */
-static void free_mark(ir_node * node, eset * set);
+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) {
* @param node the current visited node
* @param set the set of all free methods
*/
-static void free_mark(ir_node *node, eset * set)
+static void free_mark(ir_node *node, pset *set)
{
if (get_irn_link(node) == MARK)
return; /* already visited */
if (is_method_entity(ent)) {
size_t i, n;
for (i = 0, n = get_Sel_n_methods(node); i < n; ++i) {
- eset_insert(set, get_Sel_method(node, i));
+ pset_insert_ptr(set, get_Sel_method(node, i));
}
}
break;
if (get_SymConst_kind(node) == symconst_addr_ent) {
ir_entity *ent = get_SymConst_entity(node);
if (is_method_entity(ent)) {
- eset_insert(set, ent);
+ pset_insert_ptr(set, ent);
}
}
break;
*/
static void free_ana_walker(ir_node *node, void *env)
{
- eset *set = (eset*) env;
+ pset *set = (pset*) env;
if (get_irn_link(node) == MARK) {
/* already visited */
* which is sometimes used to anchor functions.
*/
static void add_method_address_inititializer(ir_initializer_t *initializer,
- eset *set)
+ pset *set)
{
ir_node *n;
size_t i;
ir_entity *ent = get_SymConst_entity(n);
if (is_Method_type(get_entity_type(ent)))
- eset_insert(set, ent);
+ pset_insert_ptr(set, ent);
}
return;
case IR_INITIALIZER_TARVAL:
*
* which is sometimes used to anchor functions.
*/
-static void add_method_address(ir_entity *ent, eset *set)
+static void add_method_address(ir_entity *ent, pset *set)
{
ir_type *tp;
if (ent->initializer != NULL) {
add_method_address_inititializer(get_entity_initializer(ent), set);
- } else if (entity_has_compound_ent_values(ent)) {
- size_t i, n;
- for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) {
- ir_node *irn = get_compound_ent_value(ent, i);
-
- /* let's check if it's the address of a function */
- if (is_SymConst_addr_ent(irn)) {
- ir_entity *ent2 = get_SymConst_entity(irn);
-
- if (is_Method_type(get_entity_type(ent2)))
- eset_insert(set, ent2);
- }
- }
}
}
*/
static size_t get_free_methods(ir_entity ***free_methods)
{
- eset *free_set = eset_create();
+ pset *free_set = pset_new_ptr_default();
size_t i, n, j, m;
ir_entity **arr;
- ir_entity *ent;
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);
- ent = get_irg_entity(irg);
+ ir_entity *const ent = get_irg_entity(irg);
linkage = get_entity_linkage(ent);
if ((linkage & IR_LINKAGE_HIDDEN_USER) || entity_is_externally_visible(ent)) {
- eset_insert(free_set, ent);
+ pset_insert_ptr(free_set, ent);
}
ir_reserve_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) {
- ent = get_class_member(tp, 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) {
- ent = get_compound_member(tp, 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)
- eset_insert(free_set, get_irg_entity(irg));
+ pset_insert_ptr(free_set, get_irg_entity(irg));
/* Finally, transform the set into an array. */
- length = eset_count(free_set);
+ length = pset_count(free_set);
arr = XMALLOCN(ir_entity*, length);
- for (i = 0, ent = (ir_entity*) eset_first(free_set); ent; ent = (ir_entity*) eset_next(free_set)) {
+ i = 0;
+ foreach_pset(free_set, ir_entity, ent) {
arr[i++] = ent;
}
- eset_destroy(free_set);
+ del_pset(free_set);
*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) {
if (is_Tuple(pred)) {
callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods);
} else {
- eset_insert(methods, unknown_entity); /* free method -> unknown */
+ pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */
}
}
break;
break;
default:
- eset_insert(methods, unknown_entity); /* free method -> unknown */
+ pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */
break;
}
}
* @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)
+static void callee_ana_node(ir_node *node, pset *methods)
{
assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node));
/* Beware of recursion */
case iro_Const:
/* A direct address call. We tread this as an external
call and ignore it completely. */
- eset_insert(methods, unknown_entity); /* free method -> unknown */
+ 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));
- eset_insert(methods, ent);
+ pset_insert_ptr(methods, ent);
break;
}
for (i = 0, n = get_Sel_n_methods(node); i < n; ++i) {
ir_entity *ent = get_Sel_method(node, i);
if (ent != NULL) {
- eset_insert(methods, ent);
+ pset_insert_ptr(methods, ent);
} else {
- eset_insert(methods, unknown_entity);
+ pset_insert_ptr(methods, get_unknown_entity());
}
}
break;
case iro_Sub:
case iro_Conv:
/* extern */
- eset_insert(methods, unknown_entity); /* free method -> unknown */
+ pset_insert_ptr(methods, get_unknown_entity()); /* free method -> unknown */
break;
default:
{
(void) env;
if (is_Call(call)) {
- eset *methods = eset_create();
- ir_entity *ent;
+ 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 *, eset_count(methods));
- for (i = 0, ent = (ir_entity*) eset_first(methods); ent; ent = (ir_entity*) eset_next(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 (ent == unknown_entity) {
+ if (is_unknown_entity(ent)) {
arr[i] = arr[0];
- arr[0] = unknown_entity;
+ arr[0] = get_unknown_entity();
}
++i;
}
set_Call_callee_arr(call, ARR_LEN(arr), arr);
DEL_ARR_F(arr);
- eset_destroy(methods);
+ del_pset(methods);
}
}
/** Frees intermediate data structures. */
static void sel_methods_dispose(void)
{
- ir_entity * ent;
assert(entities);
- for (ent = (ir_entity*) eset_first(entities); ent; ent = (ir_entity*) eset_next(entities)) {
- ir_entity ** arr = (ir_entity**) 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;
}