+/*
+ * 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.
+ */
+
/**
*
* file type.c - implementation of the datastructure to hold
* type information.
* (C) 2001 by Universitaet Karlsruhe
- * Martin Trapp, Christian Schaefer, Goetz Lindenmaier
+ * Goetz Lindenmaier
*
* This module supplies a datastructure to represent all types
* known in the compiled program. This includes types specified
* @see type_t.h type tpop
*/
-/* $Id$ */
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
# include <string.h>
# include "type_t.h"
# include "tpop_t.h"
-# include "typegmod_t.h"
+# include "irprog_t.h"
+# include "typegmod.h"
# include "array.h"
# include "irprog.h"
# include "mangle.h"
/** TYPE **/
/*******************************************************************/
+type *none_type; type *get_none_type(void) { return none_type; }
+type *unknown_type; type *get_unknown_type(void) { return unknown_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 = 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 (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 (unknown_type, 0);
+ set_type_state (unknown_type, layout_fixed);
+ remove_irp_type(unknown_type);
+}
+
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) {
+ 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. */
if (is_array_type(tp))
free_entity(get_array_element_entity(tp));
/* And now the type itself... */
+ tp->kind = k_BAD;
free(tp);
}
const char* get_type_tpop_name(type *tp) {
assert(tp && tp->kind == k_type);
- return id_to_str(tp->type_op->name);
+ return get_id_str(tp->type_op->name);
}
tp_opcode get_type_tpop_code(type *tp) {
void set_type_mode(type *tp, ir_mode* m) {
assert(tp && tp->kind == k_type);
- assert(((tp->type_op != type_primitive) || mode_is_data(m)) &&
+ 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)));
+ ((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. */
- if ((tp->type_op == type_primitive) || (tp->type_op == type_enumeration)) {
+ if ((tp->type_op == type_primitive) ||
+ (tp->type_op == type_enumeration) ||
+ (tp->type_op == type_pointer) ) {
/* 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;
}
}
#ifdef DEBUG_libfirm
return tp->nr;
#else
- return 0;
+ return (long)tp;
#endif
}
const char* get_type_name(type *tp) {
assert(tp && tp->kind == k_type);
- return (id_to_str(tp->name));
+ return (get_id_str(tp->name));
}
int get_type_size(type *tp) {
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));
+ (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
}
} break;
case tpo_struct:
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((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
}
} break;
case tpo_union:
if (typ1 == typ2) return true;
if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
- (get_type_name(typ1) != get_type_name(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;
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_name(t2) == get_type_name(t1))
+ if (get_type_ident(t2) == get_type_ident(t1))
t[i] = t2;
}
}
res = new_type(type_class, NULL, name);
- res->attr.ca.members = NEW_ARR_F (entity *, 1);
- res->attr.ca.subtypes = NEW_ARR_F (type *, 1);
- res->attr.ca.supertypes = NEW_ARR_F (type *, 1);
- res->attr.ca.peculiarity = existent;
- res->attr.ca.dfn = 0;
+ res->attr.ca.members = NEW_ARR_F (entity *, 1);
+ res->attr.ca.subtypes = NEW_ARR_F (type *, 1);
+ res->attr.ca.supertypes = NEW_ARR_F (type *, 1);
+ res->attr.ca.peculiarity = peculiarity_existent;
+ res->attr.ca.dfn = 0;
return res;
}
}
}
+char *get_peculiarity_string(peculiarity p) {
+ if (p == peculiarity_description)
+ return "peculiarity_description";
+ if (p == peculiarity_inherited)
+ return "peculiarity_inherited";
+ return "peculiarity_existent";
+}
+
INLINE peculiarity get_class_peculiarity (type *clss) {
assert(clss && (clss->type_op == type_class));
return clss->attr.ca.peculiarity;
}
INLINE void set_class_peculiarity (type *clss, peculiarity pec) {
assert(clss && (clss->type_op == type_class));
- assert(pec != inherited); /* There is no inheritance of types in libFirm. */
+ assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
clss->attr.ca.peculiarity = pec;
}
/** 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. */
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);
- res->attr.ma.variadicity = non_variadic;
+ 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 = 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(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);
}
+type *get_method_value_res_type(type *method) {
+ assert(method && (method->type_op == type_method));
+ return method->attr.ma.value_params;
+}
+
+
int get_method_n_ress (type *method) {
assert(method && (method->type_op == type_method));
return method->attr.ma.n_res;
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);
+ }
+}
+/* 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);
+}
+
+/* Returns the null-terminated name of this variadicity. */
+const char *get_variadicity_name(variadicity vari)
+{
+#define X(a) case a: return #a
+ switch (vari) {
+ X(variadicity_non_variadic);
+ X(variadicity_variadic);
+ default:
+ return "BAD VALUE";
+ }
+#undef X
}
variadicity get_method_variadicity(type *method)
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 id_to_str(uni->attr.ua.delim_names[pos]);
+ 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));
type *element_type) {
type *res;
int i;
+ ir_graph *rem = current_ir_graph;
assert(!is_method_type(element_type));
+
res = new_type(type_array, NULL, name);
res->attr.aa.n_dimensions = n_dimensions;
res->attr.aa.lower_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
res->attr.aa.upper_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
res->attr.aa.order = (int *) xmalloc (sizeof (int) * n_dimensions);
+ current_ir_graph = get_const_code_irg();
for (i = 0; i < n_dimensions; i++) {
- res->attr.aa.lower_bound[i] = NULL;
- res->attr.aa.upper_bound[i] = NULL;
+ res->attr.aa.lower_bound[i] = new_Unknown();
+ res->attr.aa.upper_bound[i] = new_Unknown();
res->attr.aa.order[i] = i;
}
+ current_ir_graph = rem;
+
res->attr.aa.element_type = element_type;
new_entity(res, mangle_u(name, id_from_str("elem_ent", 8)), element_type);
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;
}
ir_graph *rem = current_ir_graph;
current_ir_graph = get_const_code_irg();
set_array_bounds (array, dimension,
- new_Const(mode_Iu, tarval_from_long (mode_Iu, lower_bound)),
- new_Const(mode_Iu, tarval_from_long (mode_Iu, 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
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, tarval_from_long (mode_Iu, lower_bound)));
+ new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
current_ir_graph = rem;
}
INLINE void
set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
assert(array && (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, tarval_from_long (mode_Iu, upper_bound)));
+ new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
current_ir_graph = rem;
}
+int has_array_lower_bound (type *array, int dimension) {
+ assert(array && (array->type_op == type_array));
+ return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
+}
ir_node * get_array_lower_bound (type *array, int dimension) {
assert(array && (array->type_op == type_array));
return array->attr.aa.lower_bound[dimension];
}
+int has_array_upper_bound (type *array, int dimension) {
+ assert(array && (array->type_op == type_array));
+ return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
+}
ir_node * get_array_upper_bound (type *array, int dimension) {
assert(array && (array->type_op == type_array));
return array->attr.aa.upper_bound[dimension];
const char *get_enumeration_name(type *enumeration, int pos) {
assert(enumeration && (enumeration->type_op == type_enumeration));
assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
- return id_to_str(enumeration->attr.ea.enum_nameid[pos]);
+ return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
}
/* typecheck */
/*******************************************************************/
/* Create a new type pointer */
-INLINE 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, dbg_info* db) {
- type *res = new_type_pointer (name, points_to);
+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;
}
if (pointer->type_op == type_pointer) return 1; else return 0;
}
+/* 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;
+}
+
+
/*******************************************************************/
/** TYPE_PRIMITIVE **/
/* create a new type primitive */
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;
}
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;
}