X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Ftr%2Fentity.c;h=380ee1ef0ea3e0a51f17ec4ec9b4c1e461b5c2da;hb=d266f5722bbfd01292a2bc3a2ddf188af8a2c702;hp=9e11d054aab43e31bf94cb13d7cc8974824c7ddd;hpb=677f67f9b487e35b983148f48b933d54ee383db6;p=libfirm diff --git a/ir/tr/entity.c b/ir/tr/entity.c index 9e11d054a..380ee1ef0 100644 --- a/ir/tr/entity.c +++ b/ir/tr/entity.c @@ -1,567 +1,1448 @@ -/* Copyright (C) 1998 - 2000 by Universitaet Karlsruhe -** All rights reserved. -** -** Authors: Martin Trapp, Christian Schaefer -** -*/ - -/* $Id$ */ +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. + */ + +/** + * @file + * @brief Representation of all program known entities. + * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck + * @version $Id$ + */ +#include "config.h" + +#include +#include +#include + +#include "firm_common_t.h" + +#include "xmalloc.h" +#include "entity_t.h" +#include "array.h" +#include "irtools.h" +#include "irhooks.h" +#include "irprintf.h" + +#include "irprog_t.h" +#include "ircons.h" +#include "tv_t.h" +#include "irdump.h" +#include "irgraph_t.h" +#include "callgraph.h" +#include "error.h" + +/*-----------------------------------------------------------------*/ +/** general **/ +/*-----------------------------------------------------------------*/ + +ir_entity *unknown_entity = NULL; + +ir_entity *get_unknown_entity(void) { return unknown_entity; } + +/** The name of the unknown entity. */ +#define UNKNOWN_ENTITY_NAME "unknown_entity" + +/*-----------------------------------------------------------------*/ +/* ENTITY */ +/*-----------------------------------------------------------------*/ + +/** + * Add an entity to it's already set owner type. + */ +static inline void insert_entity_in_owner(ir_entity *ent) { + ir_type *owner = ent->owner; + switch (get_type_tpop_code(owner)) { + case tpo_class: + add_class_member(owner, ent); + break; + case tpo_struct: + add_struct_member(owner, ent); + break; + case tpo_union: + add_union_member(owner, ent); + break; + case tpo_array: + set_array_element_entity(owner, ent); + break; + default: + panic("Unsupported type kind"); + } +} /* insert_entity_in_owner */ + +/** + * 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 ir_entity * +new_rd_entity(dbg_info *db, ir_type *owner, ident *name, ir_type *type) +{ + ir_entity *res; + ir_graph *rem; + + assert(!id_contains_char(name, ' ') && "entity name should not contain spaces"); + + res = XMALLOCZ(ir_entity); + + res->kind = k_entity; + res->name = name; + res->ld_name = NULL; + res->type = type; + res->owner = owner; + + res->allocation = allocation_automatic; + res->visibility = visibility_local; + res->volatility = volatility_non_volatile; + res->align = align_is_aligned; + res->stickyness = stickyness_unsticky; + res->peculiarity = peculiarity_existent; + res->usage = ir_usage_unknown; + res->final = 0; + res->compiler_gen = 0; + res->backend_marked = 0; + res->offset = -1; + res->offset_bit_remainder = 0; + res->link = NULL; + res->repr_class = NULL; + + if (is_Method_type(type)) { + symconst_symbol sym; + ir_mode *mode = is_Method_type(type) ? mode_P_code : mode_P_data; + sym.entity_p = res; + rem = current_ir_graph; + current_ir_graph = get_const_code_irg(); + res->value = new_SymConst(mode, sym, symconst_addr_ent); + current_ir_graph = rem; + res->allocation = allocation_static; + res->variability = variability_constant; + res->attr.mtd_attr.irg_add_properties = mtp_property_inherited; + res->attr.mtd_attr.vtable_number = VTABLE_NUM_NOT_SET; + res->attr.mtd_attr.param_access = NULL; + res->attr.mtd_attr.param_weight = NULL; + res->attr.mtd_attr.irg = NULL; + } else if (is_compound_type(type)) { + res->variability = variability_uninitialized; + res->value = NULL; + res->attr.cmpd_attr.values = NULL; + res->attr.cmpd_attr.val_paths = NULL; + } else { + res->variability = variability_uninitialized; + res->value = NULL; + } + + if (is_Class_type(owner)) { + res->overwrites = NEW_ARR_F(ir_entity *, 0); + res->overwrittenby = NEW_ARR_F(ir_entity *, 0); + } else { + res->overwrites = NULL; + res->overwrittenby = NULL; + } + +#ifdef DEBUG_libfirm + res->nr = get_irp_new_node_nr(); +#endif /* DEBUG_libfirm */ + + res->visit = 0; + set_entity_dbg_info(res, db); + + return res; +} /* new_rd_entity */ + +ir_entity * +new_d_entity(ir_type *owner, ident *name, ir_type *type, dbg_info *db) { + ir_entity *res; + + assert(is_compound_type(owner)); + res = new_rd_entity(db, owner, name, type); + /* Remember entity in it's owner. */ + insert_entity_in_owner(res); + + hook_new_entity(res); + return res; +} /* new_d_entity */ + +ir_entity * +new_entity(ir_type *owner, ident *name, ir_type *type) { + return new_d_entity(owner, name, type, NULL); +} /* new_entity */ + +/** + * Free entity attributes. + * + * @param ent the entity + */ +static void free_entity_attrs(ir_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 (is_compound_entity(ent)) { + if (ent->has_initializer) { + /* TODO: free initializers */ + } else { + if (ent->attr.cmpd_attr.val_paths) { + for (i = get_compound_ent_n_values(ent) - 1; i >= 0; --i) + if (ent->attr.cmpd_attr.val_paths[i]) { + /* free_compound_graph_path(ent->attr.cmpd_attr.val_paths[i]) ; * @@@ warum nich? */ + /* Geht nich: wird mehrfach verwendet!!! ==> mehrfach frei gegeben. */ + /* DEL_ARR_F(ent->attr.cmpd_attr.val_paths); */ + } + ent->attr.cmpd_attr.val_paths = NULL; + } + if (ent->attr.cmpd_attr.values) { + /*DEL_ARR_F(ent->attr.cmpd_attr.values)*/; + } + ent->attr.cmpd_attr.values = NULL; + } + } else if (is_method_entity(ent)) { + if (ent->attr.mtd_attr.param_access) { + DEL_ARR_F(ent->attr.mtd_attr.param_access); + ent->attr.mtd_attr.param_access = NULL; + } + if (ent->attr.mtd_attr.param_weight) { + DEL_ARR_F(ent->attr.mtd_attr.param_weight); + ent->attr.mtd_attr.param_weight = NULL; + } + } +} /* free_entity_attrs */ + +/** + * Creates a deep copy of an entity. + */ +static ir_entity *deep_entity_copy(ir_entity *old) +{ + ir_entity *newe = XMALLOC(ir_entity); + + *newe = *old; + if (is_compound_entity(old)) { + if (old->has_initializer) { + /* FIXME: the initializers are NOT copied */ + } else { + newe->attr.cmpd_attr.values = NULL; + newe->attr.cmpd_attr.val_paths = NULL; + if (old->attr.cmpd_attr.values) + newe->attr.cmpd_attr.values = DUP_ARR_F(ir_node *, old->attr.cmpd_attr.values); + + /* FIXME: the compound graph paths are NOT copied */ + if (old->attr.cmpd_attr.val_paths) + newe->attr.cmpd_attr.val_paths = DUP_ARR_F(compound_graph_path *, old->attr.cmpd_attr.val_paths); + } + } else if (is_method_entity(old)) { + /* do NOT copy them, reanalyze. This might be the best solution */ + newe->attr.mtd_attr.param_access = NULL; + newe->attr.mtd_attr.param_weight = NULL; + } + +#ifdef DEBUG_libfirm + newe->nr = get_irp_new_node_nr(); +#endif + return newe; +} +/* + * Copies the entity if the new_owner is different from the + * owner of the old entity, else returns the old entity. + */ +ir_entity * +copy_entity_own(ir_entity *old, ir_type *new_owner) { + ir_entity *newe; + assert(is_entity(old)); + assert(is_compound_type(new_owner)); + assert(get_type_state(new_owner) != layout_fixed); + + if (old->owner == new_owner) + return old; + + /* create a deep copy so we are safe of aliasing and double-freeing. */ + newe = deep_entity_copy(old); + newe->owner = new_owner; + + if (is_Class_type(new_owner)) { + newe->overwrites = NEW_ARR_F(ir_entity *, 0); + newe->overwrittenby = NEW_ARR_F(ir_entity *, 0); + } + + insert_entity_in_owner(newe); + return newe; +} /* copy_entity_own */ + +ir_entity * +copy_entity_name(ir_entity *old, ident *new_name) { + ir_entity *newe; + assert(old && old->kind == k_entity); + + if (old->name == new_name) return old; + newe = deep_entity_copy(old); + newe->name = new_name; + newe->ld_name = NULL; + + if (is_Class_type(newe->owner)) { + newe->overwrites = DUP_ARR_F(ir_entity *, old->overwrites); + newe->overwrittenby = DUP_ARR_F(ir_entity *, old->overwrittenby); + } + insert_entity_in_owner(newe); + + return newe; +} /* copy_entity_name */ -#ifdef HAVE_CONFIG_H -# include +void +free_entity(ir_entity *ent) { + assert(ent && ent->kind == k_entity); + free_entity_attrs(ent); + ent->kind = k_BAD; + free(ent); +} /* free_entity */ + +/* Outputs a unique number for this node */ +long +get_entity_nr(const ir_entity *ent) { + assert(ent && ent->kind == k_entity); +#ifdef DEBUG_libfirm + return ent->nr; +#else + return (long)PTR_TO_INT(ent); #endif +} /* get_entity_nr */ -# include -# include -# include +const char * +(get_entity_name)(const ir_entity *ent) { + return _get_entity_name(ent); +} /* get_entity_name */ -# include "entity_t.h" -# include "mangle.h" -# include "typegmod_t.h" -# include "array.h" -/* All this is needed to build the constant node for methods: */ -# include "irprog.h" -# include "ircons.h" +ident * +(get_entity_ident)(const ir_entity *ent) { + return _get_entity_ident(ent); +} /* get_entity_ident */ -/*******************************************************************/ -/** general **/ -/*******************************************************************/ +void +(set_entity_ident)(ir_entity *ent, ident *id) { + _set_entity_ident(ent, id); +} /* set_entity_ident */ + +ir_type * +(get_entity_owner)(ir_entity *ent) { + return _get_entity_owner(ent); +} /* get_entity_owner */ void -init_entity (void) -{ -} +set_entity_owner(ir_entity *ent, ir_type *owner) { + assert(is_entity(ent)); + assert(is_compound_type(owner)); + ent->owner = owner; +} /* set_entity_owner */ -/*******************************************************************/ -/** ENTITY **/ -/*******************************************************************/ - -INLINE type *get_entity_owner (entity *ent); - -INLINE void insert_entity_in_owner (entity *ent) { - type *owner = ent->owner; - switch (get_type_tpop_code(owner)) { - case tpo_class: { - add_class_member (owner, ent); - } break; - case tpo_struct: { - add_struct_member (owner, ent); - } break; - case tpo_union: { - add_union_member (owner, ent); - } break; - case tpo_array: { - set_array_element_entity(owner, ent); - } break; - default: assert(0); - } -} +ident * +(get_entity_ld_ident)(ir_entity *ent) { + return _get_entity_ld_ident(ent); +} /* get_entity_ld_ident */ + +void +(set_entity_ld_ident)(ir_entity *ent, ident *ld_ident) { + _set_entity_ld_ident(ent, ld_ident); +} /* set_entity_ld_ident */ + +const char * +(get_entity_ld_name)(ir_entity *ent) { + return _get_entity_ld_name(ent); +} /* get_entity_ld_name */ + +ir_type * +(get_entity_type)(ir_entity *ent) { + return _get_entity_type(ent); +} /* get_entity_type */ + +void +(set_entity_type)(ir_entity *ent, ir_type *type) { + _set_entity_type(ent, type); +} /* set_entity_type */ -entity * -new_entity (type *owner, ident *name, type *type) +ir_allocation +(get_entity_allocation)(const ir_entity *ent) { + return _get_entity_allocation(ent); +} /* get_entity_allocation */ + +void +(set_entity_allocation)(ir_entity *ent, ir_allocation al) { + _set_entity_allocation(ent, al); +} /* set_entity_allocation */ + +/* return the name of the visibility */ +const char *get_allocation_name(ir_allocation all) { - entity *res; - ir_graph *rem; - - res = (entity *) malloc (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; - else - res->allocation = automatic_allocated; - res->visibility = local; - res->offset = -1; - if (is_method_type(type)) { - res->variability = constant; - rem = current_ir_graph; - current_ir_graph = get_const_code_irg(); - res->value = new_Const(mode_p, tarval_p_from_entity(res)); - current_ir_graph = rem; - } else { - res->variability = uninitialized; - } - 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; - - res->visit = 0; - - /* Remember entity in it's owner. */ - insert_entity_in_owner (res); - return res; -} -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; -} -INLINE void free_entity_attrs(entity *ent) { - assert(ent); - if (get_type_tpop(get_entity_owner(ent)) == type_class) { - DEL_ARR_F(ent->overwrites); - DEL_ARR_F(ent->overwrittenby); - } -} +#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 +} /* get_allocation_name */ + +ir_visibility +(get_entity_visibility)(const ir_entity *ent) { + return _get_entity_visibility(ent); +} /* get_entity_visibility */ -entity * -copy_entity_own (entity *old, type *new_owner) { - entity *new; - - assert_legal_owner_of_ent(new_owner); - if (old->owner == new_owner) return old; - new = (entity *) malloc (sizeof (entity)); - memcpy (new, old, sizeof (entity)); - new->owner = new_owner; - if ((get_type_tpop(get_entity_owner(old)) == type_class) && - (get_type_tpop(new_owner) == type_class)) { - new->overwrites = DUP_ARR_F(entity *, old->overwrites); - new->overwrittenby = DUP_ARR_F(entity *, old->overwrittenby); - } else if ((get_type_tpop(get_entity_owner(old)) != type_class) && - (get_type_tpop(new_owner) == type_class)) { - new->overwrites = NEW_ARR_F(entity *, 1); - new->overwrittenby = NEW_ARR_F(entity *, 1); - } - - insert_entity_in_owner (new); - - return new; -} +void +set_entity_visibility(ir_entity *ent, ir_visibility vis) { + 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; +} /* set_entity_visibility */ + +/* return the name of the visibility */ +const char *get_visibility_name(ir_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 +} /* get_visibility_name */ + +ir_variability +(get_entity_variability)(const ir_entity *ent) { + return _get_entity_variability(ent); +} /* get_entity_variability */ -entity * -copy_entity_name (entity *old, ident *new_name) { - entity *new; +void +set_entity_variability(ir_entity *ent, ir_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 == variability_uninitialized) && (var != variability_uninitialized)) { + /* Allocate data structures for constant values */ + ent->attr.cmpd_attr.values = NEW_ARR_F(ir_node *, 0); + ent->attr.cmpd_attr.val_paths = NEW_ARR_F(compound_graph_path *, 0); + } + if ((is_atomic_type(ent->type)) && + (ent->variability == variability_uninitialized) && (var != variability_uninitialized)) { + /* Set default constant value. */ + ent->value = new_rd_Unknown(get_const_code_irg(), get_type_mode(ent->type)); + } + + if ((is_compound_type(ent->type)) && + (var == variability_uninitialized) && (ent->variability != variability_uninitialized)) { + /* Free data structures for constant values */ + DEL_ARR_F(ent->attr.cmpd_attr.values); ent->attr.cmpd_attr.values = NULL; + DEL_ARR_F(ent->attr.cmpd_attr.val_paths); ent->attr.cmpd_attr.val_paths = NULL; + } + ent->variability = var; +} /* set_entity_variability */ + +/* return the name of the variability */ +const char *get_variability_name(ir_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 +} /* get_variability_name */ + +ir_volatility +(get_entity_volatility)(const ir_entity *ent) { + return _get_entity_volatility(ent); +} /* get_entity_volatility */ - if (old->name == new_name) return old; - new = (entity *) malloc (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); +void +(set_entity_volatility)(ir_entity *ent, ir_volatility vol) { + _set_entity_volatility(ent, vol); +} /* set_entity_volatility */ - insert_entity_in_owner (new); +/* Return the name of the volatility. */ +const char *get_volatility_name(ir_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 +} /* get_volatility_name */ + +ir_align +(get_entity_align)(const ir_entity *ent) { + return _get_entity_align(ent); +} /* get_entity_align */ - return new; -} +void +(set_entity_align)(ir_entity *ent, ir_align a) { + _set_entity_align(ent, a); +} /* set_entity_align */ + +/* Return the name of the alignment. */ +const char *get_align_name(ir_align a) +{ +#define X(a) case a: return #a + switch (a) { + X(align_non_aligned); + X(align_is_aligned); + default: return "BAD VALUE"; + } +#undef X +} /* get_align_name */ + +ir_peculiarity +(get_entity_peculiarity)(const ir_entity *ent) { + return _get_entity_peculiarity(ent); +} /* get_entity_peculiarity */ void -free_entity (entity *ent) { - free_entity_attrs(ent); - free(ent); +(set_entity_peculiarity)(ir_entity *ent, ir_peculiarity pec) { + _set_entity_peculiarity(ent, pec); +} /* set_entity_peculiarity */ + +/* Checks if an entity cannot be overridden anymore. */ +int (is_entity_final)(const ir_entity *ent) { + return _is_entity_final(ent); +} /* is_entity_final */ + +/* Sets/resets the final flag of an entity. */ +void (set_entity_final)(ir_entity *ent, int final) { + _set_entity_final(ent, final); +} /* set_entity_final */ + +/* Checks if an entity is compiler generated */ +int (is_entity_compiler_generated)(const ir_entity *ent) { + return _is_entity_compiler_generated(ent); +} /* is_entity_compiler_generated */ + +/* Sets/resets the compiler generated flag */ +void (set_entity_compiler_generated)(ir_entity *ent, int flag) { + _set_entity_compiler_generated(ent, flag); +} /* set_entity_compiler_generated */ + +/* Checks if an entity is marked by the backend */ +int (is_entity_backend_marked)(const ir_entity *ent) { + return _is_entity_backend_marked(ent); +} /* is_entity_backend_marked */ + +/* Sets/resets the compiler generated flag */ +void (set_entity_backend_marked)(ir_entity *ent, int flag) { + _set_entity_backend_marked(ent, flag); +} /* set_entity_backend_marked */ + +ir_entity_usage (get_entity_usage)(const ir_entity *ent) { + return _get_entity_usage(ent); } -INLINE const char * -get_entity_name (entity *ent) { - assert (ent); - return id_to_str(get_entity_ident(ent)); +void (set_entity_usage)(ir_entity *ent, ir_entity_usage flags) { + _set_entity_usage(ent, flags); } -ident * -get_entity_ident (entity *ent) { - assert(ent); - return ent->name; -} +/* Get the entity's stickyness */ +ir_stickyness +(get_entity_stickyness)(const ir_entity *ent) { + return _get_entity_stickyness(ent); +} /* get_entity_stickyness */ -/* -void set_entitye_ld_name (entity *, char *ld_name); -void set_entity_ld_ident (entity *, ident *ld_ident); -*/ +/* Set the entity's stickyness */ +void +(set_entity_stickyness)(ir_entity *ent, ir_stickyness stickyness) { + _set_entity_stickyness(ent, stickyness); +} /* set_entity_stickyness */ -INLINE type * -get_entity_owner (entity *ent) { - return ent->owner = skip_tid(ent->owner); -} +/* Set has no effect for existent entities of type method. */ +ir_node * +get_atomic_ent_value(ir_entity *ent) +{ + assert(ent && is_atomic_entity(ent)); + assert(ent->variability != variability_uninitialized); + return skip_Id(ent->value); +} /* get_atomic_ent_value */ -INLINE void -set_entity_owner (entity *ent, type *owner) { - assert_legal_owner_of_ent(owner); - ent->owner = owner; -} +void +set_atomic_ent_value(ir_entity *ent, ir_node *val) { + assert(is_atomic_entity(ent) && (ent->variability != variability_uninitialized)); + if (is_Method_type(ent->type) && (ent->peculiarity == peculiarity_existent)) + return; + assert(get_irn_mode(val) == get_type_mode(ent->type)); + ent->value = val; +} /* set_atomic_ent_value */ + +/* 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; + + /* we are in danger iff an exception will arise. TODO: be more precisely, + * for instance Div. will NOT rise if divisor != 0 + */ + if (is_binop(n) && !is_fragile_op(n)) + return is_irn_const_expression(get_binop_left(n)) && is_irn_const_expression(get_binop_right(n)); + + m = get_irn_mode(n); + switch (get_irn_opcode(n)) { + case iro_Const: + case iro_SymConst: + case iro_Unknown: + return 1; + case iro_Conv: + case iro_Cast: + return is_irn_const_expression(get_irn_n(n, 0)); + default: + break; + } + return 0; +} /* is_irn_const_expression */ -INLINE void /* should this go into type.c? */ -assert_legal_owner_of_ent(type *owner) { - 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! */ +/* + * 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; + + /* @@@ GL I think we should implement this using the routines from irgopt for + dead node elimination/inlineing. */ + + m = get_irn_mode(n); + switch (get_irn_opcode(n)) { + case iro_Const: + nn = new_d_Const_type(dbg, get_Const_tarval(n), get_Const_type(n)); + break; + case iro_SymConst: + nn = new_d_SymConst_type(dbg, get_irn_mode(n), get_SymConst_symbol(n), get_SymConst_kind(n), + get_SymConst_value_type(n)); + break; + case iro_Add: + 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_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_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_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_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_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_d_Cast(dbg, copy_const_value(dbg, get_Cast_op(n)), get_Cast_type(n)); break; + case iro_Conv: + nn = new_d_Conv(dbg, copy_const_value(dbg, get_Conv_op(n)), m); break; + case iro_Unknown: + nn = new_d_Unknown(m); break; + default: + assert(0 && "opcode invalid or not implemented"); + nn = NULL; + break; + } + return nn; +} /* copy_const_value */ + +static ir_initializer_t null_initializer = { IR_INITIALIZER_NULL }; + +ir_initializer_t *get_initializer_null(void) +{ + return &null_initializer; } -INLINE ident * -get_entity_ld_ident (entity *ent) +ir_initializer_t *create_initializer_const(ir_node *value) { - if (ent->ld_name == NULL) - ent->ld_name = mangle_entity (ent); - return ent->ld_name; -} + struct obstack *obst = get_irg_obstack(get_const_code_irg()); -INLINE void -set_entity_ld_ident (entity *ent, ident *ld_ident) { - ent->ld_name = ld_ident; -} + ir_initializer_t *initializer + = obstack_alloc(obst, sizeof(ir_initializer_const_t)); + initializer->kind = IR_INITIALIZER_CONST; + initializer->consti.value = value; -INLINE const char * -get_entity_ld_name (entity *ent) { - return id_to_str(get_entity_ld_ident(ent)); + return initializer; } -/* -char *get_entity_ld_name (entity *); -void set_entity_ld_name (entity *, char *ld_name); -*/ +ir_initializer_t *create_initializer_tarval(tarval *tv) +{ + struct obstack *obst = get_irg_obstack(get_const_code_irg()); -INLINE type * -get_entity_type (entity *ent) { - return ent->type = skip_tid(ent->type); -} + ir_initializer_t *initializer + = obstack_alloc(obst, sizeof(ir_initializer_tarval_t)); + initializer->kind = IR_INITIALIZER_TARVAL; + initializer->tarval.value = tv; -INLINE void -set_entity_type (entity *ent, type *type) { - ent->type = type; + return initializer; } +ir_initializer_t *create_initializer_compound(unsigned n_entries) +{ + struct obstack *obst = get_irg_obstack(get_const_code_irg()); -INLINE ent_allocation -get_entity_allocation (entity *ent) { - return ent->allocation; -} + size_t i; + size_t size = sizeof(ir_initializer_compound_t) + + (n_entries-1) * sizeof(ir_initializer_t*); -INLINE void -set_entity_allocation (entity *ent, ent_allocation al) { - ent->allocation = al; -} + ir_initializer_t *initializer = obstack_alloc(obst, size); + initializer->kind = IR_INITIALIZER_COMPOUND; + initializer->compound.n_initializers = n_entries; + for(i = 0; i < n_entries; ++i) { + initializer->compound.initializers[i] = get_initializer_null(); + } -INLINE ent_visibility -get_entity_visibility (entity *ent) { - return ent->visibility; + return initializer; } -INLINE void -set_entity_visibility (entity *ent, ent_visibility vis) { - if (vis != local) assert(ent->allocation == static_allocated); - ent->visibility = vis; +ir_node *get_initializer_const_value(const ir_initializer_t *initializer) +{ + assert(initializer->kind == IR_INITIALIZER_CONST); + return skip_Id(initializer->consti.value); } -INLINE ent_variability -get_entity_variability (entity *ent) { - return ent->variability; +tarval *get_initializer_tarval_value(const ir_initializer_t *initializer) +{ + assert(initializer->kind == IR_INITIALIZER_TARVAL); + return initializer->tarval.value; } -INLINE void -set_entity_variability (entity *ent, ent_variability var){ - if (var == part_constant) - assert(is_class_type(ent->type) || is_struct_type(ent->type)); - if ((is_compound_type(ent->type)) && - (ent->variability == uninitialized) && (var != uninitialized)) { - /* Allocate datastructures for constant values */ - ent->values = NEW_ARR_F(ir_node *, 1); - ent->val_ents = NEW_ARR_F(entity *, 1); - } - if ((is_compound_type(ent->type)) && - (var == uninitialized) && (ent->variability != uninitialized)) { - /* Free datastructures for constant values */ - DEL_ARR_F(ent->values); - DEL_ARR_F(ent->val_ents); - } - ent->variability = var; +unsigned get_initializer_compound_n_entries(const ir_initializer_t *initializer) +{ + assert(initializer->kind == IR_INITIALIZER_COMPOUND); + return initializer->compound.n_initializers; } +void set_initializer_compound_value(ir_initializer_t *initializer, + unsigned index, ir_initializer_t *value) +{ + assert(initializer->kind == IR_INITIALIZER_COMPOUND); + assert(index < initializer->compound.n_initializers); -INLINE ent_volatility -get_entity_volatility (entity *ent) { - assert (ent); - return ent->volatility; + initializer->compound.initializers[index] = value; } -INLINE void -set_entity_volatility (entity *ent, ent_volatility vol) { - assert (ent); - ent->volatility = vol; +ir_initializer_t *get_initializer_compound_value( + const ir_initializer_t *initializer, unsigned index) +{ + assert(initializer->kind == IR_INITIALIZER_COMPOUND); + assert(index < initializer->compound.n_initializers); + + return initializer->compound.initializers[index]; } -INLINE peculiarity -get_entity_peculiarity (entity *ent) { - assert (ent); - return ent->peculiarity; +ir_initializer_kind_t get_initializer_kind(const ir_initializer_t *initializer) +{ + return initializer->kind; } -INLINE void -set_entity_peculiarity (entity *ent, peculiarity pec) { - assert (ent); - /* @@@ why peculiarity only for methods? */ - assert (is_method_type(ent->type)); - ent->peculiarity = pec; +static void check_entity_initializer(ir_entity *entity) +{ + /* TODO */ + (void) entity; } -/* 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; +void set_entity_initializer(ir_entity *entity, ir_initializer_t *initializer) +{ + entity->attr.initializer = initializer; + entity->has_initializer = 1; + check_entity_initializer(entity); } -INLINE 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; - ent->value = val; +ir_initializer_t *get_entity_initializer(const ir_entity *entity) +{ + assert(entity->has_initializer); + return entity->attr.initializer; } +/* Creates a new compound graph path. */ +compound_graph_path * +new_compound_graph_path(ir_type *tp, int length) { + compound_graph_path *res; + + assert(is_compound_type(tp)); + assert(length > 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; + + return res; +} /* new_compound_graph_path */ + +/* Frees an graph path object */ +void free_compound_graph_path (compound_graph_path *gr) { + assert(gr && is_compound_graph_path(gr)); + gr->kind = k_BAD; + free(gr); +} /* free_compound_graph_path */ + +/* Returns non-zero if an object is a compound graph path */ +int is_compound_graph_path(const void *thing) { + return (get_kind(thing) == k_ir_compound_graph_path); +} /* is_compound_graph_path */ + +/* Checks whether the path up to pos is correct. If the path contains a NULL, + * assumes the path is not complete and returns 'true'. */ +int is_proper_compound_graph_path(compound_graph_path *gr, int pos) { + int i; + ir_entity *node; + ir_type *owner = gr->tp; + + for (i = 0; i <= pos; i++) { + node = get_compound_graph_path_node(gr, i); + if (node == NULL) + /* Path not yet complete. */ + return 1; + if (get_entity_owner(node) != owner) + return 0; + owner = get_entity_type(node); + } + if (pos == get_compound_graph_path_length(gr)) + if (!is_atomic_type(owner)) + return 0; + return 1; +} /* is_proper_compound_graph_path */ + +/* Returns the length of a graph path */ +int get_compound_graph_path_length(const compound_graph_path *gr) { + assert(gr && is_compound_graph_path(gr)); + return gr->len; +} /* get_compound_graph_path_length */ + +ir_entity * +get_compound_graph_path_node(const compound_graph_path *gr, int pos) { + assert(gr && is_compound_graph_path(gr)); + assert(pos >= 0 && pos < gr->len); + return gr->list[pos].node; +} /* get_compound_graph_path_node */ -ir_node *copy_const_value(ir_node *n) { - ir_node *nn; - ir_mode *m; - - m = get_irn_mode(n); - switch(get_irn_opcode(n)) { - 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; - case iro_Add: - nn = new_Add(copy_const_value(get_Add_left(n)), copy_const_value(get_Add_right(n)), m); break; - default: - assert(0 && "opdope invalid or not implemented"); break; - } - return nn; -} +void +set_compound_graph_path_node(compound_graph_path *gr, int pos, ir_entity *node) { + assert(gr && is_compound_graph_path(gr)); + assert(pos >= 0 && pos < gr->len); + assert(is_entity(node)); + gr->list[pos].node = node; + assert(is_proper_compound_graph_path(gr, pos)); +} /* set_compound_graph_path_node */ + +int +get_compound_graph_path_array_index(const compound_graph_path *gr, int pos) { + assert(gr && is_compound_graph_path(gr)); + assert(pos >= 0 && pos < gr->len); + return gr->list[pos].index; +} /* get_compound_graph_path_array_index */ -/* A value of a compound entity is a pair of value and the corresponding 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)); - ARR_APP1 (ir_node *, ent->values, val); - ARR_APP1 (entity *, ent->val_ents, member); +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->list[pos].index = index; +} /* set_compound_graph_path_array_index */ + +ir_type * +get_compound_graph_path_type(const compound_graph_path *gr) { + assert(gr && is_compound_graph_path(gr)); + return gr->tp; } -/* 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. -INLINE 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) != uninitialized); - current_ir_graph = get_const_code_irg(); - - val = copy_const_value(val); - add_compound_ent_value(ent, val, member); - current_ir_graph = rem; - }*/ - -INLINE int -get_compound_ent_n_values(entity *ent) { - assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized)); - return (ARR_LEN (ent->values))-1; -} +/* A value of a compound entity is a pair of value and the corresponding path to a member of + the compound. */ +void +add_compound_ent_value_w_path(ir_entity *ent, ir_node *val, compound_graph_path *path) { + assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized)); + assert(is_compound_graph_path(path)); + ARR_APP1(ir_node *, ent->attr.cmpd_attr.values, val); + ARR_APP1(compound_graph_path *, ent->attr.cmpd_attr.val_paths, path); +} /* add_compound_ent_value_w_path */ -INLINE ir_node * -get_compound_ent_value(entity *ent, int pos) { - assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized)); - return ent->values[pos+1]; -} +void +set_compound_ent_value_w_path(ir_entity *ent, ir_node *val, compound_graph_path *path, int pos) { + assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized)); + assert(is_compound_graph_path(path)); + assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.values)); + ent->attr.cmpd_attr.values[pos] = val; + ent->attr.cmpd_attr.val_paths[pos] = path; +} /* set_compound_ent_value_w_path */ + +int +get_compound_ent_n_values(ir_entity *ent) { + assert(!ent->has_initializer); + assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized)); + return ARR_LEN(ent->attr.cmpd_attr.values); +} /* get_compound_ent_n_values */ -/* 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_const_value(ent->values[pos+1]); - }*/ - -INLINE 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]; -} +get_compound_ent_value(ir_entity *ent, int pos) { + assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized)); + assert(!ent->has_initializer); + assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.values)); + return ent->attr.cmpd_attr.values[pos]; +} /* get_compound_ent_value */ + +compound_graph_path * +get_compound_ent_value_path(ir_entity *ent, int pos) { + assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized)); + assert(!ent->has_initializer); + assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.val_paths)); + return ent->attr.cmpd_attr.val_paths[pos]; +} /* get_compound_ent_value_path */ + +/** + * Returns non-zero, if two compound_graph_pathes are equal + * + * @param path1 the first path + * @param path2 the second path + */ +static int equal_paths(compound_graph_path *path1, compound_graph_path *path2) { + int i; + int len1 = get_compound_graph_path_length(path1); + int len2 = get_compound_graph_path_length(path2); + + if (len2 != len1) return 0; + + for (i = 0; i < len1; i++) { + ir_type *tp; + ir_entity *node1 = get_compound_graph_path_node(path1, i); + ir_entity *node2 = get_compound_graph_path_node(path2, i); + + if (node1 != node2) return 0; + + tp = get_entity_owner(node1); + if (is_Array_type(tp)) { + int index1 = get_compound_graph_path_array_index(path1, i); + int index2 = get_compound_graph_path_array_index(path2, i); + if (index1 != index2) + return 0; + } + } + return 1; +} /* equal_paths */ + +/** + * Returns the position of a value with the given path. + * The path must contain array indices for all array element entities. + * + * @todo This implementation is very slow (O(number of initializers * |path|) + * and should be replaced when the new tree oriented + * value representation is finally implemented. + */ +static int get_compound_ent_pos_by_path(ir_entity *ent, compound_graph_path *path) { + int i, n_paths = get_compound_ent_n_values(ent); + + for (i = 0; i < n_paths; i ++) { + compound_graph_path *gr = get_compound_ent_value_path(ent, i); + if (equal_paths(gr, path)) + return i; + } + return -1; +} /* get_compound_ent_pos_by_path */ + +/* Returns a constant value given the access path. + * The path must contain array indices for all array element entities. */ +ir_node *get_compound_ent_value_by_path(ir_entity *ent, compound_graph_path *path) { + int pos = get_compound_ent_pos_by_path(ent, path); + if (pos >= 0) + return get_compound_ent_value(ent, pos); + return NULL; +} /* get_compound_ent_value_by_path */ -INLINE 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; -} void -remove_compound_ent_value(entity *ent, entity *value_ent) { - int i; - assert(ent && is_compound_entity(ent) && (ent->variability != uninitialized)); - for (i = 1; i < (ARR_LEN (ent->val_ents)); i++) { - if (ent->val_ents[i] == value_ent) { - for(; i < (ARR_LEN (ent->val_ents))-1; i++) { - ent->val_ents[i] = ent->val_ents[i+1]; - ent->values[i] = ent->values[i+1]; - } - ARR_SETLEN(entity*, ent->val_ents, ARR_LEN(ent->val_ents) - 1); - ARR_SETLEN(ir_node*, ent->values, ARR_LEN(ent->values) - 1); - break; - } - } -} +remove_compound_ent_value(ir_entity *ent, ir_entity *value_ent) { + int i, n; + assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized)); + + n = ARR_LEN(ent->attr.cmpd_attr.val_paths); + for (i = 0; i < n; ++i) { + compound_graph_path *path = ent->attr.cmpd_attr.val_paths[i]; + if (path->list[path->len-1].node == value_ent) { + for (; i < n - 1; ++i) { + ent->attr.cmpd_attr.val_paths[i] = ent->attr.cmpd_attr.val_paths[i+1]; + ent->attr.cmpd_attr.values[i] = ent->attr.cmpd_attr.values[i+1]; + } + ARR_SETLEN(ir_entity*, ent->attr.cmpd_attr.val_paths, n - 1); + ARR_SETLEN(ir_node*, ent->attr.cmpd_attr.values, n - 1); + break; + } + } +} /* remove_compound_ent_value */ void -set_array_entity_values(entity *ent, tarval **values, int num_vals) { - int i; - ir_graph *rem = current_ir_graph; - type *arrtp = get_entity_type(ent); - ir_node *val; - - assert(is_array_type(arrtp)); - assert(get_array_n_dimensions(arrtp) == 1); - /* 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) != 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]); - add_compound_ent_value(ent, val, get_array_element_entity(arrtp)); - } - current_ir_graph = rem; -} +add_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member) { + compound_graph_path *path; + ir_type *owner_tp = get_entity_owner(member); + assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized)); + 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, n; + + assert(get_array_n_dimensions(owner_tp) == 1 && has_array_lower_bound(owner_tp, 0)); + max = get_array_lower_bound_int(owner_tp, 0) -1; + for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) { + int index = get_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0); + if (index > max) { + max = index; + } + } + path->list[0].index = max + 1; + } + add_compound_ent_value_w_path(ent, val, path); +} /* add_compound_ent_value */ + + +ir_entity * +get_compound_ent_value_member(ir_entity *ent, int pos) { + 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); +} /* get_compound_ent_value_member */ -INLINE int -get_entity_offset (entity *ent) { - return ent->offset; -} +void +set_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member, int pos) { + 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); +} /* set_compound_ent_value */ -INLINE void -set_entity_offset (entity *ent, int offset) { - ent->offset = offset; -} +void +set_array_entity_values(ir_entity *ent, tarval **values, int num_vals) { + int i; + ir_graph *rem = current_ir_graph; + ir_type *arrtp = get_entity_type(ent); + ir_node *val; + ir_type *elttp = get_array_element_type(arrtp); + + assert(is_Array_type(arrtp)); + assert(get_array_n_dimensions(arrtp) == 1); + /* One bound is sufficient, the number 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_type(values[i], elttp); + add_compound_ent_value(ent, val, get_array_element_entity(arrtp)); + set_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0, i); + } + current_ir_graph = rem; +} /* set_array_entity_values */ + +/* Return the overall offset of value at position pos in bytes. */ +unsigned get_compound_ent_value_offset_bytes(ir_entity *ent, int pos) { + compound_graph_path *path; + int path_len, i; + unsigned offset = 0; + ir_type *curr_tp; + + assert(get_type_state(get_entity_type(ent)) == layout_fixed); + + path = get_compound_ent_value_path(ent, pos); + path_len = get_compound_graph_path_length(path); + curr_tp = path->tp; + + for (i = 0; i < path_len; ++i) { + if (is_Array_type(curr_tp)) { + ir_type *elem_type = get_array_element_type(curr_tp); + unsigned size = get_type_size_bytes(elem_type); + unsigned align = get_type_alignment_bytes(elem_type); + int idx; + + assert(size > 0); + if(size % align > 0) { + size += align - (size % align); + } + idx = get_compound_graph_path_array_index(path, i); + assert(idx >= 0); + offset += size * idx; + curr_tp = elem_type; + } else { + ir_entity *node = get_compound_graph_path_node(path, i); + offset += get_entity_offset(node); + curr_tp = get_entity_type(node); + } + } + + return offset; +} /* get_compound_ent_value_offset_bytes */ + +/* Return the offset in bits from the last byte address. */ +unsigned get_compound_ent_value_offset_bit_remainder(ir_entity *ent, int pos) { + compound_graph_path *path; + int path_len; + ir_entity *last_node; + + assert(get_type_state(get_entity_type(ent)) == layout_fixed); + + path = get_compound_ent_value_path(ent, pos); + path_len = get_compound_graph_path_length(path); + last_node = get_compound_graph_path_node(path, path_len - 1); + + if(last_node == NULL) + return 0; + + return get_entity_offset_bits_remainder(last_node); +} /* get_compound_ent_value_offset_bit_remainder */ + +int +(get_entity_offset)(const ir_entity *ent) { + return _get_entity_offset(ent); +} /* get_entity_offset */ -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)(ir_entity *ent, int offset) { + _set_entity_offset(ent, offset); +} /* set_entity_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; -} +unsigned char +(get_entity_offset_bits_remainder)(const ir_entity *ent) { + return _get_entity_offset_bits_remainder(ent); +} /* get_entity_offset_bits_remainder */ -INLINE entity * -get_entity_overwrites (entity *ent, int pos) { - assert(ent); - assert(is_class_type(get_entity_owner(ent))); - assert(pos < get_entity_n_overwrites(ent)); - return ent->overwrites[pos+1]; -} +void +(set_entity_offset_bits_remainder)(ir_entity *ent, unsigned char offset) { + _set_entity_offset_bits_remainder(ent, offset); +} /* set_entity_offset_bits_remainder */ -INLINE void -set_entity_overwrites (entity *ent, int pos, entity *overwritten) { - assert(ent); - assert(is_class_type(get_entity_owner(ent))); - assert(pos < get_entity_n_overwrites(ent)); - ent->overwrites[pos+1] = overwritten; -} +void +add_entity_overwrites(ir_entity *ent, ir_entity *overwritten) { +#ifndef NDEBUG + ir_type *owner = get_entity_owner(ent); + ir_type *ovw_ovner = get_entity_owner(overwritten); + assert(is_Class_type(owner)); + assert(is_Class_type(ovw_ovner)); + assert(! is_class_final(ovw_ovner)); +#endif /* NDEBUG */ + ARR_APP1(ir_entity *, ent->overwrites, overwritten); + ARR_APP1(ir_entity *, overwritten->overwrittenby, ent); +} /* add_entity_overwrites */ + +int +get_entity_n_overwrites(ir_entity *ent) { + assert(is_Class_type(get_entity_owner(ent))); + return (ARR_LEN(ent->overwrites)); +} /* get_entity_n_overwrites */ + +int +get_entity_overwrites_index(ir_entity *ent, ir_entity *overwritten) { + int i, n; + assert(is_Class_type(get_entity_owner(ent))); + n = get_entity_n_overwrites(ent); + for (i = 0; i < n; ++i) { + if (get_entity_overwrites(ent, i) == overwritten) + return i; + } + return -1; +} /* get_entity_overwrites_index */ + +ir_entity * +get_entity_overwrites(ir_entity *ent, int pos) { + assert(is_Class_type(get_entity_owner(ent))); + assert(pos < get_entity_n_overwrites(ent)); + return ent->overwrites[pos]; +} /* get_entity_overwrites */ -INLINE void -add_entity_overwrittenby (entity *ent, entity *overwrites) { - assert(ent); - assert(is_class_type(get_entity_owner(ent))); - add_entity_overwrites(overwrites, ent); -} +void +set_entity_overwrites(ir_entity *ent, int pos, ir_entity *overwritten) { + assert(is_Class_type(get_entity_owner(ent))); + assert(pos < get_entity_n_overwrites(ent)); + ent->overwrites[pos] = overwritten; +} /* set_entity_overwrites */ -INLINE int -get_entity_n_overwrittenby (entity *ent) { - assert(ent); - assert(is_class_type(get_entity_owner(ent))); - return (ARR_LEN (ent->overwrittenby))-1; -} +void +remove_entity_overwrites(ir_entity *ent, ir_entity *overwritten) { + int i, n; + assert(is_Class_type(get_entity_owner(ent))); + n = ARR_LEN(ent->overwrites); + for (i = 0; i < n; ++i) { + if (ent->overwrites[i] == overwritten) { + for (; i < n - 1; i++) + ent->overwrites[i] = ent->overwrites[i+1]; + ARR_SETLEN(ir_entity*, ent->overwrites, n - 1); + break; + } + } +} /* remove_entity_overwrites */ -INLINE entity * -get_entity_overwrittenby (entity *ent, int pos) { - assert(ent); - assert(is_class_type(get_entity_owner(ent))); - assert(pos < get_entity_n_overwrittenby(ent)); - return ent->overwrittenby[pos+1]; -} +void +add_entity_overwrittenby(ir_entity *ent, ir_entity *overwrites) { + add_entity_overwrites(overwrites, ent); +} /* add_entity_overwrittenby */ + +int +get_entity_n_overwrittenby(ir_entity *ent) { + assert(is_Class_type(get_entity_owner(ent))); + return ARR_LEN(ent->overwrittenby); +} /* get_entity_n_overwrittenby */ + +int +get_entity_overwrittenby_index(ir_entity *ent, ir_entity *overwrites) { + int i, n; + assert(is_Class_type(get_entity_owner(ent))); + n = get_entity_n_overwrittenby(ent); + for (i = 0; i < n; ++i) { + if (get_entity_overwrittenby(ent, i) == overwrites) + return i; + } + return -1; +} /* get_entity_overwrittenby_index */ + +ir_entity * +get_entity_overwrittenby(ir_entity *ent, int pos) { + assert(is_Class_type(get_entity_owner(ent))); + assert(pos < get_entity_n_overwrittenby(ent)); + return ent->overwrittenby[pos]; +} /* get_entity_overwrittenby */ -INLINE void -set_entity_overwrittenby (entity *ent, int pos, entity *overwrites) { - assert(ent); - assert(is_class_type(get_entity_owner(ent))); - assert(pos < get_entity_n_overwrittenby(ent)); - ent->overwrittenby[pos+1] = overwrites; -} +void +set_entity_overwrittenby(ir_entity *ent, int pos, ir_entity *overwrites) { + assert(is_Class_type(get_entity_owner(ent))); + assert(pos < get_entity_n_overwrittenby(ent)); + ent->overwrittenby[pos] = overwrites; +} /* set_entity_overwrittenby */ + +void remove_entity_overwrittenby(ir_entity *ent, ir_entity *overwrites) { + int i, n; + assert(is_Class_type(get_entity_owner(ent))); + + n = ARR_LEN(ent->overwrittenby); + for (i = 0; i < n; ++i) { + if (ent->overwrittenby[i] == overwrites) { + for(; i < n - 1; ++i) + ent->overwrittenby[i] = ent->overwrittenby[i+1]; + ARR_SETLEN(ir_entity*, ent->overwrittenby, n - 1); + break; + } + } +} /* remove_entity_overwrittenby */ /* A link to store intermediate information */ void * -get_entity_link(entity *ent) { - assert(ent); - return ent->link; -} +(get_entity_link)(const ir_entity *ent) { + return _get_entity_link(ent); +} /* get_entity_link */ void -set_entity_link(entity *ent, void *l) { - assert(ent); - ent->link = l; -} +(set_entity_link)(ir_entity *ent, void *l) { + _set_entity_link(ent, l); +} /* set_entity_link */ -INLINE ir_graph * -get_entity_irg(entity *ent) { - assert (ent); - assert (is_method_type(ent->type)); - return ent->irg; -} - -INLINE void -set_entity_irg(entity *ent, ir_graph *irg) { - assert (ent && ent->type); - /* 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 (is_method_type(ent->type)); - assert (ent->peculiarity == existent); - ent->irg = irg; -} +ir_graph * +(get_entity_irg)(const ir_entity *ent) { + return _get_entity_irg(ent); +} /* get_entity_irg */ -int is_atomic_entity(entity *ent) { - type* t = get_entity_type(ent); - return (is_primitive_type(t) || is_pointer_type(t) || - is_enumeration_type(t) || is_method_type(t)); -} - -int is_compound_entity(entity *ent) { - type* t = get_entity_type(ent); - return (is_class_type(t) || is_struct_type(t) || - is_array_type(t) || is_union_type(t)); -} +void +set_entity_irg(ir_entity *ent, ir_graph *irg) { + assert(is_method_entity(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? Wandle die Entitaet in description oder + * inherited um! */ + /* assert(irg); */ + assert((irg && ent->peculiarity == peculiarity_existent) || + (!irg && (ent->peculiarity == peculiarity_existent) + && (ent -> visibility == visibility_external_allocated)) || + (!irg && ent->peculiarity == peculiarity_description) || + (!irg && ent->peculiarity == peculiarity_inherited)); + ent->attr.mtd_attr.irg = irg; +} /* set_entity_irg */ + +unsigned get_entity_vtable_number(const ir_entity *ent) { + assert(is_method_entity((ir_entity *)ent)); + return ent->attr.mtd_attr.vtable_number; +} /* get_entity_vtable_number */ + +void set_entity_vtable_number(ir_entity *ent, unsigned vtable_number) { + assert(is_method_entity(ent)); + ent->attr.mtd_attr.vtable_number = vtable_number; +} /* set_entity_vtable_number */ + +int +(is_entity)(const void *thing) { + return _is_entity(thing); +} /* is_entity */ + +int is_atomic_entity(ir_entity *ent) { + ir_type *t = get_entity_type(ent); + const tp_op *op = get_type_tpop(t); + return (op == type_primitive || op == type_pointer || + op == type_enumeration || op == type_method); +} /* is_atomic_entity */ + +int is_compound_entity(ir_entity *ent) { + ir_type *t = get_entity_type(ent); + const tp_op *op = get_type_tpop(t); + return (op == type_class || op == type_struct || + op == type_array || op == type_union); +} /* is_compound_entity */ + +int is_method_entity(ir_entity *ent) { + ir_type *t = get_entity_type(ent); + return is_Method_type(t); +} /* is_method_entity */ + +/** + * @todo not implemented!!! */ +int equal_entity(ir_entity *ent1, ir_entity *ent2) { + (void) ent1; + (void) ent2; + fprintf(stderr, " calling unimplemented equal entity!!! \n"); + return 1; +} /* equal_entity */ + + +ir_visited_t (get_entity_visited)(ir_entity *ent) { + return _get_entity_visited(ent); +} /* get_entity_visited */ + +void (set_entity_visited)(ir_entity *ent, ir_visited_t num) { + _set_entity_visited(ent, num); +} /* set_entity_visited */ + +/* Sets visited field in ir_entity to entity_visited. */ +void (mark_entity_visited)(ir_entity *ent) { + _mark_entity_visited(ent); +} /* mark_entity_visited */ + +int (entity_visited)(ir_entity *ent) { + return _entity_visited(ent); +} /* entity_visited */ + +int (entity_not_visited)(ir_entity *ent) { + return _entity_not_visited(ent); +} /* entity_not_visited */ + +/* Returns the mask of the additional entity properties. */ +unsigned get_entity_additional_properties(ir_entity *ent) { + ir_graph *irg; + + assert(is_method_entity(ent)); + + /* first check, if the graph has additional properties */ + irg = get_entity_irg(ent); + + if (irg) + return get_irg_additional_properties(irg); + + if (ent->attr.mtd_attr.irg_add_properties & mtp_property_inherited) + return get_method_additional_properties(get_entity_type(ent)); + + return ent->attr.mtd_attr.irg_add_properties; +} /* get_entity_additional_properties */ + +/* Sets the mask of the additional graph properties. */ +void set_entity_additional_properties(ir_entity *ent, unsigned property_mask) +{ + ir_graph *irg; + + assert(is_method_entity(ent)); + + /* first check, if the graph exists */ + irg = get_entity_irg(ent); + if (irg) + set_irg_additional_properties(irg, property_mask); + else { + /* do not allow to set the mtp_property_inherited flag or + * the automatic inheritance of flags will not work */ + ent->attr.mtd_attr.irg_add_properties = property_mask & ~mtp_property_inherited; + } +} /* set_entity_additional_properties */ + +/* Sets one additional graph property. */ +void set_entity_additional_property(ir_entity *ent, mtp_additional_property flag) +{ + ir_graph *irg; + + assert(is_method_entity(ent)); + + /* first check, if the graph exists */ + irg = get_entity_irg(ent); + if (irg) + set_irg_additional_property(irg, flag); + else { + unsigned mask = ent->attr.mtd_attr.irg_add_properties; + + if (mask & mtp_property_inherited) + mask = get_method_additional_properties(get_entity_type(ent)); + + /* do not allow to set the mtp_property_inherited flag or + * the automatic inheritance of flags will not work */ + ent->attr.mtd_attr.irg_add_properties = mask | (flag & ~mtp_property_inherited); + } +} /* set_entity_additional_property */ + +/* Returns the class type that this type info entity represents or NULL + if ent is no type info entity. */ +ir_type *(get_entity_repr_class)(const ir_entity *ent) { + return _get_entity_repr_class(ent); +} /* get_entity_repr_class */ + +dbg_info *(get_entity_dbg_info)(const ir_entity *ent) { + return _get_entity_dbg_info(ent); +} /* get_entity_dbg_info */ + +void (set_entity_dbg_info)(ir_entity *ent, dbg_info *db) { + _set_entity_dbg_info(ent, db); +} /* set_entity_dbg_info */ + +/* Initialize entity module. */ +void firm_init_entity(void) +{ + symconst_symbol sym; -bool equal_entity(entity *ent1, entity *ent2) { - return true; -} + 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)); -unsigned long get_entity_visited(entity *ent) { - assert (ent); - return ent->visit; -} -void set_entity_visited(entity *ent, unsigned long num) { - assert (ent); - ent->visit = num; -} -/* Sets visited field in entity to entity_visited. */ -void mark_entity_visited(entity *ent) { - assert (ent); - ent->visit = type_visited; -} + current_ir_graph = get_const_code_irg(); + sym.entity_p = unknown_entity; + /* TODO: we need two unknown_entities here, one for code and one for data */ + unknown_entity->value = new_SymConst(mode_P_data, sym, symconst_addr_ent); +} /* firm_init_entity */