-/****h* libfirm/type.c
+/**
*
- * NAME
* file type.c - implementation of the datastructure to hold
* type information.
- * COPYRIGHT
* (C) 2001 by Universitaet Karlsruhe
- * AUTHORS
* Martin Trapp, Christian Schaefer, Goetz Lindenmaier
*
- * NOTES
* This module supplies a datastructure to represent all types
* known in the compiled program. This includes types specified
* in the program as well as types defined by the language. In the
* on the level of the programming language, modes at the level of
* the target processor.
*
- * SEE ALSO
- * type_t.h type tpop
- *****
+ * @see type_t.h type tpop
*/
/* $Id$ */
+#ifdef HAVE_CONFIG_H
+# include <config.h>
+#endif
+
# include <stdlib.h>
# include <stddef.h>
+# include <string.h>
# include "type_t.h"
# include "tpop_t.h"
+# include "irprog_t.h"
# include "typegmod_t.h"
# include "array.h"
# include "irprog.h"
/** TYPE **/
/*******************************************************************/
+#ifdef DEBUG_libfirm
+/** Returns a new, unique number to number nodes or the like. */
+int get_irp_new_node_nr(void);
+#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 = id_from_str(VALUE_PARAMS_SUFFIX, strlen(VALUE_PARAMS_SUFFIX));
+ value_ress_suffix = id_from_str(VALUE_RESS_SUFFIX, strlen(VALUE_RESS_SUFFIX));
+}
+
unsigned long type_visited;
+INLINE void set_master_type_visited(unsigned long val) { type_visited = val; }
+INLINE unsigned long get_master_type_visited() { return type_visited; }
+INLINE void inc_master_type_visited() { type_visited++; }
-void
-free_type(type *tp) {
- /* @@@ not implemented */
+void free_type(type *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 type */
+ if (is_array_type(tp))
+ free_entity(get_array_element_entity(tp));
+ /* And now the type itself... */
+ free(tp);
}
INLINE type *
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 = (type *) xmalloc (node_size);
res->size = -1;
res->visit = 0;
res -> link = NULL;
+#ifdef DEBUG_libfirm
+ res->nr = get_irp_new_node_nr();
+#endif
return res;
}
if ((tp->type_op == type_primitive) || (tp->type_op == type_enumeration)) {
/* For pointer, primitive and enumeration size depends on the mode. */
- tp->size = get_mode_size(m);
+ assert((get_mode_size_bytes(m) != -1) && "unorthodox modes not implemented");
+ tp->size = get_mode_size_bytes(m);
tp->mode = m;
}
}
tp->name = id;
}
+/* Outputs a unique number for this node */
+INLINE long
+get_type_nr(type *tp) {
+ assert(tp);
+#ifdef DEBUG_libfirm
+ return tp->nr;
+#else
+ return 0;
+#endif
+}
+
const char* get_type_name(type *tp) {
assert(tp && tp->kind == k_type);
return (id_to_str(tp->name));
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) &&
+ if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
(tp->type_op == type_method))
return;
assert(get_type_size(tp) > -1);
if (tp != get_glob_type())
for (i = 0; i < get_class_n_members(tp); i++) {
+ if (get_entity_offset(get_class_member(tp, i)) <= -1)
+ { DDMT(tp); DDME(get_class_member(tp, i)); }
assert(get_entity_offset(get_class_member(tp, i)) > -1);
assert(is_method_type(get_entity_type(get_class_member(tp, i))) ||
(get_entity_allocation(get_class_member(tp, i)) == automatic_allocated));
- /* @@@ lowerfirm geht nicht durch */
}
} break;
case tpo_struct:
{
- /* assert(get_type_size(tp) > -1); @@@ lowerfirm geht nicht durch */
+ assert(get_type_size(tp) > -1);
for (i = 0; i < get_struct_n_members(tp); i++) {
assert(get_entity_offset(get_struct_member(tp, i)) > -1);
assert((get_entity_allocation(get_struct_member(tp, i)) == automatic_allocated));
assert(tp->visit < type_visited);
tp->visit = type_visited;
}
+/* @@@ name clash with master flag
+bool type_visited(type *tp) {
+ assert(tp && tp->kind == k_type);
+ return tp->visit >= type_visited;
+ }*/
+bool type_not_visited(type *tp) {
+ assert(tp && tp->kind == k_type);
+ return tp->visit < type_visited;
+}
+
int is_type (void *thing) {
assert(thing);
return 0;
}
+
+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(typ1) != get_type_size(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: {
+ if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return false;
+ if (get_method_n_params(typ1) != get_method_n_params(typ2)) return false;
+ if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return false;
+ for (i = 0; i < get_method_n_params(typ1); 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: {
+ 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(set) != get_type_size(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) {
+INLINE type *new_type_class (ident *name) {
type *res;
res = new_type(type_class, NULL, name);
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;
+}
INLINE void free_class_attrs(type *clss) {
assert(clss && (clss->type_op == type_class));
DEL_ARR_F(clss->attr.ca.members);
assert(clss && (clss->type_op == type_class));
return (ARR_LEN (clss->attr.ca.members))-1;
}
+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 (type *clss, int pos) {
assert(clss && (clss->type_op == type_class));
assert(pos >= 0 && pos < get_class_n_members(clss));
void remove_class_member(type *clss, entity *member) {
int i;
assert(clss && (clss->type_op == type_class));
- for (i = 1; i < (ARR_LEN (clss->attr.ca.members))-1; i++)
- if (clss->attr.ca.members[i+1] == member) {
- for(i++; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
+ for (i = 1; 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) {
void remove_class_subtype(type *clss, type *subtype) {
int i;
assert(clss && (clss->type_op == type_class));
- for (i = 1; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
- if (clss->attr.ca.subtypes[i+1] == subtype) {
- for(i++; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
+ for (i = 1; 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;
assert(clss && (clss->type_op == type_class));
return (ARR_LEN (clss->attr.ca.supertypes))-1;
}
+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));
void remove_class_supertype(type *clss, type *supertype) {
int i;
assert(clss && (clss->type_op == type_class));
- for (i = 1; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
- if (clss->attr.ca.supertypes[i+1] == supertype) {
- for(i++; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
+ for (i = 1; 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;
if (clss->type_op == type_class) return 1; else return 0;
}
+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;
+}
+
/*******************************************************************/
/** TYPE_STRUCT **/
/*******************************************************************/
/* create a new type struct */
-type *new_type_struct (ident *name) {
+INLINE type *new_type_struct (ident *name) {
type *res;
res = new_type(type_struct, NULL, name);
res->attr.sa.members = NEW_ARR_F (entity *, 1);
return res;
}
+type *new_d_type_struct (ident *name, dbg_info* db) {
+ type *res = new_type_struct (name);
+ set_type_dbg_info(res, db);
+ return res;
+}
INLINE void free_struct_attrs (type *strct) {
assert(strct && (strct->type_op == type_struct));
DEL_ARR_F(strct->attr.sa.members);
void remove_struct_member(type *strct, entity *member) {
int i;
assert(strct && (strct->type_op == type_struct));
- for (i = 1; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
- if (strct->attr.sa.members[i+1] == member) {
- for(i++; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
+ for (i = 1; 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;
/** TYPE_METHOD **/
/*******************************************************************/
+/* Lazy construction of value argument / result representation. */
+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) {
+INLINE type *new_type_method (ident *name, int n_param, int n_res) {
type *res;
- res = new_type(type_method, mode_p, name);
+ res = new_type(type_method, mode_P_mach, name);
res->state = layout_fixed;
- res->size = get_mode_size(mode_p);
- res->attr.ma.n_params = n_param;
- res->attr.ma.param_type = (type **) xmalloc (sizeof (type *) * n_param);
- res->attr.ma.n_res = n_res;
- res->attr.ma.res_type = (type **) xmalloc (sizeof (type *) * n_res);
+ assert((get_mode_size_bytes(mode_P_mach) != -1) && "unorthodox modes not implemented");
+ res->size = get_mode_size_bytes(mode_P_mach);
+ res->attr.ma.n_params = n_param;
+ res->attr.ma.param_type = (type **) xmalloc (sizeof (type *) * n_param);
+ res->attr.ma.value_params = NULL;
+ res->attr.ma.n_res = n_res;
+ res->attr.ma.res_type = (type **) xmalloc (sizeof (type *) * n_res);
+ res->attr.ma.value_ress = NULL;
+ res->attr.ma.variadicity = non_variadic;
+
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;
+}
+
INLINE 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);
}
+
/* manipulate private fields of method. */
int get_method_n_params (type *method) {
assert(method && (method->type_op == type_method));
assert(pos >= 0 && pos < get_method_n_params(method));
return method->attr.ma.param_type[pos] = skip_tid(method->attr.ma.param_type[pos]);
}
-void set_method_param_type(type *method, int pos, type* type) {
+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));
- method->attr.ma.param_type[pos] = type;
+ 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);
}
int get_method_n_ress (type *method) {
assert(pos >= 0 && pos < get_method_n_ress(method));
return method->attr.ma.res_type[pos] = skip_tid(method->attr.ma.res_type[pos]);
}
-void set_method_res_type(type *method, int pos, type* type) {
+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));
- method->attr.ma.res_type[pos] = type;
+ /* 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);
+ }
+}
+/* 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);
+}
+
+variadicity get_method_variadicity(type *method)
+{
+ assert(method && (method->type_op == type_method));
+ return method->attr.ma.variadicity;
+}
+
+void set_method_variadicity(type *method, variadicity vari)
+{
+ assert(method && (method->type_op == type_method));
+ method->attr.ma.variadicity = vari;
}
/* typecheck */
assert(method);
if (method->type_op == type_method) return 1; else return 0;
}
-/*****/
/*******************************************************************/
/** TYPE_UNION **/
/*******************************************************************/
/* create a new type uni */
-type *new_type_uni (ident *name) {
+INLINE type *new_type_union (ident *name) {
type *res;
res = new_type(type_union, NULL, name);
/*res->attr.ua.unioned_type = (type **) xmalloc (sizeof (type *) * n_types);
res->attr.ua.members = NEW_ARR_F (entity *, 1);
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;
+}
INLINE void free_union_attrs (type *uni) {
assert(uni && (uni->type_op == type_union));
DEL_ARR_F(uni->attr.ua.members);
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 *type) {
+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] = type;
+ uni->attr.ua.unioned_type[pos] = tp;
}
ident *get_union_delim_nameid (type *uni, int pos) {
assert(uni && (uni->type_op == type_union));
void remove_union_member(type *uni, entity *member) {
int i;
assert(uni && (uni->type_op == type_union));
- for (i = 1; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
- if (uni->attr.ua.members[i+1] == member) {
- for(i++; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
+ for (i = 1; 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;
/* create a new type array -- set dimension sizes independently */
-type *new_type_array (ident *name, int n_dimensions,
+INLINE type *new_type_array (ident *name, int n_dimensions,
type *element_type) {
type *res;
int i;
}
res->attr.aa.element_type = element_type;
new_entity(res, mangle_u(name, id_from_str("elem_ent", 8)), element_type);
+
+ return res;
+}
+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_graph *rem = current_ir_graph;
current_ir_graph = get_const_code_irg();
set_array_bounds (array, dimension,
- new_Const(mode_I, tarval_from_long (mode_I, lower_bound)),
- new_Const(mode_I, tarval_from_long (mode_I, upper_bound)));
+ 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;
}
INLINE void
ir_graph *rem = current_ir_graph;
current_ir_graph = get_const_code_irg();
set_array_lower_bound (array, dimension,
- new_Const(mode_I, tarval_from_long (mode_I, lower_bound)));
+ new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
current_ir_graph = rem;
}
INLINE void
ir_graph *rem = current_ir_graph;
current_ir_graph = get_const_code_irg();
set_array_upper_bound (array, dimension,
- new_Const(mode_I, tarval_from_long (mode_I, upper_bound)));
+ new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
current_ir_graph = rem;
}
ir_node * get_array_lower_bound (type *array, int dimension) {
return array->attr.aa.order[dimension];
}
-void set_array_element_type (type *array, type *type) {
+void set_array_element_type (type *array, type *tp) {
assert(array && (array->type_op == type_array));
- assert(!is_method_type(type));
- array->attr.aa.element_type = type;
+ 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));
/*******************************************************************/
/* create a new type enumeration -- set the enumerators independently */
-type *new_type_enumeration (ident *name, int n_enums) {
+INLINE type *new_type_enumeration (ident *name, int n_enums) {
type *res;
int i;
res = new_type(type_enumeration, NULL, name);
}
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;
+}
INLINE void free_enumeration_attrs(type *enumeration) {
assert(enumeration && (enumeration->type_op == type_enumeration));
/*******************************************************************/
/* Create a new type pointer */
-type *new_type_pointer (ident *name, type *points_to) {
+INLINE type *new_type_pointer_mode (ident *name, type *points_to, ir_mode *ptr_mode) {
type *res;
- res = new_type(type_pointer, mode_p, name);
+ assert(mode_is_reference(ptr_mode));
+ res = new_type(type_pointer, ptr_mode, name);
res->attr.pa.points_to = points_to;
- res->size = get_mode_size(res->mode);
+ assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
+ res->size = get_mode_size_bytes(res->mode);
res->state = layout_fixed;
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;
+}
INLINE void free_pointer_attrs (type *pointer) {
assert(pointer && (pointer->type_op == type_pointer));
}
/* manipulate fields of type_pointer */
-void set_pointer_points_to_type (type *pointer, type *type) {
+void set_pointer_points_to_type (type *pointer, type *tp) {
assert(pointer && (pointer->type_op == type_pointer));
- pointer->attr.pa.points_to = type;
+ pointer->attr.pa.points_to = tp;
}
type *get_pointer_points_to_type (type *pointer) {
assert(pointer && (pointer->type_op == type_pointer));
/*******************************************************************/
/* create a new type primitive */
-type *new_type_primitive (ident *name, ir_mode *mode) {
+INLINE type *new_type_primitive (ident *name, ir_mode *mode) {
type *res;
- /* @@@ assert( mode_is_data(mode) && (!mode == mode_p)); */
+ /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
res = new_type(type_primitive, mode, name);
- res->size = get_mode_size(mode);
+ assert((get_mode_size_bytes(mode) != -1) && "unorthodox modes not implemented");
+ res->size = get_mode_size_bytes(mode);
res->state = layout_fixed;
return res;
}
+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;
+}
INLINE void free_primitive_attrs (type *primitive) {
assert(primitive && (primitive->type_op == type_primitive));
}
return (is_primitive_type(tp) || is_pointer_type(tp) ||
is_enumeration_type(tp));
}
+
+/*
+ * Gets the number of elements in a firm compound type.
+ */
+int get_compound_n_members(type *tp)
+{
+ int res = 0;
+
+ 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");
+
+ return res;
+}
+
+/*
+ * Gets the member of a firm compound type at position pos.
+ */
+entity *get_compound_member(type *tp, int pos)
+{
+ entity *res;
+
+ 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;
+ }
+
+ return res;
+}
+
+
INLINE int is_compound_type(type *tp) {
assert(tp && tp->kind == k_type);
return (is_class_type(tp) || is_struct_type(tp) ||