# include "mangle.h"
# include "typegmod.h"
# include "array.h"
+# include "irtools.h"
+# include "irhooks.h"
/* All this is needed to build the constant node for methods: */
# include "irprog_t.h"
/** general **/
/*******************************************************************/
-entity *unknown_entity = NULL; entity *get_unknown_entity(void) { return unknown_entity; }
-#define UNKNOWN_ENTITY_NAME "unknown_entity"
-
-static INLINE entity *
-new_rd_entity (dbg_info *db, type *owner, ident *name, type *type);
-
-void
-init_entity (void)
-{
- symconst_symbol sym;
+entity *unknown_entity = NULL;
- assert(firm_unknown_type && "Call init_type before init_entity!");
- assert(!unknown_entity && "Call init_entity only once!");
- unknown_entity = new_rd_entity(NULL, firm_unknown_type, new_id_from_str(UNKNOWN_ENTITY_NAME), firm_unknown_type);
- set_entity_visibility(unknown_entity, visibility_external_allocated);
- set_entity_ld_ident(unknown_entity, get_entity_ident(unknown_entity));
-
- sym.entity_p = unknown_entity;
- current_ir_graph = get_const_code_irg();
- unknown_entity->value = new_SymConst(sym, symconst_addr_ent);
-}
+entity *get_unknown_entity(void) { return unknown_entity; }
+#define UNKNOWN_ENTITY_NAME "unknown_entity"
/*-----------------------------------------------------------------*/
/* ENTITY */
}
/**
- * creates a new entity
+ * Creates a new entity. This entity is NOT inserted in the owner type.
+ *
+ * @param db debug info for this entity
+ * @param owner the owner type of the new entity
+ * @param name the name of the new entity
+ * @param type the type of the new entity
+ *
+ * @return the new created entity
*/
static INLINE entity *
new_rd_entity (dbg_info *db, type *owner, ident *name, type *type)
res = xmalloc(sizeof(*res));
memset(res, 0, sizeof(*res));
- res->kind = k_entity;
- res->owner = owner;
- res->name = name;
- res->type = type;
+
+ res->kind = k_entity;
+ res->name = name;
+ res->ld_name = NULL;
+ res->owner = owner;
+ res->type = type;
if (get_type_tpop(type) == type_method)
res->allocation = allocation_static;
res->allocation = allocation_automatic;
res->visibility = visibility_local;
- res->offset = -1;
+
if (is_Method_type(type)) {
symconst_symbol sym;
sym.entity_p = res;
res->variability = variability_constant;
- rem = current_ir_graph;
+ rem = current_ir_graph;
current_ir_graph = get_const_code_irg();
- res->value = new_SymConst(sym, symconst_addr_ent);
+ res->value = new_SymConst(sym, symconst_addr_ent);
current_ir_graph = rem;
- } else {
+ res->irg_add_properties = 0;
+ }
+ else {
res->variability = variability_uninitialized;
- res->value = NULL;
- res->values = NULL;
- res->val_paths = NULL;
+ res->value = NULL;
+ res->values = NULL;
+ res->val_paths = NULL;
}
- res->peculiarity = peculiarity_existent;
+
res->volatility = volatility_non_volatile;
res->stickyness = stickyness_unsticky;
- res->ld_name = NULL;
+ res->offset = -1;
+ res->link = NULL;
+ res->peculiarity = peculiarity_existent;
+
if (is_Class_type(owner)) {
res->overwrites = NEW_ARR_F(entity *, 0);
res->overwrittenby = NEW_ARR_F(entity *, 0);
}
res->irg = NULL;
- //res->accesses = NULL;
-
#ifdef DEBUG_libfirm
res->nr = get_irp_new_node_nr();
#endif /* DEBUG_libfirm */
/* Remember entity in it's owner. */
insert_entity_in_owner (res);
+ hook_new_entity(res);
return res;
}
if (ent->val_paths) {
if (is_compound_entity(ent))
for (i = 0; i < get_compound_ent_n_values(ent); i++)
- if (ent->val_paths[i]) ;
- /* free_compound_graph_path(ent->val_paths[i]) ; * @@@ warum nich? */
- /* Geht nich: wird mehrfach verwendet!!! ==> mehrfach frei gegeben. */
- /* DEL_ARR_F(ent->val_paths); */
+ if (ent->val_paths[i]) ;
+ /* free_compound_graph_path(ent->val_paths[i]) ; * @@@ warum nich? */
+ /* Geht nich: wird mehrfach verwendet!!! ==> mehrfach frei gegeben. */
+ /* DEL_ARR_F(ent->val_paths); */
}
ent->val_paths = NULL;
ent->values = NULL;
return false;
}
-
-ir_node *copy_const_value(ir_node *n) {
+/*
+ * Copies a firm subgraph that complies to the restrictions for
+ * constant expressions to current_block in current_ir_graph.
+ */
+ir_node *copy_const_value(dbg_info *dbg, ir_node *n) {
ir_node *nn;
ir_mode *m;
dead node elimination/inlineing. */
m = get_irn_mode(n);
- switch(get_irn_opcode(n)) {
+ switch (get_irn_opcode(n)) {
case iro_Const:
- nn = new_Const(m, get_Const_tarval(n)); set_Const_type(nn, get_Const_type(n));
- //nn = new_rd_Const_type(get_irn_dbg_info(n), current_ir_graph, get_cur_block(),
- // m, get_Const_tarval(n), get_Const_type(n));
+ nn = new_d_Const_type(dbg, m, get_Const_tarval(n), get_Const_type(n));
break;
case iro_SymConst:
- nn = new_d_SymConst_type(NULL, get_SymConst_symbol(n), get_SymConst_kind(n),
+ nn = new_d_SymConst_type(dbg, get_SymConst_symbol(n), get_SymConst_kind(n),
get_SymConst_value_type(n));
break;
case iro_Add:
- nn = new_Add(copy_const_value(get_Add_left(n)),
- copy_const_value(get_Add_right(n)), m); break;
+ nn = new_d_Add(dbg, copy_const_value(dbg, get_Add_left(n)),
+ copy_const_value(dbg, get_Add_right(n)), m); break;
case iro_Sub:
- nn = new_Sub(copy_const_value(get_Sub_left(n)),
- copy_const_value(get_Sub_right(n)), m); break;
+ nn = new_d_Sub(dbg, copy_const_value(dbg, get_Sub_left(n)),
+ copy_const_value(dbg, get_Sub_right(n)), m); break;
case iro_Mul:
- nn = new_Mul(copy_const_value(get_Mul_left(n)),
- copy_const_value(get_Mul_right(n)), m); break;
+ nn = new_d_Mul(dbg, copy_const_value(dbg, get_Mul_left(n)),
+ copy_const_value(dbg, get_Mul_right(n)), m); break;
case iro_And:
- nn = new_And(copy_const_value(get_And_left(n)),
- copy_const_value(get_And_right(n)), m); break;
+ nn = new_d_And(dbg, copy_const_value(dbg, get_And_left(n)),
+ copy_const_value(dbg, get_And_right(n)), m); break;
case iro_Or:
- nn = new_Or(copy_const_value(get_Or_left(n)),
- copy_const_value(get_Or_right(n)), m); break;
+ nn = new_d_Or(dbg, copy_const_value(dbg, get_Or_left(n)),
+ copy_const_value(dbg, get_Or_right(n)), m); break;
case iro_Eor:
- nn = new_Eor(copy_const_value(get_Eor_left(n)),
- copy_const_value(get_Eor_right(n)), m); break;
+ nn = new_d_Eor(dbg, copy_const_value(dbg, get_Eor_left(n)),
+ copy_const_value(dbg, get_Eor_right(n)), m); break;
case iro_Cast:
- nn = new_Cast(copy_const_value(get_Cast_op(n)), get_Cast_type(n)); break;
+ nn = new_d_Cast(dbg, copy_const_value(dbg, get_Cast_op(n)), get_Cast_type(n)); break;
case iro_Conv:
- nn = new_Conv(copy_const_value(get_Conv_op(n)), m); break;
+ nn = new_d_Conv(dbg, copy_const_value(dbg, get_Conv_op(n)), m); break;
case iro_Unknown:
- nn = new_Unknown(m); break;
+ nn = new_d_Unknown(dbg, m); break;
default:
DDMN(n);
assert(0 && "opcode invalid or not implemented");
assert(is_type(tp) && is_compound_type(tp));
assert(length > 0);
- res = xmalloc(sizeof(*res) + (length-1) * sizeof(res->nodes[0]));
- memset(res, 0, sizeof(*res) + (length-1) * sizeof(res->nodes[0]));
+ res = xmalloc(sizeof(*res) + (length-1) * sizeof(res->list[0]));
+ memset(res, 0, sizeof(*res) + (length-1) * sizeof(res->list[0]));
res->kind = k_ir_compound_graph_path;
res->tp = tp;
res->len = length;
- res->arr_indicees = xcalloc(length, sizeof(res ->arr_indicees[0]));
return res;
}
void free_compound_graph_path (compound_graph_path *gr) {
assert(gr && is_compound_graph_path(gr));
gr->kind = k_BAD;
- free(gr ->arr_indicees);
free(gr);
}
get_compound_graph_path_node(compound_graph_path *gr, int pos) {
assert(gr && is_compound_graph_path(gr));
assert(pos >= 0 && pos < gr->len);
- return gr->nodes[pos];
+ return gr->list[pos].node;
}
void
assert(gr && is_compound_graph_path(gr));
assert(pos >= 0 && pos < gr->len);
assert(is_entity(node));
- gr->nodes[pos] = node;
+ gr->list[pos].node = node;
assert(is_proper_compound_graph_path(gr, pos));
}
get_compound_graph_path_array_index(compound_graph_path *gr, int pos) {
assert(gr && is_compound_graph_path(gr));
assert(pos >= 0 && pos < gr->len);
- return gr->arr_indicees[pos];
+ return gr->list[pos].index;
}
void
set_compound_graph_path_array_index(compound_graph_path *gr, int pos, int index) {
assert(gr && is_compound_graph_path(gr));
assert(pos >= 0 && pos < gr->len);
- gr->arr_indicees[pos] = index;
+ gr->list[pos].index = index;
}
/* A value of a compound entity is a pair of value and the corresponding path to a member of
assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
for (i = 0; i < (ARR_LEN (ent->val_paths)); i++) {
compound_graph_path *path = ent->val_paths[i];
- if (path->nodes[path->len-1] == value_ent) {
+ if (path->list[path->len-1].node == value_ent) {
for(; i < (ARR_LEN (ent->val_paths))-1; i++) {
ent->val_paths[i] = ent->val_paths[i+1];
- ent->values[i] = ent->values[i+1];
+ ent->values[i] = ent->values[i+1];
}
ARR_SETLEN(entity*, ent->val_paths, ARR_LEN(ent->val_paths) - 1);
ARR_SETLEN(ir_node*, ent->values, ARR_LEN(ent->values) - 1);
void
add_compound_ent_value(entity *ent, ir_node *val, entity *member) {
compound_graph_path *path;
- type *owner_tp = get_entity_owner(ent);
+ type *owner_tp = get_entity_owner(member);
assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
- path = new_compound_graph_path(owner_tp, 1);
- path->nodes[0] = member;
+ path = new_compound_graph_path(get_entity_type(ent), 1);
+ path->list[0].node = member;
if (is_Array_type(owner_tp)) {
int max;
int i;
max = index;
}
}
- path->arr_indicees[0] = max + 1;
+ path->list[0].index = max + 1;
}
add_compound_ent_value_w_path(ent, val, path);
}
else
init = get_array_upper_bound_int(arr, 0) +1;
- set_entity_link(get_array_element_entity(arr), (void *)init);
+ set_entity_link(get_array_element_entity(arr), INT_TO_PTR(init));
}
assert(get_array_n_dimensions(arr) == 1);
if (has_array_lower_bound(arr, dim)) {
- next = (int)get_entity_link(elem_ent) +1;
+ next = PTR_TO_INT(get_entity_link(elem_ent)) + 1;
if (has_array_upper_bound(arr, dim)) {
int upper = get_array_upper_bound_int(arr, dim);
if (next == upper) next = get_array_lower_bound_int(arr, dim);
}
} else {
- next = (int)get_entity_link(elem_ent) -1;
+ next = PTR_TO_INT(get_entity_link(elem_ent)) - 1;
if (has_array_lower_bound(arr, dim)) {
int upper = get_array_upper_bound_int(arr, dim);
if (next == upper) next = get_array_upper_bound_int(arr, dim);
}
}
- set_entity_link(elem_ent, (void *)next);
+ set_entity_link(elem_ent, INT_TO_PTR(next));
return next;
}
int (entity_not_visited)(entity *ent) {
return _entity_not_visited(ent);
}
+
+unsigned (get_entity_additional_properties)(const entity *ent) {
+ return _get_entity_additional_properties(ent);
+}
+
+void (set_entity_additional_properties)(entity *ent, unsigned property_mask) {
+ _set_entity_additional_properties(ent, property_mask);
+}
+
+void (set_entity_additional_property)(entity *ent, unsigned flag) {
+ _set_entity_additional_property(ent, (irg_additional_property)flag);
+}
+
+/* Returns the calling convention of an entities graph. */
+unsigned (get_entity_calling_convention)(const entity *ent) {
+ return _get_entity_calling_convention(ent);
+}
+
+/* Sets the calling convention of an entities graph. */
+void (set_entity_calling_convention)(entity *ent, unsigned cc_mask) {
+ _set_entity_calling_convention(ent, cc_mask);
+}
+
+void firm_init_entity(void)
+{
+ symconst_symbol sym;
+
+ assert(firm_unknown_type && "Call init_type() before firm_init_entity()!");
+ assert(!unknown_entity && "Call firm_init_entity() only once!");
+ unknown_entity = new_rd_entity(NULL, firm_unknown_type, new_id_from_str(UNKNOWN_ENTITY_NAME), firm_unknown_type);
+ set_entity_visibility(unknown_entity, visibility_external_allocated);
+ set_entity_ld_ident(unknown_entity, get_entity_ident(unknown_entity));
+
+ sym.entity_p = unknown_entity;
+ current_ir_graph = get_const_code_irg();
+ unknown_entity->value = new_SymConst(sym, symconst_addr_ent);
+}