-/* -------------------------------------------------------------------
- * $Id$
- * -------------------------------------------------------------------
+/*
+ * Project: libFIRM
+ * File name: ir/ana/cgana.c
+ * Purpose: Intraprozedural analyses to estimate the call graph.
+ * Author: Hubert Schmid
+ * Modified by:
+ * Created: 09.06.2002
+ * CVS-ID: $Id$
+ * Copyright: (c) 1999-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
+
+/**
* Intraprozedurale Analyse zur Abschätzung der Aufrulrelation. Es
* wird eine Menge von freien Methoden und anschließend die an den
* Call-Operationen aufrufbaren Methoden bestimmt.
*
- * Erstellt: Hubert Schmid, 09.06.2002
- * ---------------------------------------------------------------- */
+ */
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
-#include "stdlib.h"
+#include <stdlib.h>
#include "cgana.h"
#include "irgwalk.h"
#include "ircons.h"
#include "irgmod.h"
-#include "xprintf.h"
+#include "irnode_t.h"
+#include "irflag_t.h"
+#include "dbginfo_t.h"
/* Eindeutige Adresse zur Markierung von besuchten Knoten und zur
* Darstellung der unbekannten Methode. */
* übergebenene (dynamischen) Typ überschreibt. */
static entity * get_implementation(type * class, entity * method) {
int i;
- if (get_entity_peculiarity(method) != description &&
+ if (get_entity_peculiarity(method) != peculiarity_description &&
get_entity_owner(method) == class) {
return method;
}
for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i) {
entity * e = get_entity_overwrittenby(method, i);
- if (get_entity_peculiarity(e) != description && get_entity_owner(e) == class) {
+ if (get_entity_peculiarity(e) != peculiarity_description && get_entity_owner(e) == class) {
return e;
}
}
- for (i = get_class_n_supertype(class) - 1; i >= 0; --i) {
+ 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 && "implemenation not found");
+ return NULL;
}
/* Returns the entity that contains the implementation of the inherited
ir_node *addr = get_atomic_ent_value(inh_meth);
assert(addr && "constant entity without value");
- if (get_irn_op(addr) == op_Const) {
- impl_meth = get_tv_entity(get_Const_tarval(addr));
+ 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 -- adress 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);
}
-
- assert(!impl_meth || get_entity_peculiarity(impl_meth) == existent);
return impl_meth? impl_meth : inh_meth;
}
-/* A recursive descend in the overwritten relation.
+/* 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) == existent) {
- if (get_entity_visibility(method) == external_allocated) {
+ if (get_entity_peculiarity(method) == peculiarity_existent) {
+ if (get_entity_visibility(method) == visibility_external_allocated) {
assert(get_entity_irg(method) == NULL);
*open = true;
} else {
if (!eset_contains(set, method)) {
eset_insert(set, method);
++(*size);
- //printf("Adding existent method %d ", *size); DDME(method);
- //printf(" with owner "); DDMT(get_entity_owner(method));
}
}
}
- if (get_entity_peculiarity(method) == inherited) {
+ if (get_entity_peculiarity(method) == peculiarity_inherited) {
entity *impl_ent = get_inherited_methods_implementation(method);
assert(impl_ent && "no implementation for inherited entity");
- if (get_entity_visibility(impl_ent) == external_allocated) {
+ if (get_entity_visibility(impl_ent) == visibility_external_allocated) {
assert(get_entity_irg(impl_ent) == NULL);
*open = true;
} else {
if (!eset_contains(set, impl_ent)) {
eset_insert(set, impl_ent);
++(*size);
- // printf("Adding inherited method %d ", *size); DDME(impl_ent);
- //printf(" with owner "); DDMT(get_entity_owner(impl_ent));
}
}
}
/** recursive descend **/
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);
}
/** Collect all method entities that can be called here **/
collect_impls(method, set, &size, &open);
-
- //printf("Size is %d \n\n", size);
-
- /** Gefunden Entitaeten in ein Feld kopieren, ev. Unbekannten
+/**
Vorgaenger einfuegen. **/
if (size == 0 && !open) {
/* keine implementierte überschriebene Methode */
}
+/* 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 (get_irn_op(node) == op_SymConst) {
+ 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_entity_visibility(ent) != external_allocated) { /* Meth. is defined */
+ 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));
- exchange(node, new_d_Const(get_irn_dbg_info(node),
- mode_p, tarval_p_from_entity(ent)));
+ new_node = new_d_Const(get_irn_dbg_info(node),
+ mode_P_mach, new_tarval_from_entity(ent, mode_P_mach)); DBG_OPT_NORMALIZE;
+ exchange(node, new_node);
}
}
}
- } else if (get_irn_op(node) == op_Sel &&
+ } 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_irn_op(skip_Proj(get_Sel_ptr(node))) == op_Alloc) {
+ 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. */
- assert(get_entity_peculiarity(ent) != description);
+#if 0
+ assert(get_entity_peculiarity(ent) != peculiarity_description);
+ set_irg_current_block(current_ir_graph, get_nodes_Block(node));
+ /* @@@ Is this correct?? Alloc could reference a subtype of the owner
+ of Sel that overwrites the method referenced in Sel. */
+ /* @@@ Yes, this is wrong. GL, 10.3.04 */
+ new_node = copy_const_value(get_atomic_ent_value(ent)); DBG_OPT_POLY_ALLOC;
+#else
+ called_ent = resolve_ent_polymorphy(get_Alloc_type(skip_Proj(get_Sel_ptr(node))), ent);
set_irg_current_block(current_ir_graph, get_nodes_Block(node));
- exchange (node, copy_const_value(get_atomic_ent_value(ent)));
+ /* called_ent may not be description: has no Address/Const to Call! */
+ assert(get_entity_peculiarity(called_ent) != peculiarity_description);
+ new_node = copy_const_value(get_atomic_ent_value(called_ent)); DBG_OPT_POLY_ALLOC;
+#endif
+ exchange (node, new_node);
} else {
- assert(get_entity_peculiarity(ent) != inherited);
+ assert(get_entity_peculiarity(ent) != peculiarity_inherited);
if (!eset_contains(entities, ent)) {
/* Entity noch nicht behandelt. Alle (intern oder extern)
* implementierten Methoden suchen, die diese Entity
* 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) {
+ if (get_entity_peculiarity(ent) == peculiarity_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)));
+ printf("WARNING: Calling method description %s in method %s which has "
+ "no implementation!\n", get_entity_name(ent),
+ get_entity_name(get_irg_ent(current_ir_graph)));
} else {
exchange(node, new_Bad());
}
printf("\n");
#endif
- if (ARR_LEN(arr) == 1 && arr[0] != NULL) {
+ 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));
- exchange (node, copy_const_value(get_atomic_ent_value(arr[0])));
+ new_node = copy_const_value(get_atomic_ent_value(arr[0])); DBG_OPT_POLY;
+ exchange (node, new_node);
}
}
}
entity * ent = get_irg_ent(get_irp_irg(i));
/* Nur extern sichtbare Methode können überhaupt mit SymConst
* aufgerufen werden. */
- if (get_entity_visibility(ent) != local) {
+ if (get_entity_visibility(ent) != visibility_local) {
pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent);
}
}
- all_irg_walk((irg_walk_func) sel_methods_walker, NULL, ldname_map);
+ all_irg_walk((irg_walk_func *) sel_methods_walker, NULL, ldname_map);
pmap_destroy(ldname_map);
}
static entity ** NULL_ARRAY = NULL;
entity * ent;
entity ** arr;
- assert(sel && get_irn_op(sel) == op_Sel);
+ 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);
}
set_irn_link(node, MARK);
- switch (get_irn_opcode(node)) {
+ 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 (get_irn_op(pred) == op_Tuple) {
+ 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 */
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 */
}
set_irn_link(node, MARK);
- switch (get_irn_opcode(node)) {
+ switch (intern_get_irn_opcode(node)) {
case iro_SymConst:
/* externe Methode (wegen fix_symconst!) */
eset_insert(methods, MARK); /* free method -> unknown */
case iro_Const: {
/* interne Methode */
- entity * ent = get_Const_tarval(node)->u.p.ent;
+ entity * ent = tarval_to_entity(get_Const_tarval(node));
assert(ent && is_method_type(get_entity_type(ent)));
- if (get_entity_visibility(ent) != external_allocated) {
+ if (get_entity_visibility(ent) != visibility_external_allocated) {
assert(get_entity_irg(ent));
eset_insert(methods, ent);
} else {
static void callee_walker(ir_node * call, void * env) {
- if (get_irn_op(call) == op_Call) {
+ if (intern_get_irn_op(call) == op_Call) {
eset * methods = eset_create();
entity * ent;
entity ** arr = NEW_ARR_F(entity *, 0);
/* 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);
}
}
return;
}
set_irn_link(node, MARK);
- switch (get_irn_opcode(node)) {
+ 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 && get_irn_op(pred) == op_Tuple) {
+ 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. */
static void free_mark(ir_node * node, eset * set) {
int i;
- assert(get_irn_mode(node) == mode_p);
+ assert(mode_is_reference(get_irn_mode(node)));
if (get_irn_link(node) == MARK) {
return; /* already visited */
}
set_irn_link(node, MARK);
- switch (get_irn_opcode(node)) {
+ switch (intern_get_irn_opcode(node)) {
case iro_Sel: {
entity * ent = get_Sel_entity(node);
if (is_method_type(get_entity_type(ent))) {
break;
case iro_Const: {
tarval * val = get_Const_tarval(node);
- entity * ent = val->u.p.ent;
- if (ent != NULL && is_method_type(get_entity_type(ent))) {
- eset_insert(set, ent);
+ if (tarval_is_entity(val)) { /* filter null pointer */
+ entity * ent = tarval_to_entity(val);
+ if (is_method_type(get_entity_type(ent))) {
+ eset_insert(set, ent);
+ }
}
break;
}
/* bereits in einem Zyklus besucht. */
return;
}
- switch (get_irn_opcode(node)) {
+ switch (intern_get_irn_opcode(node)) {
/* special nodes */
case iro_Sel:
case iro_SymConst:
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) {
+ if (mode_is_reference(intern_get_irn_mode(pred))) {
free_mark(pred, set);
}
}
* jemand das Gegenteil implementiert. */
default:
set_irn_link(node, MARK);
- for (i = get_irn_arity(node) - 1; i >= 0; --i) {
+ for (i = intern_get_irn_arity(node) - 1; i >= 0; --i) {
ir_node * pred = get_irn_n(node, i);
- if (get_irn_mode(pred) == mode_p) {
+ if (mode_is_reference(intern_get_irn_mode(pred))) {
free_mark(pred, set);
}
}
ir_graph * irg = get_irp_irg(i);
entity * ent = get_irg_ent(irg);
/* insert "external visible" methods. */
- if (get_entity_visibility(ent) != local) {
+ if (get_entity_visibility(ent) != visibility_local) {
eset_insert(set, ent);
}
- irg_walk_graph(irg, NULL, (irg_walk_func) free_ana_walker, set);
+ 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()));
+ if(get_irp_main_irg()) {
+ 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);
}
for (i = 0; i < (*length); i++) (*free_methods)[i] = free_meths[i];
DEL_ARR_F(free_meths);
}
+
+/* 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
+}
projects / libfirm / blobdiff