4 * file type.c - implementation of the datastructure to hold
7 * (C) 2001 by Universitaet Karlsruhe
9 * Martin Trapp, Christian Schaefer, Goetz Lindenmaier
12 * This module supplies a datastructure to represent all types
13 * known in the compiled program. This includes types specified
14 * in the program as well as types defined by the language. In the
15 * view of the intermediate representation there is no difference
16 * between these types.
18 * There exist several kinds of types, arranged by the structure of
19 * the type. A type is described by a set of attributes. Some of
20 * these attributes are common to all types, others depend on the
23 * Types are different from the modes defined in irmode: Types are
24 * on the level of the programming language, modes at the level of
25 * the target processor.
38 # include "typegmod_t.h"
45 /*******************************************************************/
47 /*******************************************************************/
49 unsigned long type_visited;
52 new_type(tp_op *type_op, ir_mode *mode, ident* name) {
56 assert(type_op != type_id);
58 node_size = offsetof (type, attr) + type_op->attr_size;
59 res = (type *) xmalloc (node_size);
60 add_irp_type(res); /* Remember the new type global. */
63 res->type_op = type_op;
66 res->state = layout_undefined;
74 void free_type_attrs(type *tp) {
75 switch(get_type_tpop_code(tp)) {
76 case tpo_class: { free_class_attrs(tp); } break;
77 case tpo_struct: { free_struct_attrs(tp); } break;
78 case tpo_method: { free_method_attrs(tp); } break;
79 case tpo_union: { free_union_attrs(tp); } break;
80 case tpo_array: { free_array_attrs(tp); } break;
81 case tpo_enumeration: { free_enumeration_attrs(tp); } break;
82 case tpo_pointer: { free_pointer_attrs(tp); } break;
83 case tpo_primitive: { free_primitive_attrs(tp); } break;
88 /* set/get the link field */
89 void *get_type_link(type *tp)
91 assert(tp && tp->kind == k_type);
95 void set_type_link(type *tp, void *l)
97 assert(tp && tp->kind == k_type);
101 tp_op* get_type_tpop(type *tp) {
102 assert(tp && tp->kind == k_type);
106 ident* get_type_tpop_nameid(type *tp) {
107 assert(tp && tp->kind == k_type);
108 return tp->type_op->name;
111 const char* get_type_tpop_name(type *tp) {
112 assert(tp && tp->kind == k_type);
113 return id_to_str(tp->type_op->name);
116 tp_opcode get_type_tpop_code(type *tp) {
117 assert(tp && tp->kind == k_type);
118 return tp->type_op->code;
121 ir_mode* get_type_mode(type *tp) {
122 assert(tp && tp->kind == k_type);
126 void set_type_mode(type *tp, ir_mode* m) {
127 assert(tp && tp->kind == k_type);
129 assert((tp->type_op != type_primitive) || mode_is_data(m) &&
130 /* Modes of primitives must be data */
131 (tp->type_op != type_enumeration) || mode_is_int(m));
132 /* Modes of enumerations must be integers */
134 if ((tp->type_op == type_primitive) || (tp->type_op == type_enumeration)) {
135 /* For pointer, primitive and enumeration size depends on the mode. */
136 tp->size == get_mode_size(m);
141 ident* get_type_ident(type *tp) {
142 assert(tp && tp->kind == k_type);
146 void set_type_ident(type *tp, ident* id) {
147 assert(tp && tp->kind == k_type);
151 const char* get_type_name(type *tp) {
152 assert(tp && tp->kind == k_type);
153 return id_to_str(tp->name);
156 int get_type_size(type *tp) {
157 assert(tp && tp->kind == k_type);
162 set_type_size(type *tp, int size) {
163 assert(tp && tp->kind == k_type);
164 /* For pointer enumeration and primitive size depends on the mode.
165 Methods don't have a size. */
166 if ((tp->type_op != type_pointer) && (tp->type_op != type_primitive) &&
167 (tp->type_op != type_enumeration) && (tp->type_op != type_method))
172 get_type_state(type *tp) {
173 assert(tp && tp->kind == k_type);
178 set_type_state(type *tp, type_state state) {
179 assert(tp && tp->kind == k_type);
181 if ((tp->type_op == type_pointer) && (tp->type_op == type_primitive) &&
182 (tp->type_op == type_method))
185 /* Just a correctness check: */
186 if (state == layout_fixed) {
188 switch (get_type_tpop_code(tp)) {
191 assert(get_type_size(tp) > -1);
192 if (tp != get_glob_type())
193 for (i = 0; i < get_class_n_member(tp); i++) {
194 assert(get_entity_offset(get_class_member(tp, i)) > -1);
195 assert(is_method_type(get_entity_type(get_class_member(tp, i))) ||
196 (get_entity_allocation(get_class_member(tp, i)) == automatic_allocated));
197 /* @@@ lowerfirm geht nicht durch */
202 /* assert(get_type_size(tp) > -1); @@@ lowerfirm geht nicht durch */
203 for (i = 0; i < get_struct_n_member(tp); i++) {
204 assert(get_entity_offset(get_struct_member(tp, i)) > -1);
205 assert((get_entity_allocation(get_struct_member(tp, i)) == automatic_allocated));
214 Assure that only innermost dimension is dynamic? */
216 case tpo_enumeration:
218 assert(get_type_mode != NULL);
219 for (i = 0; i < get_enumeration_n_enums(tp); i++)
220 assert(get_enumeration_enum(tp, i) != NULL);
228 unsigned long get_type_visited(type *tp) {
229 assert(tp && tp->kind == k_type);
233 void set_type_visited(type *tp, unsigned long num) {
234 assert(tp && tp->kind == k_type);
237 /* Sets visited field in type to type_visited. */
238 void mark_type_visited(type *tp) {
239 assert(tp && tp->kind == k_type);
240 assert(tp->visit < type_visited);
241 tp->visit = type_visited;
244 int is_type (void *thing) {
246 if (get_kind(thing) == k_type)
252 /*******************************************************************/
254 /*******************************************************************/
256 /* create a new class type */
257 type *new_type_class (ident *name) {
260 res = new_type(type_class, NULL, name);
262 res->attr.ca.members = NEW_ARR_F (entity *, 1);
263 res->attr.ca.subtypes = NEW_ARR_F (type *, 1);
264 res->attr.ca.supertypes = NEW_ARR_F (type *, 1);
268 inline void free_class_attrs(type *clss) {
269 assert(clss && (clss->type_op == type_class));
270 DEL_ARR_F(clss->attr.ca.members);
271 DEL_ARR_F(clss->attr.ca.subtypes);
272 DEL_ARR_F(clss->attr.ca.supertypes);
274 /* manipulate private fields of class type */
275 void add_class_member (type *clss, entity *member) {
276 assert(clss && (clss->type_op == type_class));
277 ARR_APP1 (entity *, clss->attr.ca.members, member);
279 int get_class_n_member (type *clss) {
280 assert(clss && (clss->type_op == type_class));
281 return (ARR_LEN (clss->attr.ca.members))-1;
283 entity *get_class_member (type *clss, int pos) {
284 assert(clss && (clss->type_op == type_class));
285 assert(pos >= 0 && pos < get_class_n_member(clss));
286 return clss->attr.ca.members[pos+1];
288 void set_class_member (type *clss, entity *member, int pos) {
289 assert(clss && (clss->type_op == type_class));
290 assert(pos >= 0 && pos < get_class_n_member(clss));
291 clss->attr.ca.members[pos+1] = member;
293 void set_class_members (type *clss, entity **members, int arity) {
295 assert(clss && (clss->type_op == type_class));
296 DEL_ARR_F(clss->attr.ca.members);
297 clss->attr.ca.members = NEW_ARR_F (entity *, 1);
298 for (i = 0; i < arity; i++) {
299 set_entity_owner(members[i], clss);
300 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
303 void remove_class_member(type *clss, entity *member) {
305 assert(clss && (clss->type_op == type_class));
306 for (i = 1; i < (ARR_LEN (clss->attr.ca.members))-1; i++)
307 if (clss->attr.ca.members[i+1] == member) {
308 for(i++; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
309 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
310 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
315 void add_class_subtype (type *clss, type *subtype) {
317 assert(clss && (clss->type_op == type_class));
318 ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
319 for (i = 0; i < get_class_n_supertype(subtype); i++)
320 if (get_class_supertype(subtype, i) == clss)
321 /* Class already registered */
323 ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
325 int get_class_n_subtype (type *clss) {
326 assert(clss && (clss->type_op == type_class));
327 return (ARR_LEN (clss->attr.ca.subtypes))-1;
329 type *get_class_subtype (type *clss, int pos) {
330 assert(clss && (clss->type_op == type_class));
331 assert(pos >= 0 && pos < get_class_n_subtype(clss));
332 return clss->attr.ca.subtypes[pos+1] = skip_tid(clss->attr.ca.subtypes[pos+1]);
334 void set_class_subtype (type *clss, type *subtype, int pos) {
335 assert(clss && (clss->type_op == type_class));
336 assert(pos >= 0 && pos < get_class_n_subtype(clss));
337 clss->attr.ca.subtypes[pos+1] = subtype;
339 void remove_class_subtype(type *clss, type *subtype) {
341 assert(clss && (clss->type_op == type_class));
342 for (i = 1; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
343 if (clss->attr.ca.subtypes[i+1] == subtype) {
344 for(i++; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
345 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
346 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
351 void add_class_supertype (type *clss, type *supertype) {
353 assert(clss && (clss->type_op == type_class));
354 assert(supertype && (supertype -> type_op == type_class));
355 ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
356 for (i = 0; i < get_class_n_subtype(supertype); i++)
357 if (get_class_subtype(supertype, i) == clss)
358 /* Class already registered */
360 ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
362 int get_class_n_supertype (type *clss) {
363 assert(clss && (clss->type_op == type_class));
364 return (ARR_LEN (clss->attr.ca.supertypes))-1;
366 type *get_class_supertype (type *clss, int pos) {
367 assert(clss && (clss->type_op == type_class));
368 assert(pos >= 0 && pos < get_class_n_supertype(clss));
369 return clss->attr.ca.supertypes[pos+1] = skip_tid(clss->attr.ca.supertypes[pos+1]);
371 void set_class_supertype (type *clss, type *supertype, int pos) {
372 assert(clss && (clss->type_op == type_class));
373 assert(pos >= 0 && pos < get_class_n_supertype(clss));
374 clss->attr.ca.supertypes[pos+1] = supertype;
376 void remove_class_supertype(type *clss, type *supertype) {
378 assert(clss && (clss->type_op == type_class));
379 for (i = 1; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
380 if (clss->attr.ca.supertypes[i+1] == supertype) {
381 for(i++; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
382 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
383 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
388 bool is_class_type(type *clss) {
390 if (clss->type_op == type_class) return 1; else return 0;
393 /*******************************************************************/
395 /*******************************************************************/
397 /* create a new type struct */
398 type *new_type_struct (ident *name) {
400 res = new_type(type_struct, NULL, name);
401 res->attr.sa.members = NEW_ARR_F (entity *, 1);
404 inline void free_struct_attrs (type *strct) {
405 assert(strct && (strct->type_op == type_struct));
406 DEL_ARR_F(strct->attr.sa.members);
408 /* manipulate private fields of struct */
409 void add_struct_member (type *strct, entity *member) {
410 assert(strct && (strct->type_op == type_struct));
411 assert(get_type_tpop(get_entity_type(member)) != type_method);
412 /* @@@ lowerfirm geht nicht durch */
413 ARR_APP1 (entity *, strct->attr.sa.members, member);
415 int get_struct_n_member (type *strct) {
416 assert(strct && (strct->type_op == type_struct));
417 return (ARR_LEN (strct->attr.sa.members))-1;
419 entity *get_struct_member (type *strct, int pos) {
420 assert(strct && (strct->type_op == type_struct));
421 assert(pos >= 0 && pos < get_struct_n_member(strct));
422 return strct->attr.sa.members[pos+1];
424 void set_struct_member (type *strct, int pos, entity *member) {
425 assert(strct && (strct->type_op == type_struct));
426 assert(pos >= 0 && pos < get_struct_n_member(strct));
427 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
428 strct->attr.sa.members[pos+1] = member;
430 void remove_struct_member(type *strct, entity *member) {
432 assert(strct && (strct->type_op == type_struct));
433 for (i = 1; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
434 if (strct->attr.sa.members[i+1] == member) {
435 for(i++; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
436 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
437 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
442 bool is_struct_type(type *strct) {
444 if (strct->type_op == type_struct) return 1; else return 0;
447 /*******************************************************************/
449 /*******************************************************************/
451 /* Create a new method type.
452 N_param is the number of parameters, n_res the number of results. */
453 type *new_type_method (ident *name, int n_param, int n_res) {
455 res = new_type(type_method, mode_p, name);
456 res->state = layout_fixed;
457 res->size = get_mode_size(mode_p);
458 res->attr.ma.n_params = n_param;
459 res->attr.ma.param_type = (type **) xmalloc (sizeof (type *) * n_param);
460 res->attr.ma.n_res = n_res;
461 res->attr.ma.res_type = (type **) xmalloc (sizeof (type *) * n_res);
464 inline void free_method_attrs(type *method) {
465 assert(method && (method->type_op == type_method));
466 free(method->attr.ma.param_type);
467 free(method->attr.ma.res_type);
469 /* manipulate private fields of method. */
470 int get_method_n_params (type *method) {
471 assert(method && (method->type_op == type_method));
472 return method->attr.ma.n_params;
474 type *get_method_param_type(type *method, int pos) {
475 assert(method && (method->type_op == type_method));
476 assert(pos >= 0 && pos < get_method_n_params(method));
477 return method->attr.ma.param_type[pos] = skip_tid(method->attr.ma.param_type[pos]);
479 void set_method_param_type(type *method, int pos, type* type) {
480 assert(method && (method->type_op == type_method));
481 assert(pos >= 0 && pos < get_method_n_params(method));
482 method->attr.ma.param_type[pos] = type;
485 int get_method_n_res (type *method) {
486 assert(method && (method->type_op == type_method));
487 return method->attr.ma.n_res;
489 type *get_method_res_type(type *method, int pos) {
490 assert(method && (method->type_op == type_method));
491 assert(pos >= 0 && pos < get_method_n_res(method));
492 return method->attr.ma.res_type[pos] = skip_tid(method->attr.ma.res_type[pos]);
494 void set_method_res_type(type *method, int pos, type* type) {
495 assert(method && (method->type_op == type_method));
496 assert(pos >= 0 && pos < get_method_n_res(method));
497 method->attr.ma.res_type[pos] = type;
501 bool is_method_type (type *method) {
503 if (method->type_op == type_method) return 1; else return 0;
507 /*******************************************************************/
509 /*******************************************************************/
511 /* create a new type uni */
512 type *new_type_uni (ident *name) {
514 res = new_type(type_union, NULL, name);
515 /*res->attr.ua.unioned_type = (type **) xmalloc (sizeof (type *) * n_types);
516 res->attr.ua.delim_names = (ident **) xmalloc (sizeof (ident *) * n_types); */
517 res->attr.ua.members = NEW_ARR_F (entity *, 1);
520 inline void free_union_attrs (type *uni) {
521 assert(uni && (uni->type_op == type_union));
522 DEL_ARR_F(uni->attr.ua.members);
524 /* manipulate private fields of union */
526 int get_union_n_types (type *uni) {
527 assert(uni && (uni->type_op == type_union));
528 return uni->attr.ua.n_types;
530 type *get_union_unioned_type (type *uni, int pos) {
531 assert(uni && (uni->type_op == type_union));
532 assert(pos >= 0 && pos < get_union_n_types(uni));
533 return uni->attr.ua.unioned_type[pos] = skip_tid(uni->attr.ua.unioned_type[pos]);
535 void set_union_unioned_type (type *uni, int pos, type *type) {
536 assert(uni && (uni->type_op == type_union));
537 assert(pos >= 0 && pos < get_union_n_types(uni));
538 uni->attr.ua.unioned_type[pos] = type;
540 ident *get_union_delim_nameid (type *uni, int pos) {
541 assert(uni && (uni->type_op == type_union));
542 assert(pos >= 0 && pos < get_union_n_types(uni));
543 return uni->attr.ua.delim_names[pos];
545 const char *get_union_delim_name (type *uni, int pos) {
546 assert(uni && (uni->type_op == type_union));
547 assert(pos >= 0 && pos < get_union_n_types(uni));
548 return id_to_str(uni->attr.ua.delim_names[pos]);
550 void set_union_delim_nameid (type *uni, int pos, ident *id) {
551 assert(uni && (uni->type_op == type_union));
552 assert(pos >= 0 && pos < get_union_n_types(uni));
553 uni->attr.ua.delim_names[pos] = id;
556 int get_union_n_members (type *uni) {
557 assert(uni && (uni->type_op == type_union));
558 return (ARR_LEN (uni->attr.ua.members))-1;
560 void add_union_member (type *uni, entity *member) {
561 assert(uni && (uni->type_op == type_union));
562 ARR_APP1 (entity *, uni->attr.ua.members, member);
564 entity *get_union_member (type *uni, int pos) {
565 assert(uni && (uni->type_op == type_union));
566 assert(pos >= 0 && pos < get_union_n_members(uni));
567 return uni->attr.ua.members[pos+1];
569 void set_union_member (type *uni, int pos, entity *member) {
570 assert(uni && (uni->type_op == type_union));
571 assert(pos >= 0 && pos < get_union_n_members(uni));
572 uni->attr.ua.members[pos+1] = member;
574 void remove_union_member(type *uni, entity *member) {
576 assert(uni && (uni->type_op == type_union));
577 for (i = 1; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
578 if (uni->attr.ua.members[i+1] == member) {
579 for(i++; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
580 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
581 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
587 bool is_union_type (type *uni) {
589 if (uni->type_op == type_union) return 1; else return 0;
592 /*******************************************************************/
594 /*******************************************************************/
597 /* create a new type array -- set dimension sizes independently */
598 type *new_type_array (ident *name, int n_dimensions,
599 type *element_type) {
602 assert((element_type->type_op != type_method));
603 assert(get_type_tpop(element_type) != type_method);
604 res = new_type(type_array, NULL, name);
605 res->attr.aa.n_dimensions = n_dimensions;
606 res->attr.aa.lower_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
607 res->attr.aa.upper_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
608 res->attr.aa.order = (int *) xmalloc (sizeof (int) * n_dimensions);
610 for (i = 0; i < n_dimensions; i++) {
611 res->attr.aa.lower_bound[i] = NULL;
612 res->attr.aa.upper_bound[i] = NULL;
613 res->attr.aa.order[i] = i;
615 res->attr.aa.element_type = element_type;
616 new_entity(res, mangle_u(name, id_from_str("elem_ent", 8)), element_type);
619 inline void free_array_attrs (type *array) {
620 assert(array && (array->type_op == type_array));
621 free(array->attr.aa.lower_bound);
622 free(array->attr.aa.upper_bound);
625 /* manipulate private fields of array type */
626 int get_array_n_dimensions (type *array) {
627 assert(array && (array->type_op == type_array));
628 return array->attr.aa.n_dimensions;
630 void set_array_bounds_int (type *array, int dimension, int lower_bound,
633 assert(array && (array->type_op == type_array));
634 rem = current_ir_graph;
635 current_ir_graph = get_const_code_irg();
636 array->attr.aa.lower_bound[dimension] =
637 new_Const(mode_I, tarval_from_long (mode_I, lower_bound));
638 array->attr.aa.upper_bound[dimension] =
639 new_Const(mode_I, tarval_from_long (mode_I, upper_bound));
640 current_ir_graph = rem;
643 void set_array_bounds (type *array, int dimension, ir_node * lower_bound,
644 ir_node * upper_bound) {
645 assert(array && (array->type_op == type_array));
646 array->attr.aa.lower_bound[dimension] = lower_bound;
647 array->attr.aa.upper_bound[dimension] = upper_bound;
649 void set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
651 assert(array && (array->type_op == type_array));
652 rem = current_ir_graph;
653 current_ir_graph = get_const_code_irg();
654 array->attr.aa.lower_bound[dimension] =
655 new_Const(mode_I, tarval_from_long (mode_I, lower_bound));
656 current_ir_graph = rem;
658 void set_array_lower_bound (type *array, int dimension, ir_node * lower_bound) {
659 assert(array && (array->type_op == type_array));
660 array->attr.aa.lower_bound[dimension] = lower_bound;
662 void set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
663 assert(array && (array->type_op == type_array));
664 array->attr.aa.upper_bound[dimension] = upper_bound;
666 ir_node * get_array_lower_bound (type *array, int dimension) {
667 assert(array && (array->type_op == type_array));
668 return array->attr.aa.lower_bound[dimension];
670 ir_node * get_array_upper_bound (type *array, int dimension) {
671 assert(array && (array->type_op == type_array));
672 return array->attr.aa.upper_bound[dimension];
674 void set_array_order (type *array, int dimension, int order) {
675 assert(array && (array->type_op == type_array));
676 array->attr.aa.order[dimension] = order;
678 int get_array_order (type *array, int dimension) {
679 assert(array && (array->type_op == type_array));
680 return array->attr.aa.order[dimension];
682 void set_array_element_type (type *array, type *type) {
683 assert(array && (array->type_op == type_array));
684 array->attr.aa.element_type = type;
686 type *get_array_element_type (type *array) {
687 assert(array && (array->type_op == type_array));
688 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
690 void set_array_element_entity (type *array, entity *ent) {
691 assert(array && (array->type_op == type_array));
692 assert((get_entity_type(ent)->type_op != type_method));
693 array->attr.aa.element_ent = ent;
694 array->attr.aa.element_type = get_entity_type(ent);
696 entity *get_array_element_entity (type *array) {
697 assert(array && (array->type_op == type_array));
698 return array->attr.aa.element_ent;
702 bool is_array_type (type *array) {
704 if (array->type_op == type_array) return 1; else return 0;
707 /*******************************************************************/
708 /** TYPE_ENUMERATION **/
709 /*******************************************************************/
711 /* create a new type enumeration -- set the enumerators independently */
712 type *new_type_enumeration (ident *name, int n_enums) {
715 res = new_type(type_enumeration, NULL, name);
716 res->attr.ea.n_enums = n_enums;
717 res->attr.ea.enumer = (tarval **) xmalloc (sizeof (tarval *) * n_enums);
718 res->attr.ea.enum_nameid = (ident **) xmalloc (sizeof (ident *) * n_enums);
719 for (i = 0; i < n_enums; i++) {
720 res->attr.ea.enumer[i] = NULL;
721 res->attr.ea.enum_nameid = NULL;
726 inline void free_enumeration_attrs(type *enumeration) {
727 assert(enumeration && (enumeration->type_op == type_enumeration));
728 free(enumeration->attr.ea.enumer);
729 free(enumeration->attr.ea.enum_nameid);
732 /* manipulate fields of enumeration type. */
733 int get_enumeration_n_enums (type *enumeration) {
734 assert(enumeration && (enumeration->type_op == type_enumeration));
735 return enumeration->attr.ea.n_enums;
737 void set_enumeration_enum (type *enumeration, int pos, tarval *con) {
738 assert(enumeration && (enumeration->type_op == type_enumeration));
739 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
740 enumeration->attr.ea.enumer[pos] = con;
742 tarval *get_enumeration_enum (type *enumeration, int pos) {
743 assert(enumeration && (enumeration->type_op == type_enumeration));
744 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
745 return enumeration->attr.ea.enumer[pos];
747 void set_enumeration_nameid (type *enumeration, int pos, ident *id) {
748 assert(enumeration && (enumeration->type_op == type_enumeration));
749 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
750 enumeration->attr.ea.enum_nameid[pos] = id;
752 ident *get_enumeration_nameid (type *enumeration, int pos) {
753 assert(enumeration && (enumeration->type_op == type_enumeration));
754 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
755 return enumeration->attr.ea.enum_nameid[pos];
757 const char *get_enumeration_name(type *enumeration, int pos) {
758 assert(enumeration && (enumeration->type_op == type_enumeration));
759 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
760 return id_to_str(enumeration->attr.ea.enum_nameid[pos]);
764 bool is_enumeration_type (type *enumeration) {
766 if (enumeration->type_op == type_enumeration) return 1; else return 0;
769 /*******************************************************************/
771 /*******************************************************************/
773 /* Create a new type pointer */
774 type *new_type_pointer (ident *name, type *points_to) {
776 res = new_type(type_pointer, mode_p, name);
777 res->attr.pa.points_to = points_to;
778 res->size = get_mode_size(res->mode);
779 res->state = layout_fixed;
782 inline void free_pointer_attrs (type *pointer) {
783 assert(pointer && (pointer->type_op == type_pointer));
785 /* manipulate fields of type_pointer */
786 void set_pointer_points_to_type (type *pointer, type *type) {
787 assert(pointer && (pointer->type_op == type_pointer));
788 pointer->attr.pa.points_to = type;
790 type *get_pointer_points_to_type (type *pointer) {
791 assert(pointer && (pointer->type_op == type_pointer));
792 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
796 bool is_pointer_type (type *pointer) {
798 if (pointer->type_op == type_pointer) return 1; else return 0;
802 /*******************************************************************/
803 /** TYPE_PRIMITIVE **/
804 /*******************************************************************/
806 /* create a new type primitive */
807 type *new_type_primitive (ident *name, ir_mode *mode) {
809 /* @@@ assert( mode_is_data(mode) && (!mode == mode_p)); */
810 res = new_type(type_primitive, mode, name);
811 res->size = get_mode_size(mode);
812 res->state = layout_fixed;
815 inline void free_primitive_attrs (type *primitive) {
816 assert(primitive && (primitive->type_op == type_primitive));
820 bool is_primitive_type (type *primitive) {
821 assert(primitive && primitive->kind == k_type);
822 if (primitive->type_op == type_primitive) return 1; else return 0;
825 /*******************************************************************/
826 /** common functionality **/
827 /*******************************************************************/
830 inline int is_atomic_type(type *tp) {
831 assert(tp && tp->kind == k_type);
832 return (is_primitive_type(tp) || is_pointer_type(tp) ||
833 is_enumeration_type(tp));
835 inline int is_compound_type(type *tp) {
836 assert(tp && tp->kind == k_type);
837 return (is_class_type(tp) || is_struct_type(tp) ||
838 is_array_type(tp) || is_union_type(tp));