-/****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$ */
# include <stdlib.h>
# include <stddef.h>
+# include <string.h>
# include "type_t.h"
# include "tpop_t.h"
# include "typegmod_t.h"
/*******************************************************************/
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) {
/* Remove from list of all types */
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(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);
}
} 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++) {
}
} break;
case tpo_array: {
- type *set, *let; /* small/large elt. type */
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)))
}
} 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++) {
/*******************************************************************/
/* 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;
/*******************************************************************/
/* 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;
/* 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, name);
res->state = layout_fixed;
- res->size = get_mode_size(mode_p);
+ 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;
+ 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(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] = type;
+ method->attr.ma.param_type[pos] = tp;
}
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;
+ method->attr.ma.res_type[pos] = tp;
+}
+
+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;
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;
+}
INLINE void free_array_attrs (type *array) {
assert(array && (array->type_op == type_array));
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, tarval_from_long (mode_Iu, lower_bound)),
+ new_Const(mode_Iu, tarval_from_long (mode_Iu, upper_bound)));
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, tarval_from_long (mode_Iu, lower_bound)));
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, tarval_from_long (mode_Iu, upper_bound)));
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 (ident *name, type *points_to) {
type *res;
- res = new_type(type_pointer, mode_p, name);
+ res = new_type(type_pointer, mode_P, name);
res->attr.pa.points_to = points_to;
res->size = get_mode_size(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);
+ 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 == mode_P)); */
res = new_type(type_primitive, mode, name);
res->size = get_mode_size(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));
}
projects / libfirm / blobdiff