3 * File name: ir/tr/type.c
4 * Purpose: Representation of types.
5 * Author: Goetz Lindenmaier
9 * Copyright: (c) 2001-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
15 * file type.c - implementation of the datastructure to hold
17 * (C) 2001 by Universitaet Karlsruhe
20 * This module supplies a datastructure to represent all types
21 * known in the compiled program. This includes types specified
22 * in the program as well as types defined by the language. In the
23 * view of the intermediate representation there is no difference
24 * between these types.
26 * There exist several kinds of types, arranged by the structure of
27 * the type. A type is described by a set of attributes. Some of
28 * these attributes are common to all types, others depend on the
31 * Types are different from the modes defined in irmode: Types are
32 * on the level of the programming language, modes at the level of
33 * the target processor.
35 * @see type_t.h type tpop
48 # include "irprog_t.h"
51 # include "typegmod.h"
57 /*******************************************************************/
59 /*******************************************************************/
61 type *none_type; type *get_none_type(void) { return none_type; }
62 type *unknown_type; type *get_unknown_type(void) { return unknown_type; }
66 /** Returns a new, unique number to number nodes or the like. */
67 int get_irp_new_node_nr(void);
70 /* Suffixes added to types used for pass-by-value representations. */
71 static ident *value_params_suffix = NULL;
72 static ident *value_ress_suffix = NULL;
74 void init_type(void) {
75 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
76 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
78 /* construct none and unknown type. */
79 none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"));
80 set_type_size_bits(none_type, 0);
81 set_type_state (none_type, layout_fixed);
82 remove_irp_type(none_type);
83 unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"));
84 set_type_size_bits(unknown_type, 0);
85 set_type_state (unknown_type, layout_fixed);
86 remove_irp_type(unknown_type);
89 unsigned long type_visited;
91 void (set_master_type_visited)(unsigned long val) { __set_master_type_visited(val); }
92 unsigned long (get_master_type_visited)(void) { return __get_master_type_visited(); }
93 void (inc_master_type_visited)(void) { __inc_master_type_visited(); }
97 new_type(tp_op *type_op, ir_mode *mode, ident* name) {
101 assert(type_op != type_id);
102 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
104 node_size = offsetof(type, attr) + type_op->attr_size;
105 res = (type *) xmalloc (node_size);
106 add_irp_type(res); /* Remember the new type global. */
109 res->type_op = type_op;
112 res->state = layout_undefined;
117 res->nr = get_irp_new_node_nr();
123 void free_type(type *tp) {
124 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
126 /* Remove from list of all types */
128 /* Free the attributes of the type. */
130 /* Free entities automatically allocated with the type */
131 if (is_array_type(tp))
132 free_entity(get_array_element_entity(tp));
133 /* And now the type itself... */
138 void free_type_entities(type *tp) {
139 switch(get_type_tpop_code(tp)) {
140 case tpo_class: { free_class_entities(tp); } break;
141 case tpo_struct: { free_struct_entities(tp); } break;
142 case tpo_method: { free_method_entities(tp); } break;
143 case tpo_union: { free_union_entities(tp); } break;
144 case tpo_array: { free_array_entities(tp); } break;
145 case tpo_enumeration: { free_enumeration_entities(tp); } break;
146 case tpo_pointer: { free_pointer_entities(tp); } break;
147 case tpo_primitive: { free_primitive_entities(tp); } break;
152 void free_type_attrs(type *tp) {
153 switch(get_type_tpop_code(tp)) {
154 case tpo_class: { free_class_attrs(tp); } break;
155 case tpo_struct: { free_struct_attrs(tp); } break;
156 case tpo_method: { free_method_attrs(tp); } break;
157 case tpo_union: { free_union_attrs(tp); } break;
158 case tpo_array: { free_array_attrs(tp); } break;
159 case tpo_enumeration: { free_enumeration_attrs(tp); } break;
160 case tpo_pointer: { free_pointer_attrs(tp); } break;
161 case tpo_primitive: { free_primitive_attrs(tp); } break;
166 /* set/get the link field */
167 void *(get_type_link)(type *tp)
169 return __get_type_link(tp);
172 void (set_type_link)(type *tp, void *l)
174 __set_type_link(tp, l);
177 tp_op *(get_type_tpop)(type *tp) {
178 return __get_type_tpop(tp);
181 ident *(get_type_tpop_nameid)(type *tp) {
182 return __get_type_tpop_nameid(tp);
185 const char* get_type_tpop_name(type *tp) {
186 assert(tp && tp->kind == k_type);
187 return get_id_str(tp->type_op->name);
190 tp_opcode (get_type_tpop_code)(type *tp) {
191 return __get_type_tpop_code(tp);
194 ir_mode *(get_type_mode)(type *tp) {
195 return __get_type_mode(tp);
198 void set_type_mode(type *tp, ir_mode* m) {
199 assert(tp && tp->kind == k_type);
201 assert(((tp->type_op != type_primitive) || mode_is_data(m)) &&
202 /* Modes of primitives must be data */
203 ((tp->type_op != type_enumeration) || mode_is_int(m)) &&
204 /* Modes of enumerations must be integers */
205 ((tp->type_op != type_pointer) || mode_is_reference(m)) );
206 /* Modes of pointers must be references. */
208 switch (get_type_tpop_code(tp)) {
210 /* For primitive size depends on the mode. */
211 tp->size = get_mode_size_bits(m);
214 case tpo_enumeration:
216 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
217 assert((get_mode_size_bits(m) & 7) == 0 && "unorthodox modes not implemented");
218 tp->size = get_mode_size_bits(m);
223 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
224 assert(get_type_state(tp) == layout_fixed &&
225 tp->size == get_mode_size_bits(m) &&
226 "mode don't match struct/class layout");
230 assert(0 && "setting a mode is NOT allowed for this type");
234 ident *(get_type_ident)(type *tp) {
235 return __get_type_ident(tp);
238 void (set_type_ident)(type *tp, ident* id) {
239 __set_type_ident(tp, id);
242 /* Outputs a unique number for this node */
243 long (get_type_nr)(type *tp) {
244 return __get_type_nr(tp);
247 const char* get_type_name(type *tp) {
248 assert(tp && tp->kind == k_type);
249 return (get_id_str(tp->name));
252 int (get_type_size_bytes)(type *tp) {
253 return __get_type_size_bytes(tp);
256 int (get_type_size_bits)(type *tp) {
257 return __get_type_size_bits(tp);
261 set_type_size_bits(type *tp, int size) {
262 assert(tp && tp->kind == k_type);
263 /* For pointer enumeration and primitive size depends on the mode.
264 Methods don't have a size. */
265 if ((tp->type_op != type_pointer) && (tp->type_op != type_primitive) &&
266 (tp->type_op != type_enumeration) && (tp->type_op != type_method)) {
267 if (tp->type_op == type_primitive)
270 /* argh: we must allow to set negative values as "invalid size" */
271 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
272 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
278 set_type_size_bytes(type *tp, int size) {
279 set_type_size_bits(tp, 8*size);
282 type_state (get_type_state)(type *tp) {
283 return __get_type_state(tp);
287 set_type_state(type *tp, type_state state) {
288 assert(tp && tp->kind == k_type);
290 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
291 (tp->type_op == type_method))
294 /* Just a correctness check: */
295 if (state == layout_fixed) {
297 switch (get_type_tpop_code(tp)) {
300 assert(get_type_size_bits(tp) > -1);
301 if (tp != get_glob_type()) {
302 int n_mem = get_class_n_members(tp);
303 for (i = 0; i < n_mem; i++) {
304 if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
305 { DDMT(tp); DDME(get_class_member(tp, i)); }
306 assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
308 assert(is_method_type(get_entity_type(get_class_member(tp, i))) ||
309 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
316 assert(get_type_size_bits(tp) > -1);
317 for (i = 0; i < get_struct_n_members(tp); i++) {
318 assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
319 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
328 Assure that only innermost dimension is dynamic? */
330 case tpo_enumeration:
332 assert(get_type_mode != NULL);
333 for (i = 0; i < get_enumeration_n_enums(tp); i++)
334 assert(get_enumeration_enum(tp, i) != NULL);
342 unsigned long (get_type_visited)(type *tp) {
343 return __get_type_visited(tp);
346 void (set_type_visited)(type *tp, unsigned long num) {
347 __set_type_visited(tp, num);
350 /* Sets visited field in type to type_visited. */
351 void (mark_type_visited)(type *tp) {
352 __mark_type_visited(tp);
355 /* @@@ name clash with master flag
356 int (type_visited)(type *tp) {
357 return __type_visited(tp);
360 int (type_not_visited)(type *tp) {
361 return __type_not_visited(tp);
364 int (is_type)(void *thing) {
365 return __is_type(thing);
368 bool equal_type(type *typ1, type *typ2) {
373 if (typ1 == typ2) return true;
375 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
376 (get_type_ident(typ1) != get_type_ident(typ2)) ||
377 (get_type_mode(typ1) != get_type_mode(typ2)) ||
378 (get_type_state(typ1) != get_type_state(typ2)))
380 if ((get_type_state(typ1) == layout_fixed) &&
381 (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
384 switch(get_type_tpop_code(typ1)) {
386 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return false;
387 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return false;
388 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return false;
389 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return false;
390 /** Compare the members **/
391 m = alloca(sizeof(entity *) * get_class_n_members(typ1));
392 memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
393 /* First sort the members of typ2 */
394 for (i = 0; i < get_class_n_members(typ1); i++) {
395 entity *e1 = get_class_member(typ1, i);
396 for (j = 0; j < get_class_n_members(typ2); j++) {
397 entity *e2 = get_class_member(typ2, j);
398 if (get_entity_name(e1) == get_entity_name(e2))
402 for (i = 0; i < get_class_n_members(typ1); i++) {
403 if (!m[i] || /* Found no counterpart */
404 !equal_entity(get_class_member(typ1, i), m[i]))
407 /** Compare the supertypes **/
408 t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
409 memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
410 /* First sort the supertypes of typ2 */
411 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
412 type *t1 = get_class_supertype(typ1, i);
413 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
414 type *t2 = get_class_supertype(typ2, j);
415 if (get_type_ident(t2) == get_type_ident(t1))
419 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
420 if (!t[i] || /* Found no counterpart */
421 get_class_supertype(typ1, i) != t[i])
426 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return false;
427 m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
428 memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
429 /* First sort the members of lt */
430 for (i = 0; i < get_struct_n_members(typ1); i++) {
431 entity *e1 = get_struct_member(typ1, i);
432 for (j = 0; j < get_struct_n_members(typ2); j++) {
433 entity *e2 = get_struct_member(typ2, j);
434 if (get_entity_name(e1) == get_entity_name(e2))
438 for (i = 0; i < get_struct_n_members(typ1); i++) {
439 if (!m[i] || /* Found no counterpart */
440 !equal_entity(get_struct_member(typ1, i), m[i]))
445 int n_param1, n_param2;
447 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return false;
448 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return false;
450 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
451 n_param1 = get_method_n_params(typ1);
452 n_param2 = get_method_n_params(typ2);
455 n_param1 = get_method_first_variadic_param_index(typ1);
456 n_param2 = get_method_first_variadic_param_index(typ2);
459 if (n_param1 != n_param2) return false;
461 for (i = 0; i < n_param1; i++) {
462 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
465 for (i = 0; i < get_method_n_ress(typ1); i++) {
466 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
471 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return false;
472 m = alloca(sizeof(entity *) * get_union_n_members(typ1));
473 memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
474 /* First sort the members of lt */
475 for (i = 0; i < get_union_n_members(typ1); i++) {
476 entity *e1 = get_union_member(typ1, i);
477 for (j = 0; j < get_union_n_members(typ2); j++) {
478 entity *e2 = get_union_member(typ2, j);
479 if (get_entity_name(e1) == get_entity_name(e2))
483 for (i = 0; i < get_union_n_members(typ1); i++) {
484 if (!m[i] || /* Found no counterpart */
485 !equal_entity(get_union_member(typ1, i), m[i]))
490 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
492 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
494 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
495 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
496 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
498 if (get_array_order(typ1, i) != get_array_order(typ2, i))
499 assert(0 && "type compare with different dimension orders not implemented");
502 case tpo_enumeration: {
503 assert(0 && "enumerations not implemented");
506 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
509 case tpo_primitive: {
516 bool smaller_type (type *st, type *lt) {
520 if (st == lt) return true;
522 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
525 switch(get_type_tpop_code(st)) {
527 return is_subclass_of(st, lt);
530 if (get_struct_n_members(st) != get_struct_n_members(lt)) return false;
531 m = alloca(sizeof(entity *) * get_struct_n_members(st));
532 memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
533 /* First sort the members of lt */
534 for (i = 0; i < get_struct_n_members(st); i++) {
535 entity *se = get_struct_member(st, i);
536 for (j = 0; j < get_struct_n_members(lt); j++) {
537 entity *le = get_struct_member(lt, j);
538 if (get_entity_name(le) == get_entity_name(se))
542 for (i = 0; i < get_struct_n_members(st); i++) {
543 if (!m[i] || /* Found no counterpart */
544 !smaller_type(get_entity_type(get_struct_member(st, i)),
545 get_entity_type(m[i])))
550 /** FIXME: is this still true? */
551 if (get_method_variadicity(st) != get_method_variadicity(lt)) return false;
552 if (get_method_n_params(st) != get_method_n_params(lt)) return false;
553 if (get_method_n_ress(st) != get_method_n_ress(lt)) return false;
554 for (i = 0; i < get_method_n_params(st); i++) {
555 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
558 for (i = 0; i < get_method_n_ress(st); i++) {
559 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
564 if (get_union_n_members(st) != get_union_n_members(lt)) return false;
565 m = alloca(sizeof(entity *) * get_union_n_members(st));
566 memset(m, 0, sizeof(entity *) * get_union_n_members(st));
567 /* First sort the members of lt */
568 for (i = 0; i < get_union_n_members(st); i++) {
569 entity *se = get_union_member(st, i);
570 for (j = 0; j < get_union_n_members(lt); j++) {
571 entity *le = get_union_member(lt, j);
572 if (get_entity_name(le) == get_entity_name(se))
576 for (i = 0; i < get_union_n_members(st); i++) {
577 if (!m[i] || /* Found no counterpart */
578 !smaller_type(get_entity_type(get_union_member(st, i)),
579 get_entity_type(m[i])))
584 type *set, *let; /* small/large elt. type */
585 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
587 set = get_array_element_type(st);
588 let = get_array_element_type(lt);
590 /* If the elt types are different, set must be convertible
591 to let, and they must have the same size so that address
592 computations work out. To have a size the layout must
594 if ((get_type_state(set) != layout_fixed) ||
595 (get_type_state(let) != layout_fixed))
597 if (!smaller_type(set, let) ||
598 get_type_size_bits(set) != get_type_size_bits(let))
601 for(i = 0; i < get_array_n_dimensions(st); i++) {
602 if (get_array_lower_bound(lt, i))
603 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
605 if (get_array_upper_bound(lt, i))
606 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
610 case tpo_enumeration: {
611 assert(0 && "enumerations not implemented");
614 if (!smaller_type(get_pointer_points_to_type(st),
615 get_pointer_points_to_type(lt)))
618 case tpo_primitive: {
619 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
627 /*-----------------------------------------------------------------*/
629 /*-----------------------------------------------------------------*/
631 /* create a new class type */
632 type *new_type_class (ident *name) {
635 res = new_type(type_class, NULL, name);
637 res->attr.ca.members = NEW_ARR_F (entity *, 0);
638 res->attr.ca.subtypes = NEW_ARR_F (type *, 0);
639 res->attr.ca.supertypes = NEW_ARR_F (type *, 0);
640 res->attr.ca.peculiarity = peculiarity_existent;
641 res->attr.ca.dfn = 0;
645 type *new_d_type_class (ident *name, dbg_info* db) {
646 type *res = new_type_class (name);
647 set_type_dbg_info(res, db);
651 void free_class_entities(type *clss) {
653 assert(clss && (clss->type_op == type_class));
654 for (i = get_class_n_members(clss)-1; i >= 0; --i)
655 free_entity(get_class_member(clss, i));
658 void free_class_attrs(type *clss) {
659 assert(clss && (clss->type_op == type_class));
660 DEL_ARR_F(clss->attr.ca.members);
661 DEL_ARR_F(clss->attr.ca.subtypes);
662 DEL_ARR_F(clss->attr.ca.supertypes);
665 /* manipulate private fields of class type */
666 void add_class_member (type *clss, entity *member) {
667 assert(clss && (clss->type_op == type_class));
668 ARR_APP1 (entity *, clss->attr.ca.members, member);
671 int (get_class_n_members) (type *clss) {
672 return __get_class_n_members(clss);
675 int get_class_member_index(type *clss, entity *mem) {
677 assert(clss && (clss->type_op == type_class));
678 for (i = 0; i < get_class_n_members(clss); i++)
679 if (get_class_member(clss, i) == mem)
684 entity *(get_class_member) (type *clss, int pos) {
685 return __get_class_member(clss, pos);
688 entity *get_class_member_by_name(type *clss, ident *name) {
690 assert(clss && (clss->type_op == type_class));
691 n_mem = get_class_n_members(clss);
692 for (i = 0; i < n_mem; ++i) {
693 entity *mem = get_class_member(clss, i);
694 if (get_entity_ident(mem) == name) return mem;
699 void set_class_member (type *clss, entity *member, int pos) {
700 assert(clss && (clss->type_op == type_class));
701 assert(pos >= 0 && pos < get_class_n_members(clss));
702 clss->attr.ca.members[pos] = member;
704 void set_class_members (type *clss, entity **members, int arity) {
706 assert(clss && (clss->type_op == type_class));
707 DEL_ARR_F(clss->attr.ca.members);
708 clss->attr.ca.members = NEW_ARR_F (entity *, 0);
709 for (i = 0; i < arity; i++) {
710 set_entity_owner(members[i], clss);
711 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
714 void remove_class_member(type *clss, entity *member) {
716 assert(clss && (clss->type_op == type_class));
717 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
718 if (clss->attr.ca.members[i] == member) {
719 for(; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
720 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
721 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
727 void add_class_subtype (type *clss, type *subtype) {
729 assert(clss && (clss->type_op == type_class));
730 ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
731 for (i = 0; i < get_class_n_supertypes(subtype); i++)
732 if (get_class_supertype(subtype, i) == clss)
733 /* Class already registered */
735 ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
737 int get_class_n_subtypes (type *clss) {
738 assert(clss && (clss->type_op == type_class));
739 return (ARR_LEN (clss->attr.ca.subtypes));
741 type *get_class_subtype (type *clss, int pos) {
742 assert(clss && (clss->type_op == type_class));
743 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
744 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
746 void set_class_subtype (type *clss, type *subtype, int pos) {
747 assert(clss && (clss->type_op == type_class));
748 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
749 clss->attr.ca.subtypes[pos] = subtype;
751 void remove_class_subtype(type *clss, type *subtype) {
753 assert(clss && (clss->type_op == type_class));
754 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
755 if (clss->attr.ca.subtypes[i] == subtype) {
756 for(; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
757 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
758 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
763 void add_class_supertype (type *clss, type *supertype) {
765 assert(clss && (clss->type_op == type_class));
766 assert(supertype && (supertype -> type_op == type_class));
767 ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
768 for (i = 0; i < get_class_n_subtypes(supertype); i++)
769 if (get_class_subtype(supertype, i) == clss)
770 /* Class already registered */
772 ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
774 int get_class_n_supertypes (type *clss) {
775 assert(clss && (clss->type_op == type_class));
776 return (ARR_LEN (clss->attr.ca.supertypes));
778 int get_class_supertype_index(type *clss, type *super_clss) {
780 assert(clss && (clss->type_op == type_class));
781 assert(super_clss && (super_clss->type_op == type_class));
782 for (i = 0; i < get_class_n_supertypes(clss); i++)
783 if (get_class_supertype(clss, i) == super_clss)
787 type *get_class_supertype (type *clss, int pos) {
788 assert(clss && (clss->type_op == type_class));
789 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
790 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
792 void set_class_supertype (type *clss, type *supertype, int pos) {
793 assert(clss && (clss->type_op == type_class));
794 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
795 clss->attr.ca.supertypes[pos] = supertype;
797 void remove_class_supertype(type *clss, type *supertype) {
799 assert(clss && (clss->type_op == type_class));
800 for (i = 0; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
801 if (clss->attr.ca.supertypes[i] == supertype) {
802 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
803 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
804 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
809 char *get_peculiarity_string(peculiarity p) {
810 if (p == peculiarity_description)
811 return "peculiarity_description";
812 if (p == peculiarity_inherited)
813 return "peculiarity_inherited";
814 return "peculiarity_existent";
817 peculiarity get_class_peculiarity (type *clss) {
818 assert(clss && (clss->type_op == type_class));
819 return clss->attr.ca.peculiarity;
821 void set_class_peculiarity (type *clss, peculiarity pec) {
822 assert(clss && (clss->type_op == type_class));
823 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
824 clss->attr.ca.peculiarity = pec;
827 void set_class_dfn (type *clss, int dfn)
829 clss->attr.ca.dfn = dfn;
832 int get_class_dfn (type *clss)
834 return (clss->attr.ca.dfn);
838 int (is_class_type)(type *clss) {
839 return __is_class_type(clss);
842 bool is_subclass_of(type *low, type *high) {
844 assert(is_class_type(low) && is_class_type(high));
845 if (low == high) return true;
846 /* depth first search from high downwards. */
847 for (i = 0; i < get_class_n_subtypes(high); i++) {
848 if (low == get_class_subtype(high, i))
850 if (is_subclass_of(low, get_class_subtype(high, i)))
856 /*----------------------------------------------------------------**/
858 /*----------------------------------------------------------------**/
860 /* create a new type struct */
861 type *new_type_struct (ident *name) {
863 res = new_type(type_struct, NULL, name);
864 res->attr.sa.members = NEW_ARR_F (entity *, 0);
867 type *new_d_type_struct (ident *name, dbg_info* db) {
868 type *res = new_type_struct (name);
869 set_type_dbg_info(res, db);
872 void free_struct_entities (type *strct) {
874 assert(strct && (strct->type_op == type_struct));
875 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
876 free_entity(get_struct_member(strct, i));
878 void free_struct_attrs (type *strct) {
879 assert(strct && (strct->type_op == type_struct));
880 DEL_ARR_F(strct->attr.sa.members);
883 /* manipulate private fields of struct */
884 int get_struct_n_members (type *strct) {
885 assert(strct && (strct->type_op == type_struct));
886 return (ARR_LEN (strct->attr.sa.members));
889 void add_struct_member (type *strct, entity *member) {
890 assert(strct && (strct->type_op == type_struct));
891 assert(get_type_tpop(get_entity_type(member)) != type_method);
892 /* @@@ lowerfirm geht nicht durch */
893 ARR_APP1 (entity *, strct->attr.sa.members, member);
896 entity *get_struct_member (type *strct, int pos) {
897 assert(strct && (strct->type_op == type_struct));
898 assert(pos >= 0 && pos < get_struct_n_members(strct));
899 return strct->attr.sa.members[pos];
902 int get_struct_member_index(type *strct, entity *mem) {
904 assert(strct && (strct->type_op == type_struct));
905 for (i = 0; i < get_struct_n_members(strct); i++)
906 if (get_struct_member(strct, i) == mem)
911 void set_struct_member (type *strct, int pos, entity *member) {
912 assert(strct && (strct->type_op == type_struct));
913 assert(pos >= 0 && pos < get_struct_n_members(strct));
914 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
915 strct->attr.sa.members[pos] = member;
917 void remove_struct_member(type *strct, entity *member) {
919 assert(strct && (strct->type_op == type_struct));
920 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
921 if (strct->attr.sa.members[i] == member) {
922 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
923 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
924 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
930 int (is_struct_type)(type *strct) {
931 return __is_struct_type(strct);
934 /*******************************************************************/
936 /*******************************************************************/
939 * Lazy construction of value argument / result representation.
940 * Constructs a struct type and its member. The types of the members
941 * are passed in the argument list.
943 * @param name name of the type constructed
944 * @param len number of fields
945 * @param tps array of field types with length len
948 build_value_type(ident *name, int len, type **tps) {
950 type *res = new_type_struct(name);
951 /* Remove type from type list. Must be treated differently than other types. */
952 remove_irp_type_from_list(res);
953 for (i = 0; i < len; i++) {
954 type *elt_type = res; /* use res as default if corresponding type is not yet set. */
955 if (tps[i]) elt_type = tps[i];
956 new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
961 /* Create a new method type.
962 N_param is the number of parameters, n_res the number of results. */
963 type *new_type_method (ident *name, int n_param, int n_res) {
966 assert((get_mode_size_bytes(mode_P_mach) != -1) && "unorthodox modes not implemented");
967 res = new_type(type_method, mode_P_mach, name);
968 res->state = layout_fixed;
969 res->size = get_mode_size_bits(mode_P_mach);
970 res->attr.ma.n_params = n_param;
971 res->attr.ma.param_type = (type **) xmalloc (sizeof (type *) * n_param);
972 res->attr.ma.value_params = NULL;
973 res->attr.ma.n_res = n_res;
974 res->attr.ma.res_type = (type **) xmalloc (sizeof (type *) * n_res);
975 res->attr.ma.value_ress = NULL;
976 res->attr.ma.variadicity = variadicity_non_variadic;
977 res->attr.ma.first_variadic_param = -1;
982 type *new_d_type_method (ident *name, int n_param, int n_res, dbg_info* db) {
983 type *res = new_type_method (name, n_param, n_res);
984 set_type_dbg_info(res, db);
988 void free_method_entities(type *method) {
989 assert(method && (method->type_op == type_method));
992 /* Attention: also frees entities in value parameter subtypes! */
993 void free_method_attrs(type *method) {
994 assert(method && (method->type_op == type_method));
995 free(method->attr.ma.param_type);
996 free(method->attr.ma.res_type);
997 if (method->attr.ma.value_params) {
998 free_type_entities(method->attr.ma.value_params);
999 free_type(method->attr.ma.value_params);
1001 if (method->attr.ma.value_ress) {
1002 free_type_entities(method->attr.ma.value_ress);
1003 free_type(method->attr.ma.value_ress);
1007 /* manipulate private fields of method. */
1008 int get_method_n_params (type *method) {
1009 assert(method && (method->type_op == type_method));
1010 return method->attr.ma.n_params;
1013 type *get_method_param_type(type *method, int pos) {
1015 assert(method && (method->type_op == type_method));
1016 assert(pos >= 0 && pos < get_method_n_params(method));
1017 res = method->attr.ma.param_type[pos];
1018 assert(res != NULL && "empty method param type");
1019 return method->attr.ma.param_type[pos] = skip_tid(res);
1022 void set_method_param_type(type *method, int pos, type* tp) {
1023 assert(method && (method->type_op == type_method));
1024 assert(pos >= 0 && pos < get_method_n_params(method));
1025 method->attr.ma.param_type[pos] = tp;
1026 /* If information constructed set pass-by-value representation. */
1027 if (method->attr.ma.value_params) {
1028 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1029 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1033 /* Returns an entity that represents the copied value argument. Only necessary
1034 for compounds passed by value. */
1035 entity *get_method_value_param_ent(type *method, int pos) {
1036 assert(method && (method->type_op == type_method));
1037 assert(pos >= 0 && pos < get_method_n_params(method));
1038 if (!method->attr.ma.value_params)
1039 method->attr.ma.value_params
1040 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
1041 get_method_n_params(method), method->attr.ma.param_type);
1042 assert((get_entity_type(get_struct_member(method->attr.ma.value_params, pos))
1043 != method->attr.ma.value_params)
1044 && "param type not yet set");
1045 return get_struct_member(method->attr.ma.value_params, pos);
1049 * Returns a type that represents the copied value arguments.
1051 type *get_method_value_param_type(type *method)
1053 assert(method && (method->type_op == type_method));
1054 return method->attr.ma.value_params;
1057 int get_method_n_ress (type *method) {
1058 assert(method && (method->type_op == type_method));
1059 return method->attr.ma.n_res;
1062 type *get_method_res_type(type *method, int pos) {
1064 assert(method && (method->type_op == type_method));
1065 assert(pos >= 0 && pos < get_method_n_ress(method));
1066 res = method->attr.ma.res_type[pos];
1067 assert(res != NULL && "empty method return type");
1068 return method->attr.ma.res_type[pos] = skip_tid(res);
1071 void set_method_res_type(type *method, int pos, type* tp) {
1072 assert(method && (method->type_op == type_method));
1073 assert(pos >= 0 && pos < get_method_n_ress(method));
1074 /* set the result type */
1075 method->attr.ma.res_type[pos] = tp;
1076 /* If information constructed set pass-by-value representation. */
1077 if (method->attr.ma.value_ress) {
1078 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1079 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1083 /* Returns an entity that represents the copied value result. Only necessary
1084 for compounds passed by value. */
1085 entity *get_method_value_res_ent(type *method, int pos) {
1086 assert(method && (method->type_op == type_method));
1087 assert(pos >= 0 && pos < get_method_n_ress(method));
1088 if (!method->attr.ma.value_ress)
1089 method->attr.ma.value_ress
1090 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1091 get_method_n_ress(method), method->attr.ma.res_type);
1092 assert((get_entity_type(get_struct_member(method->attr.ma.value_ress, pos)) != method->attr.ma.value_ress)
1093 && "result type not yet set");
1094 return get_struct_member(method->attr.ma.value_ress, pos);
1098 * Returns a type that represents the copied value results.
1100 type *get_method_value_res_type(type *method) {
1101 assert(method && (method->type_op == type_method));
1102 return method->attr.ma.value_ress;
1105 /* Returns the null-terminated name of this variadicity. */
1106 const char *get_variadicity_name(variadicity vari)
1108 #define X(a) case a: return #a
1110 X(variadicity_non_variadic);
1111 X(variadicity_variadic);
1118 variadicity get_method_variadicity(type *method)
1120 assert(method && (method->type_op == type_method));
1121 return method->attr.ma.variadicity;
1124 void set_method_variadicity(type *method, variadicity vari)
1126 assert(method && (method->type_op == type_method));
1127 method->attr.ma.variadicity = vari;
1131 * Returns the first variadic parameter index of a type.
1132 * If this index was NOT set, the index of the last parameter
1133 * of the method type plus one is returned for variadic functions.
1134 * Non-variadic function types always return -1 here.
1136 int get_method_first_variadic_param_index(type *method)
1138 assert(method && (method->type_op == type_method));
1140 if (method->attr.ma.variadicity == variadicity_non_variadic)
1143 if (method->attr.ma.first_variadic_param == -1)
1144 return get_method_n_params(method);
1145 return method->attr.ma.first_variadic_param;
1149 * Sets the first variadic parameter index. This allows to specify
1150 * a complete call type (containing the type of all parameters)
1151 * but still have the knowledge, which parameter must be passed as
1154 void set_method_first_variadic_param_index(type *method, int index)
1156 assert(method && (method->type_op == type_method));
1157 assert(index >= 0 && index <= get_method_n_params(method));
1159 method->attr.ma.first_variadic_param = index;
1163 int (is_method_type)(type *method) {
1164 return __is_method_type(method);
1167 /*-----------------------------------------------------------------*/
1169 /*-----------------------------------------------------------------*/
1171 /* create a new type uni */
1172 type *new_type_union (ident *name) {
1174 res = new_type(type_union, NULL, name);
1175 /*res->attr.ua.unioned_type = (type **) xmalloc (sizeof (type *) * n_types);
1176 res->attr.ua.delim_names = (ident **) xmalloc (sizeof (ident *) * n_types); */
1177 res->attr.ua.members = NEW_ARR_F (entity *, 0);
1180 type *new_d_type_union (ident *name, dbg_info* db) {
1181 type *res = new_type_union (name);
1182 set_type_dbg_info(res, db);
1185 void free_union_entities (type *uni) {
1187 assert(uni && (uni->type_op == type_union));
1188 for (i = get_union_n_members(uni)-1; i >= 0; --i)
1189 free_entity(get_union_member(uni, i));
1191 void free_union_attrs (type *uni) {
1192 assert(uni && (uni->type_op == type_union));
1193 DEL_ARR_F(uni->attr.ua.members);
1195 /* manipulate private fields of union */
1197 int get_union_n_types (type *uni) {
1198 assert(uni && (uni->type_op == type_union));
1199 return uni->attr.ua.n_types;
1201 type *get_union_unioned_type (type *uni, int pos) {
1202 assert(uni && (uni->type_op == type_union));
1203 assert(pos >= 0 && pos < get_union_n_types(uni));
1204 return uni->attr.ua.unioned_type[pos] = skip_tid(uni->attr.ua.unioned_type[pos]);
1206 void set_union_unioned_type (type *uni, int pos, type *tp) {
1207 assert(uni && (uni->type_op == type_union));
1208 assert(pos >= 0 && pos < get_union_n_types(uni));
1209 uni->attr.ua.unioned_type[pos] = tp;
1211 ident *get_union_delim_nameid (type *uni, int pos) {
1212 assert(uni && (uni->type_op == type_union));
1213 assert(pos >= 0 && pos < get_union_n_types(uni));
1214 return uni->attr.ua.delim_names[pos];
1216 const char *get_union_delim_name (type *uni, int pos) {
1217 assert(uni && (uni->type_op == type_union));
1218 assert(pos >= 0 && pos < get_union_n_types(uni));
1219 return get_id_str(uni->attr.ua.delim_names[pos]);
1221 void set_union_delim_nameid (type *uni, int pos, ident *id) {
1222 assert(uni && (uni->type_op == type_union));
1223 assert(pos >= 0 && pos < get_union_n_types(uni));
1224 uni->attr.ua.delim_names[pos] = id;
1227 int get_union_n_members (type *uni) {
1228 assert(uni && (uni->type_op == type_union));
1229 return (ARR_LEN (uni->attr.ua.members));
1231 void add_union_member (type *uni, entity *member) {
1232 assert(uni && (uni->type_op == type_union));
1233 ARR_APP1 (entity *, uni->attr.ua.members, member);
1235 entity *get_union_member (type *uni, int pos) {
1236 assert(uni && (uni->type_op == type_union));
1237 assert(pos >= 0 && pos < get_union_n_members(uni));
1238 return uni->attr.ua.members[pos];
1240 void set_union_member (type *uni, int pos, entity *member) {
1241 assert(uni && (uni->type_op == type_union));
1242 assert(pos >= 0 && pos < get_union_n_members(uni));
1243 uni->attr.ua.members[pos] = member;
1245 void remove_union_member(type *uni, entity *member) {
1247 assert(uni && (uni->type_op == type_union));
1248 for (i = 0; i < (ARR_LEN (uni->attr.ua.members)); i++)
1249 if (uni->attr.ua.members[i] == member) {
1250 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1251 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1252 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1258 int (is_union_type)(type *uni) {
1259 return __is_union_type(uni);
1262 /*-----------------------------------------------------------------*/
1264 /*-----------------------------------------------------------------*/
1267 /* create a new type array -- set dimension sizes independently */
1268 type *new_type_array (ident *name, int n_dimensions,
1269 type *element_type) {
1272 ir_graph *rem = current_ir_graph;
1273 assert(!is_method_type(element_type));
1275 res = new_type(type_array, NULL, name);
1276 res->attr.aa.n_dimensions = n_dimensions;
1277 res->attr.aa.lower_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
1278 res->attr.aa.upper_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
1279 res->attr.aa.order = (int *) xmalloc (sizeof (int) * n_dimensions);
1281 current_ir_graph = get_const_code_irg();
1282 for (i = 0; i < n_dimensions; i++) {
1283 res->attr.aa.lower_bound[i] = new_Unknown(mode_Iu);
1284 res->attr.aa.upper_bound[i] = new_Unknown(mode_Iu);
1285 res->attr.aa.order[i] = i;
1287 current_ir_graph = rem;
1289 res->attr.aa.element_type = element_type;
1290 new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1295 type *new_d_type_array (ident *name, int n_dimensions,
1296 type *element_type, dbg_info* db) {
1297 type *res = new_type_array (name, n_dimensions, element_type);
1298 set_type_dbg_info(res, db);
1302 void free_array_entities (type *array) {
1303 assert(array && (array->type_op == type_array));
1306 void free_array_attrs (type *array) {
1307 assert(array && (array->type_op == type_array));
1308 free(array->attr.aa.lower_bound);
1309 free(array->attr.aa.upper_bound);
1312 /* manipulate private fields of array type */
1313 int get_array_n_dimensions (type *array) {
1314 assert(array && (array->type_op == type_array));
1315 return array->attr.aa.n_dimensions;
1319 set_array_bounds (type *array, int dimension, ir_node * lower_bound,
1320 ir_node * upper_bound) {
1321 assert(array && (array->type_op == type_array));
1322 assert(lower_bound && "lower_bound node may not be NULL.");
1323 assert(upper_bound && "upper_bound node may not be NULL.");
1324 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1325 array->attr.aa.lower_bound[dimension] = lower_bound;
1326 array->attr.aa.upper_bound[dimension] = upper_bound;
1329 set_array_bounds_int (type *array, int dimension, int lower_bound,
1331 ir_graph *rem = current_ir_graph;
1332 current_ir_graph = get_const_code_irg();
1333 set_array_bounds (array, dimension,
1334 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1335 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1336 current_ir_graph = rem;
1339 set_array_lower_bound (type *array, int dimension, ir_node * lower_bound) {
1340 assert(array && (array->type_op == type_array));
1341 assert(lower_bound && "lower_bound node may not be NULL.");
1342 array->attr.aa.lower_bound[dimension] = lower_bound;
1344 void set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
1345 ir_graph *rem = current_ir_graph;
1346 current_ir_graph = get_const_code_irg();
1347 set_array_lower_bound (array, dimension,
1348 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1349 current_ir_graph = rem;
1352 set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
1353 assert(array && (array->type_op == type_array));
1354 assert(upper_bound && "upper_bound node may not be NULL.");
1355 array->attr.aa.upper_bound[dimension] = upper_bound;
1357 void set_array_upper_bound_int (type *array, int dimension, int upper_bound) {
1358 ir_graph *rem = current_ir_graph;
1359 current_ir_graph = get_const_code_irg();
1360 set_array_upper_bound (array, dimension,
1361 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1362 current_ir_graph = rem;
1364 int has_array_lower_bound (type *array, int dimension) {
1365 assert(array && (array->type_op == type_array));
1366 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1368 ir_node *get_array_lower_bound (type *array, int dimension) {
1369 assert(array && (array->type_op == type_array));
1370 return array->attr.aa.lower_bound[dimension];
1372 long get_array_lower_bound_int (type *array, int dimension) {
1374 assert(array && (array->type_op == type_array));
1375 node = array->attr.aa.lower_bound[dimension];
1376 assert(get_irn_op(node) == op_Const);
1377 return get_tarval_long(get_Const_tarval(node));
1379 int has_array_upper_bound (type *array, int dimension) {
1380 assert(array && (array->type_op == type_array));
1381 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1383 ir_node * get_array_upper_bound (type *array, int dimension) {
1384 assert(array && (array->type_op == type_array));
1385 return array->attr.aa.upper_bound[dimension];
1387 long get_array_upper_bound_int (type *array, int dimension) {
1389 assert(array && (array->type_op == type_array));
1390 node = array->attr.aa.upper_bound[dimension];
1391 assert(get_irn_op(node) == op_Const);
1392 return get_tarval_long(get_Const_tarval(node));
1395 void set_array_order (type *array, int dimension, int order) {
1396 assert(array && (array->type_op == type_array));
1397 array->attr.aa.order[dimension] = order;
1399 int get_array_order (type *array, int dimension) {
1400 assert(array && (array->type_op == type_array));
1401 return array->attr.aa.order[dimension];
1404 void set_array_element_type (type *array, type *tp) {
1405 assert(array && (array->type_op == type_array));
1406 assert(!is_method_type(tp));
1407 array->attr.aa.element_type = tp;
1409 type *get_array_element_type (type *array) {
1410 assert(array && (array->type_op == type_array));
1411 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1414 void set_array_element_entity (type *array, entity *ent) {
1415 assert(array && (array->type_op == type_array));
1416 assert((get_entity_type(ent)->type_op != type_method));
1417 array->attr.aa.element_ent = ent;
1418 array->attr.aa.element_type = get_entity_type(ent);
1420 entity *get_array_element_entity (type *array) {
1421 assert(array && (array->type_op == type_array));
1422 return array->attr.aa.element_ent;
1426 int (is_array_type)(type *array) {
1427 return __is_array_type(array);
1430 /*-----------------------------------------------------------------*/
1431 /* TYPE_ENUMERATION */
1432 /*-----------------------------------------------------------------*/
1434 /* create a new type enumeration -- set the enumerators independently */
1435 type *new_type_enumeration (ident *name, int n_enums) {
1437 res = new_type(type_enumeration, NULL, name);
1438 res->attr.ea.n_enums = n_enums;
1439 res->attr.ea.enumer = (tarval **)xmalloc(sizeof(res->attr.ea.enumer[0]) * n_enums);
1440 res->attr.ea.enum_nameid = (ident **)xmalloc(sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
1441 memset(res->attr.ea.enumer, 0, sizeof(res->attr.ea.enumer[0]) * n_enums);
1442 memset(res->attr.ea.enum_nameid, 0, sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
1445 type *new_d_type_enumeration (ident *name, int n_enums, dbg_info* db) {
1446 type *res = new_type_enumeration (name, n_enums);
1447 set_type_dbg_info(res, db);
1451 void free_enumeration_entities(type *enumeration) {
1452 assert(enumeration && (enumeration->type_op == type_enumeration));
1454 void free_enumeration_attrs(type *enumeration) {
1455 assert(enumeration && (enumeration->type_op == type_enumeration));
1456 free(enumeration->attr.ea.enumer);
1457 free(enumeration->attr.ea.enum_nameid);
1460 /* manipulate fields of enumeration type. */
1461 int get_enumeration_n_enums (type *enumeration) {
1462 assert(enumeration && (enumeration->type_op == type_enumeration));
1463 return enumeration->attr.ea.n_enums;
1465 void set_enumeration_enum (type *enumeration, int pos, tarval *con) {
1466 assert(enumeration && (enumeration->type_op == type_enumeration));
1467 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1468 enumeration->attr.ea.enumer[pos] = con;
1470 tarval *get_enumeration_enum (type *enumeration, int pos) {
1471 assert(enumeration && (enumeration->type_op == type_enumeration));
1472 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1473 return enumeration->attr.ea.enumer[pos];
1475 void set_enumeration_nameid (type *enumeration, int pos, ident *id) {
1476 assert(enumeration && (enumeration->type_op == type_enumeration));
1477 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1478 enumeration->attr.ea.enum_nameid[pos] = id;
1480 ident *get_enumeration_nameid (type *enumeration, int pos) {
1481 assert(enumeration && (enumeration->type_op == type_enumeration));
1482 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1483 return enumeration->attr.ea.enum_nameid[pos];
1485 const char *get_enumeration_name(type *enumeration, int pos) {
1486 assert(enumeration && (enumeration->type_op == type_enumeration));
1487 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1488 return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
1492 int (is_enumeration_type)(type *enumeration) {
1493 return __is_enumeration_type(enumeration);
1496 /*-----------------------------------------------------------------*/
1498 /*-----------------------------------------------------------------*/
1500 /* Create a new type pointer */
1501 type *new_type_pointer_mode (ident *name, type *points_to, ir_mode *ptr_mode) {
1503 assert(mode_is_reference(ptr_mode));
1504 res = new_type(type_pointer, ptr_mode, name);
1505 res->attr.pa.points_to = points_to;
1506 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1507 res->size = get_mode_size_bits(res->mode);
1508 res->state = layout_fixed;
1511 type *new_d_type_pointer (ident *name, type *points_to, ir_mode *ptr_mode, dbg_info* db) {
1512 type *res = new_type_pointer_mode (name, points_to, ptr_mode);
1513 set_type_dbg_info(res, db);
1516 void free_pointer_entities (type *pointer) {
1517 assert(pointer && (pointer->type_op == type_pointer));
1519 void free_pointer_attrs (type *pointer) {
1520 assert(pointer && (pointer->type_op == type_pointer));
1522 /* manipulate fields of type_pointer */
1523 void set_pointer_points_to_type (type *pointer, type *tp) {
1524 assert(pointer && (pointer->type_op == type_pointer));
1525 pointer->attr.pa.points_to = tp;
1527 type *get_pointer_points_to_type (type *pointer) {
1528 assert(pointer && (pointer->type_op == type_pointer));
1529 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1533 int (is_pointer_type)(type *pointer) {
1534 return __is_pointer_type(pointer);
1537 /* Returns the first pointer type that has as points_to tp.
1538 * Not efficient: O(#types).
1539 * If not found returns unknown_type. */
1540 type *find_pointer_type_to_type (type *tp) {
1542 for (i = 0; i < get_irp_n_types(); ++i) {
1543 type *found = get_irp_type(i);
1544 if (is_pointer_type(found) && get_pointer_points_to_type(found) == tp)
1547 return unknown_type;
1552 /*-----------------------------------------------------------------*/
1553 /* TYPE_PRIMITIVE */
1554 /*-----------------------------------------------------------------*/
1556 /* create a new type primitive */
1557 type *new_type_primitive (ident *name, ir_mode *mode) {
1559 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1560 res = new_type(type_primitive, mode, name);
1561 res->size = get_mode_size_bits(mode);
1562 res->state = layout_fixed;
1565 type *new_d_type_primitive (ident *name, ir_mode *mode, dbg_info* db) {
1566 type *res = new_type_primitive (name, mode);
1567 set_type_dbg_info(res, db);
1570 void free_primitive_entities (type *primitive) {
1571 assert(primitive && (primitive->type_op == type_primitive));
1573 void free_primitive_attrs (type *primitive) {
1574 assert(primitive && (primitive->type_op == type_primitive));
1578 int (is_primitive_type)(type *primitive) {
1579 return __is_primitive_type(primitive);
1582 /*-----------------------------------------------------------------*/
1583 /* common functionality */
1584 /*-----------------------------------------------------------------*/
1587 int (is_atomic_type)(type *tp) {
1588 return __is_atomic_type(tp);
1592 * Gets the number of elements in a firm compound type.
1594 int get_compound_n_members(type *tp)
1598 if (is_struct_type(tp))
1599 res = get_struct_n_members(tp);
1600 else if (is_class_type(tp))
1601 res = get_class_n_members(tp);
1602 else if (is_union_type(tp))
1603 res = get_union_n_members(tp);
1605 assert(0 && "need struct, union or class for member count");
1611 * Gets the member of a firm compound type at position pos.
1613 entity *get_compound_member(type *tp, int pos)
1617 if (is_struct_type(tp))
1618 res = get_struct_member(tp, pos);
1619 else if (is_class_type(tp))
1620 res = get_class_member(tp, pos);
1621 else if (is_union_type(tp))
1622 res = get_union_member(tp, pos);
1625 assert(0 && "need struct, union or class to get a member");
1633 int is_compound_type(type *tp) {
1634 assert(tp && tp->kind == k_type);
1635 return (is_class_type(tp) || is_struct_type(tp) ||
1636 is_array_type(tp) || is_union_type(tp));