2 * Copyright (C) 1995-2008 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.
45 * @see type_t.h type tpop
67 /*-----------------------------------------------------------------*/
69 /*-----------------------------------------------------------------*/
71 ir_type *firm_none_type; ir_type *get_none_type(void) { return firm_none_type; }
72 ir_type *firm_unknown_type; ir_type *get_unknown_type(void) { return firm_unknown_type; }
75 /* Suffixes added to types used for pass-by-value representations. */
76 static ident *value_params_suffix = NULL;
77 static ident *value_ress_suffix = NULL;
79 /** The default calling convention for method types. */
80 static unsigned default_cc_mask;
82 /* return the default calling convention for method types */
83 unsigned get_default_cc_mask(void) {
84 return default_cc_mask;
87 /* Initialize the type module. */
88 void firm_init_type(dbg_info *builtin_db, unsigned def_cc_mask) {
89 default_cc_mask = def_cc_mask;
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, new_id_from_str("type_none"), builtin_db);
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_unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"), builtin_db);
100 set_type_size_bytes(firm_unknown_type, 0);
101 set_type_state (firm_unknown_type, layout_fixed);
102 remove_irp_type(firm_unknown_type);
105 /** the global type visited flag */
106 ir_visited_t firm_type_visited;
108 void (set_master_type_visited)(ir_visited_t val) { _set_master_type_visited(val); }
109 ir_visited_t (get_master_type_visited)(void) { return _get_master_type_visited(); }
110 void (inc_master_type_visited)(void) { _inc_master_type_visited(); }
113 * Creates a new type representation.
116 new_type(tp_op *type_op, ir_mode *mode, ident *name, dbg_info *db) {
120 assert(type_op != type_id);
121 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
123 node_size = offsetof(ir_type, attr) + type_op->attr_size;
124 res = xmalloc(node_size);
125 memset(res, 0, node_size);
128 res->type_op = type_op;
131 res->visibility = visibility_external_allocated;
132 res->flags = tf_none;
138 res->assoc_type = NULL;
140 res->nr = get_irp_new_node_nr();
141 #endif /* defined DEBUG_libfirm */
143 add_irp_type(res); /* Remember the new type global. */
148 void free_type(ir_type *tp) {
149 const tp_op *op = get_type_tpop(tp);
151 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
153 /* Remove from list of all types */
155 /* Free the attributes of the type. */
157 /* Free entities automatically allocated with the ir_type */
158 if (op->ops.free_auto_entities)
159 op->ops.free_auto_entities(tp);
160 /* And now the type itself... */
165 void free_type_entities(ir_type *tp) {
166 const tp_op *tpop = get_type_tpop(tp);
168 if (tpop->ops.free_entities)
169 tpop->ops.free_entities(tp);
172 void free_type_attrs(ir_type *tp) {
173 const tp_op *tpop = get_type_tpop(tp);
175 if (tpop->ops.free_attrs)
176 tpop->ops.free_attrs(tp);
179 /* set/get the link field */
180 void *(get_type_link)(const ir_type *tp) {
181 return _get_type_link(tp);
184 void (set_type_link)(ir_type *tp, void *l) {
185 _set_type_link(tp, l);
188 const tp_op *(get_type_tpop)(const ir_type *tp) {
189 return _get_type_tpop(tp);
192 ident *(get_type_tpop_nameid)(const ir_type *tp) {
193 return _get_type_tpop_nameid(tp);
196 const char* get_type_tpop_name(const ir_type *tp) {
197 assert(tp && tp->kind == k_type);
198 return get_id_str(tp->type_op->name);
201 tp_opcode (get_type_tpop_code)(const ir_type *tp) {
202 return _get_type_tpop_code(tp);
205 ir_mode *(get_type_mode)(const ir_type *tp) {
206 return _get_type_mode(tp);
209 void set_type_mode(ir_type *tp, ir_mode *mode) {
210 const tp_op *tpop = get_type_tpop(tp);
212 if (tpop->ops.set_type_mode)
213 tpop->ops.set_type_mode(tp, mode);
215 assert(0 && "setting a mode is NOT allowed for this type");
218 ident *(get_type_ident)(const ir_type *tp) {
219 return _get_type_ident(tp);
222 void (set_type_ident)(ir_type *tp, ident* id) {
223 _set_type_ident(tp, id);
226 /* Outputs a unique number for this node */
227 long get_type_nr(const ir_type *tp) {
232 return (long)PTR_TO_INT(tp);
236 const char *get_type_name(const ir_type *tp) {
237 assert(tp && tp->kind == k_type);
238 return (get_id_str(tp->name));
241 unsigned (get_type_size_bytes)(const ir_type *tp) {
242 return _get_type_size_bytes(tp);
245 ir_visibility get_type_visibility(const ir_type *tp) {
247 visibility res = visibility_local;
248 if (is_compound_type(tp)) {
250 if (is_Array_type(tp)) {
251 ir_entity *mem = get_array_element_entity(tp);
252 if (get_entity_visibility(mem) != visibility_local)
253 res = visibility_external_visible;
255 int i, n_mems = get_compound_n_members(tp);
256 for (i = 0; i < n_mems; ++i) {
257 ir_entity *mem = get_compound_member(tp, i);
258 if (get_entity_visibility(mem) != visibility_local)
259 res = visibility_external_visible;
266 return tp->visibility;
269 void set_type_visibility(ir_type *tp, ir_visibility v) {
272 /* check for correctness */
273 if (v != visibility_external_allocated) {
274 visibility res = visibility_local;
275 if (is_compound_type(tp)) {
276 if (is_Array_type(tp)) {
277 ir_entity *mem = get_array_element_entity(tp);
278 if (get_entity_visibility(mem) > res)
279 res = get_entity_visibility(mem);
281 int i, n_mems = get_compound_n_members(tp);
282 for (i = 0; i < n_mems; ++i) {
283 ir_entity *mem = get_compound_member(tp, i);
284 if (get_entity_visibility(mem) > res)
285 res = get_entity_visibility(mem);
296 set_type_size_bytes(ir_type *tp, unsigned size) {
297 const tp_op *tpop = get_type_tpop(tp);
299 if (tpop->ops.set_type_size)
300 tpop->ops.set_type_size(tp, size);
302 assert(0 && "Cannot set size for this type");
305 unsigned get_type_alignment_bytes(ir_type *tp) {
311 /* alignment NOT set calculate it "on demand" */
313 align = (get_mode_size_bits(tp->mode) + 7) >> 3;
314 else if (is_Array_type(tp))
315 align = get_type_alignment_bytes(get_array_element_type(tp));
316 else if (is_compound_type(tp)) {
317 int i, n = get_compound_n_members(tp);
320 for (i = 0; i < n; ++i) {
321 ir_type *t = get_entity_type(get_compound_member(tp, i));
322 unsigned a = get_type_alignment_bytes(t);
327 } else if (is_Method_type(tp)) {
338 set_type_alignment_bytes(ir_type *tp, unsigned align) {
339 assert(tp && tp->kind == k_type);
340 /* Methods don't have an alignment. */
341 if (tp->type_op != type_method) {
346 /* Returns a human readable string for the enum entry. */
347 const char *get_type_state_name(ir_type_state s) {
348 #define X(a) case a: return #a;
358 ir_type_state (get_type_state)(const ir_type *tp) {
359 return _get_type_state(tp);
363 set_type_state(ir_type *tp, ir_type_state state) {
364 assert(tp && tp->kind == k_type);
366 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
367 (tp->type_op == type_method))
370 /* Just a correctness check: */
371 if (state == layout_fixed) {
373 switch (get_type_tpop_code(tp)) {
375 if (tp != get_glob_type()) {
376 int n_mem = get_class_n_members(tp);
377 for (i = 0; i < n_mem; i++) {
378 assert(get_entity_offset(get_class_member(tp, i)) > -1);
380 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
381 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
387 for (i = 0; i < get_struct_n_members(tp); i++) {
388 assert(get_entity_offset(get_struct_member(tp, i)) > -1);
389 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
398 Assure that only innermost dimension is dynamic? */
400 case tpo_enumeration:
402 assert(get_type_mode != NULL);
403 for (i = get_enumeration_n_enums(tp) - 1; i >= 0; --i) {
404 ir_enum_const *ec = get_enumeration_const(tp, i);
405 tarval *tv = get_enumeration_value(ec);
406 assert(tv != NULL && tv != tarval_bad);
413 if (state == layout_fixed)
414 tp->flags |= tf_layout_fixed;
416 tp->flags &= ~tf_layout_fixed;
419 ir_visited_t (get_type_visited)(const ir_type *tp) {
420 return _get_type_visited(tp);
423 void (set_type_visited)(ir_type *tp, ir_visited_t num) {
424 _set_type_visited(tp, num);
427 /* Sets visited field in type to type_visited. */
428 void (mark_type_visited)(ir_type *tp) {
429 _mark_type_visited(tp);
432 int (type_visited)(const ir_type *tp) {
433 return _type_visited(tp);
436 int (type_not_visited)(const ir_type *tp) {
437 return _type_not_visited(tp);
440 dbg_info *(get_type_dbg_info)(const ir_type *tp) {
441 return _get_type_dbg_info(tp);
444 void (set_type_dbg_info)(ir_type *tp, dbg_info *db) {
445 _set_type_dbg_info(tp, db);
448 int (is_type)(const void *thing) {
449 return _is_type(thing);
452 /* Checks whether two types are structural equal.*/
453 int equal_type(ir_type *typ1, ir_type *typ2) {
458 if (typ1 == typ2) return 1;
460 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
461 (get_type_ident(typ1) != get_type_ident(typ2)) ||
462 (get_type_mode(typ1) != get_type_mode(typ2)) ||
463 (get_type_state(typ1) != get_type_state(typ2)))
465 if ((get_type_state(typ1) == layout_fixed) &&
466 (get_type_size_bytes(typ1) != get_type_size_bytes(typ2)))
469 switch (get_type_tpop_code(typ1)) {
471 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
472 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
473 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
474 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
475 /** Compare the members **/
476 m = ALLOCANZ(ir_entity*, get_class_n_members(typ1));
477 /* First sort the members of typ2 */
478 for (i = 0; i < get_class_n_members(typ1); i++) {
479 ir_entity *e1 = get_class_member(typ1, i);
480 for (j = 0; j < get_class_n_members(typ2); j++) {
481 ir_entity *e2 = get_class_member(typ2, j);
482 if (get_entity_name(e1) == get_entity_name(e2))
486 for (i = 0; i < get_class_n_members(typ1); i++) {
487 if (!m[i] || /* Found no counterpart */
488 !equal_entity(get_class_member(typ1, i), m[i]))
491 /** Compare the supertypes **/
492 t = ALLOCANZ(ir_type*, get_class_n_supertypes(typ1));
493 /* First sort the supertypes of typ2 */
494 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
495 ir_type *t1 = get_class_supertype(typ1, i);
496 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
497 ir_type *t2 = get_class_supertype(typ2, j);
498 if (get_type_ident(t2) == get_type_ident(t1))
502 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
503 if (!t[i] || /* Found no counterpart */
504 get_class_supertype(typ1, i) != t[i])
510 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
511 m = ALLOCANZ(ir_entity*, get_struct_n_members(typ1));
512 /* First sort the members of lt */
513 for (i = 0; i < get_struct_n_members(typ1); i++) {
514 ir_entity *e1 = get_struct_member(typ1, i);
515 for (j = 0; j < get_struct_n_members(typ2); j++) {
516 ir_entity *e2 = get_struct_member(typ2, j);
517 if (get_entity_name(e1) == get_entity_name(e2))
521 for (i = 0; i < get_struct_n_members(typ1); i++) {
522 if (!m[i] || /* Found no counterpart */
523 !equal_entity(get_struct_member(typ1, i), m[i]))
529 int n_param1, n_param2;
531 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
532 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
533 if (get_method_calling_convention(typ1) !=
534 get_method_calling_convention(typ2)) return 0;
536 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
537 n_param1 = get_method_n_params(typ1);
538 n_param2 = get_method_n_params(typ2);
540 n_param1 = get_method_first_variadic_param_index(typ1);
541 n_param2 = get_method_first_variadic_param_index(typ2);
544 if (n_param1 != n_param2) return 0;
546 for (i = 0; i < n_param1; i++) {
547 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
550 for (i = 0; i < get_method_n_ress(typ1); i++) {
551 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
557 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
558 m = ALLOCANZ(ir_entity*, get_union_n_members(typ1));
559 /* First sort the members of lt */
560 for (i = 0; i < get_union_n_members(typ1); i++) {
561 ir_entity *e1 = get_union_member(typ1, i);
562 for (j = 0; j < get_union_n_members(typ2); j++) {
563 ir_entity *e2 = get_union_member(typ2, j);
564 if (get_entity_name(e1) == get_entity_name(e2))
568 for (i = 0; i < get_union_n_members(typ1); i++) {
569 if (!m[i] || /* Found no counterpart */
570 !equal_entity(get_union_member(typ1, i), m[i]))
576 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
578 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
580 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
581 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
582 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
584 if (get_array_order(typ1, i) != get_array_order(typ2, i))
585 assert(0 && "type compare with different dimension orders not implemented");
589 case tpo_enumeration:
590 assert(0 && "enumerations not implemented");
594 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
606 /* Checks whether two types are structural comparable. */
607 int smaller_type(ir_type *st, ir_type *lt) {
609 int i, j, n_st_members;
611 if (st == lt) return 1;
613 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
616 switch(get_type_tpop_code(st)) {
618 return is_SubClass_of(st, lt);
621 n_st_members = get_struct_n_members(st);
622 if (n_st_members != get_struct_n_members(lt))
625 m = ALLOCANZ(ir_entity*, n_st_members);
626 /* First sort the members of lt */
627 for (i = 0; i < n_st_members; ++i) {
628 ir_entity *se = get_struct_member(st, i);
629 int n = get_struct_n_members(lt);
630 for (j = 0; j < n; ++j) {
631 ir_entity *le = get_struct_member(lt, j);
632 if (get_entity_name(le) == get_entity_name(se))
636 for (i = 0; i < n_st_members; i++) {
637 if (!m[i] || /* Found no counterpart */
638 !smaller_type(get_entity_type(get_struct_member(st, i)), get_entity_type(m[i])))
644 int n_param1, n_param2;
646 /** FIXME: is this still 1? */
647 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
648 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
649 if (get_method_calling_convention(st) !=
650 get_method_calling_convention(lt)) return 0;
652 if (get_method_variadicity(st) == variadicity_non_variadic) {
653 n_param1 = get_method_n_params(st);
654 n_param2 = get_method_n_params(lt);
656 n_param1 = get_method_first_variadic_param_index(st);
657 n_param2 = get_method_first_variadic_param_index(lt);
660 if (n_param1 != n_param2) return 0;
662 for (i = 0; i < get_method_n_params(st); i++) {
663 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
666 for (i = 0; i < get_method_n_ress(st); i++) {
667 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
673 n_st_members = get_union_n_members(st);
674 if (n_st_members != get_union_n_members(lt)) return 0;
675 m = ALLOCANZ(ir_entity*, n_st_members);
676 /* First sort the members of lt */
677 for (i = 0; i < n_st_members; ++i) {
678 ir_entity *se = get_union_member(st, i);
679 int n = get_union_n_members(lt);
680 for (j = 0; j < n; ++j) {
681 ir_entity *le = get_union_member(lt, j);
682 if (get_entity_name(le) == get_entity_name(se))
686 for (i = 0; i < n_st_members; ++i) {
687 if (!m[i] || /* Found no counterpart */
688 !smaller_type(get_entity_type(get_union_member(st, i)), get_entity_type(m[i])))
694 ir_type *set, *let; /* small/large elt. ir_type */
695 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
697 set = get_array_element_type(st);
698 let = get_array_element_type(lt);
700 /* If the element types are different, set must be convertible
701 to let, and they must have the same size so that address
702 computations work out. To have a size the layout must
704 if ((get_type_state(set) != layout_fixed) ||
705 (get_type_state(let) != layout_fixed))
707 if (!smaller_type(set, let) ||
708 get_type_size_bytes(set) != get_type_size_bytes(let))
711 for(i = 0; i < get_array_n_dimensions(st); i++) {
712 if (get_array_lower_bound(lt, i))
713 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
715 if (get_array_upper_bound(lt, i))
716 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
721 case tpo_enumeration:
722 assert(0 && "enumerations not implemented");
726 if (!smaller_type(get_pointer_points_to_type(st), get_pointer_points_to_type(lt)))
731 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
740 /*-----------------------------------------------------------------*/
742 /*-----------------------------------------------------------------*/
744 /* create a new class ir_type */
745 ir_type *new_d_type_class (ident *name, dbg_info *db) {
748 res = new_type(type_class, NULL, name, db);
750 res->attr.ca.members = NEW_ARR_F (ir_entity *, 0);
751 res->attr.ca.subtypes = NEW_ARR_F (ir_type *, 0);
752 res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
753 res->attr.ca.peculiarity = peculiarity_existent;
754 res->attr.ca.type_info = NULL;
755 res->attr.ca.vtable_size = 0;
756 res->attr.ca.clss_flags = cf_none;
757 res->attr.ca.dfn = 0;
762 ir_type *new_type_class (ident *name) {
763 return new_d_type_class (name, NULL);
766 /* free all entities of a class */
767 void free_class_entities(ir_type *clss) {
769 assert(clss && (clss->type_op == type_class));
770 for (i = get_class_n_members(clss) - 1; i >= 0; --i)
771 free_entity(get_class_member(clss, i));
772 /* do NOT free the type info here. It belongs to another class */
775 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 /* manipulate private fields of class type */
783 void add_class_member(ir_type *clss, ir_entity *member) {
784 assert(clss && (clss->type_op == type_class));
785 assert(clss != get_entity_type(member) && "recursive type");
786 assert(get_type_state(clss) != layout_fixed);
787 ARR_APP1 (ir_entity *, clss->attr.ca.members, member);
790 int (get_class_n_members)(const ir_type *clss) {
791 return _get_class_n_members(clss);
794 int get_class_member_index(const ir_type *clss, ir_entity *mem) {
796 assert(clss && (clss->type_op == type_class));
797 for (i = 0, n = get_class_n_members(clss); i < n; ++i)
798 if (get_class_member(clss, i) == mem)
803 ir_entity *(get_class_member)(const ir_type *clss, int pos) {
804 return _get_class_member(clss, pos);
807 ir_entity *get_class_member_by_name(ir_type *clss, ident *name) {
809 assert(clss && (clss->type_op == type_class));
810 n_mem = get_class_n_members(clss);
811 for (i = 0; i < n_mem; ++i) {
812 ir_entity *mem = get_class_member(clss, i);
813 if (get_entity_ident(mem) == name) return mem;
818 void set_class_member(ir_type *clss, ir_entity *member, int pos) {
819 assert(clss && (clss->type_op == type_class));
820 assert(pos >= 0 && pos < get_class_n_members(clss));
821 clss->attr.ca.members[pos] = member;
824 void set_class_members(ir_type *clss, ir_entity **members, int arity) {
826 assert(clss && (clss->type_op == type_class));
827 DEL_ARR_F(clss->attr.ca.members);
828 clss->attr.ca.members = NEW_ARR_F(ir_entity *, 0);
829 for (i = 0; i < arity; ++i) {
830 set_entity_owner(members[i], clss);
831 ARR_APP1(ir_entity *, clss->attr.ca.members, members[i]);
835 void remove_class_member(ir_type *clss, ir_entity *member) {
837 assert(clss && (clss->type_op == type_class));
838 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
839 if (clss->attr.ca.members[i] == member) {
840 for (; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
841 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
842 ARR_SETLEN(ir_entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
848 void add_class_subtype(ir_type *clss, ir_type *subtype) {
850 assert(clss && (clss->type_op == type_class));
851 ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
852 for (i = 0; i < get_class_n_supertypes(subtype); i++)
853 if (get_class_supertype(subtype, i) == clss)
854 /* Class already registered */
856 ARR_APP1(ir_type *, subtype->attr.ca.supertypes, clss);
859 int get_class_n_subtypes(const ir_type *clss) {
860 assert(clss && (clss->type_op == type_class));
861 return (ARR_LEN (clss->attr.ca.subtypes));
864 ir_type *get_class_subtype(ir_type *clss, int pos) {
865 assert(clss && (clss->type_op == type_class));
866 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
867 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
870 int get_class_subtype_index(ir_type *clss, const ir_type *subclass) {
871 int i, n_subtypes = get_class_n_subtypes(clss);
872 assert(is_Class_type(subclass));
873 for (i = 0; i < n_subtypes; ++i) {
874 if (get_class_subtype(clss, i) == subclass) return i;
879 void set_class_subtype(ir_type *clss, ir_type *subtype, int pos) {
880 assert(clss && (clss->type_op == type_class));
881 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
882 clss->attr.ca.subtypes[pos] = subtype;
885 void remove_class_subtype(ir_type *clss, ir_type *subtype) {
887 assert(clss && (clss->type_op == type_class));
888 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
889 if (clss->attr.ca.subtypes[i] == subtype) {
890 for (; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
891 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
892 ARR_SETLEN(ir_entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
897 void add_class_supertype(ir_type *clss, ir_type *supertype) {
899 assert(clss && (clss->type_op == type_class));
900 assert(supertype && (supertype -> type_op == type_class));
901 ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
902 for (i = get_class_n_subtypes(supertype) - 1; i >= 0; --i)
903 if (get_class_subtype(supertype, i) == clss)
904 /* Class already registered */
906 ARR_APP1(ir_type *, supertype->attr.ca.subtypes, clss);
909 int get_class_n_supertypes(const ir_type *clss) {
910 assert(clss && (clss->type_op == type_class));
911 return ARR_LEN(clss->attr.ca.supertypes);
914 int get_class_supertype_index(ir_type *clss, ir_type *super_clss) {
915 int i, n_supertypes = get_class_n_supertypes(clss);
916 assert(super_clss && (super_clss->type_op == type_class));
917 for (i = 0; i < n_supertypes; i++)
918 if (get_class_supertype(clss, i) == super_clss)
923 ir_type *get_class_supertype(ir_type *clss, int pos) {
924 assert(clss && (clss->type_op == type_class));
925 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
926 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
929 void set_class_supertype(ir_type *clss, ir_type *supertype, int pos) {
930 assert(clss && (clss->type_op == type_class));
931 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
932 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(ir_entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
947 ir_entity *get_class_type_info(const ir_type *clss) {
948 return clss->attr.ca.type_info;
951 void set_class_type_info(ir_type *clss, ir_entity *ent) {
952 clss->attr.ca.type_info = ent;
954 ent->repr_class = clss;
957 const char *get_peculiarity_name(ir_peculiarity p) {
958 #define X(a) case a: return #a
960 X(peculiarity_description);
961 X(peculiarity_inherited);
962 X(peculiarity_existent);
965 return "invalid peculiarity";
968 ir_peculiarity get_class_peculiarity(const ir_type *clss) {
969 assert(clss && (clss->type_op == type_class));
970 return clss->attr.ca.peculiarity;
973 void set_class_peculiarity(ir_type *clss, ir_peculiarity pec) {
974 assert(clss && (clss->type_op == type_class));
975 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
976 clss->attr.ca.peculiarity = pec;
979 /* Returns the size of the virtual function table. */
980 unsigned (get_class_vtable_size)(const ir_type *clss) {
981 return _get_class_vtable_size(clss);
984 /* Sets a new size of the virtual function table. */
985 void (set_class_vtable_size)(ir_type *clss, unsigned size) {
986 _set_class_vtable_size(clss, size);
989 /* Returns non-zero if a class is final. */
990 int (is_class_final)(const ir_type *clss) {
991 return _is_class_final(clss);
994 /* Sets if a class is final. */
995 void (set_class_final)(ir_type *clss, int flag) {
996 _set_class_final(clss, flag);
999 /* Returns non-zero if a class is an interface. */
1000 int (is_class_interface)(const ir_type *clss) {
1001 return _is_class_interface(clss);
1004 /* Sets the class interface flag. */
1005 void (set_class_interface)(ir_type *clss, int flag) {
1006 _set_class_interface(clss, flag);
1009 /* Returns non-zero if a class is abstract. */
1010 int (is_class_abstract)(const ir_type *clss) {
1011 return _is_class_abstract(clss);
1014 /* Sets the class abstract flag. */
1015 void (set_class_abstract)(ir_type *clss, int final) {
1016 _set_class_abstract(clss, final);
1019 void set_class_dfn(ir_type *clss, int dfn) {
1020 clss->attr.ca.dfn = dfn;
1023 int get_class_dfn(const ir_type *clss) {
1024 return (clss->attr.ca.dfn);
1028 int (is_Class_type)(const ir_type *clss) {
1029 return _is_class_type(clss);
1032 void set_class_mode(ir_type *tp, ir_mode *mode) {
1033 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1034 assert(get_type_state(tp) == layout_fixed &&
1035 tp->size == get_mode_size_bytes(mode) && "mode don't match class layout");
1039 void set_class_size(ir_type *tp, unsigned size) {
1043 /*----------------------------------------------------------------**/
1045 /*----------------------------------------------------------------**/
1047 /* create a new type struct */
1048 ir_type *new_d_type_struct(ident *name, dbg_info *db) {
1049 ir_type *res = new_type(type_struct, NULL, name, db);
1051 res->attr.sa.members = NEW_ARR_F(ir_entity *, 0);
1056 ir_type *new_type_struct(ident *name) {
1057 return new_d_type_struct (name, NULL);
1060 void free_struct_entities(ir_type *strct) {
1062 assert(strct && (strct->type_op == type_struct));
1063 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
1064 free_entity(get_struct_member(strct, i));
1067 void free_struct_attrs(ir_type *strct) {
1068 assert(strct && (strct->type_op == type_struct));
1069 DEL_ARR_F(strct->attr.sa.members);
1072 /* manipulate private fields of struct */
1073 int get_struct_n_members(const ir_type *strct) {
1074 assert(strct && (strct->type_op == type_struct));
1075 return ARR_LEN(strct->attr.sa.members);
1078 void add_struct_member(ir_type *strct, ir_entity *member) {
1079 assert(strct && (strct->type_op == type_struct));
1080 assert(get_type_tpop(get_entity_type(member)) != type_method);
1081 assert(strct != get_entity_type(member) && "recursive type");
1082 assert(get_type_state(strct) != layout_fixed);
1083 ARR_APP1 (ir_entity *, strct->attr.sa.members, member);
1086 ir_entity *get_struct_member(const ir_type *strct, int pos) {
1087 assert(strct && (strct->type_op == type_struct));
1088 assert(pos >= 0 && pos < get_struct_n_members(strct));
1089 return strct->attr.sa.members[pos];
1092 int get_struct_member_index(const ir_type *strct, ir_entity *mem) {
1094 assert(strct && (strct->type_op == type_struct));
1095 for (i = 0, n = get_struct_n_members(strct); i < n; ++i)
1096 if (get_struct_member(strct, i) == mem)
1101 void set_struct_member(ir_type *strct, int pos, ir_entity *member) {
1102 assert(strct && (strct->type_op == type_struct));
1103 assert(pos >= 0 && pos < get_struct_n_members(strct));
1104 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
1105 strct->attr.sa.members[pos] = member;
1108 void remove_struct_member(ir_type *strct, ir_entity *member) {
1110 assert(strct && (strct->type_op == type_struct));
1111 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
1112 if (strct->attr.sa.members[i] == member) {
1113 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
1114 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1115 ARR_SETLEN(ir_entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1121 int (is_Struct_type)(const ir_type *strct) {
1122 return _is_struct_type(strct);
1125 void set_struct_mode(ir_type *tp, ir_mode *mode) {
1126 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1127 assert(get_type_state(tp) == layout_fixed &&
1128 tp->size == get_mode_size_bytes(mode) && "mode don't match struct layout");
1132 void set_struct_size(ir_type *tp, unsigned size) {
1136 /*******************************************************************/
1138 /*******************************************************************/
1141 * Lazy construction of value argument / result representation.
1142 * Constructs a struct type and its member. The types of the members
1143 * are passed in the argument list.
1145 * @param name name of the type constructed
1146 * @param len number of fields
1147 * @param tps array of field types with length len
1150 build_value_type(ident *name, int len, tp_ent_pair *tps) {
1152 ir_type *res = new_type_struct(name);
1153 res->flags |= tf_value_param_type;
1154 /* Remove type from type list. Must be treated differently than other types. */
1155 remove_irp_type(res);
1156 for (i = 0; i < len; i++) {
1157 ident *id = tps[i].param_name;
1159 /* use res as default if corresponding type is not yet set. */
1160 ir_type *elt_type = tps[i].tp ? tps[i].tp : res;
1162 /* use the parameter name if specified */
1164 id = id_mangle_u(name, get_type_ident(elt_type));
1165 tps[i].ent = new_entity(res, id, elt_type);
1166 set_entity_allocation(tps[i].ent, allocation_parameter);
1171 /* Create a new method type.
1172 N_param is the number of parameters, n_res the number of results. */
1173 ir_type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
1176 assert((get_mode_size_bits(mode_P_code) % 8 == 0) && "unorthodox modes not implemented");
1177 res = new_type(type_method, mode_P_code, name, db);
1178 res->flags |= tf_layout_fixed;
1179 res->size = get_mode_size_bytes(mode_P_code);
1180 res->attr.ma.n_params = n_param;
1181 res->attr.ma.params = XMALLOCNZ(tp_ent_pair, n_param);
1182 res->attr.ma.value_params = NULL;
1183 res->attr.ma.n_res = n_res;
1184 res->attr.ma.res_type = XMALLOCNZ(tp_ent_pair, n_res);
1185 res->attr.ma.value_ress = NULL;
1186 res->attr.ma.variadicity = variadicity_non_variadic;
1187 res->attr.ma.first_variadic_param = -1;
1188 res->attr.ma.additional_properties = mtp_no_property;
1189 res->attr.ma.irg_calling_conv = default_cc_mask;
1194 ir_type *new_type_method(ident *name, int n_param, int n_res) {
1195 return new_d_type_method(name, n_param, n_res, NULL);
1198 /* clone an existing method type */
1199 ir_type *clone_type_method(ir_type *tp, ident *prefix) {
1203 int n_params, n_res;
1206 assert(is_Method_type(tp));
1210 name = id_mangle(prefix, name);
1213 n_params = tp->attr.ma.n_params;
1214 n_res = tp->attr.ma.n_res;
1217 res = new_type(type_method, mode, name, db);
1219 res->flags = tp->flags;
1220 res->assoc_type = tp->assoc_type;
1221 res->size = tp->size;
1222 res->attr.ma.n_params = n_params;
1223 res->attr.ma.params = XMALLOCN(tp_ent_pair, n_params);
1224 memcpy(res->attr.ma.params, tp->attr.ma.params, n_params * sizeof(res->attr.ma.params[0]));
1225 res->attr.ma.value_params = tp->attr.ma.value_params;
1226 res->attr.ma.n_res = n_res;
1227 res->attr.ma.res_type = XMALLOCN(tp_ent_pair, n_res);
1228 memcpy(res->attr.ma.res_type, tp->attr.ma.res_type, n_res * sizeof(res->attr.ma.res_type[0]));
1229 res->attr.ma.value_ress = tp->attr.ma.value_ress;
1230 res->attr.ma.variadicity = tp->attr.ma.variadicity;
1231 res->attr.ma.first_variadic_param = tp->attr.ma.first_variadic_param;
1232 res->attr.ma.additional_properties = tp->attr.ma.additional_properties;
1233 res->attr.ma.irg_calling_conv = tp->attr.ma.irg_calling_conv;
1238 void free_method_entities(ir_type *method) {
1240 assert(method && (method->type_op == type_method));
1243 /* Attention: also frees entities in value parameter subtypes! */
1244 void free_method_attrs(ir_type *method) {
1245 assert(method && (method->type_op == type_method));
1246 free(method->attr.ma.params);
1247 free(method->attr.ma.res_type);
1248 /* cannot free it yet, type could be cloned ...
1249 if (method->attr.ma.value_params) {
1250 free_type_entities(method->attr.ma.value_params);
1251 free_type(method->attr.ma.value_params);
1254 if (method->attr.ma.value_ress) {
1255 free_type_entities(method->attr.ma.value_ress);
1256 free_type(method->attr.ma.value_ress);
1260 /* manipulate private fields of method. */
1261 int (get_method_n_params)(const ir_type *method) {
1262 return _get_method_n_params(method);
1265 /* Returns the type of the parameter at position pos of a method. */
1266 ir_type *get_method_param_type(ir_type *method, int pos) {
1268 assert(method && (method->type_op == type_method));
1269 assert(pos >= 0 && pos < get_method_n_params(method));
1270 res = method->attr.ma.params[pos].tp;
1271 assert(res != NULL && "empty method param type");
1272 return method->attr.ma.params[pos].tp = skip_tid(res);
1275 void set_method_param_type(ir_type *method, int pos, ir_type *tp) {
1276 assert(method && (method->type_op == type_method));
1277 assert(pos >= 0 && pos < get_method_n_params(method));
1278 method->attr.ma.params[pos].tp = tp;
1279 /* If information constructed set pass-by-value representation. */
1280 if (method->attr.ma.value_params) {
1281 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1282 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1286 /* Returns an ident representing the parameters name. Returns NULL if not set.
1287 For debug support only. */
1288 ident *get_method_param_ident(ir_type *method, int pos) {
1289 assert(method && (method->type_op == type_method));
1290 assert(pos >= 0 && pos < get_method_n_params(method));
1291 return method->attr.ma.params[pos].param_name;
1294 /* Returns a string representing the parameters name. Returns NULL if not set.
1295 For debug support only. */
1296 const char *get_method_param_name(ir_type *method, int pos) {
1297 ident *id = get_method_param_ident(method, pos);
1298 return id ? get_id_str(id) : NULL;
1301 /* Sets an ident representing the parameters name. For debug support only. */
1302 void set_method_param_ident(ir_type *method, int pos, ident *id) {
1303 assert(method && (method->type_op == type_method));
1304 assert(pos >= 0 && pos < get_method_n_params(method));
1305 method->attr.ma.params[pos].param_name = id;
1308 /* Returns an entity that represents the copied value argument. Only necessary
1309 for compounds passed by value. */
1310 ir_entity *get_method_value_param_ent(ir_type *method, int pos) {
1311 assert(method && (method->type_op == type_method));
1312 assert(pos >= 0 && pos < get_method_n_params(method));
1314 if (!method->attr.ma.value_params) {
1315 /* parameter value type not created yet, build */
1316 method->attr.ma.value_params
1317 = build_value_type(id_mangle_u(get_type_ident(method), value_params_suffix),
1318 get_method_n_params(method), method->attr.ma.params);
1321 * build_value_type() sets the method->attr.ma.value_params type as default if
1324 assert((get_entity_type(method->attr.ma.params[pos].ent) != method->attr.ma.value_params)
1325 && "param type not yet set");
1326 return method->attr.ma.params[pos].ent;
1330 * Returns a type that represents the copied value arguments.
1332 ir_type *get_method_value_param_type(const ir_type *method) {
1333 assert(method && (method->type_op == type_method));
1334 return method->attr.ma.value_params;
1337 int (get_method_n_ress)(const ir_type *method) {
1338 return _get_method_n_ress(method);
1341 ir_type *get_method_res_type(ir_type *method, int pos) {
1343 assert(method && (method->type_op == type_method));
1344 assert(pos >= 0 && pos < get_method_n_ress(method));
1345 res = method->attr.ma.res_type[pos].tp;
1346 assert(res != NULL && "empty method return type");
1347 return method->attr.ma.res_type[pos].tp = skip_tid(res);
1350 void set_method_res_type(ir_type *method, int pos, ir_type *tp) {
1351 assert(method && (method->type_op == type_method));
1352 assert(pos >= 0 && pos < get_method_n_ress(method));
1353 /* set the result ir_type */
1354 method->attr.ma.res_type[pos].tp = tp;
1355 /* If information constructed set pass-by-value representation. */
1356 if (method->attr.ma.value_ress) {
1357 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1358 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1362 /* Returns an entity that represents the copied value result. Only necessary
1363 for compounds passed by value. */
1364 ir_entity *get_method_value_res_ent(ir_type *method, int pos) {
1365 assert(method && (method->type_op == type_method));
1366 assert(pos >= 0 && pos < get_method_n_ress(method));
1368 if (!method->attr.ma.value_ress) {
1369 /* result value type not created yet, build */
1370 method->attr.ma.value_ress
1371 = build_value_type(id_mangle_u(get_type_ident(method), value_ress_suffix),
1372 get_method_n_ress(method), method->attr.ma.res_type);
1375 * build_value_type() sets the method->attr.ma.value_ress type as default if
1378 assert((get_entity_type(method->attr.ma.res_type[pos].ent) != method->attr.ma.value_ress)
1379 && "result type not yet set");
1381 return method->attr.ma.res_type[pos].ent;
1385 * Returns a type that represents the copied value results.
1387 ir_type *get_method_value_res_type(const ir_type *method) {
1388 assert(method && (method->type_op == type_method));
1389 return method->attr.ma.value_ress;
1392 /* Returns the null-terminated name of this variadicity. */
1393 const char *get_variadicity_name(ir_variadicity vari) {
1394 #define X(a) case a: return #a
1396 X(variadicity_non_variadic);
1397 X(variadicity_variadic);
1404 ir_variadicity get_method_variadicity(const ir_type *method) {
1405 assert(method && (method->type_op == type_method));
1406 return method->attr.ma.variadicity;
1409 void set_method_variadicity(ir_type *method, ir_variadicity vari) {
1410 assert(method && (method->type_op == type_method));
1411 method->attr.ma.variadicity = vari;
1415 * Returns the first variadic parameter index of a type.
1416 * If this index was NOT set, the index of the last parameter
1417 * of the method type plus one is returned for variadic functions.
1418 * Non-variadic function types always return -1 here.
1420 int get_method_first_variadic_param_index(const ir_type *method) {
1421 assert(method && (method->type_op == type_method));
1423 if (method->attr.ma.variadicity == variadicity_non_variadic)
1426 if (method->attr.ma.first_variadic_param == -1)
1427 return get_method_n_params(method);
1428 return method->attr.ma.first_variadic_param;
1432 * Sets the first variadic parameter index. This allows to specify
1433 * a complete call type (containing the type of all parameters)
1434 * but still have the knowledge, which parameter must be passed as
1437 void set_method_first_variadic_param_index(ir_type *method, int index) {
1438 assert(method && (method->type_op == type_method));
1439 assert(index >= 0 && index <= get_method_n_params(method));
1441 method->attr.ma.first_variadic_param = index;
1444 unsigned (get_method_additional_properties)(const ir_type *method) {
1445 return _get_method_additional_properties(method);
1448 void (set_method_additional_properties)(ir_type *method, unsigned mask) {
1449 _set_method_additional_properties(method, mask);
1452 void (set_method_additional_property)(ir_type *method, mtp_additional_property flag) {
1453 _set_method_additional_property(method, flag);
1456 /* Returns the calling convention of an entities graph. */
1457 unsigned (get_method_calling_convention)(const ir_type *method) {
1458 return _get_method_calling_convention(method);
1461 /* Sets the calling convention of an entities graph. */
1462 void (set_method_calling_convention)(ir_type *method, unsigned cc_mask) {
1463 _set_method_calling_convention(method, cc_mask);
1466 /* Returns the number of registers parameters, 0 means default. */
1467 unsigned get_method_n_regparams(ir_type *method) {
1468 unsigned cc = get_method_calling_convention(method);
1469 assert(IS_FASTCALL(cc));
1471 return cc & ~cc_bits;
1474 /* Sets the number of registers parameters, 0 means default. */
1475 void set_method_n_regparams(ir_type *method, unsigned n_regs) {
1476 unsigned cc = get_method_calling_convention(method);
1477 assert(IS_FASTCALL(cc));
1479 set_method_calling_convention(method, (cc & cc_bits) | (n_regs & ~cc_bits));
1483 int (is_Method_type)(const ir_type *method) {
1484 return _is_method_type(method);
1487 /*-----------------------------------------------------------------*/
1489 /*-----------------------------------------------------------------*/
1491 /* create a new type uni */
1492 ir_type *new_d_type_union(ident *name, dbg_info *db) {
1493 ir_type *res = new_type(type_union, NULL, name, db);
1495 res->attr.ua.members = NEW_ARR_F(ir_entity *, 0);
1500 ir_type *new_type_union(ident *name) {
1501 return new_d_type_union(name, NULL);
1504 void free_union_entities(ir_type *uni) {
1506 assert(uni && (uni->type_op == type_union));
1507 for (i = get_union_n_members(uni) - 1; i >= 0; --i)
1508 free_entity(get_union_member(uni, i));
1511 void free_union_attrs (ir_type *uni) {
1512 assert(uni && (uni->type_op == type_union));
1513 DEL_ARR_F(uni->attr.ua.members);
1516 /* manipulate private fields of union */
1517 int get_union_n_members(const ir_type *uni) {
1518 assert(uni && (uni->type_op == type_union));
1519 return ARR_LEN(uni->attr.ua.members);
1522 void add_union_member(ir_type *uni, ir_entity *member) {
1523 assert(uni && (uni->type_op == type_union));
1524 assert(uni != get_entity_type(member) && "recursive type");
1525 assert(get_type_state(uni) != layout_fixed);
1526 ARR_APP1(ir_entity *, uni->attr.ua.members, member);
1529 ir_entity *get_union_member(const ir_type *uni, int pos) {
1530 assert(uni && (uni->type_op == type_union));
1531 assert(pos >= 0 && pos < get_union_n_members(uni));
1532 return uni->attr.ua.members[pos];
1535 int get_union_member_index(const ir_type *uni, ir_entity *mem) {
1537 assert(uni && (uni->type_op == type_union));
1538 for (i = 0, n = get_union_n_members(uni); i < n; ++i)
1539 if (get_union_member(uni, i) == mem)
1544 void set_union_member(ir_type *uni, int pos, ir_entity *member) {
1545 assert(uni && (uni->type_op == type_union));
1546 assert(pos >= 0 && pos < get_union_n_members(uni));
1547 uni->attr.ua.members[pos] = member;
1550 void remove_union_member(ir_type *uni, ir_entity *member) {
1552 assert(uni && (uni->type_op == type_union));
1553 for (i = 0; i < (ARR_LEN(uni->attr.ua.members)); i++)
1554 if (uni->attr.ua.members[i] == member) {
1555 for(; i < (ARR_LEN(uni->attr.ua.members))-1; i++)
1556 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1557 ARR_SETLEN(ir_entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1563 int (is_Union_type)(const ir_type *uni) {
1564 return _is_union_type(uni);
1567 void set_union_size(ir_type *tp, unsigned size) {
1571 /*-----------------------------------------------------------------*/
1573 /*-----------------------------------------------------------------*/
1576 /* create a new type array -- set dimension sizes independently */
1577 ir_type *new_d_type_array(ident *name, int n_dimensions, ir_type *element_type, dbg_info *db) {
1581 ir_graph *rem = current_ir_graph;
1583 assert(!is_Method_type(element_type));
1585 res = new_type(type_array, NULL, name, db);
1586 res->attr.aa.n_dimensions = n_dimensions;
1587 res->attr.aa.lower_bound = XMALLOCNZ(ir_node*, n_dimensions);
1588 res->attr.aa.upper_bound = XMALLOCNZ(ir_node*, n_dimensions);
1589 res->attr.aa.order = XMALLOCNZ(int, n_dimensions);
1591 current_ir_graph = get_const_code_irg();
1592 unk = new_Unknown(mode_Iu);
1593 for (i = 0; i < n_dimensions; i++) {
1594 res->attr.aa.lower_bound[i] =
1595 res->attr.aa.upper_bound[i] = unk;
1596 res->attr.aa.order[i] = i;
1598 current_ir_graph = rem;
1600 res->attr.aa.element_type = element_type;
1601 new_entity(res, id_mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1606 ir_type *new_type_array(ident *name, int n_dimensions, ir_type *element_type) {
1607 return new_d_type_array(name, n_dimensions, element_type, NULL);
1610 void free_array_automatic_entities(ir_type *array) {
1611 assert(array && (array->type_op == type_array));
1612 free_entity(get_array_element_entity(array));
1615 void free_array_entities (ir_type *array) {
1617 assert(array && (array->type_op == type_array));
1620 void free_array_attrs (ir_type *array) {
1621 assert(array && (array->type_op == type_array));
1622 free(array->attr.aa.lower_bound);
1623 free(array->attr.aa.upper_bound);
1624 free(array->attr.aa.order);
1627 /* manipulate private fields of array ir_type */
1628 int get_array_n_dimensions (const ir_type *array) {
1629 assert(array && (array->type_op == type_array));
1630 return array->attr.aa.n_dimensions;
1634 set_array_bounds(ir_type *array, int dimension, ir_node * lower_bound, ir_node * upper_bound) {
1635 assert(array && (array->type_op == type_array));
1636 assert(lower_bound && "lower_bound node may not be NULL.");
1637 assert(upper_bound && "upper_bound node may not be NULL.");
1638 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1639 array->attr.aa.lower_bound[dimension] = lower_bound;
1640 array->attr.aa.upper_bound[dimension] = upper_bound;
1644 set_array_bounds_int(ir_type *array, int dimension, int lower_bound, int upper_bound) {
1645 ir_graph *rem = current_ir_graph;
1646 current_ir_graph = get_const_code_irg();
1647 set_array_bounds(array, dimension,
1648 new_Const_long(mode_Iu, lower_bound),
1649 new_Const_long(mode_Iu, upper_bound));
1650 current_ir_graph = rem;
1654 set_array_lower_bound(ir_type *array, int dimension, ir_node *lower_bound) {
1655 assert(array && (array->type_op == type_array));
1656 assert(lower_bound && "lower_bound node may not be NULL.");
1657 array->attr.aa.lower_bound[dimension] = lower_bound;
1660 void set_array_lower_bound_int(ir_type *array, int dimension, int lower_bound) {
1661 ir_graph *rem = current_ir_graph;
1662 current_ir_graph = get_const_code_irg();
1663 set_array_lower_bound(array, dimension,
1664 new_Const_long(mode_Iu, lower_bound));
1665 current_ir_graph = rem;
1668 set_array_upper_bound (ir_type *array, int dimension, ir_node * upper_bound) {
1669 assert(array && (array->type_op == type_array));
1670 assert(upper_bound && "upper_bound node may not be NULL.");
1671 array->attr.aa.upper_bound[dimension] = upper_bound;
1673 void set_array_upper_bound_int(ir_type *array, int dimension, int upper_bound) {
1674 ir_graph *rem = current_ir_graph;
1675 current_ir_graph = get_const_code_irg();
1676 set_array_upper_bound(array, dimension,
1677 new_Const_long(mode_Iu, upper_bound));
1678 current_ir_graph = rem;
1681 int has_array_lower_bound(const ir_type *array, int dimension) {
1682 assert(array && (array->type_op == type_array));
1683 return !is_Unknown(array->attr.aa.lower_bound[dimension]);
1686 ir_node *get_array_lower_bound(const ir_type *array, int dimension) {
1687 assert(array && (array->type_op == type_array));
1688 return array->attr.aa.lower_bound[dimension];
1691 long get_array_lower_bound_int(const ir_type *array, int dimension) {
1693 assert(array && (array->type_op == type_array));
1694 node = array->attr.aa.lower_bound[dimension];
1695 assert(is_Const(node));
1696 return get_tarval_long(get_Const_tarval(node));
1699 int has_array_upper_bound(const ir_type *array, int dimension) {
1700 assert(array && (array->type_op == type_array));
1701 return !is_Unknown(array->attr.aa.upper_bound[dimension]);
1704 ir_node *get_array_upper_bound(const ir_type *array, int dimension) {
1705 assert(array && (array->type_op == type_array));
1706 return array->attr.aa.upper_bound[dimension];
1709 long get_array_upper_bound_int(const ir_type *array, int dimension) {
1711 assert(array && (array->type_op == type_array));
1712 node = array->attr.aa.upper_bound[dimension];
1713 assert(is_Const(node));
1714 return get_tarval_long(get_Const_tarval(node));
1717 void set_array_order(ir_type *array, int dimension, int order) {
1718 assert(array && (array->type_op == type_array));
1719 array->attr.aa.order[dimension] = order;
1722 int get_array_order(const ir_type *array, int dimension) {
1723 assert(array && (array->type_op == type_array));
1724 return array->attr.aa.order[dimension];
1727 int find_array_dimension(const ir_type *array, int order) {
1730 assert(array && (array->type_op == type_array));
1732 for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
1733 if (array->attr.aa.order[dim] == order)
1739 void set_array_element_type(ir_type *array, ir_type *tp) {
1740 assert(array && (array->type_op == type_array));
1741 assert(!is_Method_type(tp));
1742 array->attr.aa.element_type = tp;
1745 ir_type *get_array_element_type(ir_type *array) {
1746 assert(array && (array->type_op == type_array));
1747 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1750 void set_array_element_entity(ir_type *array, ir_entity *ent) {
1751 assert(array && (array->type_op == type_array));
1752 assert((get_entity_type(ent)->type_op != type_method));
1753 array->attr.aa.element_ent = ent;
1754 array->attr.aa.element_type = get_entity_type(ent);
1757 ir_entity *get_array_element_entity(const ir_type *array) {
1758 assert(array && (array->type_op == type_array));
1759 return array->attr.aa.element_ent;
1763 int (is_Array_type)(const ir_type *array) {
1764 return _is_array_type(array);
1767 void set_array_size(ir_type *tp, unsigned size) {
1768 /* FIXME: Here we should make some checks with the element type size */
1771 /*-----------------------------------------------------------------*/
1772 /* TYPE_ENUMERATION */
1773 /*-----------------------------------------------------------------*/
1775 /* create a new type enumeration -- set the enumerators independently */
1776 ir_type *new_d_type_enumeration(ident *name, int n_enums, dbg_info *db) {
1779 assert(n_enums >= 0);
1780 res = new_type(type_enumeration, NULL, name, db);
1781 res->attr.ea.enumer = NEW_ARR_F(ir_enum_const, n_enums);
1786 ir_type *new_type_enumeration(ident *name, int n_enums) {
1787 return new_d_type_enumeration(name, n_enums, NULL);
1790 void free_enumeration_entities(ir_type *enumeration) {
1792 assert(enumeration && (enumeration->type_op == type_enumeration));
1794 void free_enumeration_attrs(ir_type *enumeration) {
1795 assert(enumeration && (enumeration->type_op == type_enumeration));
1796 DEL_ARR_F(enumeration->attr.ea.enumer);
1799 /* manipulate fields of enumeration type. */
1800 int get_enumeration_n_enums(const ir_type *enumeration) {
1801 assert(enumeration && (enumeration->type_op == type_enumeration));
1802 return ARR_LEN(enumeration->attr.ea.enumer);
1805 /* create a new constant */
1806 void set_enumeration_const(ir_type *enumeration, int pos, ident *nameid, tarval *con) {
1807 assert(0 <= pos && pos < ARR_LEN(enumeration->attr.ea.enumer));
1808 enumeration->attr.ea.enumer[pos].nameid = nameid;
1809 enumeration->attr.ea.enumer[pos].value = con;
1810 enumeration->attr.ea.enumer[pos].owner = enumeration;
1813 ir_enum_const *get_enumeration_const(const ir_type *enumeration, int pos) {
1814 assert(enumeration && (enumeration->type_op == type_enumeration));
1815 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1816 return &enumeration->attr.ea.enumer[pos];
1819 ir_type *get_enumeration_owner(const ir_enum_const *enum_cnst) {
1820 return enum_cnst->owner;
1823 void set_enumeration_value(ir_enum_const *enum_cnst, tarval *con) {
1824 enum_cnst->value = con;
1827 tarval *get_enumeration_value(const ir_enum_const *enum_cnst) {
1828 return enum_cnst->value;
1831 void set_enumeration_nameid(ir_enum_const *enum_cnst, ident *id) {
1832 enum_cnst->nameid = id;
1835 ident *get_enumeration_nameid(const ir_enum_const *enum_cnst) {
1836 return enum_cnst->nameid;
1839 const char *get_enumeration_name(const ir_enum_const *enum_cnst) {
1840 return get_id_str(enum_cnst->nameid);
1844 int (is_Enumeration_type)(const ir_type *enumeration) {
1845 return _is_enumeration_type(enumeration);
1848 void set_enumeration_mode(ir_type *tp, ir_mode *mode) {
1849 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1850 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1851 assert((get_mode_size_bits(mode) % 8) == 0 && "unorthodox modes not implemented");
1853 tp->size = get_mode_size_bytes(mode);
1857 /*-----------------------------------------------------------------*/
1859 /*-----------------------------------------------------------------*/
1861 /* Create a new type pointer */
1862 ir_type *new_d_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode, dbg_info *db) {
1865 assert(mode_is_reference(ptr_mode));
1866 res = new_type(type_pointer, ptr_mode, name, db);
1867 res->attr.pa.points_to = points_to;
1868 assert((get_mode_size_bits(res->mode) % 8 == 0) && "unorthodox modes not implemented");
1869 res->size = get_mode_size_bytes(res->mode);
1870 res->flags |= tf_layout_fixed;
1875 ir_type *new_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode) {
1876 return new_d_type_pointer(name, points_to, ptr_mode, NULL);
1879 void free_pointer_entities(ir_type *pointer) {
1881 assert(pointer && (pointer->type_op == type_pointer));
1884 void free_pointer_attrs(ir_type *pointer) {
1886 assert(pointer && (pointer->type_op == type_pointer));
1889 /* manipulate fields of type_pointer */
1890 void set_pointer_points_to_type(ir_type *pointer, ir_type *tp) {
1891 assert(pointer && (pointer->type_op == type_pointer));
1892 pointer->attr.pa.points_to = tp;
1895 ir_type *get_pointer_points_to_type(ir_type *pointer) {
1896 assert(pointer && (pointer->type_op == type_pointer));
1897 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1901 int (is_Pointer_type)(const ir_type *pointer) {
1902 return _is_pointer_type(pointer);
1905 void set_pointer_mode(ir_type *tp, ir_mode *mode) {
1906 assert(mode_is_reference(mode) && "Modes of pointers must be references");
1907 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1908 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1910 tp->size = get_mode_size_bytes(mode);
1914 /* Returns the first pointer type that has as points_to tp.
1915 * Not efficient: O(#types).
1916 * If not found returns firm_unknown_type. */
1917 ir_type *find_pointer_type_to_type (ir_type *tp) {
1918 int i, n = get_irp_n_types();
1919 for (i = 0; i < n; ++i) {
1920 ir_type *found = get_irp_type(i);
1921 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1924 return firm_unknown_type;
1928 /*-----------------------------------------------------------------*/
1929 /* TYPE_PRIMITIVE */
1930 /*-----------------------------------------------------------------*/
1932 /* create a new type primitive */
1933 ir_type *new_d_type_primitive(ident *name, ir_mode *mode, dbg_info *db) {
1934 ir_type *res = new_type(type_primitive, mode, name, db);
1935 res->size = get_mode_size_bytes(mode);
1936 res->flags |= tf_layout_fixed;
1937 res->attr.ba.base_type = NULL;
1942 ir_type *new_type_primitive(ident *name, ir_mode *mode) {
1943 return new_d_type_primitive(name, mode, NULL);
1947 int (is_Primitive_type)(const ir_type *primitive) {
1948 return _is_primitive_type(primitive);
1951 void set_primitive_mode(ir_type *tp, ir_mode *mode) {
1952 /* Modes of primitives must be data */
1953 assert(mode_is_data(mode));
1955 /* For primitive size depends on the mode. */
1956 tp->size = get_mode_size_bytes(mode);
1960 /* Return the base type of a primitive (bitfield) type or NULL if none. */
1961 ir_type *get_primitive_base_type(ir_type *tp) {
1962 assert(is_Primitive_type(tp));
1963 return tp->attr.ba.base_type;
1966 /* Sets the base type of a primitive (bitfield) type. */
1967 void set_primitive_base_type(ir_type *tp, ir_type *base_tp) {
1968 assert(is_Primitive_type(tp));
1969 tp->attr.ba.base_type = base_tp;
1972 /*-----------------------------------------------------------------*/
1973 /* common functionality */
1974 /*-----------------------------------------------------------------*/
1977 int (is_atomic_type)(const ir_type *tp) {
1978 return _is_atomic_type(tp);
1982 * Gets the number of elements in a firm compound type.
1984 int get_compound_n_members(const ir_type *tp) {
1985 const tp_op *op = get_type_tpop(tp);
1988 if (op->ops.get_n_members)
1989 res = op->ops.get_n_members(tp);
1991 assert(0 && "no member count for this type");
1997 * Gets the member of a firm compound type at position pos.
1999 ir_entity *get_compound_member(const ir_type *tp, int pos) {
2000 const tp_op *op = get_type_tpop(tp);
2001 ir_entity *res = NULL;
2003 if (op->ops.get_member)
2004 res = op->ops.get_member(tp, pos);
2006 assert(0 && "no members in this type");
2011 /* Returns index of member in tp, -1 if not contained. */
2012 int get_compound_member_index(const ir_type *tp, ir_entity *member) {
2013 const tp_op *op = get_type_tpop(tp);
2016 if (op->ops.get_member_index)
2017 index = op->ops.get_member_index(tp, member);
2019 assert(0 && "no members in this type");
2024 int is_compound_type(const ir_type *tp) {
2025 assert(tp && tp->kind == k_type);
2026 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
2029 /* Checks, whether a type is a frame type */
2030 int is_frame_type(const ir_type *tp) {
2031 return tp->flags & tf_frame_type;
2034 /* Checks, whether a type is a value parameter type */
2035 int is_value_param_type(const ir_type *tp) {
2036 return tp->flags & tf_value_param_type;
2039 /* Checks, whether a type is a lowered type */
2040 int is_lowered_type(const ir_type *tp) {
2041 return tp->flags & tf_lowered_type;
2044 /* Makes a new frame type. */
2045 ir_type *new_type_frame(ident *name) {
2046 ir_type *res = new_type_class(name);
2048 res->flags |= tf_frame_type;
2050 /* Remove type from type list. Must be treated differently than other types. */
2051 remove_irp_type(res);
2053 /* It is not possible to derive from the frame type. Set the final flag. */
2054 set_class_final(res, 1);
2059 /* Makes a clone of a frame type. */
2060 ir_type *clone_frame_type(ir_type *type) {
2064 assert(is_frame_type(type));
2065 /* the entity link resource should be allocated if this function is called */
2066 assert(irp_resources_reserved(irp) & IR_RESOURCE_ENTITY_LINK);
2068 res = new_type_frame(type->name);
2069 for (i = 0, n = get_class_n_members(type); i < n; ++i) {
2070 ir_entity *ent = get_class_member(type, i);
2071 ir_entity *nent = copy_entity_own(ent, res);
2072 set_entity_link(ent, nent);
2073 set_entity_link(nent, ent);
2078 /* Sets a lowered type for a type. This sets both associations. */
2079 void set_lowered_type(ir_type *tp, ir_type *lowered_type) {
2080 assert(is_type(tp) && is_type(lowered_type));
2081 lowered_type->flags |= tf_lowered_type;
2082 tp->assoc_type = lowered_type;
2083 lowered_type->assoc_type = tp;
2087 * Gets the lowered/unlowered type of a type or NULL if this type
2088 * has no lowered/unlowered one.
2090 ir_type *get_associated_type(const ir_type *tp) {
2091 return tp->assoc_type;
2094 /* set the type size for the unknown and none ir_type */
2095 void set_default_size(ir_type *tp, unsigned size) {
2100 * Allocate an area of size bytes aligned at alignment
2101 * at the start or the end of a frame type.
2102 * The frame type must have already an fixed layout.
2104 ir_entity *frame_alloc_area(ir_type *frame_type, int size, unsigned alignment, int at_start) {
2109 unsigned frame_align;
2110 int i, offset, frame_size;
2111 static unsigned area_cnt = 0;
2112 static ir_type *a_byte = NULL;
2114 assert(is_frame_type(frame_type));
2115 assert(get_type_state(frame_type) == layout_fixed);
2116 assert(get_type_alignment_bytes(frame_type) > 0);
2117 set_type_state(frame_type, layout_undefined);
2120 a_byte = new_type_primitive(new_id_from_chars("byte", 4), mode_Bu);
2122 snprintf(buf, sizeof(buf), "area%u", area_cnt++);
2123 name = new_id_from_str(buf);
2125 /* align the size */
2126 frame_align = get_type_alignment_bytes(frame_type);
2127 size = (size + frame_align - 1) & ~(frame_align - 1);
2129 tp = new_type_array(id_mangle_u(get_type_ident(frame_type), name), 1, a_byte);
2130 set_array_bounds_int(tp, 0, 0, size);
2131 set_type_alignment_bytes(tp, alignment);
2133 frame_size = get_type_size_bytes(frame_type);
2135 /* fix all offsets so far */
2136 for (i = get_class_n_members(frame_type) - 1; i >= 0; --i) {
2137 ir_entity *ent = get_class_member(frame_type, i);
2139 set_entity_offset(ent, get_entity_offset(ent) + size);
2141 /* calculate offset and new type size */
2145 /* increase size to match alignment... */
2146 if (alignment > frame_align) {
2147 frame_align = alignment;
2148 set_type_alignment_bytes(frame_type, frame_align);
2149 frame_size = (frame_size + frame_align - 1) & ~(frame_align - 1);
2152 /* calculate offset and new type size */
2153 offset = (frame_size + alignment - 1) & ~(alignment - 1);
2154 frame_size = offset + size;
2157 area = new_entity(frame_type, name, tp);
2158 set_entity_offset(area, offset);
2159 set_type_size_bytes(frame_type, frame_size);
2161 /* mark this entity as compiler generated */
2162 set_entity_compiler_generated(area, 1);
2164 set_type_state(frame_type, layout_fixed);