2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of types.
23 * @author Goetz Lindenmaier, Michael Beck
27 * Implementation of the datastructure to hold
30 * This module supplies a datastructure to represent all types
31 * known in the compiled program. This includes types specified
32 * in the program as well as types defined by the language. In the
33 * view of the intermediate representation there is no difference
34 * between these types.
36 * There exist several kinds of types, arranged by the structure of
37 * the type. A type is described by a set of attributes. Some of
38 * these attributes are common to all types, others depend on the
41 * Types are different from the modes defined in irmode: Types are
42 * on the level of the programming language, modes at the level of
43 * the target processor.
66 ir_type *firm_none_type;
67 ir_type *get_none_type(void)
69 return firm_none_type;
72 ir_type *firm_code_type;
73 ir_type *get_code_type(void)
75 return firm_code_type;
78 ir_type *firm_unknown_type;
79 ir_type *get_unknown_type(void)
81 return firm_unknown_type;
84 /* Suffixes added to types used for pass-by-value representations. */
85 static ident *value_params_suffix = NULL;
86 static ident *value_ress_suffix = NULL;
88 void ir_init_type(void)
90 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
91 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
93 /* construct none and unknown type. */
94 firm_none_type = new_type(tpop_none, mode_BAD, NULL);
95 set_type_size_bytes(firm_none_type, 0);
96 set_type_state (firm_none_type, layout_fixed);
97 remove_irp_type(firm_none_type);
99 firm_code_type = new_type(tpop_code, mode_ANY, NULL);
100 set_type_state(firm_code_type, layout_fixed);
101 remove_irp_type(firm_code_type);
103 firm_unknown_type = new_type(tpop_unknown, mode_ANY, NULL);
104 set_type_size_bytes(firm_unknown_type, 0);
105 set_type_state (firm_unknown_type, layout_fixed);
106 remove_irp_type(firm_unknown_type);
109 void ir_finish_type(void)
111 if (firm_none_type != NULL) {
112 free_type(firm_none_type);
113 firm_none_type = NULL;
115 if (firm_code_type != NULL) {
116 free_type(firm_code_type);
117 firm_code_type = NULL;
119 if (firm_unknown_type != NULL) {
120 free_type(firm_unknown_type);
121 firm_unknown_type = NULL;
123 value_params_suffix = NULL;
124 value_ress_suffix = NULL;
127 /** the global type visited flag */
128 ir_visited_t firm_type_visited;
130 void (set_master_type_visited)(ir_visited_t val)
132 _set_master_type_visited(val);
135 ir_visited_t (get_master_type_visited)(void)
137 return _get_master_type_visited();
140 void (inc_master_type_visited)(void)
142 _inc_master_type_visited();
145 ir_type *new_type(const tp_op *type_op, ir_mode *mode, type_dbg_info *db)
150 node_size = offsetof(ir_type, attr) + type_op->attr_size;
151 res = (ir_type*)xmalloc(node_size);
152 memset(res, 0, node_size);
155 res->type_op = type_op;
157 res->visibility = ir_visibility_external;
158 res->flags = tf_none;
164 res->assoc_type = NULL;
166 res->nr = get_irp_new_node_nr();
167 #endif /* defined DEBUG_libfirm */
169 add_irp_type(res); /* Remember the new type global. */
174 void free_type(ir_type *tp)
176 const tp_op *op = get_type_tpop(tp);
178 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown)
179 || (get_type_tpop(tp) == tpop_code))
181 /* Remove from list of all types */
183 /* Free the attributes of the type. */
185 /* Free entities automatically allocated with the ir_type */
186 if (op->ops.free_auto_entities)
187 op->ops.free_auto_entities(tp);
188 /* And now the type itself... */
193 void free_type_entities(ir_type *tp)
195 const tp_op *tpop = get_type_tpop(tp);
197 if (tpop->ops.free_entities)
198 tpop->ops.free_entities(tp);
201 void free_type_attrs(ir_type *tp)
203 const tp_op *tpop = get_type_tpop(tp);
205 if (tpop->ops.free_attrs)
206 tpop->ops.free_attrs(tp);
209 void *(get_type_link)(const ir_type *tp)
211 return _get_type_link(tp);
214 void (set_type_link)(ir_type *tp, void *l)
216 _set_type_link(tp, l);
219 const tp_op *(get_type_tpop)(const ir_type *tp)
221 return _get_type_tpop(tp);
224 ident *(get_type_tpop_nameid)(const ir_type *tp)
226 return _get_type_tpop_nameid(tp);
229 const char* get_type_tpop_name(const ir_type *tp)
231 assert(tp && tp->kind == k_type);
232 return get_id_str(tp->type_op->name);
235 tp_opcode (get_type_tpop_code)(const ir_type *tp)
237 return _get_type_tpop_code(tp);
240 ir_mode *(get_type_mode)(const ir_type *tp)
242 return _get_type_mode(tp);
245 void set_type_mode(ir_type *tp, ir_mode *mode)
247 const tp_op *tpop = get_type_tpop(tp);
249 if (tpop->ops.set_type_mode)
250 tpop->ops.set_type_mode(tp, mode);
252 assert(0 && "setting a mode is NOT allowed for this type");
255 /* Outputs a unique number for this node */
256 long get_type_nr(const ir_type *tp)
262 return (long)PTR_TO_INT(tp);
266 unsigned (get_type_size_bytes)(const ir_type *tp)
268 return _get_type_size_bytes(tp);
271 ir_visibility get_type_visibility(const ir_type *tp)
274 return tp->visibility;
277 void set_type_visibility(ir_type *tp, ir_visibility v)
283 void set_type_size_bytes(ir_type *tp, unsigned size)
285 const tp_op *tpop = get_type_tpop(tp);
287 if (tpop->ops.set_type_size)
288 tpop->ops.set_type_size(tp, size);
290 assert(0 && "Cannot set size for this type");
293 unsigned get_type_alignment_bytes(ir_type *tp)
300 /* alignment NOT set calculate it "on demand" */
302 align = (get_mode_size_bits(tp->mode) + 7) >> 3;
303 else if (is_Array_type(tp))
304 align = get_type_alignment_bytes(get_array_element_type(tp));
305 else if (is_compound_type(tp)) {
306 size_t i, n = get_compound_n_members(tp);
309 for (i = 0; i < n; ++i) {
310 ir_type *t = get_entity_type(get_compound_member(tp, i));
311 unsigned a = get_type_alignment_bytes(t);
316 } else if (is_Method_type(tp)) {
326 void set_type_alignment_bytes(ir_type *tp, unsigned align)
328 assert(tp && tp->kind == k_type);
329 /* Methods don't have an alignment. */
330 if (tp->type_op != type_method) {
335 const char *get_type_state_name(ir_type_state s)
337 #define X(a) case a: return #a;
346 ir_type_state (get_type_state)(const ir_type *tp)
348 return _get_type_state(tp);
351 void set_type_state(ir_type *tp, ir_type_state state)
353 assert(tp && tp->kind == k_type);
355 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
356 (tp->type_op == type_method))
359 /* Just a correctness check: */
360 if (state == layout_fixed) {
362 switch (get_type_tpop_code(tp)) {
364 if (tp != get_glob_type()) {
365 size_t n_mem = get_class_n_members(tp);
366 for (i = 0; i < n_mem; i++) {
367 assert(get_entity_offset(get_class_member(tp, i)) > -1);
369 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
370 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
376 for (i = 0; i < get_struct_n_members(tp); i++) {
377 assert(get_entity_offset(get_struct_member(tp, i)) > -1);
386 Assure that only innermost dimension is dynamic? */
388 case tpo_enumeration: {
390 size_t n_enums = get_enumeration_n_enums(tp);
391 assert(get_type_mode(tp) != NULL);
392 for (i = 0; i < n_enums; ++i) {
393 ir_enum_const *ec = get_enumeration_const(tp, i);
394 ir_tarval *tv = get_enumeration_value(ec);
395 assert(tv != NULL && tv != tarval_bad);
403 if (state == layout_fixed)
404 tp->flags |= tf_layout_fixed;
406 tp->flags &= ~tf_layout_fixed;
409 ir_visited_t (get_type_visited)(const ir_type *tp)
411 return _get_type_visited(tp);
414 void (set_type_visited)(ir_type *tp, ir_visited_t num)
416 _set_type_visited(tp, num);
419 void (mark_type_visited)(ir_type *tp)
421 _mark_type_visited(tp);
424 int (type_visited)(const ir_type *tp)
426 return _type_visited(tp);
429 int (type_not_visited)(const ir_type *tp)
431 return _type_not_visited(tp);
434 type_dbg_info *(get_type_dbg_info)(const ir_type *tp)
436 return _get_type_dbg_info(tp);
439 void (set_type_dbg_info)(ir_type *tp, type_dbg_info *db)
441 _set_type_dbg_info(tp, db);
444 int (is_type)(const void *thing)
446 return _is_type(thing);
449 /* Checks whether two types are structural equal.*/
450 int equal_type(ir_type *typ1, ir_type *typ2)
457 if (typ1 == typ2) return 1;
459 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
460 typ1->name != typ2->name ||
461 (get_type_mode(typ1) != get_type_mode(typ2)) ||
462 (get_type_state(typ1) != get_type_state(typ2)))
464 if ((get_type_state(typ1) == layout_fixed) &&
465 (get_type_size_bytes(typ1) != get_type_size_bytes(typ2)))
468 switch (get_type_tpop_code(typ1)) {
470 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
471 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
472 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
473 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
474 /** Compare the members **/
475 m = ALLOCANZ(ir_entity*, get_class_n_members(typ1));
476 /* First sort the members of typ2 */
477 for (i = 0; i < get_class_n_members(typ1); i++) {
478 ir_entity *e1 = get_class_member(typ1, i);
479 for (j = 0; j < get_class_n_members(typ2); j++) {
480 ir_entity *e2 = get_class_member(typ2, j);
481 if (get_entity_name(e1) == get_entity_name(e2))
485 for (i = 0; i < get_class_n_members(typ1); i++) {
486 if (!m[i] || get_class_member(typ1, i) != m[i])
489 /** Compare the supertypes **/
490 t = ALLOCANZ(ir_type*, get_class_n_supertypes(typ1));
491 /* First sort the supertypes of typ2 */
492 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
493 ir_type *t1 = get_class_supertype(typ1, i);
494 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
495 ir_type *t2 = get_class_supertype(typ2, j);
496 if (t2->name == t1->name)
500 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
501 if (!t[i] || /* Found no counterpart */
502 get_class_supertype(typ1, i) != t[i])
508 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
509 m = ALLOCANZ(ir_entity*, get_struct_n_members(typ1));
510 /* First sort the members of lt */
511 for (i = 0; i < get_struct_n_members(typ1); i++) {
512 ir_entity *e1 = get_struct_member(typ1, i);
513 for (j = 0; j < get_struct_n_members(typ2); j++) {
514 ir_entity *e2 = get_struct_member(typ2, j);
515 if (get_entity_name(e1) == get_entity_name(e2))
519 for (i = 0; i < get_struct_n_members(typ1); i++) {
520 if (!m[i] || get_struct_member(typ1, i) != m[i])
529 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
530 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
531 if (get_method_calling_convention(typ1) !=
532 get_method_calling_convention(typ2)) return 0;
534 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
535 n_param1 = get_method_n_params(typ1);
536 n_param2 = get_method_n_params(typ2);
538 n_param1 = get_method_first_variadic_param_index(typ1);
539 n_param2 = get_method_first_variadic_param_index(typ2);
542 if (n_param1 != n_param2) return 0;
544 for (i = 0; i < n_param1; i++) {
545 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
548 for (i = 0; i < get_method_n_ress(typ1); i++) {
549 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
555 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
556 m = ALLOCANZ(ir_entity*, get_union_n_members(typ1));
557 /* First sort the members of lt */
558 for (i = 0; i < get_union_n_members(typ1); i++) {
559 ir_entity *e1 = get_union_member(typ1, i);
560 for (j = 0; j < get_union_n_members(typ2); j++) {
561 ir_entity *e2 = get_union_member(typ2, j);
562 if (get_entity_name(e1) == get_entity_name(e2))
566 for (i = 0; i < get_union_n_members(typ1); i++) {
567 if (!m[i] || get_union_member(typ1, i) != m[i])
573 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
575 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
577 for (i = 0; i < get_array_n_dimensions(typ1); i++) {
578 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
579 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
581 if (get_array_order(typ1, i) != get_array_order(typ2, i))
582 assert(0 && "type compare with different dimension orders not implemented");
586 case tpo_enumeration:
587 assert(0 && "enumerations not implemented");
591 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
603 int smaller_type(ir_type *st, ir_type *lt)
610 if (st == lt) return 1;
612 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
615 switch (get_type_tpop_code(st)) {
617 return is_SubClass_of(st, lt);
620 n_st_members = get_struct_n_members(st);
621 if (n_st_members != get_struct_n_members(lt))
624 m = ALLOCANZ(ir_entity*, n_st_members);
625 /* First sort the members of lt */
626 for (i = 0; i < n_st_members; ++i) {
627 ir_entity *se = get_struct_member(st, i);
628 size_t n = get_struct_n_members(lt);
629 for (j = 0; j < n; ++j) {
630 ir_entity *le = get_struct_member(lt, j);
631 if (get_entity_name(le) == get_entity_name(se))
635 for (i = 0; i < n_st_members; i++) {
636 if (!m[i] || /* Found no counterpart */
637 !smaller_type(get_entity_type(get_struct_member(st, i)), get_entity_type(m[i])))
643 size_t n_param1, n_param2;
645 /** FIXME: is this still 1? */
646 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
647 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
648 if (get_method_calling_convention(st) !=
649 get_method_calling_convention(lt)) return 0;
651 if (get_method_variadicity(st) == variadicity_non_variadic) {
652 n_param1 = get_method_n_params(st);
653 n_param2 = get_method_n_params(lt);
655 n_param1 = get_method_first_variadic_param_index(st);
656 n_param2 = get_method_first_variadic_param_index(lt);
659 if (n_param1 != n_param2) return 0;
661 for (i = 0; i < get_method_n_params(st); i++) {
662 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
665 for (i = 0; i < get_method_n_ress(st); i++) {
666 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
672 n_st_members = get_union_n_members(st);
673 if (n_st_members != get_union_n_members(lt)) return 0;
674 m = ALLOCANZ(ir_entity*, n_st_members);
675 /* First sort the members of lt */
676 for (i = 0; i < n_st_members; ++i) {
677 ir_entity *se = get_union_member(st, i);
678 size_t n = get_union_n_members(lt);
679 for (j = 0; j < n; ++j) {
680 ir_entity *le = get_union_member(lt, j);
681 if (get_entity_name(le) == get_entity_name(se))
685 for (i = 0; i < n_st_members; ++i) {
686 if (!m[i] || /* Found no counterpart */
687 !smaller_type(get_entity_type(get_union_member(st, i)), get_entity_type(m[i])))
693 ir_type *set, *let; /* small/large elt. ir_type */
694 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
696 set = get_array_element_type(st);
697 let = get_array_element_type(lt);
699 /* If the element types are different, set must be convertible
700 to let, and they must have the same size so that address
701 computations work out. To have a size the layout must
703 if ((get_type_state(set) != layout_fixed) ||
704 (get_type_state(let) != layout_fixed))
706 if (!smaller_type(set, let) ||
707 get_type_size_bytes(set) != get_type_size_bytes(let))
710 for (i = 0; i < get_array_n_dimensions(st); i++) {
711 if (get_array_lower_bound(lt, i))
712 if (get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
714 if (get_array_upper_bound(lt, i))
715 if (get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
720 case tpo_enumeration:
721 assert(0 && "enumerations not implemented");
725 if (!smaller_type(get_pointer_points_to_type(st), get_pointer_points_to_type(lt)))
730 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
740 ir_type *new_d_type_class(ident *name, type_dbg_info *db)
744 res = new_type(type_class, NULL, db);
747 res->attr.ca.members = NEW_ARR_F (ir_entity *, 0);
748 res->attr.ca.subtypes = NEW_ARR_F (ir_type *, 0);
749 res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
750 res->attr.ca.peculiarity = peculiarity_existent;
751 res->attr.ca.type_info = NULL;
752 res->attr.ca.vtable_size = 0;
753 res->attr.ca.clss_flags = cf_none;
754 res->attr.ca.dfn = 0;
759 ir_type *new_type_class(ident *name)
761 return new_d_type_class(name, NULL);
764 void free_class_entities(ir_type *clss)
767 assert(clss && (clss->type_op == type_class));
768 /* we must iterate backward here */
769 for (i = get_class_n_members(clss); i > 0;)
770 free_entity(get_class_member(clss, --i));
771 /* do NOT free the type info here. It belongs to another class */
774 void free_class_attrs(ir_type *clss)
776 assert(clss && (clss->type_op == type_class));
777 DEL_ARR_F(clss->attr.ca.members);
778 DEL_ARR_F(clss->attr.ca.subtypes);
779 DEL_ARR_F(clss->attr.ca.supertypes);
782 ident *get_class_ident(const ir_type *clss)
784 assert(clss->type_op == type_class);
788 const char *get_class_name(const ir_type *clss)
790 if (get_class_ident(clss) == NULL)
792 return get_id_str(get_class_ident(clss));
795 static void add_class_member(ir_type *clss, ir_entity *member)
797 assert(clss && (clss->type_op == type_class));
798 assert(clss != get_entity_type(member) && "recursive type");
799 ARR_APP1 (ir_entity *, clss->attr.ca.members, member);
802 size_t (get_class_n_members)(const ir_type *clss)
804 return _get_class_n_members(clss);
807 size_t get_class_member_index(const ir_type *clss, ir_entity *mem)
810 assert(clss && (clss->type_op == type_class));
811 for (i = 0, n = get_class_n_members(clss); i < n; ++i) {
812 if (get_class_member(clss, i) == mem)
815 return INVALID_MEMBER_INDEX;
818 ir_entity *(get_class_member)(const ir_type *clss, size_t pos)
820 return _get_class_member(clss, pos);
823 ir_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 ir_entity *mem = get_class_member(clss, i);
830 if (get_entity_ident(mem) == name)
836 static void remove_class_member(ir_type *clss, ir_entity *member)
839 assert(clss && (clss->type_op == type_class));
840 for (i = 0; i < ARR_LEN(clss->attr.ca.members); ++i) {
841 if (clss->attr.ca.members[i] == member) {
842 for (; i < ARR_LEN(clss->attr.ca.members) - 1; ++i)
843 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
844 ARR_SETLEN(ir_entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
850 void add_class_subtype(ir_type *clss, ir_type *subtype)
853 assert(clss->type_op == type_class);
854 ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
855 for (i = 0; i < get_class_n_supertypes(subtype); i++) {
856 if (get_class_supertype(subtype, i) == clss)
857 /* Class already registered */
860 ARR_APP1(ir_type *, subtype->attr.ca.supertypes, clss);
863 size_t get_class_n_subtypes(const ir_type *clss)
865 assert(clss->type_op == type_class);
866 return ARR_LEN (clss->attr.ca.subtypes);
869 ir_type *get_class_subtype(ir_type *clss, size_t pos)
871 assert(clss->type_op == type_class);
872 assert(pos < get_class_n_subtypes(clss));
873 return clss->attr.ca.subtypes[pos];
876 size_t get_class_subtype_index(ir_type *clss, const ir_type *subclass)
878 size_t 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)
887 void set_class_subtype(ir_type *clss, ir_type *subtype, size_t pos)
889 assert(clss->type_op == type_class);
890 assert(pos < get_class_n_subtypes(clss));
891 clss->attr.ca.subtypes[pos] = subtype;
894 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(ir_type*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
908 void add_class_supertype(ir_type *clss, ir_type *supertype)
912 assert(clss && (clss->type_op == type_class));
913 assert(supertype && (supertype -> type_op == type_class));
914 ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
915 for (i = 0, n = get_class_n_subtypes(supertype); i < n; ++i) {
916 if (get_class_subtype(supertype, i) == clss)
917 /* Class already registered */
920 ARR_APP1(ir_type *, supertype->attr.ca.subtypes, clss);
923 size_t get_class_n_supertypes(const ir_type *clss)
925 assert(clss->type_op == type_class);
926 return ARR_LEN(clss->attr.ca.supertypes);
929 size_t get_class_supertype_index(ir_type *clss, ir_type *super_clss)
931 size_t i, n_supertypes = get_class_n_supertypes(clss);
932 assert(super_clss && (super_clss->type_op == type_class));
933 for (i = 0; i < n_supertypes; i++) {
934 if (get_class_supertype(clss, i) == super_clss)
940 ir_type *get_class_supertype(ir_type *clss, size_t pos)
942 assert(clss->type_op == type_class);
943 assert(pos < get_class_n_supertypes(clss));
944 return clss->attr.ca.supertypes[pos];
947 void set_class_supertype(ir_type *clss, ir_type *supertype, size_t pos)
949 assert(clss->type_op == type_class);
950 assert(pos < get_class_n_supertypes(clss));
951 clss->attr.ca.supertypes[pos] = supertype;
954 void remove_class_supertype(ir_type *clss, ir_type *supertype)
957 assert(clss && (clss->type_op == type_class));
958 for (i = 0; i < ARR_LEN(clss->attr.ca.supertypes); ++i) {
959 if (clss->attr.ca.supertypes[i] == supertype) {
960 for (; i < ARR_LEN(clss->attr.ca.supertypes) - 1; ++i)
961 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
962 ARR_SETLEN(ir_type*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
968 ir_entity *get_class_type_info(const ir_type *clss)
970 return clss->attr.ca.type_info;
973 void set_class_type_info(ir_type *clss, ir_entity *ent)
975 clss->attr.ca.type_info = ent;
977 ent->repr_class = clss;
980 ir_peculiarity get_class_peculiarity(const ir_type *clss)
982 assert(clss && (clss->type_op == type_class));
983 return clss->attr.ca.peculiarity;
986 void set_class_peculiarity(ir_type *clss, ir_peculiarity pec)
988 assert(clss && (clss->type_op == type_class));
989 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
990 clss->attr.ca.peculiarity = pec;
993 unsigned (get_class_vtable_size)(const ir_type *clss)
995 return _get_class_vtable_size(clss);
998 void (set_class_vtable_size)(ir_type *clss, unsigned size)
1000 _set_class_vtable_size(clss, size);
1003 int (is_class_final)(const ir_type *clss)
1005 return _is_class_final(clss);
1008 void (set_class_final)(ir_type *clss, int flag)
1010 _set_class_final(clss, flag);
1013 int (is_class_interface)(const ir_type *clss)
1015 return _is_class_interface(clss);
1018 void (set_class_interface)(ir_type *clss, int flag)
1020 _set_class_interface(clss, flag);
1023 int (is_class_abstract)(const ir_type *clss)
1025 return _is_class_abstract(clss);
1028 void (set_class_abstract)(ir_type *clss, int final)
1030 _set_class_abstract(clss, final);
1033 void set_class_dfn(ir_type *clss, int dfn)
1035 clss->attr.ca.dfn = dfn;
1038 int get_class_dfn(const ir_type *clss)
1040 return (clss->attr.ca.dfn);
1043 int (is_Class_type)(const ir_type *clss)
1045 return _is_class_type(clss);
1048 void set_class_mode(ir_type *tp, ir_mode *mode)
1050 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1051 assert(get_type_state(tp) == layout_fixed &&
1052 tp->size == get_mode_size_bytes(mode) && "mode don't match class layout");
1056 void set_class_size(ir_type *tp, unsigned size)
1062 ir_type *new_d_type_struct(ident *name, type_dbg_info *db)
1064 ir_type *res = new_type(type_struct, NULL, db);
1067 res->attr.sa.members = NEW_ARR_F(ir_entity *, 0);
1072 ir_type *new_type_struct(ident *name)
1074 return new_d_type_struct (name, NULL);
1077 void free_struct_entities(ir_type *strct)
1080 assert(strct && (strct->type_op == type_struct));
1081 /* we must iterate backward here */
1082 for (i = get_struct_n_members(strct); i > 0;)
1083 free_entity(get_struct_member(strct, --i));
1086 void free_struct_attrs(ir_type *strct)
1088 assert(strct && (strct->type_op == type_struct));
1089 DEL_ARR_F(strct->attr.sa.members);
1092 ident *get_struct_ident(const ir_type *strct)
1094 assert(strct->type_op == type_struct);
1098 const char *get_struct_name(const ir_type *strct)
1100 if (get_struct_ident(strct) == NULL)
1102 return get_id_str(get_struct_ident(strct));
1105 size_t get_struct_n_members(const ir_type *strct)
1107 assert(strct->type_op == type_struct);
1108 return ARR_LEN(strct->attr.sa.members);
1111 static void add_struct_member(ir_type *strct, ir_entity *member)
1113 assert(strct && (strct->type_op == type_struct));
1114 assert(get_type_tpop(get_entity_type(member)) != type_method);
1115 assert(strct != get_entity_type(member) && "recursive type");
1116 ARR_APP1 (ir_entity *, strct->attr.sa.members, member);
1119 ir_entity *get_struct_member(const ir_type *strct, size_t pos)
1121 assert(strct && (strct->type_op == type_struct));
1122 assert(pos < get_struct_n_members(strct));
1123 return strct->attr.sa.members[pos];
1126 size_t get_struct_member_index(const ir_type *strct, ir_entity *mem)
1129 assert(strct && (strct->type_op == type_struct));
1130 for (i = 0, n = get_struct_n_members(strct); i < n; ++i) {
1131 if (get_struct_member(strct, i) == mem)
1137 static void remove_struct_member(ir_type *strct, ir_entity *member)
1140 assert(strct && (strct->type_op == type_struct));
1141 for (i = 0; i < ARR_LEN(strct->attr.sa.members); ++i) {
1142 if (strct->attr.sa.members[i] == member) {
1143 for (; i < ARR_LEN(strct->attr.sa.members) - 1; ++i)
1144 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1145 ARR_SETLEN(ir_entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1151 int (is_Struct_type)(const ir_type *strct)
1153 return _is_struct_type(strct);
1156 void set_struct_mode(ir_type *tp, ir_mode *mode)
1158 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1159 assert(get_type_state(tp) == layout_fixed &&
1160 tp->size == get_mode_size_bytes(mode) && "mode don't match struct layout");
1164 void set_struct_size(ir_type *tp, unsigned size)
1171 * Lazy construction of value argument / result representation.
1172 * Constructs a struct type and its member. The types of the members
1173 * are passed in the argument list.
1175 * @param name name of the type constructed
1176 * @param len number of fields
1177 * @param tps array of field types with length len
1179 static ir_type *build_value_type(char const* name, size_t len, tp_ent_pair *tps)
1182 ir_type *res = new_type_struct(new_id_from_str(name));
1183 res->flags |= tf_value_param_type;
1184 /* Remove type from type list. Must be treated differently than other types. */
1185 remove_irp_type(res);
1186 for (i = 0; i < len; ++i) {
1187 ident *id = tps[i].param_name;
1189 /* use res as default if corresponding type is not yet set. */
1190 ir_type *elt_type = tps[i].tp ? tps[i].tp : res;
1192 /* use the parameter name if specified */
1194 id = new_id_from_str("elt");
1196 tps[i].ent = new_entity(res, id, elt_type);
1197 set_entity_allocation(tps[i].ent, allocation_parameter);
1202 ir_type *new_d_type_method(size_t n_param, size_t n_res, type_dbg_info *db)
1206 assert((get_mode_size_bits(mode_P_code) % 8 == 0) && "unorthodox modes not implemented");
1207 res = new_type(type_method, mode_P_code, db);
1208 res->flags |= tf_layout_fixed;
1209 res->size = get_mode_size_bytes(mode_P_code);
1210 res->attr.ma.n_params = n_param;
1211 res->attr.ma.params = XMALLOCNZ(tp_ent_pair, n_param);
1212 res->attr.ma.value_params = NULL;
1213 res->attr.ma.n_res = n_res;
1214 res->attr.ma.res_type = XMALLOCNZ(tp_ent_pair, n_res);
1215 res->attr.ma.value_ress = NULL;
1216 res->attr.ma.variadicity = variadicity_non_variadic;
1217 res->attr.ma.first_variadic_param = -1;
1218 res->attr.ma.additional_properties = mtp_no_property;
1223 ir_type *new_type_method(size_t n_param, size_t n_res)
1225 return new_d_type_method(n_param, n_res, NULL);
1228 ir_type *clone_type_method(ir_type *tp)
1236 assert(is_Method_type(tp));
1239 n_params = tp->attr.ma.n_params;
1240 n_res = tp->attr.ma.n_res;
1243 res = new_type(type_method, mode, db);
1245 res->flags = tp->flags;
1246 res->assoc_type = tp->assoc_type;
1247 res->size = tp->size;
1248 res->attr.ma.n_params = n_params;
1249 res->attr.ma.params = XMALLOCN(tp_ent_pair, n_params);
1250 memcpy(res->attr.ma.params, tp->attr.ma.params, n_params * sizeof(res->attr.ma.params[0]));
1251 res->attr.ma.value_params = tp->attr.ma.value_params;
1252 res->attr.ma.n_res = n_res;
1253 res->attr.ma.res_type = XMALLOCN(tp_ent_pair, n_res);
1254 memcpy(res->attr.ma.res_type, tp->attr.ma.res_type, n_res * sizeof(res->attr.ma.res_type[0]));
1255 res->attr.ma.value_ress = tp->attr.ma.value_ress;
1256 res->attr.ma.variadicity = tp->attr.ma.variadicity;
1257 res->attr.ma.first_variadic_param = tp->attr.ma.first_variadic_param;
1258 res->attr.ma.additional_properties = tp->attr.ma.additional_properties;
1259 res->attr.ma.irg_calling_conv = tp->attr.ma.irg_calling_conv;
1264 void free_method_entities(ir_type *method)
1267 assert(method && (method->type_op == type_method));
1270 void free_method_attrs(ir_type *method)
1272 assert(method && (method->type_op == type_method));
1273 free(method->attr.ma.params);
1274 free(method->attr.ma.res_type);
1275 /* cannot free it yet, type could be cloned ...
1276 if (method->attr.ma.value_params) {
1277 free_type_entities(method->attr.ma.value_params);
1278 free_type(method->attr.ma.value_params);
1281 if (method->attr.ma.value_ress) {
1282 free_type_entities(method->attr.ma.value_ress);
1283 free_type(method->attr.ma.value_ress);
1287 size_t (get_method_n_params)(const ir_type *method)
1289 return _get_method_n_params(method);
1292 ir_type *get_method_param_type(ir_type *method, size_t pos)
1295 assert(method->type_op == type_method);
1296 assert(pos < get_method_n_params(method));
1297 res = method->attr.ma.params[pos].tp;
1298 assert(res != NULL && "empty method param type");
1302 void set_method_param_type(ir_type *method, size_t pos, ir_type *tp)
1304 assert(method->type_op == type_method);
1305 assert(pos < get_method_n_params(method));
1306 method->attr.ma.params[pos].tp = tp;
1307 /* If information constructed set pass-by-value representation. */
1308 if (method->attr.ma.value_params) {
1309 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1310 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1314 ident *get_method_param_ident(ir_type *method, size_t pos)
1316 assert(method->type_op == type_method);
1317 assert(pos < get_method_n_params(method));
1318 return method->attr.ma.params[pos].param_name;
1321 const char *get_method_param_name(ir_type *method, size_t pos)
1323 ident *id = get_method_param_ident(method, pos);
1324 return id ? get_id_str(id) : NULL;
1327 void set_method_param_ident(ir_type *method, size_t pos, ident *id)
1329 assert(method->type_op == type_method);
1330 assert(pos < get_method_n_params(method));
1331 method->attr.ma.params[pos].param_name = id;
1334 ir_entity *get_method_value_param_ent(ir_type *method, size_t pos)
1336 assert(method && (method->type_op == type_method));
1337 assert(pos < get_method_n_params(method));
1339 if (!method->attr.ma.value_params) {
1340 /* parameter value type not created yet, build */
1341 method->attr.ma.value_params = build_value_type("<value param>",
1342 get_method_n_params(method), method->attr.ma.params);
1345 * build_value_type() sets the method->attr.ma.value_params type as default if
1348 assert((get_entity_type(method->attr.ma.params[pos].ent) != method->attr.ma.value_params)
1349 && "param type not yet set");
1350 return method->attr.ma.params[pos].ent;
1353 void set_method_value_param_type(ir_type *method, ir_type *tp)
1358 assert(method && (method->type_op == type_method));
1359 assert(is_value_param_type(tp));
1360 assert(get_method_n_params(method) == get_struct_n_members(tp));
1362 method->attr.ma.value_params = tp;
1364 n = get_struct_n_members(tp);
1365 for (i = 0; i < n; i++) {
1366 ir_entity *ent = get_struct_member(tp, i);
1367 method->attr.ma.params[i].ent = ent;
1371 ir_type *get_method_value_param_type(const ir_type *method)
1373 assert(method && (method->type_op == type_method));
1374 return method->attr.ma.value_params;
1377 size_t (get_method_n_ress)(const ir_type *method)
1379 return _get_method_n_ress(method);
1382 ir_type *get_method_res_type(ir_type *method, size_t pos)
1385 assert(method->type_op == type_method);
1386 assert(pos < get_method_n_ress(method));
1387 res = method->attr.ma.res_type[pos].tp;
1388 assert(res != NULL && "empty method return type");
1392 void set_method_res_type(ir_type *method, size_t pos, ir_type *tp)
1394 assert(method->type_op == type_method);
1395 assert(pos < get_method_n_ress(method));
1396 /* set the result ir_type */
1397 method->attr.ma.res_type[pos].tp = tp;
1398 /* If information constructed set pass-by-value representation. */
1399 if (method->attr.ma.value_ress) {
1400 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1401 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1405 ir_entity *get_method_value_res_ent(ir_type *method, size_t pos)
1407 assert(method->type_op == type_method);
1408 assert(pos < get_method_n_ress(method));
1410 if (!method->attr.ma.value_ress) {
1411 /* result value type not created yet, build */
1412 method->attr.ma.value_ress = build_value_type("<value result>",
1413 get_method_n_ress(method), method->attr.ma.res_type);
1416 * build_value_type() sets the method->attr.ma.value_ress type as default if
1419 assert((get_entity_type(method->attr.ma.res_type[pos].ent) != method->attr.ma.value_ress)
1420 && "result type not yet set");
1422 return method->attr.ma.res_type[pos].ent;
1425 ir_type *get_method_value_res_type(const ir_type *method)
1427 assert(method->type_op == type_method);
1428 return method->attr.ma.value_ress;
1431 const char *get_variadicity_name(ir_variadicity vari)
1433 #define X(a) case a: return #a
1435 X(variadicity_non_variadic);
1436 X(variadicity_variadic);
1443 ir_variadicity get_method_variadicity(const ir_type *method)
1445 assert(method && (method->type_op == type_method));
1446 return method->attr.ma.variadicity;
1449 void set_method_variadicity(ir_type *method, ir_variadicity vari)
1451 assert(method && (method->type_op == type_method));
1452 method->attr.ma.variadicity = vari;
1455 size_t get_method_first_variadic_param_index(const ir_type *method)
1457 assert(method->type_op == type_method);
1459 if (method->attr.ma.variadicity == variadicity_non_variadic)
1462 if (method->attr.ma.first_variadic_param == (size_t)-1)
1463 return get_method_n_params(method);
1464 return method->attr.ma.first_variadic_param;
1467 void set_method_first_variadic_param_index(ir_type *method, size_t index)
1469 assert(method->type_op == type_method);
1470 assert(index <= get_method_n_params(method));
1472 method->attr.ma.first_variadic_param = index;
1475 mtp_additional_properties (get_method_additional_properties)(const ir_type *method)
1477 return _get_method_additional_properties(method);
1480 void (set_method_additional_properties)(ir_type *method, mtp_additional_properties mask)
1482 _set_method_additional_properties(method, mask);
1485 void (add_method_additional_properties)(ir_type *method,
1486 mtp_additional_properties flag)
1488 _add_method_additional_properties(method, flag);
1491 unsigned (get_method_calling_convention)(const ir_type *method)
1493 return _get_method_calling_convention(method);
1496 void (set_method_calling_convention)(ir_type *method, unsigned cc_mask)
1498 _set_method_calling_convention(method, cc_mask);
1501 unsigned get_method_n_regparams(ir_type *method)
1503 unsigned cc = get_method_calling_convention(method);
1504 assert(IS_FASTCALL(cc));
1506 return cc & ~cc_bits;
1509 void set_method_n_regparams(ir_type *method, unsigned n_regs)
1511 unsigned cc = get_method_calling_convention(method);
1512 assert(IS_FASTCALL(cc));
1514 set_method_calling_convention(method, (cc & cc_bits) | (n_regs & ~cc_bits));
1517 int (is_Method_type)(const ir_type *method)
1519 return _is_method_type(method);
1523 ir_type *new_d_type_union(ident *name, type_dbg_info *db)
1525 ir_type *res = new_type(type_union, NULL, db);
1528 res->attr.ua.members = NEW_ARR_F(ir_entity *, 0);
1533 ir_type *new_type_union(ident *name)
1535 return new_d_type_union(name, NULL);
1538 void free_union_entities(ir_type *uni)
1541 assert(uni && (uni->type_op == type_union));
1542 /* we must iterate backward here */
1543 for (i = get_union_n_members(uni); i > 0;)
1544 free_entity(get_union_member(uni, --i));
1547 void free_union_attrs(ir_type *uni)
1549 assert(uni && (uni->type_op == type_union));
1550 DEL_ARR_F(uni->attr.ua.members);
1553 ident *get_union_ident(const ir_type *uni)
1555 assert(uni->type_op == type_union);
1559 const char *get_union_name(const ir_type *uni)
1561 if (get_union_ident(uni) == NULL)
1563 return get_id_str(get_union_ident(uni));
1566 size_t get_union_n_members(const ir_type *uni)
1568 assert(uni->type_op == type_union);
1569 return ARR_LEN(uni->attr.ua.members);
1572 static void add_union_member(ir_type *uni, ir_entity *member)
1574 assert(uni->type_op == type_union);
1575 assert(uni != get_entity_type(member) && "recursive type");
1576 ARR_APP1(ir_entity *, uni->attr.ua.members, member);
1579 ir_entity *get_union_member(const ir_type *uni, size_t pos)
1581 assert(uni->type_op == type_union);
1582 assert(pos < get_union_n_members(uni));
1583 return uni->attr.ua.members[pos];
1586 size_t get_union_member_index(const ir_type *uni, ir_entity *mem)
1589 assert(uni && (uni->type_op == type_union));
1590 for (i = 0, n = get_union_n_members(uni); i < n; ++i) {
1591 if (get_union_member(uni, i) == mem)
1597 static void remove_union_member(ir_type *uni, ir_entity *member)
1600 assert(uni && (uni->type_op == type_union));
1601 for (i = 0; i < ARR_LEN(uni->attr.ua.members); ++i) {
1602 if (uni->attr.ua.members[i] == member) {
1603 for (; i < ARR_LEN(uni->attr.ua.members) - 1; i++)
1604 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1605 ARR_SETLEN(ir_entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1611 int (is_Union_type)(const ir_type *uni)
1613 return _is_union_type(uni);
1616 void set_union_size(ir_type *tp, unsigned size)
1623 ir_type *new_d_type_array(int n_dimensions, ir_type *element_type,
1629 ir_graph *irg = get_const_code_irg();
1631 assert(!is_Method_type(element_type));
1633 res = new_type(type_array, NULL, db);
1634 res->attr.aa.n_dimensions = n_dimensions;
1635 res->attr.aa.lower_bound = XMALLOCNZ(ir_node*, n_dimensions);
1636 res->attr.aa.upper_bound = XMALLOCNZ(ir_node*, n_dimensions);
1637 res->attr.aa.order = XMALLOCNZ(int, n_dimensions);
1639 unk = new_r_Unknown(irg, mode_Iu);
1640 for (i = 0; i < n_dimensions; i++) {
1641 res->attr.aa.lower_bound[i] =
1642 res->attr.aa.upper_bound[i] = unk;
1643 res->attr.aa.order[i] = i;
1646 res->attr.aa.element_type = element_type;
1647 res->attr.aa.element_ent
1648 = new_entity(NULL, new_id_from_chars("elem_ent", 8), element_type);
1649 res->attr.aa.element_ent->owner = res;
1655 ir_type *new_type_array(int n_dimensions, ir_type *element_type)
1657 return new_d_type_array(n_dimensions, element_type, NULL);
1660 void free_array_automatic_entities(ir_type *array)
1662 assert(array && (array->type_op == type_array));
1663 free_entity(get_array_element_entity(array));
1666 void free_array_entities(ir_type *array)
1669 assert(array->type_op == type_array);
1672 void free_array_attrs(ir_type *array)
1674 assert(array->type_op == type_array);
1675 free(array->attr.aa.lower_bound);
1676 free(array->attr.aa.upper_bound);
1677 free(array->attr.aa.order);
1680 /* manipulate private fields of array ir_type */
1681 size_t get_array_n_dimensions(const ir_type *array)
1683 assert(array->type_op == type_array);
1684 return array->attr.aa.n_dimensions;
1687 void set_array_bounds(ir_type *array, size_t dimension, ir_node *lower_bound,
1688 ir_node *upper_bound)
1690 assert(array && (array->type_op == type_array));
1691 assert(lower_bound && "lower_bound node may not be NULL.");
1692 assert(upper_bound && "upper_bound node may not be NULL.");
1693 assert(dimension < array->attr.aa.n_dimensions);
1694 array->attr.aa.lower_bound[dimension] = lower_bound;
1695 array->attr.aa.upper_bound[dimension] = upper_bound;
1698 void set_array_bounds_int(ir_type *array, size_t dimension, int lower_bound,
1701 ir_graph *irg = get_const_code_irg();
1702 set_array_bounds(array, dimension,
1703 new_r_Const_long(irg, mode_Iu, lower_bound),
1704 new_r_Const_long(irg, mode_Iu, upper_bound));
1707 void set_array_lower_bound(ir_type *array, size_t dimension,
1708 ir_node *lower_bound)
1710 assert(array && (array->type_op == type_array));
1711 assert(lower_bound && "lower_bound node may not be NULL.");
1712 array->attr.aa.lower_bound[dimension] = lower_bound;
1715 void set_array_lower_bound_int(ir_type *array, size_t dimension, int lower_bound)
1717 ir_graph *irg = get_const_code_irg();
1718 set_array_lower_bound(array, dimension,
1719 new_r_Const_long(irg, mode_Iu, lower_bound));
1722 void set_array_upper_bound(ir_type *array, size_t dimension, ir_node *upper_bound)
1724 assert(array && (array->type_op == type_array));
1725 assert(upper_bound && "upper_bound node may not be NULL.");
1726 array->attr.aa.upper_bound[dimension] = upper_bound;
1729 void set_array_upper_bound_int(ir_type *array, size_t dimension, int upper_bound)
1731 ir_graph *irg = get_const_code_irg();
1732 set_array_upper_bound(array, dimension,
1733 new_r_Const_long(irg, mode_Iu, upper_bound));
1736 int has_array_lower_bound(const ir_type *array, size_t dimension)
1738 assert(array && (array->type_op == type_array));
1739 return !is_Unknown(array->attr.aa.lower_bound[dimension]);
1742 ir_node *get_array_lower_bound(const ir_type *array, size_t dimension)
1744 assert(array && (array->type_op == type_array));
1745 return array->attr.aa.lower_bound[dimension];
1748 long get_array_lower_bound_int(const ir_type *array, size_t dimension)
1751 assert(array && (array->type_op == type_array));
1752 node = array->attr.aa.lower_bound[dimension];
1753 assert(is_Const(node));
1754 return get_tarval_long(get_Const_tarval(node));
1757 int has_array_upper_bound(const ir_type *array, size_t dimension)
1759 assert(array && (array->type_op == type_array));
1760 return !is_Unknown(array->attr.aa.upper_bound[dimension]);
1763 ir_node *get_array_upper_bound(const ir_type *array, size_t dimension)
1765 assert(array && (array->type_op == type_array));
1766 return array->attr.aa.upper_bound[dimension];
1769 long get_array_upper_bound_int(const ir_type *array, size_t dimension)
1772 assert(array && (array->type_op == type_array));
1773 node = array->attr.aa.upper_bound[dimension];
1774 assert(is_Const(node));
1775 return get_tarval_long(get_Const_tarval(node));
1778 void set_array_order(ir_type *array, size_t dimension, int order)
1780 assert(array && (array->type_op == type_array));
1781 array->attr.aa.order[dimension] = order;
1784 int get_array_order(const ir_type *array, size_t dimension)
1786 assert(array && (array->type_op == type_array));
1787 return array->attr.aa.order[dimension];
1790 size_t find_array_dimension(const ir_type *array, int order)
1794 assert(array->type_op == type_array);
1796 for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
1797 if (array->attr.aa.order[dim] == order)
1803 void set_array_element_type(ir_type *array, ir_type *tp)
1805 assert(array && (array->type_op == type_array));
1806 assert(!is_Method_type(tp));
1807 array->attr.aa.element_type = tp;
1810 ir_type *get_array_element_type(const ir_type *array)
1812 assert(array && (array->type_op == type_array));
1813 return array->attr.aa.element_type;
1816 void set_array_element_entity(ir_type *array, ir_entity *ent)
1818 assert(array && (array->type_op == type_array));
1819 assert((get_entity_type(ent)->type_op != type_method));
1820 array->attr.aa.element_ent = ent;
1821 array->attr.aa.element_type = get_entity_type(ent);
1824 ir_entity *get_array_element_entity(const ir_type *array)
1826 assert(array && (array->type_op == type_array));
1827 return array->attr.aa.element_ent;
1830 int (is_Array_type)(const ir_type *array)
1832 return _is_array_type(array);
1835 void set_array_size(ir_type *tp, unsigned size)
1837 /* FIXME: Here we should make some checks with the element type size */
1842 ir_type *new_d_type_enumeration(ident *name, size_t n_enums, type_dbg_info *db)
1846 res = new_type(type_enumeration, NULL, db);
1848 res->attr.ea.enumer = NEW_ARR_F(ir_enum_const, n_enums);
1853 ir_type *new_type_enumeration(ident *name, size_t n_enums)
1855 return new_d_type_enumeration(name, n_enums, NULL);
1858 void free_enumeration_entities(ir_type *enumeration)
1861 assert(enumeration->type_op == type_enumeration);
1864 void free_enumeration_attrs(ir_type *enumeration)
1866 assert(enumeration->type_op == type_enumeration);
1867 DEL_ARR_F(enumeration->attr.ea.enumer);
1870 ident *get_enumeration_ident(const ir_type *enumeration)
1872 assert(enumeration->type_op == type_enumeration);
1873 return enumeration->name;
1876 const char *get_enumeration_name(const ir_type *enumeration)
1878 if (get_enumeration_ident(enumeration) == NULL)
1880 return get_id_str(get_enumeration_ident(enumeration));
1883 size_t get_enumeration_n_enums(const ir_type *enumeration)
1885 assert(enumeration->type_op == type_enumeration);
1886 return ARR_LEN(enumeration->attr.ea.enumer);
1889 void set_enumeration_const(ir_type *enumeration, size_t pos, ident *nameid,
1892 assert(pos < ARR_LEN(enumeration->attr.ea.enumer));
1893 enumeration->attr.ea.enumer[pos].nameid = nameid;
1894 enumeration->attr.ea.enumer[pos].value = con;
1895 enumeration->attr.ea.enumer[pos].owner = enumeration;
1898 ir_enum_const *get_enumeration_const(const ir_type *enumeration, size_t pos)
1900 assert(enumeration->type_op == type_enumeration);
1901 assert(pos < get_enumeration_n_enums(enumeration));
1902 return &enumeration->attr.ea.enumer[pos];
1905 ir_type *get_enumeration_owner(const ir_enum_const *enum_cnst)
1907 return enum_cnst->owner;
1910 void set_enumeration_value(ir_enum_const *enum_cnst, ir_tarval *con)
1912 enum_cnst->value = con;
1915 ir_tarval *get_enumeration_value(const ir_enum_const *enum_cnst)
1917 return enum_cnst->value;
1920 void set_enumeration_nameid(ir_enum_const *enum_cnst, ident *id)
1922 enum_cnst->nameid = id;
1925 ident *get_enumeration_const_nameid(const ir_enum_const *enum_cnst)
1927 return enum_cnst->nameid;
1930 const char *get_enumeration_const_name(const ir_enum_const *enum_cnst)
1932 return get_id_str(enum_cnst->nameid);
1935 int (is_Enumeration_type)(const ir_type *enumeration)
1937 return _is_enumeration_type(enumeration);
1940 void set_enumeration_mode(ir_type *tp, ir_mode *mode)
1942 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1943 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1944 assert((get_mode_size_bits(mode) % 8) == 0 && "unorthodox modes not implemented");
1946 tp->size = get_mode_size_bytes(mode);
1952 ir_type *new_d_type_pointer(ir_type *points_to, type_dbg_info *db)
1957 if (is_Method_type(points_to) || is_code_type(points_to)) {
1963 res = new_type(type_pointer, mode, db);
1964 res->attr.pa.points_to = points_to;
1965 assert((get_mode_size_bits(res->mode) % 8 == 0) && "unorthodox modes not implemented");
1966 res->size = get_mode_size_bytes(res->mode);
1967 res->flags |= tf_layout_fixed;
1972 ir_type *new_type_pointer(ir_type *points_to)
1974 return new_d_type_pointer(points_to, NULL);
1977 void free_pointer_entities(ir_type *pointer)
1980 assert(pointer && (pointer->type_op == type_pointer));
1983 void free_pointer_attrs(ir_type *pointer)
1986 assert(pointer && (pointer->type_op == type_pointer));
1989 void set_pointer_points_to_type(ir_type *pointer, ir_type *tp)
1991 assert(pointer && (pointer->type_op == type_pointer));
1992 pointer->attr.pa.points_to = tp;
1995 ir_type *get_pointer_points_to_type(const ir_type *pointer)
1997 assert(pointer && (pointer->type_op == type_pointer));
1998 return pointer->attr.pa.points_to;
2001 int (is_Pointer_type)(const ir_type *pointer)
2003 return _is_pointer_type(pointer);
2006 void set_pointer_mode(ir_type *tp, ir_mode *mode)
2008 assert(mode_is_reference(mode) && "Modes of pointers must be references");
2009 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
2010 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
2012 tp->size = get_mode_size_bytes(mode);
2016 ir_type *find_pointer_type_to_type(ir_type *tp)
2018 size_t i, n = get_irp_n_types();
2019 for (i = 0; i < n; ++i) {
2020 ir_type *found = get_irp_type(i);
2021 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
2024 return firm_unknown_type;
2029 ir_type *new_d_type_primitive(ir_mode *mode, type_dbg_info *db)
2031 ir_type *res = new_type(type_primitive, mode, db);
2032 res->size = get_mode_size_bytes(mode);
2033 res->flags |= tf_layout_fixed;
2034 res->attr.ba.base_type = NULL;
2039 ir_type *new_type_primitive(ir_mode *mode)
2041 return new_d_type_primitive(mode, NULL);
2044 int (is_Primitive_type)(const ir_type *primitive)
2046 return _is_primitive_type(primitive);
2049 void set_primitive_mode(ir_type *tp, ir_mode *mode)
2051 /* Modes of primitives must be data */
2052 assert(mode_is_data(mode));
2054 /* For primitive size depends on the mode. */
2055 tp->size = get_mode_size_bytes(mode);
2059 ir_type *get_primitive_base_type(const ir_type *tp)
2061 assert(is_Primitive_type(tp));
2062 return tp->attr.ba.base_type;
2065 void set_primitive_base_type(ir_type *tp, ir_type *base_tp)
2067 assert(is_Primitive_type(tp));
2068 tp->attr.ba.base_type = base_tp;
2073 int (is_atomic_type)(const ir_type *tp)
2075 return _is_atomic_type(tp);
2078 size_t get_compound_n_members(const ir_type *tp)
2080 const tp_op *op = get_type_tpop(tp);
2081 return op->ops.get_n_members(tp);
2084 ir_entity *get_compound_member(const ir_type *tp, size_t pos)
2086 const tp_op *op = get_type_tpop(tp);
2087 return op->ops.get_member(tp, pos);
2090 size_t get_compound_member_index(const ir_type *tp, ir_entity *member)
2092 const tp_op *op = get_type_tpop(tp);
2093 return op->ops.get_member_index(tp, member);
2096 int is_compound_type(const ir_type *tp)
2098 assert(tp->kind == k_type);
2099 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
2102 ident *get_compound_ident(const ir_type *tp)
2104 assert(is_compound_type(tp));
2108 const char *get_compound_name(const ir_type *tp)
2110 if (get_compound_ident(tp) == NULL)
2112 return get_id_str(get_compound_ident(tp));
2115 void remove_compound_member(ir_type *compound, ir_entity *entity)
2117 switch (get_type_tpop_code(compound)) {
2118 case tpo_class: remove_class_member(compound, entity); break;
2119 case tpo_struct: remove_struct_member(compound, entity); break;
2120 case tpo_union: remove_union_member(compound, entity); break;
2122 panic("argument for remove_compound_member not a compound type");
2126 void add_compound_member(ir_type *compound, ir_entity *entity)
2128 switch (get_type_tpop_code(compound)) {
2129 case tpo_class: add_class_member(compound, entity); break;
2130 case tpo_struct: add_struct_member(compound, entity); break;
2131 case tpo_union: add_union_member(compound, entity); break;
2133 panic("argument for add_compound_member not a compound type");
2139 int is_code_type(const ir_type *tp)
2141 assert(tp && tp->kind == k_type);
2142 return tp->type_op == tpop_code;
2145 int is_frame_type(const ir_type *tp)
2147 return tp->flags & tf_frame_type;
2150 int is_value_param_type(const ir_type *tp)
2152 return tp->flags & tf_value_param_type;
2155 int is_lowered_type(const ir_type *tp)
2157 return tp->flags & tf_lowered_type;
2160 ir_type *new_type_value(void)
2162 ir_type *res = new_type_struct(new_id_from_str("<value_type>"));
2164 res->flags |= tf_value_param_type;
2166 /* Remove type from type list. Must be treated differently than other types. */
2167 remove_irp_type(res);
2172 ir_type *new_type_frame(void)
2174 ir_type *res = new_type_class(new_id_from_str("<frame_type>"));
2176 res->flags |= tf_frame_type;
2178 /* Remove type from type list. Must be treated differently than other types. */
2179 remove_irp_type(res);
2181 /* It is not possible to derive from the frame type. Set the final flag. */
2182 set_class_final(res, 1);
2187 ir_type *clone_frame_type(ir_type *type)
2192 assert(is_frame_type(type));
2193 /* the entity link resource should be allocated if this function is called */
2194 assert(irp_resources_reserved(irp) & IR_RESOURCE_ENTITY_LINK);
2196 res = new_type_frame();
2197 for (i = 0, n = get_class_n_members(type); i < n; ++i) {
2198 ir_entity *ent = get_class_member(type, i);
2199 ir_entity *nent = copy_entity_own(ent, res);
2200 set_entity_link(ent, nent);
2201 set_entity_link(nent, ent);
2206 void set_lowered_type(ir_type *tp, ir_type *lowered_type)
2208 assert(is_type(tp) && is_type(lowered_type));
2209 lowered_type->flags |= tf_lowered_type;
2210 tp->assoc_type = lowered_type;
2211 lowered_type->assoc_type = tp;
2214 ir_type *get_associated_type(const ir_type *tp)
2216 return tp->assoc_type;
2219 void set_default_size(ir_type *tp, unsigned size)
2224 void default_layout_compound_type(ir_type *type)
2227 size_t n = get_compound_n_members(type);
2229 unsigned align_all = 1;
2231 for (i = 0; i < n; ++i) {
2232 ir_entity *entity = get_compound_member(type, i);
2233 ir_type *entity_type = get_entity_type(entity);
2237 if (is_Method_type(entity_type))
2240 assert(get_type_state(entity_type) == layout_fixed);
2241 align = get_type_alignment_bytes(entity_type);
2242 align_all = align > align_all ? align : align_all;
2243 misalign = (align ? size % align : 0);
2244 size += (misalign ? align - misalign : 0);
2246 set_entity_offset(entity, size);
2247 if (!is_Union_type(type)) {
2248 size += get_type_size_bytes(entity_type);
2251 if (align_all > 0 && size % align_all) {
2252 size += align_all - (size % align_all);
2254 if (align_all > get_type_alignment_bytes(type)) {
2255 set_type_alignment_bytes(type, align_all);
2257 set_type_size_bytes(type, size);
2258 set_type_state(type, layout_fixed);
2261 ir_entity *frame_alloc_area(ir_type *frame_type, int size, unsigned alignment,
2268 unsigned frame_align;
2269 int offset, frame_size;
2270 static unsigned area_cnt = 0;
2271 static ir_type *a_byte = NULL;
2273 assert(is_frame_type(frame_type));
2274 assert(get_type_state(frame_type) == layout_fixed);
2275 assert(get_type_alignment_bytes(frame_type) > 0);
2276 set_type_state(frame_type, layout_undefined);
2279 a_byte = new_type_primitive(mode_Bu);
2281 snprintf(buf, sizeof(buf), "area%u", area_cnt++);
2282 name = new_id_from_str(buf);
2284 /* align the size */
2285 frame_align = get_type_alignment_bytes(frame_type);
2286 size = (size + frame_align - 1) & ~(frame_align - 1);
2288 tp = new_type_array(1, a_byte);
2289 set_array_bounds_int(tp, 0, 0, size);
2290 set_type_alignment_bytes(tp, alignment);
2292 frame_size = get_type_size_bytes(frame_type);
2295 /* fix all offsets so far */
2296 for (i = 0, n = get_class_n_members(frame_type); i < n; ++i) {
2297 ir_entity *ent = get_class_member(frame_type, i);
2299 set_entity_offset(ent, get_entity_offset(ent) + size);
2301 /* calculate offset and new type size */
2305 /* increase size to match alignment... */
2306 if (alignment > frame_align) {
2307 frame_align = alignment;
2308 set_type_alignment_bytes(frame_type, frame_align);
2309 frame_size = (frame_size + frame_align - 1) & ~(frame_align - 1);
2312 /* calculate offset and new type size */
2313 offset = (frame_size + alignment - 1) & ~(alignment - 1);
2314 frame_size = offset + size;
2317 area = new_entity(frame_type, name, tp);
2318 set_entity_offset(area, offset);
2319 set_type_size_bytes(frame_type, frame_size);
2321 /* mark this entity as compiler generated */
2322 set_entity_compiler_generated(area, 1);
2324 set_type_state(frame_type, layout_fixed);
2328 void ir_print_type(char *buffer, size_t buffer_size, const ir_type *type)
2332 type_dbg_info *tdbgi = get_type_dbg_info(type);
2333 if (tdbgi != NULL) {
2334 ir_retrieve_type_dbg_info(buffer, buffer_size, tdbgi);
2338 /* we have to construct some name... */
2339 switch (get_type_tpop_code(type)) {
2340 case tpo_uninitialized:
2343 snprintf(buffer, buffer_size, "code");
2347 id = get_class_ident(type);
2348 snprintf(buffer, buffer_size, "class '%s'", get_id_str(id));
2352 id = get_struct_ident(type);
2353 snprintf(buffer, buffer_size, "struct '%s'", get_id_str(id));
2357 id = get_union_ident(type);
2358 snprintf(buffer, buffer_size, "union '%s'", get_id_str(id));
2361 case tpo_enumeration:
2362 id = get_enumeration_ident(type);
2363 snprintf(buffer, buffer_size, "enumeration '%s'", get_id_str(id));
2367 snprintf(buffer, buffer_size, "unknown type");
2371 p = snprintf(buffer, buffer_size, "pointer to ");
2374 ir_print_type(buffer, buffer_size, get_pointer_points_to_type(type));
2378 p = snprintf(buffer, buffer_size, "array of ");
2381 ir_print_type(buffer, buffer_size, get_array_element_type(type));
2385 id = get_mode_ident(get_type_mode(type));
2386 snprintf(buffer, buffer_size, "%s", get_id_str(id));
2390 snprintf(buffer, buffer_size, "none");
2393 /* TODO: we should print argument and return types here... */
2394 snprintf(buffer, buffer_size, "method type");
2397 snprintf(buffer, buffer_size, "invalid type");