2 * Copyright (C) 1995-2007 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
74 /*-----------------------------------------------------------------*/
76 /*-----------------------------------------------------------------*/
78 ir_type *firm_none_type; ir_type *get_none_type(void) { return firm_none_type; }
79 ir_type *firm_unknown_type; ir_type *get_unknown_type(void) { return firm_unknown_type; }
82 /* Suffixes added to types used for pass-by-value representations. */
83 static ident *value_params_suffix = NULL;
84 static ident *value_ress_suffix = NULL;
86 /** The default calling convention for method types. */
87 static unsigned default_cc_mask;
89 /* return the default calling convention for method types */
90 unsigned get_default_cc_mask(void) {
91 return default_cc_mask;
94 /* Initialize the type module. */
95 void firm_init_type(dbg_info *builtin_db, unsigned def_cc_mask) {
96 default_cc_mask = def_cc_mask;
97 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
98 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
100 /* construct none and unknown type. */
101 firm_none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"), builtin_db);
102 set_type_size_bits(firm_none_type, 0);
103 set_type_state (firm_none_type, layout_fixed);
104 remove_irp_type(firm_none_type);
106 firm_unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"), builtin_db);
107 set_type_size_bits(firm_unknown_type, 0);
108 set_type_state (firm_unknown_type, layout_fixed);
109 remove_irp_type(firm_unknown_type);
112 /** the global type visited flag */
113 unsigned long firm_type_visited;
115 void (set_master_type_visited)(unsigned long val) { _set_master_type_visited(val); }
116 unsigned long (get_master_type_visited)(void) { return _get_master_type_visited(); }
117 void (inc_master_type_visited)(void) { _inc_master_type_visited(); }
120 * Creates a new type representation.
123 new_type(tp_op *type_op, ir_mode *mode, ident *name, dbg_info *db) {
127 assert(type_op != type_id);
128 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
130 node_size = offsetof(ir_type, attr) + type_op->attr_size;
131 res = xmalloc(node_size);
132 memset(res, 0, node_size);
135 res->type_op = type_op;
138 res->visibility = visibility_external_allocated;
139 res->flags = tf_none;
145 res->assoc_type = NULL;
147 res->nr = get_irp_new_node_nr();
148 #endif /* defined DEBUG_libfirm */
150 add_irp_type(res); /* Remember the new type global. */
155 void free_type(ir_type *tp) {
156 const tp_op *op = get_type_tpop(tp);
158 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
160 /* Remove from list of all types */
162 /* Free the attributes of the type. */
164 /* Free entities automatically allocated with the ir_type */
165 if (op->ops.free_auto_entities)
166 op->ops.free_auto_entities(tp);
167 /* And now the type itself... */
172 void free_type_entities(ir_type *tp) {
173 const tp_op *tpop = get_type_tpop(tp);
175 if (tpop->ops.free_entities)
176 tpop->ops.free_entities(tp);
179 void free_type_attrs(ir_type *tp) {
180 const tp_op *tpop = get_type_tpop(tp);
182 if (tpop->ops.free_attrs)
183 tpop->ops.free_attrs(tp);
186 /* set/get the link field */
187 void *(get_type_link)(const ir_type *tp) {
188 return _get_type_link(tp);
191 void (set_type_link)(ir_type *tp, void *l) {
192 _set_type_link(tp, l);
195 const tp_op *(get_type_tpop)(const ir_type *tp) {
196 return _get_type_tpop(tp);
199 ident *(get_type_tpop_nameid)(const ir_type *tp) {
200 return _get_type_tpop_nameid(tp);
203 const char* get_type_tpop_name(const ir_type *tp) {
204 assert(tp && tp->kind == k_type);
205 return get_id_str(tp->type_op->name);
208 tp_opcode (get_type_tpop_code)(const ir_type *tp) {
209 return _get_type_tpop_code(tp);
212 ir_mode *(get_type_mode)(const ir_type *tp) {
213 return _get_type_mode(tp);
216 void set_type_mode(ir_type *tp, ir_mode *mode) {
217 const tp_op *tpop = get_type_tpop(tp);
219 if (tpop->ops.set_type_mode)
220 tpop->ops.set_type_mode(tp, mode);
222 assert(0 && "setting a mode is NOT allowed for this type");
225 ident *(get_type_ident)(const ir_type *tp) {
226 return _get_type_ident(tp);
229 void (set_type_ident)(ir_type *tp, ident* id) {
230 _set_type_ident(tp, id);
233 /* Outputs a unique number for this node */
234 long get_type_nr(const ir_type *tp) {
239 return (long)PTR_TO_INT(tp);
243 const char *get_type_name(const ir_type *tp) {
244 assert(tp && tp->kind == k_type);
245 return (get_id_str(tp->name));
248 int (get_type_size_bytes)(const ir_type *tp) {
249 return _get_type_size_bytes(tp);
252 int (get_type_size_bits)(const ir_type *tp) {
253 return _get_type_size_bits(tp);
257 ir_visibility get_type_visibility(const ir_type *tp) {
259 visibility res = visibility_local;
260 if (is_compound_type(tp)) {
262 if (is_Array_type(tp)) {
263 ir_entity *mem = get_array_element_entity(tp);
264 if (get_entity_visibility(mem) != visibility_local)
265 res = visibility_external_visible;
267 int i, n_mems = get_compound_n_members(tp);
268 for (i = 0; i < n_mems; ++i) {
269 ir_entity *mem = get_compound_member(tp, i);
270 if (get_entity_visibility(mem) != visibility_local)
271 res = visibility_external_visible;
278 return tp->visibility;
281 void set_type_visibility(ir_type *tp, ir_visibility v) {
284 /* check for correctness */
285 if (v != visibility_external_allocated) {
286 visibility res = visibility_local;
287 if (is_compound_type(tp)) {
288 if (is_Array_type(tp)) {
289 ir_entity *mem = get_array_element_entity(tp);
290 if (get_entity_visibility(mem) > res)
291 res = get_entity_visibility(mem);
293 int i, n_mems = get_compound_n_members(tp);
294 for (i = 0; i < n_mems; ++i) {
295 ir_entity *mem = get_compound_member(tp, i);
296 if (get_entity_visibility(mem) > res)
297 res = get_entity_visibility(mem);
308 set_type_size_bits(ir_type *tp, int size) {
309 const tp_op *tpop = get_type_tpop(tp);
311 if (tpop->ops.set_type_size)
312 tpop->ops.set_type_size(tp, size);
314 assert(0 && "Cannot set size for this type");
318 set_type_size_bytes(ir_type *tp, int size) {
319 set_type_size_bits(tp, 8*size);
322 int get_type_alignment_bytes(ir_type *tp) {
323 int align = get_type_alignment_bits(tp);
325 return align < 0 ? align : (align + 7) >> 3;
328 int get_type_alignment_bits(ir_type *tp) {
334 /* alignment NOT set calculate it "on demand" */
336 align = get_mode_size_bits(tp->mode);
337 else if (is_Array_type(tp))
338 align = get_type_alignment_bits(get_array_element_type(tp));
339 else if (is_compound_type(tp)) {
340 int i, n = get_compound_n_members(tp);
343 for (i = 0; i < n; ++i) {
344 ir_type *t = get_entity_type(get_compound_member(tp, i));
345 int a = get_type_alignment_bits(t);
350 } else if (is_Method_type(tp)) {
361 set_type_alignment_bits(ir_type *tp, int align) {
362 assert(tp && tp->kind == k_type);
363 assert((align == -1 || (align & (align - 1)) == 0) && "type alignment not power of two");
364 /* Methods don't have an alignment. */
365 if (tp->type_op != type_method) {
371 set_type_alignment_bytes(ir_type *tp, int align) {
373 set_type_alignment_bits(tp, -1);
375 set_type_alignment_bits(tp, 8*align);
379 /* Returns a human readable string for the enum entry. */
380 const char *get_type_state_name(type_state s) {
381 #define X(a) case a: return #a;
391 type_state (get_type_state)(const ir_type *tp) {
392 return _get_type_state(tp);
396 set_type_state(ir_type *tp, type_state state) {
397 assert(tp && tp->kind == k_type);
399 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
400 (tp->type_op == type_method))
403 /* Just a correctness check: */
404 if (state == layout_fixed) {
406 switch (get_type_tpop_code(tp)) {
408 assert(get_type_size_bits(tp) > -1);
409 if (tp != get_glob_type()) {
410 int n_mem = get_class_n_members(tp);
411 for (i = 0; i < n_mem; i++) {
412 assert(get_entity_offset(get_class_member(tp, i)) > -1);
414 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
415 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
421 assert(get_type_size_bits(tp) > -1);
422 for (i = 0; i < get_struct_n_members(tp); i++) {
423 assert(get_entity_offset(get_struct_member(tp, i)) > -1);
424 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
433 Assure that only innermost dimension is dynamic? */
435 case tpo_enumeration:
437 assert(get_type_mode != NULL);
438 for (i = get_enumeration_n_enums(tp) - 1; i >= 0; --i) {
439 ir_enum_const *ec = get_enumeration_const(tp, i);
440 tarval *tv = get_enumeration_value(ec);
441 assert(tv != NULL && tv != tarval_bad);
448 if (state == layout_fixed)
449 tp->flags |= tf_layout_fixed;
451 tp->flags &= ~tf_layout_fixed;
454 unsigned long (get_type_visited)(const ir_type *tp) {
455 return _get_type_visited(tp);
458 void (set_type_visited)(ir_type *tp, unsigned long num) {
459 _set_type_visited(tp, num);
462 /* Sets visited field in type to type_visited. */
463 void (mark_type_visited)(ir_type *tp) {
464 _mark_type_visited(tp);
467 int (type_visited)(const ir_type *tp) {
468 return _type_visited(tp);
471 int (type_not_visited)(const ir_type *tp) {
472 return _type_not_visited(tp);
475 dbg_info *(get_type_dbg_info)(const ir_type *tp) {
476 return _get_type_dbg_info(tp);
479 void (set_type_dbg_info)(ir_type *tp, dbg_info *db) {
480 _set_type_dbg_info(tp, db);
483 int (is_type)(const void *thing) {
484 return _is_type(thing);
487 /* Checks whether two types are structural equal.*/
488 int equal_type(ir_type *typ1, ir_type *typ2) {
493 if (typ1 == typ2) return 1;
495 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
496 (get_type_ident(typ1) != get_type_ident(typ2)) ||
497 (get_type_mode(typ1) != get_type_mode(typ2)) ||
498 (get_type_state(typ1) != get_type_state(typ2)))
500 if ((get_type_state(typ1) == layout_fixed) &&
501 (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
504 switch (get_type_tpop_code(typ1)) {
506 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
507 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
508 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
509 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
510 /** Compare the members **/
511 m = alloca(sizeof(ir_entity *) * get_class_n_members(typ1));
512 memset(m, 0, sizeof(ir_entity *) * get_class_n_members(typ1));
513 /* First sort the members of typ2 */
514 for (i = 0; i < get_class_n_members(typ1); i++) {
515 ir_entity *e1 = get_class_member(typ1, i);
516 for (j = 0; j < get_class_n_members(typ2); j++) {
517 ir_entity *e2 = get_class_member(typ2, j);
518 if (get_entity_name(e1) == get_entity_name(e2))
522 for (i = 0; i < get_class_n_members(typ1); i++) {
523 if (!m[i] || /* Found no counterpart */
524 !equal_entity(get_class_member(typ1, i), m[i]))
527 /** Compare the supertypes **/
528 t = alloca(sizeof(ir_entity *) * get_class_n_supertypes(typ1));
529 memset(t, 0, sizeof(ir_entity *) * get_class_n_supertypes(typ1));
530 /* First sort the supertypes of typ2 */
531 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
532 ir_type *t1 = get_class_supertype(typ1, i);
533 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
534 ir_type *t2 = get_class_supertype(typ2, j);
535 if (get_type_ident(t2) == get_type_ident(t1))
539 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
540 if (!t[i] || /* Found no counterpart */
541 get_class_supertype(typ1, i) != t[i])
547 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
548 m = alloca(sizeof(ir_entity *) * get_struct_n_members(typ1));
549 memset(m, 0, sizeof(ir_entity *) * get_struct_n_members(typ1));
550 /* First sort the members of lt */
551 for (i = 0; i < get_struct_n_members(typ1); i++) {
552 ir_entity *e1 = get_struct_member(typ1, i);
553 for (j = 0; j < get_struct_n_members(typ2); j++) {
554 ir_entity *e2 = get_struct_member(typ2, j);
555 if (get_entity_name(e1) == get_entity_name(e2))
559 for (i = 0; i < get_struct_n_members(typ1); i++) {
560 if (!m[i] || /* Found no counterpart */
561 !equal_entity(get_struct_member(typ1, i), m[i]))
567 int n_param1, n_param2;
569 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
570 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
571 if (get_method_calling_convention(typ1) !=
572 get_method_calling_convention(typ2)) return 0;
574 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
575 n_param1 = get_method_n_params(typ1);
576 n_param2 = get_method_n_params(typ2);
578 n_param1 = get_method_first_variadic_param_index(typ1);
579 n_param2 = get_method_first_variadic_param_index(typ2);
582 if (n_param1 != n_param2) return 0;
584 for (i = 0; i < n_param1; i++) {
585 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
588 for (i = 0; i < get_method_n_ress(typ1); i++) {
589 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
595 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
596 m = alloca(sizeof(ir_entity *) * get_union_n_members(typ1));
597 memset(m, 0, sizeof(ir_entity *) * get_union_n_members(typ1));
598 /* First sort the members of lt */
599 for (i = 0; i < get_union_n_members(typ1); i++) {
600 ir_entity *e1 = get_union_member(typ1, i);
601 for (j = 0; j < get_union_n_members(typ2); j++) {
602 ir_entity *e2 = get_union_member(typ2, j);
603 if (get_entity_name(e1) == get_entity_name(e2))
607 for (i = 0; i < get_union_n_members(typ1); i++) {
608 if (!m[i] || /* Found no counterpart */
609 !equal_entity(get_union_member(typ1, i), m[i]))
615 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
617 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
619 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
620 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
621 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
623 if (get_array_order(typ1, i) != get_array_order(typ2, i))
624 assert(0 && "type compare with different dimension orders not implemented");
628 case tpo_enumeration:
629 assert(0 && "enumerations not implemented");
633 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
645 /* Checks whether two types are structural comparable. */
646 int smaller_type(ir_type *st, ir_type *lt) {
648 int i, j, n_st_members;
650 if (st == lt) return 1;
652 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
655 switch(get_type_tpop_code(st)) {
657 return is_SubClass_of(st, lt);
660 n_st_members = get_struct_n_members(st);
661 if (n_st_members != get_struct_n_members(lt))
664 m = alloca(sizeof(ir_entity *) * n_st_members);
665 memset(m, 0, sizeof(ir_entity *) * n_st_members);
666 /* First sort the members of lt */
667 for (i = 0; i < n_st_members; ++i) {
668 ir_entity *se = get_struct_member(st, i);
669 int n = get_struct_n_members(lt);
670 for (j = 0; j < n; ++j) {
671 ir_entity *le = get_struct_member(lt, j);
672 if (get_entity_name(le) == get_entity_name(se))
676 for (i = 0; i < n_st_members; i++) {
677 if (!m[i] || /* Found no counterpart */
678 !smaller_type(get_entity_type(get_struct_member(st, i)), get_entity_type(m[i])))
684 int n_param1, n_param2;
686 /** FIXME: is this still 1? */
687 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
688 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
689 if (get_method_calling_convention(st) !=
690 get_method_calling_convention(lt)) return 0;
692 if (get_method_variadicity(st) == variadicity_non_variadic) {
693 n_param1 = get_method_n_params(st);
694 n_param2 = get_method_n_params(lt);
696 n_param1 = get_method_first_variadic_param_index(st);
697 n_param2 = get_method_first_variadic_param_index(lt);
700 if (n_param1 != n_param2) return 0;
702 for (i = 0; i < get_method_n_params(st); i++) {
703 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
706 for (i = 0; i < get_method_n_ress(st); i++) {
707 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
713 n_st_members = get_union_n_members(st);
714 if (n_st_members != get_union_n_members(lt)) return 0;
715 m = alloca(sizeof(ir_entity *) * n_st_members);
716 memset(m, 0, sizeof(ir_entity *) * n_st_members);
717 /* First sort the members of lt */
718 for (i = 0; i < n_st_members; ++i) {
719 ir_entity *se = get_union_member(st, i);
720 int n = get_union_n_members(lt);
721 for (j = 0; j < n; ++j) {
722 ir_entity *le = get_union_member(lt, j);
723 if (get_entity_name(le) == get_entity_name(se))
727 for (i = 0; i < n_st_members; ++i) {
728 if (!m[i] || /* Found no counterpart */
729 !smaller_type(get_entity_type(get_union_member(st, i)), get_entity_type(m[i])))
735 ir_type *set, *let; /* small/large elt. ir_type */
736 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
738 set = get_array_element_type(st);
739 let = get_array_element_type(lt);
741 /* If the element types are different, set must be convertible
742 to let, and they must have the same size so that address
743 computations work out. To have a size the layout must
745 if ((get_type_state(set) != layout_fixed) ||
746 (get_type_state(let) != layout_fixed))
748 if (!smaller_type(set, let) ||
749 get_type_size_bits(set) != get_type_size_bits(let))
752 for(i = 0; i < get_array_n_dimensions(st); i++) {
753 if (get_array_lower_bound(lt, i))
754 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
756 if (get_array_upper_bound(lt, i))
757 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
762 case tpo_enumeration:
763 assert(0 && "enumerations not implemented");
767 if (!smaller_type(get_pointer_points_to_type(st), get_pointer_points_to_type(lt)))
772 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
781 /*-----------------------------------------------------------------*/
783 /*-----------------------------------------------------------------*/
785 /* create a new class ir_type */
786 ir_type *new_d_type_class (ident *name, dbg_info *db) {
789 res = new_type(type_class, NULL, name, db);
791 res->attr.ca.members = NEW_ARR_F (ir_entity *, 0);
792 res->attr.ca.subtypes = NEW_ARR_F (ir_type *, 0);
793 res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
794 res->attr.ca.peculiarity = peculiarity_existent;
795 res->attr.ca.type_info = NULL;
796 res->attr.ca.vtable_size = 0;
797 res->attr.ca.clss_flags = cf_none;
798 res->attr.ca.dfn = 0;
803 ir_type *new_type_class (ident *name) {
804 return new_d_type_class (name, NULL);
807 /* free all entities of a class */
808 void free_class_entities(ir_type *clss) {
810 assert(clss && (clss->type_op == type_class));
811 for (i = get_class_n_members(clss) - 1; i >= 0; --i)
812 free_entity(get_class_member(clss, i));
813 /* do NOT free the type info here. It belongs to another class */
816 void free_class_attrs(ir_type *clss) {
817 assert(clss && (clss->type_op == type_class));
818 DEL_ARR_F(clss->attr.ca.members);
819 DEL_ARR_F(clss->attr.ca.subtypes);
820 DEL_ARR_F(clss->attr.ca.supertypes);
823 /* manipulate private fields of class type */
824 void add_class_member(ir_type *clss, ir_entity *member) {
825 assert(clss && (clss->type_op == type_class));
826 assert(clss != get_entity_type(member) && "recursive type");
827 ARR_APP1 (ir_entity *, clss->attr.ca.members, member);
830 int (get_class_n_members)(const ir_type *clss) {
831 return _get_class_n_members(clss);
834 int get_class_member_index(const ir_type *clss, ir_entity *mem) {
836 assert(clss && (clss->type_op == type_class));
837 for (i = 0, n = get_class_n_members(clss); i < n; ++i)
838 if (get_class_member(clss, i) == mem)
843 ir_entity *(get_class_member)(const ir_type *clss, int pos) {
844 return _get_class_member(clss, pos);
847 ir_entity *get_class_member_by_name(ir_type *clss, ident *name) {
849 assert(clss && (clss->type_op == type_class));
850 n_mem = get_class_n_members(clss);
851 for (i = 0; i < n_mem; ++i) {
852 ir_entity *mem = get_class_member(clss, i);
853 if (get_entity_ident(mem) == name) return mem;
858 void set_class_member(ir_type *clss, ir_entity *member, int pos) {
859 assert(clss && (clss->type_op == type_class));
860 assert(pos >= 0 && pos < get_class_n_members(clss));
861 clss->attr.ca.members[pos] = member;
864 void set_class_members(ir_type *clss, ir_entity **members, int arity) {
866 assert(clss && (clss->type_op == type_class));
867 DEL_ARR_F(clss->attr.ca.members);
868 clss->attr.ca.members = NEW_ARR_F(ir_entity *, 0);
869 for (i = 0; i < arity; ++i) {
870 set_entity_owner(members[i], clss);
871 ARR_APP1(ir_entity *, clss->attr.ca.members, members[i]);
875 void remove_class_member(ir_type *clss, ir_entity *member) {
877 assert(clss && (clss->type_op == type_class));
878 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
879 if (clss->attr.ca.members[i] == member) {
880 for (; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
881 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
882 ARR_SETLEN(ir_entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
888 void add_class_subtype(ir_type *clss, ir_type *subtype) {
890 assert(clss && (clss->type_op == type_class));
891 ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
892 for (i = 0; i < get_class_n_supertypes(subtype); i++)
893 if (get_class_supertype(subtype, i) == clss)
894 /* Class already registered */
896 ARR_APP1(ir_type *, subtype->attr.ca.supertypes, clss);
899 int get_class_n_subtypes(const ir_type *clss) {
900 assert(clss && (clss->type_op == type_class));
901 return (ARR_LEN (clss->attr.ca.subtypes));
904 ir_type *get_class_subtype(ir_type *clss, int pos) {
905 assert(clss && (clss->type_op == type_class));
906 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
907 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
910 int get_class_subtype_index(ir_type *clss, const ir_type *subclass) {
911 int i, n_subtypes = get_class_n_subtypes(clss);
912 assert(is_Class_type(subclass));
913 for (i = 0; i < n_subtypes; ++i) {
914 if (get_class_subtype(clss, i) == subclass) return i;
919 void set_class_subtype(ir_type *clss, ir_type *subtype, int pos) {
920 assert(clss && (clss->type_op == type_class));
921 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
922 clss->attr.ca.subtypes[pos] = subtype;
925 void remove_class_subtype(ir_type *clss, ir_type *subtype) {
927 assert(clss && (clss->type_op == type_class));
928 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
929 if (clss->attr.ca.subtypes[i] == subtype) {
930 for (; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
931 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
932 ARR_SETLEN(ir_entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
937 void add_class_supertype(ir_type *clss, ir_type *supertype) {
939 assert(clss && (clss->type_op == type_class));
940 assert(supertype && (supertype -> type_op == type_class));
941 ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
942 for (i = get_class_n_subtypes(supertype) - 1; i >= 0; --i)
943 if (get_class_subtype(supertype, i) == clss)
944 /* Class already registered */
946 ARR_APP1(ir_type *, supertype->attr.ca.subtypes, clss);
949 int get_class_n_supertypes(const ir_type *clss) {
950 assert(clss && (clss->type_op == type_class));
951 return ARR_LEN(clss->attr.ca.supertypes);
954 int get_class_supertype_index(ir_type *clss, ir_type *super_clss) {
955 int i, n_supertypes = get_class_n_supertypes(clss);
956 assert(super_clss && (super_clss->type_op == type_class));
957 for (i = 0; i < n_supertypes; i++)
958 if (get_class_supertype(clss, i) == super_clss)
963 ir_type *get_class_supertype(ir_type *clss, int pos) {
964 assert(clss && (clss->type_op == type_class));
965 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
966 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
969 void set_class_supertype(ir_type *clss, ir_type *supertype, int pos) {
970 assert(clss && (clss->type_op == type_class));
971 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
972 clss->attr.ca.supertypes[pos] = supertype;
975 void remove_class_supertype(ir_type *clss, ir_type *supertype) {
977 assert(clss && (clss->type_op == type_class));
978 for (i = 0; i < (ARR_LEN(clss->attr.ca.supertypes)); i++)
979 if (clss->attr.ca.supertypes[i] == supertype) {
980 for(; i < (ARR_LEN(clss->attr.ca.supertypes))-1; i++)
981 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
982 ARR_SETLEN(ir_entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
987 ir_entity *get_class_type_info(const ir_type *clss) {
988 return clss->attr.ca.type_info;
991 void set_class_type_info(ir_type *clss, ir_entity *ent) {
992 clss->attr.ca.type_info = ent;
994 ent->repr_class = clss;
997 const char *get_peculiarity_name(ir_peculiarity p) {
998 #define X(a) case a: return #a
1000 X(peculiarity_description);
1001 X(peculiarity_inherited);
1002 X(peculiarity_existent);
1005 return "invalid peculiarity";
1008 ir_peculiarity get_class_peculiarity(const ir_type *clss) {
1009 assert(clss && (clss->type_op == type_class));
1010 return clss->attr.ca.peculiarity;
1013 void set_class_peculiarity(ir_type *clss, ir_peculiarity pec) {
1014 assert(clss && (clss->type_op == type_class));
1015 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
1016 clss->attr.ca.peculiarity = pec;
1019 /* Returns the size of the virtual function table. */
1020 unsigned (get_class_vtable_size)(const ir_type *clss) {
1021 return _get_class_vtable_size(clss);
1024 /* Sets a new size of the virtual function table. */
1025 void (set_class_vtable_size)(ir_type *clss, unsigned size) {
1026 _set_class_vtable_size(clss, size);
1029 /* Returns non-zero if a class is final. */
1030 int (is_class_final)(const ir_type *clss) {
1031 return _is_class_final(clss);
1034 /* Sets if a class is final. */
1035 void (set_class_final)(ir_type *clss, int flag) {
1036 _set_class_final(clss, flag);
1039 /* Returns non-zero if a class is an interface. */
1040 int (is_class_interface)(const ir_type *clss) {
1041 return _is_class_interface(clss);
1044 /* Sets the class interface flag. */
1045 void (set_class_interface)(ir_type *clss, int flag) {
1046 _set_class_interface(clss, flag);
1049 /* Returns non-zero if a class is abstract. */
1050 int (is_class_abstract)(const ir_type *clss) {
1051 return _is_class_abstract(clss);
1054 /* Sets the class abstract flag. */
1055 void (set_class_abstract)(ir_type *clss, int final) {
1056 _set_class_abstract(clss, final);
1059 void set_class_dfn(ir_type *clss, int dfn) {
1060 clss->attr.ca.dfn = dfn;
1063 int get_class_dfn(const ir_type *clss) {
1064 return (clss->attr.ca.dfn);
1068 int (is_Class_type)(const ir_type *clss) {
1069 return _is_class_type(clss);
1072 void set_class_mode(ir_type *tp, ir_mode *mode) {
1073 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1074 assert(get_type_state(tp) == layout_fixed &&
1075 tp->size == get_mode_size_bits(mode) && "mode don't match class layout");
1079 void set_class_size_bits(ir_type *tp, int size) {
1080 /* argh: we must allow to set negative values as "invalid size" */
1081 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1082 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1085 /*----------------------------------------------------------------**/
1087 /*----------------------------------------------------------------**/
1089 /* create a new type struct */
1090 ir_type *new_d_type_struct(ident *name, dbg_info *db) {
1091 ir_type *res = new_type(type_struct, NULL, name, db);
1093 res->attr.sa.members = NEW_ARR_F(ir_entity *, 0);
1098 ir_type *new_type_struct(ident *name) {
1099 return new_d_type_struct (name, NULL);
1102 void free_struct_entities(ir_type *strct) {
1104 assert(strct && (strct->type_op == type_struct));
1105 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
1106 free_entity(get_struct_member(strct, i));
1109 void free_struct_attrs(ir_type *strct) {
1110 assert(strct && (strct->type_op == type_struct));
1111 DEL_ARR_F(strct->attr.sa.members);
1114 /* manipulate private fields of struct */
1115 int get_struct_n_members(const ir_type *strct) {
1116 assert(strct && (strct->type_op == type_struct));
1117 return ARR_LEN(strct->attr.sa.members);
1120 void add_struct_member(ir_type *strct, ir_entity *member) {
1121 assert(strct && (strct->type_op == type_struct));
1122 assert(get_type_tpop(get_entity_type(member)) != type_method);
1123 assert(strct != get_entity_type(member) && "recursive type");
1124 ARR_APP1 (ir_entity *, strct->attr.sa.members, member);
1127 ir_entity *get_struct_member(const ir_type *strct, int pos) {
1128 assert(strct && (strct->type_op == type_struct));
1129 assert(pos >= 0 && pos < get_struct_n_members(strct));
1130 return strct->attr.sa.members[pos];
1133 int get_struct_member_index(const ir_type *strct, ir_entity *mem) {
1135 assert(strct && (strct->type_op == type_struct));
1136 for (i = 0, n = get_struct_n_members(strct); i < n; ++i)
1137 if (get_struct_member(strct, i) == mem)
1142 void set_struct_member(ir_type *strct, int pos, ir_entity *member) {
1143 assert(strct && (strct->type_op == type_struct));
1144 assert(pos >= 0 && pos < get_struct_n_members(strct));
1145 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
1146 strct->attr.sa.members[pos] = member;
1149 void remove_struct_member(ir_type *strct, ir_entity *member) {
1151 assert(strct && (strct->type_op == type_struct));
1152 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
1153 if (strct->attr.sa.members[i] == member) {
1154 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
1155 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1156 ARR_SETLEN(ir_entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1162 int (is_Struct_type)(const ir_type *strct) {
1163 return _is_struct_type(strct);
1166 void set_struct_mode(ir_type *tp, ir_mode *mode) {
1167 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1168 assert(get_type_state(tp) == layout_fixed &&
1169 tp->size == get_mode_size_bits(mode) && "mode don't match struct layout");
1173 void set_struct_size_bits(ir_type *tp, int size) {
1174 /* argh: we must allow to set negative values as "invalid size" */
1175 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1176 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1179 /*******************************************************************/
1181 /*******************************************************************/
1184 * Lazy construction of value argument / result representation.
1185 * Constructs a struct type and its member. The types of the members
1186 * are passed in the argument list.
1188 * @param name name of the type constructed
1189 * @param len number of fields
1190 * @param tps array of field types with length len
1193 build_value_type(ident *name, int len, tp_ent_pair *tps) {
1195 ir_type *res = new_type_struct(name);
1196 res->flags |= tf_value_param_type;
1197 /* Remove type from type list. Must be treated differently than other types. */
1198 remove_irp_type(res);
1199 for (i = 0; i < len; i++) {
1200 ident *id = tps[i].param_name;
1202 /* use res as default if corresponding type is not yet set. */
1203 ir_type *elt_type = tps[i].tp ? tps[i].tp : res;
1205 /* use the parameter name if specified */
1207 id = mangle_u(name, get_type_ident(elt_type));
1208 tps[i].ent = new_entity(res, id, elt_type);
1209 set_entity_allocation(tps[i].ent, allocation_parameter);
1214 /* Create a new method type.
1215 N_param is the number of parameters, n_res the number of results. */
1216 ir_type *new_d_type_method(ident *name, int n_param, int n_res, dbg_info *db) {
1219 assert((get_mode_size_bytes(mode_P_code) != -1) && "unorthodox modes not implemented");
1220 res = new_type(type_method, mode_P_code, name, db);
1221 res->flags |= tf_layout_fixed;
1222 res->size = get_mode_size_bits(mode_P_code);
1223 res->attr.ma.n_params = n_param;
1224 res->attr.ma.params = xcalloc(n_param, sizeof(res->attr.ma.params[0]));
1225 res->attr.ma.value_params = NULL;
1226 res->attr.ma.n_res = n_res;
1227 res->attr.ma.res_type = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
1228 res->attr.ma.value_ress = NULL;
1229 res->attr.ma.variadicity = variadicity_non_variadic;
1230 res->attr.ma.first_variadic_param = -1;
1231 res->attr.ma.additional_properties = mtp_no_property;
1232 res->attr.ma.irg_calling_conv = default_cc_mask;
1237 ir_type *new_type_method(ident *name, int n_param, int n_res) {
1238 return new_d_type_method(name, n_param, n_res, NULL);
1241 void free_method_entities(ir_type *method) {
1242 assert(method && (method->type_op == type_method));
1245 /* Attention: also frees entities in value parameter subtypes! */
1246 void free_method_attrs(ir_type *method) {
1247 assert(method && (method->type_op == type_method));
1248 free(method->attr.ma.params);
1249 free(method->attr.ma.res_type);
1250 if (method->attr.ma.value_params) {
1251 free_type_entities(method->attr.ma.value_params);
1252 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(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(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(variadicity vari) {
1394 #define X(a) case a: return #a
1396 X(variadicity_non_variadic);
1397 X(variadicity_variadic);
1404 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, 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 ARR_APP1(ir_entity *, uni->attr.ua.members, member);
1528 ir_entity *get_union_member(const ir_type *uni, int pos) {
1529 assert(uni && (uni->type_op == type_union));
1530 assert(pos >= 0 && pos < get_union_n_members(uni));
1531 return uni->attr.ua.members[pos];
1534 int get_union_member_index(const ir_type *uni, ir_entity *mem) {
1536 assert(uni && (uni->type_op == type_union));
1537 for (i = 0, n = get_union_n_members(uni); i < n; ++i)
1538 if (get_union_member(uni, i) == mem)
1543 void set_union_member(ir_type *uni, int pos, ir_entity *member) {
1544 assert(uni && (uni->type_op == type_union));
1545 assert(pos >= 0 && pos < get_union_n_members(uni));
1546 uni->attr.ua.members[pos] = member;
1549 void remove_union_member(ir_type *uni, ir_entity *member) {
1551 assert(uni && (uni->type_op == type_union));
1552 for (i = 0; i < (ARR_LEN(uni->attr.ua.members)); i++)
1553 if (uni->attr.ua.members[i] == member) {
1554 for(; i < (ARR_LEN(uni->attr.ua.members))-1; i++)
1555 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1556 ARR_SETLEN(ir_entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1562 int (is_Union_type)(const ir_type *uni) {
1563 return _is_union_type(uni);
1566 void set_union_size_bits(ir_type *tp, int size) {
1567 /* argh: we must allow to set negative values as "invalid size" */
1568 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
1569 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
1572 /*-----------------------------------------------------------------*/
1574 /*-----------------------------------------------------------------*/
1577 /* create a new type array -- set dimension sizes independently */
1578 ir_type *new_d_type_array(ident *name, int n_dimensions, ir_type *element_type, dbg_info *db) {
1582 ir_graph *rem = current_ir_graph;
1584 assert(!is_Method_type(element_type));
1586 res = new_type(type_array, NULL, name, db);
1587 res->attr.aa.n_dimensions = n_dimensions;
1588 res->attr.aa.lower_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
1589 res->attr.aa.upper_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
1590 res->attr.aa.order = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));
1592 current_ir_graph = get_const_code_irg();
1593 unk = new_Unknown(mode_Iu);
1594 for (i = 0; i < n_dimensions; i++) {
1595 res->attr.aa.lower_bound[i] =
1596 res->attr.aa.upper_bound[i] = unk;
1597 res->attr.aa.order[i] = i;
1599 current_ir_graph = rem;
1601 res->attr.aa.element_type = element_type;
1602 new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1607 ir_type *new_type_array(ident *name, int n_dimensions, ir_type *element_type) {
1608 return new_d_type_array(name, n_dimensions, element_type, NULL);
1611 void free_array_automatic_entities(ir_type *array) {
1612 assert(array && (array->type_op == type_array));
1613 free_entity(get_array_element_entity(array));
1616 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(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1649 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
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(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
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(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
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 (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
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(get_irn_op(node) == op_Const);
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 get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown;
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(get_irn_op(node) == op_Const);
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_bits(ir_type *tp, int 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) {
1791 assert(enumeration && (enumeration->type_op == type_enumeration));
1793 void free_enumeration_attrs(ir_type *enumeration) {
1794 assert(enumeration && (enumeration->type_op == type_enumeration));
1795 DEL_ARR_F(enumeration->attr.ea.enumer);
1798 /* manipulate fields of enumeration type. */
1799 int get_enumeration_n_enums(const ir_type *enumeration) {
1800 assert(enumeration && (enumeration->type_op == type_enumeration));
1801 return ARR_LEN(enumeration->attr.ea.enumer);
1804 /* create a new constant */
1805 void set_enumeration_const(ir_type *enumeration, int pos, ident *nameid, tarval *con) {
1806 assert(0 <= pos && pos < ARR_LEN(enumeration->attr.ea.enumer));
1807 enumeration->attr.ea.enumer[pos].nameid = nameid;
1808 enumeration->attr.ea.enumer[pos].value = con;
1809 enumeration->attr.ea.enumer[pos].owner = enumeration;
1812 ir_enum_const *get_enumeration_const(const ir_type *enumeration, int pos) {
1813 assert(enumeration && (enumeration->type_op == type_enumeration));
1814 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1815 return &enumeration->attr.ea.enumer[pos];
1818 ir_type *get_enumeration_owner(const ir_enum_const *enum_cnst) {
1819 return enum_cnst->owner;
1822 void set_enumeration_value(ir_enum_const *enum_cnst, tarval *con) {
1823 enum_cnst->value = con;
1826 tarval *get_enumeration_value(const ir_enum_const *enum_cnst) {
1827 return enum_cnst->value;
1830 void set_enumeration_nameid(ir_enum_const *enum_cnst, ident *id) {
1831 enum_cnst->nameid = id;
1834 ident *get_enumeration_nameid(const ir_enum_const *enum_cnst) {
1835 return enum_cnst->nameid;
1838 const char *get_enumeration_name(const ir_enum_const *enum_cnst) {
1839 return get_id_str(enum_cnst->nameid);
1843 int (is_Enumeration_type)(const ir_type *enumeration) {
1844 return _is_enumeration_type(enumeration);
1847 void set_enumeration_mode(ir_type *tp, ir_mode *mode) {
1848 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1849 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1850 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1852 tp->size = get_mode_size_bits(mode);
1856 /*-----------------------------------------------------------------*/
1858 /*-----------------------------------------------------------------*/
1860 /* Create a new type pointer */
1861 ir_type *new_d_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode, dbg_info *db) {
1864 assert(mode_is_reference(ptr_mode));
1865 res = new_type(type_pointer, ptr_mode, name, db);
1866 res->attr.pa.points_to = points_to;
1867 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1868 res->size = get_mode_size_bits(res->mode);
1869 res->flags |= tf_layout_fixed;
1874 ir_type *new_type_pointer(ident *name, ir_type *points_to, ir_mode *ptr_mode) {
1875 return new_d_type_pointer(name, points_to, ptr_mode, NULL);
1878 void free_pointer_entities(ir_type *pointer) {
1879 assert(pointer && (pointer->type_op == type_pointer));
1882 void free_pointer_attrs(ir_type *pointer) {
1883 assert(pointer && (pointer->type_op == type_pointer));
1886 /* manipulate fields of type_pointer */
1887 void set_pointer_points_to_type(ir_type *pointer, ir_type *tp) {
1888 assert(pointer && (pointer->type_op == type_pointer));
1889 pointer->attr.pa.points_to = tp;
1892 ir_type *get_pointer_points_to_type(ir_type *pointer) {
1893 assert(pointer && (pointer->type_op == type_pointer));
1894 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1898 int (is_Pointer_type)(const ir_type *pointer) {
1899 return _is_pointer_type(pointer);
1902 void set_pointer_mode(ir_type *tp, ir_mode *mode) {
1903 assert(mode_is_reference(mode) && "Modes of pointers must be references");
1904 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1905 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1907 tp->size = get_mode_size_bits(mode);
1911 /* Returns the first pointer type that has as points_to tp.
1912 * Not efficient: O(#types).
1913 * If not found returns firm_unknown_type. */
1914 ir_type *find_pointer_type_to_type (ir_type *tp) {
1915 int i, n = get_irp_n_types();
1916 for (i = 0; i < n; ++i) {
1917 ir_type *found = get_irp_type(i);
1918 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1921 return firm_unknown_type;
1925 /*-----------------------------------------------------------------*/
1926 /* TYPE_PRIMITIVE */
1927 /*-----------------------------------------------------------------*/
1929 /* create a new type primitive */
1930 ir_type *new_d_type_primitive(ident *name, ir_mode *mode, dbg_info *db) {
1931 ir_type *res = new_type(type_primitive, mode, name, db);
1932 res->size = get_mode_size_bits(mode);
1933 res->flags |= tf_layout_fixed;
1934 res->attr.ba.base_type = NULL;
1939 ir_type *new_type_primitive(ident *name, ir_mode *mode) {
1940 return new_d_type_primitive(name, mode, NULL);
1944 int (is_Primitive_type)(const ir_type *primitive) {
1945 return _is_primitive_type(primitive);
1948 void set_primitive_mode(ir_type *tp, ir_mode *mode) {
1949 /* Modes of primitives must be data */
1950 assert(mode_is_data(mode));
1952 /* For primitive size depends on the mode. */
1953 tp->size = get_mode_size_bits(mode);
1957 /* Return the base type of a primitive (bitfield) type or NULL if none. */
1958 ir_type *get_primitive_base_type(ir_type *tp) {
1959 assert(is_Primitive_type(tp));
1960 return tp->attr.ba.base_type;
1963 /* Sets the base type of a primitive (bitfield) type. */
1964 void set_primitive_base_type(ir_type *tp, ir_type *base_tp) {
1965 assert(is_Primitive_type(tp));
1966 tp->attr.ba.base_type = base_tp;
1969 /*-----------------------------------------------------------------*/
1970 /* common functionality */
1971 /*-----------------------------------------------------------------*/
1974 int (is_atomic_type)(const ir_type *tp) {
1975 return _is_atomic_type(tp);
1979 * Gets the number of elements in a firm compound type.
1981 int get_compound_n_members(const ir_type *tp) {
1982 const tp_op *op = get_type_tpop(tp);
1985 if (op->ops.get_n_members)
1986 res = op->ops.get_n_members(tp);
1988 assert(0 && "no member count for this type");
1994 * Gets the member of a firm compound type at position pos.
1996 ir_entity *get_compound_member(const ir_type *tp, int pos) {
1997 const tp_op *op = get_type_tpop(tp);
1998 ir_entity *res = NULL;
2000 if (op->ops.get_member)
2001 res = op->ops.get_member(tp, pos);
2003 assert(0 && "no members in this type");
2008 /* Returns index of member in tp, -1 if not contained. */
2009 int get_compound_member_index(const ir_type *tp, ir_entity *member) {
2010 const tp_op *op = get_type_tpop(tp);
2013 if (op->ops.get_member_index)
2014 index = op->ops.get_member_index(tp, member);
2016 assert(0 && "no members in this type");
2021 int is_compound_type(const ir_type *tp) {
2022 assert(tp && tp->kind == k_type);
2023 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
2026 /* Checks, whether a type is a frame type */
2027 int is_frame_type(const ir_type *tp) {
2028 return tp->flags & tf_frame_type;
2031 /* Checks, whether a type is a value parameter type */
2032 int is_value_param_type(const ir_type *tp) {
2033 return tp->flags & tf_value_param_type;
2036 /* Checks, whether a type is a lowered type */
2037 int is_lowered_type(const ir_type *tp) {
2038 return tp->flags & tf_lowered_type;
2041 /* Makes a new frame type. */
2042 ir_type *new_type_frame(ident *name) {
2043 ir_type *res = new_type_class(name);
2045 res->flags |= tf_frame_type;
2047 /* Remove type from type list. Must be treated differently than other types. */
2048 remove_irp_type(res);
2050 /* It is not possible to derive from the frame type. Set the final flag. */
2051 set_class_final(res, 1);
2056 /* Sets a lowered type for a type. This sets both associations. */
2057 void set_lowered_type(ir_type *tp, ir_type *lowered_type) {
2058 assert(is_type(tp) && is_type(lowered_type));
2059 lowered_type->flags |= tf_lowered_type;
2060 tp->assoc_type = lowered_type;
2061 lowered_type->assoc_type = tp;
2065 * Gets the lowered/unlowered type of a type or NULL if this type
2066 * has no lowered/unlowered one.
2068 ir_type *get_associated_type(const ir_type *tp) {
2069 return tp->assoc_type;
2072 /* set the type size for the unknown and none ir_type */
2073 void set_default_size_bits(ir_type *tp, int size) {
2078 * Allocate an area of size bytes aligned at alignment
2079 * at the start or the end of a frame type.
2080 * The frame type must have already an fixed layout.
2082 ir_entity *frame_alloc_area(ir_type *frame_type, int size, int alignment, int at_start) {
2087 int frame_align, i, offset, frame_size;
2088 static unsigned area_cnt = 0;
2089 static ir_type *a_byte = NULL;
2091 assert(is_frame_type(frame_type));
2092 assert(get_type_state(frame_type) == layout_fixed);
2093 assert(get_type_alignment_bytes(frame_type) > 0);
2096 a_byte = new_type_primitive(new_id_from_chars("byte", 4), mode_Bu);
2098 snprintf(buf, sizeof(buf), "area%u", area_cnt++);
2099 name = new_id_from_str(buf);
2101 /* align the size */
2102 frame_align = get_type_alignment_bytes(frame_type);
2103 size = (size + frame_align - 1) & -frame_align;
2105 tp = new_type_array(mangle_u(get_type_ident(frame_type), name), 1, a_byte);
2106 set_array_bounds_int(tp, 0, 0, size);
2107 set_type_alignment_bytes(tp, alignment);
2109 frame_size = get_type_size_bytes(frame_type);
2111 /* fix all offsets so far */
2112 for (i = get_class_n_members(frame_type) - 1; i >= 0; --i) {
2113 ir_entity *ent = get_class_member(frame_type, i);
2115 set_entity_offset(ent, get_entity_offset(ent) + size);
2117 /* calculate offset and new type size */
2122 /* calculate offset and new type size */
2123 offset = (frame_size + alignment - 1) & -alignment;
2124 frame_size = offset + size;
2127 area = new_entity(frame_type, name, tp);
2128 set_entity_offset(area, offset);
2129 set_type_size_bytes(frame_type, frame_size);
2131 /* mark this entity as compiler generated */
2132 set_entity_compiler_generated(area, 1);