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-2006 by Universitaet Karlsruhe
21 * Goetz Lindenmaier, Michael Beck
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"
74 /*-----------------------------------------------------------------*/
76 /*-----------------------------------------------------------------*/
78 ir_type *firm_none_type; ir_type *get_none_type(void) { return firm_none_type; }
79 ir_type *firm_unknown_type; ir_type *get_unknown_type(void) { return firm_unknown_type; }
82 /* Suffixes added to types used for pass-by-value representations. */
83 static ident *value_params_suffix = NULL;
84 static ident *value_ress_suffix = NULL;
86 /** The default calling convention for method types. */
87 static unsigned default_cc_mask;
89 /* return the default calling convention for method types */
90 unsigned get_default_cc_mask(void) {
91 return default_cc_mask;
94 /* Initialize the type module. */
95 void firm_init_type(dbg_info *builtin_db, unsigned def_cc_mask)
97 default_cc_mask = def_cc_mask;
98 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
99 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
101 /* construct none and unknown type. */
102 firm_none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"), builtin_db);
103 set_type_size_bits(firm_none_type, 0);
104 set_type_state (firm_none_type, layout_fixed);
105 remove_irp_type(firm_none_type);
107 firm_unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"), builtin_db);
108 set_type_size_bits(firm_unknown_type, 0);
109 set_type_state (firm_unknown_type, layout_fixed);
110 remove_irp_type(firm_unknown_type);
113 /** the global type visited flag */
114 unsigned long firm_type_visited;
116 void (set_master_type_visited)(unsigned long val) { _set_master_type_visited(val); }
117 unsigned long (get_master_type_visited)(void) { return _get_master_type_visited(); }
118 void (inc_master_type_visited)(void) { _inc_master_type_visited(); }
121 * Creates a new type representation.
124 new_type(tp_op *type_op, ir_mode *mode, ident *name, dbg_info *db) {
128 assert(type_op != type_id);
129 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
131 node_size = offsetof(ir_type, attr) + type_op->attr_size;
132 res = xmalloc(node_size);
133 memset(res, 0, node_size);
136 res->type_op = type_op;
139 res->visibility = visibility_external_allocated;
140 res->flags = tf_none;
146 res->assoc_type = NULL;
148 res->nr = get_irp_new_node_nr();
149 #endif /* defined DEBUG_libfirm */
151 add_irp_type(res); /* Remember the new type global. */
156 void free_type(ir_type *tp) {
157 const tp_op *op = get_type_tpop(tp);
159 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
161 /* Remove from list of all types */
163 /* Free the attributes of the type. */
165 /* Free entities automatically allocated with the ir_type */
166 if (op->ops.free_auto_entities)
167 op->ops.free_auto_entities(tp);
168 /* And now the type itself... */
173 void free_type_entities(ir_type *tp) {
174 const tp_op *tpop = get_type_tpop(tp);
176 if (tpop->ops.free_entities)
177 tpop->ops.free_entities(tp);
180 void free_type_attrs(ir_type *tp) {
181 const tp_op *tpop = get_type_tpop(tp);
183 if (tpop->ops.free_attrs)
184 tpop->ops.free_attrs(tp);
187 /* set/get the link field */
188 void *(get_type_link)(const ir_type *tp) {
189 return _get_type_link(tp);
192 void (set_type_link)(ir_type *tp, void *l) {
193 _set_type_link(tp, l);
196 const tp_op *(get_type_tpop)(const ir_type *tp) {
197 return _get_type_tpop(tp);
200 ident *(get_type_tpop_nameid)(const ir_type *tp) {
201 return _get_type_tpop_nameid(tp);
204 const char* get_type_tpop_name(const ir_type *tp) {
205 assert(tp && tp->kind == k_type);
206 return get_id_str(tp->type_op->name);
209 tp_opcode (get_type_tpop_code)(const ir_type *tp) {
210 return _get_type_tpop_code(tp);
213 ir_mode *(get_type_mode)(const ir_type *tp) {
214 return _get_type_mode(tp);
217 void set_type_mode(ir_type *tp, ir_mode *mode) {
218 const tp_op *tpop = get_type_tpop(tp);
220 if (tpop->ops.set_type_mode)
221 tpop->ops.set_type_mode(tp, mode);
223 assert(0 && "setting a mode is NOT allowed for this type");
226 ident *(get_type_ident)(const ir_type *tp) {
227 return _get_type_ident(tp);
230 void (set_type_ident)(ir_type *tp, ident* id) {
231 _set_type_ident(tp, id);
234 /* Outputs a unique number for this node */
235 long get_type_nr(const ir_type *tp) {
240 return (long)PTR_TO_INT(tp);
244 const char* get_type_name(const ir_type *tp) {
245 assert(tp && tp->kind == k_type);
246 return (get_id_str(tp->name));
249 int (get_type_size_bytes)(const ir_type *tp) {
250 return _get_type_size_bytes(tp);
253 int (get_type_size_bits)(const ir_type *tp) {
254 return _get_type_size_bits(tp);
258 visibility get_type_visibility (const ir_type *tp) {
260 visibility res = visibility_local;
261 if (is_compound_type(tp)) {
263 if (is_Array_type(tp)) {
264 entity *mem = get_array_element_entity(tp);
265 if (get_entity_visibility(mem) != visibility_local)
266 res = visibility_external_visible;
268 int i, n_mems = get_compound_n_members(tp);
269 for (i = 0; i < n_mems; ++i) {
270 entity *mem = get_compound_member(tp, i);
271 if (get_entity_visibility(mem) != visibility_local)
272 res = visibility_external_visible;
279 return tp->visibility;
282 void set_type_visibility (ir_type *tp, visibility v) {
285 /* check for correctness */
286 if (v != visibility_external_allocated) {
287 visibility res = visibility_local;
288 if (is_compound_type(tp)) {
289 if (is_Array_type(tp)) {
290 entity *mem = get_array_element_entity(tp);
291 if (get_entity_visibility(mem) > res)
292 res = get_entity_visibility(mem);
294 int i, n_mems = get_compound_n_members(tp);
295 for (i = 0; i < n_mems; ++i) {
296 entity *mem = get_compound_member(tp, i);
297 if (get_entity_visibility(mem) > res)
298 res = get_entity_visibility(mem);
309 set_type_size_bits(ir_type *tp, int size) {
310 const tp_op *tpop = get_type_tpop(tp);
312 if (tpop->ops.set_type_size)
313 tpop->ops.set_type_size(tp, size);
315 assert(0 && "Cannot set size for this type");
319 set_type_size_bytes(ir_type *tp, int size) {
320 set_type_size_bits(tp, 8*size);
323 int get_type_alignment_bytes(ir_type *tp) {
324 int align = get_type_alignment_bits(tp);
326 return align < 0 ? align : (align + 7) >> 3;
329 int get_type_alignment_bits(ir_type *tp) {
335 /* alignment NOT set calculate it "on demand" */
337 align = get_mode_size_bits(tp->mode);
338 else if (is_Array_type(tp))
339 align = get_type_alignment_bits(get_array_element_type(tp));
340 else if (is_compound_type(tp)) {
341 int i, n = get_compound_n_members(tp);
344 for (i = 0; i < n; ++i) {
345 ir_type *t = get_entity_type(get_compound_member(tp, i));
346 int a = get_type_alignment_bits(t);
352 else if (is_Method_type(tp))
362 set_type_alignment_bits(ir_type *tp, int align) {
363 assert(tp && tp->kind == k_type);
364 assert((align == -1 || (align & (align - 1)) == 0) && "type alignment not power of two");
365 /* Methods don't have an alignment. */
366 if (tp->type_op != type_method) {
372 set_type_alignment_bytes(ir_type *tp, int align) {
374 set_type_alignment_bits(tp, -1);
376 set_type_alignment_bits(tp, 8*align);
380 /* Returns a human readable string for the enum entry. */
381 const char *get_type_state_name(type_state s) {
382 #define X(a) case a: return #a;
392 type_state (get_type_state)(const ir_type *tp) {
393 return _get_type_state(tp);
397 set_type_state(ir_type *tp, type_state state) {
398 assert(tp && tp->kind == k_type);
400 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
401 (tp->type_op == type_method))
404 /* Just a correctness check: */
405 if (state == layout_fixed) {
407 switch (get_type_tpop_code(tp)) {
410 assert(get_type_size_bits(tp) > -1);
411 if (tp != get_glob_type()) {
412 int n_mem = get_class_n_members(tp);
413 for (i = 0; i < n_mem; i++) {
414 if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
415 { DDMT(tp); DDME(get_class_member(tp, i)); }
416 assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
418 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
419 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
426 assert(get_type_size_bits(tp) > -1);
427 for (i = 0; i < get_struct_n_members(tp); i++) {
428 assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
429 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
438 Assure that only innermost dimension is dynamic? */
440 case tpo_enumeration:
442 assert(get_type_mode != NULL);
443 for (i = 0; i < get_enumeration_n_enums(tp); i++)
444 assert(get_enumeration_enum(tp, i) != NULL);
449 if (state == layout_fixed)
450 tp->flags |= tf_layout_fixed;
452 tp->flags &= tf_layout_fixed;
455 unsigned long (get_type_visited)(const ir_type *tp) {
456 return _get_type_visited(tp);
459 void (set_type_visited)(ir_type *tp, unsigned long num) {
460 _set_type_visited(tp, num);
463 /* Sets visited field in type to type_visited. */
464 void (mark_type_visited)(ir_type *tp) {
465 _mark_type_visited(tp);
468 int (type_visited)(const ir_type *tp) {
469 return _type_visited(tp);
472 int (type_not_visited)(const ir_type *tp) {
473 return _type_not_visited(tp);
476 int (is_type)(const void *thing) {
477 return _is_type(thing);
480 /* Checks whether two types are structural equal.*/
481 int equal_type(ir_type *typ1, ir_type *typ2) {
486 if (typ1 == typ2) return 1;
488 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
489 (get_type_ident(typ1) != get_type_ident(typ2)) ||
490 (get_type_mode(typ1) != get_type_mode(typ2)) ||
491 (get_type_state(typ1) != get_type_state(typ2)))
493 if ((get_type_state(typ1) == layout_fixed) &&
494 (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
497 switch (get_type_tpop_code(typ1)) {
499 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
500 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
501 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
502 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
503 /** Compare the members **/
504 m = alloca(sizeof(entity *) * get_class_n_members(typ1));
505 memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
506 /* First sort the members of typ2 */
507 for (i = 0; i < get_class_n_members(typ1); i++) {
508 entity *e1 = get_class_member(typ1, i);
509 for (j = 0; j < get_class_n_members(typ2); j++) {
510 entity *e2 = get_class_member(typ2, j);
511 if (get_entity_name(e1) == get_entity_name(e2))
515 for (i = 0; i < get_class_n_members(typ1); i++) {
516 if (!m[i] || /* Found no counterpart */
517 !equal_entity(get_class_member(typ1, i), m[i]))
520 /** Compare the supertypes **/
521 t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
522 memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
523 /* First sort the supertypes of typ2 */
524 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
525 ir_type *t1 = get_class_supertype(typ1, i);
526 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
527 ir_type *t2 = get_class_supertype(typ2, j);
528 if (get_type_ident(t2) == get_type_ident(t1))
532 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
533 if (!t[i] || /* Found no counterpart */
534 get_class_supertype(typ1, i) != t[i])
539 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
540 m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
541 memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
542 /* First sort the members of lt */
543 for (i = 0; i < get_struct_n_members(typ1); i++) {
544 entity *e1 = get_struct_member(typ1, i);
545 for (j = 0; j < get_struct_n_members(typ2); j++) {
546 entity *e2 = get_struct_member(typ2, j);
547 if (get_entity_name(e1) == get_entity_name(e2))
551 for (i = 0; i < get_struct_n_members(typ1); i++) {
552 if (!m[i] || /* Found no counterpart */
553 !equal_entity(get_struct_member(typ1, i), m[i]))
558 int n_param1, n_param2;
560 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
561 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
562 if (get_method_calling_convention(typ1) !=
563 get_method_calling_convention(typ2)) return 0;
565 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
566 n_param1 = get_method_n_params(typ1);
567 n_param2 = get_method_n_params(typ2);
570 n_param1 = get_method_first_variadic_param_index(typ1);
571 n_param2 = get_method_first_variadic_param_index(typ2);
574 if (n_param1 != n_param2) return 0;
576 for (i = 0; i < n_param1; i++) {
577 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
580 for (i = 0; i < get_method_n_ress(typ1); i++) {
581 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
586 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
587 m = alloca(sizeof(entity *) * get_union_n_members(typ1));
588 memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
589 /* First sort the members of lt */
590 for (i = 0; i < get_union_n_members(typ1); i++) {
591 entity *e1 = get_union_member(typ1, i);
592 for (j = 0; j < get_union_n_members(typ2); j++) {
593 entity *e2 = get_union_member(typ2, j);
594 if (get_entity_name(e1) == get_entity_name(e2))
598 for (i = 0; i < get_union_n_members(typ1); i++) {
599 if (!m[i] || /* Found no counterpart */
600 !equal_entity(get_union_member(typ1, i), m[i]))
605 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
607 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
609 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
610 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
611 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
613 if (get_array_order(typ1, i) != get_array_order(typ2, i))
614 assert(0 && "type compare with different dimension orders not implemented");
617 case tpo_enumeration: {
618 assert(0 && "enumerations not implemented");
621 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
624 case tpo_primitive: {
631 /* Checks whether two types are structural comparable. */
632 int smaller_type (ir_type *st, ir_type *lt) {
636 if (st == lt) return 1;
638 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
641 switch(get_type_tpop_code(st)) {
643 return is_SubClass_of(st, lt);
646 if (get_struct_n_members(st) != get_struct_n_members(lt)) return 0;
647 m = alloca(sizeof(entity *) * get_struct_n_members(st));
648 memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
649 /* First sort the members of lt */
650 for (i = 0; i < get_struct_n_members(st); i++) {
651 entity *se = get_struct_member(st, i);
652 for (j = 0; j < get_struct_n_members(lt); j++) {
653 entity *le = get_struct_member(lt, j);
654 if (get_entity_name(le) == get_entity_name(se))
658 for (i = 0; i < get_struct_n_members(st); i++) {
659 if (!m[i] || /* Found no counterpart */
660 !smaller_type(get_entity_type(get_struct_member(st, i)),
661 get_entity_type(m[i])))
666 int n_param1, n_param2;
668 /** FIXME: is this still 1? */
669 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
670 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
671 if (get_method_calling_convention(st) !=
672 get_method_calling_convention(lt)) return 0;
674 if (get_method_variadicity(st) == variadicity_non_variadic) {
675 n_param1 = get_method_n_params(st);
676 n_param2 = get_method_n_params(lt);
679 n_param1 = get_method_first_variadic_param_index(st);
680 n_param2 = get_method_first_variadic_param_index(lt);
683 if (n_param1 != n_param2) return 0;
685 for (i = 0; i < get_method_n_params(st); i++) {
686 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
689 for (i = 0; i < get_method_n_ress(st); i++) {
690 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
695 if (get_union_n_members(st) != get_union_n_members(lt)) return 0;
696 m = alloca(sizeof(entity *) * get_union_n_members(st));
697 memset(m, 0, sizeof(entity *) * get_union_n_members(st));
698 /* First sort the members of lt */
699 for (i = 0; i < get_union_n_members(st); i++) {
700 entity *se = get_union_member(st, i);
701 for (j = 0; j < get_union_n_members(lt); j++) {
702 entity *le = get_union_member(lt, j);
703 if (get_entity_name(le) == get_entity_name(se))
707 for (i = 0; i < get_union_n_members(st); i++) {
708 if (!m[i] || /* Found no counterpart */
709 !smaller_type(get_entity_type(get_union_member(st, i)),
710 get_entity_type(m[i])))
715 ir_type *set, *let; /* small/large elt. ir_type */
716 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
718 set = get_array_element_type(st);
719 let = get_array_element_type(lt);
721 /* If the element types are different, set must be convertible
722 to let, and they must have the same size so that address
723 computations work out. To have a size the layout must
725 if ((get_type_state(set) != layout_fixed) ||
726 (get_type_state(let) != layout_fixed))
728 if (!smaller_type(set, let) ||
729 get_type_size_bits(set) != get_type_size_bits(let))
732 for(i = 0; i < get_array_n_dimensions(st); i++) {
733 if (get_array_lower_bound(lt, i))
734 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
736 if (get_array_upper_bound(lt, i))
737 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
741 case tpo_enumeration: {
742 assert(0 && "enumerations not implemented");
745 if (!smaller_type(get_pointer_points_to_type(st),
746 get_pointer_points_to_type(lt)))
749 case tpo_primitive: {
750 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
758 /*-----------------------------------------------------------------*/
760 /*-----------------------------------------------------------------*/
762 /* create a new class ir_type */
763 ir_type *new_d_type_class (ident *name, dbg_info *db) {
766 res = new_type(type_class, NULL, name, db);
768 res->attr.ca.members = NEW_ARR_F (entity *, 0);
769 res->attr.ca.subtypes = NEW_ARR_F (ir_type *, 0);
770 res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
771 res->attr.ca.peculiarity = peculiarity_existent;
772 res->attr.ca.type_info = NULL;
773 res->attr.ca.vtable_size = 0;
774 res->attr.ca.clss_flags = cf_none;
775 res->attr.ca.dfn = 0;
780 ir_type *new_type_class (ident *name) {
781 return new_d_type_class (name, NULL);
784 /* free all entities of a class */
785 void free_class_entities(ir_type *clss) {
787 assert(clss && (clss->type_op == type_class));
788 for (i = get_class_n_members(clss) - 1; i >= 0; --i)
789 free_entity(get_class_member(clss, i));
790 /* do NOT free the type info here. It belongs to another class */
793 void free_class_attrs(ir_type *clss) {
794 assert(clss && (clss->type_op == type_class));
795 DEL_ARR_F(clss->attr.ca.members);
796 DEL_ARR_F(clss->attr.ca.subtypes);
797 DEL_ARR_F(clss->attr.ca.supertypes);
800 /* manipulate private fields of class type */
801 void add_class_member (ir_type *clss, entity *member) {
802 assert(clss && (clss->type_op == type_class));
803 assert(clss != get_entity_type(member) && "recursive type");
804 ARR_APP1 (entity *, clss->attr.ca.members, member);
807 int (get_class_n_members) (const ir_type *clss) {
808 return _get_class_n_members(clss);
811 int get_class_member_index(const ir_type *clss, entity *mem) {
813 assert(clss && (clss->type_op == type_class));
814 for (i = 0, n = get_class_n_members(clss); i < n; ++i)
815 if (get_class_member(clss, i) == mem)
820 entity *(get_class_member) (const ir_type *clss, int pos) {
821 return _get_class_member(clss, pos);
824 entity *get_class_member_by_name(ir_type *clss, ident *name) {
826 assert(clss && (clss->type_op == type_class));
827 n_mem = get_class_n_members(clss);
828 for (i = 0; i < n_mem; ++i) {
829 entity *mem = get_class_member(clss, i);
830 if (get_entity_ident(mem) == name) return mem;
835 void set_class_member (ir_type *clss, entity *member, int pos) {
836 assert(clss && (clss->type_op == type_class));
837 assert(pos >= 0 && pos < get_class_n_members(clss));
838 clss->attr.ca.members[pos] = member;
840 void set_class_members (ir_type *clss, entity **members, int arity) {
842 assert(clss && (clss->type_op == type_class));
843 DEL_ARR_F(clss->attr.ca.members);
844 clss->attr.ca.members = NEW_ARR_F (entity *, 0);
845 for (i = 0; i < arity; i++) {
846 set_entity_owner(members[i], clss);
847 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
850 void remove_class_member(ir_type *clss, entity *member) {
852 assert(clss && (clss->type_op == type_class));
853 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
854 if (clss->attr.ca.members[i] == member) {
855 for (; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
856 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
857 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
863 void add_class_subtype (ir_type *clss, ir_type *subtype) {
865 assert(clss && (clss->type_op == type_class));
866 ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
867 for (i = 0; i < get_class_n_supertypes(subtype); i++)
868 if (get_class_supertype(subtype, i) == clss)
869 /* Class already registered */
871 ARR_APP1 (ir_type *, subtype->attr.ca.supertypes, clss);
873 int get_class_n_subtypes (const ir_type *clss) {
874 assert(clss && (clss->type_op == type_class));
875 return (ARR_LEN (clss->attr.ca.subtypes));
877 ir_type *get_class_subtype (ir_type *clss, int pos) {
878 assert(clss && (clss->type_op == type_class));
879 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
880 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
882 int get_class_subtype_index(ir_type *clss, const ir_type *subclass) {
883 int i, n_subtypes = get_class_n_subtypes(clss);
884 assert(is_Class_type(subclass));
885 for (i = 0; i < n_subtypes; ++i) {
886 if (get_class_subtype(clss, i) == subclass) return i;
890 void set_class_subtype (ir_type *clss, ir_type *subtype, int pos) {
891 assert(clss && (clss->type_op == type_class));
892 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
893 clss->attr.ca.subtypes[pos] = subtype;
895 void remove_class_subtype(ir_type *clss, ir_type *subtype) {
897 assert(clss && (clss->type_op == type_class));
898 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
899 if (clss->attr.ca.subtypes[i] == subtype) {
900 for (; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
901 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
902 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
907 void add_class_supertype (ir_type *clss, ir_type *supertype) {
909 assert(clss && (clss->type_op == type_class));
910 assert(supertype && (supertype -> type_op == type_class));
911 ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
912 for (i = get_class_n_subtypes(supertype) - 1; i >= 0; --i)
913 if (get_class_subtype(supertype, i) == clss)
914 /* Class already registered */
916 ARR_APP1 (ir_type *, supertype->attr.ca.subtypes, clss);
918 int get_class_n_supertypes (const ir_type *clss) {
919 assert(clss && (clss->type_op == type_class));
920 return (ARR_LEN (clss->attr.ca.supertypes));
922 int get_class_supertype_index(ir_type *clss, ir_type *super_clss) {
923 int i, n_supertypes = get_class_n_supertypes(clss);
924 assert(super_clss && (super_clss->type_op == type_class));
925 for (i = 0; i < n_supertypes; i++)
926 if (get_class_supertype(clss, i) == super_clss)
930 ir_type *get_class_supertype (ir_type *clss, int pos) {
931 assert(clss && (clss->type_op == type_class));
932 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
933 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
935 void set_class_supertype (ir_type *clss, ir_type *supertype, int pos) {
936 assert(clss && (clss->type_op == type_class));
937 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
938 clss->attr.ca.supertypes[pos] = supertype;
940 void remove_class_supertype(ir_type *clss, ir_type *supertype) {
942 assert(clss && (clss->type_op == type_class));
943 for (i = 0; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
944 if (clss->attr.ca.supertypes[i] == supertype) {
945 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
946 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
947 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
951 entity *get_class_type_info(const ir_type *clss) {
952 return clss->attr.ca.type_info;
954 void set_class_type_info(ir_type *clss, entity *ent) {
955 clss->attr.ca.type_info = ent;
958 const char *get_peculiarity_string(peculiarity p) {
959 #define X(a) case a: return #a
961 X(peculiarity_description);
962 X(peculiarity_inherited);
963 X(peculiarity_existent);
966 return "invalid peculiarity";
969 peculiarity get_class_peculiarity (const ir_type *clss) {
970 assert(clss && (clss->type_op == type_class));
971 return clss->attr.ca.peculiarity;
974 void set_class_peculiarity (ir_type *clss, peculiarity pec) {
975 assert(clss && (clss->type_op == type_class));
976 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
977 clss->attr.ca.peculiarity = pec;
980 /* Returns the size of the virtual function table. */
981 unsigned (get_class_vtable_size)(const ir_type *clss) {
982 return _get_class_vtable_size(clss);
985 /* Sets a new size of the virtual function table. */
986 void (set_class_vtable_size)(ir_type *clss, unsigned size) {
987 _set_class_vtable_size(clss, size);
990 /* Returns non-zero if a class is final. */
991 int (is_class_final)(const ir_type *clss) {
992 return _is_class_final(clss);
995 /* Sets if a class is final. */
996 void (set_class_final)(ir_type *clss, int flag) {
997 _set_class_final(clss, flag);
1000 /* Returns non-zero if a class is an interface. */
1001 int (is_class_interface)(const ir_type *clss) {
1002 return _is_class_interface(clss);
1005 /* Sets the class interface flag. */
1006 void (set_class_interface)(ir_type *clss, int flag) {
1007 _set_class_interface(clss, flag);
1010 /* Returns non-zero if a class is abstract. */
1011 int (is_class_abstract)(const ir_type *clss) {
1012 return _is_class_abstract(clss);
1015 /* Sets the class abstract flag. */
1016 void (set_class_abstract)(ir_type *clss, int final) {
1017 _set_class_abstract(clss, final);
1020 void set_class_dfn (ir_type *clss, int dfn) {
1021 clss->attr.ca.dfn = dfn;
1024 int get_class_dfn (const ir_type *clss) {
1025 return (clss->attr.ca.dfn);
1029 int (is_Class_type)(const ir_type *clss) {
1030 return _is_class_type(clss);
1033 void set_class_mode(ir_type *tp, ir_mode *mode) {
1034 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1035 assert(get_type_state(tp) == layout_fixed &&
1036 tp->size == get_mode_size_bits(mode) && "mode don't match class layout");
1040 void set_class_size_bits(ir_type *tp, int size) {
1041 /* argh: we must allow to set negative values as "invalid size" */
1042 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1043 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1046 /*----------------------------------------------------------------**/
1048 /*----------------------------------------------------------------**/
1050 /* create a new type struct */
1051 ir_type *new_d_type_struct(ident *name, dbg_info *db) {
1052 ir_type *res = new_type(type_struct, NULL, name, db);
1054 res->attr.sa.members = NEW_ARR_F(entity *, 0);
1059 ir_type *new_type_struct (ident *name) {
1060 return new_d_type_struct (name, NULL);
1063 void free_struct_entities (ir_type *strct) {
1065 assert(strct && (strct->type_op == type_struct));
1066 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
1067 free_entity(get_struct_member(strct, i));
1069 void free_struct_attrs (ir_type *strct) {
1070 assert(strct && (strct->type_op == type_struct));
1071 DEL_ARR_F(strct->attr.sa.members);
1074 /* manipulate private fields of struct */
1075 int get_struct_n_members (const ir_type *strct) {
1076 assert(strct && (strct->type_op == type_struct));
1077 return (ARR_LEN (strct->attr.sa.members));
1080 void add_struct_member (ir_type *strct, entity *member) {
1081 assert(strct && (strct->type_op == type_struct));
1082 assert(get_type_tpop(get_entity_type(member)) != type_method);
1083 /* @@@ lowerfirm geht nicht durch */
1084 assert(strct != get_entity_type(member) && "recursive type");
1085 ARR_APP1 (entity *, strct->attr.sa.members, member);
1088 entity *get_struct_member (const ir_type *strct, int pos) {
1089 assert(strct && (strct->type_op == type_struct));
1090 assert(pos >= 0 && pos < get_struct_n_members(strct));
1091 return strct->attr.sa.members[pos];
1094 int get_struct_member_index(const ir_type *strct, entity *mem) {
1096 assert(strct && (strct->type_op == type_struct));
1097 for (i = 0, n = get_struct_n_members(strct); i < n; ++i)
1098 if (get_struct_member(strct, i) == mem)
1103 void set_struct_member (ir_type *strct, int pos, entity *member) {
1104 assert(strct && (strct->type_op == type_struct));
1105 assert(pos >= 0 && pos < get_struct_n_members(strct));
1106 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
1107 strct->attr.sa.members[pos] = member;
1109 void remove_struct_member(ir_type *strct, entity *member) {
1111 assert(strct && (strct->type_op == type_struct));
1112 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
1113 if (strct->attr.sa.members[i] == member) {
1114 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
1115 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1116 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1122 int (is_Struct_type)(const ir_type *strct) {
1123 return _is_struct_type(strct);
1126 void set_struct_mode(ir_type *tp, ir_mode *mode) {
1127 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1128 assert(get_type_state(tp) == layout_fixed &&
1129 tp->size == get_mode_size_bits(mode) && "mode don't match struct layout");
1133 void set_struct_size_bits(ir_type *tp, int size) {
1134 /* argh: we must allow to set negative values as "invalid size" */
1135 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1136 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1139 /*******************************************************************/
1141 /*******************************************************************/
1144 * Lazy construction of value argument / result representation.
1145 * Constructs a struct type and its member. The types of the members
1146 * are passed in the argument list.
1148 * @param name name of the type constructed
1149 * @param len number of fields
1150 * @param tps array of field types with length len
1152 static INLINE ir_type *
1153 build_value_type(ident *name, int len, tp_ent_pair *tps) {
1155 ir_type *res = new_type_struct(name);
1156 /* Remove type from type list. Must be treated differently than other types. */
1157 remove_irp_type(res);
1158 for (i = 0; i < len; i++) {
1159 /* use res as default if corresponding type is not yet set. */
1160 ir_type *elt_type = tps[i].tp ? tps[i].tp : res;
1162 tps[i].ent = new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
1167 /* Create a new method type.
1168 N_param is the number of parameters, n_res the number of results. */
1169 ir_type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
1172 assert((get_mode_size_bytes(mode_P_code) != -1) && "unorthodox modes not implemented");
1173 res = new_type(type_method, mode_P_code, name, db);
1174 res->flags |= tf_layout_fixed;
1175 res->size = get_mode_size_bits(mode_P_code);
1176 res->attr.ma.n_params = n_param;
1177 res->attr.ma.param_type = xcalloc(n_param, sizeof(res->attr.ma.param_type[0]));
1178 res->attr.ma.value_params = NULL;
1179 res->attr.ma.n_res = n_res;
1180 res->attr.ma.res_type = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
1181 res->attr.ma.value_ress = NULL;
1182 res->attr.ma.variadicity = variadicity_non_variadic;
1183 res->attr.ma.first_variadic_param = -1;
1184 res->attr.ma.additional_properties = mtp_no_property;
1185 res->attr.ma.irg_calling_conv = default_cc_mask;
1190 ir_type *new_type_method(ident *name, int n_param, int n_res) {
1191 return new_d_type_method(name, n_param, n_res, NULL);
1194 void free_method_entities(ir_type *method) {
1195 assert(method && (method->type_op == type_method));
1198 /* Attention: also frees entities in value parameter subtypes! */
1199 void free_method_attrs(ir_type *method) {
1200 assert(method && (method->type_op == type_method));
1201 free(method->attr.ma.param_type);
1202 free(method->attr.ma.res_type);
1203 if (method->attr.ma.value_params) {
1204 free_type_entities(method->attr.ma.value_params);
1205 free_type(method->attr.ma.value_params);
1207 if (method->attr.ma.value_ress) {
1208 free_type_entities(method->attr.ma.value_ress);
1209 free_type(method->attr.ma.value_ress);
1213 /* manipulate private fields of method. */
1214 int (get_method_n_params)(const ir_type *method) {
1215 return _get_method_n_params(method);
1218 ir_type *get_method_param_type(ir_type *method, int pos) {
1220 assert(method && (method->type_op == type_method));
1221 assert(pos >= 0 && pos < get_method_n_params(method));
1222 res = method->attr.ma.param_type[pos].tp;
1223 assert(res != NULL && "empty method param type");
1224 return method->attr.ma.param_type[pos].tp = skip_tid(res);
1227 void set_method_param_type(ir_type *method, int pos, ir_type *tp) {
1228 assert(method && (method->type_op == type_method));
1229 assert(pos >= 0 && pos < get_method_n_params(method));
1230 method->attr.ma.param_type[pos].tp = tp;
1231 /* If information constructed set pass-by-value representation. */
1232 if (method->attr.ma.value_params) {
1233 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1234 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1238 /* Returns an entity that represents the copied value argument. Only necessary
1239 for compounds passed by value. */
1240 entity *get_method_value_param_ent(ir_type *method, int pos) {
1241 assert(method && (method->type_op == type_method));
1242 assert(pos >= 0 && pos < get_method_n_params(method));
1244 if (!method->attr.ma.value_params) {
1245 /* parameter value type not created yet, build */
1246 method->attr.ma.value_params
1247 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
1248 get_method_n_params(method), method->attr.ma.param_type);
1251 * build_value_type() sets the method->attr.ma.value_params type as default if
1254 assert((get_entity_type(method->attr.ma.param_type[pos].ent) != method->attr.ma.value_params)
1255 && "param type not yet set");
1256 return method->attr.ma.param_type[pos].ent;
1260 * Returns a type that represents the copied value arguments.
1262 ir_type *get_method_value_param_type(const ir_type *method)
1264 assert(method && (method->type_op == type_method));
1265 return method->attr.ma.value_params;
1268 int (get_method_n_ress)(const ir_type *method) {
1269 return _get_method_n_ress(method);
1272 ir_type *get_method_res_type(ir_type *method, int pos) {
1274 assert(method && (method->type_op == type_method));
1275 assert(pos >= 0 && pos < get_method_n_ress(method));
1276 res = method->attr.ma.res_type[pos].tp;
1277 assert(res != NULL && "empty method return type");
1278 return method->attr.ma.res_type[pos].tp = skip_tid(res);
1281 void set_method_res_type(ir_type *method, int pos, ir_type *tp) {
1282 assert(method && (method->type_op == type_method));
1283 assert(pos >= 0 && pos < get_method_n_ress(method));
1284 /* set the result ir_type */
1285 method->attr.ma.res_type[pos].tp = tp;
1286 /* If information constructed set pass-by-value representation. */
1287 if (method->attr.ma.value_ress) {
1288 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1289 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1293 /* Returns an entity that represents the copied value result. Only necessary
1294 for compounds passed by value. */
1295 entity *get_method_value_res_ent(ir_type *method, int pos) {
1296 assert(method && (method->type_op == type_method));
1297 assert(pos >= 0 && pos < get_method_n_ress(method));
1299 if (!method->attr.ma.value_ress) {
1300 /* result value type not created yet, build */
1301 method->attr.ma.value_ress
1302 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1303 get_method_n_ress(method), method->attr.ma.res_type);
1306 * build_value_type() sets the method->attr.ma.value_ress type as default if
1309 assert((get_entity_type(method->attr.ma.res_type[pos].ent) != method->attr.ma.value_ress)
1310 && "result type not yet set");
1312 return method->attr.ma.res_type[pos].ent;
1316 * Returns a type that represents the copied value results.
1318 ir_type *get_method_value_res_type(const ir_type *method) {
1319 assert(method && (method->type_op == type_method));
1320 return method->attr.ma.value_ress;
1323 /* Returns the null-terminated name of this variadicity. */
1324 const char *get_variadicity_name(variadicity vari)
1326 #define X(a) case a: return #a
1328 X(variadicity_non_variadic);
1329 X(variadicity_variadic);
1336 variadicity get_method_variadicity(const ir_type *method)
1338 assert(method && (method->type_op == type_method));
1339 return method->attr.ma.variadicity;
1342 void set_method_variadicity(ir_type *method, variadicity vari)
1344 assert(method && (method->type_op == type_method));
1345 method->attr.ma.variadicity = vari;
1349 * Returns the first variadic parameter index of a type.
1350 * If this index was NOT set, the index of the last parameter
1351 * of the method type plus one is returned for variadic functions.
1352 * Non-variadic function types always return -1 here.
1354 int get_method_first_variadic_param_index(const ir_type *method)
1356 assert(method && (method->type_op == type_method));
1358 if (method->attr.ma.variadicity == variadicity_non_variadic)
1361 if (method->attr.ma.first_variadic_param == -1)
1362 return get_method_n_params(method);
1363 return method->attr.ma.first_variadic_param;
1367 * Sets the first variadic parameter index. This allows to specify
1368 * a complete call type (containing the type of all parameters)
1369 * but still have the knowledge, which parameter must be passed as
1372 void set_method_first_variadic_param_index(ir_type *method, int index)
1374 assert(method && (method->type_op == type_method));
1375 assert(index >= 0 && index <= get_method_n_params(method));
1377 method->attr.ma.first_variadic_param = index;
1380 unsigned (get_method_additional_properties)(const ir_type *method) {
1381 return _get_method_additional_properties(method);
1384 void (set_method_additional_properties)(ir_type *method, unsigned mask) {
1385 _set_method_additional_properties(method, mask);
1388 void (set_method_additional_property)(ir_type *method, mtp_additional_property flag) {
1389 _set_method_additional_property(method, flag);
1392 /* Returns the calling convention of an entities graph. */
1393 unsigned (get_method_calling_convention)(const ir_type *method) {
1394 return _get_method_calling_convention(method);
1397 /* Sets the calling convention of an entities graph. */
1398 void (set_method_calling_convention)(ir_type *method, unsigned cc_mask) {
1399 _set_method_calling_convention(method, cc_mask);
1402 /* Returns the number of registers parameters, 0 means default. */
1403 unsigned get_method_n_regparams(ir_type *method) {
1404 unsigned cc = get_method_calling_convention(method);
1405 assert(IS_FASTCALL(cc));
1407 return cc & ~cc_bits;
1410 /* Sets the number of registers parameters, 0 means default. */
1411 void set_method_n_regparams(ir_type *method, unsigned n_regs) {
1412 unsigned cc = get_method_calling_convention(method);
1413 assert(IS_FASTCALL(cc));
1415 set_method_calling_convention(method, (cc & cc_bits) | (n_regs & ~cc_bits));
1419 int (is_Method_type)(const ir_type *method) {
1420 return _is_method_type(method);
1423 /*-----------------------------------------------------------------*/
1425 /*-----------------------------------------------------------------*/
1427 /* create a new type uni */
1428 ir_type *new_d_type_union(ident *name, dbg_info *db) {
1429 ir_type *res = new_type(type_union, NULL, name, db);
1431 res->attr.ua.members = NEW_ARR_F(entity *, 0);
1436 ir_type *new_type_union(ident *name) {
1437 return new_d_type_union(name, NULL);
1440 void free_union_entities(ir_type *uni) {
1442 assert(uni && (uni->type_op == type_union));
1443 for (i = get_union_n_members(uni) - 1; i >= 0; --i)
1444 free_entity(get_union_member(uni, i));
1447 void free_union_attrs (ir_type *uni) {
1448 assert(uni && (uni->type_op == type_union));
1449 DEL_ARR_F(uni->attr.ua.members);
1452 /* manipulate private fields of union */
1453 int get_union_n_members (const ir_type *uni) {
1454 assert(uni && (uni->type_op == type_union));
1455 return (ARR_LEN (uni->attr.ua.members));
1457 void add_union_member (ir_type *uni, entity *member) {
1458 assert(uni && (uni->type_op == type_union));
1459 assert(uni != get_entity_type(member) && "recursive type");
1460 ARR_APP1 (entity *, uni->attr.ua.members, member);
1462 entity *get_union_member (const ir_type *uni, int pos) {
1463 assert(uni && (uni->type_op == type_union));
1464 assert(pos >= 0 && pos < get_union_n_members(uni));
1465 return uni->attr.ua.members[pos];
1467 int get_union_member_index(const ir_type *uni, entity *mem) {
1469 assert(uni && (uni->type_op == type_union));
1470 for (i = 0, n = get_union_n_members(uni); i < n; ++i)
1471 if (get_union_member(uni, i) == mem)
1475 void set_union_member (ir_type *uni, int pos, entity *member) {
1476 assert(uni && (uni->type_op == type_union));
1477 assert(pos >= 0 && pos < get_union_n_members(uni));
1478 uni->attr.ua.members[pos] = member;
1480 void remove_union_member(ir_type *uni, entity *member) {
1482 assert(uni && (uni->type_op == type_union));
1483 for (i = 0; i < (ARR_LEN (uni->attr.ua.members)); i++)
1484 if (uni->attr.ua.members[i] == member) {
1485 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1486 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1487 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1493 int (is_Union_type)(const ir_type *uni) {
1494 return _is_union_type(uni);
1497 void set_union_size_bits(ir_type *tp, int size) {
1498 /* argh: we must allow to set negative values as "invalid size" */
1499 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1500 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1503 /*-----------------------------------------------------------------*/
1505 /*-----------------------------------------------------------------*/
1508 /* create a new type array -- set dimension sizes independently */
1509 ir_type *new_d_type_array(ident *name, int n_dimensions, ir_type *element_type, dbg_info *db) {
1513 ir_graph *rem = current_ir_graph;
1515 assert(!is_Method_type(element_type));
1517 res = new_type(type_array, NULL, name, db);
1518 res->attr.aa.n_dimensions = n_dimensions;
1519 res->attr.aa.lower_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
1520 res->attr.aa.upper_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
1521 res->attr.aa.order = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));
1523 current_ir_graph = get_const_code_irg();
1524 unk = new_Unknown( mode_Iu);
1525 for (i = 0; i < n_dimensions; i++) {
1526 res->attr.aa.lower_bound[i] =
1527 res->attr.aa.upper_bound[i] = unk;
1528 res->attr.aa.order[i] = i;
1530 current_ir_graph = rem;
1532 res->attr.aa.element_type = element_type;
1533 new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1538 ir_type *new_type_array(ident *name, int n_dimensions, ir_type *element_type) {
1539 return new_d_type_array(name, n_dimensions, element_type, NULL);
1542 void free_array_automatic_entities(ir_type *array) {
1543 assert(array && (array->type_op == type_array));
1544 free_entity(get_array_element_entity(array));
1547 void free_array_entities (ir_type *array) {
1548 assert(array && (array->type_op == type_array));
1551 void free_array_attrs (ir_type *array) {
1552 assert(array && (array->type_op == type_array));
1553 free(array->attr.aa.lower_bound);
1554 free(array->attr.aa.upper_bound);
1555 free(array->attr.aa.order);
1558 /* manipulate private fields of array ir_type */
1559 int get_array_n_dimensions (const ir_type *array) {
1560 assert(array && (array->type_op == type_array));
1561 return array->attr.aa.n_dimensions;
1565 set_array_bounds (ir_type *array, int dimension, ir_node * lower_bound,
1566 ir_node * upper_bound) {
1567 assert(array && (array->type_op == type_array));
1568 assert(lower_bound && "lower_bound node may not be NULL.");
1569 assert(upper_bound && "upper_bound node may not be NULL.");
1570 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1571 array->attr.aa.lower_bound[dimension] = lower_bound;
1572 array->attr.aa.upper_bound[dimension] = upper_bound;
1575 set_array_bounds_int (ir_type *array, int dimension, int lower_bound,
1577 ir_graph *rem = current_ir_graph;
1578 current_ir_graph = get_const_code_irg();
1579 set_array_bounds (array, dimension,
1580 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1581 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1582 current_ir_graph = rem;
1585 set_array_lower_bound (ir_type *array, int dimension, ir_node * lower_bound) {
1586 assert(array && (array->type_op == type_array));
1587 assert(lower_bound && "lower_bound node may not be NULL.");
1588 array->attr.aa.lower_bound[dimension] = lower_bound;
1590 void set_array_lower_bound_int (ir_type *array, int dimension, int lower_bound) {
1591 ir_graph *rem = current_ir_graph;
1592 current_ir_graph = get_const_code_irg();
1593 set_array_lower_bound (array, dimension,
1594 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1595 current_ir_graph = rem;
1598 set_array_upper_bound (ir_type *array, int dimension, ir_node * upper_bound) {
1599 assert(array && (array->type_op == type_array));
1600 assert(upper_bound && "upper_bound node may not be NULL.");
1601 array->attr.aa.upper_bound[dimension] = upper_bound;
1603 void set_array_upper_bound_int (ir_type *array, int dimension, int upper_bound) {
1604 ir_graph *rem = current_ir_graph;
1605 current_ir_graph = get_const_code_irg();
1606 set_array_upper_bound (array, dimension,
1607 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1608 current_ir_graph = rem;
1610 int has_array_lower_bound (const ir_type *array, int dimension) {
1611 assert(array && (array->type_op == type_array));
1612 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1614 ir_node *get_array_lower_bound (const ir_type *array, int dimension) {
1615 assert(array && (array->type_op == type_array));
1616 return array->attr.aa.lower_bound[dimension];
1618 long get_array_lower_bound_int (const ir_type *array, int dimension) {
1620 assert(array && (array->type_op == type_array));
1621 node = array->attr.aa.lower_bound[dimension];
1622 assert(get_irn_op(node) == op_Const);
1623 return get_tarval_long(get_Const_tarval(node));
1625 int has_array_upper_bound (const ir_type *array, int dimension) {
1626 assert(array && (array->type_op == type_array));
1627 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1629 ir_node * get_array_upper_bound (const ir_type *array, int dimension) {
1630 assert(array && (array->type_op == type_array));
1631 return array->attr.aa.upper_bound[dimension];
1633 long get_array_upper_bound_int (const ir_type *array, int dimension) {
1635 assert(array && (array->type_op == type_array));
1636 node = array->attr.aa.upper_bound[dimension];
1637 assert(get_irn_op(node) == op_Const);
1638 return get_tarval_long(get_Const_tarval(node));
1641 void set_array_order (ir_type *array, int dimension, int order) {
1642 assert(array && (array->type_op == type_array));
1643 array->attr.aa.order[dimension] = order;
1646 int get_array_order (const ir_type *array, int dimension) {
1647 assert(array && (array->type_op == type_array));
1648 return array->attr.aa.order[dimension];
1651 int find_array_dimension(const ir_type *array, int order) {
1654 assert(array && (array->type_op == type_array));
1656 for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
1657 if (array->attr.aa.order[dim] == order)
1663 void set_array_element_type (ir_type *array, ir_type *tp) {
1664 assert(array && (array->type_op == type_array));
1665 assert(!is_Method_type(tp));
1666 array->attr.aa.element_type = tp;
1668 ir_type *get_array_element_type (ir_type *array) {
1669 assert(array && (array->type_op == type_array));
1670 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1673 void set_array_element_entity (ir_type *array, entity *ent) {
1674 assert(array && (array->type_op == type_array));
1675 assert((get_entity_type(ent)->type_op != type_method));
1676 array->attr.aa.element_ent = ent;
1677 array->attr.aa.element_type = get_entity_type(ent);
1679 entity *get_array_element_entity (const ir_type *array) {
1680 assert(array && (array->type_op == type_array));
1681 return array->attr.aa.element_ent;
1685 int (is_Array_type)(const ir_type *array) {
1686 return _is_array_type(array);
1689 void set_array_size_bits(ir_type *tp, int size) {
1690 /* FIXME: Here we should make some checks with the element type size */
1693 /*-----------------------------------------------------------------*/
1694 /* TYPE_ENUMERATION */
1695 /*-----------------------------------------------------------------*/
1697 /* create a new type enumeration -- set the enumerators independently */
1698 ir_type *new_d_type_enumeration(ident *name, int n_enums, dbg_info *db) {
1699 ir_type *res = new_type(type_enumeration, NULL, name, db);
1701 res->attr.ea.n_enums = n_enums;
1702 res->attr.ea.enumer = xcalloc(n_enums, sizeof(res->attr.ea.enumer[0]));
1703 res->attr.ea.enum_nameid = xcalloc(n_enums, sizeof(res->attr.ea.enum_nameid[0]));
1708 ir_type *new_type_enumeration(ident *name, int n_enums) {
1709 return new_d_type_enumeration(name, n_enums, NULL);
1712 void free_enumeration_entities(ir_type *enumeration) {
1713 assert(enumeration && (enumeration->type_op == type_enumeration));
1715 void free_enumeration_attrs(ir_type *enumeration) {
1716 assert(enumeration && (enumeration->type_op == type_enumeration));
1717 free(enumeration->attr.ea.enumer);
1718 free(enumeration->attr.ea.enum_nameid);
1721 /* manipulate fields of enumeration type. */
1722 int get_enumeration_n_enums (const ir_type *enumeration) {
1723 assert(enumeration && (enumeration->type_op == type_enumeration));
1724 return enumeration->attr.ea.n_enums;
1726 void set_enumeration_enum (ir_type *enumeration, int pos, tarval *con) {
1727 assert(enumeration && (enumeration->type_op == type_enumeration));
1728 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1729 enumeration->attr.ea.enumer[pos] = con;
1731 tarval *get_enumeration_enum (const ir_type *enumeration, int pos) {
1732 assert(enumeration && (enumeration->type_op == type_enumeration));
1733 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1734 return enumeration->attr.ea.enumer[pos];
1736 void set_enumeration_nameid (ir_type *enumeration, int pos, ident *id) {
1737 assert(enumeration && (enumeration->type_op == type_enumeration));
1738 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1739 enumeration->attr.ea.enum_nameid[pos] = id;
1741 ident *get_enumeration_nameid (const ir_type *enumeration, int pos) {
1742 assert(enumeration && (enumeration->type_op == type_enumeration));
1743 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1744 return enumeration->attr.ea.enum_nameid[pos];
1746 const char *get_enumeration_name(const ir_type *enumeration, int pos) {
1747 assert(enumeration && (enumeration->type_op == type_enumeration));
1748 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1749 return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
1753 int (is_Enumeration_type)(const ir_type *enumeration) {
1754 return _is_enumeration_type(enumeration);
1757 void set_enumeration_mode(ir_type *tp, ir_mode *mode) {
1758 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1759 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1760 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1762 tp->size = get_mode_size_bits(mode);
1766 /*-----------------------------------------------------------------*/
1768 /*-----------------------------------------------------------------*/
1770 /* Create a new type pointer */
1771 ir_type *new_d_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode, dbg_info *db) {
1774 assert(mode_is_reference(ptr_mode));
1775 res = new_type(type_pointer, ptr_mode, name, db);
1776 res->attr.pa.points_to = points_to;
1777 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1778 res->size = get_mode_size_bits(res->mode);
1779 res->flags |= tf_layout_fixed;
1784 ir_type *new_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode) {
1785 return new_d_type_pointer(name, points_to, ptr_mode, NULL);
1788 void free_pointer_entities (ir_type *pointer) {
1789 assert(pointer && (pointer->type_op == type_pointer));
1792 void free_pointer_attrs (ir_type *pointer) {
1793 assert(pointer && (pointer->type_op == type_pointer));
1796 /* manipulate fields of type_pointer */
1797 void set_pointer_points_to_type (ir_type *pointer, ir_type *tp) {
1798 assert(pointer && (pointer->type_op == type_pointer));
1799 pointer->attr.pa.points_to = tp;
1802 ir_type *get_pointer_points_to_type (ir_type *pointer) {
1803 assert(pointer && (pointer->type_op == type_pointer));
1804 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1808 int (is_Pointer_type)(const ir_type *pointer) {
1809 return _is_pointer_type(pointer);
1812 void set_pointer_mode(ir_type *tp, ir_mode *mode) {
1813 assert(mode_is_reference(mode) && "Modes of pointers must be references");
1814 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1815 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1817 tp->size = get_mode_size_bits(mode);
1821 /* Returns the first pointer type that has as points_to tp.
1822 * Not efficient: O(#types).
1823 * If not found returns firm_unknown_type. */
1824 ir_type *find_pointer_type_to_type (ir_type *tp) {
1825 int i, n = get_irp_n_types();
1826 for (i = 0; i < n; ++i) {
1827 ir_type *found = get_irp_type(i);
1828 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1831 return firm_unknown_type;
1835 /*-----------------------------------------------------------------*/
1836 /* TYPE_PRIMITIVE */
1837 /*-----------------------------------------------------------------*/
1839 /* create a new type primitive */
1840 ir_type *new_d_type_primitive(ident *name, ir_mode *mode, dbg_info *db) {
1842 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1843 res = new_type(type_primitive, mode, name, db);
1844 res->size = get_mode_size_bits(mode);
1845 res->flags |= tf_layout_fixed;
1850 ir_type *new_type_primitive(ident *name, ir_mode *mode) {
1851 return new_d_type_primitive(name, mode, NULL);
1855 int (is_Primitive_type)(const ir_type *primitive) {
1856 return _is_primitive_type(primitive);
1859 void set_primitive_mode(ir_type *tp, ir_mode *mode) {
1860 /* Modes of primitives must be data */
1861 assert(mode_is_data(mode));
1863 /* For primitive size depends on the mode. */
1864 tp->size = get_mode_size_bits(mode);
1869 /*-----------------------------------------------------------------*/
1870 /* common functionality */
1871 /*-----------------------------------------------------------------*/
1874 int (is_atomic_type)(const ir_type *tp) {
1875 return _is_atomic_type(tp);
1879 * Gets the number of elements in a firm compound type.
1881 int get_compound_n_members(const ir_type *tp)
1883 const tp_op *op = get_type_tpop(tp);
1886 if (op->ops.get_n_members)
1887 res = op->ops.get_n_members(tp);
1889 assert(0 && "no member count for this type");
1895 * Gets the member of a firm compound type at position pos.
1897 entity *get_compound_member(const ir_type *tp, int pos)
1899 const tp_op *op = get_type_tpop(tp);
1902 if (op->ops.get_member)
1903 res = op->ops.get_member(tp, pos);
1905 assert(0 && "no members in this type");
1910 /* Returns index of member in tp, -1 if not contained. */
1911 int get_compound_member_index(const ir_type *tp, entity *member)
1913 const tp_op *op = get_type_tpop(tp);
1916 if (op->ops.get_member_index)
1917 index = op->ops.get_member_index(tp, member);
1919 assert(0 && "no members in this type");
1924 int is_compound_type(const ir_type *tp) {
1925 assert(tp && tp->kind == k_type);
1926 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
1929 /* Checks, whether a type is a frame ir_type */
1930 int is_frame_type(const ir_type *tp) {
1931 return tp->flags & tf_frame_type;
1934 /* Checks, whether a type is a lowered ir_type */
1935 int is_lowered_type(const ir_type *tp) {
1936 return tp->flags & tf_lowered_type;
1939 /* Makes a new frame type. */
1940 ir_type *new_type_frame(ident *name)
1942 ir_type *res = new_type_class(name);
1944 res->flags |= tf_frame_type;
1946 /* Remove type from type list. Must be treated differently than other types. */
1947 remove_irp_type(res);
1952 /* Sets a lowered type for a type. This sets both associations. */
1953 void set_lowered_type(ir_type *tp, ir_type *lowered_type) {
1954 assert(is_type(tp) && is_type(lowered_type));
1955 lowered_type->flags |= tf_lowered_type;
1956 tp->assoc_type = lowered_type;
1957 lowered_type->assoc_type = tp;
1961 * Gets the lowered/unlowered type of a type or NULL if this type
1962 * has no lowered/unlowered one.
1964 ir_type *get_associated_type(const ir_type *tp) {
1965 return tp->assoc_type;
1968 /* set the type size for the unknown and none ir_type */
1969 void set_default_size_bits(ir_type *tp, int size) {
1974 * Allocate an area of size bytes aligned at alignment
1975 * at the start or the end of a frame type.
1976 * The frame type must have already an fixed layout.
1978 entity *frame_alloc_area(type *frame_type, int size, int alignment, int at_start)
1984 int frame_align, i, offset, frame_size;
1985 static unsigned area_cnt = 0;
1986 static ir_type *a_byte = NULL;
1988 assert(is_frame_type(frame_type));
1989 assert(get_type_state(frame_type) == layout_fixed);
1992 a_byte = new_type_primitive(new_id_from_chars("byte", 4), mode_Bu);
1994 snprintf(buf, sizeof(buf), "area%u", area_cnt++);
1995 name = new_id_from_str(buf);
1997 /* align the size */
1998 frame_align = get_type_alignment_bytes(frame_type);
1999 size = (size + frame_align - 1) & -frame_align;
2001 tp = new_type_array(mangle_u(get_type_ident(frame_type), name), 1, a_byte);
2002 set_array_bounds_int(tp, 0, 0, size);
2003 set_type_alignment_bytes(tp, alignment);
2005 frame_size = get_type_size_bytes(frame_type);
2007 /* fix all offsets so far */
2008 for (i = get_class_n_members(frame_type) - 1; i >= 0; --i) {
2009 entity *ent = get_class_member(frame_type, i);
2011 set_entity_offset_bytes(ent, get_entity_offset_bytes(ent) + size);
2013 /* calculate offset and new type size */
2018 /* calculate offset and new type size */
2019 offset = (frame_size + alignment - 1) & -alignment;
2020 frame_size = offset + size;
2023 area = new_entity(frame_type, name, tp);
2024 set_entity_offset_bytes(area, offset);
2025 set_type_size_bytes(frame_type, frame_size);