-/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe
-** All rights reserved.
-**
-** Authors: Martin Trapp, Christian Schaefer
-**
-*/
-
-/* $Id$ */
+/*
+ * Project: libFIRM
+ * File name: ir/tr/entity.c
+ * Purpose: Representation of all program known entities.
+ * Author: Martin Trapp, Christian Schaefer
+ * Modified by: Goetz Lindenmaier
+ * Created:
+ * CVS-ID: $Id$
+ * Copyright: (c) 1998-2003 Universität Karlsruhe
+ * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ */
#ifdef HAVE_CONFIG_H
# include <config.h>
# include <stdlib.h>
# include <stddef.h>
+# include <string.h>
+
# include "entity_t.h"
# include "mangle.h"
-# include "typegmod_t.h"
+# include "typegmod.h"
# include "array.h"
/* All this is needed to build the constant node for methods: */
-# include "irprog.h"
+# include "irprog_t.h"
# include "ircons.h"
+# include "tv_t.h"
/*******************************************************************/
/** general **/
{
}
-/*******************************************************************/
-/** ENTITY **/
-/*******************************************************************/
+/*-----------------------------------------------------------------*/
+/* ENTITY */
+/*-----------------------------------------------------------------*/
-inline void insert_entity_in_owner (entity *ent) {
+static void insert_entity_in_owner (entity *ent) {
type *owner = ent->owner;
switch (get_type_tpop_code(owner)) {
case tpo_class: {
entity *res;
ir_graph *rem;
- res = (entity *) malloc (sizeof (entity));
+ assert(!id_contains_char(name, ' ') && "entity name should not contain spaces");
+
+ res = (entity *) xmalloc (sizeof (entity));
res->kind = k_entity;
assert_legal_owner_of_ent(owner);
res->owner = owner;
res->name = name;
res->type = type;
+
if (get_type_tpop(type) == type_method)
- res->allocation = static_allocated;
+ res->allocation = allocation_static;
else
- res->allocation = automatic_allocated;
- res->visibility = local;
+ res->allocation = allocation_automatic;
+
+ res->visibility = visibility_local;
res->offset = -1;
if (is_method_type(type)) {
- res->variability = constant;
+ symconst_symbol sym;
+ sym.entity_p = res;
+ res->variability = variability_constant;
rem = current_ir_graph;
current_ir_graph = get_const_code_irg();
- res->value = new_Const(mode_p, tarval_p_from_entity(res));
+ res->value = new_SymConst(sym, symconst_addr_ent);
current_ir_graph = rem;
} else {
- res->variability = uninitialized;
+ res->variability = variability_uninitialized;
+ 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;
+ if (is_class_type(owner)) {
+ res->overwrites = NEW_ARR_F(entity *, 0);
+ res->overwrittenby = NEW_ARR_F(entity *, 0);
+ } else {
+ res->overwrites = NULL;
+ res->overwrittenby = NULL;
}
- res->peculiarity = existent;
- res->volatility = non_volatile;
- res->ld_name = NULL;
- res->overwrites = NEW_ARR_F(entity *, 1);
- res->overwrittenby = NEW_ARR_F(entity *, 1);
-
res->irg = NULL;
+#ifdef DEBUG_libfirm
+ res->nr = get_irp_new_node_nr();
+#endif
+
res->visit = 0;
/* Remember entity in it's owner. */
insert_entity_in_owner (res);
return res;
}
-inline void free_entity_attrs(entity *ent) {
- assert(ent);
- DEL_ARR_F(ent->overwrites);
- DEL_ARR_F(ent->overwrittenby);
+entity *
+new_d_entity (type *owner, ident *name, type *type, dbg_info *db) {
+ entity *res = new_entity(owner, name, type);
+ set_entity_dbg_info(res, db);
+ return res;
+}
+
+void free_compound_graph_path (compound_graph_path *gr);
+int is_compound_graph_path(void *thing);
+int get_compound_graph_path_length(compound_graph_path *gr);
+entity *get_compound_graph_path_node(compound_graph_path *gr, int pos);
+int get_compound_ent_n_values(entity *ent);
+
+static void free_entity_attrs(entity *ent) {
+ int i;
+ if (get_type_tpop(get_entity_owner(ent)) == type_class) {
+ DEL_ARR_F(ent->overwrites); ent->overwrites = NULL;
+ DEL_ARR_F(ent->overwrittenby); ent->overwrittenby = NULL;
+ } else {
+ assert(ent->overwrites == NULL);
+ assert(ent->overwrittenby == NULL);
+ }
+ /* if (ent->values) DEL_ARR_F(ent->values); *//* @@@ warum nich? */
+ 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); */
+ }
+ ent->val_paths = NULL;
+ ent->values = NULL;
}
entity *
copy_entity_own (entity *old, type *new_owner) {
entity *new;
-
+ assert(old && old->kind == k_entity);
assert_legal_owner_of_ent(new_owner);
+
if (old->owner == new_owner) return old;
- new = (entity *) malloc (sizeof (entity));
+ new = (entity *) xmalloc (sizeof (entity));
memcpy (new, old, sizeof (entity));
new->owner = new_owner;
- new->overwrites = DUP_ARR_F(entity *, old->overwrites);
- new->overwrittenby = DUP_ARR_F(entity *, old->overwrittenby);
+ if (is_class_type(new_owner)) {
+ new->overwrites = NEW_ARR_F(entity *, 0);
+ new->overwrittenby = NEW_ARR_F(entity *, 0);
+ }
+#ifdef DEBUG_libfirm
+ new->nr = get_irp_new_node_nr();
+#endif
insert_entity_in_owner (new);
entity *
copy_entity_name (entity *old, ident *new_name) {
entity *new;
+ assert(old && old->kind == k_entity);
if (old->name == new_name) return old;
- new = (entity *) malloc (sizeof (entity));
+ new = (entity *) xmalloc (sizeof (entity));
memcpy (new, old, sizeof (entity));
new->name = new_name;
new->ld_name = NULL;
- new->overwrites = DUP_ARR_F(entity *, old->overwrites);
- new->overwrittenby = DUP_ARR_F(entity *, old->overwrittenby);
+ if (is_class_type(new->owner)) {
+ new->overwrites = DUP_ARR_F(entity *, old->overwrites);
+ new->overwrittenby = DUP_ARR_F(entity *, old->overwrittenby);
+ }
+#ifdef DEBUG_libfirm
+ new->nr = get_irp_new_node_nr();
+#endif
insert_entity_in_owner (new);
return new;
}
-inline const char *
-get_entity_name (entity *ent) {
- assert (ent);
- return id_to_str(get_entity_ident(ent));
+
+void
+free_entity (entity *ent) {
+ assert(ent && ent->kind == k_entity);
+ free_tarval_entity(ent);
+ free_entity_attrs(ent);
+ ent->kind = k_BAD;
+ free(ent);
+}
+
+/* Outputs a unique number for this node */
+long
+get_entity_nr(entity *ent) {
+ assert(ent && ent->kind == k_entity);
+#ifdef DEBUG_libfirm
+ return ent->nr;
+#else
+ return 0;
+#endif
+}
+
+const char *
+(get_entity_name)(entity *ent) {
+ return __get_entity_name(ent);
}
ident *
-get_entity_ident (entity *ent) {
- assert(ent);
- return ent->name;
+(get_entity_ident)(entity *ent) {
+ return get_entity_ident(ent);
}
/*
-void set_entity_ld_name (entity *, char *ld_name);
+void set_entitye_ld_name (entity *, char *ld_name);
void set_entity_ld_ident (entity *, ident *ld_ident);
*/
-inline type *
-get_entity_owner (entity *ent) {
- return ent->owner = skip_tid(ent->owner);
+type *
+(get_entity_owner)(entity *ent) {
+ return __get_entity_owner(ent);
}
-inline void
+void
set_entity_owner (entity *ent, type *owner) {
+ assert(ent && ent->kind == k_entity);
assert_legal_owner_of_ent(owner);
ent->owner = owner;
}
-inline void /* should this go into type.c? */
+void /* should this go into type.c? */
assert_legal_owner_of_ent(type *owner) {
- assert (get_type_tpop_code(owner) == tpo_class ||
+ assert(get_type_tpop_code(owner) == tpo_class ||
get_type_tpop_code(owner) == tpo_union ||
get_type_tpop_code(owner) == tpo_struct ||
- get_type_tpop_code(owner) == tpo_array); /* Yes, array has an entity
- -- to select fields! */
+ get_type_tpop_code(owner) == tpo_array); /* Yes, array has an entity
+ -- to select fields! */
}
-inline ident *
-get_entity_ld_ident (entity *ent)
-{
- if (ent->ld_name == NULL)
- ent->ld_name = mangle_entity (ent);
- return ent->ld_name;
+ident *
+(get_entity_ld_ident)(entity *ent) {
+ return __get_entity_ld_ident(ent);
}
-inline void
-set_entity_ld_ident (entity *ent, ident *ld_ident) {
- ent->ld_name = ld_ident;
+void
+(set_entity_ld_ident)(entity *ent, ident *ld_ident) {
+ __set_entity_ld_ident(ent, ld_ident);
}
-inline const char *
-get_entity_ld_name (entity *ent) {
- return id_to_str(get_entity_ld_ident(ent));
+const char *
+(get_entity_ld_name)(entity *ent) {
+ return __get_entity_ld_name(ent);
}
-/*
-char *get_entity_ld_name (entity *);
-void set_entity_ld_name (entity *, char *ld_name);
-*/
-
-inline type *
-get_entity_type (entity *ent) {
- return ent->type = skip_tid(ent->type);
+type *
+(get_entity_type)(entity *ent) {
+ return __get_entity_type(ent);
}
-inline void
-set_entity_type (entity *ent, type *type) {
- ent->type = type;
+void
+(set_entity_type)(entity *ent, type *type) {
+ __set_entity_type(ent, type);
}
+ent_allocation
+(get_entity_allocation)(entity *ent) {
+ return __get_entity_allocation(ent);
+}
-inline ent_allocation
-get_entity_allocation (entity *ent) {
- return ent->allocation;
+void
+(set_entity_allocation)(entity *ent, ent_allocation al) {
+ __set_entity_allocation(ent, al);
}
-inline void
-set_entity_allocation (entity *ent, ent_allocation al) {
- ent->allocation = al;
+/* return the name of the visibility */
+const char *get_allocation_name(ent_allocation all)
+{
+#define X(a) case a: return #a
+ switch (all) {
+ X(allocation_automatic);
+ X(allocation_parameter);
+ X(allocation_dynamic);
+ X(allocation_static);
+ default: return "BAD VALUE";
+ }
+#undef X
}
-inline ent_visibility
-get_entity_visibility (entity *ent) {
- return ent->visibility;
+ent_visibility
+(get_entity_visibility)(entity *ent) {
+ return __get_entity_visibility(ent);
}
-inline void
+void
set_entity_visibility (entity *ent, ent_visibility vis) {
- if (vis != local) assert(ent->allocation == static_allocated);
+ assert(ent && ent->kind == k_entity);
+ if (vis != visibility_local)
+ assert((ent->allocation == allocation_static) ||
+ (ent->allocation == allocation_automatic));
+ /* @@@ Test that the owner type is not local, but how??
+ && get_class_visibility(get_entity_owner(ent)) != local));*/
ent->visibility = vis;
}
-inline ent_variability
-get_entity_variability (entity *ent) {
- return ent->variability;
+/* return the name of the visibility */
+const char *get_visibility_name(ent_visibility vis)
+{
+#define X(a) case a: return #a
+ switch (vis) {
+ X(visibility_local);
+ X(visibility_external_visible);
+ X(visibility_external_allocated);
+ default: return "BAD VALUE";
+ }
+#undef X
+}
+
+ent_variability
+(get_entity_variability)(entity *ent) {
+ return __get_entity_variability(ent);
}
-inline void
-set_entity_variability (entity *ent, ent_variability var){
- if (var == part_constant)
+void
+set_entity_variability (entity *ent, ent_variability var)
+{
+ assert(ent && ent->kind == k_entity);
+ if (var == variability_part_constant)
assert(is_class_type(ent->type) || is_struct_type(ent->type));
+
if ((is_compound_type(ent->type)) &&
- (ent->variability == uninitialized) && (var != uninitialized)) {
+ (ent->variability == variability_uninitialized) && (var != variability_uninitialized)) {
/* Allocate datastructures for constant values */
- ent->values = NEW_ARR_F(ir_node *, 1);
- ent->val_ents = NEW_ARR_F(entity *, 1);
+ ent->values = NEW_ARR_F(ir_node *, 0);
+ ent->val_paths = NEW_ARR_F(compound_graph_path *, 0);
}
+
if ((is_compound_type(ent->type)) &&
- (var == uninitialized) && (ent->variability != uninitialized)) {
+ (var == variability_uninitialized) && (ent->variability != variability_uninitialized)) {
/* Free datastructures for constant values */
- DEL_ARR_F(ent->values);
- DEL_ARR_F(ent->val_ents);
+ DEL_ARR_F(ent->values); ent->values = NULL;
+ DEL_ARR_F(ent->val_paths); ent->val_paths = NULL;
}
ent->variability = var;
}
+/* return the name of the variablity */
+const char *get_variability_name(ent_variability var)
+{
+#define X(a) case a: return #a
+ switch (var) {
+ X(variability_uninitialized);
+ X(variability_initialized);
+ X(variability_part_constant);
+ X(variability_constant);
+ default: return "BAD VALUE";
+ }
+#undef X
+}
+
+ent_volatility
+(get_entity_volatility)(entity *ent) {
+ return __get_entity_volatility(ent);
+}
+
+void
+(set_entity_volatility)(entity *ent, ent_volatility vol) {
+ __set_entity_volatility(ent, vol);
+}
+
+/* return the name of the volatility */
+const char *get_volatility_name(ent_volatility var)
+{
+#define X(a) case a: return #a
+ switch (var) {
+ X(volatility_non_volatile);
+ X(volatility_is_volatile);
+ default: return "BAD VALUE";
+ }
+#undef X
+}
-inline ent_volatility
-get_entity_volatility (entity *ent) {
- return ent->volatility;
+peculiarity
+(get_entity_peculiarity)(entity *ent) {
+ return __get_entity_peculiarity(ent);
}
-inline void
-set_entity_volatility (entity *ent, ent_volatility vol) {
- ent->volatility = vol;
+void
+(set_entity_peculiarity)(entity *ent, peculiarity pec) {
+ __set_entity_peculiarity(ent, pec);
}
-inline peculiarity
-get_entity_peculiarity (entity *ent) {
- assert (ent);
- assert (is_method_type(ent->type));
- return ent->peculiarity;
+/* return the name of the peculiarity */
+const char *get_peculiarity_name(peculiarity var)
+{
+#define X(a) case a: return #a
+ switch (var) {
+ X(peculiarity_description);
+ X(peculiarity_inherited);
+ X(peculiarity_existent);
+ default: return "BAD VALUE";
+ }
+#undef X
}
-inline void
-set_entity_peculiarity (entity *ent, peculiarity pec) {
- assert (ent);
- assert (is_method_type(ent->type));
- ent->peculiarity = pec;
+/* Get the entity's stickyness */
+ent_stickyness
+(get_entity_stickyness)(entity *ent) {
+ return __get_entity_stickyness(ent);
}
-/* Set has no effect for entities of type method. */
-inline ir_node *
-get_atomic_ent_value(entity *ent) {
- assert(ent); assert(is_atomic_entity(ent)); assert((ent->variability != uninitialized));
- return ent->value;
+/* Set the entity's stickyness */
+void
+(set_entity_stickyness)(entity *ent, ent_stickyness stickyness) {
+ __set_entity_stickyness(ent, stickyness);
+}
+
+/* Set has no effect for existent entities of type method. */
+ir_node *
+get_atomic_ent_value(entity *ent)
+{
+ assert(ent && is_atomic_entity(ent));
+ assert(ent->variability != variability_uninitialized);
+ return skip_Id (ent->value);
}
-inline void
+void
set_atomic_ent_value(entity *ent, ir_node *val) {
- assert(ent && is_atomic_entity(ent) && (ent->variability != uninitialized));
- if (is_method_type(ent->type)) return;
+ assert(is_atomic_entity(ent) && (ent->variability != variability_uninitialized));
+ if (is_method_type(ent->type) && (ent->peculiarity == peculiarity_existent))
+ return;
ent->value = val;
}
-ir_node *copy_value(ir_node *n) {
+/* Returns true if the the node is representable as code on
+ * const_code_irg. */
+int is_irn_const_expression(ir_node *n) {
+ ir_mode *m;
+
+ m = get_irn_mode(n);
+ switch(get_irn_opcode(n)) {
+ case iro_Const:
+ case iro_SymConst:
+ case iro_Unknown:
+ return true; break;
+ case iro_Add:
+ case iro_Sub:
+ case iro_Mul:
+ case iro_And:
+ case iro_Or:
+ case iro_Eor:
+ if (is_irn_const_expression(get_binop_left(n)))
+ return is_irn_const_expression(get_binop_right(n));
+ case iro_Conv:
+ case iro_Cast:
+ return is_irn_const_expression(get_irn_n(n, 0));
+ default:
+ return false;
+ break;
+ }
+ return false;
+}
+
+
+ir_node *copy_const_value(ir_node *n) {
ir_node *nn;
ir_mode *m;
case iro_Const:
nn = new_Const(m, get_Const_tarval(n)); break;
case iro_SymConst:
- nn = new_SymConst(get_SymConst_type_or_id(n), get_SymConst_kind(n)); break;
+
+ nn = new_SymConst(get_SymConst_type_or_id(n), get_SymConst_kind(n));
+ break;
case iro_Add:
- nn = new_Add(copy_value(get_Add_left(n)), copy_value(get_Add_right(n)), m); break;
+ nn = new_Add(copy_const_value(get_Add_left(n)),
+ copy_const_value(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;
+ case iro_Mul:
+ nn = new_Mul(copy_const_value(get_Mul_left(n)),
+ copy_const_value(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;
+ case iro_Or:
+ nn = new_Or(copy_const_value(get_Or_left(n)),
+ copy_const_value(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;
+ case iro_Cast:
+ nn = new_Cast(copy_const_value(get_Cast_op(n)), get_Cast_type(n)); break;
+ case iro_Conv:
+ nn = new_Conv(copy_const_value(get_Conv_op(n)), m); break;
+ case iro_Unknown:
+ nn = new_Unknown(m); break;
default:
- assert(0 && "opdope invalid or not implemented"); break;
+ DDMN(n);
+ assert(0 && "opdope invalid or not implemented");
+ nn = NULL;
+ break;
}
return nn;
}
-/* Copies the value represented by the entity to current_block
- in current_ir_graph. */
-ir_node *copy_atomic_ent_value(entity *ent) {
- assert(ent && is_atomic_entity(ent) && (ent->variability != uninitialized));
- return copy_value(ent->value);
+compound_graph_path *
+new_compound_graph_path(type *tp, int length) {
+ compound_graph_path *res;
+ assert(is_type(tp) && is_compound_type(tp));
+ assert(length > 0);
+
+ res = (compound_graph_path *) malloc (sizeof(compound_graph_path) + (length-1) * sizeof(entity *));
+ res->kind = k_ir_compound_graph_path;
+ res->tp = tp;
+ res->len = length;
+ memset(res->nodes, 0, sizeof(entity *) * length);
+ return res;
+}
+
+void
+free_compound_graph_path (compound_graph_path *gr) {
+ assert(gr && is_compound_graph_path(gr));
+ gr->kind = k_BAD;
+ free(gr);
+}
+
+int
+is_compound_graph_path(void *thing) {
+ return (get_kind(thing) == k_ir_compound_graph_path);
+}
+
+/* checks whether nodes 0..pos are correct (all lie on a path.) */
+/* @@@ not implemented */
+int is_proper_compound_graph_path(compound_graph_path *gr, int pos) {
+ int i;
+ entity *node;
+ type *owner = gr->tp;
+ for (i = 0; i <= pos; i++) {
+ node = get_compound_graph_path_node(gr, i);
+ if (get_entity_owner(node) != owner) return false;
+ owner = get_entity_type(node);
+ }
+ if (pos == get_compound_graph_path_length(gr))
+ if (!is_atomic_type(owner)) return false;
+ return true;
+}
+
+int
+get_compound_graph_path_length(compound_graph_path *gr) {
+ assert(gr && is_compound_graph_path(gr));
+ return gr->len;
+}
+
+entity *
+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];
+}
+
+void
+set_compound_graph_path_node(compound_graph_path *gr, int pos, entity *node) {
+ assert(gr && is_compound_graph_path(gr));
+ assert(pos >= 0 && pos < gr->len);
+ assert(is_entity(node));
+ gr->nodes[pos] = node;
+ assert(is_proper_compound_graph_path(gr, pos));
}
-/* A value of a compound entity is a pair of value and the corresponding member of
+/* A value of a compound entity is a pair of value and the corresponding path to a member of
the compound. */
-inline void
-add_compound_ent_value(entity *ent, ir_node *val, entity *member) {
- assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized));
+void
+add_compound_ent_value_w_path(entity *ent, ir_node *val, compound_graph_path *path) {
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
ARR_APP1 (ir_node *, ent->values, val);
- ARR_APP1 (entity *, ent->val_ents, member);
+ ARR_APP1 (compound_graph_path *, ent->val_paths, path);
}
-inline int
+void
+set_compound_ent_value_w_path(entity *ent, ir_node *val, compound_graph_path *path, int pos) {
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ ent->values[pos] = val;
+ ent->val_paths[pos] = path;
+}
+
+int
get_compound_ent_n_values(entity *ent) {
- assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized));
- return (ARR_LEN (ent->values))-1;
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ return (ARR_LEN (ent->values));
}
-inline ir_node *
+ir_node *
get_compound_ent_value(entity *ent, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized));
- return ent->values[pos+1];
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ return ent->values[pos];
+}
+
+compound_graph_path *
+get_compound_ent_value_path(entity *ent, int pos) {
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ return ent->val_paths[pos];
+}
+
+void
+remove_compound_ent_value(entity *ent, entity *value_ent) {
+ int i;
+ 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) {
+ 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];
+ }
+ ARR_SETLEN(entity*, ent->val_paths, ARR_LEN(ent->val_paths) - 1);
+ ARR_SETLEN(ir_node*, ent->values, ARR_LEN(ent->values) - 1);
+ break;
+ }
+ }
}
-/* Copies the value i of the entity to current_block in current_ir_graph. */
-ir_node *copy_compound_ent_value(entity *ent, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized));
- return copy_value(ent->values[pos+1]);
+void
+add_compound_ent_value(entity *ent, ir_node *val, entity *member) {
+ compound_graph_path *path;
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ path = new_compound_graph_path(get_entity_owner(ent), 1);
+ path->nodes[0] = member;
+ add_compound_ent_value_w_path(ent, val, path);
}
-inline entity *
+/* Copies the firm subgraph referenced by val to const_code_irg and adds
+ the node as constant initialization to ent.
+ The subgraph may not contain control flow operations.
+void
+copy_and_add_compound_ent_value(entity *ent, ir_node *val, entity *member) {
+ ir_graph *rem = current_ir_graph;
+
+ assert(get_entity_variability(ent) != variability_uninitialized);
+ current_ir_graph = get_const_code_irg();
+
+ val = copy_const_value(val);
+ add_compound_ent_value(ent, val, member);
+ current_ir_graph = rem;
+ }*/
+
+/* Copies the value i of the entity to current_block in current_ir_graph.
+ir_node *
+copy_compound_ent_value(entity *ent, int pos) {
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ return copy_const_value(ent->values[pos+1]);
+ }*/
+
+entity *
get_compound_ent_value_member(entity *ent, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized));
- return ent->val_ents[pos+1];
+ compound_graph_path *path;
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ path = get_compound_ent_value_path(ent, pos);
+
+ return get_compound_graph_path_node(path, get_compound_graph_path_length(path)-1);
}
-inline void
+void
set_compound_ent_value(entity *ent, ir_node *val, entity *member, int pos) {
- assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized));
- ent->values[pos+1] = val;
- ent->val_ents[pos+1] = member;
+ compound_graph_path *path;
+ assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
+ path = get_compound_ent_value_path(ent, pos);
+ set_compound_graph_path_node(path, 0, member);
+ set_compound_ent_value_w_path(ent, val, path, pos);
}
void
assert(is_array_type(arrtp));
assert(get_array_n_dimensions(arrtp) == 1);
- assert(get_array_lower_bound (arrtp, 0) && get_array_upper_bound (arrtp, 0));
- assert(get_entity_variability(ent) != uninitialized);
+ /* One bound is sufficient, the nunmber of constant fields makes the
+ size. */
+ assert(get_array_lower_bound (arrtp, 0) || get_array_upper_bound (arrtp, 0));
+ assert(get_entity_variability(ent) != variability_uninitialized);
current_ir_graph = get_const_code_irg();
for (i = 0; i < num_vals; i++) {
- val = new_Const(get_tv_mode (values[i]), values[i]);
- set_compound_ent_value(ent, val, get_array_element_entity(arrtp), i);
+ val = new_Const(get_tarval_mode (values[i]), values[i]);
+ add_compound_ent_value(ent, val, get_array_element_entity(arrtp));
}
current_ir_graph = rem;
}
-inline int
-get_entity_offset (entity *ent) {
- return ent->offset;
+int
+(get_entity_offset_bytes)(entity *ent) {
+ return __get_entity_offset_bytes(ent);
}
-inline void
-set_entity_offset (entity *ent, int offset) {
- ent->offset = offset;
+int
+(get_entity_offset_bits)(entity *ent) {
+ return __get_entity_offset_bits(ent);
}
-inline void
-add_entity_overwrites (entity *ent, entity *overwritten) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- ARR_APP1 (entity *, ent->overwrites, overwritten);
- ARR_APP1 (entity *, overwritten->overwrittenby, ent);
+void
+(set_entity_offset_bytes)(entity *ent, int offset) {
+ __set_entity_offset_bytes(ent, offset);
}
-inline int
-get_entity_n_overwrites (entity *ent) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- return (ARR_LEN (ent->overwrites))-1;
+void
+(set_entity_offset_bits)(entity *ent, int offset) {
+ __set_entity_offset_bits(ent, offset);
+}
+
+void
+add_entity_overwrites(entity *ent, entity *overwritten) {
+ assert(ent && is_class_type(get_entity_owner(ent)));
+ ARR_APP1(entity *, ent->overwrites, overwritten);
+ ARR_APP1(entity *, overwritten->overwrittenby, ent);
}
-inline entity *
+int
+get_entity_n_overwrites(entity *ent) {
+ assert(ent && is_class_type(get_entity_owner(ent)));
+ return (ARR_LEN(ent->overwrites));
+}
+
+int
+get_entity_overwrites_index(entity *ent, entity *overwritten) {
+ int i;
+ assert(ent && is_class_type(get_entity_owner(ent)));
+ for (i = 0; i < get_entity_n_overwrites(ent); i++)
+ if (get_entity_overwrites(ent, i) == overwritten)
+ return i;
+ return -1;
+}
+
+entity *
get_entity_overwrites (entity *ent, int pos) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
+ assert(ent && is_class_type(get_entity_owner(ent)));
assert(pos < get_entity_n_overwrites(ent));
- return ent->overwrites[pos+1];
+ return ent->overwrites[pos];
}
-inline void
+void
set_entity_overwrites (entity *ent, int pos, entity *overwritten) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
+ assert(ent && is_class_type(get_entity_owner(ent)));
assert(pos < get_entity_n_overwrites(ent));
- ent->overwrites[pos+1] = overwritten;
+ ent->overwrites[pos] = overwritten;
}
-inline void
+void
+remove_entity_overwrites(entity *ent, entity *overwritten) {
+ int i;
+ assert(ent && is_class_type(get_entity_owner(ent)));
+ for (i = 0; i < (ARR_LEN (ent->overwrites)); i++)
+ if (ent->overwrites[i] == overwritten) {
+ for(; i < (ARR_LEN (ent->overwrites))-1; i++)
+ ent->overwrites[i] = ent->overwrites[i+1];
+ ARR_SETLEN(entity*, ent->overwrites, ARR_LEN(ent->overwrites) - 1);
+ break;
+ }
+}
+
+void
add_entity_overwrittenby (entity *ent, entity *overwrites) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
+ assert(ent && is_class_type(get_entity_owner(ent)));
add_entity_overwrites(overwrites, ent);
}
-inline int
+int
get_entity_n_overwrittenby (entity *ent) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
- return (ARR_LEN (ent->overwrittenby))-1;
+ assert(ent && is_class_type(get_entity_owner(ent)));
+ return (ARR_LEN (ent->overwrittenby));
}
-inline entity *
+int
+get_entity_overwrittenby_index(entity *ent, entity *overwrites) {
+ int i;
+ assert(ent && is_class_type(get_entity_owner(ent)));
+ for (i = 0; i < get_entity_n_overwrittenby(ent); i++)
+ if (get_entity_overwrittenby(ent, i) == overwrites)
+ return i;
+ return -1;
+}
+
+entity *
get_entity_overwrittenby (entity *ent, int pos) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
+ assert(ent && is_class_type(get_entity_owner(ent)));
assert(pos < get_entity_n_overwrittenby(ent));
- return ent->overwrittenby[pos+1];
+ return ent->overwrittenby[pos];
}
-inline void
+void
set_entity_overwrittenby (entity *ent, int pos, entity *overwrites) {
- assert(ent);
- assert(is_class_type(get_entity_owner(ent)));
+ assert(ent && is_class_type(get_entity_owner(ent)));
assert(pos < get_entity_n_overwrittenby(ent));
- ent->overwrittenby[pos+1] = overwrites;
+ ent->overwrittenby[pos] = overwrites;
+}
+
+void remove_entity_overwrittenby(entity *ent, entity *overwrites) {
+ int i;
+ assert(ent && is_class_type(get_entity_owner(ent)));
+ for (i = 0; i < (ARR_LEN (ent->overwrittenby)); i++)
+ if (ent->overwrittenby[i] == overwrites) {
+ for(; i < (ARR_LEN (ent->overwrittenby))-1; i++)
+ ent->overwrittenby[i] = ent->overwrittenby[i+1];
+ ARR_SETLEN(entity*, ent->overwrittenby, ARR_LEN(ent->overwrittenby) - 1);
+ break;
+ }
}
/* A link to store intermediate information */
void *
-get_entity_link(entity *ent) {
- assert(ent);
- return ent->link;
+(get_entity_link)(entity *ent) {
+ return __get_entity_link(ent);
}
void
-set_entity_link(entity *ent, void *l) {
- assert(ent);
- ent->link = l;
+(set_entity_link)(entity *ent, void *l) {
+ __set_entity_link(ent, l);
}
-inline ir_graph *
-get_entity_irg(entity *ent) {
- assert (ent);
- assert (is_method_type(ent->type));
- return ent->irg;
+ir_graph *
+(get_entity_irg)(entity *ent) {
+ return __get_entity_irg(ent);
}
-inline void
+void
set_entity_irg(entity *ent, ir_graph *irg) {
- assert (ent && ent->type);
- assert (irg);
- assert (is_method_type(ent->type));
- assert (ent->peculiarity == existent);
+ assert(ent && is_method_type(get_entity_type(ent)));
+ /* Wie kann man die Referenz auf einen IRG löschen, z.B. wenn die
+ * Methode selbst nicht mehr aufgerufen werden kann, die Entität
+ * aber erhalten bleiben soll. */
+ /* assert(irg); */
+ assert((irg && ent->peculiarity == peculiarity_existent) ||
+ (!irg && ent->peculiarity == peculiarity_description) ||
+ (!irg && ent->peculiarity == peculiarity_inherited));
ent->irg = irg;
}
+int
+(is_entity)(void *thing) {
+ return __is_entity(thing);
+}
+
int is_atomic_entity(entity *ent) {
type* t = get_entity_type(ent);
+ assert(ent && ent->kind == k_entity);
return (is_primitive_type(t) || is_pointer_type(t) ||
- is_enumeration_type(t) || is_method_type(t));
+ is_enumeration_type(t) || is_method_type(t));
}
int is_compound_entity(entity *ent) {
type* t = get_entity_type(ent);
+ assert(ent && ent->kind == k_entity);
return (is_class_type(t) || is_struct_type(t) ||
- is_array_type(t) || is_union_type(t));
+ is_array_type(t) || is_union_type(t));
+}
+
+/**
+ * @todo not implemnted!!! */
+bool equal_entity(entity *ent1, entity *ent2) {
+ printf(" calling unimplemented equal entity!!! \n");
+ return true;
+}
+
+
+unsigned long get_entity_visited(entity *ent) {
+ assert(ent && ent->kind == k_entity);
+ return ent->visit;
+}
+void set_entity_visited(entity *ent, unsigned long num) {
+ assert(ent && ent->kind == k_entity);
+ ent->visit = num;
+}
+/* Sets visited field in entity to entity_visited. */
+void mark_entity_visited(entity *ent) {
+ assert(ent && ent->kind == k_entity);
+ ent->visit = type_visited;
+}
+
+
+bool entity_visited(entity *ent) {
+ assert(ent && ent->kind == k_entity);
+ return get_entity_visited(ent) >= type_visited;
+}
+
+bool entity_not_visited(entity *ent) {
+ assert(ent && ent->kind == k_entity);
+ return get_entity_visited(ent) < type_visited;
+}
+
+/* Need two routines because I want to assert the result. */
+static entity *resolve_ent_polymorphy2 (type *dynamic_class, entity* static_ent) {
+ int i, n_overwrittenby;
+ entity *res = NULL;
+
+ if (get_entity_owner(static_ent) == dynamic_class) return static_ent;
+
+ n_overwrittenby = get_entity_n_overwrittenby(static_ent);
+ for (i = 0; i < n_overwrittenby; ++i) {
+ res = resolve_ent_polymorphy2(dynamic_class, get_entity_overwrittenby(static_ent, i));
+ if (res) break;
+ }
+
+ return res;
+}
+
+/** Resolve polymorphy in the inheritance relation.
+ *
+ * Returns the dynamically referenced entity if the static entity and the
+ * dynamic type are given.
+ * Search downwards in overwritten tree. */
+entity *resolve_ent_polymorphy(type *dynamic_class, entity* static_ent) {
+ entity *res;
+ assert(static_ent && static_ent->kind == k_entity);
+
+ res = resolve_ent_polymorphy2(dynamic_class, static_ent);
+ if (!res) {
+ printf(" Could not find entity "); DDME(static_ent);
+ printf(" in "); DDMT(dynamic_class);
+ printf("\n");
+ dump_entity(static_ent);
+ dump_type(get_entity_owner(static_ent));
+ dump_type(dynamic_class);
+ }
+ assert(res);
+ return res;
+}
+
+
+
+/*******************************************************************/
+/** Debug aides **/
+/*******************************************************************/
+
+
+#if 1 || DEBUG_libfirm
+int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */
+
+#define X(a) case a: printf(#a); break
+void dump_entity (entity *ent) {
+ int i, j;
+ type *owner = get_entity_owner(ent);
+ type *type = get_entity_type(ent);
+ assert(ent && ent->kind == k_entity);
+ printf("entity %s (%ld)\n", get_entity_name(ent), get_entity_nr(ent));
+ printf(" type: %s (%ld)\n", get_type_name(type), get_type_nr(type));
+ printf(" owner: %s (%ld)\n", get_type_name(owner), get_type_nr(owner));
+
+ if (get_entity_n_overwrites(ent) > 0) {
+ printf (" overwrites:\n");
+ for (i = 0; i < get_entity_n_overwrites(ent); ++i) {
+ entity *ov = get_entity_overwrites(ent, i);
+ printf(" %d: %s of class %s\n", i, get_entity_name(ov), get_type_name(get_entity_owner(ov)));
+ }
+ } else {
+ printf(" Does not overwrite other entities. \n");
+ }
+ if (get_entity_n_overwrittenby(ent) > 0) {
+ printf (" overwritten by:\n");
+ for (i = 0; i < get_entity_n_overwrittenby(ent); ++i) {
+ entity *ov = get_entity_overwrittenby(ent, i);
+ printf(" %d: %s of class %s\n", i, get_entity_name(ov), get_type_name(get_entity_owner(ov)));
+ }
+ } else {
+ printf(" Is not overwriten by other entities. \n");
+ }
+
+ printf (" allocation: ");
+ switch (get_entity_allocation(ent)) {
+ X(allocation_dynamic);
+ X(allocation_automatic);
+ X(allocation_static);
+ X(allocation_parameter);
+ }
+
+ printf ("\n visibility: ");
+ switch (get_entity_visibility(ent)) {
+ X(visibility_local);
+ X(visibility_external_visible);
+ X(visibility_external_allocated);
+ }
+
+ printf ("\n variability: ");
+ switch (get_entity_variability(ent)) {
+ X(variability_uninitialized);
+ X(variability_initialized);
+ X(variability_part_constant);
+ X(variability_constant);
+ }
+
+ if (get_entity_variability(ent) != variability_uninitialized) {
+ if (is_atomic_entity(ent)) {
+ printf("\n atomic value: ");
+ dump_node_opcode(stdout, get_atomic_ent_value(ent));
+ } else {
+ printf("\n compound values:");
+ for (i = 0; i < get_compound_ent_n_values(ent); ++i) {
+ compound_graph_path *path = get_compound_ent_value_path(ent, i);
+ entity *ent0 = get_compound_graph_path_node(path, 0);
+ printf("\n %3d %s", get_entity_offset_bits(ent0), get_entity_name(ent0));
+ for (j = 1; j < get_compound_graph_path_length(path); ++j)
+ printf(".%s", get_entity_name(get_compound_graph_path_node(path, j)));
+ printf("\t = ");
+ dump_node_opcode(stdout, get_compound_ent_value(ent, i));
+ }
+ }
+ }
+
+ printf ("\n volatility: ");
+ switch (get_entity_volatility(ent)) {
+ X(volatility_non_volatile);
+ X(volatility_is_volatile);
+ }
+
+ printf("\n peculiarity: %s", get_peculiarity_string(get_entity_peculiarity(ent)));
+ printf("\n ld_name: %s", ent->ld_name ? get_entity_ld_name(ent) : "no yet set");
+ printf("\n offset: %d", get_entity_offset_bits(ent));
+ if (is_method_type(get_entity_type(ent))) {
+ if (get_entity_irg(ent)) /* can be null */
+ { printf ("\n irg = %ld", get_irg_graph_nr(get_entity_irg(ent))); }
+ else
+ { printf ("\n irg = NULL"); }
+ }
+ printf("\n\n");
}
+#undef X
+#else /* DEBUG_libfirm */
+void dump_entity (entity *ent) {}
+#endif /* DEBUG_libfirm */
projects / libfirm / blobdiff