* PURPOSE
* This type opcode is an auxiliary opcode dedicated to support transformations
* of the type structure. If a type is changed to another type with another
- * opcode the new type will be allocated with new memory. All nodes refereing
+ * opcode the new type will be allocated with new memory. All nodes refering
* to the old type need to be changed to refer the new one. This is simplified
* by turning the old type into an id type that merely forwards to the new type
* that now replaces the old one.
* should automatically check for type_id and eventually follow the forward in
* type_id. Two types are exchanged by a call to exchange_types.
* If a type_id is visible externally report this as bug. If it is assured that
- * this never happens this extern variable can be moved to type_t.h.
+ * this never happens this extern variable can be moved to tpop_t.h.
* NOTES
* This struct is dynamically allocated but constant for the lifetime
* of the library.
return res;
}
+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;
+ }
+}
+
tp_op* get_type_tpop(type *tp) {
assert(tp);
return tp->type_op;
return res;
}
+inline 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));
res->attr.sa.members = NEW_ARR_F (entity *, 1);
return res;
}
+inline void free_struct_attrs (type *strct) {
+ assert(strct && (strct->type_op == type_struct));
+ DEL_ARR_F(strct->attr.sa.members);
+}
/* manipulate private fields of struct */
void add_struct_member (type *strct, entity *member) {
assert(strct && (strct->type_op == type_struct));
res->attr.ma.res_type = (type **) xmalloc (sizeof (type *) * n_res);
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));
res->attr.ua.members = NEW_ARR_F (entity *, 1);
return res;
}
+inline void free_union_attrs (type *uni) {
+ assert(uni && (uni->type_op == type_union));
+ DEL_ARR_F(uni->attr.ua.members);
+}
/* manipulate private fields of struct */
#if 0
int get_union_n_types (type *uni) {
new_entity(res, name, element_type);
return res;
}
+inline 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);
+}
/* manipulate private fields of array type */
int get_array_n_dimensions (type *array) {
res->attr.ea.enum_nameid = (ident **) xmalloc (sizeof (ident *) * n_enums);
return res;
}
+inline void free_enumeration_attrs(type *enumeration) {
+ assert(enumeration && (enumeration->type_op == type_enumeration));
+ free(enumeration->attr.ea.enumer);
+ free(enumeration->attr.ea.enum_nameid);
+}
/* manipulate fields of enumeration type. */
int get_enumeration_n_enums (type *enumeration) {
res->state = layout_fixed;
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) {
assert(pointer && (pointer->type_op == type_pointer));
res->state = layout_fixed;
return res;
}
+inline void free_primitive_attrs (type *primitive) {
+ assert(primitive && (primitive->type_op == type_primitive));
+}
/* typecheck */
bool is_primitive_type (type *primitive) {
inline void exchange_types(type *old_type, type *new_type) {
int i;
/* Deallocate datastructures not directly contained in the
- old type */
- /* @@@@ */
+ old type. We must do this now as it is the latest point
+ where we know the original kind of type.
+ */
+ free_type_attrs(old_type);
- /* Remove old type from type list. Will this confuscate the
- iterators? */
- /* @@@ */
-
- /* Ev. add to a list of id types for later deallocation. */
- /* @@@ */
+ /* @@@@
+ Things to deal with:
+ * After exchange_types the type has two entries in the list of
+ all types in irp. So far this is fine for the walker.
+ Maybe it's better to remove the id entry and shrink the list.
+ Does this conflict with the walker? Might a type be left out
+ during the walk?
+ * Deallocation: if the Id is removed from the list it will eventualle
+ disappear in a memory leak. When is impossible to determine so we
+ need to hold it in a seperate list for deallocation.
+ */
/* Exchange the types */
old_type->type_op = type_id;