3 * File name: ir/tr/type.c
4 * Purpose: Representation of types.
5 * Author: Goetz Lindenmaier
6 * Modified by: Michael Beck
9 * Copyright: (c) 2001-2006 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
17 * Implementation of the datastructure to hold
20 * (C) 2001-2006 by Universitaet Karlsruhe
21 * Goetz Lindenmaier, Michael Beck
23 * This module supplies a datastructure to represent all types
24 * known in the compiled program. This includes types specified
25 * in the program as well as types defined by the language. In the
26 * view of the intermediate representation there is no difference
27 * between these types.
29 * There exist several kinds of types, arranged by the structure of
30 * the type. A type is described by a set of attributes. Some of
31 * these attributes are common to all types, others depend on the
34 * Types are different from the modes defined in irmode: Types are
35 * on the level of the programming language, modes at the level of
36 * the target processor.
38 * @see type_t.h type tpop
75 /*-----------------------------------------------------------------*/
77 /*-----------------------------------------------------------------*/
79 ir_type *firm_none_type; ir_type *get_none_type(void) { return firm_none_type; }
80 ir_type *firm_unknown_type; ir_type *get_unknown_type(void) { return firm_unknown_type; }
83 /* Suffixes added to types used for pass-by-value representations. */
84 static ident *value_params_suffix = NULL;
85 static ident *value_ress_suffix = NULL;
87 /** The default calling convention for method types. */
88 static unsigned default_cc_mask;
90 /* return the default calling convention for method types */
91 unsigned get_default_cc_mask(void) {
92 return default_cc_mask;
95 /* Initialize the type module. */
96 void firm_init_type(dbg_info *builtin_db, unsigned def_cc_mask)
98 default_cc_mask = def_cc_mask;
99 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
100 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
102 /* construct none and unknown type. */
103 firm_none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"), builtin_db);
104 set_type_size_bits(firm_none_type, 0);
105 set_type_state (firm_none_type, layout_fixed);
106 remove_irp_type(firm_none_type);
108 firm_unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"), builtin_db);
109 set_type_size_bits(firm_unknown_type, 0);
110 set_type_state (firm_unknown_type, layout_fixed);
111 remove_irp_type(firm_unknown_type);
114 /** the global type visited flag */
115 unsigned long firm_type_visited;
117 void (set_master_type_visited)(unsigned long val) { _set_master_type_visited(val); }
118 unsigned long (get_master_type_visited)(void) { return _get_master_type_visited(); }
119 void (inc_master_type_visited)(void) { _inc_master_type_visited(); }
122 * Creates a new type representation.
125 new_type(tp_op *type_op, ir_mode *mode, ident *name, dbg_info *db) {
129 assert(type_op != type_id);
130 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
132 node_size = offsetof(ir_type, attr) + type_op->attr_size;
133 res = xmalloc(node_size);
134 memset(res, 0, node_size);
137 res->type_op = type_op;
140 res->visibility = visibility_external_allocated;
141 res->flags = tf_none;
147 res->assoc_type = NULL;
149 res->nr = get_irp_new_node_nr();
150 #endif /* defined DEBUG_libfirm */
152 add_irp_type(res); /* Remember the new type global. */
157 void free_type(ir_type *tp) {
158 const tp_op *op = get_type_tpop(tp);
160 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
162 /* Remove from list of all types */
164 /* Free the attributes of the type. */
166 /* Free entities automatically allocated with the ir_type */
167 if (op->ops.free_auto_entities)
168 op->ops.free_auto_entities(tp);
169 /* And now the type itself... */
174 void free_type_entities(ir_type *tp) {
175 const tp_op *tpop = get_type_tpop(tp);
177 if (tpop->ops.free_entities)
178 tpop->ops.free_entities(tp);
181 void free_type_attrs(ir_type *tp) {
182 const tp_op *tpop = get_type_tpop(tp);
184 if (tpop->ops.free_attrs)
185 tpop->ops.free_attrs(tp);
188 /* set/get the link field */
189 void *(get_type_link)(const ir_type *tp) {
190 return _get_type_link(tp);
193 void (set_type_link)(ir_type *tp, void *l) {
194 _set_type_link(tp, l);
197 const tp_op *(get_type_tpop)(const ir_type *tp) {
198 return _get_type_tpop(tp);
201 ident *(get_type_tpop_nameid)(const ir_type *tp) {
202 return _get_type_tpop_nameid(tp);
205 const char* get_type_tpop_name(const ir_type *tp) {
206 assert(tp && tp->kind == k_type);
207 return get_id_str(tp->type_op->name);
210 tp_opcode (get_type_tpop_code)(const ir_type *tp) {
211 return _get_type_tpop_code(tp);
214 ir_mode *(get_type_mode)(const ir_type *tp) {
215 return _get_type_mode(tp);
218 void set_type_mode(ir_type *tp, ir_mode *mode) {
219 const tp_op *tpop = get_type_tpop(tp);
221 if (tpop->ops.set_type_mode)
222 tpop->ops.set_type_mode(tp, mode);
224 assert(0 && "setting a mode is NOT allowed for this type");
227 ident *(get_type_ident)(const ir_type *tp) {
228 return _get_type_ident(tp);
231 void (set_type_ident)(ir_type *tp, ident* id) {
232 _set_type_ident(tp, id);
235 /* Outputs a unique number for this node */
236 long get_type_nr(const ir_type *tp) {
241 return (long)PTR_TO_INT(tp);
245 const char* get_type_name(const ir_type *tp) {
246 assert(tp && tp->kind == k_type);
247 return (get_id_str(tp->name));
250 int (get_type_size_bytes)(const ir_type *tp) {
251 return _get_type_size_bytes(tp);
254 int (get_type_size_bits)(const ir_type *tp) {
255 return _get_type_size_bits(tp);
259 ir_visibility get_type_visibility (const ir_type *tp) {
261 visibility res = visibility_local;
262 if (is_compound_type(tp)) {
264 if (is_Array_type(tp)) {
265 entity *mem = get_array_element_entity(tp);
266 if (get_entity_visibility(mem) != visibility_local)
267 res = visibility_external_visible;
269 int i, n_mems = get_compound_n_members(tp);
270 for (i = 0; i < n_mems; ++i) {
271 entity *mem = get_compound_member(tp, i);
272 if (get_entity_visibility(mem) != visibility_local)
273 res = visibility_external_visible;
280 return tp->visibility;
283 void set_type_visibility (ir_type *tp, ir_visibility v) {
286 /* check for correctness */
287 if (v != visibility_external_allocated) {
288 visibility res = visibility_local;
289 if (is_compound_type(tp)) {
290 if (is_Array_type(tp)) {
291 entity *mem = get_array_element_entity(tp);
292 if (get_entity_visibility(mem) > res)
293 res = get_entity_visibility(mem);
295 int i, n_mems = get_compound_n_members(tp);
296 for (i = 0; i < n_mems; ++i) {
297 entity *mem = get_compound_member(tp, i);
298 if (get_entity_visibility(mem) > res)
299 res = get_entity_visibility(mem);
310 set_type_size_bits(ir_type *tp, int size) {
311 const tp_op *tpop = get_type_tpop(tp);
313 if (tpop->ops.set_type_size)
314 tpop->ops.set_type_size(tp, size);
316 assert(0 && "Cannot set size for this type");
320 set_type_size_bytes(ir_type *tp, int size) {
321 set_type_size_bits(tp, 8*size);
324 int get_type_alignment_bytes(ir_type *tp) {
325 int align = get_type_alignment_bits(tp);
327 return align < 0 ? align : (align + 7) >> 3;
330 int get_type_alignment_bits(ir_type *tp) {
336 /* alignment NOT set calculate it "on demand" */
338 align = get_mode_size_bits(tp->mode);
339 else if (is_Array_type(tp))
340 align = get_type_alignment_bits(get_array_element_type(tp));
341 else if (is_compound_type(tp)) {
342 int i, n = get_compound_n_members(tp);
345 for (i = 0; i < n; ++i) {
346 ir_type *t = get_entity_type(get_compound_member(tp, i));
347 int a = get_type_alignment_bits(t);
353 else if (is_Method_type(tp))
363 set_type_alignment_bits(ir_type *tp, int align) {
364 assert(tp && tp->kind == k_type);
365 assert((align == -1 || (align & (align - 1)) == 0) && "type alignment not power of two");
366 /* Methods don't have an alignment. */
367 if (tp->type_op != type_method) {
373 set_type_alignment_bytes(ir_type *tp, int align) {
375 set_type_alignment_bits(tp, -1);
377 set_type_alignment_bits(tp, 8*align);
381 /* Returns a human readable string for the enum entry. */
382 const char *get_type_state_name(type_state s) {
383 #define X(a) case a: return #a;
393 type_state (get_type_state)(const ir_type *tp) {
394 return _get_type_state(tp);
398 set_type_state(ir_type *tp, type_state state) {
399 assert(tp && tp->kind == k_type);
401 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
402 (tp->type_op == type_method))
405 /* Just a correctness check: */
406 if (state == layout_fixed) {
408 switch (get_type_tpop_code(tp)) {
410 assert(get_type_size_bits(tp) > -1);
411 if (tp != get_glob_type()) {
412 int n_mem = get_class_n_members(tp);
413 for (i = 0; i < n_mem; i++) {
414 if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
415 { DDMT(tp); DDME(get_class_member(tp, i)); }
416 assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
418 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
419 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
425 assert(get_type_size_bits(tp) > -1);
426 for (i = 0; i < get_struct_n_members(tp); i++) {
427 assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
428 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
437 Assure that only innermost dimension is dynamic? */
439 case tpo_enumeration:
440 assert(get_type_mode != NULL);
441 for (i = get_enumeration_n_enums(tp) - 1; i >= 0; --i) {
442 ir_enum_const *ec = get_enumeration_const(tp, i);
443 tarval *tv = get_enumeration_value(ec);
444 assert(tv != NULL && tv != tarval_bad);
450 if (state == layout_fixed)
451 tp->flags |= tf_layout_fixed;
453 tp->flags &= ~tf_layout_fixed;
456 unsigned long (get_type_visited)(const ir_type *tp) {
457 return _get_type_visited(tp);
460 void (set_type_visited)(ir_type *tp, unsigned long num) {
461 _set_type_visited(tp, num);
464 /* Sets visited field in type to type_visited. */
465 void (mark_type_visited)(ir_type *tp) {
466 _mark_type_visited(tp);
469 int (type_visited)(const ir_type *tp) {
470 return _type_visited(tp);
473 int (type_not_visited)(const ir_type *tp) {
474 return _type_not_visited(tp);
477 int (is_type)(const void *thing) {
478 return _is_type(thing);
481 /* Checks whether two types are structural equal.*/
482 int equal_type(ir_type *typ1, ir_type *typ2) {
487 if (typ1 == typ2) return 1;
489 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
490 (get_type_ident(typ1) != get_type_ident(typ2)) ||
491 (get_type_mode(typ1) != get_type_mode(typ2)) ||
492 (get_type_state(typ1) != get_type_state(typ2)))
494 if ((get_type_state(typ1) == layout_fixed) &&
495 (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
498 switch (get_type_tpop_code(typ1)) {
500 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
501 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
502 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
503 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
504 /** Compare the members **/
505 m = alloca(sizeof(entity *) * get_class_n_members(typ1));
506 memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
507 /* First sort the members of typ2 */
508 for (i = 0; i < get_class_n_members(typ1); i++) {
509 entity *e1 = get_class_member(typ1, i);
510 for (j = 0; j < get_class_n_members(typ2); j++) {
511 entity *e2 = get_class_member(typ2, j);
512 if (get_entity_name(e1) == get_entity_name(e2))
516 for (i = 0; i < get_class_n_members(typ1); i++) {
517 if (!m[i] || /* Found no counterpart */
518 !equal_entity(get_class_member(typ1, i), m[i]))
521 /** Compare the supertypes **/
522 t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
523 memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
524 /* First sort the supertypes of typ2 */
525 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
526 ir_type *t1 = get_class_supertype(typ1, i);
527 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
528 ir_type *t2 = get_class_supertype(typ2, j);
529 if (get_type_ident(t2) == get_type_ident(t1))
533 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
534 if (!t[i] || /* Found no counterpart */
535 get_class_supertype(typ1, i) != t[i])
540 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
541 m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
542 memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
543 /* First sort the members of lt */
544 for (i = 0; i < get_struct_n_members(typ1); i++) {
545 entity *e1 = get_struct_member(typ1, i);
546 for (j = 0; j < get_struct_n_members(typ2); j++) {
547 entity *e2 = get_struct_member(typ2, j);
548 if (get_entity_name(e1) == get_entity_name(e2))
552 for (i = 0; i < get_struct_n_members(typ1); i++) {
553 if (!m[i] || /* Found no counterpart */
554 !equal_entity(get_struct_member(typ1, i), m[i]))
559 int n_param1, n_param2;
561 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
562 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
563 if (get_method_calling_convention(typ1) !=
564 get_method_calling_convention(typ2)) return 0;
566 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
567 n_param1 = get_method_n_params(typ1);
568 n_param2 = get_method_n_params(typ2);
571 n_param1 = get_method_first_variadic_param_index(typ1);
572 n_param2 = get_method_first_variadic_param_index(typ2);
575 if (n_param1 != n_param2) return 0;
577 for (i = 0; i < n_param1; i++) {
578 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
581 for (i = 0; i < get_method_n_ress(typ1); i++) {
582 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
587 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
588 m = alloca(sizeof(entity *) * get_union_n_members(typ1));
589 memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
590 /* First sort the members of lt */
591 for (i = 0; i < get_union_n_members(typ1); i++) {
592 entity *e1 = get_union_member(typ1, i);
593 for (j = 0; j < get_union_n_members(typ2); j++) {
594 entity *e2 = get_union_member(typ2, j);
595 if (get_entity_name(e1) == get_entity_name(e2))
599 for (i = 0; i < get_union_n_members(typ1); i++) {
600 if (!m[i] || /* Found no counterpart */
601 !equal_entity(get_union_member(typ1, i), m[i]))
606 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
608 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
610 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
611 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
612 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
614 if (get_array_order(typ1, i) != get_array_order(typ2, i))
615 assert(0 && "type compare with different dimension orders not implemented");
618 case tpo_enumeration: {
619 assert(0 && "enumerations not implemented");
622 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
625 case tpo_primitive: {
632 /* Checks whether two types are structural comparable. */
633 int smaller_type (ir_type *st, ir_type *lt) {
637 if (st == lt) return 1;
639 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
642 switch(get_type_tpop_code(st)) {
644 return is_SubClass_of(st, lt);
647 if (get_struct_n_members(st) != get_struct_n_members(lt)) return 0;
648 m = alloca(sizeof(entity *) * get_struct_n_members(st));
649 memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
650 /* First sort the members of lt */
651 for (i = 0; i < get_struct_n_members(st); i++) {
652 entity *se = get_struct_member(st, i);
653 for (j = 0; j < get_struct_n_members(lt); j++) {
654 entity *le = get_struct_member(lt, j);
655 if (get_entity_name(le) == get_entity_name(se))
659 for (i = 0; i < get_struct_n_members(st); i++) {
660 if (!m[i] || /* Found no counterpart */
661 !smaller_type(get_entity_type(get_struct_member(st, i)),
662 get_entity_type(m[i])))
667 int n_param1, n_param2;
669 /** FIXME: is this still 1? */
670 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
671 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
672 if (get_method_calling_convention(st) !=
673 get_method_calling_convention(lt)) return 0;
675 if (get_method_variadicity(st) == variadicity_non_variadic) {
676 n_param1 = get_method_n_params(st);
677 n_param2 = get_method_n_params(lt);
680 n_param1 = get_method_first_variadic_param_index(st);
681 n_param2 = get_method_first_variadic_param_index(lt);
684 if (n_param1 != n_param2) return 0;
686 for (i = 0; i < get_method_n_params(st); i++) {
687 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
690 for (i = 0; i < get_method_n_ress(st); i++) {
691 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
696 if (get_union_n_members(st) != get_union_n_members(lt)) return 0;
697 m = alloca(sizeof(entity *) * get_union_n_members(st));
698 memset(m, 0, sizeof(entity *) * get_union_n_members(st));
699 /* First sort the members of lt */
700 for (i = 0; i < get_union_n_members(st); i++) {
701 entity *se = get_union_member(st, i);
702 for (j = 0; j < get_union_n_members(lt); j++) {
703 entity *le = get_union_member(lt, j);
704 if (get_entity_name(le) == get_entity_name(se))
708 for (i = 0; i < get_union_n_members(st); i++) {
709 if (!m[i] || /* Found no counterpart */
710 !smaller_type(get_entity_type(get_union_member(st, i)),
711 get_entity_type(m[i])))
716 ir_type *set, *let; /* small/large elt. ir_type */
717 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
719 set = get_array_element_type(st);
720 let = get_array_element_type(lt);
722 /* If the element types are different, set must be convertible
723 to let, and they must have the same size so that address
724 computations work out. To have a size the layout must
726 if ((get_type_state(set) != layout_fixed) ||
727 (get_type_state(let) != layout_fixed))
729 if (!smaller_type(set, let) ||
730 get_type_size_bits(set) != get_type_size_bits(let))
733 for(i = 0; i < get_array_n_dimensions(st); i++) {
734 if (get_array_lower_bound(lt, i))
735 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
737 if (get_array_upper_bound(lt, i))
738 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
742 case tpo_enumeration: {
743 assert(0 && "enumerations not implemented");
746 if (!smaller_type(get_pointer_points_to_type(st),
747 get_pointer_points_to_type(lt)))
750 case tpo_primitive: {
751 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
759 /*-----------------------------------------------------------------*/
761 /*-----------------------------------------------------------------*/
763 /* create a new class ir_type */
764 ir_type *new_d_type_class (ident *name, dbg_info *db) {
767 res = new_type(type_class, NULL, name, db);
769 res->attr.ca.members = NEW_ARR_F (entity *, 0);
770 res->attr.ca.subtypes = NEW_ARR_F (ir_type *, 0);
771 res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
772 res->attr.ca.peculiarity = peculiarity_existent;
773 res->attr.ca.type_info = NULL;
774 res->attr.ca.vtable_size = 0;
775 res->attr.ca.clss_flags = cf_none;
776 res->attr.ca.dfn = 0;
781 ir_type *new_type_class (ident *name) {
782 return new_d_type_class (name, NULL);
785 /* free all entities of a class */
786 void free_class_entities(ir_type *clss) {
788 assert(clss && (clss->type_op == type_class));
789 for (i = get_class_n_members(clss) - 1; i >= 0; --i)
790 free_entity(get_class_member(clss, i));
791 /* do NOT free the type info here. It belongs to another class */
794 void free_class_attrs(ir_type *clss) {
795 assert(clss && (clss->type_op == type_class));
796 DEL_ARR_F(clss->attr.ca.members);
797 DEL_ARR_F(clss->attr.ca.subtypes);
798 DEL_ARR_F(clss->attr.ca.supertypes);
801 /* manipulate private fields of class type */
802 void add_class_member (ir_type *clss, entity *member) {
803 assert(clss && (clss->type_op == type_class));
804 assert(clss != get_entity_type(member) && "recursive type");
805 ARR_APP1 (entity *, clss->attr.ca.members, member);
808 int (get_class_n_members) (const ir_type *clss) {
809 return _get_class_n_members(clss);
812 int get_class_member_index(const ir_type *clss, entity *mem) {
814 assert(clss && (clss->type_op == type_class));
815 for (i = 0, n = get_class_n_members(clss); i < n; ++i)
816 if (get_class_member(clss, i) == mem)
821 entity *(get_class_member) (const ir_type *clss, int pos) {
822 return _get_class_member(clss, pos);
825 entity *get_class_member_by_name(ir_type *clss, ident *name) {
827 assert(clss && (clss->type_op == type_class));
828 n_mem = get_class_n_members(clss);
829 for (i = 0; i < n_mem; ++i) {
830 entity *mem = get_class_member(clss, i);
831 if (get_entity_ident(mem) == name) return mem;
836 void set_class_member (ir_type *clss, entity *member, int pos) {
837 assert(clss && (clss->type_op == type_class));
838 assert(pos >= 0 && pos < get_class_n_members(clss));
839 clss->attr.ca.members[pos] = member;
841 void set_class_members (ir_type *clss, entity **members, int arity) {
843 assert(clss && (clss->type_op == type_class));
844 DEL_ARR_F(clss->attr.ca.members);
845 clss->attr.ca.members = NEW_ARR_F (entity *, 0);
846 for (i = 0; i < arity; i++) {
847 set_entity_owner(members[i], clss);
848 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
851 void remove_class_member(ir_type *clss, entity *member) {
853 assert(clss && (clss->type_op == type_class));
854 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
855 if (clss->attr.ca.members[i] == member) {
856 for (; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
857 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
858 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
864 void add_class_subtype (ir_type *clss, ir_type *subtype) {
866 assert(clss && (clss->type_op == type_class));
867 ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
868 for (i = 0; i < get_class_n_supertypes(subtype); i++)
869 if (get_class_supertype(subtype, i) == clss)
870 /* Class already registered */
872 ARR_APP1 (ir_type *, subtype->attr.ca.supertypes, clss);
874 int get_class_n_subtypes (const ir_type *clss) {
875 assert(clss && (clss->type_op == type_class));
876 return (ARR_LEN (clss->attr.ca.subtypes));
878 ir_type *get_class_subtype (ir_type *clss, int pos) {
879 assert(clss && (clss->type_op == type_class));
880 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
881 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
883 int get_class_subtype_index(ir_type *clss, const ir_type *subclass) {
884 int i, n_subtypes = get_class_n_subtypes(clss);
885 assert(is_Class_type(subclass));
886 for (i = 0; i < n_subtypes; ++i) {
887 if (get_class_subtype(clss, i) == subclass) return i;
891 void set_class_subtype (ir_type *clss, ir_type *subtype, int pos) {
892 assert(clss && (clss->type_op == type_class));
893 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
894 clss->attr.ca.subtypes[pos] = subtype;
896 void remove_class_subtype(ir_type *clss, ir_type *subtype) {
898 assert(clss && (clss->type_op == type_class));
899 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
900 if (clss->attr.ca.subtypes[i] == subtype) {
901 for (; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
902 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
903 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
908 void add_class_supertype (ir_type *clss, ir_type *supertype) {
910 assert(clss && (clss->type_op == type_class));
911 assert(supertype && (supertype -> type_op == type_class));
912 ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
913 for (i = get_class_n_subtypes(supertype) - 1; i >= 0; --i)
914 if (get_class_subtype(supertype, i) == clss)
915 /* Class already registered */
917 ARR_APP1 (ir_type *, supertype->attr.ca.subtypes, clss);
919 int get_class_n_supertypes (const ir_type *clss) {
920 assert(clss && (clss->type_op == type_class));
921 return (ARR_LEN (clss->attr.ca.supertypes));
923 int get_class_supertype_index(ir_type *clss, ir_type *super_clss) {
924 int i, n_supertypes = get_class_n_supertypes(clss);
925 assert(super_clss && (super_clss->type_op == type_class));
926 for (i = 0; i < n_supertypes; i++)
927 if (get_class_supertype(clss, i) == super_clss)
931 ir_type *get_class_supertype (ir_type *clss, int pos) {
932 assert(clss && (clss->type_op == type_class));
933 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
934 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
936 void set_class_supertype (ir_type *clss, ir_type *supertype, int pos) {
937 assert(clss && (clss->type_op == type_class));
938 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
939 clss->attr.ca.supertypes[pos] = supertype;
941 void remove_class_supertype(ir_type *clss, ir_type *supertype) {
943 assert(clss && (clss->type_op == type_class));
944 for (i = 0; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
945 if (clss->attr.ca.supertypes[i] == supertype) {
946 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
947 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
948 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
952 entity *get_class_type_info(const ir_type *clss) {
953 return clss->attr.ca.type_info;
955 void set_class_type_info(ir_type *clss, entity *ent) {
956 clss->attr.ca.type_info = ent;
958 ent->repr_class = clss;
961 const char *get_peculiarity_name(ir_peculiarity p) {
962 #define X(a) case a: return #a
964 X(peculiarity_description);
965 X(peculiarity_inherited);
966 X(peculiarity_existent);
969 return "invalid peculiarity";
972 ir_peculiarity get_class_peculiarity (const ir_type *clss) {
973 assert(clss && (clss->type_op == type_class));
974 return clss->attr.ca.peculiarity;
977 void set_class_peculiarity (ir_type *clss, ir_peculiarity pec) {
978 assert(clss && (clss->type_op == type_class));
979 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
980 clss->attr.ca.peculiarity = pec;
983 /* Returns the size of the virtual function table. */
984 unsigned (get_class_vtable_size)(const ir_type *clss) {
985 return _get_class_vtable_size(clss);
988 /* Sets a new size of the virtual function table. */
989 void (set_class_vtable_size)(ir_type *clss, unsigned size) {
990 _set_class_vtable_size(clss, size);
993 /* Returns non-zero if a class is final. */
994 int (is_class_final)(const ir_type *clss) {
995 return _is_class_final(clss);
998 /* Sets if a class is final. */
999 void (set_class_final)(ir_type *clss, int flag) {
1000 _set_class_final(clss, flag);
1003 /* Returns non-zero if a class is an interface. */
1004 int (is_class_interface)(const ir_type *clss) {
1005 return _is_class_interface(clss);
1008 /* Sets the class interface flag. */
1009 void (set_class_interface)(ir_type *clss, int flag) {
1010 _set_class_interface(clss, flag);
1013 /* Returns non-zero if a class is abstract. */
1014 int (is_class_abstract)(const ir_type *clss) {
1015 return _is_class_abstract(clss);
1018 /* Sets the class abstract flag. */
1019 void (set_class_abstract)(ir_type *clss, int final) {
1020 _set_class_abstract(clss, final);
1023 void set_class_dfn (ir_type *clss, int dfn) {
1024 clss->attr.ca.dfn = dfn;
1027 int get_class_dfn (const ir_type *clss) {
1028 return (clss->attr.ca.dfn);
1032 int (is_Class_type)(const ir_type *clss) {
1033 return _is_class_type(clss);
1036 void set_class_mode(ir_type *tp, ir_mode *mode) {
1037 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1038 assert(get_type_state(tp) == layout_fixed &&
1039 tp->size == get_mode_size_bits(mode) && "mode don't match class layout");
1043 void set_class_size_bits(ir_type *tp, int size) {
1044 /* argh: we must allow to set negative values as "invalid size" */
1045 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1046 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1049 /*----------------------------------------------------------------**/
1051 /*----------------------------------------------------------------**/
1053 /* create a new type struct */
1054 ir_type *new_d_type_struct(ident *name, dbg_info *db) {
1055 ir_type *res = new_type(type_struct, NULL, name, db);
1057 res->attr.sa.members = NEW_ARR_F(entity *, 0);
1062 ir_type *new_type_struct (ident *name) {
1063 return new_d_type_struct (name, NULL);
1066 void free_struct_entities (ir_type *strct) {
1068 assert(strct && (strct->type_op == type_struct));
1069 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
1070 free_entity(get_struct_member(strct, i));
1072 void free_struct_attrs (ir_type *strct) {
1073 assert(strct && (strct->type_op == type_struct));
1074 DEL_ARR_F(strct->attr.sa.members);
1077 /* manipulate private fields of struct */
1078 int get_struct_n_members (const ir_type *strct) {
1079 assert(strct && (strct->type_op == type_struct));
1080 return (ARR_LEN (strct->attr.sa.members));
1083 void add_struct_member (ir_type *strct, entity *member) {
1084 assert(strct && (strct->type_op == type_struct));
1085 assert(get_type_tpop(get_entity_type(member)) != type_method);
1086 /* @@@ lowerfirm geht nicht durch */
1087 assert(strct != get_entity_type(member) && "recursive type");
1088 ARR_APP1 (entity *, strct->attr.sa.members, member);
1091 entity *get_struct_member (const ir_type *strct, int pos) {
1092 assert(strct && (strct->type_op == type_struct));
1093 assert(pos >= 0 && pos < get_struct_n_members(strct));
1094 return strct->attr.sa.members[pos];
1097 int get_struct_member_index(const ir_type *strct, entity *mem) {
1099 assert(strct && (strct->type_op == type_struct));
1100 for (i = 0, n = get_struct_n_members(strct); i < n; ++i)
1101 if (get_struct_member(strct, i) == mem)
1106 void set_struct_member (ir_type *strct, int pos, entity *member) {
1107 assert(strct && (strct->type_op == type_struct));
1108 assert(pos >= 0 && pos < get_struct_n_members(strct));
1109 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
1110 strct->attr.sa.members[pos] = member;
1112 void remove_struct_member(ir_type *strct, entity *member) {
1114 assert(strct && (strct->type_op == type_struct));
1115 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
1116 if (strct->attr.sa.members[i] == member) {
1117 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
1118 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1119 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1125 int (is_Struct_type)(const ir_type *strct) {
1126 return _is_struct_type(strct);
1129 void set_struct_mode(ir_type *tp, ir_mode *mode) {
1130 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1131 assert(get_type_state(tp) == layout_fixed &&
1132 tp->size == get_mode_size_bits(mode) && "mode don't match struct layout");
1136 void set_struct_size_bits(ir_type *tp, int size) {
1137 /* argh: we must allow to set negative values as "invalid size" */
1138 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1139 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1142 /*******************************************************************/
1144 /*******************************************************************/
1147 * Lazy construction of value argument / result representation.
1148 * Constructs a struct type and its member. The types of the members
1149 * are passed in the argument list.
1151 * @param name name of the type constructed
1152 * @param len number of fields
1153 * @param tps array of field types with length len
1155 static INLINE ir_type *
1156 build_value_type(ident *name, int len, tp_ent_pair *tps) {
1158 ir_type *res = new_type_struct(name);
1159 res->flags |= tf_value_param_type;
1160 /* Remove type from type list. Must be treated differently than other types. */
1161 remove_irp_type(res);
1162 for (i = 0; i < len; i++) {
1163 ident *id = tps[i].param_name;
1165 /* use res as default if corresponding type is not yet set. */
1166 ir_type *elt_type = tps[i].tp ? tps[i].tp : res;
1168 /* use the parameter name if specified */
1170 id = mangle_u(name, get_type_ident(elt_type));
1171 tps[i].ent = new_entity(res, id, elt_type);
1172 set_entity_allocation(tps[i].ent, allocation_parameter);
1177 /* Create a new method type.
1178 N_param is the number of parameters, n_res the number of results. */
1179 ir_type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
1182 assert((get_mode_size_bytes(mode_P_code) != -1) && "unorthodox modes not implemented");
1183 res = new_type(type_method, mode_P_code, name, db);
1184 res->flags |= tf_layout_fixed;
1185 res->size = get_mode_size_bits(mode_P_code);
1186 res->attr.ma.n_params = n_param;
1187 res->attr.ma.params = xcalloc(n_param, sizeof(res->attr.ma.params[0]));
1188 res->attr.ma.value_params = NULL;
1189 res->attr.ma.n_res = n_res;
1190 res->attr.ma.res_type = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
1191 res->attr.ma.value_ress = NULL;
1192 res->attr.ma.variadicity = variadicity_non_variadic;
1193 res->attr.ma.first_variadic_param = -1;
1194 res->attr.ma.additional_properties = mtp_no_property;
1195 res->attr.ma.irg_calling_conv = default_cc_mask;
1200 ir_type *new_type_method(ident *name, int n_param, int n_res) {
1201 return new_d_type_method(name, n_param, n_res, NULL);
1204 void free_method_entities(ir_type *method) {
1205 assert(method && (method->type_op == type_method));
1208 /* Attention: also frees entities in value parameter subtypes! */
1209 void free_method_attrs(ir_type *method) {
1210 assert(method && (method->type_op == type_method));
1211 free(method->attr.ma.params);
1212 free(method->attr.ma.res_type);
1213 if (method->attr.ma.value_params) {
1214 free_type_entities(method->attr.ma.value_params);
1215 free_type(method->attr.ma.value_params);
1217 if (method->attr.ma.value_ress) {
1218 free_type_entities(method->attr.ma.value_ress);
1219 free_type(method->attr.ma.value_ress);
1223 /* manipulate private fields of method. */
1224 int (get_method_n_params)(const ir_type *method) {
1225 return _get_method_n_params(method);
1228 /* Returns the type of the parameter at position pos of a method. */
1229 ir_type *get_method_param_type(ir_type *method, int pos) {
1231 assert(method && (method->type_op == type_method));
1232 assert(pos >= 0 && pos < get_method_n_params(method));
1233 res = method->attr.ma.params[pos].tp;
1234 assert(res != NULL && "empty method param type");
1235 return method->attr.ma.params[pos].tp = skip_tid(res);
1238 void set_method_param_type(ir_type *method, int pos, ir_type *tp) {
1239 assert(method && (method->type_op == type_method));
1240 assert(pos >= 0 && pos < get_method_n_params(method));
1241 method->attr.ma.params[pos].tp = tp;
1242 /* If information constructed set pass-by-value representation. */
1243 if (method->attr.ma.value_params) {
1244 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1245 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1249 /* Returns an ident representing the parameters name. Returns NULL if not set.
1250 For debug support only. */
1251 ident *get_method_param_ident(ir_type *method, int pos) {
1252 assert(method && (method->type_op == type_method));
1253 assert(pos >= 0 && pos < get_method_n_params(method));
1254 return method->attr.ma.params[pos].param_name;
1257 /* Returns a string representing the parameters name. Returns NULL if not set.
1258 For debug support only. */
1259 const char *get_method_param_name(ir_type *method, int pos) {
1260 ident *id = get_method_param_ident(method, pos);
1261 return id ? get_id_str(id) : NULL;
1264 /* Sets an ident representing the parameters name. For debug support only. */
1265 void set_method_param_ident(ir_type *method, int pos, ident *id) {
1266 assert(method && (method->type_op == type_method));
1267 assert(pos >= 0 && pos < get_method_n_params(method));
1268 method->attr.ma.params[pos].param_name = id;
1271 /* Returns an entity that represents the copied value argument. Only necessary
1272 for compounds passed by value. */
1273 entity *get_method_value_param_ent(ir_type *method, int pos) {
1274 assert(method && (method->type_op == type_method));
1275 assert(pos >= 0 && pos < get_method_n_params(method));
1277 if (!method->attr.ma.value_params) {
1278 /* parameter value type not created yet, build */
1279 method->attr.ma.value_params
1280 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
1281 get_method_n_params(method), method->attr.ma.params);
1284 * build_value_type() sets the method->attr.ma.value_params type as default if
1287 assert((get_entity_type(method->attr.ma.params[pos].ent) != method->attr.ma.value_params)
1288 && "param type not yet set");
1289 return method->attr.ma.params[pos].ent;
1293 * Returns a type that represents the copied value arguments.
1295 ir_type *get_method_value_param_type(const ir_type *method)
1297 assert(method && (method->type_op == type_method));
1298 return method->attr.ma.value_params;
1301 int (get_method_n_ress)(const ir_type *method) {
1302 return _get_method_n_ress(method);
1305 ir_type *get_method_res_type(ir_type *method, int pos) {
1307 assert(method && (method->type_op == type_method));
1308 assert(pos >= 0 && pos < get_method_n_ress(method));
1309 res = method->attr.ma.res_type[pos].tp;
1310 assert(res != NULL && "empty method return type");
1311 return method->attr.ma.res_type[pos].tp = skip_tid(res);
1314 void set_method_res_type(ir_type *method, int pos, ir_type *tp) {
1315 assert(method && (method->type_op == type_method));
1316 assert(pos >= 0 && pos < get_method_n_ress(method));
1317 /* set the result ir_type */
1318 method->attr.ma.res_type[pos].tp = tp;
1319 /* If information constructed set pass-by-value representation. */
1320 if (method->attr.ma.value_ress) {
1321 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1322 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1326 /* Returns an entity that represents the copied value result. Only necessary
1327 for compounds passed by value. */
1328 entity *get_method_value_res_ent(ir_type *method, int pos) {
1329 assert(method && (method->type_op == type_method));
1330 assert(pos >= 0 && pos < get_method_n_ress(method));
1332 if (!method->attr.ma.value_ress) {
1333 /* result value type not created yet, build */
1334 method->attr.ma.value_ress
1335 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1336 get_method_n_ress(method), method->attr.ma.res_type);
1339 * build_value_type() sets the method->attr.ma.value_ress type as default if
1342 assert((get_entity_type(method->attr.ma.res_type[pos].ent) != method->attr.ma.value_ress)
1343 && "result type not yet set");
1345 return method->attr.ma.res_type[pos].ent;
1349 * Returns a type that represents the copied value results.
1351 ir_type *get_method_value_res_type(const ir_type *method) {
1352 assert(method && (method->type_op == type_method));
1353 return method->attr.ma.value_ress;
1356 /* Returns the null-terminated name of this variadicity. */
1357 const char *get_variadicity_name(variadicity vari)
1359 #define X(a) case a: return #a
1361 X(variadicity_non_variadic);
1362 X(variadicity_variadic);
1369 variadicity get_method_variadicity(const ir_type *method)
1371 assert(method && (method->type_op == type_method));
1372 return method->attr.ma.variadicity;
1375 void set_method_variadicity(ir_type *method, variadicity vari)
1377 assert(method && (method->type_op == type_method));
1378 method->attr.ma.variadicity = vari;
1382 * Returns the first variadic parameter index of a type.
1383 * If this index was NOT set, the index of the last parameter
1384 * of the method type plus one is returned for variadic functions.
1385 * Non-variadic function types always return -1 here.
1387 int get_method_first_variadic_param_index(const ir_type *method)
1389 assert(method && (method->type_op == type_method));
1391 if (method->attr.ma.variadicity == variadicity_non_variadic)
1394 if (method->attr.ma.first_variadic_param == -1)
1395 return get_method_n_params(method);
1396 return method->attr.ma.first_variadic_param;
1400 * Sets the first variadic parameter index. This allows to specify
1401 * a complete call type (containing the type of all parameters)
1402 * but still have the knowledge, which parameter must be passed as
1405 void set_method_first_variadic_param_index(ir_type *method, int index)
1407 assert(method && (method->type_op == type_method));
1408 assert(index >= 0 && index <= get_method_n_params(method));
1410 method->attr.ma.first_variadic_param = index;
1413 unsigned (get_method_additional_properties)(const ir_type *method) {
1414 return _get_method_additional_properties(method);
1417 void (set_method_additional_properties)(ir_type *method, unsigned mask) {
1418 _set_method_additional_properties(method, mask);
1421 void (set_method_additional_property)(ir_type *method, mtp_additional_property flag) {
1422 _set_method_additional_property(method, flag);
1425 /* Returns the calling convention of an entities graph. */
1426 unsigned (get_method_calling_convention)(const ir_type *method) {
1427 return _get_method_calling_convention(method);
1430 /* Sets the calling convention of an entities graph. */
1431 void (set_method_calling_convention)(ir_type *method, unsigned cc_mask) {
1432 _set_method_calling_convention(method, cc_mask);
1435 /* Returns the number of registers parameters, 0 means default. */
1436 unsigned get_method_n_regparams(ir_type *method) {
1437 unsigned cc = get_method_calling_convention(method);
1438 assert(IS_FASTCALL(cc));
1440 return cc & ~cc_bits;
1443 /* Sets the number of registers parameters, 0 means default. */
1444 void set_method_n_regparams(ir_type *method, unsigned n_regs) {
1445 unsigned cc = get_method_calling_convention(method);
1446 assert(IS_FASTCALL(cc));
1448 set_method_calling_convention(method, (cc & cc_bits) | (n_regs & ~cc_bits));
1452 int (is_Method_type)(const ir_type *method) {
1453 return _is_method_type(method);
1456 /*-----------------------------------------------------------------*/
1458 /*-----------------------------------------------------------------*/
1460 /* create a new type uni */
1461 ir_type *new_d_type_union(ident *name, dbg_info *db) {
1462 ir_type *res = new_type(type_union, NULL, name, db);
1464 res->attr.ua.members = NEW_ARR_F(entity *, 0);
1469 ir_type *new_type_union(ident *name) {
1470 return new_d_type_union(name, NULL);
1473 void free_union_entities(ir_type *uni) {
1475 assert(uni && (uni->type_op == type_union));
1476 for (i = get_union_n_members(uni) - 1; i >= 0; --i)
1477 free_entity(get_union_member(uni, i));
1480 void free_union_attrs (ir_type *uni) {
1481 assert(uni && (uni->type_op == type_union));
1482 DEL_ARR_F(uni->attr.ua.members);
1485 /* manipulate private fields of union */
1486 int get_union_n_members (const ir_type *uni) {
1487 assert(uni && (uni->type_op == type_union));
1488 return (ARR_LEN (uni->attr.ua.members));
1490 void add_union_member (ir_type *uni, entity *member) {
1491 assert(uni && (uni->type_op == type_union));
1492 assert(uni != get_entity_type(member) && "recursive type");
1493 ARR_APP1 (entity *, uni->attr.ua.members, member);
1495 entity *get_union_member (const ir_type *uni, int pos) {
1496 assert(uni && (uni->type_op == type_union));
1497 assert(pos >= 0 && pos < get_union_n_members(uni));
1498 return uni->attr.ua.members[pos];
1500 int get_union_member_index(const ir_type *uni, entity *mem) {
1502 assert(uni && (uni->type_op == type_union));
1503 for (i = 0, n = get_union_n_members(uni); i < n; ++i)
1504 if (get_union_member(uni, i) == mem)
1508 void set_union_member (ir_type *uni, int pos, entity *member) {
1509 assert(uni && (uni->type_op == type_union));
1510 assert(pos >= 0 && pos < get_union_n_members(uni));
1511 uni->attr.ua.members[pos] = member;
1513 void remove_union_member(ir_type *uni, entity *member) {
1515 assert(uni && (uni->type_op == type_union));
1516 for (i = 0; i < (ARR_LEN (uni->attr.ua.members)); i++)
1517 if (uni->attr.ua.members[i] == member) {
1518 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1519 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1520 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1526 int (is_Union_type)(const ir_type *uni) {
1527 return _is_union_type(uni);
1530 void set_union_size_bits(ir_type *tp, int size) {
1531 /* argh: we must allow to set negative values as "invalid size" */
1532 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1533 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1536 /*-----------------------------------------------------------------*/
1538 /*-----------------------------------------------------------------*/
1541 /* create a new type array -- set dimension sizes independently */
1542 ir_type *new_d_type_array(ident *name, int n_dimensions, ir_type *element_type, dbg_info *db) {
1546 ir_graph *rem = current_ir_graph;
1548 assert(!is_Method_type(element_type));
1550 res = new_type(type_array, NULL, name, db);
1551 res->attr.aa.n_dimensions = n_dimensions;
1552 res->attr.aa.lower_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
1553 res->attr.aa.upper_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
1554 res->attr.aa.order = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));
1556 current_ir_graph = get_const_code_irg();
1557 unk = new_Unknown( mode_Iu);
1558 for (i = 0; i < n_dimensions; i++) {
1559 res->attr.aa.lower_bound[i] =
1560 res->attr.aa.upper_bound[i] = unk;
1561 res->attr.aa.order[i] = i;
1563 current_ir_graph = rem;
1565 res->attr.aa.element_type = element_type;
1566 new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1571 ir_type *new_type_array(ident *name, int n_dimensions, ir_type *element_type) {
1572 return new_d_type_array(name, n_dimensions, element_type, NULL);
1575 void free_array_automatic_entities(ir_type *array) {
1576 assert(array && (array->type_op == type_array));
1577 free_entity(get_array_element_entity(array));
1580 void free_array_entities (ir_type *array) {
1581 assert(array && (array->type_op == type_array));
1584 void free_array_attrs (ir_type *array) {
1585 assert(array && (array->type_op == type_array));
1586 free(array->attr.aa.lower_bound);
1587 free(array->attr.aa.upper_bound);
1588 free(array->attr.aa.order);
1591 /* manipulate private fields of array ir_type */
1592 int get_array_n_dimensions (const ir_type *array) {
1593 assert(array && (array->type_op == type_array));
1594 return array->attr.aa.n_dimensions;
1598 set_array_bounds (ir_type *array, int dimension, ir_node * lower_bound,
1599 ir_node * upper_bound) {
1600 assert(array && (array->type_op == type_array));
1601 assert(lower_bound && "lower_bound node may not be NULL.");
1602 assert(upper_bound && "upper_bound node may not be NULL.");
1603 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1604 array->attr.aa.lower_bound[dimension] = lower_bound;
1605 array->attr.aa.upper_bound[dimension] = upper_bound;
1608 set_array_bounds_int (ir_type *array, int dimension, int lower_bound,
1610 ir_graph *rem = current_ir_graph;
1611 current_ir_graph = get_const_code_irg();
1612 set_array_bounds (array, dimension,
1613 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1614 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1615 current_ir_graph = rem;
1618 set_array_lower_bound (ir_type *array, int dimension, ir_node * lower_bound) {
1619 assert(array && (array->type_op == type_array));
1620 assert(lower_bound && "lower_bound node may not be NULL.");
1621 array->attr.aa.lower_bound[dimension] = lower_bound;
1623 void set_array_lower_bound_int (ir_type *array, int dimension, int lower_bound) {
1624 ir_graph *rem = current_ir_graph;
1625 current_ir_graph = get_const_code_irg();
1626 set_array_lower_bound (array, dimension,
1627 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1628 current_ir_graph = rem;
1631 set_array_upper_bound (ir_type *array, int dimension, ir_node * upper_bound) {
1632 assert(array && (array->type_op == type_array));
1633 assert(upper_bound && "upper_bound node may not be NULL.");
1634 array->attr.aa.upper_bound[dimension] = upper_bound;
1636 void set_array_upper_bound_int (ir_type *array, int dimension, int upper_bound) {
1637 ir_graph *rem = current_ir_graph;
1638 current_ir_graph = get_const_code_irg();
1639 set_array_upper_bound (array, dimension,
1640 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1641 current_ir_graph = rem;
1643 int has_array_lower_bound (const ir_type *array, int dimension) {
1644 assert(array && (array->type_op == type_array));
1645 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1647 ir_node *get_array_lower_bound (const ir_type *array, int dimension) {
1648 assert(array && (array->type_op == type_array));
1649 return array->attr.aa.lower_bound[dimension];
1651 long get_array_lower_bound_int (const ir_type *array, int dimension) {
1653 assert(array && (array->type_op == type_array));
1654 node = array->attr.aa.lower_bound[dimension];
1655 assert(get_irn_op(node) == op_Const);
1656 return get_tarval_long(get_Const_tarval(node));
1658 int has_array_upper_bound (const ir_type *array, int dimension) {
1659 assert(array && (array->type_op == type_array));
1660 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1662 ir_node * get_array_upper_bound (const ir_type *array, int dimension) {
1663 assert(array && (array->type_op == type_array));
1664 return array->attr.aa.upper_bound[dimension];
1666 long get_array_upper_bound_int (const ir_type *array, int dimension) {
1668 assert(array && (array->type_op == type_array));
1669 node = array->attr.aa.upper_bound[dimension];
1670 assert(get_irn_op(node) == op_Const);
1671 return get_tarval_long(get_Const_tarval(node));
1674 void set_array_order (ir_type *array, int dimension, int order) {
1675 assert(array && (array->type_op == type_array));
1676 array->attr.aa.order[dimension] = order;
1679 int get_array_order (const ir_type *array, int dimension) {
1680 assert(array && (array->type_op == type_array));
1681 return array->attr.aa.order[dimension];
1684 int find_array_dimension(const ir_type *array, int order) {
1687 assert(array && (array->type_op == type_array));
1689 for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
1690 if (array->attr.aa.order[dim] == order)
1696 void set_array_element_type (ir_type *array, ir_type *tp) {
1697 assert(array && (array->type_op == type_array));
1698 assert(!is_Method_type(tp));
1699 array->attr.aa.element_type = tp;
1701 ir_type *get_array_element_type (ir_type *array) {
1702 assert(array && (array->type_op == type_array));
1703 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1706 void set_array_element_entity (ir_type *array, entity *ent) {
1707 assert(array && (array->type_op == type_array));
1708 assert((get_entity_type(ent)->type_op != type_method));
1709 array->attr.aa.element_ent = ent;
1710 array->attr.aa.element_type = get_entity_type(ent);
1712 entity *get_array_element_entity (const ir_type *array) {
1713 assert(array && (array->type_op == type_array));
1714 return array->attr.aa.element_ent;
1718 int (is_Array_type)(const ir_type *array) {
1719 return _is_array_type(array);
1722 void set_array_size_bits(ir_type *tp, int size) {
1723 /* FIXME: Here we should make some checks with the element type size */
1726 /*-----------------------------------------------------------------*/
1727 /* TYPE_ENUMERATION */
1728 /*-----------------------------------------------------------------*/
1730 /* create a new type enumeration -- set the enumerators independently */
1731 ir_type *new_d_type_enumeration(ident *name, int n_enums, dbg_info *db) {
1734 assert(n_enums >= 0);
1735 res = new_type(type_enumeration, NULL, name, db);
1736 res->attr.ea.enumer = NEW_ARR_F(ir_enum_const, n_enums);
1741 ir_type *new_type_enumeration(ident *name, int n_enums) {
1742 return new_d_type_enumeration(name, n_enums, NULL);
1745 void free_enumeration_entities(ir_type *enumeration) {
1746 assert(enumeration && (enumeration->type_op == type_enumeration));
1748 void free_enumeration_attrs(ir_type *enumeration) {
1749 assert(enumeration && (enumeration->type_op == type_enumeration));
1750 DEL_ARR_F(enumeration->attr.ea.enumer);
1753 /* manipulate fields of enumeration type. */
1754 int get_enumeration_n_enums(const ir_type *enumeration) {
1755 assert(enumeration && (enumeration->type_op == type_enumeration));
1756 return ARR_LEN(enumeration->attr.ea.enumer);
1759 /* create a new constant */
1760 void set_enumeration_const(ir_type *enumeration, int pos, ident *nameid, tarval *con) {
1761 assert(0 <= pos && pos < ARR_LEN(enumeration->attr.ea.enumer));
1762 enumeration->attr.ea.enumer[pos].nameid = nameid;
1763 enumeration->attr.ea.enumer[pos].value = con;
1764 enumeration->attr.ea.enumer[pos].owner = enumeration;
1767 ir_enum_const *get_enumeration_const(const ir_type *enumeration, int pos) {
1768 assert(enumeration && (enumeration->type_op == type_enumeration));
1769 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1770 return &enumeration->attr.ea.enumer[pos];
1773 ir_type *get_enumeration_owner(const ir_enum_const *enum_cnst) {
1774 return enum_cnst->owner;
1776 void set_enumeration_value(ir_enum_const *enum_cnst, tarval *con) {
1777 enum_cnst->value = con;
1779 tarval *get_enumeration_value(const ir_enum_const *enum_cnst) {
1780 return enum_cnst->value;
1782 void set_enumeration_nameid(ir_enum_const *enum_cnst, ident *id) {
1783 enum_cnst->nameid = id;
1785 ident *get_enumeration_nameid(const ir_enum_const *enum_cnst) {
1786 return enum_cnst->nameid;
1788 const char *get_enumeration_name(const ir_enum_const *enum_cnst) {
1789 return get_id_str(enum_cnst->nameid);
1793 int (is_Enumeration_type)(const ir_type *enumeration) {
1794 return _is_enumeration_type(enumeration);
1797 void set_enumeration_mode(ir_type *tp, ir_mode *mode) {
1798 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1799 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1800 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1802 tp->size = get_mode_size_bits(mode);
1806 /*-----------------------------------------------------------------*/
1808 /*-----------------------------------------------------------------*/
1810 /* Create a new type pointer */
1811 ir_type *new_d_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode, dbg_info *db) {
1814 assert(mode_is_reference(ptr_mode));
1815 res = new_type(type_pointer, ptr_mode, name, db);
1816 res->attr.pa.points_to = points_to;
1817 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1818 res->size = get_mode_size_bits(res->mode);
1819 res->flags |= tf_layout_fixed;
1824 ir_type *new_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode) {
1825 return new_d_type_pointer(name, points_to, ptr_mode, NULL);
1828 void free_pointer_entities (ir_type *pointer) {
1829 assert(pointer && (pointer->type_op == type_pointer));
1832 void free_pointer_attrs (ir_type *pointer) {
1833 assert(pointer && (pointer->type_op == type_pointer));
1836 /* manipulate fields of type_pointer */
1837 void set_pointer_points_to_type (ir_type *pointer, ir_type *tp) {
1838 assert(pointer && (pointer->type_op == type_pointer));
1839 pointer->attr.pa.points_to = tp;
1842 ir_type *get_pointer_points_to_type (ir_type *pointer) {
1843 assert(pointer && (pointer->type_op == type_pointer));
1844 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1848 int (is_Pointer_type)(const ir_type *pointer) {
1849 return _is_pointer_type(pointer);
1852 void set_pointer_mode(ir_type *tp, ir_mode *mode) {
1853 assert(mode_is_reference(mode) && "Modes of pointers must be references");
1854 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1855 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1857 tp->size = get_mode_size_bits(mode);
1861 /* Returns the first pointer type that has as points_to tp.
1862 * Not efficient: O(#types).
1863 * If not found returns firm_unknown_type. */
1864 ir_type *find_pointer_type_to_type (ir_type *tp) {
1865 int i, n = get_irp_n_types();
1866 for (i = 0; i < n; ++i) {
1867 ir_type *found = get_irp_type(i);
1868 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1871 return firm_unknown_type;
1875 /*-----------------------------------------------------------------*/
1876 /* TYPE_PRIMITIVE */
1877 /*-----------------------------------------------------------------*/
1879 /* create a new type primitive */
1880 ir_type *new_d_type_primitive(ident *name, ir_mode *mode, dbg_info *db) {
1882 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1883 res = new_type(type_primitive, mode, name, db);
1884 res->size = get_mode_size_bits(mode);
1885 res->flags |= tf_layout_fixed;
1890 ir_type *new_type_primitive(ident *name, ir_mode *mode) {
1891 return new_d_type_primitive(name, mode, NULL);
1895 int (is_Primitive_type)(const ir_type *primitive) {
1896 return _is_primitive_type(primitive);
1899 void set_primitive_mode(ir_type *tp, ir_mode *mode) {
1900 /* Modes of primitives must be data */
1901 assert(mode_is_data(mode));
1903 /* For primitive size depends on the mode. */
1904 tp->size = get_mode_size_bits(mode);
1909 /*-----------------------------------------------------------------*/
1910 /* common functionality */
1911 /*-----------------------------------------------------------------*/
1914 int (is_atomic_type)(const ir_type *tp) {
1915 return _is_atomic_type(tp);
1919 * Gets the number of elements in a firm compound type.
1921 int get_compound_n_members(const ir_type *tp)
1923 const tp_op *op = get_type_tpop(tp);
1926 if (op->ops.get_n_members)
1927 res = op->ops.get_n_members(tp);
1929 assert(0 && "no member count for this type");
1935 * Gets the member of a firm compound type at position pos.
1937 entity *get_compound_member(const ir_type *tp, int pos)
1939 const tp_op *op = get_type_tpop(tp);
1942 if (op->ops.get_member)
1943 res = op->ops.get_member(tp, pos);
1945 assert(0 && "no members in this type");
1950 /* Returns index of member in tp, -1 if not contained. */
1951 int get_compound_member_index(const ir_type *tp, entity *member)
1953 const tp_op *op = get_type_tpop(tp);
1956 if (op->ops.get_member_index)
1957 index = op->ops.get_member_index(tp, member);
1959 assert(0 && "no members in this type");
1964 int is_compound_type(const ir_type *tp) {
1965 assert(tp && tp->kind == k_type);
1966 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
1969 /* Checks, whether a type is a frame type */
1970 int is_frame_type(const ir_type *tp) {
1971 return tp->flags & tf_frame_type;
1974 /* Checks, whether a type is a value parameter type */
1975 int is_value_param_type(const ir_type *tp) {
1976 return tp->flags & tf_value_param_type;
1979 /* Checks, whether a type is a lowered type */
1980 int is_lowered_type(const ir_type *tp) {
1981 return tp->flags & tf_lowered_type;
1984 /* Makes a new frame type. */
1985 ir_type *new_type_frame(ident *name)
1987 ir_type *res = new_type_class(name);
1989 res->flags |= tf_frame_type;
1991 /* Remove type from type list. Must be treated differently than other types. */
1992 remove_irp_type(res);
1994 /* It is not possible to derive from the frame type. Set the final flag. */
1995 set_class_final(res, 1);
2000 /* Sets a lowered type for a type. This sets both associations. */
2001 void set_lowered_type(ir_type *tp, ir_type *lowered_type) {
2002 assert(is_type(tp) && is_type(lowered_type));
2003 lowered_type->flags |= tf_lowered_type;
2004 tp->assoc_type = lowered_type;
2005 lowered_type->assoc_type = tp;
2009 * Gets the lowered/unlowered type of a type or NULL if this type
2010 * has no lowered/unlowered one.
2012 ir_type *get_associated_type(const ir_type *tp) {
2013 return tp->assoc_type;
2016 /* set the type size for the unknown and none ir_type */
2017 void set_default_size_bits(ir_type *tp, int size) {
2022 * Allocate an area of size bytes aligned at alignment
2023 * at the start or the end of a frame type.
2024 * The frame type must have already an fixed layout.
2026 entity *frame_alloc_area(ir_type *frame_type, int size, int alignment, int at_start)
2032 int frame_align, i, offset, frame_size;
2033 static unsigned area_cnt = 0;
2034 static ir_type *a_byte = NULL;
2036 assert(is_frame_type(frame_type));
2037 assert(get_type_state(frame_type) == layout_fixed);
2040 a_byte = new_type_primitive(new_id_from_chars("byte", 4), mode_Bu);
2042 snprintf(buf, sizeof(buf), "area%u", area_cnt++);
2043 name = new_id_from_str(buf);
2045 /* align the size */
2046 frame_align = get_type_alignment_bytes(frame_type);
2047 size = (size + frame_align - 1) & -frame_align;
2049 tp = new_type_array(mangle_u(get_type_ident(frame_type), name), 1, a_byte);
2050 set_array_bounds_int(tp, 0, 0, size);
2051 set_type_alignment_bytes(tp, alignment);
2053 frame_size = get_type_size_bytes(frame_type);
2055 /* fix all offsets so far */
2056 for (i = get_class_n_members(frame_type) - 1; i >= 0; --i) {
2057 entity *ent = get_class_member(frame_type, i);
2059 set_entity_offset_bytes(ent, get_entity_offset_bytes(ent) + size);
2061 /* calculate offset and new type size */
2066 /* calculate offset and new type size */
2067 offset = (frame_size + alignment - 1) & -alignment;
2068 frame_size = offset + size;
2071 area = new_entity(frame_type, name, tp);
2072 set_entity_offset_bytes(area, offset);
2073 set_type_size_bytes(frame_type, frame_size);
2075 /* mark this entity as compiler generated */
2076 set_entity_compiler_generated(area, 1);