3 * File name: ir/tr/type.c
4 * Purpose: Representation of types.
5 * Author: Goetz Lindenmaier
6 * Modified by: Michael Beck
9 * Copyright: (c) 2001-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
17 * Implementation of the datastructure to hold
20 * (C) 2001-2005 by Universitaet Karlsruhe
23 * This module supplies a datastructure to represent all types
24 * known in the compiled program. This includes types specified
25 * in the program as well as types defined by the language. In the
26 * view of the intermediate representation there is no difference
27 * between these types.
29 * There exist several kinds of types, arranged by the structure of
30 * the type. A type is described by a set of attributes. Some of
31 * these attributes are common to all types, others depend on the
34 * Types are different from the modes defined in irmode: Types are
35 * on the level of the programming language, modes at the level of
36 * the target processor.
38 * @see type_t.h type tpop
63 # include "irprog_t.h"
66 # include "typegmod.h"
73 /*-----------------------------------------------------------------*/
75 /*-----------------------------------------------------------------*/
77 type *firm_none_type; type *get_none_type(void) { return firm_none_type; }
78 type *firm_unknown_type; type *get_unknown_type(void) { return firm_unknown_type; }
82 /* Returns a new, unique number to number nodes or the like. */
83 int get_irp_new_node_nr(void);
86 /* Suffixes added to types used for pass-by-value representations. */
87 static ident *value_params_suffix = NULL;
88 static ident *value_ress_suffix = NULL;
90 /** The default calling convention for method types. */
91 static unsigned default_cc_mask;
93 /* return the default calling convention for method types */
94 unsigned get_default_cc_mask(void) {
95 return default_cc_mask;
98 /* Initialize the type module. */
99 void firm_init_type(dbg_info *builtin_db, unsigned def_cc_mask)
101 default_cc_mask = def_cc_mask;
102 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
103 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
105 /* construct none and unknown type. */
106 firm_none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"), builtin_db);
107 set_type_size_bits(firm_none_type, 0);
108 set_type_state (firm_none_type, layout_fixed);
109 remove_irp_type(firm_none_type);
111 firm_unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"), builtin_db);
112 set_type_size_bits(firm_unknown_type, 0);
113 set_type_state (firm_unknown_type, layout_fixed);
114 remove_irp_type(firm_unknown_type);
117 /** the global type visited flag */
118 unsigned long firm_type_visited;
120 void (set_master_type_visited)(unsigned long val) { _set_master_type_visited(val); }
121 unsigned long (get_master_type_visited)(void) { return _get_master_type_visited(); }
122 void (inc_master_type_visited)(void) { _inc_master_type_visited(); }
125 * Creates a new type representation.
128 new_type(tp_op *type_op, ir_mode *mode, ident *name, dbg_info *db) {
132 assert(type_op != type_id);
133 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
135 node_size = offsetof(type, attr) + type_op->attr_size;
136 res = xmalloc(node_size);
137 memset(res, 0, node_size);
140 res->type_op = type_op;
143 res->visibility = visibility_external_allocated;
145 res->state = layout_undefined;
152 res->nr = get_irp_new_node_nr();
153 #endif /* defined DEBUG_libfirm */
155 add_irp_type(res); /* Remember the new type global. */
160 void free_type(type *tp) {
161 const tp_op *op = get_type_tpop(tp);
163 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
165 /* Remove from list of all types */
167 /* Free the attributes of the type. */
169 /* Free entities automatically allocated with the type */
170 if (op->ops.free_auto_entities)
171 op->ops.free_auto_entities(tp);
172 /* And now the type itself... */
177 void free_type_entities(type *tp) {
178 const tp_op *tpop = get_type_tpop(tp);
180 if (tpop->ops.free_entities)
181 tpop->ops.free_entities(tp);
184 void free_type_attrs(type *tp) {
185 const tp_op *tpop = get_type_tpop(tp);
187 if (tpop->ops.free_attrs)
188 tpop->ops.free_attrs(tp);
191 /* set/get the link field */
192 void *(get_type_link)(const type *tp) {
193 return _get_type_link(tp);
196 void (set_type_link)(type *tp, void *l) {
197 _set_type_link(tp, l);
200 const tp_op *(get_type_tpop)(const type *tp) {
201 return _get_type_tpop(tp);
204 ident *(get_type_tpop_nameid)(const type *tp) {
205 return _get_type_tpop_nameid(tp);
208 const char* get_type_tpop_name(const type *tp) {
209 assert(tp && tp->kind == k_type);
210 return get_id_str(tp->type_op->name);
213 tp_opcode (get_type_tpop_code)(const type *tp) {
214 return _get_type_tpop_code(tp);
217 ir_mode *(get_type_mode)(const type *tp) {
218 return _get_type_mode(tp);
221 void set_type_mode(type *tp, ir_mode *mode) {
222 const tp_op *tpop = get_type_tpop(tp);
224 if (tpop->ops.set_type_mode)
225 tpop->ops.set_type_mode(tp, mode);
227 assert(0 && "setting a mode is NOT allowed for this type");
230 ident *(get_type_ident)(const type *tp) {
231 return _get_type_ident(tp);
234 void (set_type_ident)(type *tp, ident* id) {
235 _set_type_ident(tp, id);
238 /* Outputs a unique number for this node */
239 long get_type_nr(const type *tp) {
248 const char* get_type_name(const type *tp) {
249 assert(tp && tp->kind == k_type);
250 return (get_id_str(tp->name));
253 int (get_type_size_bytes)(const type *tp) {
254 return _get_type_size_bytes(tp);
257 int (get_type_size_bits)(const type *tp) {
258 return _get_type_size_bits(tp);
262 visibility get_type_visibility (const type *tp) {
264 visibility res = visibility_local;
265 if (is_compound_type(tp)) {
267 if (is_Array_type(tp)) {
268 entity *mem = get_array_element_entity(tp);
269 if (get_entity_visibility(mem) != visibility_local)
270 res = visibility_external_visible;
272 int i, n_mems = get_compound_n_members(tp);
273 for (i = 0; i < n_mems; ++i) {
274 entity *mem = get_compound_member(tp, i);
275 if (get_entity_visibility(mem) != visibility_local)
276 res = visibility_external_visible;
283 return tp->visibility;
286 void set_type_visibility (type *tp, visibility v) {
289 /* check for correctness */
290 if (v != visibility_external_allocated) {
291 visibility res = visibility_local;
292 if (is_compound_type(tp)) {
293 if (is_Array_type(tp)) {
294 entity *mem = get_array_element_entity(tp);
295 if (get_entity_visibility(mem) > res)
296 res = get_entity_visibility(mem);
298 int i, n_mems = get_compound_n_members(tp);
299 for (i = 0; i < n_mems; ++i) {
300 entity *mem = get_compound_member(tp, i);
301 if (get_entity_visibility(mem) > res)
302 res = get_entity_visibility(mem);
313 set_type_size_bits(type *tp, int size) {
314 const tp_op *tpop = get_type_tpop(tp);
316 if (tpop->ops.set_type_size)
317 tpop->ops.set_type_size(tp, size);
319 assert(0 && "Cannot set size for this type");
323 set_type_size_bytes(type *tp, int size) {
324 set_type_size_bits(tp, 8*size);
327 int get_type_alignment_bytes(type *tp) {
328 int align = get_type_alignment_bits(tp);
330 return align < 0 ? align : (align + 7) >> 3;
333 int get_type_alignment_bits(type *tp) {
339 /* alignment NOT set calculate it "on demand" */
341 align = get_mode_size_bits(tp->mode);
342 else if (is_Array_type(tp))
343 align = get_type_alignment_bits(get_array_element_type(tp));
344 else if (is_compound_type(tp)) {
345 int i, n = get_compound_n_members(tp);
348 for (i = 0; i < n; ++i) {
349 type *t = get_entity_type(get_compound_member(tp, i));
350 int a = get_type_alignment_bits(t);
356 else if (is_Method_type(tp))
366 set_type_alignment_bits(type *tp, int align) {
367 assert(tp && tp->kind == k_type);
368 /* Methods don't have an alignment. */
369 if (tp->type_op != type_method) {
375 set_type_alignment_bytes(type *tp, int align) {
376 set_type_alignment_bits(tp, 8*align);
379 /* Returns a human readable string for the enum entry. */
380 const char *get_type_state_name(type_state s) {
381 #define X(a) case a: return #a;
391 type_state (get_type_state)(const type *tp) {
392 return _get_type_state(tp);
396 set_type_state(type *tp, type_state state) {
397 assert(tp && tp->kind == k_type);
399 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
400 (tp->type_op == type_method))
403 /* Just a correctness check: */
404 if (state == layout_fixed) {
406 switch (get_type_tpop_code(tp)) {
409 assert(get_type_size_bits(tp) > -1);
410 if (tp != get_glob_type()) {
411 int n_mem = get_class_n_members(tp);
412 for (i = 0; i < n_mem; i++) {
413 if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
414 { DDMT(tp); DDME(get_class_member(tp, i)); }
415 assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
417 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
418 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
425 assert(get_type_size_bits(tp) > -1);
426 for (i = 0; i < get_struct_n_members(tp); i++) {
427 assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
428 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
437 Assure that only innermost dimension is dynamic? */
439 case tpo_enumeration:
441 assert(get_type_mode != NULL);
442 for (i = 0; i < get_enumeration_n_enums(tp); i++)
443 assert(get_enumeration_enum(tp, i) != NULL);
451 unsigned long (get_type_visited)(const type *tp) {
452 return _get_type_visited(tp);
455 void (set_type_visited)(type *tp, unsigned long num) {
456 _set_type_visited(tp, num);
459 /* Sets visited field in type to type_visited. */
460 void (mark_type_visited)(type *tp) {
461 _mark_type_visited(tp);
464 int (type_visited)(const type *tp) {
465 return _type_visited(tp);
468 int (type_not_visited)(const type *tp) {
469 return _type_not_visited(tp);
472 int (is_type)(const void *thing) {
473 return _is_type(thing);
476 /* Checks whether two types are structural equal.*/
477 int equal_type(type *typ1, type *typ2) {
482 if (typ1 == typ2) return 1;
484 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
485 (get_type_ident(typ1) != get_type_ident(typ2)) ||
486 (get_type_mode(typ1) != get_type_mode(typ2)) ||
487 (get_type_state(typ1) != get_type_state(typ2)))
489 if ((get_type_state(typ1) == layout_fixed) &&
490 (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
493 switch (get_type_tpop_code(typ1)) {
495 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
496 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
497 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
498 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
499 /** Compare the members **/
500 m = alloca(sizeof(entity *) * get_class_n_members(typ1));
501 memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
502 /* First sort the members of typ2 */
503 for (i = 0; i < get_class_n_members(typ1); i++) {
504 entity *e1 = get_class_member(typ1, i);
505 for (j = 0; j < get_class_n_members(typ2); j++) {
506 entity *e2 = get_class_member(typ2, j);
507 if (get_entity_name(e1) == get_entity_name(e2))
511 for (i = 0; i < get_class_n_members(typ1); i++) {
512 if (!m[i] || /* Found no counterpart */
513 !equal_entity(get_class_member(typ1, i), m[i]))
516 /** Compare the supertypes **/
517 t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
518 memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
519 /* First sort the supertypes of typ2 */
520 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
521 type *t1 = get_class_supertype(typ1, i);
522 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
523 type *t2 = get_class_supertype(typ2, j);
524 if (get_type_ident(t2) == get_type_ident(t1))
528 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
529 if (!t[i] || /* Found no counterpart */
530 get_class_supertype(typ1, i) != t[i])
535 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
536 m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
537 memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
538 /* First sort the members of lt */
539 for (i = 0; i < get_struct_n_members(typ1); i++) {
540 entity *e1 = get_struct_member(typ1, i);
541 for (j = 0; j < get_struct_n_members(typ2); j++) {
542 entity *e2 = get_struct_member(typ2, j);
543 if (get_entity_name(e1) == get_entity_name(e2))
547 for (i = 0; i < get_struct_n_members(typ1); i++) {
548 if (!m[i] || /* Found no counterpart */
549 !equal_entity(get_struct_member(typ1, i), m[i]))
554 int n_param1, n_param2;
556 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
557 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
558 if (get_method_calling_convention(typ1) !=
559 get_method_calling_convention(typ2)) return 0;
561 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
562 n_param1 = get_method_n_params(typ1);
563 n_param2 = get_method_n_params(typ2);
566 n_param1 = get_method_first_variadic_param_index(typ1);
567 n_param2 = get_method_first_variadic_param_index(typ2);
570 if (n_param1 != n_param2) return 0;
572 for (i = 0; i < n_param1; i++) {
573 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
576 for (i = 0; i < get_method_n_ress(typ1); i++) {
577 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
582 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
583 m = alloca(sizeof(entity *) * get_union_n_members(typ1));
584 memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
585 /* First sort the members of lt */
586 for (i = 0; i < get_union_n_members(typ1); i++) {
587 entity *e1 = get_union_member(typ1, i);
588 for (j = 0; j < get_union_n_members(typ2); j++) {
589 entity *e2 = get_union_member(typ2, j);
590 if (get_entity_name(e1) == get_entity_name(e2))
594 for (i = 0; i < get_union_n_members(typ1); i++) {
595 if (!m[i] || /* Found no counterpart */
596 !equal_entity(get_union_member(typ1, i), m[i]))
601 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
603 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
605 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
606 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
607 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
609 if (get_array_order(typ1, i) != get_array_order(typ2, i))
610 assert(0 && "type compare with different dimension orders not implemented");
613 case tpo_enumeration: {
614 assert(0 && "enumerations not implemented");
617 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
620 case tpo_primitive: {
627 /* Checks whether two types are structural comparable. */
628 int smaller_type (type *st, type *lt) {
632 if (st == lt) return 1;
634 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
637 switch(get_type_tpop_code(st)) {
639 return is_subclass_of(st, lt);
642 if (get_struct_n_members(st) != get_struct_n_members(lt)) return 0;
643 m = alloca(sizeof(entity *) * get_struct_n_members(st));
644 memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
645 /* First sort the members of lt */
646 for (i = 0; i < get_struct_n_members(st); i++) {
647 entity *se = get_struct_member(st, i);
648 for (j = 0; j < get_struct_n_members(lt); j++) {
649 entity *le = get_struct_member(lt, j);
650 if (get_entity_name(le) == get_entity_name(se))
654 for (i = 0; i < get_struct_n_members(st); i++) {
655 if (!m[i] || /* Found no counterpart */
656 !smaller_type(get_entity_type(get_struct_member(st, i)),
657 get_entity_type(m[i])))
662 int n_param1, n_param2;
664 /** FIXME: is this still 1? */
665 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
666 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
667 if (get_method_calling_convention(st) !=
668 get_method_calling_convention(lt)) return 0;
670 if (get_method_variadicity(st) == variadicity_non_variadic) {
671 n_param1 = get_method_n_params(st);
672 n_param2 = get_method_n_params(lt);
675 n_param1 = get_method_first_variadic_param_index(st);
676 n_param2 = get_method_first_variadic_param_index(lt);
679 if (n_param1 != n_param2) return 0;
681 for (i = 0; i < get_method_n_params(st); i++) {
682 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
685 for (i = 0; i < get_method_n_ress(st); i++) {
686 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
691 if (get_union_n_members(st) != get_union_n_members(lt)) return 0;
692 m = alloca(sizeof(entity *) * get_union_n_members(st));
693 memset(m, 0, sizeof(entity *) * get_union_n_members(st));
694 /* First sort the members of lt */
695 for (i = 0; i < get_union_n_members(st); i++) {
696 entity *se = get_union_member(st, i);
697 for (j = 0; j < get_union_n_members(lt); j++) {
698 entity *le = get_union_member(lt, j);
699 if (get_entity_name(le) == get_entity_name(se))
703 for (i = 0; i < get_union_n_members(st); i++) {
704 if (!m[i] || /* Found no counterpart */
705 !smaller_type(get_entity_type(get_union_member(st, i)),
706 get_entity_type(m[i])))
711 type *set, *let; /* small/large elt. type */
712 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
714 set = get_array_element_type(st);
715 let = get_array_element_type(lt);
717 /* If the element types are different, set must be convertible
718 to let, and they must have the same size so that address
719 computations work out. To have a size the layout must
721 if ((get_type_state(set) != layout_fixed) ||
722 (get_type_state(let) != layout_fixed))
724 if (!smaller_type(set, let) ||
725 get_type_size_bits(set) != get_type_size_bits(let))
728 for(i = 0; i < get_array_n_dimensions(st); i++) {
729 if (get_array_lower_bound(lt, i))
730 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
732 if (get_array_upper_bound(lt, i))
733 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
737 case tpo_enumeration: {
738 assert(0 && "enumerations not implemented");
741 if (!smaller_type(get_pointer_points_to_type(st),
742 get_pointer_points_to_type(lt)))
745 case tpo_primitive: {
746 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
754 /*-----------------------------------------------------------------*/
756 /*-----------------------------------------------------------------*/
758 /* create a new class type */
759 type *new_d_type_class (ident *name, dbg_info *db) {
762 res = new_type(type_class, NULL, name, db);
764 res->attr.ca.members = NEW_ARR_F (entity *, 0);
765 res->attr.ca.subtypes = NEW_ARR_F (type *, 0);
766 res->attr.ca.supertypes = NEW_ARR_F (type *, 0);
767 res->attr.ca.peculiarity = peculiarity_existent;
768 res->attr.ca.dfn = 0;
773 type *new_type_class (ident *name) {
774 return new_d_type_class (name, NULL);
777 void free_class_entities(type *clss) {
779 assert(clss && (clss->type_op == type_class));
780 for (i = get_class_n_members(clss) - 1; i >= 0; --i)
781 free_entity(get_class_member(clss, i));
784 void free_class_attrs(type *clss) {
785 assert(clss && (clss->type_op == type_class));
786 DEL_ARR_F(clss->attr.ca.members);
787 DEL_ARR_F(clss->attr.ca.subtypes);
788 DEL_ARR_F(clss->attr.ca.supertypes);
791 /* manipulate private fields of class type */
792 void add_class_member (type *clss, entity *member) {
793 assert(clss && (clss->type_op == type_class));
794 assert(clss != get_entity_type(member) && "recursive type");
795 ARR_APP1 (entity *, clss->attr.ca.members, member);
798 int (get_class_n_members) (const type *clss) {
799 return _get_class_n_members(clss);
802 int get_class_member_index(type *clss, entity *mem) {
804 assert(clss && (clss->type_op == type_class));
805 for (i = 0; i < get_class_n_members(clss); i++)
806 if (get_class_member(clss, i) == mem)
811 entity *(get_class_member) (const type *clss, int pos) {
812 return _get_class_member(clss, pos);
815 entity *get_class_member_by_name(type *clss, ident *name) {
817 assert(clss && (clss->type_op == type_class));
818 n_mem = get_class_n_members(clss);
819 for (i = 0; i < n_mem; ++i) {
820 entity *mem = get_class_member(clss, i);
821 if (get_entity_ident(mem) == name) return mem;
826 void set_class_member (type *clss, entity *member, int pos) {
827 assert(clss && (clss->type_op == type_class));
828 assert(pos >= 0 && pos < get_class_n_members(clss));
829 clss->attr.ca.members[pos] = member;
831 void set_class_members (type *clss, entity **members, int arity) {
833 assert(clss && (clss->type_op == type_class));
834 DEL_ARR_F(clss->attr.ca.members);
835 clss->attr.ca.members = NEW_ARR_F (entity *, 0);
836 for (i = 0; i < arity; i++) {
837 set_entity_owner(members[i], clss);
838 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
841 void remove_class_member(type *clss, entity *member) {
843 assert(clss && (clss->type_op == type_class));
844 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
845 if (clss->attr.ca.members[i] == member) {
846 for (; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
847 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
848 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
854 void add_class_subtype (type *clss, type *subtype) {
856 assert(clss && (clss->type_op == type_class));
857 ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
858 for (i = 0; i < get_class_n_supertypes(subtype); i++)
859 if (get_class_supertype(subtype, i) == clss)
860 /* Class already registered */
862 ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
864 int get_class_n_subtypes (const type *clss) {
865 assert(clss && (clss->type_op == type_class));
866 return (ARR_LEN (clss->attr.ca.subtypes));
868 type *get_class_subtype (type *clss, int pos) {
869 assert(clss && (clss->type_op == type_class));
870 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
871 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
873 int get_class_subtype_index(type *clss, const type *subclass) {
874 int i, n_subtypes = get_class_n_subtypes(clss);
875 assert(is_Class_type(subclass));
876 for (i = 0; i < n_subtypes; ++i) {
877 if (get_class_subtype(clss, i) == subclass) return i;
881 void set_class_subtype (type *clss, type *subtype, int pos) {
882 assert(clss && (clss->type_op == type_class));
883 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
884 clss->attr.ca.subtypes[pos] = subtype;
886 void remove_class_subtype(type *clss, type *subtype) {
888 assert(clss && (clss->type_op == type_class));
889 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
890 if (clss->attr.ca.subtypes[i] == subtype) {
891 for (; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
892 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
893 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
898 void add_class_supertype (type *clss, type *supertype) {
900 assert(clss && (clss->type_op == type_class));
901 assert(supertype && (supertype -> type_op == type_class));
902 ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
903 for (i = 0; i < get_class_n_subtypes(supertype); i++)
904 if (get_class_subtype(supertype, i) == clss)
905 /* Class already registered */
907 ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
909 int get_class_n_supertypes (const type *clss) {
910 assert(clss && (clss->type_op == type_class));
911 return (ARR_LEN (clss->attr.ca.supertypes));
913 int get_class_supertype_index(type *clss, type *super_clss) {
914 int i, n_supertypes = get_class_n_supertypes(clss);
915 assert(super_clss && (super_clss->type_op == type_class));
916 for (i = 0; i < n_supertypes; i++)
917 if (get_class_supertype(clss, i) == super_clss)
921 type *get_class_supertype (type *clss, int pos) {
922 assert(clss && (clss->type_op == type_class));
923 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
924 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
926 void set_class_supertype (type *clss, type *supertype, int pos) {
927 assert(clss && (clss->type_op == type_class));
928 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
929 clss->attr.ca.supertypes[pos] = supertype;
931 void remove_class_supertype(type *clss, type *supertype) {
933 assert(clss && (clss->type_op == type_class));
934 for (i = 0; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
935 if (clss->attr.ca.supertypes[i] == supertype) {
936 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
937 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
938 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
943 const char *get_peculiarity_string(peculiarity p) {
944 #define X(a) case a: return #a
946 X(peculiarity_description);
947 X(peculiarity_inherited);
948 X(peculiarity_existent);
951 return "invalid peculiarity";
954 peculiarity get_class_peculiarity (const type *clss) {
955 assert(clss && (clss->type_op == type_class));
956 return clss->attr.ca.peculiarity;
959 void set_class_peculiarity (type *clss, peculiarity pec) {
960 assert(clss && (clss->type_op == type_class));
961 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
962 clss->attr.ca.peculiarity = pec;
965 void set_class_dfn (type *clss, int dfn)
967 clss->attr.ca.dfn = dfn;
970 int get_class_dfn (const type *clss)
972 return (clss->attr.ca.dfn);
976 int (is_Class_type)(const type *clss) {
977 return _is_class_type(clss);
980 void set_class_mode(type *tp, ir_mode *mode) {
981 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
982 assert(get_type_state(tp) == layout_fixed &&
983 tp->size == get_mode_size_bits(mode) && "mode don't match class layout");
987 void set_class_size_bits(type *tp, int size) {
988 /* argh: we must allow to set negative values as "invalid size" */
989 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
990 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
993 /*----------------------------------------------------------------**/
995 /*----------------------------------------------------------------**/
997 /* create a new type struct */
998 type *new_d_type_struct(ident *name, dbg_info *db) {
999 type *res = new_type(type_struct, NULL, name, db);
1001 res->attr.sa.members = NEW_ARR_F(entity *, 0);
1006 type *new_type_struct (ident *name) {
1007 return new_d_type_struct (name, NULL);
1010 void free_struct_entities (type *strct) {
1012 assert(strct && (strct->type_op == type_struct));
1013 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
1014 free_entity(get_struct_member(strct, i));
1016 void free_struct_attrs (type *strct) {
1017 assert(strct && (strct->type_op == type_struct));
1018 DEL_ARR_F(strct->attr.sa.members);
1021 /* manipulate private fields of struct */
1022 int get_struct_n_members (const type *strct) {
1023 assert(strct && (strct->type_op == type_struct));
1024 return (ARR_LEN (strct->attr.sa.members));
1027 void add_struct_member (type *strct, entity *member) {
1028 assert(strct && (strct->type_op == type_struct));
1029 assert(get_type_tpop(get_entity_type(member)) != type_method);
1030 /* @@@ lowerfirm geht nicht durch */
1031 assert(strct != get_entity_type(member) && "recursive type");
1032 ARR_APP1 (entity *, strct->attr.sa.members, member);
1035 entity *get_struct_member (const type *strct, int pos) {
1036 assert(strct && (strct->type_op == type_struct));
1037 assert(pos >= 0 && pos < get_struct_n_members(strct));
1038 return strct->attr.sa.members[pos];
1041 int get_struct_member_index(type *strct, entity *mem) {
1043 assert(strct && (strct->type_op == type_struct));
1044 for (i = 0; i < get_struct_n_members(strct); i++)
1045 if (get_struct_member(strct, i) == mem)
1050 void set_struct_member (type *strct, int pos, entity *member) {
1051 assert(strct && (strct->type_op == type_struct));
1052 assert(pos >= 0 && pos < get_struct_n_members(strct));
1053 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
1054 strct->attr.sa.members[pos] = member;
1056 void remove_struct_member(type *strct, entity *member) {
1058 assert(strct && (strct->type_op == type_struct));
1059 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
1060 if (strct->attr.sa.members[i] == member) {
1061 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
1062 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1063 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1069 int (is_Struct_type)(const type *strct) {
1070 return _is_struct_type(strct);
1073 void set_struct_mode(type *tp, ir_mode *mode) {
1074 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1075 assert(get_type_state(tp) == layout_fixed &&
1076 tp->size == get_mode_size_bits(mode) && "mode don't match struct layout");
1080 void set_struct_size_bits(type *tp, int size) {
1081 /* argh: we must allow to set negative values as "invalid size" */
1082 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1083 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1086 /*******************************************************************/
1088 /*******************************************************************/
1091 * Lazy construction of value argument / result representation.
1092 * Constructs a struct type and its member. The types of the members
1093 * are passed in the argument list.
1095 * @param name name of the type constructed
1096 * @param len number of fields
1097 * @param tps array of field types with length len
1099 static INLINE type *
1100 build_value_type(ident *name, int len, tp_ent_pair *tps) {
1102 type *res = new_type_struct(name);
1103 /* Remove type from type list. Must be treated differently than other types. */
1104 remove_irp_type(res);
1105 for (i = 0; i < len; i++) {
1106 /* use res as default if corresponding type is not yet set. */
1107 type *elt_type = tps[i].tp ? tps[i].tp : res;
1109 tps[i].ent = new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
1114 /* Create a new method type.
1115 N_param is the number of parameters, n_res the number of results. */
1116 type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
1119 assert((get_mode_size_bytes(mode_P_code) != -1) && "unorthodox modes not implemented");
1120 res = new_type(type_method, mode_P_code, name, db);
1121 res->state = layout_fixed;
1122 res->size = get_mode_size_bits(mode_P_code);
1123 res->attr.ma.n_params = n_param;
1124 res->attr.ma.param_type = xcalloc(n_param, sizeof(res->attr.ma.param_type[0]));
1125 res->attr.ma.value_params = NULL;
1126 res->attr.ma.n_res = n_res;
1127 res->attr.ma.res_type = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
1128 res->attr.ma.value_ress = NULL;
1129 res->attr.ma.variadicity = variadicity_non_variadic;
1130 res->attr.ma.first_variadic_param = -1;
1131 res->attr.ma.irg_calling_conv = default_cc_mask;
1136 type *new_type_method(ident *name, int n_param, int n_res) {
1137 return new_d_type_method(name, n_param, n_res, NULL);
1140 void free_method_entities(type *method) {
1141 assert(method && (method->type_op == type_method));
1144 /* Attention: also frees entities in value parameter subtypes! */
1145 void free_method_attrs(type *method) {
1146 assert(method && (method->type_op == type_method));
1147 free(method->attr.ma.param_type);
1148 free(method->attr.ma.res_type);
1149 if (method->attr.ma.value_params) {
1150 free_type_entities(method->attr.ma.value_params);
1151 free_type(method->attr.ma.value_params);
1153 if (method->attr.ma.value_ress) {
1154 free_type_entities(method->attr.ma.value_ress);
1155 free_type(method->attr.ma.value_ress);
1159 /* manipulate private fields of method. */
1160 int (get_method_n_params)(const type *method) {
1161 return _get_method_n_params(method);
1164 type *get_method_param_type(type *method, int pos) {
1166 assert(method && (method->type_op == type_method));
1167 assert(pos >= 0 && pos < get_method_n_params(method));
1168 res = method->attr.ma.param_type[pos].tp;
1169 assert(res != NULL && "empty method param type");
1170 return method->attr.ma.param_type[pos].tp = skip_tid(res);
1173 void set_method_param_type(type *method, int pos, type* tp) {
1174 assert(method && (method->type_op == type_method));
1175 assert(pos >= 0 && pos < get_method_n_params(method));
1176 method->attr.ma.param_type[pos].tp = tp;
1177 /* If information constructed set pass-by-value representation. */
1178 if (method->attr.ma.value_params) {
1179 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1180 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1184 /* Returns an entity that represents the copied value argument. Only necessary
1185 for compounds passed by value. */
1186 entity *get_method_value_param_ent(type *method, int pos) {
1187 assert(method && (method->type_op == type_method));
1188 assert(pos >= 0 && pos < get_method_n_params(method));
1190 if (!method->attr.ma.value_params) {
1191 /* parameter value type not created yet, build */
1192 method->attr.ma.value_params
1193 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
1194 get_method_n_params(method), method->attr.ma.param_type);
1197 * build_value_type() sets the method->attr.ma.value_params type as default if
1200 assert((get_entity_type(method->attr.ma.param_type[pos].ent) != method->attr.ma.value_params)
1201 && "param type not yet set");
1202 return method->attr.ma.param_type[pos].ent;
1206 * Returns a type that represents the copied value arguments.
1208 type *get_method_value_param_type(const type *method)
1210 assert(method && (method->type_op == type_method));
1211 return method->attr.ma.value_params;
1214 int (get_method_n_ress)(const type *method) {
1215 return _get_method_n_ress(method);
1218 type *get_method_res_type(type *method, int pos) {
1220 assert(method && (method->type_op == type_method));
1221 assert(pos >= 0 && pos < get_method_n_ress(method));
1222 res = method->attr.ma.res_type[pos].tp;
1223 assert(res != NULL && "empty method return type");
1224 return method->attr.ma.res_type[pos].tp = skip_tid(res);
1227 void set_method_res_type(type *method, int pos, type* tp) {
1228 assert(method && (method->type_op == type_method));
1229 assert(pos >= 0 && pos < get_method_n_ress(method));
1230 /* set the result type */
1231 method->attr.ma.res_type[pos].tp = tp;
1232 /* If information constructed set pass-by-value representation. */
1233 if (method->attr.ma.value_ress) {
1234 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1235 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1239 /* Returns an entity that represents the copied value result. Only necessary
1240 for compounds passed by value. */
1241 entity *get_method_value_res_ent(type *method, int pos) {
1242 assert(method && (method->type_op == type_method));
1243 assert(pos >= 0 && pos < get_method_n_ress(method));
1245 if (!method->attr.ma.value_ress) {
1246 /* result value type not created yet, build */
1247 method->attr.ma.value_ress
1248 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1249 get_method_n_ress(method), method->attr.ma.res_type);
1252 * build_value_type() sets the method->attr.ma.value_ress type as default if
1255 assert((get_entity_type(method->attr.ma.res_type[pos].ent) != method->attr.ma.value_ress)
1256 && "result type not yet set");
1258 return method->attr.ma.res_type[pos].ent;
1262 * Returns a type that represents the copied value results.
1264 type *get_method_value_res_type(const type *method) {
1265 assert(method && (method->type_op == type_method));
1266 return method->attr.ma.value_ress;
1269 /* Returns the null-terminated name of this variadicity. */
1270 const char *get_variadicity_name(variadicity vari)
1272 #define X(a) case a: return #a
1274 X(variadicity_non_variadic);
1275 X(variadicity_variadic);
1282 variadicity get_method_variadicity(const type *method)
1284 assert(method && (method->type_op == type_method));
1285 return method->attr.ma.variadicity;
1288 void set_method_variadicity(type *method, variadicity vari)
1290 assert(method && (method->type_op == type_method));
1291 method->attr.ma.variadicity = vari;
1295 * Returns the first variadic parameter index of a type.
1296 * If this index was NOT set, the index of the last parameter
1297 * of the method type plus one is returned for variadic functions.
1298 * Non-variadic function types always return -1 here.
1300 int get_method_first_variadic_param_index(const type *method)
1302 assert(method && (method->type_op == type_method));
1304 if (method->attr.ma.variadicity == variadicity_non_variadic)
1307 if (method->attr.ma.first_variadic_param == -1)
1308 return get_method_n_params(method);
1309 return method->attr.ma.first_variadic_param;
1313 * Sets the first variadic parameter index. This allows to specify
1314 * a complete call type (containing the type of all parameters)
1315 * but still have the knowledge, which parameter must be passed as
1318 void set_method_first_variadic_param_index(type *method, int index)
1320 assert(method && (method->type_op == type_method));
1321 assert(index >= 0 && index <= get_method_n_params(method));
1323 method->attr.ma.first_variadic_param = index;
1326 unsigned (get_method_additional_properties)(const type *method) {
1327 return _get_method_additional_properties(method);
1330 void (set_method_additional_properties)(type *method, unsigned mask) {
1331 _set_method_additional_properties(method, mask);
1334 void (set_method_additional_property)(type *method, mtp_additional_property flag) {
1335 _set_method_additional_property(method, flag);
1338 /* Returns the calling convention of an entities graph. */
1339 unsigned (get_method_calling_convention)(const type *method) {
1340 return _get_method_calling_convention(method);
1343 /* Sets the calling convention of an entities graph. */
1344 void (set_method_calling_convention)(type *method, unsigned cc_mask) {
1345 _set_method_calling_convention(method, cc_mask);
1348 /* Returns the number of register parameters in a fastcall. 0 means default. */
1349 unsigned get_method_fastcall_n_regs(type *method) {
1350 assert(IS_FASTCALL(get_method_calling_convention(method)) && "not fastcall");
1351 return method->attr.ma.irg_calling_conv >> 8;
1354 /* Sets the number of register parameters in a fastcall. 0 means default. */
1355 void set_method_fastcall_n_regs(type *method, unsigned n_regs) {
1356 assert(IS_FASTCALL(get_method_calling_convention(method)) && "not fastcall");
1357 method->attr.ma.irg_calling_conv = n_regs << 8 | (method->attr.ma.irg_calling_conv & 0xFF);
1361 int (is_Method_type)(const type *method) {
1362 return _is_method_type(method);
1365 /*-----------------------------------------------------------------*/
1367 /*-----------------------------------------------------------------*/
1369 /* create a new type uni */
1370 type *new_d_type_union(ident *name, dbg_info *db) {
1371 type *res = new_type(type_union, NULL, name, db);
1373 res->attr.ua.members = NEW_ARR_F(entity *, 0);
1378 type *new_type_union(ident *name) {
1379 return new_d_type_union(name, NULL);
1382 void free_union_entities(type *uni) {
1384 assert(uni && (uni->type_op == type_union));
1385 for (i = get_union_n_members(uni) - 1; i >= 0; --i)
1386 free_entity(get_union_member(uni, i));
1389 void free_union_attrs (type *uni) {
1390 assert(uni && (uni->type_op == type_union));
1391 DEL_ARR_F(uni->attr.ua.members);
1394 /* manipulate private fields of union */
1395 int get_union_n_members (const type *uni) {
1396 assert(uni && (uni->type_op == type_union));
1397 return (ARR_LEN (uni->attr.ua.members));
1399 void add_union_member (type *uni, entity *member) {
1400 assert(uni && (uni->type_op == type_union));
1401 assert(uni != get_entity_type(member) && "recursive type");
1402 ARR_APP1 (entity *, uni->attr.ua.members, member);
1404 entity *get_union_member (const type *uni, int pos) {
1405 assert(uni && (uni->type_op == type_union));
1406 assert(pos >= 0 && pos < get_union_n_members(uni));
1407 return uni->attr.ua.members[pos];
1409 void set_union_member (type *uni, int pos, entity *member) {
1410 assert(uni && (uni->type_op == type_union));
1411 assert(pos >= 0 && pos < get_union_n_members(uni));
1412 uni->attr.ua.members[pos] = member;
1414 void remove_union_member(type *uni, entity *member) {
1416 assert(uni && (uni->type_op == type_union));
1417 for (i = 0; i < (ARR_LEN (uni->attr.ua.members)); i++)
1418 if (uni->attr.ua.members[i] == member) {
1419 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1420 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1421 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1427 int (is_Union_type)(const type *uni) {
1428 return _is_union_type(uni);
1431 void set_union_size_bits(type *tp, int size) {
1432 /* argh: we must allow to set negative values as "invalid size" */
1433 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1434 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1437 /*-----------------------------------------------------------------*/
1439 /*-----------------------------------------------------------------*/
1442 /* create a new type array -- set dimension sizes independently */
1443 type *new_d_type_array(ident *name, int n_dimensions, type *element_type, dbg_info *db) {
1447 ir_graph *rem = current_ir_graph;
1449 assert(!is_Method_type(element_type));
1451 res = new_type(type_array, NULL, name, db);
1452 res->attr.aa.n_dimensions = n_dimensions;
1453 res->attr.aa.lower_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
1454 res->attr.aa.upper_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
1455 res->attr.aa.order = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));
1457 current_ir_graph = get_const_code_irg();
1458 unk = new_Unknown( mode_Iu);
1459 for (i = 0; i < n_dimensions; i++) {
1460 res->attr.aa.lower_bound[i] =
1461 res->attr.aa.upper_bound[i] = unk;
1462 res->attr.aa.order[i] = i;
1464 current_ir_graph = rem;
1466 res->attr.aa.element_type = element_type;
1467 new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1472 type *new_type_array(ident *name, int n_dimensions, type *element_type) {
1473 return new_d_type_array(name, n_dimensions, element_type, NULL);
1476 void free_array_automatic_entities(type *array) {
1477 assert(array && (array->type_op == type_array));
1478 free_entity(get_array_element_entity(array));
1481 void free_array_entities (type *array) {
1482 assert(array && (array->type_op == type_array));
1485 void free_array_attrs (type *array) {
1486 assert(array && (array->type_op == type_array));
1487 free(array->attr.aa.lower_bound);
1488 free(array->attr.aa.upper_bound);
1491 /* manipulate private fields of array type */
1492 int get_array_n_dimensions (const type *array) {
1493 assert(array && (array->type_op == type_array));
1494 return array->attr.aa.n_dimensions;
1498 set_array_bounds (type *array, int dimension, ir_node * lower_bound,
1499 ir_node * upper_bound) {
1500 assert(array && (array->type_op == type_array));
1501 assert(lower_bound && "lower_bound node may not be NULL.");
1502 assert(upper_bound && "upper_bound node may not be NULL.");
1503 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1504 array->attr.aa.lower_bound[dimension] = lower_bound;
1505 array->attr.aa.upper_bound[dimension] = upper_bound;
1508 set_array_bounds_int (type *array, int dimension, int lower_bound,
1510 ir_graph *rem = current_ir_graph;
1511 current_ir_graph = get_const_code_irg();
1512 set_array_bounds (array, dimension,
1513 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1514 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1515 current_ir_graph = rem;
1518 set_array_lower_bound (type *array, int dimension, ir_node * lower_bound) {
1519 assert(array && (array->type_op == type_array));
1520 assert(lower_bound && "lower_bound node may not be NULL.");
1521 array->attr.aa.lower_bound[dimension] = lower_bound;
1523 void set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
1524 ir_graph *rem = current_ir_graph;
1525 current_ir_graph = get_const_code_irg();
1526 set_array_lower_bound (array, dimension,
1527 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1528 current_ir_graph = rem;
1531 set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
1532 assert(array && (array->type_op == type_array));
1533 assert(upper_bound && "upper_bound node may not be NULL.");
1534 array->attr.aa.upper_bound[dimension] = upper_bound;
1536 void set_array_upper_bound_int (type *array, int dimension, int upper_bound) {
1537 ir_graph *rem = current_ir_graph;
1538 current_ir_graph = get_const_code_irg();
1539 set_array_upper_bound (array, dimension,
1540 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1541 current_ir_graph = rem;
1543 int has_array_lower_bound (const type *array, int dimension) {
1544 assert(array && (array->type_op == type_array));
1545 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1547 ir_node *get_array_lower_bound (const type *array, int dimension) {
1548 assert(array && (array->type_op == type_array));
1549 return array->attr.aa.lower_bound[dimension];
1551 long get_array_lower_bound_int (const type *array, int dimension) {
1553 assert(array && (array->type_op == type_array));
1554 node = array->attr.aa.lower_bound[dimension];
1555 assert(get_irn_op(node) == op_Const);
1556 return get_tarval_long(get_Const_tarval(node));
1558 int has_array_upper_bound (const type *array, int dimension) {
1559 assert(array && (array->type_op == type_array));
1560 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1562 ir_node * get_array_upper_bound (const type *array, int dimension) {
1563 assert(array && (array->type_op == type_array));
1564 return array->attr.aa.upper_bound[dimension];
1566 long get_array_upper_bound_int (const type *array, int dimension) {
1568 assert(array && (array->type_op == type_array));
1569 node = array->attr.aa.upper_bound[dimension];
1570 assert(get_irn_op(node) == op_Const);
1571 return get_tarval_long(get_Const_tarval(node));
1574 void set_array_order (type *array, int dimension, int order) {
1575 assert(array && (array->type_op == type_array));
1576 array->attr.aa.order[dimension] = order;
1579 int get_array_order (const type *array, int dimension) {
1580 assert(array && (array->type_op == type_array));
1581 return array->attr.aa.order[dimension];
1584 int find_array_dimension(const type *array, int order) {
1587 assert(array && (array->type_op == type_array));
1589 for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
1590 if (array->attr.aa.order[dim] == order)
1596 void set_array_element_type (type *array, type *tp) {
1597 assert(array && (array->type_op == type_array));
1598 assert(!is_Method_type(tp));
1599 array->attr.aa.element_type = tp;
1601 type *get_array_element_type (type *array) {
1602 assert(array && (array->type_op == type_array));
1603 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1606 void set_array_element_entity (type *array, entity *ent) {
1607 assert(array && (array->type_op == type_array));
1608 assert((get_entity_type(ent)->type_op != type_method));
1609 array->attr.aa.element_ent = ent;
1610 array->attr.aa.element_type = get_entity_type(ent);
1612 entity *get_array_element_entity (const type *array) {
1613 assert(array && (array->type_op == type_array));
1614 return array->attr.aa.element_ent;
1618 int (is_Array_type)(const type *array) {
1619 return _is_array_type(array);
1622 void set_array_size_bits(type *tp, int size) {
1623 /* FIXME: Here we should make some checks with the element type size */
1626 /*-----------------------------------------------------------------*/
1627 /* TYPE_ENUMERATION */
1628 /*-----------------------------------------------------------------*/
1630 /* create a new type enumeration -- set the enumerators independently */
1631 type *new_d_type_enumeration(ident *name, int n_enums, dbg_info *db) {
1632 type *res = new_type(type_enumeration, NULL, name, db);
1634 res->attr.ea.n_enums = n_enums;
1635 res->attr.ea.enumer = xcalloc(n_enums, sizeof(res->attr.ea.enumer[0]));
1636 res->attr.ea.enum_nameid = xcalloc(n_enums, sizeof(res->attr.ea.enum_nameid[0]));
1641 type *new_type_enumeration(ident *name, int n_enums) {
1642 return new_d_type_enumeration(name, n_enums, NULL);
1645 void free_enumeration_entities(type *enumeration) {
1646 assert(enumeration && (enumeration->type_op == type_enumeration));
1648 void free_enumeration_attrs(type *enumeration) {
1649 assert(enumeration && (enumeration->type_op == type_enumeration));
1650 free(enumeration->attr.ea.enumer);
1651 free(enumeration->attr.ea.enum_nameid);
1654 /* manipulate fields of enumeration type. */
1655 int get_enumeration_n_enums (const type *enumeration) {
1656 assert(enumeration && (enumeration->type_op == type_enumeration));
1657 return enumeration->attr.ea.n_enums;
1659 void set_enumeration_enum (type *enumeration, int pos, tarval *con) {
1660 assert(enumeration && (enumeration->type_op == type_enumeration));
1661 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1662 enumeration->attr.ea.enumer[pos] = con;
1664 tarval *get_enumeration_enum (const type *enumeration, int pos) {
1665 assert(enumeration && (enumeration->type_op == type_enumeration));
1666 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1667 return enumeration->attr.ea.enumer[pos];
1669 void set_enumeration_nameid (type *enumeration, int pos, ident *id) {
1670 assert(enumeration && (enumeration->type_op == type_enumeration));
1671 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1672 enumeration->attr.ea.enum_nameid[pos] = id;
1674 ident *get_enumeration_nameid (const type *enumeration, int pos) {
1675 assert(enumeration && (enumeration->type_op == type_enumeration));
1676 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1677 return enumeration->attr.ea.enum_nameid[pos];
1679 const char *get_enumeration_name(const type *enumeration, int pos) {
1680 assert(enumeration && (enumeration->type_op == type_enumeration));
1681 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1682 return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
1686 int (is_Enumeration_type)(const type *enumeration) {
1687 return _is_enumeration_type(enumeration);
1690 void set_enumeration_mode(type *tp, ir_mode *mode) {
1691 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1692 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1693 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1695 tp->size = get_mode_size_bits(mode);
1699 /*-----------------------------------------------------------------*/
1701 /*-----------------------------------------------------------------*/
1703 /* Create a new type pointer */
1704 type *new_d_type_pointer(ident *name, type *points_to, ir_mode *ptr_mode, dbg_info *db) {
1707 assert(mode_is_reference(ptr_mode));
1708 res = new_type(type_pointer, ptr_mode, name, db);
1709 res->attr.pa.points_to = points_to;
1710 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1711 res->size = get_mode_size_bits(res->mode);
1712 res->state = layout_fixed;
1717 type *new_type_pointer(ident *name, type *points_to, ir_mode *ptr_mode) {
1718 return new_d_type_pointer(name, points_to, ptr_mode, NULL);
1721 void free_pointer_entities (type *pointer) {
1722 assert(pointer && (pointer->type_op == type_pointer));
1725 void free_pointer_attrs (type *pointer) {
1726 assert(pointer && (pointer->type_op == type_pointer));
1729 /* manipulate fields of type_pointer */
1730 void set_pointer_points_to_type (type *pointer, type *tp) {
1731 assert(pointer && (pointer->type_op == type_pointer));
1732 pointer->attr.pa.points_to = tp;
1735 type *get_pointer_points_to_type (type *pointer) {
1736 assert(pointer && (pointer->type_op == type_pointer));
1737 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1741 int (is_Pointer_type)(const type *pointer) {
1742 return _is_pointer_type(pointer);
1745 void set_pointer_mode(type *tp, ir_mode *mode) {
1746 assert(mode_is_reference(mode) && "Modes of pointers must be references");
1747 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1748 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1750 tp->size = get_mode_size_bits(mode);
1754 /* Returns the first pointer type that has as points_to tp.
1755 * Not efficient: O(#types).
1756 * If not found returns firm_unknown_type. */
1757 type *find_pointer_type_to_type (type *tp) {
1759 for (i = 0; i < get_irp_n_types(); ++i) {
1760 type *found = get_irp_type(i);
1761 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1764 return firm_unknown_type;
1768 /*-----------------------------------------------------------------*/
1769 /* TYPE_PRIMITIVE */
1770 /*-----------------------------------------------------------------*/
1772 /* create a new type primitive */
1773 type *new_d_type_primitive(ident *name, ir_mode *mode, dbg_info *db) {
1775 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1776 res = new_type(type_primitive, mode, name, db);
1777 res->size = get_mode_size_bits(mode);
1778 res->state = layout_fixed;
1783 type *new_type_primitive(ident *name, ir_mode *mode) {
1784 return new_d_type_primitive(name, mode, NULL);
1788 int (is_Primitive_type)(const type *primitive) {
1789 return _is_primitive_type(primitive);
1792 void set_primitive_mode(type *tp, ir_mode *mode) {
1793 /* Modes of primitives must be data */
1794 assert(mode_is_data(mode));
1796 /* For primitive size depends on the mode. */
1797 tp->size = get_mode_size_bits(mode);
1802 /*-----------------------------------------------------------------*/
1803 /* common functionality */
1804 /*-----------------------------------------------------------------*/
1807 int (is_atomic_type)(const type *tp) {
1808 return _is_atomic_type(tp);
1812 * Gets the number of elements in a firm compound type.
1814 int get_compound_n_members(const type *tp)
1816 const tp_op *op = get_type_tpop(tp);
1819 if (op->ops.get_n_members)
1820 res = op->ops.get_n_members(tp);
1822 assert(0 && "no member count for this type");
1828 * Gets the member of a firm compound type at position pos.
1830 entity *get_compound_member(const type *tp, int pos)
1832 const tp_op *op = get_type_tpop(tp);
1835 if (op->ops.get_member)
1836 res = op->ops.get_member(tp, pos);
1838 assert(0 && "no members in this type");
1843 int is_compound_type(const type *tp) {
1844 assert(tp && tp->kind == k_type);
1845 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
1848 /* Checks, whether a type is a frame type */
1849 int is_frame_type(const type *tp) {
1850 return tp->frame_type;
1853 /* Makes a new frame type. */
1854 type *new_type_frame(ident *name)
1856 type *res = new_type_class(name);
1858 res->frame_type = 1;
1860 /* Remove type from type list. Must be treated differently than other types. */
1861 remove_irp_type(res);
1866 /* set the type size for the unknown and none type */
1867 void set_default_size_bits(type *tp, int size) {