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 & (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) {
373 set_type_alignment_bits(tp, 8*align);
376 /* Returns a human readable string for the enum entry. */
377 const char *get_type_state_name(type_state s) {
378 #define X(a) case a: return #a;
388 type_state (get_type_state)(const ir_type *tp) {
389 return _get_type_state(tp);
393 set_type_state(ir_type *tp, type_state state) {
394 assert(tp && tp->kind == k_type);
396 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
397 (tp->type_op == type_method))
400 /* Just a correctness check: */
401 if (state == layout_fixed) {
403 switch (get_type_tpop_code(tp)) {
406 assert(get_type_size_bits(tp) > -1);
407 if (tp != get_glob_type()) {
408 int n_mem = get_class_n_members(tp);
409 for (i = 0; i < n_mem; i++) {
410 if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
411 { DDMT(tp); DDME(get_class_member(tp, i)); }
412 assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
414 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
415 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
422 assert(get_type_size_bits(tp) > -1);
423 for (i = 0; i < get_struct_n_members(tp); i++) {
424 assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
425 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
434 Assure that only innermost dimension is dynamic? */
436 case tpo_enumeration:
438 assert(get_type_mode != NULL);
439 for (i = 0; i < get_enumeration_n_enums(tp); i++)
440 assert(get_enumeration_enum(tp, i) != NULL);
445 if (state == layout_fixed)
446 tp->flags |= tf_layout_fixed;
448 tp->flags &= tf_layout_fixed;
451 unsigned long (get_type_visited)(const ir_type *tp) {
452 return _get_type_visited(tp);
455 void (set_type_visited)(ir_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)(ir_type *tp) {
461 _mark_type_visited(tp);
464 int (type_visited)(const ir_type *tp) {
465 return _type_visited(tp);
468 int (type_not_visited)(const ir_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(ir_type *typ1, ir_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 ir_type *t1 = get_class_supertype(typ1, i);
522 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
523 ir_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 (ir_type *st, ir_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 ir_type *set, *let; /* small/large elt. ir_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 ir_type */
759 ir_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 (ir_type *, 0);
766 res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
767 res->attr.ca.peculiarity = peculiarity_existent;
768 res->attr.ca.type_info = NULL;
769 res->attr.ca.final = 0;
770 res->attr.ca.dfn = 0;
775 ir_type *new_type_class (ident *name) {
776 return new_d_type_class (name, NULL);
779 /* free all entities of a class */
780 void free_class_entities(ir_type *clss) {
782 assert(clss && (clss->type_op == type_class));
783 for (i = get_class_n_members(clss) - 1; i >= 0; --i)
784 free_entity(get_class_member(clss, i));
785 /* do NOT free the type info here. It belongs to another class */
788 void free_class_attrs(ir_type *clss) {
789 assert(clss && (clss->type_op == type_class));
790 DEL_ARR_F(clss->attr.ca.members);
791 DEL_ARR_F(clss->attr.ca.subtypes);
792 DEL_ARR_F(clss->attr.ca.supertypes);
795 /* manipulate private fields of class type */
796 void add_class_member (ir_type *clss, entity *member) {
797 assert(clss && (clss->type_op == type_class));
798 assert(clss != get_entity_type(member) && "recursive type");
799 ARR_APP1 (entity *, clss->attr.ca.members, member);
802 int (get_class_n_members) (const ir_type *clss) {
803 return _get_class_n_members(clss);
806 int get_class_member_index(const ir_type *clss, entity *mem) {
808 assert(clss && (clss->type_op == type_class));
809 for (i = 0, n = get_class_n_members(clss); i < n; ++i)
810 if (get_class_member(clss, i) == mem)
815 entity *(get_class_member) (const ir_type *clss, int pos) {
816 return _get_class_member(clss, pos);
819 entity *get_class_member_by_name(ir_type *clss, ident *name) {
821 assert(clss && (clss->type_op == type_class));
822 n_mem = get_class_n_members(clss);
823 for (i = 0; i < n_mem; ++i) {
824 entity *mem = get_class_member(clss, i);
825 if (get_entity_ident(mem) == name) return mem;
830 void set_class_member (ir_type *clss, entity *member, int pos) {
831 assert(clss && (clss->type_op == type_class));
832 assert(pos >= 0 && pos < get_class_n_members(clss));
833 clss->attr.ca.members[pos] = member;
835 void set_class_members (ir_type *clss, entity **members, int arity) {
837 assert(clss && (clss->type_op == type_class));
838 DEL_ARR_F(clss->attr.ca.members);
839 clss->attr.ca.members = NEW_ARR_F (entity *, 0);
840 for (i = 0; i < arity; i++) {
841 set_entity_owner(members[i], clss);
842 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
845 void remove_class_member(ir_type *clss, entity *member) {
847 assert(clss && (clss->type_op == type_class));
848 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
849 if (clss->attr.ca.members[i] == member) {
850 for (; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
851 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
852 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
858 void add_class_subtype (ir_type *clss, ir_type *subtype) {
860 assert(clss && (clss->type_op == type_class));
861 ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
862 for (i = 0; i < get_class_n_supertypes(subtype); i++)
863 if (get_class_supertype(subtype, i) == clss)
864 /* Class already registered */
866 ARR_APP1 (ir_type *, subtype->attr.ca.supertypes, clss);
868 int get_class_n_subtypes (const ir_type *clss) {
869 assert(clss && (clss->type_op == type_class));
870 return (ARR_LEN (clss->attr.ca.subtypes));
872 ir_type *get_class_subtype (ir_type *clss, int pos) {
873 assert(clss && (clss->type_op == type_class));
874 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
875 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
877 int get_class_subtype_index(ir_type *clss, const ir_type *subclass) {
878 int i, n_subtypes = get_class_n_subtypes(clss);
879 assert(is_Class_type(subclass));
880 for (i = 0; i < n_subtypes; ++i) {
881 if (get_class_subtype(clss, i) == subclass) return i;
885 void set_class_subtype (ir_type *clss, ir_type *subtype, int pos) {
886 assert(clss && (clss->type_op == type_class));
887 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
888 clss->attr.ca.subtypes[pos] = subtype;
890 void remove_class_subtype(ir_type *clss, ir_type *subtype) {
892 assert(clss && (clss->type_op == type_class));
893 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
894 if (clss->attr.ca.subtypes[i] == subtype) {
895 for (; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
896 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
897 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
902 void add_class_supertype (ir_type *clss, ir_type *supertype) {
904 assert(clss && (clss->type_op == type_class));
905 assert(supertype && (supertype -> type_op == type_class));
906 ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
907 for (i = get_class_n_subtypes(supertype) - 1; i >= 0; --i)
908 if (get_class_subtype(supertype, i) == clss)
909 /* Class already registered */
911 ARR_APP1 (ir_type *, supertype->attr.ca.subtypes, clss);
913 int get_class_n_supertypes (const ir_type *clss) {
914 assert(clss && (clss->type_op == type_class));
915 return (ARR_LEN (clss->attr.ca.supertypes));
917 int get_class_supertype_index(ir_type *clss, ir_type *super_clss) {
918 int i, n_supertypes = get_class_n_supertypes(clss);
919 assert(super_clss && (super_clss->type_op == type_class));
920 for (i = 0; i < n_supertypes; i++)
921 if (get_class_supertype(clss, i) == super_clss)
925 ir_type *get_class_supertype (ir_type *clss, int pos) {
926 assert(clss && (clss->type_op == type_class));
927 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
928 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
930 void set_class_supertype (ir_type *clss, ir_type *supertype, int pos) {
931 assert(clss && (clss->type_op == type_class));
932 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
933 clss->attr.ca.supertypes[pos] = supertype;
935 void remove_class_supertype(ir_type *clss, ir_type *supertype) {
937 assert(clss && (clss->type_op == type_class));
938 for (i = 0; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
939 if (clss->attr.ca.supertypes[i] == supertype) {
940 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
941 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
942 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
946 entity *get_class_type_info(const ir_type *clss) {
947 return clss->attr.ca.type_info;
949 void set_class_type_info(ir_type *clss, entity *ent) {
950 clss->attr.ca.type_info = ent;
953 const char *get_peculiarity_string(peculiarity p) {
954 #define X(a) case a: return #a
956 X(peculiarity_description);
957 X(peculiarity_inherited);
958 X(peculiarity_existent);
961 return "invalid peculiarity";
964 peculiarity get_class_peculiarity (const ir_type *clss) {
965 assert(clss && (clss->type_op == type_class));
966 return clss->attr.ca.peculiarity;
969 void set_class_peculiarity (ir_type *clss, peculiarity pec) {
970 assert(clss && (clss->type_op == type_class));
971 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
972 clss->attr.ca.peculiarity = pec;
975 int (is_class_final)(const ir_type *clss) {
976 return _is_class_final(clss);
979 void (set_class_final)(ir_type *clss, int final) {
980 _set_class_final(clss, final);
983 void set_class_dfn (ir_type *clss, int dfn) {
984 clss->attr.ca.dfn = dfn;
987 int get_class_dfn (const ir_type *clss) {
988 return (clss->attr.ca.dfn);
992 int (is_Class_type)(const ir_type *clss) {
993 return _is_class_type(clss);
996 void set_class_mode(ir_type *tp, ir_mode *mode) {
997 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
998 assert(get_type_state(tp) == layout_fixed &&
999 tp->size == get_mode_size_bits(mode) && "mode don't match class layout");
1003 void set_class_size_bits(ir_type *tp, int size) {
1004 /* argh: we must allow to set negative values as "invalid size" */
1005 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1006 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1009 /*----------------------------------------------------------------**/
1011 /*----------------------------------------------------------------**/
1013 /* create a new type struct */
1014 ir_type *new_d_type_struct(ident *name, dbg_info *db) {
1015 ir_type *res = new_type(type_struct, NULL, name, db);
1017 res->attr.sa.members = NEW_ARR_F(entity *, 0);
1022 ir_type *new_type_struct (ident *name) {
1023 return new_d_type_struct (name, NULL);
1026 void free_struct_entities (ir_type *strct) {
1028 assert(strct && (strct->type_op == type_struct));
1029 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
1030 free_entity(get_struct_member(strct, i));
1032 void free_struct_attrs (ir_type *strct) {
1033 assert(strct && (strct->type_op == type_struct));
1034 DEL_ARR_F(strct->attr.sa.members);
1037 /* manipulate private fields of struct */
1038 int get_struct_n_members (const ir_type *strct) {
1039 assert(strct && (strct->type_op == type_struct));
1040 return (ARR_LEN (strct->attr.sa.members));
1043 void add_struct_member (ir_type *strct, entity *member) {
1044 assert(strct && (strct->type_op == type_struct));
1045 assert(get_type_tpop(get_entity_type(member)) != type_method);
1046 /* @@@ lowerfirm geht nicht durch */
1047 assert(strct != get_entity_type(member) && "recursive type");
1048 ARR_APP1 (entity *, strct->attr.sa.members, member);
1051 entity *get_struct_member (const ir_type *strct, int pos) {
1052 assert(strct && (strct->type_op == type_struct));
1053 assert(pos >= 0 && pos < get_struct_n_members(strct));
1054 return strct->attr.sa.members[pos];
1057 int get_struct_member_index(const ir_type *strct, entity *mem) {
1059 assert(strct && (strct->type_op == type_struct));
1060 for (i = 0, n = get_struct_n_members(strct); i < n; ++i)
1061 if (get_struct_member(strct, i) == mem)
1066 void set_struct_member (ir_type *strct, int pos, entity *member) {
1067 assert(strct && (strct->type_op == type_struct));
1068 assert(pos >= 0 && pos < get_struct_n_members(strct));
1069 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
1070 strct->attr.sa.members[pos] = member;
1072 void remove_struct_member(ir_type *strct, entity *member) {
1074 assert(strct && (strct->type_op == type_struct));
1075 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
1076 if (strct->attr.sa.members[i] == member) {
1077 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
1078 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1079 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1085 int (is_Struct_type)(const ir_type *strct) {
1086 return _is_struct_type(strct);
1089 void set_struct_mode(ir_type *tp, ir_mode *mode) {
1090 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1091 assert(get_type_state(tp) == layout_fixed &&
1092 tp->size == get_mode_size_bits(mode) && "mode don't match struct layout");
1096 void set_struct_size_bits(ir_type *tp, int size) {
1097 /* argh: we must allow to set negative values as "invalid size" */
1098 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1099 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1102 /*******************************************************************/
1104 /*******************************************************************/
1107 * Lazy construction of value argument / result representation.
1108 * Constructs a struct type and its member. The types of the members
1109 * are passed in the argument list.
1111 * @param name name of the type constructed
1112 * @param len number of fields
1113 * @param tps array of field types with length len
1115 static INLINE ir_type *
1116 build_value_type(ident *name, int len, tp_ent_pair *tps) {
1118 ir_type *res = new_type_struct(name);
1119 /* Remove type from type list. Must be treated differently than other types. */
1120 remove_irp_type(res);
1121 for (i = 0; i < len; i++) {
1122 /* use res as default if corresponding type is not yet set. */
1123 ir_type *elt_type = tps[i].tp ? tps[i].tp : res;
1125 tps[i].ent = new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
1130 /* Create a new method type.
1131 N_param is the number of parameters, n_res the number of results. */
1132 ir_type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
1135 assert((get_mode_size_bytes(mode_P_code) != -1) && "unorthodox modes not implemented");
1136 res = new_type(type_method, mode_P_code, name, db);
1137 res->flags |= tf_layout_fixed;
1138 res->size = get_mode_size_bits(mode_P_code);
1139 res->attr.ma.n_params = n_param;
1140 res->attr.ma.param_type = xcalloc(n_param, sizeof(res->attr.ma.param_type[0]));
1141 res->attr.ma.value_params = NULL;
1142 res->attr.ma.n_res = n_res;
1143 res->attr.ma.res_type = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
1144 res->attr.ma.value_ress = NULL;
1145 res->attr.ma.variadicity = variadicity_non_variadic;
1146 res->attr.ma.first_variadic_param = -1;
1147 res->attr.ma.additional_properties = mtp_no_property;
1148 res->attr.ma.irg_calling_conv = default_cc_mask;
1153 ir_type *new_type_method(ident *name, int n_param, int n_res) {
1154 return new_d_type_method(name, n_param, n_res, NULL);
1157 void free_method_entities(ir_type *method) {
1158 assert(method && (method->type_op == type_method));
1161 /* Attention: also frees entities in value parameter subtypes! */
1162 void free_method_attrs(ir_type *method) {
1163 assert(method && (method->type_op == type_method));
1164 free(method->attr.ma.param_type);
1165 free(method->attr.ma.res_type);
1166 if (method->attr.ma.value_params) {
1167 free_type_entities(method->attr.ma.value_params);
1168 free_type(method->attr.ma.value_params);
1170 if (method->attr.ma.value_ress) {
1171 free_type_entities(method->attr.ma.value_ress);
1172 free_type(method->attr.ma.value_ress);
1176 /* manipulate private fields of method. */
1177 int (get_method_n_params)(const ir_type *method) {
1178 return _get_method_n_params(method);
1181 ir_type *get_method_param_type(ir_type *method, int pos) {
1183 assert(method && (method->type_op == type_method));
1184 assert(pos >= 0 && pos < get_method_n_params(method));
1185 res = method->attr.ma.param_type[pos].tp;
1186 assert(res != NULL && "empty method param type");
1187 return method->attr.ma.param_type[pos].tp = skip_tid(res);
1190 void set_method_param_type(ir_type *method, int pos, ir_type *tp) {
1191 assert(method && (method->type_op == type_method));
1192 assert(pos >= 0 && pos < get_method_n_params(method));
1193 method->attr.ma.param_type[pos].tp = tp;
1194 /* If information constructed set pass-by-value representation. */
1195 if (method->attr.ma.value_params) {
1196 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1197 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1201 /* Returns an entity that represents the copied value argument. Only necessary
1202 for compounds passed by value. */
1203 entity *get_method_value_param_ent(ir_type *method, int pos) {
1204 assert(method && (method->type_op == type_method));
1205 assert(pos >= 0 && pos < get_method_n_params(method));
1207 if (!method->attr.ma.value_params) {
1208 /* parameter value type not created yet, build */
1209 method->attr.ma.value_params
1210 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
1211 get_method_n_params(method), method->attr.ma.param_type);
1214 * build_value_type() sets the method->attr.ma.value_params type as default if
1217 assert((get_entity_type(method->attr.ma.param_type[pos].ent) != method->attr.ma.value_params)
1218 && "param type not yet set");
1219 return method->attr.ma.param_type[pos].ent;
1223 * Returns a type that represents the copied value arguments.
1225 ir_type *get_method_value_param_type(const ir_type *method)
1227 assert(method && (method->type_op == type_method));
1228 return method->attr.ma.value_params;
1231 int (get_method_n_ress)(const ir_type *method) {
1232 return _get_method_n_ress(method);
1235 ir_type *get_method_res_type(ir_type *method, int pos) {
1237 assert(method && (method->type_op == type_method));
1238 assert(pos >= 0 && pos < get_method_n_ress(method));
1239 res = method->attr.ma.res_type[pos].tp;
1240 assert(res != NULL && "empty method return type");
1241 return method->attr.ma.res_type[pos].tp = skip_tid(res);
1244 void set_method_res_type(ir_type *method, int pos, ir_type *tp) {
1245 assert(method && (method->type_op == type_method));
1246 assert(pos >= 0 && pos < get_method_n_ress(method));
1247 /* set the result ir_type */
1248 method->attr.ma.res_type[pos].tp = tp;
1249 /* If information constructed set pass-by-value representation. */
1250 if (method->attr.ma.value_ress) {
1251 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1252 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1256 /* Returns an entity that represents the copied value result. Only necessary
1257 for compounds passed by value. */
1258 entity *get_method_value_res_ent(ir_type *method, int pos) {
1259 assert(method && (method->type_op == type_method));
1260 assert(pos >= 0 && pos < get_method_n_ress(method));
1262 if (!method->attr.ma.value_ress) {
1263 /* result value type not created yet, build */
1264 method->attr.ma.value_ress
1265 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1266 get_method_n_ress(method), method->attr.ma.res_type);
1269 * build_value_type() sets the method->attr.ma.value_ress type as default if
1272 assert((get_entity_type(method->attr.ma.res_type[pos].ent) != method->attr.ma.value_ress)
1273 && "result type not yet set");
1275 return method->attr.ma.res_type[pos].ent;
1279 * Returns a type that represents the copied value results.
1281 ir_type *get_method_value_res_type(const ir_type *method) {
1282 assert(method && (method->type_op == type_method));
1283 return method->attr.ma.value_ress;
1286 /* Returns the null-terminated name of this variadicity. */
1287 const char *get_variadicity_name(variadicity vari)
1289 #define X(a) case a: return #a
1291 X(variadicity_non_variadic);
1292 X(variadicity_variadic);
1299 variadicity get_method_variadicity(const ir_type *method)
1301 assert(method && (method->type_op == type_method));
1302 return method->attr.ma.variadicity;
1305 void set_method_variadicity(ir_type *method, variadicity vari)
1307 assert(method && (method->type_op == type_method));
1308 method->attr.ma.variadicity = vari;
1312 * Returns the first variadic parameter index of a type.
1313 * If this index was NOT set, the index of the last parameter
1314 * of the method type plus one is returned for variadic functions.
1315 * Non-variadic function types always return -1 here.
1317 int get_method_first_variadic_param_index(const ir_type *method)
1319 assert(method && (method->type_op == type_method));
1321 if (method->attr.ma.variadicity == variadicity_non_variadic)
1324 if (method->attr.ma.first_variadic_param == -1)
1325 return get_method_n_params(method);
1326 return method->attr.ma.first_variadic_param;
1330 * Sets the first variadic parameter index. This allows to specify
1331 * a complete call type (containing the type of all parameters)
1332 * but still have the knowledge, which parameter must be passed as
1335 void set_method_first_variadic_param_index(ir_type *method, int index)
1337 assert(method && (method->type_op == type_method));
1338 assert(index >= 0 && index <= get_method_n_params(method));
1340 method->attr.ma.first_variadic_param = index;
1343 unsigned (get_method_additional_properties)(const ir_type *method) {
1344 return _get_method_additional_properties(method);
1347 void (set_method_additional_properties)(ir_type *method, unsigned mask) {
1348 _set_method_additional_properties(method, mask);
1351 void (set_method_additional_property)(ir_type *method, mtp_additional_property flag) {
1352 _set_method_additional_property(method, flag);
1355 /* Returns the calling convention of an entities graph. */
1356 unsigned (get_method_calling_convention)(const ir_type *method) {
1357 return _get_method_calling_convention(method);
1360 /* Sets the calling convention of an entities graph. */
1361 void (set_method_calling_convention)(ir_type *method, unsigned cc_mask) {
1362 _set_method_calling_convention(method, cc_mask);
1365 /* Returns the number of registers parameters, 0 means default. */
1366 unsigned get_method_n_regparams(ir_type *method) {
1367 unsigned cc = get_method_calling_convention(method);
1368 assert(IS_FASTCALL(cc));
1370 return cc & ~cc_bits;
1373 /* Sets the number of registers parameters, 0 means default. */
1374 void set_method_n_regparams(ir_type *method, unsigned n_regs) {
1375 unsigned cc = get_method_calling_convention(method);
1376 assert(IS_FASTCALL(cc));
1378 set_method_calling_convention(method, (cc & cc_bits) | (n_regs & ~cc_bits));
1382 int (is_Method_type)(const ir_type *method) {
1383 return _is_method_type(method);
1386 /*-----------------------------------------------------------------*/
1388 /*-----------------------------------------------------------------*/
1390 /* create a new type uni */
1391 ir_type *new_d_type_union(ident *name, dbg_info *db) {
1392 ir_type *res = new_type(type_union, NULL, name, db);
1394 res->attr.ua.members = NEW_ARR_F(entity *, 0);
1399 ir_type *new_type_union(ident *name) {
1400 return new_d_type_union(name, NULL);
1403 void free_union_entities(ir_type *uni) {
1405 assert(uni && (uni->type_op == type_union));
1406 for (i = get_union_n_members(uni) - 1; i >= 0; --i)
1407 free_entity(get_union_member(uni, i));
1410 void free_union_attrs (ir_type *uni) {
1411 assert(uni && (uni->type_op == type_union));
1412 DEL_ARR_F(uni->attr.ua.members);
1415 /* manipulate private fields of union */
1416 int get_union_n_members (const ir_type *uni) {
1417 assert(uni && (uni->type_op == type_union));
1418 return (ARR_LEN (uni->attr.ua.members));
1420 void add_union_member (ir_type *uni, entity *member) {
1421 assert(uni && (uni->type_op == type_union));
1422 assert(uni != get_entity_type(member) && "recursive type");
1423 ARR_APP1 (entity *, uni->attr.ua.members, member);
1425 entity *get_union_member (const ir_type *uni, int pos) {
1426 assert(uni && (uni->type_op == type_union));
1427 assert(pos >= 0 && pos < get_union_n_members(uni));
1428 return uni->attr.ua.members[pos];
1430 int get_union_member_index(const ir_type *uni, entity *mem) {
1432 assert(uni && (uni->type_op == type_union));
1433 for (i = 0, n = get_union_n_members(uni); i < n; ++i)
1434 if (get_union_member(uni, i) == mem)
1438 void set_union_member (ir_type *uni, int pos, entity *member) {
1439 assert(uni && (uni->type_op == type_union));
1440 assert(pos >= 0 && pos < get_union_n_members(uni));
1441 uni->attr.ua.members[pos] = member;
1443 void remove_union_member(ir_type *uni, entity *member) {
1445 assert(uni && (uni->type_op == type_union));
1446 for (i = 0; i < (ARR_LEN (uni->attr.ua.members)); i++)
1447 if (uni->attr.ua.members[i] == member) {
1448 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1449 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1450 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1456 int (is_Union_type)(const ir_type *uni) {
1457 return _is_union_type(uni);
1460 void set_union_size_bits(ir_type *tp, int size) {
1461 /* argh: we must allow to set negative values as "invalid size" */
1462 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1463 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1466 /*-----------------------------------------------------------------*/
1468 /*-----------------------------------------------------------------*/
1471 /* create a new type array -- set dimension sizes independently */
1472 ir_type *new_d_type_array(ident *name, int n_dimensions, ir_type *element_type, dbg_info *db) {
1476 ir_graph *rem = current_ir_graph;
1478 assert(!is_Method_type(element_type));
1480 res = new_type(type_array, NULL, name, db);
1481 res->attr.aa.n_dimensions = n_dimensions;
1482 res->attr.aa.lower_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
1483 res->attr.aa.upper_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
1484 res->attr.aa.order = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));
1486 current_ir_graph = get_const_code_irg();
1487 unk = new_Unknown( mode_Iu);
1488 for (i = 0; i < n_dimensions; i++) {
1489 res->attr.aa.lower_bound[i] =
1490 res->attr.aa.upper_bound[i] = unk;
1491 res->attr.aa.order[i] = i;
1493 current_ir_graph = rem;
1495 res->attr.aa.element_type = element_type;
1496 new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1501 ir_type *new_type_array(ident *name, int n_dimensions, ir_type *element_type) {
1502 return new_d_type_array(name, n_dimensions, element_type, NULL);
1505 void free_array_automatic_entities(ir_type *array) {
1506 assert(array && (array->type_op == type_array));
1507 free_entity(get_array_element_entity(array));
1510 void free_array_entities (ir_type *array) {
1511 assert(array && (array->type_op == type_array));
1514 void free_array_attrs (ir_type *array) {
1515 assert(array && (array->type_op == type_array));
1516 free(array->attr.aa.lower_bound);
1517 free(array->attr.aa.upper_bound);
1520 /* manipulate private fields of array ir_type */
1521 int get_array_n_dimensions (const ir_type *array) {
1522 assert(array && (array->type_op == type_array));
1523 return array->attr.aa.n_dimensions;
1527 set_array_bounds (ir_type *array, int dimension, ir_node * lower_bound,
1528 ir_node * upper_bound) {
1529 assert(array && (array->type_op == type_array));
1530 assert(lower_bound && "lower_bound node may not be NULL.");
1531 assert(upper_bound && "upper_bound node may not be NULL.");
1532 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1533 array->attr.aa.lower_bound[dimension] = lower_bound;
1534 array->attr.aa.upper_bound[dimension] = upper_bound;
1537 set_array_bounds_int (ir_type *array, int dimension, int lower_bound,
1539 ir_graph *rem = current_ir_graph;
1540 current_ir_graph = get_const_code_irg();
1541 set_array_bounds (array, dimension,
1542 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1543 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1544 current_ir_graph = rem;
1547 set_array_lower_bound (ir_type *array, int dimension, ir_node * lower_bound) {
1548 assert(array && (array->type_op == type_array));
1549 assert(lower_bound && "lower_bound node may not be NULL.");
1550 array->attr.aa.lower_bound[dimension] = lower_bound;
1552 void set_array_lower_bound_int (ir_type *array, int dimension, int lower_bound) {
1553 ir_graph *rem = current_ir_graph;
1554 current_ir_graph = get_const_code_irg();
1555 set_array_lower_bound (array, dimension,
1556 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1557 current_ir_graph = rem;
1560 set_array_upper_bound (ir_type *array, int dimension, ir_node * upper_bound) {
1561 assert(array && (array->type_op == type_array));
1562 assert(upper_bound && "upper_bound node may not be NULL.");
1563 array->attr.aa.upper_bound[dimension] = upper_bound;
1565 void set_array_upper_bound_int (ir_type *array, int dimension, int upper_bound) {
1566 ir_graph *rem = current_ir_graph;
1567 current_ir_graph = get_const_code_irg();
1568 set_array_upper_bound (array, dimension,
1569 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1570 current_ir_graph = rem;
1572 int has_array_lower_bound (const ir_type *array, int dimension) {
1573 assert(array && (array->type_op == type_array));
1574 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1576 ir_node *get_array_lower_bound (const ir_type *array, int dimension) {
1577 assert(array && (array->type_op == type_array));
1578 return array->attr.aa.lower_bound[dimension];
1580 long get_array_lower_bound_int (const ir_type *array, int dimension) {
1582 assert(array && (array->type_op == type_array));
1583 node = array->attr.aa.lower_bound[dimension];
1584 assert(get_irn_op(node) == op_Const);
1585 return get_tarval_long(get_Const_tarval(node));
1587 int has_array_upper_bound (const ir_type *array, int dimension) {
1588 assert(array && (array->type_op == type_array));
1589 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1591 ir_node * get_array_upper_bound (const ir_type *array, int dimension) {
1592 assert(array && (array->type_op == type_array));
1593 return array->attr.aa.upper_bound[dimension];
1595 long get_array_upper_bound_int (const ir_type *array, int dimension) {
1597 assert(array && (array->type_op == type_array));
1598 node = array->attr.aa.upper_bound[dimension];
1599 assert(get_irn_op(node) == op_Const);
1600 return get_tarval_long(get_Const_tarval(node));
1603 void set_array_order (ir_type *array, int dimension, int order) {
1604 assert(array && (array->type_op == type_array));
1605 array->attr.aa.order[dimension] = order;
1608 int get_array_order (const ir_type *array, int dimension) {
1609 assert(array && (array->type_op == type_array));
1610 return array->attr.aa.order[dimension];
1613 int find_array_dimension(const ir_type *array, int order) {
1616 assert(array && (array->type_op == type_array));
1618 for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
1619 if (array->attr.aa.order[dim] == order)
1625 void set_array_element_type (ir_type *array, ir_type *tp) {
1626 assert(array && (array->type_op == type_array));
1627 assert(!is_Method_type(tp));
1628 array->attr.aa.element_type = tp;
1630 ir_type *get_array_element_type (ir_type *array) {
1631 assert(array && (array->type_op == type_array));
1632 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1635 void set_array_element_entity (ir_type *array, entity *ent) {
1636 assert(array && (array->type_op == type_array));
1637 assert((get_entity_type(ent)->type_op != type_method));
1638 array->attr.aa.element_ent = ent;
1639 array->attr.aa.element_type = get_entity_type(ent);
1641 entity *get_array_element_entity (const ir_type *array) {
1642 assert(array && (array->type_op == type_array));
1643 return array->attr.aa.element_ent;
1647 int (is_Array_type)(const ir_type *array) {
1648 return _is_array_type(array);
1651 void set_array_size_bits(ir_type *tp, int size) {
1652 /* FIXME: Here we should make some checks with the element type size */
1655 /*-----------------------------------------------------------------*/
1656 /* TYPE_ENUMERATION */
1657 /*-----------------------------------------------------------------*/
1659 /* create a new type enumeration -- set the enumerators independently */
1660 ir_type *new_d_type_enumeration(ident *name, int n_enums, dbg_info *db) {
1661 ir_type *res = new_type(type_enumeration, NULL, name, db);
1663 res->attr.ea.n_enums = n_enums;
1664 res->attr.ea.enumer = xcalloc(n_enums, sizeof(res->attr.ea.enumer[0]));
1665 res->attr.ea.enum_nameid = xcalloc(n_enums, sizeof(res->attr.ea.enum_nameid[0]));
1670 ir_type *new_type_enumeration(ident *name, int n_enums) {
1671 return new_d_type_enumeration(name, n_enums, NULL);
1674 void free_enumeration_entities(ir_type *enumeration) {
1675 assert(enumeration && (enumeration->type_op == type_enumeration));
1677 void free_enumeration_attrs(ir_type *enumeration) {
1678 assert(enumeration && (enumeration->type_op == type_enumeration));
1679 free(enumeration->attr.ea.enumer);
1680 free(enumeration->attr.ea.enum_nameid);
1683 /* manipulate fields of enumeration type. */
1684 int get_enumeration_n_enums (const ir_type *enumeration) {
1685 assert(enumeration && (enumeration->type_op == type_enumeration));
1686 return enumeration->attr.ea.n_enums;
1688 void set_enumeration_enum (ir_type *enumeration, int pos, tarval *con) {
1689 assert(enumeration && (enumeration->type_op == type_enumeration));
1690 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1691 enumeration->attr.ea.enumer[pos] = con;
1693 tarval *get_enumeration_enum (const ir_type *enumeration, int pos) {
1694 assert(enumeration && (enumeration->type_op == type_enumeration));
1695 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1696 return enumeration->attr.ea.enumer[pos];
1698 void set_enumeration_nameid (ir_type *enumeration, int pos, ident *id) {
1699 assert(enumeration && (enumeration->type_op == type_enumeration));
1700 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1701 enumeration->attr.ea.enum_nameid[pos] = id;
1703 ident *get_enumeration_nameid (const ir_type *enumeration, int pos) {
1704 assert(enumeration && (enumeration->type_op == type_enumeration));
1705 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1706 return enumeration->attr.ea.enum_nameid[pos];
1708 const char *get_enumeration_name(const ir_type *enumeration, int pos) {
1709 assert(enumeration && (enumeration->type_op == type_enumeration));
1710 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1711 return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
1715 int (is_Enumeration_type)(const ir_type *enumeration) {
1716 return _is_enumeration_type(enumeration);
1719 void set_enumeration_mode(ir_type *tp, ir_mode *mode) {
1720 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1721 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1722 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1724 tp->size = get_mode_size_bits(mode);
1728 /*-----------------------------------------------------------------*/
1730 /*-----------------------------------------------------------------*/
1732 /* Create a new type pointer */
1733 ir_type *new_d_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode, dbg_info *db) {
1736 assert(mode_is_reference(ptr_mode));
1737 res = new_type(type_pointer, ptr_mode, name, db);
1738 res->attr.pa.points_to = points_to;
1739 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1740 res->size = get_mode_size_bits(res->mode);
1741 res->flags |= tf_layout_fixed;
1746 ir_type *new_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode) {
1747 return new_d_type_pointer(name, points_to, ptr_mode, NULL);
1750 void free_pointer_entities (ir_type *pointer) {
1751 assert(pointer && (pointer->type_op == type_pointer));
1754 void free_pointer_attrs (ir_type *pointer) {
1755 assert(pointer && (pointer->type_op == type_pointer));
1758 /* manipulate fields of type_pointer */
1759 void set_pointer_points_to_type (ir_type *pointer, ir_type *tp) {
1760 assert(pointer && (pointer->type_op == type_pointer));
1761 pointer->attr.pa.points_to = tp;
1764 ir_type *get_pointer_points_to_type (ir_type *pointer) {
1765 assert(pointer && (pointer->type_op == type_pointer));
1766 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1770 int (is_Pointer_type)(const ir_type *pointer) {
1771 return _is_pointer_type(pointer);
1774 void set_pointer_mode(ir_type *tp, ir_mode *mode) {
1775 assert(mode_is_reference(mode) && "Modes of pointers must be references");
1776 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1777 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1779 tp->size = get_mode_size_bits(mode);
1783 /* Returns the first pointer type that has as points_to tp.
1784 * Not efficient: O(#types).
1785 * If not found returns firm_unknown_type. */
1786 ir_type *find_pointer_type_to_type (ir_type *tp) {
1787 int i, n = get_irp_n_types();
1788 for (i = 0; i < n; ++i) {
1789 ir_type *found = get_irp_type(i);
1790 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1793 return firm_unknown_type;
1797 /*-----------------------------------------------------------------*/
1798 /* TYPE_PRIMITIVE */
1799 /*-----------------------------------------------------------------*/
1801 /* create a new type primitive */
1802 ir_type *new_d_type_primitive(ident *name, ir_mode *mode, dbg_info *db) {
1804 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1805 res = new_type(type_primitive, mode, name, db);
1806 res->size = get_mode_size_bits(mode);
1807 res->flags |= tf_layout_fixed;
1812 ir_type *new_type_primitive(ident *name, ir_mode *mode) {
1813 return new_d_type_primitive(name, mode, NULL);
1817 int (is_Primitive_type)(const ir_type *primitive) {
1818 return _is_primitive_type(primitive);
1821 void set_primitive_mode(ir_type *tp, ir_mode *mode) {
1822 /* Modes of primitives must be data */
1823 assert(mode_is_data(mode));
1825 /* For primitive size depends on the mode. */
1826 tp->size = get_mode_size_bits(mode);
1831 /*-----------------------------------------------------------------*/
1832 /* common functionality */
1833 /*-----------------------------------------------------------------*/
1836 int (is_atomic_type)(const ir_type *tp) {
1837 return _is_atomic_type(tp);
1841 * Gets the number of elements in a firm compound type.
1843 int get_compound_n_members(const ir_type *tp)
1845 const tp_op *op = get_type_tpop(tp);
1848 if (op->ops.get_n_members)
1849 res = op->ops.get_n_members(tp);
1851 assert(0 && "no member count for this type");
1857 * Gets the member of a firm compound type at position pos.
1859 entity *get_compound_member(const ir_type *tp, int pos)
1861 const tp_op *op = get_type_tpop(tp);
1864 if (op->ops.get_member)
1865 res = op->ops.get_member(tp, pos);
1867 assert(0 && "no members in this type");
1872 /* Returns index of member in tp, -1 if not contained. */
1873 int get_compound_member_index(const ir_type *tp, entity *member)
1875 const tp_op *op = get_type_tpop(tp);
1878 if (op->ops.get_member_index)
1879 index = op->ops.get_member_index(tp, member);
1881 assert(0 && "no members in this type");
1886 int is_compound_type(const ir_type *tp) {
1887 assert(tp && tp->kind == k_type);
1888 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
1891 /* Checks, whether a type is a frame ir_type */
1892 int is_frame_type(const ir_type *tp) {
1893 return tp->flags & tf_frame_type;
1896 /* Checks, whether a type is a lowered ir_type */
1897 int is_lowered_type(const ir_type *tp) {
1898 return tp->flags & tf_lowered_type;
1901 /* Makes a new frame type. */
1902 ir_type *new_type_frame(ident *name)
1904 ir_type *res = new_type_class(name);
1906 res->flags |= tf_frame_type;
1908 /* Remove type from type list. Must be treated differently than other types. */
1909 remove_irp_type(res);
1914 /* Sets a lowered type for a type. This sets both associations. */
1915 void set_lowered_type(ir_type *tp, ir_type *lowered_type) {
1916 assert(is_type(tp) && is_type(lowered_type));
1917 lowered_type->flags |= tf_lowered_type;
1918 tp->assoc_type = lowered_type;
1919 lowered_type->assoc_type = tp;
1923 * Gets the lowered/unlowered type of a type or NULL if this type
1924 * has no lowered/unlowered one.
1926 ir_type *get_associated_type(const ir_type *tp) {
1927 return tp->assoc_type;
1930 /* set the type size for the unknown and none ir_type */
1931 void set_default_size_bits(ir_type *tp, int size) {
1936 * Allocate an area of size bytes aligned at alignment
1937 * at the start or the end of a frame type.
1938 * The frame type must have already an fixed layout.
1940 entity *frame_alloc_area(type *frame_type, int size, int alignment, int at_start)
1946 int frame_align, i, offset, frame_size;
1947 static unsigned area_cnt = 0;
1948 static ir_type *a_byte = NULL;
1950 assert(is_frame_type(tp));
1951 assert(get_type_state(tp) == layout_fixed);
1954 a_byte = new_type_primitive(new_id_from_chars("byte", 4), mode_Bu);
1956 snprintf(buf, sizeof(buf), "area%u", area_cnt++);
1957 name = new_id_from_str(buf);
1959 /* align the size */
1960 frame_align = get_type_alignment_bytes(frame_type);
1961 size = (size + frame_align - 1) & -frame_align;
1963 tp = new_type_array(mangle_u(get_type_ident(frame_type), name), 1, a_byte);
1964 set_array_bounds_int(tp, 0, 0, size);
1965 set_type_alignment_bytes(tp, alignment);
1967 frame_size = get_type_size_bytes(frame_type);
1969 /* fix all offsets so far */
1970 for (i = get_class_n_members(frame_type) - 1; i >= 0; --i) {
1971 entity *ent = get_class_member(frame_type, i);
1973 set_entity_offset_bytes(ent, get_entity_offset_bytes(ent) + size);
1975 /* calculate offset and new type size */
1980 /* calculate offset and new type size */
1981 offset = (frame_size + alignment - 1) & -alignment;
1982 frame_size = offset + size;
1985 area = new_entity(frame_type, name, tp);
1986 set_entity_offset_bytes(area, offset);
1987 set_type_size_bytes(frame_type, frame_size);