/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
* @see type_t.h type tpop
*/
-#ifdef HAVE_CONFIG_H
-# include "config.h"
-#endif
+#include "config.h"
#ifdef HAVE_STRING_H
# include <string.h>
}
/** the global type visited flag */
-unsigned long firm_type_visited;
+ir_visited_t firm_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(); }
+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.
tp->flags &= ~tf_layout_fixed;
}
-unsigned long (get_type_visited)(const ir_type *tp) {
+ir_visited_t (get_type_visited)(const ir_type *tp) {
return _get_type_visited(tp);
}
-void (set_type_visited)(ir_type *tp, unsigned long num) {
+void (set_type_visited)(ir_type *tp, ir_visited_t num) {
_set_type_visited(tp, num);
}
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 = alloca(sizeof(ir_entity *) * get_class_n_members(typ1));
- memset(m, 0, sizeof(ir_entity *) * get_class_n_members(typ1));
+ 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);
return 0;
}
/** Compare the supertypes **/
- t = alloca(sizeof(ir_entity *) * get_class_n_supertypes(typ1));
- memset(t, 0, sizeof(ir_entity *) * get_class_n_supertypes(typ1));
+ 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);
case tpo_struct:
if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
- m = alloca(sizeof(ir_entity *) * get_struct_n_members(typ1));
- memset(m, 0, sizeof(ir_entity *) * get_struct_n_members(typ1));
+ 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);
case tpo_union:
if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
- m = alloca(sizeof(ir_entity *) * get_union_n_members(typ1));
- memset(m, 0, sizeof(ir_entity *) * get_union_n_members(typ1));
+ 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);
if (n_st_members != get_struct_n_members(lt))
return 0;
- m = alloca(sizeof(ir_entity *) * n_st_members);
- memset(m, 0, sizeof(ir_entity *) * n_st_members);
+ 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);
case tpo_union:
n_st_members = get_union_n_members(st);
if (n_st_members != get_union_n_members(lt)) return 0;
- m = alloca(sizeof(ir_entity *) * n_st_members);
- memset(m, 0, sizeof(ir_entity *) * n_st_members);
+ 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);
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");
+ assert(get_type_state(clss) != layout_fixed);
ARR_APP1 (ir_entity *, clss->attr.ca.members, 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");
+ assert(get_type_state(strct) != layout_fixed);
ARR_APP1 (ir_entity *, strct->attr.sa.members, member);
}
ir_type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
ir_type *res;
- assert((get_mode_size_bytes(mode_P_code) != -1) && "unorthodox modes not implemented");
+ assert((get_mode_size_bits(mode_P_code) % 8 == 0) && "unorthodox modes not implemented");
res = new_type(type_method, mode_P_code, name, 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 = xcalloc(n_param, sizeof(res->attr.ma.params[0]));
+ res->attr.ma.params = XMALLOCNZ(tp_ent_pair, n_param);
res->attr.ma.value_params = NULL;
res->attr.ma.n_res = n_res;
- res->attr.ma.res_type = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
+ res->attr.ma.res_type = XMALLOCNZ(tp_ent_pair, n_res);
res->attr.ma.value_ress = NULL;
res->attr.ma.variadicity = variadicity_non_variadic;
res->attr.ma.first_variadic_param = -1;
return new_d_type_method(name, n_param, n_res, NULL);
}
+/* clone an existing method type */
+ir_type *clone_type_method(ir_type *tp, ident *prefix) {
+ ir_type *res;
+ ident *name;
+ ir_mode *mode;
+ int n_params, n_res;
+ dbg_info *db;
+
+ assert(is_Method_type(tp));
+
+ name = tp->name;
+ if (prefix != NULL)
+ name = mangle(prefix, name);
+
+ 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, name, db);
+
+ res->flags = tp->flags;
+ res->assoc_type = tp->assoc_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.value_params = tp->attr.ma.value_params;
+ 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.value_ress = tp->attr.ma.value_ress;
+ res->attr.ma.variadicity = tp->attr.ma.variadicity;
+ res->attr.ma.first_variadic_param = tp->attr.ma.first_variadic_param;
+ res->attr.ma.additional_properties = tp->attr.ma.additional_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));
assert(method && (method->type_op == type_method));
free(method->attr.ma.params);
free(method->attr.ma.res_type);
+ /* cannot free it yet, type could be cloned ...
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);
void add_union_member(ir_type *uni, ir_entity *member) {
assert(uni && (uni->type_op == type_union));
assert(uni != get_entity_type(member) && "recursive type");
+ assert(get_type_state(uni) != layout_fixed);
ARR_APP1(ir_entity *, uni->attr.ua.members, member);
}
res = new_type(type_array, NULL, name, db);
res->attr.aa.n_dimensions = n_dimensions;
- res->attr.aa.lower_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
- res->attr.aa.upper_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
- res->attr.aa.order = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));
+ 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(int, n_dimensions);
current_ir_graph = get_const_code_irg();
unk = new_Unknown(mode_Iu);
int has_array_lower_bound(const ir_type *array, int dimension) {
assert(array && (array->type_op == type_array));
- return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
+ return !is_Unknown(array->attr.aa.lower_bound[dimension]);
}
ir_node *get_array_lower_bound(const ir_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);
+ assert(is_Const(node));
return get_tarval_long(get_Const_tarval(node));
}
int has_array_upper_bound(const ir_type *array, int dimension) {
assert(array && (array->type_op == type_array));
- return get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown;
+ return !is_Unknown(array->attr.aa.upper_bound[dimension]);
}
ir_node *get_array_upper_bound(const ir_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);
+ assert(is_Const(node));
return get_tarval_long(get_Const_tarval(node));
}
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) & 7) == 0 && "unorthodox modes not implemented");
+ assert((get_mode_size_bits(mode) % 8) == 0 && "unorthodox modes not implemented");
tp->size = get_mode_size_bytes(mode);
tp->mode = mode;
assert(mode_is_reference(ptr_mode));
res = new_type(type_pointer, ptr_mode, name, db);
res->attr.pa.points_to = points_to;
- assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
+ 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;
}
+/* Makes a clone of a frame type. */
+ir_type *clone_frame_type(ir_type *type) {
+ ir_type *res;
+ int i, n;
+
+ assert(is_frame_type(type));
+
+ res = new_type_frame(type->name);
+ 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;
+}
+
/* Sets a lowered type for a type. This sets both associations. */
void set_lowered_type(ir_type *tp, ir_type *lowered_type) {
assert(is_type(tp) && is_type(lowered_type));
* The frame type must have already an fixed layout.
*/
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];
- unsigned frame_align;
- int i, offset, frame_size;
- static unsigned area_cnt = 0;
- static ir_type *a_byte = NULL;
-
- assert(is_frame_type(frame_type));
- assert(get_type_state(frame_type) == layout_fixed);
- assert(get_type_alignment_bytes(frame_type) > 0);
-
- if (! a_byte)
- a_byte = new_type_primitive(new_id_from_chars("byte", 4), mode_Bu);
-
- snprintf(buf, sizeof(buf), "area%u", area_cnt++);
- name = new_id_from_str(buf);
-
- /* align the size */
- frame_align = get_type_alignment_bytes(frame_type);
- size = (size + frame_align - 1) & ~(frame_align - 1);
-
- tp = new_type_array(mangle_u(get_type_ident(frame_type), name), 1, a_byte);
- set_array_bounds_int(tp, 0, 0, size);
- set_type_alignment_bytes(tp, alignment);
-
- frame_size = get_type_size_bytes(frame_type);
- if (at_start) {
- /* fix all offsets so far */
- for (i = get_class_n_members(frame_type) - 1; i >= 0; --i) {
- ir_entity *ent = get_class_member(frame_type, i);
-
- set_entity_offset(ent, get_entity_offset(ent) + size);
- }
- /* calculate offset and new type size */
- offset = 0;
- frame_size += size;
- }
- 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);
-
- /* mark this entity as compiler generated */
- set_entity_compiler_generated(area, 1);
- return area;
+ ir_entity *area;
+ ir_type *tp;
+ ident *name;
+ char buf[32];
+ unsigned frame_align;
+ int i, offset, frame_size;
+ static unsigned area_cnt = 0;
+ static ir_type *a_byte = NULL;
+
+ 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 (! a_byte)
+ a_byte = new_type_primitive(new_id_from_chars("byte", 4), mode_Bu);
+
+ snprintf(buf, sizeof(buf), "area%u", area_cnt++);
+ name = new_id_from_str(buf);
+
+ /* align the size */
+ frame_align = get_type_alignment_bytes(frame_type);
+ size = (size + frame_align - 1) & ~(frame_align - 1);
+
+ tp = new_type_array(mangle_u(get_type_ident(frame_type), name), 1, a_byte);
+ set_array_bounds_int(tp, 0, 0, size);
+ set_type_alignment_bytes(tp, alignment);
+
+ frame_size = get_type_size_bytes(frame_type);
+ if (at_start) {
+ /* fix all offsets so far */
+ for (i = get_class_n_members(frame_type) - 1; i >= 0; --i) {
+ ir_entity *ent = get_class_member(frame_type, i);
+
+ set_entity_offset(ent, get_entity_offset(ent) + size);
+ }
+ /* calculate offset and new type size */
+ offset = 0;
+ frame_size += size;
+
+ /* increase size to match alignment... */
+ if (alignment > frame_align) {
+ frame_align = alignment;
+ set_type_alignment_bytes(frame_type, frame_align);
+ frame_size = (frame_size + frame_align - 1) & ~(frame_align - 1);
+ }
+ } 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);
+
+ /* mark this entity as compiler generated */
+ set_entity_compiler_generated(area, 1);
+
+ set_type_state(frame_type, layout_fixed);
+ return area;
}
projects / libfirm / blobdiff