2 * Copyright (C) 1995-2011 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of types.
23 * @author Goetz Lindenmaier, Michael Beck
26 * Implementation of the datastructure to hold
29 * This module supplies a datastructure to represent all types
30 * known in the compiled program. This includes types specified
31 * in the program as well as types defined by the language. In the
32 * view of the intermediate representation there is no difference
33 * between these types.
35 * There exist several kinds of types, arranged by the structure of
36 * the type. A type is described by a set of attributes. Some of
37 * these attributes are common to all types, others depend on the
40 * Types are different from the modes defined in irmode: Types are
41 * on the level of the programming language, modes at the level of
42 * the target processor.
67 static ir_type *new_type(tp_op const *type_op, ir_mode *mode, type_dbg_info *db);
69 ir_type *get_none_type(void)
71 return irp->none_type;
74 ir_type *get_code_type(void)
76 return irp->code_type;
79 ir_type *get_unknown_type(void)
81 return irp->unknown_type;
84 void ir_init_type(ir_prog *irp)
86 /* construct none and unknown type. */
87 irp->none_type = new_type(tpop_none, mode_BAD, NULL);
88 set_type_size_bytes(irp->none_type, 0);
89 set_type_state (irp->none_type, layout_fixed);
91 irp->code_type = new_type(tpop_code, mode_ANY, NULL);
92 set_type_state(irp->code_type, layout_fixed);
94 irp->unknown_type = new_type(tpop_unknown, mode_ANY, NULL);
95 set_type_size_bytes(irp->unknown_type, 0);
96 set_type_state (irp->unknown_type, layout_fixed);
99 void ir_finish_type(ir_prog *irp)
101 /** nothing todo. (The none, code, unknown types are in the global type list
106 ir_visited_t firm_type_visited;
108 void (set_master_type_visited)(ir_visited_t val)
110 _set_master_type_visited(val);
113 ir_visited_t (get_master_type_visited)(void)
115 return _get_master_type_visited();
118 void (inc_master_type_visited)(void)
120 _inc_master_type_visited();
124 * Creates a new type representation:
126 * @param type_op the kind of this type. May not be type_id.
127 * @param mode the mode to be used for this type, may be NULL
128 * @param db debug info
130 * @return A new type of the given type. The remaining private attributes are
131 * not initialized. The type is in state layout_undefined.
133 static ir_type *new_type(tp_op const *type_op, ir_mode *mode, type_dbg_info *db)
138 node_size = offsetof(ir_type, attr) + type_op->attr_size;
139 res = (ir_type*)xmalloc(node_size);
140 memset(res, 0, node_size);
143 res->type_op = type_op;
145 res->visibility = ir_visibility_external;
146 res->flags = tf_none;
153 res->nr = get_irp_new_node_nr();
154 #endif /* defined DEBUG_libfirm */
156 add_irp_type(res); /* Remember the new type global. */
161 void free_type_entities(ir_type *tp)
163 const tp_op *op = get_type_tpop(tp);
164 if (op->ops.free_entities != NULL)
165 op->ops.free_entities(tp);
168 static void free_type_attrs(ir_type *tp)
170 const tp_op *tpop = get_type_tpop(tp);
172 if (tpop->ops.free_attrs)
173 tpop->ops.free_attrs(tp);
176 void free_type(ir_type *tp)
178 const tp_op *op = get_type_tpop(tp);
180 free_type_entities(tp);
181 /* Remove from list of all types */
183 /* Free the attributes of the type. */
185 /* Free entities automatically allocated with the ir_type */
186 if (op->ops.free_auto_entities)
187 op->ops.free_auto_entities(tp);
188 /* And now the type itself... */
195 void *(get_type_link)(const ir_type *tp)
197 return _get_type_link(tp);
200 void (set_type_link)(ir_type *tp, void *l)
202 _set_type_link(tp, l);
205 const tp_op *(get_type_tpop)(const ir_type *tp)
207 return _get_type_tpop(tp);
210 ident *(get_type_tpop_nameid)(const ir_type *tp)
212 return _get_type_tpop_nameid(tp);
215 const char* get_type_tpop_name(const ir_type *tp)
217 assert(tp && tp->kind == k_type);
218 return get_id_str(tp->type_op->name);
221 tp_opcode (get_type_tpop_code)(const ir_type *tp)
223 return _get_type_tpop_code(tp);
226 ir_mode *(get_type_mode)(const ir_type *tp)
228 return _get_type_mode(tp);
231 void set_type_mode(ir_type *tp, ir_mode *mode)
233 const tp_op *tpop = get_type_tpop(tp);
235 if (tpop->ops.set_type_mode)
236 tpop->ops.set_type_mode(tp, mode);
238 assert(0 && "setting a mode is NOT allowed for this type");
241 long get_type_nr(const ir_type *tp)
247 return (long)PTR_TO_INT(tp);
251 unsigned (get_type_size_bytes)(const ir_type *tp)
253 return _get_type_size_bytes(tp);
256 ir_visibility get_type_visibility(const ir_type *tp)
259 return tp->visibility;
262 void set_type_visibility(ir_type *tp, ir_visibility v)
268 void set_type_size_bytes(ir_type *tp, unsigned size)
270 const tp_op *tpop = get_type_tpop(tp);
272 if (tpop->ops.set_type_size)
273 tpop->ops.set_type_size(tp, size);
275 assert(0 && "Cannot set size for this type");
278 unsigned get_type_alignment_bytes(ir_type *tp)
285 /* alignment NOT set calculate it "on demand" */
287 align = (get_mode_size_bits(tp->mode) + 7) >> 3;
288 else if (is_Array_type(tp))
289 align = get_type_alignment_bytes(get_array_element_type(tp));
290 else if (is_compound_type(tp)) {
291 size_t i, n = get_compound_n_members(tp);
294 for (i = 0; i < n; ++i) {
295 ir_type *t = get_entity_type(get_compound_member(tp, i));
296 unsigned a = get_type_alignment_bytes(t);
301 } else if (is_Method_type(tp)) {
311 void set_type_alignment_bytes(ir_type *tp, unsigned align)
313 assert(tp && tp->kind == k_type);
314 /* Methods don't have an alignment. */
315 if (tp->type_op != type_method) {
320 const char *get_type_state_name(ir_type_state s)
322 #define X(a) case a: return #a
331 ir_type_state (get_type_state)(const ir_type *tp)
333 return _get_type_state(tp);
336 void set_type_state(ir_type *tp, ir_type_state state)
338 assert(tp && tp->kind == k_type);
340 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
341 (tp->type_op == type_method))
344 /* Just a correctness check: */
345 if (state == layout_fixed) {
347 switch (get_type_tpop_code(tp)) {
349 if (tp != get_glob_type()) {
350 size_t n_mem = get_class_n_members(tp);
351 for (i = 0; i < n_mem; i++) {
352 ir_entity *entity = get_class_member(tp, i);
353 if (is_Method_type(get_entity_type(entity)))
355 assert(get_entity_offset(entity) > -1);
360 for (i = 0; i < get_struct_n_members(tp); i++) {
361 assert(get_entity_offset(get_struct_member(tp, i)) > -1);
368 case tpo_enumeration: {
370 size_t n_enums = get_enumeration_n_enums(tp);
371 assert(get_type_mode(tp) != NULL);
372 for (i = 0; i < n_enums; ++i) {
373 ir_enum_const *ec = get_enumeration_const(tp, i);
374 ir_tarval *tv = get_enumeration_value(ec);
375 assert(tv != NULL && tv != tarval_bad);
383 if (state == layout_fixed)
384 tp->flags |= tf_layout_fixed;
386 tp->flags &= ~tf_layout_fixed;
389 ir_visited_t (get_type_visited)(const ir_type *tp)
391 return _get_type_visited(tp);
394 void (set_type_visited)(ir_type *tp, ir_visited_t num)
396 _set_type_visited(tp, num);
399 void (mark_type_visited)(ir_type *tp)
401 _mark_type_visited(tp);
404 int (type_visited)(const ir_type *tp)
406 return _type_visited(tp);
409 int (type_not_visited)(const ir_type *tp)
411 return _type_not_visited(tp);
414 type_dbg_info *(get_type_dbg_info)(const ir_type *tp)
416 return _get_type_dbg_info(tp);
419 void (set_type_dbg_info)(ir_type *tp, type_dbg_info *db)
421 _set_type_dbg_info(tp, db);
424 int (is_type)(const void *thing)
426 return _is_type(thing);
429 int equal_type(ir_type *typ1, ir_type *typ2)
436 if (typ1 == typ2) return 1;
438 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
439 typ1->name != typ2->name ||
440 (get_type_mode(typ1) != get_type_mode(typ2)) ||
441 (get_type_state(typ1) != get_type_state(typ2)))
443 if ((get_type_state(typ1) == layout_fixed) &&
444 (get_type_size_bytes(typ1) != get_type_size_bytes(typ2)))
447 switch (get_type_tpop_code(typ1)) {
449 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
450 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
451 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
452 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
453 /** Compare the members **/
454 m = ALLOCANZ(ir_entity*, get_class_n_members(typ1));
455 /* First sort the members of typ2 */
456 for (i = 0; i < get_class_n_members(typ1); i++) {
457 ir_entity *e1 = get_class_member(typ1, i);
458 for (j = 0; j < get_class_n_members(typ2); j++) {
459 ir_entity *e2 = get_class_member(typ2, j);
460 if (get_entity_name(e1) == get_entity_name(e2))
464 for (i = 0; i < get_class_n_members(typ1); i++) {
465 if (!m[i] || get_class_member(typ1, i) != m[i])
468 /** Compare the supertypes **/
469 t = ALLOCANZ(ir_type*, get_class_n_supertypes(typ1));
470 /* First sort the supertypes of typ2 */
471 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
472 ir_type *t1 = get_class_supertype(typ1, i);
473 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
474 ir_type *t2 = get_class_supertype(typ2, j);
475 if (t2->name == t1->name)
479 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
480 if (!t[i] || /* Found no counterpart */
481 get_class_supertype(typ1, i) != t[i])
487 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
488 m = ALLOCANZ(ir_entity*, get_struct_n_members(typ1));
489 /* First sort the members of lt */
490 for (i = 0; i < get_struct_n_members(typ1); i++) {
491 ir_entity *e1 = get_struct_member(typ1, i);
492 for (j = 0; j < get_struct_n_members(typ2); j++) {
493 ir_entity *e2 = get_struct_member(typ2, j);
494 if (get_entity_name(e1) == get_entity_name(e2))
498 for (i = 0; i < get_struct_n_members(typ1); i++) {
499 if (!m[i] || get_struct_member(typ1, i) != m[i])
508 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
509 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
510 if (get_method_calling_convention(typ1) !=
511 get_method_calling_convention(typ2)) return 0;
513 n_param1 = get_method_n_params(typ1);
514 n_param2 = get_method_n_params(typ2);
516 if (n_param1 != n_param2) return 0;
518 for (i = 0; i < n_param1; i++) {
519 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
522 for (i = 0; i < get_method_n_ress(typ1); i++) {
523 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
529 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
530 m = ALLOCANZ(ir_entity*, get_union_n_members(typ1));
531 /* First sort the members of lt */
532 for (i = 0; i < get_union_n_members(typ1); i++) {
533 ir_entity *e1 = get_union_member(typ1, i);
534 for (j = 0; j < get_union_n_members(typ2); j++) {
535 ir_entity *e2 = get_union_member(typ2, j);
536 if (get_entity_name(e1) == get_entity_name(e2))
540 for (i = 0; i < get_union_n_members(typ1); i++) {
541 if (!m[i] || get_union_member(typ1, i) != m[i])
547 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
549 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
551 for (i = 0; i < get_array_n_dimensions(typ1); i++) {
552 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
553 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
555 if (get_array_order(typ1, i) != get_array_order(typ2, i))
556 assert(0 && "type compare with different dimension orders not implemented");
560 case tpo_enumeration:
561 assert(0 && "enumerations not implemented");
565 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
577 int smaller_type(ir_type *st, ir_type *lt)
584 if (st == lt) return 1;
586 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
589 switch (get_type_tpop_code(st)) {
591 return is_SubClass_of(st, lt);
594 n_st_members = get_struct_n_members(st);
595 if (n_st_members != get_struct_n_members(lt))
598 m = ALLOCANZ(ir_entity*, n_st_members);
599 /* First sort the members of lt */
600 for (i = 0; i < n_st_members; ++i) {
601 ir_entity *se = get_struct_member(st, i);
602 size_t n = get_struct_n_members(lt);
603 for (j = 0; j < n; ++j) {
604 ir_entity *le = get_struct_member(lt, j);
605 if (get_entity_name(le) == get_entity_name(se))
609 for (i = 0; i < n_st_members; i++) {
610 if (!m[i] || /* Found no counterpart */
611 !smaller_type(get_entity_type(get_struct_member(st, i)), get_entity_type(m[i])))
617 size_t n_param1, n_param2;
619 /** FIXME: is this still 1? */
620 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
621 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
622 if (get_method_calling_convention(st) !=
623 get_method_calling_convention(lt)) return 0;
625 n_param1 = get_method_n_params(st);
626 n_param2 = get_method_n_params(lt);
628 if (n_param1 != n_param2) return 0;
630 for (i = 0; i < get_method_n_params(st); i++) {
631 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
634 for (i = 0; i < get_method_n_ress(st); i++) {
635 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
641 n_st_members = get_union_n_members(st);
642 if (n_st_members != get_union_n_members(lt)) return 0;
643 m = ALLOCANZ(ir_entity*, n_st_members);
644 /* First sort the members of lt */
645 for (i = 0; i < n_st_members; ++i) {
646 ir_entity *se = get_union_member(st, i);
647 size_t n = get_union_n_members(lt);
648 for (j = 0; j < n; ++j) {
649 ir_entity *le = get_union_member(lt, j);
650 if (get_entity_name(le) == get_entity_name(se))
654 for (i = 0; i < n_st_members; ++i) {
655 if (!m[i] || /* Found no counterpart */
656 !smaller_type(get_entity_type(get_union_member(st, i)), get_entity_type(m[i])))
662 ir_type *set, *let; /* small/large elt. ir_type */
663 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
665 set = get_array_element_type(st);
666 let = get_array_element_type(lt);
668 /* If the element types are different, set must be convertible
669 to let, and they must have the same size so that address
670 computations work out. To have a size the layout must
672 if ((get_type_state(set) != layout_fixed) ||
673 (get_type_state(let) != layout_fixed))
675 if (!smaller_type(set, let) ||
676 get_type_size_bytes(set) != get_type_size_bytes(let))
679 for (i = 0; i < get_array_n_dimensions(st); i++) {
680 if (get_array_lower_bound(lt, i))
681 if (get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
683 if (get_array_upper_bound(lt, i))
684 if (get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
689 case tpo_enumeration:
690 assert(0 && "enumerations not implemented");
694 if (!smaller_type(get_pointer_points_to_type(st), get_pointer_points_to_type(lt)))
699 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
709 ir_type *new_d_type_class(ident *name, type_dbg_info *db)
713 res = new_type(type_class, NULL, db);
716 res->attr.ca.members = NEW_ARR_F (ir_entity *, 0);
717 res->attr.ca.subtypes = NEW_ARR_F (ir_type *, 0);
718 res->attr.ca.supertypes = NEW_ARR_F (ir_type *, 0);
719 res->attr.ca.peculiarity = peculiarity_existent;
720 res->attr.ca.type_info = NULL;
721 res->attr.ca.vtable_size = 0;
722 res->attr.ca.clss_flags = cf_none;
723 res->attr.ca.dfn = 0;
728 ir_type *new_type_class(ident *name)
730 return new_d_type_class(name, NULL);
733 void free_class_entities(ir_type *clss)
736 assert(clss && (clss->type_op == type_class));
737 /* we must iterate backward here */
738 for (i = get_class_n_members(clss); i > 0;)
739 free_entity(get_class_member(clss, --i));
740 /* do NOT free the type info here. It belongs to another class */
743 void free_class_attrs(ir_type *clss)
745 assert(clss && (clss->type_op == type_class));
746 DEL_ARR_F(clss->attr.ca.members);
747 DEL_ARR_F(clss->attr.ca.subtypes);
748 DEL_ARR_F(clss->attr.ca.supertypes);
751 ident *get_class_ident(const ir_type *clss)
753 assert(clss->type_op == type_class);
757 const char *get_class_name(const ir_type *clss)
759 if (get_class_ident(clss) == NULL)
761 return get_id_str(get_class_ident(clss));
764 static void add_class_member(ir_type *clss, ir_entity *member)
766 assert(clss && (clss->type_op == type_class));
767 assert(clss != get_entity_type(member) && "recursive type");
768 ARR_APP1 (ir_entity *, clss->attr.ca.members, member);
771 size_t (get_class_n_members)(const ir_type *clss)
773 return _get_class_n_members(clss);
776 size_t get_class_member_index(const ir_type *clss, ir_entity *mem)
779 assert(clss && (clss->type_op == type_class));
780 for (i = 0, n = get_class_n_members(clss); i < n; ++i) {
781 if (get_class_member(clss, i) == mem)
784 return INVALID_MEMBER_INDEX;
787 ir_entity *(get_class_member)(const ir_type *clss, size_t pos)
789 return _get_class_member(clss, pos);
792 ir_entity *get_class_member_by_name(ir_type *clss, ident *name)
795 assert(clss && (clss->type_op == type_class));
796 n_mem = get_class_n_members(clss);
797 for (i = 0; i < n_mem; ++i) {
798 ir_entity *mem = get_class_member(clss, i);
799 if (get_entity_ident(mem) == name)
805 static void remove_class_member(ir_type *clss, ir_entity *member)
808 assert(clss && (clss->type_op == type_class));
809 for (i = 0; i < ARR_LEN(clss->attr.ca.members); ++i) {
810 if (clss->attr.ca.members[i] == member) {
811 for (; i < ARR_LEN(clss->attr.ca.members) - 1; ++i)
812 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
813 ARR_SETLEN(ir_entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
819 void add_class_subtype(ir_type *clss, ir_type *subtype)
822 assert(clss->type_op == type_class);
823 ARR_APP1 (ir_type *, clss->attr.ca.subtypes, subtype);
824 for (i = 0; i < get_class_n_supertypes(subtype); i++) {
825 if (get_class_supertype(subtype, i) == clss)
826 /* Class already registered */
829 ARR_APP1(ir_type *, subtype->attr.ca.supertypes, clss);
832 size_t get_class_n_subtypes(const ir_type *clss)
834 assert(clss->type_op == type_class);
835 return ARR_LEN (clss->attr.ca.subtypes);
838 ir_type *get_class_subtype(ir_type *clss, size_t pos)
840 assert(clss->type_op == type_class);
841 assert(pos < get_class_n_subtypes(clss));
842 return clss->attr.ca.subtypes[pos];
845 size_t get_class_subtype_index(ir_type *clss, const ir_type *subclass)
847 size_t i, n_subtypes = get_class_n_subtypes(clss);
848 assert(is_Class_type(subclass));
849 for (i = 0; i < n_subtypes; ++i) {
850 if (get_class_subtype(clss, i) == subclass)
856 void set_class_subtype(ir_type *clss, ir_type *subtype, size_t pos)
858 assert(clss->type_op == type_class);
859 assert(pos < get_class_n_subtypes(clss));
860 clss->attr.ca.subtypes[pos] = subtype;
863 void remove_class_subtype(ir_type *clss, ir_type *subtype)
866 assert(clss && (clss->type_op == type_class));
867 for (i = 0; i < ARR_LEN(clss->attr.ca.subtypes); ++i) {
868 if (clss->attr.ca.subtypes[i] == subtype) {
869 for (; i < ARR_LEN(clss->attr.ca.subtypes) - 1; ++i)
870 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
871 ARR_SETLEN(ir_type*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
877 void add_class_supertype(ir_type *clss, ir_type *supertype)
881 assert(clss && (clss->type_op == type_class));
882 assert(supertype && (supertype -> type_op == type_class));
883 ARR_APP1 (ir_type *, clss->attr.ca.supertypes, supertype);
884 for (i = 0, n = get_class_n_subtypes(supertype); i < n; ++i) {
885 if (get_class_subtype(supertype, i) == clss)
886 /* Class already registered */
889 ARR_APP1(ir_type *, supertype->attr.ca.subtypes, clss);
892 size_t get_class_n_supertypes(const ir_type *clss)
894 assert(clss->type_op == type_class);
895 return ARR_LEN(clss->attr.ca.supertypes);
898 size_t get_class_supertype_index(ir_type *clss, ir_type *super_clss)
900 size_t i, n_supertypes = get_class_n_supertypes(clss);
901 assert(super_clss && (super_clss->type_op == type_class));
902 for (i = 0; i < n_supertypes; i++) {
903 if (get_class_supertype(clss, i) == super_clss)
909 ir_type *get_class_supertype(ir_type *clss, size_t pos)
911 assert(clss->type_op == type_class);
912 assert(pos < get_class_n_supertypes(clss));
913 return clss->attr.ca.supertypes[pos];
916 void set_class_supertype(ir_type *clss, ir_type *supertype, size_t pos)
918 assert(clss->type_op == type_class);
919 assert(pos < get_class_n_supertypes(clss));
920 clss->attr.ca.supertypes[pos] = supertype;
923 void remove_class_supertype(ir_type *clss, ir_type *supertype)
926 assert(clss && (clss->type_op == type_class));
927 for (i = 0; i < ARR_LEN(clss->attr.ca.supertypes); ++i) {
928 if (clss->attr.ca.supertypes[i] == supertype) {
929 for (; i < ARR_LEN(clss->attr.ca.supertypes) - 1; ++i)
930 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
931 ARR_SETLEN(ir_type*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
937 ir_entity *get_class_type_info(const ir_type *clss)
939 return clss->attr.ca.type_info;
942 void set_class_type_info(ir_type *clss, ir_entity *ent)
944 clss->attr.ca.type_info = ent;
946 ent->repr_class = clss;
949 ir_peculiarity get_class_peculiarity(const ir_type *clss)
951 assert(clss && (clss->type_op == type_class));
952 return clss->attr.ca.peculiarity;
955 void set_class_peculiarity(ir_type *clss, ir_peculiarity pec)
957 assert(clss && (clss->type_op == type_class));
958 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
959 clss->attr.ca.peculiarity = pec;
962 unsigned (get_class_vtable_size)(const ir_type *clss)
964 return _get_class_vtable_size(clss);
967 void (set_class_vtable_size)(ir_type *clss, unsigned size)
969 _set_class_vtable_size(clss, size);
972 int (is_class_final)(const ir_type *clss)
974 return _is_class_final(clss);
977 void (set_class_final)(ir_type *clss, int flag)
979 _set_class_final(clss, flag);
982 int (is_class_interface)(const ir_type *clss)
984 return _is_class_interface(clss);
987 void (set_class_interface)(ir_type *clss, int flag)
989 _set_class_interface(clss, flag);
992 int (is_class_abstract)(const ir_type *clss)
994 return _is_class_abstract(clss);
997 void (set_class_abstract)(ir_type *clss, int final)
999 _set_class_abstract(clss, final);
1002 void set_class_dfn(ir_type *clss, int dfn)
1004 clss->attr.ca.dfn = dfn;
1007 int get_class_dfn(const ir_type *clss)
1009 return (clss->attr.ca.dfn);
1012 int (is_Class_type)(const ir_type *clss)
1014 return _is_class_type(clss);
1017 void set_class_mode(ir_type *tp, ir_mode *mode)
1019 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1020 assert(get_type_state(tp) == layout_fixed &&
1021 tp->size == get_mode_size_bytes(mode) && "mode don't match class layout");
1025 void set_class_size(ir_type *tp, unsigned size)
1031 ir_type *new_d_type_struct(ident *name, type_dbg_info *db)
1033 ir_type *res = new_type(type_struct, NULL, db);
1036 res->attr.sa.members = NEW_ARR_F(ir_entity *, 0);
1041 ir_type *new_type_struct(ident *name)
1043 return new_d_type_struct (name, NULL);
1046 void free_struct_entities(ir_type *strct)
1049 assert(strct && (strct->type_op == type_struct));
1050 /* we must iterate backward here */
1051 for (i = get_struct_n_members(strct); i > 0;)
1052 free_entity(get_struct_member(strct, --i));
1055 void free_struct_attrs(ir_type *strct)
1057 assert(strct && (strct->type_op == type_struct));
1058 DEL_ARR_F(strct->attr.sa.members);
1061 ident *get_struct_ident(const ir_type *strct)
1063 assert(strct->type_op == type_struct);
1067 const char *get_struct_name(const ir_type *strct)
1069 if (get_struct_ident(strct) == NULL)
1071 return get_id_str(get_struct_ident(strct));
1074 size_t get_struct_n_members(const ir_type *strct)
1076 assert(strct->type_op == type_struct);
1077 return ARR_LEN(strct->attr.sa.members);
1080 static void add_struct_member(ir_type *strct, ir_entity *member)
1082 assert(strct && (strct->type_op == type_struct));
1083 assert(get_type_tpop(get_entity_type(member)) != type_method);
1084 assert(strct != get_entity_type(member) && "recursive type");
1085 ARR_APP1 (ir_entity *, strct->attr.sa.members, member);
1088 ir_entity *get_struct_member(const ir_type *strct, size_t pos)
1090 assert(strct && (strct->type_op == type_struct));
1091 assert(pos < get_struct_n_members(strct));
1092 return strct->attr.sa.members[pos];
1095 size_t get_struct_member_index(const ir_type *strct, ir_entity *mem)
1098 assert(strct && (strct->type_op == type_struct));
1099 for (i = 0, n = get_struct_n_members(strct); i < n; ++i) {
1100 if (get_struct_member(strct, i) == mem)
1106 static void remove_struct_member(ir_type *strct, ir_entity *member)
1109 assert(strct && (strct->type_op == type_struct));
1110 for (i = 0; i < ARR_LEN(strct->attr.sa.members); ++i) {
1111 if (strct->attr.sa.members[i] == member) {
1112 for (; i < ARR_LEN(strct->attr.sa.members) - 1; ++i)
1113 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1114 ARR_SETLEN(ir_entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1120 int (is_Struct_type)(const ir_type *strct)
1122 return _is_struct_type(strct);
1125 void set_struct_mode(ir_type *tp, ir_mode *mode)
1127 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
1128 assert(get_type_state(tp) == layout_fixed &&
1129 tp->size == get_mode_size_bytes(mode) && "mode don't match struct layout");
1133 void set_struct_size(ir_type *tp, unsigned size)
1138 ir_type *new_d_type_method(size_t n_param, size_t n_res, type_dbg_info *db)
1142 assert((get_mode_size_bits(mode_P_code) % 8 == 0) && "unorthodox modes not implemented");
1143 res = new_type(type_method, mode_P_code, db);
1144 res->flags |= tf_layout_fixed;
1145 res->size = get_mode_size_bytes(mode_P_code);
1146 res->attr.ma.n_params = n_param;
1147 res->attr.ma.params = XMALLOCNZ(tp_ent_pair, n_param);
1148 res->attr.ma.n_res = n_res;
1149 res->attr.ma.res_type = XMALLOCNZ(tp_ent_pair, n_res);
1150 res->attr.ma.variadicity = variadicity_non_variadic;
1151 res->attr.ma.additional_properties = mtp_no_property;
1156 ir_type *new_type_method(size_t n_param, size_t n_res)
1158 return new_d_type_method(n_param, n_res, NULL);
1161 ir_type *clone_type_method(ir_type *tp)
1169 assert(is_Method_type(tp));
1172 n_params = tp->attr.ma.n_params;
1173 n_res = tp->attr.ma.n_res;
1176 res = new_type(type_method, mode, db);
1178 res->flags = tp->flags;
1179 res->higher_type = tp->higher_type;
1180 res->size = tp->size;
1181 res->attr.ma.n_params = n_params;
1182 res->attr.ma.params = XMALLOCN(tp_ent_pair, n_params);
1183 memcpy(res->attr.ma.params, tp->attr.ma.params, n_params * sizeof(res->attr.ma.params[0]));
1184 res->attr.ma.n_res = n_res;
1185 res->attr.ma.res_type = XMALLOCN(tp_ent_pair, n_res);
1186 memcpy(res->attr.ma.res_type, tp->attr.ma.res_type, n_res * sizeof(res->attr.ma.res_type[0]));
1187 res->attr.ma.variadicity = tp->attr.ma.variadicity;
1188 res->attr.ma.additional_properties = tp->attr.ma.additional_properties;
1189 res->attr.ma.irg_calling_conv = tp->attr.ma.irg_calling_conv;
1194 void free_method_entities(ir_type *method)
1197 assert(method && (method->type_op == type_method));
1200 void free_method_attrs(ir_type *method)
1202 assert(method && (method->type_op == type_method));
1203 free(method->attr.ma.params);
1204 free(method->attr.ma.res_type);
1207 size_t (get_method_n_params)(const ir_type *method)
1209 return _get_method_n_params(method);
1212 ir_type *get_method_param_type(const ir_type *method, size_t pos)
1215 assert(method->type_op == type_method);
1216 assert(pos < get_method_n_params(method));
1217 res = method->attr.ma.params[pos].tp;
1218 assert(res != NULL && "empty method param type");
1222 void set_method_param_type(ir_type *method, size_t pos, ir_type *tp)
1224 assert(method->type_op == type_method);
1225 assert(pos < get_method_n_params(method));
1226 method->attr.ma.params[pos].tp = tp;
1229 size_t (get_method_n_ress)(const ir_type *method)
1231 return _get_method_n_ress(method);
1234 ir_type *get_method_res_type(const ir_type *method, size_t pos)
1237 assert(method->type_op == type_method);
1238 assert(pos < get_method_n_ress(method));
1239 res = method->attr.ma.res_type[pos].tp;
1240 assert(res != NULL && "empty method return type");
1244 void set_method_res_type(ir_type *method, size_t pos, ir_type *tp)
1246 assert(method->type_op == type_method);
1247 assert(pos < get_method_n_ress(method));
1248 /* set the result ir_type */
1249 method->attr.ma.res_type[pos].tp = tp;
1250 /* If information constructed set pass-by-value representation. */
1253 const char *get_variadicity_name(ir_variadicity vari)
1255 #define X(a) case a: return #a
1257 X(variadicity_non_variadic);
1258 X(variadicity_variadic);
1265 ir_variadicity get_method_variadicity(const ir_type *method)
1267 assert(method && (method->type_op == type_method));
1268 return method->attr.ma.variadicity;
1271 void set_method_variadicity(ir_type *method, ir_variadicity vari)
1273 assert(method && (method->type_op == type_method));
1274 method->attr.ma.variadicity = vari;
1277 mtp_additional_properties (get_method_additional_properties)(const ir_type *method)
1279 return _get_method_additional_properties(method);
1282 void (set_method_additional_properties)(ir_type *method, mtp_additional_properties mask)
1284 _set_method_additional_properties(method, mask);
1287 void (add_method_additional_properties)(ir_type *method,
1288 mtp_additional_properties flag)
1290 _add_method_additional_properties(method, flag);
1293 unsigned (get_method_calling_convention)(const ir_type *method)
1295 return _get_method_calling_convention(method);
1298 void (set_method_calling_convention)(ir_type *method, unsigned cc_mask)
1300 _set_method_calling_convention(method, cc_mask);
1303 unsigned get_method_n_regparams(ir_type *method)
1305 unsigned cc = get_method_calling_convention(method);
1306 assert(IS_FASTCALL(cc));
1308 return cc & ~cc_bits;
1311 void set_method_n_regparams(ir_type *method, unsigned n_regs)
1313 unsigned cc = get_method_calling_convention(method);
1314 assert(IS_FASTCALL(cc));
1316 set_method_calling_convention(method, (cc & cc_bits) | (n_regs & ~cc_bits));
1319 int (is_Method_type)(const ir_type *method)
1321 return _is_method_type(method);
1325 ir_type *new_d_type_union(ident *name, type_dbg_info *db)
1327 ir_type *res = new_type(type_union, NULL, db);
1330 res->attr.ua.members = NEW_ARR_F(ir_entity *, 0);
1335 ir_type *new_type_union(ident *name)
1337 return new_d_type_union(name, NULL);
1340 void free_union_entities(ir_type *uni)
1343 assert(uni && (uni->type_op == type_union));
1344 /* we must iterate backward here */
1345 for (i = get_union_n_members(uni); i > 0;)
1346 free_entity(get_union_member(uni, --i));
1349 void free_union_attrs(ir_type *uni)
1351 assert(uni && (uni->type_op == type_union));
1352 DEL_ARR_F(uni->attr.ua.members);
1355 ident *get_union_ident(const ir_type *uni)
1357 assert(uni->type_op == type_union);
1361 const char *get_union_name(const ir_type *uni)
1363 if (get_union_ident(uni) == NULL)
1365 return get_id_str(get_union_ident(uni));
1368 size_t get_union_n_members(const ir_type *uni)
1370 assert(uni->type_op == type_union);
1371 return ARR_LEN(uni->attr.ua.members);
1374 static void add_union_member(ir_type *uni, ir_entity *member)
1376 assert(uni->type_op == type_union);
1377 assert(uni != get_entity_type(member) && "recursive type");
1378 ARR_APP1(ir_entity *, uni->attr.ua.members, member);
1381 ir_entity *get_union_member(const ir_type *uni, size_t pos)
1383 assert(uni->type_op == type_union);
1384 assert(pos < get_union_n_members(uni));
1385 return uni->attr.ua.members[pos];
1388 size_t get_union_member_index(const ir_type *uni, ir_entity *mem)
1391 assert(uni && (uni->type_op == type_union));
1392 for (i = 0, n = get_union_n_members(uni); i < n; ++i) {
1393 if (get_union_member(uni, i) == mem)
1399 static void remove_union_member(ir_type *uni, ir_entity *member)
1402 assert(uni && (uni->type_op == type_union));
1403 for (i = 0; i < ARR_LEN(uni->attr.ua.members); ++i) {
1404 if (uni->attr.ua.members[i] == member) {
1405 for (; i < ARR_LEN(uni->attr.ua.members) - 1; i++)
1406 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1407 ARR_SETLEN(ir_entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1413 int (is_Union_type)(const ir_type *uni)
1415 return _is_union_type(uni);
1418 void set_union_size(ir_type *tp, unsigned size)
1425 ir_type *new_d_type_array(size_t n_dimensions, ir_type *element_type,
1431 ir_graph *irg = get_const_code_irg();
1433 assert(!is_Method_type(element_type));
1435 res = new_type(type_array, NULL, db);
1436 res->attr.aa.n_dimensions = n_dimensions;
1437 res->attr.aa.lower_bound = XMALLOCNZ(ir_node*, n_dimensions);
1438 res->attr.aa.upper_bound = XMALLOCNZ(ir_node*, n_dimensions);
1439 res->attr.aa.order = XMALLOCNZ(size_t, n_dimensions);
1441 unk = new_r_Unknown(irg, mode_Iu);
1442 for (i = 0; i < n_dimensions; i++) {
1443 res->attr.aa.lower_bound[i] =
1444 res->attr.aa.upper_bound[i] = unk;
1445 res->attr.aa.order[i] = i;
1448 res->attr.aa.element_type = element_type;
1449 res->attr.aa.element_ent
1450 = new_entity(NULL, new_id_from_chars("elem_ent", 8), element_type);
1451 res->attr.aa.element_ent->owner = res;
1457 ir_type *new_type_array(size_t n_dimensions, ir_type *element_type)
1459 return new_d_type_array(n_dimensions, element_type, NULL);
1462 void free_array_automatic_entities(ir_type *array)
1464 assert(array->type_op == type_array);
1465 free_entity(get_array_element_entity(array));
1468 void free_array_entities(ir_type *array)
1471 assert(array->type_op == type_array);
1474 void free_array_attrs(ir_type *array)
1476 assert(array->type_op == type_array);
1477 free(array->attr.aa.lower_bound);
1478 free(array->attr.aa.upper_bound);
1479 free(array->attr.aa.order);
1482 size_t get_array_n_dimensions(const ir_type *array)
1484 assert(array->type_op == type_array);
1485 return array->attr.aa.n_dimensions;
1488 void set_array_bounds(ir_type *array, size_t dimension, ir_node *lower_bound,
1489 ir_node *upper_bound)
1491 assert(array->type_op == type_array);
1492 assert(lower_bound && "lower_bound node may not be NULL.");
1493 assert(upper_bound && "upper_bound node may not be NULL.");
1494 assert(dimension < array->attr.aa.n_dimensions);
1495 array->attr.aa.lower_bound[dimension] = lower_bound;
1496 array->attr.aa.upper_bound[dimension] = upper_bound;
1499 void set_array_bounds_int(ir_type *array, size_t dimension, int lower_bound,
1502 ir_graph *irg = get_const_code_irg();
1503 set_array_bounds(array, dimension,
1504 new_r_Const_long(irg, mode_Iu, lower_bound),
1505 new_r_Const_long(irg, mode_Iu, upper_bound));
1508 void set_array_lower_bound(ir_type *array, size_t dimension,
1509 ir_node *lower_bound)
1511 assert(array->type_op == type_array);
1512 assert(lower_bound && "lower_bound node may not be NULL.");
1513 array->attr.aa.lower_bound[dimension] = lower_bound;
1516 void set_array_lower_bound_int(ir_type *array, size_t dimension, int lower_bound)
1518 ir_graph *irg = get_const_code_irg();
1519 set_array_lower_bound(array, dimension,
1520 new_r_Const_long(irg, mode_Iu, lower_bound));
1523 void set_array_upper_bound(ir_type *array, size_t dimension, ir_node *upper_bound)
1525 assert(array->type_op == type_array);
1526 assert(upper_bound && "upper_bound node may not be NULL.");
1527 array->attr.aa.upper_bound[dimension] = upper_bound;
1530 void set_array_upper_bound_int(ir_type *array, size_t dimension, int upper_bound)
1532 ir_graph *irg = get_const_code_irg();
1533 set_array_upper_bound(array, dimension,
1534 new_r_Const_long(irg, mode_Iu, upper_bound));
1537 int has_array_lower_bound(const ir_type *array, size_t dimension)
1539 assert(array->type_op == type_array);
1540 return !is_Unknown(array->attr.aa.lower_bound[dimension]);
1543 ir_node *get_array_lower_bound(const ir_type *array, size_t dimension)
1545 assert(array->type_op == type_array);
1546 return array->attr.aa.lower_bound[dimension];
1549 long get_array_lower_bound_int(const ir_type *array, size_t dimension)
1552 assert(array->type_op == type_array);
1553 node = array->attr.aa.lower_bound[dimension];
1554 assert(is_Const(node));
1555 return get_tarval_long(get_Const_tarval(node));
1558 int has_array_upper_bound(const ir_type *array, size_t dimension)
1560 assert(array->type_op == type_array);
1561 return !is_Unknown(array->attr.aa.upper_bound[dimension]);
1564 ir_node *get_array_upper_bound(const ir_type *array, size_t dimension)
1566 assert(array->type_op == type_array);
1567 return array->attr.aa.upper_bound[dimension];
1570 long get_array_upper_bound_int(const ir_type *array, size_t dimension)
1573 assert(array->type_op == type_array);
1574 node = array->attr.aa.upper_bound[dimension];
1575 assert(is_Const(node));
1576 return get_tarval_long(get_Const_tarval(node));
1579 void set_array_order(ir_type *array, size_t dimension, size_t order)
1581 assert(array->type_op == type_array);
1582 array->attr.aa.order[dimension] = order;
1585 size_t get_array_order(const ir_type *array, size_t dimension)
1587 assert(array->type_op == type_array);
1588 return array->attr.aa.order[dimension];
1591 size_t find_array_dimension(const ir_type *array, size_t order)
1595 assert(array->type_op == type_array);
1597 for (dim = 0; dim < array->attr.aa.n_dimensions; ++dim) {
1598 if (array->attr.aa.order[dim] == order)
1604 void set_array_element_type(ir_type *array, ir_type *tp)
1606 assert(array->type_op == type_array);
1607 assert(!is_Method_type(tp));
1608 array->attr.aa.element_type = tp;
1611 ir_type *get_array_element_type(const ir_type *array)
1613 assert(array->type_op == type_array);
1614 return array->attr.aa.element_type;
1617 void set_array_element_entity(ir_type *array, ir_entity *ent)
1619 assert(array->type_op == type_array);
1620 assert((get_entity_type(ent)->type_op != type_method));
1621 array->attr.aa.element_ent = ent;
1622 array->attr.aa.element_type = get_entity_type(ent);
1625 ir_entity *get_array_element_entity(const ir_type *array)
1627 assert(array->type_op == type_array);
1628 return array->attr.aa.element_ent;
1631 int is_array_variable_size(const ir_type *array)
1633 assert(array->type_op == type_array);
1634 return (array->flags & tf_variable_size) != 0;
1637 void set_array_variable_size(ir_type *array, int flag)
1639 assert(array->type_op == type_array);
1640 array->flags = (array->flags & ~tf_variable_size)
1641 | (flag != 0 ? tf_variable_size : 0);
1644 int (is_Array_type)(const ir_type *array)
1646 return _is_array_type(array);
1649 void set_array_size(ir_type *tp, unsigned size)
1651 /* FIXME: Here we should make some checks with the element type size */
1656 ir_type *new_d_type_enumeration(ident *name, size_t n_enums, type_dbg_info *db)
1660 res = new_type(type_enumeration, NULL, db);
1662 res->attr.ea.enumer = NEW_ARR_F(ir_enum_const, n_enums);
1667 ir_type *new_type_enumeration(ident *name, size_t n_enums)
1669 return new_d_type_enumeration(name, n_enums, NULL);
1672 void free_enumeration_entities(ir_type *enumeration)
1675 assert(enumeration->type_op == type_enumeration);
1678 void free_enumeration_attrs(ir_type *enumeration)
1680 assert(enumeration->type_op == type_enumeration);
1681 DEL_ARR_F(enumeration->attr.ea.enumer);
1684 ident *get_enumeration_ident(const ir_type *enumeration)
1686 assert(enumeration->type_op == type_enumeration);
1687 return enumeration->name;
1690 const char *get_enumeration_name(const ir_type *enumeration)
1692 if (get_enumeration_ident(enumeration) == NULL)
1694 return get_id_str(get_enumeration_ident(enumeration));
1697 size_t get_enumeration_n_enums(const ir_type *enumeration)
1699 assert(enumeration->type_op == type_enumeration);
1700 return ARR_LEN(enumeration->attr.ea.enumer);
1703 void set_enumeration_const(ir_type *enumeration, size_t pos, ident *nameid,
1706 assert(pos < ARR_LEN(enumeration->attr.ea.enumer));
1707 enumeration->attr.ea.enumer[pos].nameid = nameid;
1708 enumeration->attr.ea.enumer[pos].value = con;
1709 enumeration->attr.ea.enumer[pos].owner = enumeration;
1712 ir_enum_const *get_enumeration_const(const ir_type *enumeration, size_t pos)
1714 assert(enumeration->type_op == type_enumeration);
1715 assert(pos < get_enumeration_n_enums(enumeration));
1716 return &enumeration->attr.ea.enumer[pos];
1719 ir_type *get_enumeration_owner(const ir_enum_const *enum_cnst)
1721 return enum_cnst->owner;
1724 void set_enumeration_value(ir_enum_const *enum_cnst, ir_tarval *con)
1726 enum_cnst->value = con;
1729 ir_tarval *get_enumeration_value(const ir_enum_const *enum_cnst)
1731 return enum_cnst->value;
1734 void set_enumeration_nameid(ir_enum_const *enum_cnst, ident *id)
1736 enum_cnst->nameid = id;
1739 ident *get_enumeration_const_nameid(const ir_enum_const *enum_cnst)
1741 return enum_cnst->nameid;
1744 const char *get_enumeration_const_name(const ir_enum_const *enum_cnst)
1746 return get_id_str(enum_cnst->nameid);
1749 int (is_Enumeration_type)(const ir_type *enumeration)
1751 return _is_enumeration_type(enumeration);
1754 void set_enumeration_mode(ir_type *tp, ir_mode *mode)
1756 assert(mode_is_int(mode) && "Modes of enumerations must be integers");
1757 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1758 assert((get_mode_size_bits(mode) % 8) == 0 && "unorthodox modes not implemented");
1760 tp->size = get_mode_size_bytes(mode);
1766 ir_type *new_d_type_pointer(ir_type *points_to, type_dbg_info *db)
1771 if (is_Method_type(points_to) || is_code_type(points_to)) {
1777 res = new_type(type_pointer, mode, db);
1778 res->attr.pa.points_to = points_to;
1779 assert((get_mode_size_bits(res->mode) % 8 == 0) && "unorthodox modes not implemented");
1780 res->size = get_mode_size_bytes(res->mode);
1781 res->flags |= tf_layout_fixed;
1786 ir_type *new_type_pointer(ir_type *points_to)
1788 return new_d_type_pointer(points_to, NULL);
1791 void free_pointer_entities(ir_type *pointer)
1794 assert(pointer && (pointer->type_op == type_pointer));
1797 void free_pointer_attrs(ir_type *pointer)
1800 assert(pointer && (pointer->type_op == type_pointer));
1803 void set_pointer_points_to_type(ir_type *pointer, ir_type *tp)
1805 assert(pointer && (pointer->type_op == type_pointer));
1806 pointer->attr.pa.points_to = tp;
1809 ir_type *get_pointer_points_to_type(const ir_type *pointer)
1811 assert(pointer && (pointer->type_op == type_pointer));
1812 return pointer->attr.pa.points_to;
1815 int (is_Pointer_type)(const ir_type *pointer)
1817 return _is_pointer_type(pointer);
1820 void set_pointer_mode(ir_type *tp, ir_mode *mode)
1822 assert(mode_is_reference(mode) && "Modes of pointers must be references");
1823 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
1824 assert((get_mode_size_bits(mode) & 7) == 0 && "unorthodox modes not implemented");
1826 tp->size = get_mode_size_bytes(mode);
1830 ir_type *find_pointer_type_to_type(ir_type *tp)
1832 size_t i, n = get_irp_n_types();
1833 for (i = 0; i < n; ++i) {
1834 ir_type *found = get_irp_type(i);
1835 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1838 return get_unknown_type();
1842 ir_type *new_d_type_primitive(ir_mode *mode, type_dbg_info *db)
1844 ir_type *res = new_type(type_primitive, mode, db);
1845 res->size = get_mode_size_bytes(mode);
1846 res->flags |= tf_layout_fixed;
1847 res->attr.ba.base_type = NULL;
1852 ir_type *new_type_primitive(ir_mode *mode)
1854 return new_d_type_primitive(mode, NULL);
1857 int (is_Primitive_type)(const ir_type *primitive)
1859 return _is_primitive_type(primitive);
1862 void set_primitive_mode(ir_type *tp, ir_mode *mode)
1864 /* Modes of primitives must be data */
1865 assert(mode_is_data(mode));
1867 /* For primitive size depends on the mode. */
1868 tp->size = get_mode_size_bytes(mode);
1872 ir_type *get_primitive_base_type(const ir_type *tp)
1874 assert(is_Primitive_type(tp));
1875 return tp->attr.ba.base_type;
1878 void set_primitive_base_type(ir_type *tp, ir_type *base_tp)
1880 assert(is_Primitive_type(tp));
1881 tp->attr.ba.base_type = base_tp;
1886 int (is_atomic_type)(const ir_type *tp)
1888 return _is_atomic_type(tp);
1891 size_t get_compound_n_members(const ir_type *tp)
1893 const tp_op *op = get_type_tpop(tp);
1894 return op->ops.get_n_members(tp);
1897 ir_entity *get_compound_member(const ir_type *tp, size_t pos)
1899 const tp_op *op = get_type_tpop(tp);
1900 return op->ops.get_member(tp, pos);
1903 size_t get_compound_member_index(const ir_type *tp, ir_entity *member)
1905 const tp_op *op = get_type_tpop(tp);
1906 return op->ops.get_member_index(tp, member);
1909 void set_compound_variable_size(ir_type *tp, int variable_size_flag)
1911 assert(is_compound_type(tp));
1912 tp->flags = (tp->flags & ~tf_variable_size)
1913 | (variable_size_flag != 0 ? tf_variable_size : 0);
1916 int is_compound_variable_size(const ir_type *tp)
1918 assert(is_compound_type(tp));
1919 return (tp->flags & tf_variable_size) != 0;
1922 int is_compound_type(const ir_type *tp)
1924 assert(tp->kind == k_type);
1925 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;
1928 ident *get_compound_ident(const ir_type *tp)
1930 assert(is_compound_type(tp));
1934 const char *get_compound_name(const ir_type *tp)
1936 if (get_compound_ident(tp) == NULL)
1938 return get_id_str(get_compound_ident(tp));
1941 void remove_compound_member(ir_type *compound, ir_entity *entity)
1943 switch (get_type_tpop_code(compound)) {
1944 case tpo_class: remove_class_member(compound, entity); break;
1945 case tpo_struct: remove_struct_member(compound, entity); break;
1946 case tpo_union: remove_union_member(compound, entity); break;
1948 panic("argument for remove_compound_member not a compound type");
1952 void add_compound_member(ir_type *compound, ir_entity *entity)
1954 switch (get_type_tpop_code(compound)) {
1955 case tpo_class: add_class_member(compound, entity); break;
1956 case tpo_struct: add_struct_member(compound, entity); break;
1957 case tpo_union: add_union_member(compound, entity); break;
1959 panic("argument for add_compound_member not a compound type");
1963 int is_code_type(const ir_type *tp)
1965 assert(tp->kind == k_type);
1966 return tp->type_op == tpop_code;
1969 int is_unknown_type(const ir_type *tp)
1971 assert(tp->kind == k_type);
1972 return tp->type_op == tpop_unknown;
1975 int is_none_type(const ir_type *tp)
1977 assert(tp->kind == k_type);
1978 return tp->type_op == tpop_none;
1981 int is_frame_type(const ir_type *tp)
1983 return tp->flags & tf_frame_type;
1986 ir_type *new_type_frame(void)
1988 ir_type *res = new_type_class(new_id_from_str("<frame_type>"));
1990 res->flags |= tf_frame_type;
1992 /* It is not possible to derive from the frame type. Set the final flag. */
1993 set_class_final(res, 1);
1998 ir_type *clone_frame_type(ir_type *type)
2003 assert(is_frame_type(type));
2004 /* the entity link resource should be allocated if this function is called */
2005 assert(irp_resources_reserved(irp) & IRP_RESOURCE_ENTITY_LINK);
2007 res = new_type_frame();
2008 for (i = 0, n = get_class_n_members(type); i < n; ++i) {
2009 ir_entity *ent = get_class_member(type, i);
2010 ir_entity *nent = copy_entity_own(ent, res);
2011 set_entity_link(ent, nent);
2012 set_entity_link(nent, ent);
2017 void set_default_size(ir_type *tp, unsigned size)
2022 void default_layout_compound_type(ir_type *type)
2025 size_t n = get_compound_n_members(type);
2027 unsigned align_all = 1;
2028 bool var_size = is_compound_variable_size(type);
2030 for (i = 0; i < n; ++i) {
2031 ir_entity *entity = get_compound_member(type, i);
2032 ir_type *entity_type = get_entity_type(entity);
2035 unsigned entity_size;
2037 if (is_Method_type(entity_type))
2040 if (i+1 < n || !var_size) {
2041 assert(get_type_state(entity_type) == layout_fixed);
2042 entity_size = get_type_size_bytes(entity_type);
2047 align = get_type_alignment_bytes(entity_type);
2048 align_all = align > align_all ? align : align_all;
2049 misalign = (align ? size % align : 0);
2050 size += (misalign ? align - misalign : 0);
2052 set_entity_offset(entity, size);
2053 if (!is_Union_type(type)) {
2054 size += entity_size;
2057 if (align_all > 0 && size % align_all) {
2058 size += align_all - (size % align_all);
2060 if (align_all > get_type_alignment_bytes(type)) {
2061 set_type_alignment_bytes(type, align_all);
2063 set_type_size_bytes(type, size);
2064 set_type_state(type, layout_fixed);
2067 ir_entity *frame_alloc_area(ir_type *frame_type, int size, unsigned alignment,
2075 unsigned frame_size = get_type_size_bytes(frame_type);
2076 unsigned frame_align = get_type_alignment_bytes(frame_type);
2077 static unsigned area_cnt = 0;
2079 assert(is_frame_type(frame_type));
2080 assert(get_type_state(frame_type) == layout_fixed);
2081 assert(get_type_alignment_bytes(frame_type) > 0);
2082 set_type_state(frame_type, layout_undefined);
2084 if (irp->byte_type == NULL)
2085 irp->byte_type = new_type_primitive(mode_Bu);
2087 snprintf(buf, sizeof(buf), "area%u", area_cnt++);
2088 name = new_id_from_str(buf);
2090 tp = new_type_array(1, irp->byte_type);
2091 set_array_bounds_int(tp, 0, 0, size);
2092 set_type_alignment_bytes(tp, alignment);
2093 set_type_size_bytes(tp, size);
2097 unsigned delta = (size + frame_align - 1) & ~(frame_align - 1);
2098 /* fix all offsets so far */
2099 for (i = 0, n = get_class_n_members(frame_type); i < n; ++i) {
2100 ir_entity *ent = get_class_member(frame_type, i);
2102 set_entity_offset(ent, get_entity_offset(ent) + delta);
2104 /* calculate offset and new type size */
2106 frame_size += delta;
2108 /* calculate offset and new type size */
2109 offset = (frame_size + alignment - 1) & ~(alignment - 1);
2110 frame_size = offset + size;
2113 area = new_entity(frame_type, name, tp);
2114 set_entity_offset(area, offset);
2115 set_type_size_bytes(frame_type, frame_size);
2116 if (alignment > frame_align) {
2117 set_type_alignment_bytes(frame_type, alignment);
2120 /* mark this entity as compiler generated */
2121 set_entity_compiler_generated(area, 1);
2123 set_type_state(frame_type, layout_fixed);
2127 void ir_print_type(char *buffer, size_t buffer_size, const ir_type *type)
2131 type_dbg_info *tdbgi = get_type_dbg_info(type);
2132 if (tdbgi != NULL) {
2133 ir_retrieve_type_dbg_info(buffer, buffer_size, tdbgi);
2137 /* we have to construct some name... */
2138 switch (get_type_tpop_code(type)) {
2139 case tpo_uninitialized:
2142 snprintf(buffer, buffer_size, "code");
2146 id = get_class_ident(type);
2147 snprintf(buffer, buffer_size, "class '%s'", get_id_str(id));
2151 id = get_struct_ident(type);
2152 snprintf(buffer, buffer_size, "struct '%s'", get_id_str(id));
2156 id = get_union_ident(type);
2157 snprintf(buffer, buffer_size, "union '%s'", get_id_str(id));
2160 case tpo_enumeration:
2161 id = get_enumeration_ident(type);
2162 snprintf(buffer, buffer_size, "enumeration '%s'", get_id_str(id));
2166 snprintf(buffer, buffer_size, "unknown type");
2170 p = snprintf(buffer, buffer_size, "pointer to ");
2173 ir_print_type(buffer, buffer_size, get_pointer_points_to_type(type));
2177 p = snprintf(buffer, buffer_size, "array of ");
2180 ir_print_type(buffer, buffer_size, get_array_element_type(type));
2184 id = get_mode_ident(get_type_mode(type));
2185 snprintf(buffer, buffer_size, "%s", get_id_str(id));
2189 snprintf(buffer, buffer_size, "none");
2192 /* TODO: we should print argument and return types here... */
2193 snprintf(buffer, buffer_size, "method type");
2196 snprintf(buffer, buffer_size, "invalid type");