/*
- * Project: libFIRM
- * File name: ir/tr/type.c
- * Purpose: Representation of types.
- * Author: Goetz Lindenmaier
- * Modified by:
- * Created:
- * CVS-ID: $Id$
- * Copyright: (c) 2001-2003 Universität Karlsruhe
- * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
+ * Copyright (C) 1995-2011 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 type.c
+ * @brief Representation of types.
+ * @author Goetz Lindenmaier, Michael Beck
+ * @brief
*
- * file type.c - implementation of the datastructure to hold
- * type information.
- * (C) 2001 by Universitaet Karlsruhe
- * Goetz Lindenmaier
+ * Implementation of the datastructure to hold
+ * type information.
*
* This module supplies a datastructure to represent all types
* known in the compiled program. This includes types specified
* Types are different from the modes defined in irmode: Types are
* on the level of the programming language, modes at the level of
* the target processor.
+ */
+#include "config.h"
+
+#include <string.h>
+#include <stdlib.h>
+#include <stddef.h>
+#include <stdbool.h>
+
+#include "type_t.h"
+
+#include "xmalloc.h"
+#include "irprog_t.h"
+#include "ircons.h"
+#include "tpop_t.h"
+#include "tv_t.h"
+#include "irhooks.h"
+#include "util.h"
+#include "entity_t.h"
+#include "error.h"
+#include "dbginfo.h"
+#include "irprog_t.h"
+
+#include "array.h"
+
+static ir_type *new_type(tp_op const *type_op, ir_mode *mode, type_dbg_info *db);
+
+ir_type *get_none_type(void)
+{
+ return irp->none_type;
+}
+
+ir_type *get_code_type(void)
+{
+ return irp->code_type;
+}
+
+ir_type *get_unknown_type(void)
+{
+ return irp->unknown_type;
+}
+
+void ir_init_type(ir_prog *irp)
+{
+ /* construct none and unknown type. */
+ irp->none_type = new_type(tpop_none, mode_BAD, NULL);
+ set_type_size_bytes(irp->none_type, 0);
+ set_type_state (irp->none_type, layout_fixed);
+
+ irp->code_type = new_type(tpop_code, mode_ANY, NULL);
+ set_type_state(irp->code_type, layout_fixed);
+
+ irp->unknown_type = new_type(tpop_unknown, mode_ANY, NULL);
+ set_type_size_bytes(irp->unknown_type, 0);
+ set_type_state (irp->unknown_type, layout_fixed);
+}
+
+void ir_finish_type(ir_prog *irp)
+{
+ /** nothing todo. (The none, code, unknown types are in the global type list
+ * and freed there */
+ (void)irp;
+}
+
+ir_visited_t firm_type_visited;
+
+void (set_master_type_visited)(ir_visited_t val)
+{
+ _set_master_type_visited(val);
+}
+
+ir_visited_t (get_master_type_visited)(void)
+{
+ return _get_master_type_visited();
+}
+
+void (inc_master_type_visited)(void)
+{
+ _inc_master_type_visited();
+}
+
+/**
+ * Creates a new type representation:
*
- * @see type_t.h type tpop
+ * @param type_op the kind of this type. May not be type_id.
+ * @param mode the mode to be used for this type, may be NULL
+ * @param db debug info
+ *
+ * @return A new type of the given type. The remaining private attributes are
+ * not initialized. The type is in state layout_undefined.
*/
+static ir_type *new_type(tp_op const *type_op, ir_mode *mode, type_dbg_info *db)
+{
+ ir_type *res;
+ size_t node_size;
+
+ node_size = offsetof(ir_type, attr) + type_op->attr_size;
+ res = (ir_type*)xmalloc(node_size);
+ memset(res, 0, node_size);
+
+ res->kind = k_type;
+ res->type_op = type_op;
+ res->mode = mode;
+ res->visibility = ir_visibility_external;
+ res->flags = tf_none;
+ res->size = 0;
+ res->align = 0;
+ res->visit = 0;
+ res->link = NULL;
+ res->dbi = db;
+#ifdef DEBUG_libfirm
+ res->nr = get_irp_new_node_nr();
+#endif /* defined DEBUG_libfirm */
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+ add_irp_type(res); /* Remember the new type global. */
-#ifdef HAVE_ALLOCA_H
-#include <alloca.h>
-#endif
-#ifdef HAVE_MALLOC_H
-#include <malloc.h>
-#endif
-#ifdef HAVE_STRING_H
-# include <string.h>
+ return res;
+}
+
+void free_type_entities(ir_type *tp)
+{
+ const tp_op *op = get_type_tpop(tp);
+ if (op->ops.free_entities != NULL)
+ op->ops.free_entities(tp);
+}
+
+static void free_type_attrs(ir_type *tp)
+{
+ const tp_op *tpop = get_type_tpop(tp);
+
+ if (tpop->ops.free_attrs)
+ tpop->ops.free_attrs(tp);
+}
+
+void free_type(ir_type *tp)
+{
+ const tp_op *op = get_type_tpop(tp);
+
+ free_type_entities(tp);
+ /* Remove from list of all types */
+ remove_irp_type(tp);
+ /* Free the attributes of the type. */
+ free_type_attrs(tp);
+ /* Free entities automatically allocated with the ir_type */
+ if (op->ops.free_auto_entities)
+ op->ops.free_auto_entities(tp);
+ /* And now the type itself... */
+#ifdef DEBUG_libfirm
+ tp->kind = k_BAD;
#endif
+ free(tp);
+}
+
+void *(get_type_link)(const ir_type *tp)
+{
+ return _get_type_link(tp);
+}
+
+void (set_type_link)(ir_type *tp, void *l)
+{
+ _set_type_link(tp, l);
+}
-# include <stdlib.h>
-# include <stddef.h>
+const tp_op *(get_type_tpop)(const ir_type *tp)
+{
+ return _get_type_tpop(tp);
+}
-# include "type_t.h"
+ident *(get_type_tpop_nameid)(const ir_type *tp)
+{
+ return _get_type_tpop_nameid(tp);
+}
-# include "xmalloc.h"
-# include "irprog_t.h"
-# include "ircons.h"
-# include "tpop_t.h"
-# include "typegmod.h"
-# include "mangle.h"
-# include "tv_t.h"
+const char* get_type_tpop_name(const ir_type *tp)
+{
+ assert(tp && tp->kind == k_type);
+ return get_id_str(tp->type_op->name);
+}
-# include "array.h"
+tp_opcode (get_type_tpop_code)(const ir_type *tp)
+{
+ return _get_type_tpop_code(tp);
+}
-/*******************************************************************/
-/** TYPE **/
-/*******************************************************************/
+ir_mode *(get_type_mode)(const ir_type *tp)
+{
+ return _get_type_mode(tp);
+}
-type *none_type; type *get_none_type(void) { return none_type; }
-type *unknown_type; type *get_unknown_type(void) { return unknown_type; }
+void set_type_mode(ir_type *tp, ir_mode *mode)
+{
+ const tp_op *tpop = get_type_tpop(tp);
+ if (tpop->ops.set_type_mode)
+ tpop->ops.set_type_mode(tp, mode);
+ else
+ assert(0 && "setting a mode is NOT allowed for this type");
+}
+long get_type_nr(const ir_type *tp)
+{
+ assert(tp);
#ifdef DEBUG_libfirm
-/** Returns a new, unique number to number nodes or the like. */
-int get_irp_new_node_nr(void);
+ return tp->nr;
+#else
+ return (long)PTR_TO_INT(tp);
#endif
+}
-/* Suffixes added to types used for pass-by-value representations. */
-static ident *value_params_suffix = NULL;
-static ident *value_ress_suffix = NULL;
-
-void init_type(void) {
- value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
- value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
-
- /* construct none and unknown type. */
- none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"));
- set_type_size_bits(none_type, 0);
- set_type_state (none_type, layout_fixed);
- remove_irp_type(none_type);
- unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"));
- set_type_size_bits(unknown_type, 0);
- set_type_state (unknown_type, layout_fixed);
- remove_irp_type(unknown_type);
-}
-
-unsigned long type_visited;
-
-void (set_master_type_visited)(unsigned long val) { __set_master_type_visited(val); }
-unsigned long (get_master_type_visited)(void) { return __get_master_type_visited(); }
-void (inc_master_type_visited)(void) { __inc_master_type_visited(); }
-
-
-type *
-new_type(tp_op *type_op, ir_mode *mode, ident* name) {
- type *res;
- int node_size ;
-
- assert(type_op != type_id);
- assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
-
- node_size = offsetof(type, attr) + type_op->attr_size;
- res = xmalloc (node_size);
- memset(res, 0, node_size);
- add_irp_type(res); /* Remember the new type global. */
-
- res->kind = k_type;
- res->type_op = type_op;
- res->mode = mode;
- res->name = name;
- res->state = layout_undefined;
- res->size = -1;
- res->align = -1;
- res->visit = 0;
- res -> link = NULL;
-#ifdef DEBUG_libfirm
- res->nr = get_irp_new_node_nr();
- res->c_name = (char*) get_id_str (name);
-#endif /* defined DEBUG_libfirm */
+unsigned (get_type_size_bytes)(const ir_type *tp)
+{
+ return _get_type_size_bytes(tp);
+}
- return res;
+ir_visibility get_type_visibility(const ir_type *tp)
+{
+ assert(is_type(tp));
+ return tp->visibility;
}
-void free_type(type *tp) {
- if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
- return;
- /* Remove from list of all types */
- remove_irp_type(tp);
- /* Free the attributes of the type. */
- free_type_attrs(tp);
- /* Free entities automatically allocated with the type */
- if (is_array_type(tp))
- free_entity(get_array_element_entity(tp));
- /* And now the type itself... */
- tp->kind = k_BAD;
- free(tp);
+void set_type_visibility(ir_type *tp, ir_visibility v)
+{
+ assert(is_type(tp));
+ tp->visibility = v;
}
-void free_type_entities(type *tp) {
- switch(get_type_tpop_code(tp)) {
- case tpo_class: { free_class_entities(tp); } break;
- case tpo_struct: { free_struct_entities(tp); } break;
- case tpo_method: { free_method_entities(tp); } break;
- case tpo_union: { free_union_entities(tp); } break;
- case tpo_array: { free_array_entities(tp); } break;
- case tpo_enumeration: { free_enumeration_entities(tp); } break;
- case tpo_pointer: { free_pointer_entities(tp); } break;
- case tpo_primitive: { free_primitive_entities(tp); } break;
- default: break;
- }
+void set_type_size_bytes(ir_type *tp, unsigned size)
+{
+ const tp_op *tpop = get_type_tpop(tp);
+ tpop->ops.set_type_size(tp, size);
}
-void free_type_attrs(type *tp) {
- switch(get_type_tpop_code(tp)) {
- case tpo_class: { free_class_attrs(tp); } break;
- case tpo_struct: { free_struct_attrs(tp); } break;
- case tpo_method: { free_method_attrs(tp); } break;
- case tpo_union: { free_union_attrs(tp); } break;
- case tpo_array: { free_array_attrs(tp); } break;
- case tpo_enumeration: { free_enumeration_attrs(tp); } break;
- case tpo_pointer: { free_pointer_attrs(tp); } break;
- case tpo_primitive: { free_primitive_attrs(tp); } break;
- default: break;
- }
+unsigned get_type_alignment_bytes(ir_type *tp)
+{
+ unsigned align = 1;
+
+ if (tp->align > 0)
+ return tp->align;
+
+ /* alignment NOT set calculate it "on demand" */
+ if (tp->mode)
+ align = (get_mode_size_bits(tp->mode) + 7) >> 3;
+ else if (is_Array_type(tp))
+ align = get_type_alignment_bytes(get_array_element_type(tp));
+ else if (is_compound_type(tp)) {
+ size_t i, n = get_compound_n_members(tp);
+
+ align = 0;
+ for (i = 0; i < n; ++i) {
+ ir_type *t = get_entity_type(get_compound_member(tp, i));
+ unsigned a = get_type_alignment_bytes(t);
+
+ if (a > align)
+ align = a;
+ }
+ } else if (is_Method_type(tp)) {
+ align = 0;
+ }
+
+ /* write back */
+ tp->align = align;
+
+ return align;
}
-/* set/get the link field */
-void *(get_type_link)(const type *tp)
+void set_type_alignment_bytes(ir_type *tp, unsigned align)
{
- return __get_type_link(tp);
+ assert(tp && tp->kind == k_type);
+ /* Methods don't have an alignment. */
+ if (tp->type_op != type_method) {
+ tp->align = align;
+ }
}
-void (set_type_link)(type *tp, void *l)
+const char *get_type_state_name(ir_type_state s)
{
- __set_type_link(tp, l);
+#define X(a) case a: return #a
+ switch (s) {
+ X(layout_undefined);
+ X(layout_fixed);
+ }
+ return "<unknown>";
+#undef X
}
-tp_op *(get_type_tpop)(const type *tp) {
- return __get_type_tpop(tp);
+ir_type_state (get_type_state)(const ir_type *tp)
+{
+ return _get_type_state(tp);
}
-ident *(get_type_tpop_nameid)(const type *tp) {
- return __get_type_tpop_nameid(tp);
+void set_type_state(ir_type *tp, ir_type_state state)
+{
+ assert(tp && tp->kind == k_type);
+
+ if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
+ (tp->type_op == type_method))
+ return;
+
+ /* Just a correctness check: */
+ if (state == layout_fixed) {
+ size_t i;
+ switch (get_type_tpop_code(tp)) {
+ case tpo_class:
+ if (tp != get_glob_type()) {
+ size_t n_mem = get_class_n_members(tp);
+ for (i = 0; i < n_mem; i++) {
+ ir_entity *entity = get_class_member(tp, i);
+ if (is_Method_type(get_entity_type(entity)))
+ continue;
+ assert(get_entity_offset(entity) > -1);
+ }
+ }
+ break;
+ case tpo_struct:
+ for (i = 0; i < get_struct_n_members(tp); i++) {
+ assert(get_entity_offset(get_struct_member(tp, i)) > -1);
+ }
+ break;
+ case tpo_union:
+ break;
+ case tpo_array:
+ break;
+ case tpo_enumeration: {
+#ifndef NDEBUG
+ size_t n_enums = get_enumeration_n_enums(tp);
+ assert(get_type_mode(tp) != NULL);
+ for (i = 0; i < n_enums; ++i) {
+ ir_enum_const *ec = get_enumeration_const(tp, i);
+ ir_tarval *tv = get_enumeration_value(ec);
+ assert(tv != NULL && tv != tarval_bad);
+ }
+#endif
+ break;
+ }
+ default: break;
+ }
+ }
+ if (state == layout_fixed)
+ tp->flags |= tf_layout_fixed;
+ else
+ tp->flags &= ~tf_layout_fixed;
+}
+
+ir_visited_t (get_type_visited)(const ir_type *tp)
+{
+ return _get_type_visited(tp);
}
-const char* get_type_tpop_name(const type *tp) {
- assert(tp && tp->kind == k_type);
- return get_id_str(tp->type_op->name);
+void (set_type_visited)(ir_type *tp, ir_visited_t num)
+{
+ _set_type_visited(tp, num);
}
-tp_opcode (get_type_tpop_code)(const type *tp) {
- return __get_type_tpop_code(tp);
+void (mark_type_visited)(ir_type *tp)
+{
+ _mark_type_visited(tp);
}
-ir_mode *(get_type_mode)(const type *tp) {
- return __get_type_mode(tp);
+int (type_visited)(const ir_type *tp)
+{
+ return _type_visited(tp);
}
-void set_type_mode(type *tp, ir_mode* m) {
- assert(tp && tp->kind == k_type);
+int (type_not_visited)(const ir_type *tp)
+{
+ return _type_not_visited(tp);
+}
- assert(((tp->type_op != type_primitive) || mode_is_data(m)) &&
- /* Modes of primitives must be data */
- ((tp->type_op != type_enumeration) || mode_is_int(m)) &&
- /* Modes of enumerations must be integers */
- ((tp->type_op != type_pointer) || mode_is_reference(m)) );
- /* Modes of pointers must be references. */
+type_dbg_info *(get_type_dbg_info)(const ir_type *tp)
+{
+ return _get_type_dbg_info(tp);
+}
- switch (get_type_tpop_code(tp)) {
- case tpo_primitive:
- /* For primitive size depends on the mode. */
- tp->size = get_mode_size_bits(m);
- tp->mode = m;
- break;
- case tpo_enumeration:
- case tpo_pointer:
- /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
- assert((get_mode_size_bits(m) & 7) == 0 && "unorthodox modes not implemented");
- tp->size = get_mode_size_bits(m);
- tp->mode = m;
- break;
- case tpo_struct:
- case tpo_class:
- /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
- assert(get_type_state(tp) == layout_fixed &&
- tp->size == get_mode_size_bits(m) &&
- "mode don't match struct/class layout");
- tp->mode = m;
- break;
- default:
- assert(0 && "setting a mode is NOT allowed for this type");
- }
+void (set_type_dbg_info)(ir_type *tp, type_dbg_info *db)
+{
+ _set_type_dbg_info(tp, db);
}
-ident *(get_type_ident)(const type *tp) {
- return __get_type_ident(tp);
+int (is_type)(const void *thing)
+{
+ return _is_type(thing);
}
-void (set_type_ident)(type *tp, ident* id) {
- __set_type_ident(tp, id);
+int equal_type(ir_type *typ1, ir_type *typ2)
+{
+ ir_entity **m;
+ ir_type **t;
+ size_t i;
+ size_t j;
+
+ if (typ1 == typ2) return 1;
+
+ if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
+ typ1->name != typ2->name ||
+ (get_type_mode(typ1) != get_type_mode(typ2)) ||
+ (get_type_state(typ1) != get_type_state(typ2)))
+ return 0;
+ if ((get_type_state(typ1) == layout_fixed) &&
+ (get_type_size_bytes(typ1) != get_type_size_bytes(typ2)))
+ return 0;
+
+ switch (get_type_tpop_code(typ1)) {
+ case tpo_class:
+ if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
+ if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
+ if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
+ if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
+ /** Compare the members **/
+ m = ALLOCANZ(ir_entity*, get_class_n_members(typ1));
+ /* First sort the members of typ2 */
+ for (i = 0; i < get_class_n_members(typ1); i++) {
+ ir_entity *e1 = get_class_member(typ1, i);
+ for (j = 0; j < get_class_n_members(typ2); j++) {
+ ir_entity *e2 = get_class_member(typ2, j);
+ if (get_entity_name(e1) == get_entity_name(e2))
+ m[i] = e2;
+ }
+ }
+ for (i = 0; i < get_class_n_members(typ1); i++) {
+ if (!m[i] || get_class_member(typ1, i) != m[i])
+ return 0;
+ }
+ /** Compare the supertypes **/
+ t = ALLOCANZ(ir_type*, get_class_n_supertypes(typ1));
+ /* First sort the supertypes of typ2 */
+ for (i = 0; i < get_class_n_supertypes(typ1); i++) {
+ ir_type *t1 = get_class_supertype(typ1, i);
+ for (j = 0; j < get_class_n_supertypes(typ2); j++) {
+ ir_type *t2 = get_class_supertype(typ2, j);
+ if (t2->name == t1->name)
+ t[i] = t2;
+ }
+ }
+ for (i = 0; i < get_class_n_supertypes(typ1); i++) {
+ if (!t[i] || /* Found no counterpart */
+ get_class_supertype(typ1, i) != t[i])
+ return 0;
+ }
+ break;
+
+ case tpo_struct:
+ if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
+ m = ALLOCANZ(ir_entity*, get_struct_n_members(typ1));
+ /* First sort the members of lt */
+ for (i = 0; i < get_struct_n_members(typ1); i++) {
+ ir_entity *e1 = get_struct_member(typ1, i);
+ for (j = 0; j < get_struct_n_members(typ2); j++) {
+ ir_entity *e2 = get_struct_member(typ2, j);
+ if (get_entity_name(e1) == get_entity_name(e2))
+ m[i] = e2;
+ }
+ }
+ for (i = 0; i < get_struct_n_members(typ1); i++) {
+ if (!m[i] || get_struct_member(typ1, i) != m[i])
+ return 0;
+ }
+ break;
+
+ case tpo_method: {
+ size_t n_param1;
+ size_t n_param2;
+
+ if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
+ if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
+ if (get_method_calling_convention(typ1) !=
+ get_method_calling_convention(typ2)) return 0;
+
+ n_param1 = get_method_n_params(typ1);
+ n_param2 = get_method_n_params(typ2);
+
+ if (n_param1 != n_param2) return 0;
+
+ for (i = 0; i < n_param1; i++) {
+ if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
+ return 0;
+ }
+ for (i = 0; i < get_method_n_ress(typ1); i++) {
+ if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
+ return 0;
+ }
+ } break;
+
+ case tpo_union:
+ if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
+ m = ALLOCANZ(ir_entity*, get_union_n_members(typ1));
+ /* First sort the members of lt */
+ for (i = 0; i < get_union_n_members(typ1); i++) {
+ ir_entity *e1 = get_union_member(typ1, i);
+ for (j = 0; j < get_union_n_members(typ2); j++) {
+ ir_entity *e2 = get_union_member(typ2, j);
+ if (get_entity_name(e1) == get_entity_name(e2))
+ m[i] = e2;
+ }
+ }
+ for (i = 0; i < get_union_n_members(typ1); i++) {
+ if (!m[i] || get_union_member(typ1, i) != m[i])
+ return 0;
+ }
+ break;
+
+ case tpo_array:
+ if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
+ return 0;
+ if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
+ return 0;
+ for (i = 0; i < get_array_n_dimensions(typ1); i++) {
+ if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
+ get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
+ return 0;
+ if (get_array_order(typ1, i) != get_array_order(typ2, i))
+ assert(0 && "type compare with different dimension orders not implemented");
+ }
+ break;
+
+ case tpo_enumeration:
+ assert(0 && "enumerations not implemented");
+ break;
+
+ case tpo_pointer:
+ if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
+ return 0;
+ break;
+
+ case tpo_primitive:
+ break;
+
+ default: break;
+ }
+ return 1;
+}
+
+int smaller_type(ir_type *st, ir_type *lt)
+{
+ ir_entity **m;
+ size_t i;
+ size_t j;
+ size_t n_st_members;
+
+ if (st == lt) return 1;
+
+ if (get_type_tpop_code(st) != get_type_tpop_code(lt))
+ return 0;
+
+ switch (get_type_tpop_code(st)) {
+ case tpo_class:
+ return is_SubClass_of(st, lt);
+
+ case tpo_struct:
+ n_st_members = get_struct_n_members(st);
+ if (n_st_members != get_struct_n_members(lt))
+ return 0;
+
+ m = ALLOCANZ(ir_entity*, n_st_members);
+ /* First sort the members of lt */
+ for (i = 0; i < n_st_members; ++i) {
+ ir_entity *se = get_struct_member(st, i);
+ size_t n = get_struct_n_members(lt);
+ for (j = 0; j < n; ++j) {
+ ir_entity *le = get_struct_member(lt, j);
+ if (get_entity_name(le) == get_entity_name(se))
+ m[i] = le;
+ }
+ }
+ for (i = 0; i < n_st_members; i++) {
+ if (!m[i] || /* Found no counterpart */
+ !smaller_type(get_entity_type(get_struct_member(st, i)), get_entity_type(m[i])))
+ return 0;
+ }
+ break;
+
+ case tpo_method: {
+ size_t n_param1, n_param2;
+
+ /** FIXME: is this still 1? */
+ if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
+ if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
+ if (get_method_calling_convention(st) !=
+ get_method_calling_convention(lt)) return 0;
+
+ n_param1 = get_method_n_params(st);
+ n_param2 = get_method_n_params(lt);
+
+ if (n_param1 != n_param2) return 0;
+
+ for (i = 0; i < get_method_n_params(st); i++) {
+ if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
+ return 0;
+ }
+ for (i = 0; i < get_method_n_ress(st); i++) {
+ if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
+ return 0;
+ }
+ } break;
+
+ case tpo_union:
+ n_st_members = get_union_n_members(st);
+ if (n_st_members != get_union_n_members(lt)) return 0;
+ m = ALLOCANZ(ir_entity*, n_st_members);
+ /* First sort the members of lt */
+ for (i = 0; i < n_st_members; ++i) {
+ ir_entity *se = get_union_member(st, i);
+ size_t n = get_union_n_members(lt);
+ for (j = 0; j < n; ++j) {
+ ir_entity *le = get_union_member(lt, j);
+ if (get_entity_name(le) == get_entity_name(se))
+ m[i] = le;
+ }
+ }
+ for (i = 0; i < n_st_members; ++i) {
+ if (!m[i] || /* Found no counterpart */
+ !smaller_type(get_entity_type(get_union_member(st, i)), get_entity_type(m[i])))
+ return 0;
+ }
+ break;
+
+ case tpo_array: {
+ ir_type *set, *let; /* small/large elt. ir_type */
+ if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
+ return 0;
+ set = get_array_element_type(st);
+ let = get_array_element_type(lt);
+ if (set != let) {
+ /* If the element types are different, set must be convertible
+ to let, and they must have the same size so that address
+ computations work out. To have a size the layout must
+ be fixed. */
+ if ((get_type_state(set) != layout_fixed) ||
+ (get_type_state(let) != layout_fixed))
+ return 0;
+ if (!smaller_type(set, let) ||
+ get_type_size_bytes(set) != get_type_size_bytes(let))
+ return 0;
+ }
+ for (i = 0; i < get_array_n_dimensions(st); i++) {
+ if (get_array_lower_bound(lt, i))
+ if (get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
+ return 0;
+ if (get_array_upper_bound(lt, i))
+ if (get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
+ return 0;
+ }
+ } break;
+
+ case tpo_enumeration:
+ assert(0 && "enumerations not implemented");
+ break;
+
+ case tpo_pointer:
+ if (!smaller_type(get_pointer_points_to_type(st), get_pointer_points_to_type(lt)))
+ return 0;
+ break;
+
+ case tpo_primitive:
+ if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
+ return 0;
+ break;
+
+ default: break;
+ }
+ return 1;
+}
+
+
+ir_type *new_d_type_class(ident *name, type_dbg_info *db)
+{
+ ir_type *res;
+
+ res = new_type(type_class, NULL, db);
+ res->name = name;
+
+ res->attr.ca.members = NEW_ARR_F (ir_entity *, 0);
+ res->attr.ca.subtypes = NEW_ARR_F (ir_type *, 0);
+ res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
+ res->attr.ca.peculiarity = peculiarity_existent;
+ res->attr.ca.type_info = NULL;
+ res->attr.ca.vtable_size = 0;
+ res->attr.ca.clss_flags = cf_none;
+ res->attr.ca.dfn = 0;
+ hook_new_type(res);
+ return res;
}
-/* Outputs a unique number for this node */
-long (get_type_nr)(const type *tp) {
- return __get_type_nr(tp);
+ir_type *new_type_class(ident *name)
+{
+ return new_d_type_class(name, NULL);
}
-const char* get_type_name(const type *tp) {
- assert(tp && tp->kind == k_type);
- return (get_id_str(tp->name));
+void free_class_entities(ir_type *clss)
+{
+ size_t i;
+ assert(clss && (clss->type_op == type_class));
+ /* we must iterate backward here */
+ for (i = get_class_n_members(clss); i > 0;)
+ free_entity(get_class_member(clss, --i));
+ /* do NOT free the type info here. It belongs to another class */
}
-int (get_type_size_bytes)(const type *tp) {
- return __get_type_size_bytes(tp);
+void free_class_attrs(ir_type *clss)
+{
+ assert(clss && (clss->type_op == type_class));
+ DEL_ARR_F(clss->attr.ca.members);
+ DEL_ARR_F(clss->attr.ca.subtypes);
+ DEL_ARR_F(clss->attr.ca.supertypes);
}
-int (get_type_size_bits)(const type *tp) {
- return __get_type_size_bits(tp);
+ident *get_class_ident(const ir_type *clss)
+{
+ assert(clss->type_op == type_class);
+ return clss->name;
}
-void
-set_type_size_bits(type *tp, int size) {
- assert(tp && tp->kind == k_type);
- /* For pointer enumeration and primitive size depends on the mode.
- Methods don't have a size. */
- if ((tp->type_op != type_pointer) && (tp->type_op != type_primitive) &&
- (tp->type_op != type_enumeration) && (tp->type_op != type_method)) {
- if (tp->type_op == type_primitive)
- tp->size = size;
- else {
- /* argh: we must allow to set negative values as "invalid size" */
- tp->size = (size >= 0) ? (size + 7) & ~7 : size;
- assert(tp->size == size && "setting a bit size is NOT allowed for this type");
- }
- }
+const char *get_class_name(const ir_type *clss)
+{
+ if (get_class_ident(clss) == NULL)
+ return NULL;
+ return get_id_str(get_class_ident(clss));
}
-void
-set_type_size_bytes(type *tp, int size) {
- set_type_size_bits(tp, 8*size);
-}
-
-int get_type_alignment_bytes(type *tp) {
- int align = get_type_alignment_bits(tp);
-
- return align < 0 ? align : (align + 7) >> 3;
-}
-
-int get_type_alignment_bits(type *tp) {
- int align = 8;
-
- if (tp->align > 0)
- return tp->align;
-
- /* alignment NOT set calculate it "on demand" */
- if (tp->mode)
- align = get_mode_size_bits(tp->mode);
- else if (is_array_type(tp))
- align = get_type_alignment_bits(get_array_element_type(tp));
- else if (is_compound_type(tp)) {
- int i, n = get_compound_n_members(tp);
-
- align = 0;
- for (i = 0; i < n; ++i) {
- type *t = get_entity_type(get_compound_member(tp, i));
- int a = get_type_alignment_bits(t);
-
- if (a > align)
- align = a;
- }
- }
- else if (is_method_type(tp))
- align = 0;
-
- /* write back */
- tp->align = align;
-
- return align;
-}
+static void add_class_member(ir_type *clss, ir_entity *member)
+{
+ assert(clss && (clss->type_op == type_class));
+ assert(clss != get_entity_type(member) && "recursive type");
+ ARR_APP1 (ir_entity *, clss->attr.ca.members, member);
+}
-void
-set_type_alignment_bits(type *tp, int align) {
- assert(tp && tp->kind == k_type);
- /* Methods don't have an alignment. */
- if (tp->type_op != type_method) {
- tp->align = align;
- }
+size_t (get_class_n_members)(const ir_type *clss)
+{
+ return _get_class_n_members(clss);
}
-void
-set_type_alignment_bytes(type *tp, int align) {
- set_type_size_bits(tp, 8*align);
+size_t get_class_member_index(const ir_type *clss, ir_entity *mem)
+{
+ size_t i, n;
+ assert(clss && (clss->type_op == type_class));
+ for (i = 0, n = get_class_n_members(clss); i < n; ++i) {
+ if (get_class_member(clss, i) == mem)
+ return i;
+ }
+ return INVALID_MEMBER_INDEX;
}
-type_state (get_type_state)(const type *tp) {
- return __get_type_state(tp);
+ir_entity *(get_class_member)(const ir_type *clss, size_t pos)
+{
+ return _get_class_member(clss, pos);
}
-void
-set_type_state(type *tp, type_state state) {
- assert(tp && tp->kind == k_type);
-
- if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
- (tp->type_op == type_method))
- return;
-
- /* Just a correctness check: */
- if (state == layout_fixed) {
- int i;
- switch (get_type_tpop_code(tp)) {
- case tpo_class:
- {
- assert(get_type_size_bits(tp) > -1);
- if (tp != get_glob_type()) {
- int n_mem = get_class_n_members(tp);
- for (i = 0; i < n_mem; i++) {
- if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
- { DDMT(tp); DDME(get_class_member(tp, i)); }
- assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
- /* TR ??
- assert(is_method_type(get_entity_type(get_class_member(tp, i))) ||
- (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
- */
- }
- }
- } break;
- case tpo_struct:
- {
- assert(get_type_size_bits(tp) > -1);
- for (i = 0; i < get_struct_n_members(tp); i++) {
- assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
- assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
- }
- } break;
- case tpo_union:
- { /* ?? */
- } break;
- case tpo_array:
- { /* ??
- Check order?
- Assure that only innermost dimension is dynamic? */
- } break;
- case tpo_enumeration:
- {
- assert(get_type_mode != NULL);
- for (i = 0; i < get_enumeration_n_enums(tp); i++)
- assert(get_enumeration_enum(tp, i) != NULL);
- } break;
- default: break;
- } /* switch (tp) */
- }
- tp->state = state;
-}
-
-unsigned long (get_type_visited)(const type *tp) {
- return __get_type_visited(tp);
-}
-
-void (set_type_visited)(type *tp, unsigned long num) {
- __set_type_visited(tp, num);
-}
-
-/* Sets visited field in type to type_visited. */
-void (mark_type_visited)(type *tp) {
- __mark_type_visited(tp);
-}
-
-/* @@@ name clash with master flag
-int (type_visited)(const type *tp) {
- return __type_visited(tp);
-}*/
-
-int (type_not_visited)(const type *tp) {
- return __type_not_visited(tp);
-}
-
-int (is_type)(const void *thing) {
- return __is_type(thing);
-}
-
-bool equal_type(type *typ1, type *typ2) {
- entity **m;
- type **t;
- int i, j;
-
- if (typ1 == typ2) return true;
-
- if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
- (get_type_ident(typ1) != get_type_ident(typ2)) ||
- (get_type_mode(typ1) != get_type_mode(typ2)) ||
- (get_type_state(typ1) != get_type_state(typ2)))
- return false;
- if ((get_type_state(typ1) == layout_fixed) &&
- (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
- return false;
-
- switch(get_type_tpop_code(typ1)) {
- case tpo_class: {
- if (get_class_n_members(typ1) != get_class_n_members(typ2)) return false;
- if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return false;
- if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return false;
- if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return false;
- /** Compare the members **/
- m = alloca(sizeof(entity *) * get_class_n_members(typ1));
- memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
- /* First sort the members of typ2 */
- for (i = 0; i < get_class_n_members(typ1); i++) {
- entity *e1 = get_class_member(typ1, i);
- for (j = 0; j < get_class_n_members(typ2); j++) {
- entity *e2 = get_class_member(typ2, j);
- if (get_entity_name(e1) == get_entity_name(e2))
- m[i] = e2;
- }
- }
- for (i = 0; i < get_class_n_members(typ1); i++) {
- if (!m[i] || /* Found no counterpart */
- !equal_entity(get_class_member(typ1, i), m[i]))
- return false;
- }
- /** Compare the supertypes **/
- t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
- memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
- /* First sort the supertypes of typ2 */
- for (i = 0; i < get_class_n_supertypes(typ1); i++) {
- type *t1 = get_class_supertype(typ1, i);
- for (j = 0; j < get_class_n_supertypes(typ2); j++) {
- type *t2 = get_class_supertype(typ2, j);
- if (get_type_ident(t2) == get_type_ident(t1))
- t[i] = t2;
- }
- }
- for (i = 0; i < get_class_n_supertypes(typ1); i++) {
- if (!t[i] || /* Found no counterpart */
- get_class_supertype(typ1, i) != t[i])
- return false;
- }
- } break;
- case tpo_struct: {
- if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return false;
- m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
- memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
- /* First sort the members of lt */
- for (i = 0; i < get_struct_n_members(typ1); i++) {
- entity *e1 = get_struct_member(typ1, i);
- for (j = 0; j < get_struct_n_members(typ2); j++) {
- entity *e2 = get_struct_member(typ2, j);
- if (get_entity_name(e1) == get_entity_name(e2))
- m[i] = e2;
- }
- }
- for (i = 0; i < get_struct_n_members(typ1); i++) {
- if (!m[i] || /* Found no counterpart */
- !equal_entity(get_struct_member(typ1, i), m[i]))
- return false;
- }
- } break;
- case tpo_method: {
- int n_param1, n_param2;
-
- if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return false;
- if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return false;
-
- if (get_method_variadicity(typ1) == variadicity_non_variadic) {
- n_param1 = get_method_n_params(typ1);
- n_param2 = get_method_n_params(typ2);
- }
- else {
- n_param1 = get_method_first_variadic_param_index(typ1);
- n_param2 = get_method_first_variadic_param_index(typ2);
- }
-
- if (n_param1 != n_param2) return false;
-
- for (i = 0; i < n_param1; i++) {
- if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
- return false;
- }
- for (i = 0; i < get_method_n_ress(typ1); i++) {
- if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
- return false;
- }
- } break;
- case tpo_union: {
- if (get_union_n_members(typ1) != get_union_n_members(typ2)) return false;
- m = alloca(sizeof(entity *) * get_union_n_members(typ1));
- memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
- /* First sort the members of lt */
- for (i = 0; i < get_union_n_members(typ1); i++) {
- entity *e1 = get_union_member(typ1, i);
- for (j = 0; j < get_union_n_members(typ2); j++) {
- entity *e2 = get_union_member(typ2, j);
- if (get_entity_name(e1) == get_entity_name(e2))
- m[i] = e2;
- }
- }
- for (i = 0; i < get_union_n_members(typ1); i++) {
- if (!m[i] || /* Found no counterpart */
- !equal_entity(get_union_member(typ1, i), m[i]))
- return false;
- }
- } break;
- case tpo_array: {
- if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
- return false;
- if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
- return false;
- for(i = 0; i < get_array_n_dimensions(typ1); i++) {
- if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
- get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
- return false;
- if (get_array_order(typ1, i) != get_array_order(typ2, i))
- assert(0 && "type compare with different dimension orders not implemented");
- }
- } break;
- case tpo_enumeration: {
- assert(0 && "enumerations not implemented");
- } break;
- case tpo_pointer: {
- if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
- return false;
- } break;
- case tpo_primitive: {
- } break;
- default: break;
- }
- return true;
-}
-
-bool smaller_type (type *st, type *lt) {
- entity **m;
- int i, j;
-
- if (st == lt) return true;
-
- if (get_type_tpop_code(st) != get_type_tpop_code(lt))
- return false;
-
- switch(get_type_tpop_code(st)) {
- case tpo_class: {
- return is_subclass_of(st, lt);
- } break;
- case tpo_struct: {
- if (get_struct_n_members(st) != get_struct_n_members(lt)) return false;
- m = alloca(sizeof(entity *) * get_struct_n_members(st));
- memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
- /* First sort the members of lt */
- for (i = 0; i < get_struct_n_members(st); i++) {
- entity *se = get_struct_member(st, i);
- for (j = 0; j < get_struct_n_members(lt); j++) {
- entity *le = get_struct_member(lt, j);
- if (get_entity_name(le) == get_entity_name(se))
- m[i] = le;
- }
- }
- for (i = 0; i < get_struct_n_members(st); i++) {
- if (!m[i] || /* Found no counterpart */
- !smaller_type(get_entity_type(get_struct_member(st, i)),
- get_entity_type(m[i])))
- return false;
- }
- } break;
- case tpo_method: {
- /** FIXME: is this still true? */
- if (get_method_variadicity(st) != get_method_variadicity(lt)) return false;
- if (get_method_n_params(st) != get_method_n_params(lt)) return false;
- if (get_method_n_ress(st) != get_method_n_ress(lt)) return false;
- for (i = 0; i < get_method_n_params(st); i++) {
- if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
- return false;
- }
- for (i = 0; i < get_method_n_ress(st); i++) {
- if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
- return false;
- }
- } break;
- case tpo_union: {
- if (get_union_n_members(st) != get_union_n_members(lt)) return false;
- m = alloca(sizeof(entity *) * get_union_n_members(st));
- memset(m, 0, sizeof(entity *) * get_union_n_members(st));
- /* First sort the members of lt */
- for (i = 0; i < get_union_n_members(st); i++) {
- entity *se = get_union_member(st, i);
- for (j = 0; j < get_union_n_members(lt); j++) {
- entity *le = get_union_member(lt, j);
- if (get_entity_name(le) == get_entity_name(se))
- m[i] = le;
- }
- }
- for (i = 0; i < get_union_n_members(st); i++) {
- if (!m[i] || /* Found no counterpart */
- !smaller_type(get_entity_type(get_union_member(st, i)),
- get_entity_type(m[i])))
- return false;
- }
- } break;
- case tpo_array: {
- type *set, *let; /* small/large elt. type */
- if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
- return false;
- set = get_array_element_type(st);
- let = get_array_element_type(lt);
- if (set != let) {
- /* If the elt types are different, set must be convertible
- to let, and they must have the same size so that address
- computations work out. To have a size the layout must
- be fixed. */
- if ((get_type_state(set) != layout_fixed) ||
- (get_type_state(let) != layout_fixed))
- return false;
- if (!smaller_type(set, let) ||
- get_type_size_bits(set) != get_type_size_bits(let))
- return false;
- }
- for(i = 0; i < get_array_n_dimensions(st); i++) {
- if (get_array_lower_bound(lt, i))
- if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
- return false;
- if (get_array_upper_bound(lt, i))
- if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
- return false;
- }
- } break;
- case tpo_enumeration: {
- assert(0 && "enumerations not implemented");
- } break;
- case tpo_pointer: {
- if (!smaller_type(get_pointer_points_to_type(st),
- get_pointer_points_to_type(lt)))
- return false;
- } break;
- case tpo_primitive: {
- if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
- return false;
- } break;
- default: break;
- }
- return true;
-}
-
-/*-----------------------------------------------------------------*/
-/* TYPE_CLASS */
-/*-----------------------------------------------------------------*/
-
-/* create a new class type */
-type *new_type_class (ident *name) {
- type *res;
-
- res = new_type(type_class, NULL, name);
-
- res->attr.ca.members = NEW_ARR_F (entity *, 0);
- res->attr.ca.subtypes = NEW_ARR_F (type *, 0);
- res->attr.ca.supertypes = NEW_ARR_F (type *, 0);
- res->attr.ca.peculiarity = peculiarity_existent;
- res->attr.ca.dfn = 0;
-
- return res;
-}
-type *new_d_type_class (ident *name, dbg_info* db) {
- type *res = new_type_class (name);
- set_type_dbg_info(res, db);
- return res;
-}
-
-void free_class_entities(type *clss) {
- int i;
- assert(clss && (clss->type_op == type_class));
- for (i = get_class_n_members(clss)-1; i >= 0; --i)
- free_entity(get_class_member(clss, i));
-}
-
-void free_class_attrs(type *clss) {
- assert(clss && (clss->type_op == type_class));
- DEL_ARR_F(clss->attr.ca.members);
- DEL_ARR_F(clss->attr.ca.subtypes);
- DEL_ARR_F(clss->attr.ca.supertypes);
-}
-
-/* manipulate private fields of class type */
-void add_class_member (type *clss, entity *member) {
- assert(clss && (clss->type_op == type_class));
- ARR_APP1 (entity *, clss->attr.ca.members, member);
-}
-
-int (get_class_n_members) (const type *clss) {
- return __get_class_n_members(clss);
-}
-
-int get_class_member_index(type *clss, entity *mem) {
- int i;
- assert(clss && (clss->type_op == type_class));
- for (i = 0; i < get_class_n_members(clss); i++)
- if (get_class_member(clss, i) == mem)
- return i;
- return -1;
-}
-
-entity *(get_class_member) (const type *clss, int pos) {
- return __get_class_member(clss, pos);
-}
-
-entity *get_class_member_by_name(type *clss, ident *name) {
- int i, n_mem;
- assert(clss && (clss->type_op == type_class));
- n_mem = get_class_n_members(clss);
- for (i = 0; i < n_mem; ++i) {
- entity *mem = get_class_member(clss, i);
- if (get_entity_ident(mem) == name) return mem;
- }
- return NULL;
-}
-
-void set_class_member (type *clss, entity *member, int pos) {
- assert(clss && (clss->type_op == type_class));
- assert(pos >= 0 && pos < get_class_n_members(clss));
- clss->attr.ca.members[pos] = member;
-}
-void set_class_members (type *clss, entity **members, int arity) {
- int i;
- assert(clss && (clss->type_op == type_class));
- DEL_ARR_F(clss->attr.ca.members);
- clss->attr.ca.members = NEW_ARR_F (entity *, 0);
- for (i = 0; i < arity; i++) {
- set_entity_owner(members[i], clss);
- ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
- }
-}
-void remove_class_member(type *clss, entity *member) {
- int i;
- assert(clss && (clss->type_op == type_class));
- for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
- if (clss->attr.ca.members[i] == member) {
- for(; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
- clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
- ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
- break;
- }
- }
-}
-
-void add_class_subtype (type *clss, type *subtype) {
- int i;
- assert(clss && (clss->type_op == type_class));
- ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
- for (i = 0; i < get_class_n_supertypes(subtype); i++)
- if (get_class_supertype(subtype, i) == clss)
- /* Class already registered */
- return;
- ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
-}
-int get_class_n_subtypes (const type *clss) {
- assert(clss && (clss->type_op == type_class));
- return (ARR_LEN (clss->attr.ca.subtypes));
-}
-type *get_class_subtype (type *clss, int pos) {
- assert(clss && (clss->type_op == type_class));
- assert(pos >= 0 && pos < get_class_n_subtypes(clss));
- return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
-}
-void set_class_subtype (type *clss, type *subtype, int pos) {
- assert(clss && (clss->type_op == type_class));
- assert(pos >= 0 && pos < get_class_n_subtypes(clss));
- clss->attr.ca.subtypes[pos] = subtype;
-}
-void remove_class_subtype(type *clss, type *subtype) {
- int i;
- assert(clss && (clss->type_op == type_class));
- for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
- if (clss->attr.ca.subtypes[i] == subtype) {
- for(; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
- clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
- ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
- break;
- }
-}
-
-void add_class_supertype (type *clss, type *supertype) {
- int i;
- assert(clss && (clss->type_op == type_class));
- assert(supertype && (supertype -> type_op == type_class));
- ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
- for (i = 0; i < get_class_n_subtypes(supertype); i++)
- if (get_class_subtype(supertype, i) == clss)
- /* Class already registered */
- return;
- ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
-}
-int get_class_n_supertypes (const type *clss) {
- assert(clss && (clss->type_op == type_class));
- return (ARR_LEN (clss->attr.ca.supertypes));
-}
-int get_class_supertype_index(type *clss, type *super_clss) {
- int i;
- assert(clss && (clss->type_op == type_class));
- assert(super_clss && (super_clss->type_op == type_class));
- for (i = 0; i < get_class_n_supertypes(clss); i++)
- if (get_class_supertype(clss, i) == super_clss)
- return i;
- return -1;
-}
-type *get_class_supertype (type *clss, int pos) {
- assert(clss && (clss->type_op == type_class));
- assert(pos >= 0 && pos < get_class_n_supertypes(clss));
- return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
-}
-void set_class_supertype (type *clss, type *supertype, int pos) {
- assert(clss && (clss->type_op == type_class));
- assert(pos >= 0 && pos < get_class_n_supertypes(clss));
- clss->attr.ca.supertypes[pos] = supertype;
-}
-void remove_class_supertype(type *clss, type *supertype) {
- int i;
- assert(clss && (clss->type_op == type_class));
- for (i = 0; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
- if (clss->attr.ca.supertypes[i] == supertype) {
- for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
- clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
- ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
- break;
- }
-}
-
-const char *get_peculiarity_string(peculiarity p) {
- switch (p) {
- case peculiarity_description:
- return "peculiarity_description";
- case peculiarity_inherited:
- return "peculiarity_inherited";
- default:
- return "peculiarity_existent";
- }
-}
-
-peculiarity get_class_peculiarity (const type *clss) {
- assert(clss && (clss->type_op == type_class));
- return clss->attr.ca.peculiarity;
-}
-
-void set_class_peculiarity (type *clss, peculiarity pec) {
- assert(clss && (clss->type_op == type_class));
- assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
- clss->attr.ca.peculiarity = pec;
-}
-
-void set_class_dfn (type *clss, int dfn)
-{
- clss->attr.ca.dfn = dfn;
-}
-
-int get_class_dfn (const type *clss)
-{
- return (clss->attr.ca.dfn);
-}
-
-/* typecheck */
-int (is_class_type)(const type *clss) {
- return __is_class_type(clss);
-}
-
-bool is_subclass_of(type *low, type *high) {
- int i;
- assert(is_class_type(low) && is_class_type(high));
- if (low == high) return true;
- /* depth first search from high downwards. */
- for (i = 0; i < get_class_n_subtypes(high); i++) {
- if (low == get_class_subtype(high, i))
- return true;
- if (is_subclass_of(low, get_class_subtype(high, i)))
- return true;
- }
- return false;
-}
+ir_entity *get_class_member_by_name(ir_type *clss, ident *name)
+{
+ size_t i, n_mem;
+ assert(clss && (clss->type_op == type_class));
+ n_mem = get_class_n_members(clss);
+ for (i = 0; i < n_mem; ++i) {
+ ir_entity *mem = get_class_member(clss, i);
+ if (get_entity_ident(mem) == name)
+ return mem;
+ }
+ return NULL;
+}
+
+static void remove_class_member(ir_type *clss, ir_entity *member)
+{
+ size_t i;
+ assert(clss && (clss->type_op == type_class));
+ for (i = 0; i < ARR_LEN(clss->attr.ca.members); ++i) {
+ if (clss->attr.ca.members[i] == member) {
+ for (; i < ARR_LEN(clss->attr.ca.members) - 1; ++i)
+ clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
+ ARR_SETLEN(ir_entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
+ break;
+ }
+ }
+}
+
+void add_class_subtype(ir_type *clss, ir_type *subtype)
+{
+ size_t i;
+ assert(clss->type_op == type_class);
+ ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
+ for (i = 0; i < get_class_n_supertypes(subtype); i++) {
+ if (get_class_supertype(subtype, i) == clss)
+ /* Class already registered */
+ return;
+ }
+ ARR_APP1(ir_type *, subtype->attr.ca.supertypes, clss);
+}
+
+size_t get_class_n_subtypes(const ir_type *clss)
+{
+ assert(clss->type_op == type_class);
+ return ARR_LEN (clss->attr.ca.subtypes);
+}
-/*----------------------------------------------------------------**/
-/* TYPE_STRUCT */
-/*----------------------------------------------------------------**/
-
-/* create a new type struct */
-type *new_type_struct (ident *name) {
- type *res;
- res = new_type(type_struct, NULL, name);
- res->attr.sa.members = NEW_ARR_F (entity *, 0);
- return res;
+ir_type *get_class_subtype(ir_type *clss, size_t pos)
+{
+ assert(clss->type_op == type_class);
+ assert(pos < get_class_n_subtypes(clss));
+ return clss->attr.ca.subtypes[pos];
}
-type *new_d_type_struct (ident *name, dbg_info* db) {
- type *res = new_type_struct (name);
- set_type_dbg_info(res, db);
- return res;
+
+size_t get_class_subtype_index(ir_type *clss, const ir_type *subclass)
+{
+ size_t i, n_subtypes = get_class_n_subtypes(clss);
+ assert(is_Class_type(subclass));
+ for (i = 0; i < n_subtypes; ++i) {
+ if (get_class_subtype(clss, i) == subclass)
+ return i;
+ }
+ return (size_t)-1;
}
-void free_struct_entities (type *strct) {
- int i;
- assert(strct && (strct->type_op == type_struct));
- for (i = get_struct_n_members(strct)-1; i >= 0; --i)
- free_entity(get_struct_member(strct, i));
+
+void set_class_subtype(ir_type *clss, ir_type *subtype, size_t pos)
+{
+ assert(clss->type_op == type_class);
+ assert(pos < get_class_n_subtypes(clss));
+ clss->attr.ca.subtypes[pos] = subtype;
}
-void free_struct_attrs (type *strct) {
- assert(strct && (strct->type_op == type_struct));
- DEL_ARR_F(strct->attr.sa.members);
+
+void remove_class_subtype(ir_type *clss, ir_type *subtype)
+{
+ size_t i;
+ assert(clss && (clss->type_op == type_class));
+ for (i = 0; i < ARR_LEN(clss->attr.ca.subtypes); ++i) {
+ if (clss->attr.ca.subtypes[i] == subtype) {
+ for (; i < ARR_LEN(clss->attr.ca.subtypes) - 1; ++i)
+ clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
+ ARR_SETLEN(ir_type*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
+ break;
+ }
+ }
+}
+
+void add_class_supertype(ir_type *clss, ir_type *supertype)
+{
+ size_t i;
+ size_t n;
+ assert(clss && (clss->type_op == type_class));
+ assert(supertype && (supertype -> type_op == type_class));
+ ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
+ for (i = 0, n = get_class_n_subtypes(supertype); i < n; ++i) {
+ if (get_class_subtype(supertype, i) == clss)
+ /* Class already registered */
+ return;
+ }
+ ARR_APP1(ir_type *, supertype->attr.ca.subtypes, clss);
+}
+
+size_t get_class_n_supertypes(const ir_type *clss)
+{
+ assert(clss->type_op == type_class);
+ return ARR_LEN(clss->attr.ca.supertypes);
}
-/* manipulate private fields of struct */
-int get_struct_n_members (const type *strct) {
- assert(strct && (strct->type_op == type_struct));
- return (ARR_LEN (strct->attr.sa.members));
+size_t get_class_supertype_index(ir_type *clss, ir_type *super_clss)
+{
+ size_t i, n_supertypes = get_class_n_supertypes(clss);
+ assert(super_clss && (super_clss->type_op == type_class));
+ for (i = 0; i < n_supertypes; i++) {
+ if (get_class_supertype(clss, i) == super_clss)
+ return i;
+ }
+ return (size_t)-1;
}
-void add_struct_member (type *strct, entity *member) {
- assert(strct && (strct->type_op == type_struct));
- assert(get_type_tpop(get_entity_type(member)) != type_method);
- /* @@@ lowerfirm geht nicht durch */
- ARR_APP1 (entity *, strct->attr.sa.members, member);
+ir_type *get_class_supertype(ir_type *clss, size_t pos)
+{
+ assert(clss->type_op == type_class);
+ assert(pos < get_class_n_supertypes(clss));
+ return clss->attr.ca.supertypes[pos];
}
-entity *get_struct_member (const type *strct, int pos) {
- assert(strct && (strct->type_op == type_struct));
- assert(pos >= 0 && pos < get_struct_n_members(strct));
- return strct->attr.sa.members[pos];
+void set_class_supertype(ir_type *clss, ir_type *supertype, size_t pos)
+{
+ assert(clss->type_op == type_class);
+ assert(pos < get_class_n_supertypes(clss));
+ clss->attr.ca.supertypes[pos] = supertype;
}
-int get_struct_member_index(type *strct, entity *mem) {
- int i;
- assert(strct && (strct->type_op == type_struct));
- for (i = 0; i < get_struct_n_members(strct); i++)
- if (get_struct_member(strct, i) == mem)
- return i;
- return -1;
+void remove_class_supertype(ir_type *clss, ir_type *supertype)
+{
+ size_t i;
+ assert(clss && (clss->type_op == type_class));
+ for (i = 0; i < ARR_LEN(clss->attr.ca.supertypes); ++i) {
+ if (clss->attr.ca.supertypes[i] == supertype) {
+ for (; i < ARR_LEN(clss->attr.ca.supertypes) - 1; ++i)
+ clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
+ ARR_SETLEN(ir_type*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
+ break;
+ }
+ }
+}
+
+ir_entity *get_class_type_info(const ir_type *clss)
+{
+ return clss->attr.ca.type_info;
}
-void set_struct_member (type *strct, int pos, entity *member) {
- assert(strct && (strct->type_op == type_struct));
- assert(pos >= 0 && pos < get_struct_n_members(strct));
- assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
- strct->attr.sa.members[pos] = member;
+void set_class_type_info(ir_type *clss, ir_entity *ent)
+{
+ clss->attr.ca.type_info = ent;
+ if (ent)
+ ent->repr_class = clss;
}
-void remove_struct_member(type *strct, entity *member) {
- int i;
- assert(strct && (strct->type_op == type_struct));
- for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
- if (strct->attr.sa.members[i] == member) {
- for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
- strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
- ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
- break;
- }
+
+ir_peculiarity get_class_peculiarity(const ir_type *clss)
+{
+ assert(clss && (clss->type_op == type_class));
+ return clss->attr.ca.peculiarity;
}
-/* typecheck */
-int (is_struct_type)(const type *strct) {
- return __is_struct_type(strct);
+void set_class_peculiarity(ir_type *clss, ir_peculiarity pec)
+{
+ assert(clss && (clss->type_op == type_class));
+ assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
+ clss->attr.ca.peculiarity = pec;
}
-/*******************************************************************/
-/** TYPE_METHOD **/
-/*******************************************************************/
+unsigned (get_class_vtable_size)(const ir_type *clss)
+{
+ return _get_class_vtable_size(clss);
+}
-/**
- * Lazy construction of value argument / result representation.
- * Constructs a struct type and its member. The types of the members
- * are passed in the argument list.
- *
- * @param name name of the type constructed
- * @param len number of fields
- * @param tps array of field types with length len
- */
-static INLINE type *
-build_value_type(ident *name, int len, type **tps) {
- int i;
- type *res = new_type_struct(name);
- /* Remove type from type list. Must be treated differently than other types. */
- remove_irp_type_from_list(res);
- for (i = 0; i < len; i++) {
- type *elt_type = res; /* use res as default if corresponding type is not yet set. */
- if (tps[i]) elt_type = tps[i];
- new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
- }
- return res;
-}
-
-/* Create a new method type.
- N_param is the number of parameters, n_res the number of results. */
-type *new_type_method (ident *name, int n_param, int n_res) {
- type *res;
-
- assert((get_mode_size_bytes(mode_P_mach) != -1) && "unorthodox modes not implemented");
- res = new_type(type_method, mode_P_mach, name);
- res->state = layout_fixed;
- res->size = get_mode_size_bits(mode_P_mach);
- res->attr.ma.n_params = n_param;
- res->attr.ma.param_type = xmalloc(sizeof(*res->attr.ma.param_type) * n_param);
- res->attr.ma.value_params = NULL;
- res->attr.ma.n_res = n_res;
- res->attr.ma.res_type = xmalloc(sizeof(*res->attr.ma.res_type) * n_res);
- res->attr.ma.value_ress = NULL;
- res->attr.ma.variadicity = variadicity_non_variadic;
- res->attr.ma.first_variadic_param = -1;
-
- return res;
-}
-
-type *new_d_type_method (ident *name, int n_param, int n_res, dbg_info* db) {
- type *res = new_type_method (name, n_param, n_res);
- set_type_dbg_info(res, db);
- return res;
-}
-
-void free_method_entities(type *method) {
- assert(method && (method->type_op == type_method));
-}
-
-/* Attention: also frees entities in value parameter subtypes! */
-void free_method_attrs(type *method) {
- assert(method && (method->type_op == type_method));
- free(method->attr.ma.param_type);
- free(method->attr.ma.res_type);
- if (method->attr.ma.value_params) {
- free_type_entities(method->attr.ma.value_params);
- free_type(method->attr.ma.value_params);
- }
- if (method->attr.ma.value_ress) {
- free_type_entities(method->attr.ma.value_ress);
- free_type(method->attr.ma.value_ress);
- }
-}
-
-/* manipulate private fields of method. */
-int get_method_n_params (const type *method) {
- assert(method && (method->type_op == type_method));
- return method->attr.ma.n_params;
-}
-
-type *get_method_param_type(type *method, int pos) {
- type *res;
- assert(method && (method->type_op == type_method));
- assert(pos >= 0 && pos < get_method_n_params(method));
- res = method->attr.ma.param_type[pos];
- assert(res != NULL && "empty method param type");
- return method->attr.ma.param_type[pos] = skip_tid(res);
-}
-
-void set_method_param_type(type *method, int pos, type* tp) {
- assert(method && (method->type_op == type_method));
- assert(pos >= 0 && pos < get_method_n_params(method));
- method->attr.ma.param_type[pos] = tp;
- /* If information constructed set pass-by-value representation. */
- if (method->attr.ma.value_params) {
- assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
- set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
- }
-}
-
-/* Returns an entity that represents the copied value argument. Only necessary
- for compounds passed by value. */
-entity *get_method_value_param_ent(type *method, int pos) {
- assert(method && (method->type_op == type_method));
- assert(pos >= 0 && pos < get_method_n_params(method));
- if (!method->attr.ma.value_params)
- method->attr.ma.value_params
- = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
- get_method_n_params(method), method->attr.ma.param_type);
- assert((get_entity_type(get_struct_member(method->attr.ma.value_params, pos))
- != method->attr.ma.value_params)
- && "param type not yet set");
- return get_struct_member(method->attr.ma.value_params, pos);
+void (set_class_vtable_size)(ir_type *clss, unsigned size)
+{
+ _set_class_vtable_size(clss, size);
}
-/*
- * Returns a type that represents the copied value arguments.
- */
-type *get_method_value_param_type(const type *method)
+int (is_class_final)(const ir_type *clss)
+{
+ return _is_class_final(clss);
+}
+
+void (set_class_final)(ir_type *clss, int flag)
{
- assert(method && (method->type_op == type_method));
- return method->attr.ma.value_params;
+ _set_class_final(clss, flag);
}
-int get_method_n_ress (const type *method) {
- assert(method && (method->type_op == type_method));
- return method->attr.ma.n_res;
+int (is_class_interface)(const ir_type *clss)
+{
+ return _is_class_interface(clss);
}
-type *get_method_res_type(type *method, int pos) {
- type *res;
- assert(method && (method->type_op == type_method));
- assert(pos >= 0 && pos < get_method_n_ress(method));
- res = method->attr.ma.res_type[pos];
- assert(res != NULL && "empty method return type");
- return method->attr.ma.res_type[pos] = skip_tid(res);
+void (set_class_interface)(ir_type *clss, int flag)
+{
+ _set_class_interface(clss, flag);
}
-void set_method_res_type(type *method, int pos, type* tp) {
- assert(method && (method->type_op == type_method));
- assert(pos >= 0 && pos < get_method_n_ress(method));
- /* set the result type */
- method->attr.ma.res_type[pos] = tp;
- /* If information constructed set pass-by-value representation. */
- if (method->attr.ma.value_ress) {
- assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
- set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
- }
+int (is_class_abstract)(const ir_type *clss)
+{
+ return _is_class_abstract(clss);
}
-/* Returns an entity that represents the copied value result. Only necessary
- for compounds passed by value. */
-entity *get_method_value_res_ent(type *method, int pos) {
- assert(method && (method->type_op == type_method));
- assert(pos >= 0 && pos < get_method_n_ress(method));
- if (!method->attr.ma.value_ress)
- method->attr.ma.value_ress
- = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
- get_method_n_ress(method), method->attr.ma.res_type);
- assert((get_entity_type(get_struct_member(method->attr.ma.value_ress, pos)) != method->attr.ma.value_ress)
- && "result type not yet set");
- return get_struct_member(method->attr.ma.value_ress, pos);
+void (set_class_abstract)(ir_type *clss, int final)
+{
+ _set_class_abstract(clss, final);
}
-/*
- * Returns a type that represents the copied value results.
- */
-type *get_method_value_res_type(const type *method) {
- assert(method && (method->type_op == type_method));
- return method->attr.ma.value_ress;
+void set_class_dfn(ir_type *clss, int dfn)
+{
+ clss->attr.ca.dfn = dfn;
+}
+
+int get_class_dfn(const ir_type *clss)
+{
+ return (clss->attr.ca.dfn);
+}
+
+int (is_Class_type)(const ir_type *clss)
+{
+ return _is_class_type(clss);
+}
+
+void set_class_mode(ir_type *tp, ir_mode *mode)
+{
+ /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
+ assert(get_type_state(tp) == layout_fixed &&
+ tp->size == get_mode_size_bytes(mode) && "mode don't match class layout");
+ tp->mode = mode;
+}
+
+void set_class_size(ir_type *tp, unsigned size)
+{
+ tp->size = size;
+}
+
+
+ir_type *new_d_type_struct(ident *name, type_dbg_info *db)
+{
+ ir_type *res = new_type(type_struct, NULL, db);
+ res->name = name;
+
+ res->attr.sa.members = NEW_ARR_F(ir_entity *, 0);
+ hook_new_type(res);
+ return res;
+}
+
+ir_type *new_type_struct(ident *name)
+{
+ return new_d_type_struct (name, NULL);
+}
+
+void free_struct_entities(ir_type *strct)
+{
+ size_t i;
+ assert(strct && (strct->type_op == type_struct));
+ /* we must iterate backward here */
+ for (i = get_struct_n_members(strct); i > 0;)
+ free_entity(get_struct_member(strct, --i));
}
-/* Returns the null-terminated name of this variadicity. */
-const char *get_variadicity_name(variadicity vari)
+void free_struct_attrs(ir_type *strct)
+{
+ assert(strct && (strct->type_op == type_struct));
+ DEL_ARR_F(strct->attr.sa.members);
+}
+
+ident *get_struct_ident(const ir_type *strct)
+{
+ assert(strct->type_op == type_struct);
+ return strct->name;
+}
+
+const char *get_struct_name(const ir_type *strct)
+{
+ if (get_struct_ident(strct) == NULL)
+ return NULL;
+ return get_id_str(get_struct_ident(strct));
+}
+
+size_t get_struct_n_members(const ir_type *strct)
+{
+ assert(strct->type_op == type_struct);
+ return ARR_LEN(strct->attr.sa.members);
+}
+
+static void add_struct_member(ir_type *strct, ir_entity *member)
+{
+ assert(strct && (strct->type_op == type_struct));
+ assert(get_type_tpop(get_entity_type(member)) != type_method);
+ assert(strct != get_entity_type(member) && "recursive type");
+ ARR_APP1 (ir_entity *, strct->attr.sa.members, member);
+}
+
+ir_entity *get_struct_member(const ir_type *strct, size_t pos)
+{
+ assert(strct && (strct->type_op == type_struct));
+ assert(pos < get_struct_n_members(strct));
+ return strct->attr.sa.members[pos];
+}
+
+size_t get_struct_member_index(const ir_type *strct, ir_entity *mem)
+{
+ size_t i, n;
+ assert(strct && (strct->type_op == type_struct));
+ for (i = 0, n = get_struct_n_members(strct); i < n; ++i) {
+ if (get_struct_member(strct, i) == mem)
+ return i;
+ }
+ return (size_t)-1;
+}
+
+static void remove_struct_member(ir_type *strct, ir_entity *member)
+{
+ size_t i;
+ assert(strct && (strct->type_op == type_struct));
+ for (i = 0; i < ARR_LEN(strct->attr.sa.members); ++i) {
+ if (strct->attr.sa.members[i] == member) {
+ for (; i < ARR_LEN(strct->attr.sa.members) - 1; ++i)
+ strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
+ ARR_SETLEN(ir_entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
+ break;
+ }
+ }
+}
+
+int (is_Struct_type)(const ir_type *strct)
+{
+ return _is_struct_type(strct);
+}
+
+void set_struct_mode(ir_type *tp, ir_mode *mode)
+{
+ /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
+ assert(get_type_state(tp) == layout_fixed &&
+ tp->size == get_mode_size_bytes(mode) && "mode don't match struct layout");
+ tp->mode = mode;
+}
+
+void set_struct_size(ir_type *tp, unsigned size)
+{
+ tp->size = size;
+}
+
+ir_type *new_d_type_method(size_t n_param, size_t n_res, type_dbg_info *db)
+{
+ ir_type *res;
+
+ assert((get_mode_size_bits(mode_P_code) % 8 == 0) && "unorthodox modes not implemented");
+ res = new_type(type_method, mode_P_code, db);
+ res->flags |= tf_layout_fixed;
+ res->size = get_mode_size_bytes(mode_P_code);
+ res->attr.ma.n_params = n_param;
+ res->attr.ma.params = XMALLOCNZ(tp_ent_pair, n_param);
+ res->attr.ma.n_res = n_res;
+ res->attr.ma.res_type = XMALLOCNZ(tp_ent_pair, n_res);
+ res->attr.ma.variadicity = variadicity_non_variadic;
+ res->attr.ma.properties = mtp_no_property;
+ hook_new_type(res);
+ return res;
+}
+
+ir_type *new_type_method(size_t n_param, size_t n_res)
+{
+ return new_d_type_method(n_param, n_res, NULL);
+}
+
+ir_type *clone_type_method(ir_type *tp)
+{
+ ir_type *res;
+ ir_mode *mode;
+ size_t n_params;
+ size_t n_res;
+ type_dbg_info *db;
+
+ assert(is_Method_type(tp));
+
+ mode = tp->mode;
+ n_params = tp->attr.ma.n_params;
+ n_res = tp->attr.ma.n_res;
+ db = tp->dbi;
+
+ res = new_type(type_method, mode, db);
+
+ res->flags = tp->flags;
+ res->higher_type = tp->higher_type;
+ res->size = tp->size;
+ res->attr.ma.n_params = n_params;
+ res->attr.ma.params = XMALLOCN(tp_ent_pair, n_params);
+ memcpy(res->attr.ma.params, tp->attr.ma.params, n_params * sizeof(res->attr.ma.params[0]));
+ res->attr.ma.n_res = n_res;
+ res->attr.ma.res_type = XMALLOCN(tp_ent_pair, n_res);
+ memcpy(res->attr.ma.res_type, tp->attr.ma.res_type, n_res * sizeof(res->attr.ma.res_type[0]));
+ res->attr.ma.variadicity = tp->attr.ma.variadicity;
+ res->attr.ma.properties = tp->attr.ma.properties;
+ res->attr.ma.irg_calling_conv = tp->attr.ma.irg_calling_conv;
+ hook_new_type(res);
+ return res;
+}
+
+void free_method_entities(ir_type *method)
+{
+ (void) method;
+ assert(method && (method->type_op == type_method));
+}
+
+void free_method_attrs(ir_type *method)
+{
+ assert(method && (method->type_op == type_method));
+ free(method->attr.ma.params);
+ free(method->attr.ma.res_type);
+}
+
+size_t (get_method_n_params)(const ir_type *method)
+{
+ return _get_method_n_params(method);
+}
+
+ir_type *get_method_param_type(const ir_type *method, size_t pos)
+{
+ ir_type *res;
+ assert(method->type_op == type_method);
+ assert(pos < get_method_n_params(method));
+ res = method->attr.ma.params[pos].tp;
+ assert(res != NULL && "empty method param type");
+ return res;
+}
+
+void set_method_param_type(ir_type *method, size_t pos, ir_type *tp)
+{
+ assert(method->type_op == type_method);
+ assert(pos < get_method_n_params(method));
+ method->attr.ma.params[pos].tp = tp;
+}
+
+size_t (get_method_n_ress)(const ir_type *method)
+{
+ return _get_method_n_ress(method);
+}
+
+ir_type *get_method_res_type(const ir_type *method, size_t pos)
+{
+ ir_type *res;
+ assert(method->type_op == type_method);
+ assert(pos < get_method_n_ress(method));
+ res = method->attr.ma.res_type[pos].tp;
+ assert(res != NULL && "empty method return type");
+ return res;
+}
+
+void set_method_res_type(ir_type *method, size_t pos, ir_type *tp)
+{
+ assert(method->type_op == type_method);
+ assert(pos < get_method_n_ress(method));
+ /* set the result ir_type */
+ method->attr.ma.res_type[pos].tp = tp;
+ /* If information constructed set pass-by-value representation. */
+}
+
+const char *get_variadicity_name(ir_variadicity vari)
{
#define X(a) case a: return #a
- switch (vari) {
- X(variadicity_non_variadic);
- X(variadicity_variadic);
- default:
- return "BAD VALUE";
- }
+ switch (vari) {
+ X(variadicity_non_variadic);
+ X(variadicity_variadic);
+ default:
+ return "BAD VALUE";
+ }
#undef X
}
-variadicity get_method_variadicity(const type *method)
+ir_variadicity get_method_variadicity(const ir_type *method)
{
- assert(method && (method->type_op == type_method));
- return method->attr.ma.variadicity;
+ assert(method && (method->type_op == type_method));
+ return method->attr.ma.variadicity;
}
-void set_method_variadicity(type *method, variadicity vari)
+void set_method_variadicity(ir_type *method, ir_variadicity vari)
{
- assert(method && (method->type_op == type_method));
- method->attr.ma.variadicity = vari;
+ assert(method && (method->type_op == type_method));
+ method->attr.ma.variadicity = vari;
}
-/*
- * Returns the first variadic parameter index of a type.
- * If this index was NOT set, the index of the last parameter
- * of the method type plus one is returned for variadic functions.
- * Non-variadic function types always return -1 here.
- */
-int get_method_first_variadic_param_index(const type *method)
+mtp_additional_properties (get_method_additional_properties)(const ir_type *method)
{
- assert(method && (method->type_op == type_method));
+ return _get_method_additional_properties(method);
+}
- if (method->attr.ma.variadicity == variadicity_non_variadic)
- return -1;
+void (set_method_additional_properties)(ir_type *method, mtp_additional_properties mask)
+{
+ _set_method_additional_properties(method, mask);
+}
- if (method->attr.ma.first_variadic_param == -1)
- return get_method_n_params(method);
- return method->attr.ma.first_variadic_param;
+void (add_method_additional_properties)(ir_type *method,
+ mtp_additional_properties flag)
+{
+ _add_method_additional_properties(method, flag);
}
-/*
- * Sets the first variadic parameter index. This allows to specify
- * a complete call type (containing the type of all parameters)
- * but still have the knowledge, which parameter must be passed as
- * variadic one.
- */
-void set_method_first_variadic_param_index(type *method, int index)
-{
- assert(method && (method->type_op == type_method));
- assert(index >= 0 && index <= get_method_n_params(method));
-
- method->attr.ma.first_variadic_param = index;
-}
-
-/* typecheck */
-int (is_method_type)(const type *method) {
- return __is_method_type(method);
-}
-
-/*-----------------------------------------------------------------*/
-/* TYPE_UNION */
-/*-----------------------------------------------------------------*/
-
-/* create a new type uni */
-type *new_type_union (ident *name) {
- type *res;
- res = new_type(type_union, NULL, name);
- /*res->attr.ua.unioned_type = xmalloc(sizeof(*res->attr.ua.unioned_type) * n_types);
- res->attr.ua.delim_names = xmalloc(sizeof(*res->attr.ua.delim_names) * n_types); */
- res->attr.ua.members = NEW_ARR_F (entity *, 0);
- return res;
-}
-type *new_d_type_union (ident *name, dbg_info* db) {
- type *res = new_type_union (name);
- set_type_dbg_info(res, db);
- return res;
-}
-void free_union_entities (type *uni) {
- int i;
- assert(uni && (uni->type_op == type_union));
- for (i = get_union_n_members(uni)-1; i >= 0; --i)
- free_entity(get_union_member(uni, i));
-}
-void free_union_attrs (type *uni) {
- assert(uni && (uni->type_op == type_union));
- DEL_ARR_F(uni->attr.ua.members);
-}
-/* manipulate private fields of union */
-#if 0
-int get_union_n_types (type *uni) {
- assert(uni && (uni->type_op == type_union));
- return uni->attr.ua.n_types;
-}
-type *get_union_unioned_type (type *uni, int pos) {
- assert(uni && (uni->type_op == type_union));
- assert(pos >= 0 && pos < get_union_n_types(uni));
- return uni->attr.ua.unioned_type[pos] = skip_tid(uni->attr.ua.unioned_type[pos]);
-}
-void set_union_unioned_type (type *uni, int pos, type *tp) {
- assert(uni && (uni->type_op == type_union));
- assert(pos >= 0 && pos < get_union_n_types(uni));
- uni->attr.ua.unioned_type[pos] = tp;
-}
-ident *get_union_delim_nameid (type *uni, int pos) {
- assert(uni && (uni->type_op == type_union));
- assert(pos >= 0 && pos < get_union_n_types(uni));
- return uni->attr.ua.delim_names[pos];
-}
-const char *get_union_delim_name (type *uni, int pos) {
- assert(uni && (uni->type_op == type_union));
- assert(pos >= 0 && pos < get_union_n_types(uni));
- return get_id_str(uni->attr.ua.delim_names[pos]);
-}
-void set_union_delim_nameid (type *uni, int pos, ident *id) {
- assert(uni && (uni->type_op == type_union));
- assert(pos >= 0 && pos < get_union_n_types(uni));
- uni->attr.ua.delim_names[pos] = id;
+unsigned (get_method_calling_convention)(const ir_type *method)
+{
+ return _get_method_calling_convention(method);
}
-#endif
-int get_union_n_members (const type *uni) {
- assert(uni && (uni->type_op == type_union));
- return (ARR_LEN (uni->attr.ua.members));
+
+void (set_method_calling_convention)(ir_type *method, unsigned cc_mask)
+{
+ _set_method_calling_convention(method, cc_mask);
}
-void add_union_member (type *uni, entity *member) {
- assert(uni && (uni->type_op == type_union));
- ARR_APP1 (entity *, uni->attr.ua.members, member);
+
+unsigned get_method_n_regparams(ir_type *method)
+{
+ unsigned cc = get_method_calling_convention(method);
+ assert(IS_FASTCALL(cc));
+
+ return cc & ~cc_bits;
}
-entity *get_union_member (const type *uni, int pos) {
- assert(uni && (uni->type_op == type_union));
- assert(pos >= 0 && pos < get_union_n_members(uni));
- return uni->attr.ua.members[pos];
+
+void set_method_n_regparams(ir_type *method, unsigned n_regs)
+{
+ unsigned cc = get_method_calling_convention(method);
+ assert(IS_FASTCALL(cc));
+
+ set_method_calling_convention(method, (cc & cc_bits) | (n_regs & ~cc_bits));
+}
+
+int (is_Method_type)(const ir_type *method)
+{
+ return _is_method_type(method);
}
-void set_union_member (type *uni, int pos, entity *member) {
- assert(uni && (uni->type_op == type_union));
- assert(pos >= 0 && pos < get_union_n_members(uni));
- uni->attr.ua.members[pos] = member;
+
+
+ir_type *new_d_type_union(ident *name, type_dbg_info *db)
+{
+ ir_type *res = new_type(type_union, NULL, db);
+ res->name = name;
+
+ res->attr.ua.members = NEW_ARR_F(ir_entity *, 0);
+ hook_new_type(res);
+ return res;
}
-void remove_union_member(type *uni, entity *member) {
- int i;
- assert(uni && (uni->type_op == type_union));
- for (i = 0; i < (ARR_LEN (uni->attr.ua.members)); i++)
- if (uni->attr.ua.members[i] == member) {
- for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
- uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
- ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
- break;
- }
+
+ir_type *new_type_union(ident *name)
+{
+ return new_d_type_union(name, NULL);
+}
+
+void free_union_entities(ir_type *uni)
+{
+ size_t i;
+ assert(uni && (uni->type_op == type_union));
+ /* we must iterate backward here */
+ for (i = get_union_n_members(uni); i > 0;)
+ free_entity(get_union_member(uni, --i));
+}
+
+void free_union_attrs(ir_type *uni)
+{
+ assert(uni && (uni->type_op == type_union));
+ DEL_ARR_F(uni->attr.ua.members);
}
-/* typecheck */
-int (is_union_type)(const type *uni) {
- return __is_union_type(uni);
+ident *get_union_ident(const ir_type *uni)
+{
+ assert(uni->type_op == type_union);
+ return uni->name;
}
-/*-----------------------------------------------------------------*/
-/* TYPE_ARRAY */
-/*-----------------------------------------------------------------*/
+const char *get_union_name(const ir_type *uni)
+{
+ if (get_union_ident(uni) == NULL)
+ return NULL;
+ return get_id_str(get_union_ident(uni));
+}
+size_t get_union_n_members(const ir_type *uni)
+{
+ assert(uni->type_op == type_union);
+ return ARR_LEN(uni->attr.ua.members);
+}
-/* create a new type array -- set dimension sizes independently */
-type *new_type_array (ident *name, int n_dimensions,
- type *element_type) {
- type *res;
- int i;
- ir_graph *rem = current_ir_graph;
- assert(!is_method_type(element_type));
+static void add_union_member(ir_type *uni, ir_entity *member)
+{
+ assert(uni->type_op == type_union);
+ assert(uni != get_entity_type(member) && "recursive type");
+ ARR_APP1(ir_entity *, uni->attr.ua.members, member);
+}
- res = new_type(type_array, NULL, name);
- res->attr.aa.n_dimensions = n_dimensions;
- res->attr.aa.lower_bound = xmalloc(sizeof(*res->attr.aa.lower_bound) * n_dimensions);
- res->attr.aa.upper_bound = xmalloc(sizeof(*res->attr.aa.upper_bound) * n_dimensions);
- res->attr.aa.order = xmalloc(sizeof(*res->attr.aa.order) * n_dimensions);
+ir_entity *get_union_member(const ir_type *uni, size_t pos)
+{
+ assert(uni->type_op == type_union);
+ assert(pos < get_union_n_members(uni));
+ return uni->attr.ua.members[pos];
+}
- current_ir_graph = get_const_code_irg();
- for (i = 0; i < n_dimensions; i++) {
- res->attr.aa.lower_bound[i] = new_Unknown(mode_Iu);
- res->attr.aa.upper_bound[i] = new_Unknown(mode_Iu);
- res->attr.aa.order[i] = i;
- }
- current_ir_graph = rem;
+size_t get_union_member_index(const ir_type *uni, ir_entity *mem)
+{
+ size_t i, n;
+ assert(uni && (uni->type_op == type_union));
+ for (i = 0, n = get_union_n_members(uni); i < n; ++i) {
+ if (get_union_member(uni, i) == mem)
+ return i;
+ }
+ return (size_t)-1;
+}
- res->attr.aa.element_type = element_type;
- new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
+static void remove_union_member(ir_type *uni, ir_entity *member)
+{
+ size_t i;
+ assert(uni && (uni->type_op == type_union));
+ for (i = 0; i < ARR_LEN(uni->attr.ua.members); ++i) {
+ if (uni->attr.ua.members[i] == member) {
+ for (; i < ARR_LEN(uni->attr.ua.members) - 1; i++)
+ uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
+ ARR_SETLEN(ir_entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
+ break;
+ }
+ }
+}
+
+int (is_Union_type)(const ir_type *uni)
+{
+ return _is_union_type(uni);
+}
- return res;
+void set_union_size(ir_type *tp, unsigned size)
+{
+ tp->size = size;
}
-type *new_d_type_array (ident *name, int n_dimensions,
- type *element_type, dbg_info* db) {
- type *res = new_type_array (name, n_dimensions, element_type);
- set_type_dbg_info(res, db);
- return res;
+
+
+ir_type *new_d_type_array(size_t n_dimensions, ir_type *element_type,
+ type_dbg_info *db)
+{
+ ir_type *res;
+ size_t i;
+ ir_node *unk;
+ ir_graph *irg = get_const_code_irg();
+
+ assert(!is_Method_type(element_type));
+
+ res = new_type(type_array, NULL, db);
+ res->attr.aa.n_dimensions = n_dimensions;
+ res->attr.aa.lower_bound = XMALLOCNZ(ir_node*, n_dimensions);
+ res->attr.aa.upper_bound = XMALLOCNZ(ir_node*, n_dimensions);
+ res->attr.aa.order = XMALLOCNZ(size_t, n_dimensions);
+
+ unk = new_r_Unknown(irg, mode_Iu);
+ for (i = 0; i < n_dimensions; i++) {
+ res->attr.aa.lower_bound[i] =
+ res->attr.aa.upper_bound[i] = unk;
+ res->attr.aa.order[i] = i;
+ }
+
+ res->attr.aa.element_type = element_type;
+ res->attr.aa.element_ent
+ = new_entity(NULL, new_id_from_chars("elem_ent", 8), element_type);
+ res->attr.aa.element_ent->owner = res;
+
+ hook_new_type(res);
+ return res;
}
-void free_array_entities (type *array) {
- assert(array && (array->type_op == type_array));
+ir_type *new_type_array(size_t n_dimensions, ir_type *element_type)
+{
+ return new_d_type_array(n_dimensions, element_type, NULL);
}
-void free_array_attrs (type *array) {
- assert(array && (array->type_op == type_array));
- free(array->attr.aa.lower_bound);
- free(array->attr.aa.upper_bound);
+void free_array_automatic_entities(ir_type *array)
+{
+ assert(array->type_op == type_array);
+ free_entity(get_array_element_entity(array));
}
-/* manipulate private fields of array type */
-int get_array_n_dimensions (const type *array) {
- assert(array && (array->type_op == type_array));
- return array->attr.aa.n_dimensions;
+void free_array_entities(ir_type *array)
+{
+ (void) array;
+ assert(array->type_op == type_array);
}
-void
-set_array_bounds (type *array, int dimension, ir_node * lower_bound,
- ir_node * upper_bound) {
- assert(array && (array->type_op == type_array));
- assert(lower_bound && "lower_bound node may not be NULL.");
- assert(upper_bound && "upper_bound node may not be NULL.");
- assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
- array->attr.aa.lower_bound[dimension] = lower_bound;
- array->attr.aa.upper_bound[dimension] = upper_bound;
+void free_array_attrs(ir_type *array)
+{
+ assert(array->type_op == type_array);
+ free(array->attr.aa.lower_bound);
+ free(array->attr.aa.upper_bound);
+ free(array->attr.aa.order);
}
-void
-set_array_bounds_int (type *array, int dimension, int lower_bound,
- int upper_bound) {
- ir_graph *rem = current_ir_graph;
- current_ir_graph = get_const_code_irg();
- set_array_bounds (array, dimension,
- new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
- new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
- current_ir_graph = rem;
-}
-void
-set_array_lower_bound (type *array, int dimension, ir_node * lower_bound) {
- assert(array && (array->type_op == type_array));
- assert(lower_bound && "lower_bound node may not be NULL.");
- array->attr.aa.lower_bound[dimension] = lower_bound;
-}
-void set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
- ir_graph *rem = current_ir_graph;
- current_ir_graph = get_const_code_irg();
- set_array_lower_bound (array, dimension,
- new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
- current_ir_graph = rem;
-}
-void
-set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
- assert(array && (array->type_op == type_array));
+
+size_t get_array_n_dimensions(const ir_type *array)
+{
+ assert(array->type_op == type_array);
+ return array->attr.aa.n_dimensions;
+}
+
+void set_array_bounds(ir_type *array, size_t dimension, ir_node *lower_bound,
+ ir_node *upper_bound)
+{
+ assert(array->type_op == type_array);
+ assert(lower_bound && "lower_bound node may not be NULL.");
+ assert(upper_bound && "upper_bound node may not be NULL.");
+ assert(dimension < array->attr.aa.n_dimensions);
+ array->attr.aa.lower_bound[dimension] = lower_bound;
+ array->attr.aa.upper_bound[dimension] = upper_bound;
+}
+
+void set_array_bounds_int(ir_type *array, size_t dimension, int lower_bound,
+ int upper_bound)
+{
+ ir_graph *irg = get_const_code_irg();
+ set_array_bounds(array, dimension,
+ new_r_Const_long(irg, mode_Iu, lower_bound),
+ new_r_Const_long(irg, mode_Iu, upper_bound));
+}
+
+void set_array_lower_bound(ir_type *array, size_t dimension,
+ ir_node *lower_bound)
+{
+ assert(array->type_op == type_array);
+ assert(lower_bound && "lower_bound node may not be NULL.");
+ array->attr.aa.lower_bound[dimension] = lower_bound;
+}
+
+void set_array_lower_bound_int(ir_type *array, size_t dimension, int lower_bound)
+{
+ ir_graph *irg = get_const_code_irg();
+ set_array_lower_bound(array, dimension,
+ new_r_Const_long(irg, mode_Iu, lower_bound));
+}
+
+void set_array_upper_bound(ir_type *array, size_t dimension, ir_node *upper_bound)
+{
+ assert(array->type_op == type_array);
assert(upper_bound && "upper_bound node may not be NULL.");
array->attr.aa.upper_bound[dimension] = upper_bound;
}
-void set_array_upper_bound_int (type *array, int dimension, int upper_bound) {
- ir_graph *rem = current_ir_graph;
- current_ir_graph = get_const_code_irg();
- set_array_upper_bound (array, dimension,
- new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
- current_ir_graph = rem;
+
+void set_array_upper_bound_int(ir_type *array, size_t dimension, int upper_bound)
+{
+ ir_graph *irg = get_const_code_irg();
+ set_array_upper_bound(array, dimension,
+ new_r_Const_long(irg, mode_Iu, upper_bound));
+}
+
+int has_array_lower_bound(const ir_type *array, size_t dimension)
+{
+ assert(array->type_op == type_array);
+ return !is_Unknown(array->attr.aa.lower_bound[dimension]);
+}
+
+ir_node *get_array_lower_bound(const ir_type *array, size_t dimension)
+{
+ assert(array->type_op == type_array);
+ return array->attr.aa.lower_bound[dimension];
+}
+
+long get_array_lower_bound_int(const ir_type *array, size_t dimension)
+{
+ ir_node *node;
+ assert(array->type_op == type_array);
+ node = array->attr.aa.lower_bound[dimension];
+ return get_tarval_long(get_Const_tarval(node));
+}
+
+int has_array_upper_bound(const ir_type *array, size_t dimension)
+{
+ assert(array->type_op == type_array);
+ return !is_Unknown(array->attr.aa.upper_bound[dimension]);
+}
+
+ir_node *get_array_upper_bound(const ir_type *array, size_t dimension)
+{
+ assert(array->type_op == type_array);
+ return array->attr.aa.upper_bound[dimension];
+}
+
+long get_array_upper_bound_int(const ir_type *array, size_t dimension)
+{
+ ir_node *node;
+ assert(array->type_op == type_array);
+ node = array->attr.aa.upper_bound[dimension];
+ return get_tarval_long(get_Const_tarval(node));
+}
+
+void set_array_order(ir_type *array, size_t dimension, size_t order)
+{
+ assert(array->type_op == type_array);
+ array->attr.aa.order[dimension] = order;
+}
+
+size_t get_array_order(const ir_type *array, size_t dimension)
+{
+ assert(array->type_op == type_array);
+ return array->attr.aa.order[dimension];
+}
+
+size_t find_array_dimension(const ir_type *array, size_t order)
+{
+ size_t dim;
+
+ assert(array->type_op == type_array);
+
+ for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
+ if (array->attr.aa.order[dim] == order)
+ return dim;
+ }
+ return (size_t)-1;
+}
+
+void set_array_element_type(ir_type *array, ir_type *tp)
+{
+ assert(array->type_op == type_array);
+ assert(!is_Method_type(tp));
+ array->attr.aa.element_type = tp;
+}
+
+ir_type *get_array_element_type(const ir_type *array)
+{
+ assert(array->type_op == type_array);
+ return array->attr.aa.element_type;
+}
+
+void set_array_element_entity(ir_type *array, ir_entity *ent)
+{
+ assert(array->type_op == type_array);
+ assert((get_entity_type(ent)->type_op != type_method));
+ array->attr.aa.element_ent = ent;
+ array->attr.aa.element_type = get_entity_type(ent);
+}
+
+ir_entity *get_array_element_entity(const ir_type *array)
+{
+ assert(array->type_op == type_array);
+ return array->attr.aa.element_ent;
+}
+
+int is_array_variable_size(const ir_type *array)
+{
+ assert(array->type_op == type_array);
+ return (array->flags & tf_variable_size) != 0;
+}
+
+void set_array_variable_size(ir_type *array, int flag)
+{
+ assert(array->type_op == type_array);
+ array->flags = (array->flags & ~tf_variable_size)
+ | (flag != 0 ? tf_variable_size : 0);
}
-int has_array_lower_bound (const type *array, int dimension) {
- assert(array && (array->type_op == type_array));
- return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
+
+int (is_Array_type)(const ir_type *array)
+{
+ return _is_array_type(array);
}
-ir_node *get_array_lower_bound (const type *array, int dimension) {
- assert(array && (array->type_op == type_array));
- return array->attr.aa.lower_bound[dimension];
+
+void set_array_size(ir_type *tp, unsigned size)
+{
+ /* FIXME: Here we should make some checks with the element type size */
+ tp->size = size;
}
-long get_array_lower_bound_int (const type *array, int dimension) {
- ir_node *node;
- assert(array && (array->type_op == type_array));
- node = array->attr.aa.lower_bound[dimension];
- assert(get_irn_op(node) == op_Const);
- return get_tarval_long(get_Const_tarval(node));
+
+
+ir_type *new_d_type_enumeration(ident *name, size_t n_enums, type_dbg_info *db)
+{
+ ir_type *res;
+
+ res = new_type(type_enumeration, NULL, db);
+ res->name = name;
+ res->attr.ea.enumer = NEW_ARR_F(ir_enum_const, n_enums);
+ hook_new_type(res);
+ return res;
}
-int has_array_upper_bound (const type *array, int dimension) {
- assert(array && (array->type_op == type_array));
- return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
+
+ir_type *new_type_enumeration(ident *name, size_t n_enums)
+{
+ return new_d_type_enumeration(name, n_enums, NULL);
}
-ir_node * get_array_upper_bound (const type *array, int dimension) {
- assert(array && (array->type_op == type_array));
- return array->attr.aa.upper_bound[dimension];
+
+void free_enumeration_entities(ir_type *enumeration)
+{
+ (void) enumeration;
+ assert(enumeration->type_op == type_enumeration);
}
-long get_array_upper_bound_int (const type *array, int dimension) {
- ir_node *node;
- assert(array && (array->type_op == type_array));
- node = array->attr.aa.upper_bound[dimension];
- assert(get_irn_op(node) == op_Const);
- return get_tarval_long(get_Const_tarval(node));
+
+void free_enumeration_attrs(ir_type *enumeration)
+{
+ assert(enumeration->type_op == type_enumeration);
+ DEL_ARR_F(enumeration->attr.ea.enumer);
}
-void set_array_order (type *array, int dimension, int order) {
- assert(array && (array->type_op == type_array));
- array->attr.aa.order[dimension] = order;
+ident *get_enumeration_ident(const ir_type *enumeration)
+{
+ assert(enumeration->type_op == type_enumeration);
+ return enumeration->name;
}
-int get_array_order (const type *array, int dimension) {
- assert(array && (array->type_op == type_array));
- return array->attr.aa.order[dimension];
+
+const char *get_enumeration_name(const ir_type *enumeration)
+{
+ if (get_enumeration_ident(enumeration) == NULL)
+ return NULL;
+ return get_id_str(get_enumeration_ident(enumeration));
}
-void set_array_element_type (type *array, type *tp) {
- assert(array && (array->type_op == type_array));
- assert(!is_method_type(tp));
- array->attr.aa.element_type = tp;
-}
-type *get_array_element_type (type *array) {
- assert(array && (array->type_op == type_array));
- return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
-}
-
-void set_array_element_entity (type *array, entity *ent) {
- assert(array && (array->type_op == type_array));
- assert((get_entity_type(ent)->type_op != type_method));
- array->attr.aa.element_ent = ent;
- array->attr.aa.element_type = get_entity_type(ent);
-}
-entity *get_array_element_entity (const type *array) {
- assert(array && (array->type_op == type_array));
- return array->attr.aa.element_ent;
-}
-
-/* typecheck */
-int (is_array_type)(const type *array) {
- return __is_array_type(array);
-}
-
-/*-----------------------------------------------------------------*/
-/* TYPE_ENUMERATION */
-/*-----------------------------------------------------------------*/
+size_t get_enumeration_n_enums(const ir_type *enumeration)
+{
+ assert(enumeration->type_op == type_enumeration);
+ return ARR_LEN(enumeration->attr.ea.enumer);
+}
-/* create a new type enumeration -- set the enumerators independently */
-type *new_type_enumeration (ident *name, int n_enums) {
- type *res;
- res = new_type(type_enumeration, NULL, name);
- res->attr.ea.n_enums = n_enums;
- res->attr.ea.enumer = xmalloc(sizeof(res->attr.ea.enumer[0]) * n_enums);
- res->attr.ea.enum_nameid = xmalloc(sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
- memset(res->attr.ea.enumer, 0, sizeof(res->attr.ea.enumer[0]) * n_enums);
- memset(res->attr.ea.enum_nameid, 0, sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
- return res;
-}
-type *new_d_type_enumeration (ident *name, int n_enums, dbg_info* db) {
- type *res = new_type_enumeration (name, n_enums);
- set_type_dbg_info(res, db);
- return res;
+void set_enumeration_const(ir_type *enumeration, size_t pos, ident *nameid,
+ ir_tarval *con)
+{
+ assert(pos < ARR_LEN(enumeration->attr.ea.enumer));
+ enumeration->attr.ea.enumer[pos].nameid = nameid;
+ enumeration->attr.ea.enumer[pos].value = con;
+ enumeration->attr.ea.enumer[pos].owner = enumeration;
}
-void free_enumeration_entities(type *enumeration) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
+ir_enum_const *get_enumeration_const(const ir_type *enumeration, size_t pos)
+{
+ assert(enumeration->type_op == type_enumeration);
+ assert(pos < get_enumeration_n_enums(enumeration));
+ return &enumeration->attr.ea.enumer[pos];
}
-void free_enumeration_attrs(type *enumeration) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
- free(enumeration->attr.ea.enumer);
- free(enumeration->attr.ea.enum_nameid);
+
+ir_type *get_enumeration_owner(const ir_enum_const *enum_cnst)
+{
+ return enum_cnst->owner;
}
-/* manipulate fields of enumeration type. */
-int get_enumeration_n_enums (const type *enumeration) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
- return enumeration->attr.ea.n_enums;
+void set_enumeration_value(ir_enum_const *enum_cnst, ir_tarval *con)
+{
+ enum_cnst->value = con;
}
-void set_enumeration_enum (type *enumeration, int pos, tarval *con) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
- assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
- enumeration->attr.ea.enumer[pos] = con;
+
+ir_tarval *get_enumeration_value(const ir_enum_const *enum_cnst)
+{
+ return enum_cnst->value;
}
-tarval *get_enumeration_enum (const type *enumeration, int pos) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
- assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
- return enumeration->attr.ea.enumer[pos];
+
+void set_enumeration_nameid(ir_enum_const *enum_cnst, ident *id)
+{
+ enum_cnst->nameid = id;
}
-void set_enumeration_nameid (type *enumeration, int pos, ident *id) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
- assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
- enumeration->attr.ea.enum_nameid[pos] = id;
+
+ident *get_enumeration_const_nameid(const ir_enum_const *enum_cnst)
+{
+ return enum_cnst->nameid;
}
-ident *get_enumeration_nameid (const type *enumeration, int pos) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
- assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
- return enumeration->attr.ea.enum_nameid[pos];
+
+const char *get_enumeration_const_name(const ir_enum_const *enum_cnst)
+{
+ return get_id_str(enum_cnst->nameid);
}
-const char *get_enumeration_name(const type *enumeration, int pos) {
- assert(enumeration && (enumeration->type_op == type_enumeration));
- assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
- return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
+
+int (is_Enumeration_type)(const ir_type *enumeration)
+{
+ return _is_enumeration_type(enumeration);
}
-/* typecheck */
-int (is_enumeration_type)(const type *enumeration) {
- return __is_enumeration_type(enumeration);
+void set_enumeration_mode(ir_type *tp, ir_mode *mode)
+{
+ assert(mode_is_int(mode) && "Modes of enumerations must be integers");
+ /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
+ assert((get_mode_size_bits(mode) % 8) == 0 && "unorthodox modes not implemented");
+
+ tp->size = get_mode_size_bytes(mode);
+ tp->mode = mode;
}
-/*-----------------------------------------------------------------*/
-/* TYPE_POINTER */
-/*-----------------------------------------------------------------*/
-/* Create a new type pointer */
-type *new_type_pointer_mode (ident *name, type *points_to, ir_mode *ptr_mode) {
- type *res;
- assert(mode_is_reference(ptr_mode));
- res = new_type(type_pointer, ptr_mode, name);
- res->attr.pa.points_to = points_to;
- assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
- res->size = get_mode_size_bits(res->mode);
- res->state = layout_fixed;
- return res;
+
+ir_type *new_d_type_pointer(ir_type *points_to, type_dbg_info *db)
+{
+ ir_type *res;
+ ir_mode *mode;
+
+ if (is_Method_type(points_to) || is_code_type(points_to)) {
+ mode = mode_P_code;
+ } else {
+ mode = mode_P_data;
+ }
+
+ res = new_type(type_pointer, mode, db);
+ res->attr.pa.points_to = points_to;
+ assert((get_mode_size_bits(res->mode) % 8 == 0) && "unorthodox modes not implemented");
+ res->size = get_mode_size_bytes(res->mode);
+ res->flags |= tf_layout_fixed;
+ hook_new_type(res);
+ return res;
}
-type *new_d_type_pointer (ident *name, type *points_to, ir_mode *ptr_mode, dbg_info* db) {
- type *res = new_type_pointer_mode (name, points_to, ptr_mode);
- set_type_dbg_info(res, db);
- return res;
+
+ir_type *new_type_pointer(ir_type *points_to)
+{
+ return new_d_type_pointer(points_to, NULL);
}
-void free_pointer_entities (type *pointer) {
- assert(pointer && (pointer->type_op == type_pointer));
+
+void free_pointer_entities(ir_type *pointer)
+{
+ (void) pointer;
+ assert(pointer && (pointer->type_op == type_pointer));
}
-void free_pointer_attrs (type *pointer) {
- assert(pointer && (pointer->type_op == type_pointer));
+
+void free_pointer_attrs(ir_type *pointer)
+{
+ (void) pointer;
+ assert(pointer && (pointer->type_op == type_pointer));
}
-/* manipulate fields of type_pointer */
-void set_pointer_points_to_type (type *pointer, type *tp) {
- assert(pointer && (pointer->type_op == type_pointer));
- pointer->attr.pa.points_to = tp;
+
+void set_pointer_points_to_type(ir_type *pointer, ir_type *tp)
+{
+ assert(pointer && (pointer->type_op == type_pointer));
+ pointer->attr.pa.points_to = tp;
}
-type *get_pointer_points_to_type (type *pointer) {
- assert(pointer && (pointer->type_op == type_pointer));
- return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
+
+ir_type *get_pointer_points_to_type(const ir_type *pointer)
+{
+ assert(pointer && (pointer->type_op == type_pointer));
+ return pointer->attr.pa.points_to;
}
-/* typecheck */
-int (is_pointer_type)(const type *pointer) {
- return __is_pointer_type(pointer);
+int (is_Pointer_type)(const ir_type *pointer)
+{
+ return _is_pointer_type(pointer);
}
-/* Returns the first pointer type that has as points_to tp.
- * Not efficient: O(#types).
- * If not found returns unknown_type. */
-type *find_pointer_type_to_type (type *tp) {
- int i;
- for (i = 0; i < get_irp_n_types(); ++i) {
- type *found = get_irp_type(i);
- if (is_pointer_type(found) && get_pointer_points_to_type(found) == tp)
- return (found);
- }
- return unknown_type;
+void set_pointer_mode(ir_type *tp, ir_mode *mode)
+{
+ assert(mode_is_reference(mode) && "Modes of pointers must be references");
+ /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
+ assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
+
+ tp->size = get_mode_size_bytes(mode);
+ tp->mode = mode;
}
+ir_type *find_pointer_type_to_type(ir_type *tp)
+{
+ size_t i, n = get_irp_n_types();
+ for (i = 0; i < n; ++i) {
+ ir_type *found = get_irp_type(i);
+ if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
+ return (found);
+ }
+ return get_unknown_type();
+}
-/*-----------------------------------------------------------------*/
-/* TYPE_PRIMITIVE */
-/*-----------------------------------------------------------------*/
+ir_type *new_d_type_primitive(ir_mode *mode, type_dbg_info *db)
+{
+ ir_type *res = new_type(type_primitive, mode, db);
+ res->size = get_mode_size_bytes(mode);
+ res->flags |= tf_layout_fixed;
+ res->attr.ba.base_type = NULL;
+ hook_new_type(res);
+ return res;
+}
-/* create a new type primitive */
-type *new_type_primitive (ident *name, ir_mode *mode) {
- type *res;
- /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
- res = new_type(type_primitive, mode, name);
- res->size = get_mode_size_bits(mode);
- res->state = layout_fixed;
- return res;
+ir_type *new_type_primitive(ir_mode *mode)
+{
+ return new_d_type_primitive(mode, NULL);
}
-type *new_d_type_primitive (ident *name, ir_mode *mode, dbg_info* db) {
- type *res = new_type_primitive (name, mode);
- set_type_dbg_info(res, db);
- return res;
+
+int (is_Primitive_type)(const ir_type *primitive)
+{
+ return _is_primitive_type(primitive);
}
-void free_primitive_entities (type *primitive) {
- assert(primitive && (primitive->type_op == type_primitive));
+
+void set_primitive_mode(ir_type *tp, ir_mode *mode)
+{
+ /* Modes of primitives must be data */
+ assert(mode_is_data(mode));
+
+ /* For primitive size depends on the mode. */
+ tp->size = get_mode_size_bytes(mode);
+ tp->mode = mode;
}
-void free_primitive_attrs (type *primitive) {
- assert(primitive && (primitive->type_op == type_primitive));
+
+ir_type *get_primitive_base_type(const ir_type *tp)
+{
+ assert(is_Primitive_type(tp));
+ return tp->attr.ba.base_type;
}
-/* typecheck */
-int (is_primitive_type)(const type *primitive) {
- return __is_primitive_type(primitive);
+void set_primitive_base_type(ir_type *tp, ir_type *base_tp)
+{
+ assert(is_Primitive_type(tp));
+ tp->attr.ba.base_type = base_tp;
}
-/*-----------------------------------------------------------------*/
-/* common functionality */
-/*-----------------------------------------------------------------*/
-int (is_atomic_type)(const type *tp) {
- return __is_atomic_type(tp);
+int (is_atomic_type)(const ir_type *tp)
+{
+ return _is_atomic_type(tp);
}
-/*
- * Gets the number of elements in a firm compound type.
- */
-int get_compound_n_members(const type *tp)
+size_t get_compound_n_members(const ir_type *tp)
{
- int res = 0;
+ const tp_op *op = get_type_tpop(tp);
+ return op->ops.get_n_members(tp);
+}
- if (is_struct_type(tp))
- res = get_struct_n_members(tp);
- else if (is_class_type(tp))
- res = get_class_n_members(tp);
- else if (is_union_type(tp))
- res = get_union_n_members(tp);
- else
- assert(0 && "need struct, union or class for member count");
+ir_entity *get_compound_member(const ir_type *tp, size_t pos)
+{
+ const tp_op *op = get_type_tpop(tp);
+ return op->ops.get_member(tp, pos);
+}
- return res;
+size_t get_compound_member_index(const ir_type *tp, ir_entity *member)
+{
+ const tp_op *op = get_type_tpop(tp);
+ return op->ops.get_member_index(tp, member);
}
-/*
- * Gets the member of a firm compound type at position pos.
- */
-entity *get_compound_member(const type *tp, int pos)
+void set_compound_variable_size(ir_type *tp, int variable_size_flag)
{
- entity *res;
+ assert(is_compound_type(tp));
+ tp->flags = (tp->flags & ~tf_variable_size)
+ | (variable_size_flag != 0 ? tf_variable_size : 0);
+}
- if (is_struct_type(tp))
- res = get_struct_member(tp, pos);
- else if (is_class_type(tp))
- res = get_class_member(tp, pos);
- else if (is_union_type(tp))
- res = get_union_member(tp, pos);
- else
- {
- assert(0 && "need struct, union or class to get a member");
- res = NULL;
- }
+int is_compound_variable_size(const ir_type *tp)
+{
+ assert(is_compound_type(tp));
+ return (tp->flags & tf_variable_size) != 0;
+}
- return res;
+int is_compound_type(const ir_type *tp)
+{
+ assert(tp->kind == k_type);
+ return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
}
+ident *get_compound_ident(const ir_type *tp)
+{
+ assert(is_compound_type(tp));
+ return tp->name;
+}
-int is_compound_type(const type *tp) {
- assert(tp && tp->kind == k_type);
- return (is_class_type(tp) || is_struct_type(tp) ||
- is_array_type(tp) || is_union_type(tp));
+const char *get_compound_name(const ir_type *tp)
+{
+ if (get_compound_ident(tp) == NULL)
+ return NULL;
+ return get_id_str(get_compound_ident(tp));
+}
+
+void remove_compound_member(ir_type *compound, ir_entity *entity)
+{
+ switch (get_type_tpop_code(compound)) {
+ case tpo_class: remove_class_member(compound, entity); break;
+ case tpo_struct: remove_struct_member(compound, entity); break;
+ case tpo_union: remove_union_member(compound, entity); break;
+ default:
+ panic("argument for remove_compound_member not a compound type");
+ }
+}
+
+void add_compound_member(ir_type *compound, ir_entity *entity)
+{
+ switch (get_type_tpop_code(compound)) {
+ case tpo_class: add_class_member(compound, entity); break;
+ case tpo_struct: add_struct_member(compound, entity); break;
+ case tpo_union: add_union_member(compound, entity); break;
+ default:
+ panic("argument for add_compound_member not a compound type");
+ }
+}
+
+int is_code_type(const ir_type *tp)
+{
+ assert(tp->kind == k_type);
+ return tp->type_op == tpop_code;
+}
+
+int is_unknown_type(const ir_type *tp)
+{
+ assert(tp->kind == k_type);
+ return tp->type_op == tpop_unknown;
+}
+
+int is_none_type(const ir_type *tp)
+{
+ assert(tp->kind == k_type);
+ return tp->type_op == tpop_none;
+}
+
+int is_frame_type(const ir_type *tp)
+{
+ return tp->flags & tf_frame_type;
+}
+
+ir_type *new_type_frame(void)
+{
+ ir_type *res = new_type_class(new_id_from_str("<frame_type>"));
+
+ res->flags |= tf_frame_type;
+
+ /* It is not possible to derive from the frame type. Set the final flag. */
+ set_class_final(res, 1);
+
+ return res;
+}
+
+ir_type *clone_frame_type(ir_type *type)
+{
+ ir_type *res;
+ size_t i, n;
+
+ assert(is_frame_type(type));
+ /* the entity link resource should be allocated if this function is called */
+ assert(irp_resources_reserved(irp) & IRP_RESOURCE_ENTITY_LINK);
+
+ res = new_type_frame();
+ for (i = 0, n = get_class_n_members(type); i < n; ++i) {
+ ir_entity *ent = get_class_member(type, i);
+ ir_entity *nent = copy_entity_own(ent, res);
+ set_entity_link(ent, nent);
+ set_entity_link(nent, ent);
+ }
+ return res;
+}
+
+void set_default_size(ir_type *tp, unsigned size)
+{
+ tp->size = size;
+}
+
+void default_layout_compound_type(ir_type *type)
+{
+ size_t i;
+ size_t n = get_compound_n_members(type);
+ int size = 0;
+ unsigned align_all = 1;
+ bool var_size = is_compound_variable_size(type);
+
+ for (i = 0; i < n; ++i) {
+ ir_entity *entity = get_compound_member(type, i);
+ ir_type *entity_type = get_entity_type(entity);
+ unsigned align;
+ unsigned misalign;
+ unsigned entity_size;
+
+ if (is_Method_type(entity_type))
+ continue;
+
+ if (i+1 < n || !var_size) {
+ assert(get_type_state(entity_type) == layout_fixed);
+ entity_size = get_type_size_bytes(entity_type);
+ } else {
+ entity_size = 0;
+ }
+
+ align = get_type_alignment_bytes(entity_type);
+ align_all = align > align_all ? align : align_all;
+ misalign = (align ? size % align : 0);
+ size += (misalign ? align - misalign : 0);
+
+ set_entity_offset(entity, size);
+ if (!is_Union_type(type)) {
+ size += entity_size;
+ }
+ }
+ if (align_all > 0 && size % align_all) {
+ size += align_all - (size % align_all);
+ }
+ if (align_all > get_type_alignment_bytes(type)) {
+ set_type_alignment_bytes(type, align_all);
+ }
+ set_type_size_bytes(type, size);
+ set_type_state(type, layout_fixed);
+}
+
+ir_entity *frame_alloc_area(ir_type *frame_type, int size, unsigned alignment,
+ int at_start)
+{
+ ir_entity *area;
+ ir_type *tp;
+ ident *name;
+ char buf[32];
+ int offset;
+ unsigned frame_size = get_type_size_bytes(frame_type);
+ unsigned frame_align = get_type_alignment_bytes(frame_type);
+ static unsigned area_cnt = 0;
+
+ assert(is_frame_type(frame_type));
+ assert(get_type_state(frame_type) == layout_fixed);
+ assert(get_type_alignment_bytes(frame_type) > 0);
+ set_type_state(frame_type, layout_undefined);
+
+ if (irp->byte_type == NULL)
+ irp->byte_type = new_type_primitive(mode_Bu);
+
+ snprintf(buf, sizeof(buf), "area%u", area_cnt++);
+ name = new_id_from_str(buf);
+
+ tp = new_type_array(1, irp->byte_type);
+ set_array_bounds_int(tp, 0, 0, size);
+ set_type_alignment_bytes(tp, alignment);
+ set_type_size_bytes(tp, size);
+
+ if (at_start) {
+ size_t i, n;
+ unsigned delta = (size + frame_align - 1) & ~(frame_align - 1);
+ /* fix all offsets so far */
+ for (i = 0, n = get_class_n_members(frame_type); i < n; ++i) {
+ ir_entity *ent = get_class_member(frame_type, i);
+
+ set_entity_offset(ent, get_entity_offset(ent) + delta);
+ }
+ /* calculate offset and new type size */
+ offset = 0;
+ frame_size += delta;
+ } else {
+ /* calculate offset and new type size */
+ offset = (frame_size + alignment - 1) & ~(alignment - 1);
+ frame_size = offset + size;
+ }
+
+ area = new_entity(frame_type, name, tp);
+ set_entity_offset(area, offset);
+ set_type_size_bytes(frame_type, frame_size);
+ if (alignment > frame_align) {
+ set_type_alignment_bytes(frame_type, alignment);
+ }
+
+ /* mark this entity as compiler generated */
+ set_entity_compiler_generated(area, 1);
+
+ set_type_state(frame_type, layout_fixed);
+ return area;
+}
+
+void ir_print_type(char *buffer, size_t buffer_size, const ir_type *type)
+{
+ ident *id;
+ int p;
+ type_dbg_info *tdbgi = get_type_dbg_info(type);
+ if (tdbgi != NULL) {
+ ir_retrieve_type_dbg_info(buffer, buffer_size, tdbgi);
+ return;
+ }
+
+ /* we have to construct some name... */
+ switch (get_type_tpop_code(type)) {
+ case tpo_uninitialized:
+ break;
+ case tpo_code:
+ snprintf(buffer, buffer_size, "code");
+ return;
+
+ case tpo_class:
+ id = get_class_ident(type);
+ snprintf(buffer, buffer_size, "class '%s'", get_id_str(id));
+ return;
+
+ case tpo_struct:
+ id = get_struct_ident(type);
+ snprintf(buffer, buffer_size, "struct '%s'", get_id_str(id));
+ return;
+
+ case tpo_union:
+ id = get_union_ident(type);
+ snprintf(buffer, buffer_size, "union '%s'", get_id_str(id));
+ return;
+
+ case tpo_enumeration:
+ id = get_enumeration_ident(type);
+ snprintf(buffer, buffer_size, "enumeration '%s'", get_id_str(id));
+ return;
+
+ case tpo_unknown:
+ snprintf(buffer, buffer_size, "unknown type");
+ return;
+
+ case tpo_pointer:
+ p = snprintf(buffer, buffer_size, "pointer to ");
+ buffer += p;
+ buffer_size -= p;
+ ir_print_type(buffer, buffer_size, get_pointer_points_to_type(type));
+ return;
+
+ case tpo_array:
+ p = snprintf(buffer, buffer_size, "array of ");
+ buffer += p;
+ buffer_size -= p;
+ ir_print_type(buffer, buffer_size, get_array_element_type(type));
+ return;
+
+ case tpo_primitive:
+ id = get_mode_ident(get_type_mode(type));
+ snprintf(buffer, buffer_size, "%s", get_id_str(id));
+ return;
+
+ case tpo_none:
+ snprintf(buffer, buffer_size, "none");
+ return;
+ case tpo_method:
+ /* TODO: we should print argument and return types here... */
+ snprintf(buffer, buffer_size, "method type");
+ return;
+ }
+ snprintf(buffer, buffer_size, "invalid type");
}