3 * File name: ir/tr/type.c
4 * Purpose: Representation of types.
5 * Author: Goetz Lindenmaier
9 * Copyright: (c) 2001-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
15 * file type.c - implementation of the datastructure to hold
17 * (C) 2001 by Universitaet Karlsruhe
20 * This module supplies a datastructure to represent all types
21 * known in the compiled program. This includes types specified
22 * in the program as well as types defined by the language. In the
23 * view of the intermediate representation there is no difference
24 * between these types.
26 * There exist several kinds of types, arranged by the structure of
27 * the type. A type is described by a set of attributes. Some of
28 * these attributes are common to all types, others depend on the
31 * Types are different from the modes defined in irmode: Types are
32 * on the level of the programming language, modes at the level of
33 * the target processor.
35 * @see type_t.h type tpop
58 # include "irprog_t.h"
61 # include "typegmod.h"
67 /*******************************************************************/
69 /*******************************************************************/
71 type *firm_none_type; type *get_none_type(void) { return firm_none_type; }
72 type *firm_unknown_type; type *get_unknown_type(void) { return firm_unknown_type; }
76 /** Returns a new, unique number to number nodes or the like. */
77 int get_irp_new_node_nr(void);
80 /* Suffixes added to types used for pass-by-value representations. */
81 static ident *value_params_suffix = NULL;
82 static ident *value_ress_suffix = NULL;
84 void init_type(void) {
85 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
86 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
88 /* construct none and unknown type. */
89 firm_none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"));
90 set_type_size_bits(firm_none_type, 0);
91 set_type_state (firm_none_type, layout_fixed);
92 remove_irp_type(firm_none_type);
93 firm_unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"));
94 set_type_size_bits(firm_unknown_type, 0);
95 set_type_state (firm_unknown_type, layout_fixed);
96 remove_irp_type(firm_unknown_type);
99 unsigned long type_visited;
101 void (set_master_type_visited)(unsigned long val) { _set_master_type_visited(val); }
102 unsigned long (get_master_type_visited)(void) { return _get_master_type_visited(); }
103 void (inc_master_type_visited)(void) { _inc_master_type_visited(); }
107 new_type(tp_op *type_op, ir_mode *mode, ident* name) {
111 assert(type_op != type_id);
112 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
114 node_size = offsetof(type, attr) + type_op->attr_size;
115 res = xmalloc (node_size);
116 memset(res, 0, node_size);
117 add_irp_type(res); /* Remember the new type global. */
120 res->type_op = type_op;
123 res->state = layout_undefined;
129 res->nr = get_irp_new_node_nr();
130 #endif /* defined DEBUG_libfirm */
135 void free_type(type *tp) {
136 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
138 /* Remove from list of all types */
140 /* Free the attributes of the type. */
142 /* Free entities automatically allocated with the type */
143 if (is_Array_type(tp))
144 free_entity(get_array_element_entity(tp));
145 /* And now the type itself... */
150 void free_type_entities(type *tp) {
151 switch(get_type_tpop_code(tp)) {
152 case tpo_class: { free_class_entities(tp); } break;
153 case tpo_struct: { free_struct_entities(tp); } break;
154 case tpo_method: { free_method_entities(tp); } break;
155 case tpo_union: { free_union_entities(tp); } break;
156 case tpo_array: { free_array_entities(tp); } break;
157 case tpo_enumeration: { free_enumeration_entities(tp); } break;
158 case tpo_pointer: { free_pointer_entities(tp); } break;
159 case tpo_primitive: { free_primitive_entities(tp); } break;
164 void free_type_attrs(type *tp) {
165 switch(get_type_tpop_code(tp)) {
166 case tpo_class: { free_class_attrs(tp); } break;
167 case tpo_struct: { free_struct_attrs(tp); } break;
168 case tpo_method: { free_method_attrs(tp); } break;
169 case tpo_union: { free_union_attrs(tp); } break;
170 case tpo_array: { free_array_attrs(tp); } break;
171 case tpo_enumeration: { free_enumeration_attrs(tp); } break;
172 case tpo_pointer: { free_pointer_attrs(tp); } break;
173 case tpo_primitive: { free_primitive_attrs(tp); } break;
178 /* set/get the link field */
179 void *(get_type_link)(const type *tp)
181 return _get_type_link(tp);
184 void (set_type_link)(type *tp, void *l)
186 _set_type_link(tp, l);
189 const tp_op *(get_type_tpop)(const type *tp) {
190 return _get_type_tpop(tp);
193 ident *(get_type_tpop_nameid)(const type *tp) {
194 return _get_type_tpop_nameid(tp);
197 const char* get_type_tpop_name(const type *tp) {
198 assert(tp && tp->kind == k_type);
199 return get_id_str(tp->type_op->name);
202 tp_opcode (get_type_tpop_code)(const type *tp) {
203 return _get_type_tpop_code(tp);
206 ir_mode *(get_type_mode)(const type *tp) {
207 return _get_type_mode(tp);
210 void set_type_mode(type *tp, ir_mode* m) {
211 assert(tp && tp->kind == k_type);
213 assert(((tp->type_op != type_primitive) || mode_is_data(m)) &&
214 /* Modes of primitives must be data */
215 ((tp->type_op != type_enumeration) || mode_is_int(m)) &&
216 /* Modes of enumerations must be integers */
217 ((tp->type_op != type_pointer) || mode_is_reference(m)) );
218 /* Modes of pointers must be references. */
220 switch (get_type_tpop_code(tp)) {
222 /* For primitive size depends on the mode. */
223 tp->size = get_mode_size_bits(m);
226 case tpo_enumeration:
228 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
229 assert((get_mode_size_bits(m) & 7) == 0 && "unorthodox modes not implemented");
230 tp->size = get_mode_size_bits(m);
235 /* for classes and structs we allow to set a mode if the layout is fixed AND the size matches */
236 assert(get_type_state(tp) == layout_fixed &&
237 tp->size == get_mode_size_bits(m) &&
238 "mode don't match struct/class layout");
242 assert(0 && "setting a mode is NOT allowed for this type");
246 ident *(get_type_ident)(const type *tp) {
247 return _get_type_ident(tp);
250 void (set_type_ident)(type *tp, ident* id) {
251 _set_type_ident(tp, id);
254 /* Outputs a unique number for this node */
255 long get_type_nr(const type *tp) {
264 const char* get_type_name(const type *tp) {
265 assert(tp && tp->kind == k_type);
266 return (get_id_str(tp->name));
269 int (get_type_size_bytes)(const type *tp) {
270 return _get_type_size_bytes(tp);
273 int (get_type_size_bits)(const type *tp) {
274 return _get_type_size_bits(tp);
278 set_type_size_bits(type *tp, int size) {
279 assert(tp && tp->kind == k_type);
280 /* For pointer enumeration and primitive size depends on the mode.
281 Methods don't have a size. */
282 if ((tp->type_op != type_pointer) && (tp->type_op != type_primitive) &&
283 (tp->type_op != type_enumeration) && (tp->type_op != type_method)) {
284 if (tp->type_op == type_primitive)
287 /* argh: we must allow to set negative values as "invalid size" */
288 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
289 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
295 set_type_size_bytes(type *tp, int size) {
296 set_type_size_bits(tp, 8*size);
299 int get_type_alignment_bytes(type *tp) {
300 int align = get_type_alignment_bits(tp);
302 return align < 0 ? align : (align + 7) >> 3;
305 int get_type_alignment_bits(type *tp) {
311 /* alignment NOT set calculate it "on demand" */
313 align = get_mode_size_bits(tp->mode);
314 else if (is_Array_type(tp))
315 align = get_type_alignment_bits(get_array_element_type(tp));
316 else if (is_compound_type(tp)) {
317 int i, n = get_compound_n_members(tp);
320 for (i = 0; i < n; ++i) {
321 type *t = get_entity_type(get_compound_member(tp, i));
322 int a = get_type_alignment_bits(t);
328 else if (is_Method_type(tp))
338 set_type_alignment_bits(type *tp, int align) {
339 assert(tp && tp->kind == k_type);
340 /* Methods don't have an alignment. */
341 if (tp->type_op != type_method) {
347 set_type_alignment_bytes(type *tp, int align) {
348 set_type_size_bits(tp, 8*align);
351 /* Returns a human readable string for the enum entry. */
352 const char *get_type_state_name(type_state s) {
353 #define X(a) case a: return #a;
363 type_state (get_type_state)(const type *tp) {
364 return _get_type_state(tp);
368 set_type_state(type *tp, type_state state) {
369 assert(tp && tp->kind == k_type);
371 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
372 (tp->type_op == type_method))
375 /* Just a correctness check: */
376 if (state == layout_fixed) {
378 switch (get_type_tpop_code(tp)) {
381 assert(get_type_size_bits(tp) > -1);
382 if (tp != get_glob_type()) {
383 int n_mem = get_class_n_members(tp);
384 for (i = 0; i < n_mem; i++) {
385 if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
386 { DDMT(tp); DDME(get_class_member(tp, i)); }
387 assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
389 assert(is_Method_type(get_entity_type(get_class_member(tp, i))) ||
390 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
397 assert(get_type_size_bits(tp) > -1);
398 for (i = 0; i < get_struct_n_members(tp); i++) {
399 assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
400 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
409 Assure that only innermost dimension is dynamic? */
411 case tpo_enumeration:
413 assert(get_type_mode != NULL);
414 for (i = 0; i < get_enumeration_n_enums(tp); i++)
415 assert(get_enumeration_enum(tp, i) != NULL);
423 unsigned long (get_type_visited)(const type *tp) {
424 return _get_type_visited(tp);
427 void (set_type_visited)(type *tp, unsigned long num) {
428 _set_type_visited(tp, num);
431 /* Sets visited field in type to type_visited. */
432 void (mark_type_visited)(type *tp) {
433 _mark_type_visited(tp);
436 /* @@@ name clash with master flag
437 int (type_visited)(const type *tp) {
438 return _type_visited(tp);
441 int (type_not_visited)(const type *tp) {
442 return _type_not_visited(tp);
445 int (is_type)(const void *thing) {
446 return _is_type(thing);
449 /* Checks whether two types are structural equal.*/
450 int equal_type(type *typ1, type *typ2) {
455 if (typ1 == typ2) return 1;
457 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
458 (get_type_ident(typ1) != get_type_ident(typ2)) ||
459 (get_type_mode(typ1) != get_type_mode(typ2)) ||
460 (get_type_state(typ1) != get_type_state(typ2)))
462 if ((get_type_state(typ1) == layout_fixed) &&
463 (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
466 switch(get_type_tpop_code(typ1)) {
468 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return 0;
469 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return 0;
470 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return 0;
471 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return 0;
472 /** Compare the members **/
473 m = alloca(sizeof(entity *) * get_class_n_members(typ1));
474 memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
475 /* First sort the members of typ2 */
476 for (i = 0; i < get_class_n_members(typ1); i++) {
477 entity *e1 = get_class_member(typ1, i);
478 for (j = 0; j < get_class_n_members(typ2); j++) {
479 entity *e2 = get_class_member(typ2, j);
480 if (get_entity_name(e1) == get_entity_name(e2))
484 for (i = 0; i < get_class_n_members(typ1); i++) {
485 if (!m[i] || /* Found no counterpart */
486 !equal_entity(get_class_member(typ1, i), m[i]))
489 /** Compare the supertypes **/
490 t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
491 memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
492 /* First sort the supertypes of typ2 */
493 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
494 type *t1 = get_class_supertype(typ1, i);
495 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
496 type *t2 = get_class_supertype(typ2, j);
497 if (get_type_ident(t2) == get_type_ident(t1))
501 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
502 if (!t[i] || /* Found no counterpart */
503 get_class_supertype(typ1, i) != t[i])
508 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return 0;
509 m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
510 memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
511 /* First sort the members of lt */
512 for (i = 0; i < get_struct_n_members(typ1); i++) {
513 entity *e1 = get_struct_member(typ1, i);
514 for (j = 0; j < get_struct_n_members(typ2); j++) {
515 entity *e2 = get_struct_member(typ2, j);
516 if (get_entity_name(e1) == get_entity_name(e2))
520 for (i = 0; i < get_struct_n_members(typ1); i++) {
521 if (!m[i] || /* Found no counterpart */
522 !equal_entity(get_struct_member(typ1, i), m[i]))
527 int n_param1, n_param2;
529 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return 0;
530 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return 0;
532 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
533 n_param1 = get_method_n_params(typ1);
534 n_param2 = get_method_n_params(typ2);
537 n_param1 = get_method_first_variadic_param_index(typ1);
538 n_param2 = get_method_first_variadic_param_index(typ2);
541 if (n_param1 != n_param2) return 0;
543 for (i = 0; i < n_param1; i++) {
544 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
547 for (i = 0; i < get_method_n_ress(typ1); i++) {
548 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
553 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return 0;
554 m = alloca(sizeof(entity *) * get_union_n_members(typ1));
555 memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
556 /* First sort the members of lt */
557 for (i = 0; i < get_union_n_members(typ1); i++) {
558 entity *e1 = get_union_member(typ1, i);
559 for (j = 0; j < get_union_n_members(typ2); j++) {
560 entity *e2 = get_union_member(typ2, j);
561 if (get_entity_name(e1) == get_entity_name(e2))
565 for (i = 0; i < get_union_n_members(typ1); i++) {
566 if (!m[i] || /* Found no counterpart */
567 !equal_entity(get_union_member(typ1, i), m[i]))
572 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
574 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
576 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
577 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
578 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
580 if (get_array_order(typ1, i) != get_array_order(typ2, i))
581 assert(0 && "type compare with different dimension orders not implemented");
584 case tpo_enumeration: {
585 assert(0 && "enumerations not implemented");
588 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
591 case tpo_primitive: {
598 /* Checks whether two types are structural comparable. */
599 int smaller_type (type *st, type *lt) {
603 if (st == lt) return 1;
605 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
608 switch(get_type_tpop_code(st)) {
610 return is_subclass_of(st, lt);
613 if (get_struct_n_members(st) != get_struct_n_members(lt)) return 0;
614 m = alloca(sizeof(entity *) * get_struct_n_members(st));
615 memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
616 /* First sort the members of lt */
617 for (i = 0; i < get_struct_n_members(st); i++) {
618 entity *se = get_struct_member(st, i);
619 for (j = 0; j < get_struct_n_members(lt); j++) {
620 entity *le = get_struct_member(lt, j);
621 if (get_entity_name(le) == get_entity_name(se))
625 for (i = 0; i < get_struct_n_members(st); i++) {
626 if (!m[i] || /* Found no counterpart */
627 !smaller_type(get_entity_type(get_struct_member(st, i)),
628 get_entity_type(m[i])))
633 /** FIXME: is this still 1? */
634 if (get_method_variadicity(st) != get_method_variadicity(lt)) return 0;
635 if (get_method_n_params(st) != get_method_n_params(lt)) return 0;
636 if (get_method_n_ress(st) != get_method_n_ress(lt)) return 0;
637 for (i = 0; i < get_method_n_params(st); i++) {
638 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
641 for (i = 0; i < get_method_n_ress(st); i++) {
642 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
647 if (get_union_n_members(st) != get_union_n_members(lt)) return 0;
648 m = alloca(sizeof(entity *) * get_union_n_members(st));
649 memset(m, 0, sizeof(entity *) * get_union_n_members(st));
650 /* First sort the members of lt */
651 for (i = 0; i < get_union_n_members(st); i++) {
652 entity *se = get_union_member(st, i);
653 for (j = 0; j < get_union_n_members(lt); j++) {
654 entity *le = get_union_member(lt, j);
655 if (get_entity_name(le) == get_entity_name(se))
659 for (i = 0; i < get_union_n_members(st); i++) {
660 if (!m[i] || /* Found no counterpart */
661 !smaller_type(get_entity_type(get_union_member(st, i)),
662 get_entity_type(m[i])))
667 type *set, *let; /* small/large elt. type */
668 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
670 set = get_array_element_type(st);
671 let = get_array_element_type(lt);
673 /* If the elt types are different, set must be convertible
674 to let, and they must have the same size so that address
675 computations work out. To have a size the layout must
677 if ((get_type_state(set) != layout_fixed) ||
678 (get_type_state(let) != layout_fixed))
680 if (!smaller_type(set, let) ||
681 get_type_size_bits(set) != get_type_size_bits(let))
684 for(i = 0; i < get_array_n_dimensions(st); i++) {
685 if (get_array_lower_bound(lt, i))
686 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
688 if (get_array_upper_bound(lt, i))
689 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
693 case tpo_enumeration: {
694 assert(0 && "enumerations not implemented");
697 if (!smaller_type(get_pointer_points_to_type(st),
698 get_pointer_points_to_type(lt)))
701 case tpo_primitive: {
702 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
710 /*-----------------------------------------------------------------*/
712 /*-----------------------------------------------------------------*/
714 /* create a new class type */
715 type *new_type_class (ident *name) {
718 res = new_type(type_class, NULL, name);
720 res->attr.ca.members = NEW_ARR_F (entity *, 0);
721 res->attr.ca.subtypes = NEW_ARR_F (type *, 0);
722 res->attr.ca.supertypes = NEW_ARR_F (type *, 0);
723 res->attr.ca.peculiarity = peculiarity_existent;
724 res->attr.ca.dfn = 0;
728 type *new_d_type_class (ident *name, dbg_info* db) {
729 type *res = new_type_class (name);
730 set_type_dbg_info(res, db);
734 void free_class_entities(type *clss) {
736 assert(clss && (clss->type_op == type_class));
737 for (i = get_class_n_members(clss)-1; i >= 0; --i)
738 free_entity(get_class_member(clss, i));
741 void free_class_attrs(type *clss) {
742 assert(clss && (clss->type_op == type_class));
743 DEL_ARR_F(clss->attr.ca.members);
744 DEL_ARR_F(clss->attr.ca.subtypes);
745 DEL_ARR_F(clss->attr.ca.supertypes);
748 /* manipulate private fields of class type */
749 void add_class_member (type *clss, entity *member) {
750 assert(clss && (clss->type_op == type_class));
751 ARR_APP1 (entity *, clss->attr.ca.members, member);
754 int (get_class_n_members) (const type *clss) {
755 return _get_class_n_members(clss);
758 int get_class_member_index(type *clss, entity *mem) {
760 assert(clss && (clss->type_op == type_class));
761 for (i = 0; i < get_class_n_members(clss); i++)
762 if (get_class_member(clss, i) == mem)
767 entity *(get_class_member) (const type *clss, int pos) {
768 return _get_class_member(clss, pos);
771 entity *get_class_member_by_name(type *clss, ident *name) {
773 assert(clss && (clss->type_op == type_class));
774 n_mem = get_class_n_members(clss);
775 for (i = 0; i < n_mem; ++i) {
776 entity *mem = get_class_member(clss, i);
777 if (get_entity_ident(mem) == name) return mem;
782 void set_class_member (type *clss, entity *member, int pos) {
783 assert(clss && (clss->type_op == type_class));
784 assert(pos >= 0 && pos < get_class_n_members(clss));
785 clss->attr.ca.members[pos] = member;
787 void set_class_members (type *clss, entity **members, int arity) {
789 assert(clss && (clss->type_op == type_class));
790 DEL_ARR_F(clss->attr.ca.members);
791 clss->attr.ca.members = NEW_ARR_F (entity *, 0);
792 for (i = 0; i < arity; i++) {
793 set_entity_owner(members[i], clss);
794 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
797 void remove_class_member(type *clss, entity *member) {
799 assert(clss && (clss->type_op == type_class));
800 for (i = 0; i < (ARR_LEN (clss->attr.ca.members)); i++) {
801 if (clss->attr.ca.members[i] == member) {
802 for(; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
803 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
804 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
810 void add_class_subtype (type *clss, type *subtype) {
812 assert(clss && (clss->type_op == type_class));
813 ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
814 for (i = 0; i < get_class_n_supertypes(subtype); i++)
815 if (get_class_supertype(subtype, i) == clss)
816 /* Class already registered */
818 ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
820 int get_class_n_subtypes (const type *clss) {
821 assert(clss && (clss->type_op == type_class));
822 return (ARR_LEN (clss->attr.ca.subtypes));
824 type *get_class_subtype (type *clss, int pos) {
825 assert(clss && (clss->type_op == type_class));
826 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
827 return clss->attr.ca.subtypes[pos] = skip_tid(clss->attr.ca.subtypes[pos]);
829 void set_class_subtype (type *clss, type *subtype, int pos) {
830 assert(clss && (clss->type_op == type_class));
831 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
832 clss->attr.ca.subtypes[pos] = subtype;
834 void remove_class_subtype(type *clss, type *subtype) {
836 assert(clss && (clss->type_op == type_class));
837 for (i = 0; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
838 if (clss->attr.ca.subtypes[i] == subtype) {
839 for(; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
840 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
841 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
846 void add_class_supertype (type *clss, type *supertype) {
848 assert(clss && (clss->type_op == type_class));
849 assert(supertype && (supertype -> type_op == type_class));
850 ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
851 for (i = 0; i < get_class_n_subtypes(supertype); i++)
852 if (get_class_subtype(supertype, i) == clss)
853 /* Class already registered */
855 ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
857 int get_class_n_supertypes (const type *clss) {
858 assert(clss && (clss->type_op == type_class));
859 return (ARR_LEN (clss->attr.ca.supertypes));
861 int get_class_supertype_index(type *clss, type *super_clss) {
863 assert(clss && (clss->type_op == type_class));
864 assert(super_clss && (super_clss->type_op == type_class));
865 for (i = 0; i < get_class_n_supertypes(clss); i++)
866 if (get_class_supertype(clss, i) == super_clss)
870 type *get_class_supertype (type *clss, int pos) {
871 assert(clss && (clss->type_op == type_class));
872 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
873 return clss->attr.ca.supertypes[pos] = skip_tid(clss->attr.ca.supertypes[pos]);
875 void set_class_supertype (type *clss, type *supertype, int pos) {
876 assert(clss && (clss->type_op == type_class));
877 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
878 clss->attr.ca.supertypes[pos] = supertype;
880 void remove_class_supertype(type *clss, type *supertype) {
882 assert(clss && (clss->type_op == type_class));
883 for (i = 0; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
884 if (clss->attr.ca.supertypes[i] == supertype) {
885 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
886 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
887 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
892 const char *get_peculiarity_string(peculiarity p) {
894 case peculiarity_description:
895 return "peculiarity_description";
896 case peculiarity_inherited:
897 return "peculiarity_inherited";
899 return "peculiarity_existent";
903 peculiarity get_class_peculiarity (const type *clss) {
904 assert(clss && (clss->type_op == type_class));
905 return clss->attr.ca.peculiarity;
908 void set_class_peculiarity (type *clss, peculiarity pec) {
909 assert(clss && (clss->type_op == type_class));
910 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
911 clss->attr.ca.peculiarity = pec;
914 void set_class_dfn (type *clss, int dfn)
916 clss->attr.ca.dfn = dfn;
919 int get_class_dfn (const type *clss)
921 return (clss->attr.ca.dfn);
925 int (is_Class_type)(const type *clss) {
926 return _is_class_type(clss);
929 /* Returns true if low is subclass of high. */
930 int is_subclass_of(type *low, type *high) {
932 assert(is_Class_type(low) && is_Class_type(high));
933 if (low == high) return 1;
934 /* depth first search from high downwards. */
935 for (i = 0; i < get_class_n_subtypes(high); i++) {
936 if (low == get_class_subtype(high, i))
938 if (is_subclass_of(low, get_class_subtype(high, i)))
944 /*----------------------------------------------------------------**/
946 /*----------------------------------------------------------------**/
948 /* create a new type struct */
949 type *new_type_struct (ident *name) {
951 res = new_type(type_struct, NULL, name);
952 res->attr.sa.members = NEW_ARR_F (entity *, 0);
955 type *new_d_type_struct (ident *name, dbg_info* db) {
956 type *res = new_type_struct (name);
957 set_type_dbg_info(res, db);
960 void free_struct_entities (type *strct) {
962 assert(strct && (strct->type_op == type_struct));
963 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
964 free_entity(get_struct_member(strct, i));
966 void free_struct_attrs (type *strct) {
967 assert(strct && (strct->type_op == type_struct));
968 DEL_ARR_F(strct->attr.sa.members);
971 /* manipulate private fields of struct */
972 int get_struct_n_members (const type *strct) {
973 assert(strct && (strct->type_op == type_struct));
974 return (ARR_LEN (strct->attr.sa.members));
977 void add_struct_member (type *strct, entity *member) {
978 assert(strct && (strct->type_op == type_struct));
979 assert(get_type_tpop(get_entity_type(member)) != type_method);
980 /* @@@ lowerfirm geht nicht durch */
981 ARR_APP1 (entity *, strct->attr.sa.members, member);
984 entity *get_struct_member (const type *strct, int pos) {
985 assert(strct && (strct->type_op == type_struct));
986 assert(pos >= 0 && pos < get_struct_n_members(strct));
987 return strct->attr.sa.members[pos];
990 int get_struct_member_index(type *strct, entity *mem) {
992 assert(strct && (strct->type_op == type_struct));
993 for (i = 0; i < get_struct_n_members(strct); i++)
994 if (get_struct_member(strct, i) == mem)
999 void set_struct_member (type *strct, int pos, entity *member) {
1000 assert(strct && (strct->type_op == type_struct));
1001 assert(pos >= 0 && pos < get_struct_n_members(strct));
1002 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
1003 strct->attr.sa.members[pos] = member;
1005 void remove_struct_member(type *strct, entity *member) {
1007 assert(strct && (strct->type_op == type_struct));
1008 for (i = 0; i < (ARR_LEN (strct->attr.sa.members)); i++)
1009 if (strct->attr.sa.members[i] == member) {
1010 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
1011 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
1012 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
1018 int (is_Struct_type)(const type *strct) {
1019 return _is_struct_type(strct);
1022 /*******************************************************************/
1024 /*******************************************************************/
1027 * Lazy construction of value argument / result representation.
1028 * Constructs a struct type and its member. The types of the members
1029 * are passed in the argument list.
1031 * @param name name of the type constructed
1032 * @param len number of fields
1033 * @param tps array of field types with length len
1035 static INLINE type *
1036 build_value_type(ident *name, int len, type **tps) {
1038 type *res = new_type_struct(name);
1039 /* Remove type from type list. Must be treated differently than other types. */
1040 remove_irp_type_from_list(res);
1041 for (i = 0; i < len; i++) {
1042 type *elt_type = res; /* use res as default if corresponding type is not yet set. */
1043 if (tps[i]) elt_type = tps[i];
1044 new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
1049 /* Create a new method type.
1050 N_param is the number of parameters, n_res the number of results. */
1051 type *new_type_method (ident *name, int n_param, int n_res) {
1054 assert((get_mode_size_bytes(mode_P_mach) != -1) && "unorthodox modes not implemented");
1055 res = new_type(type_method, mode_P_mach, name);
1056 res->state = layout_fixed;
1057 res->size = get_mode_size_bits(mode_P_mach);
1058 res->attr.ma.n_params = n_param;
1059 res->attr.ma.param_type = xcalloc(n_param, sizeof(res->attr.ma.param_type[0]));
1060 res->attr.ma.value_params = NULL;
1061 res->attr.ma.n_res = n_res;
1062 res->attr.ma.res_type = xcalloc(n_res, sizeof(res->attr.ma.res_type[0]));
1063 res->attr.ma.value_ress = NULL;
1064 res->attr.ma.variadicity = variadicity_non_variadic;
1065 res->attr.ma.first_variadic_param = -1;
1070 type *new_d_type_method (ident *name, int n_param, int n_res, dbg_info* db) {
1071 type *res = new_type_method (name, n_param, n_res);
1072 set_type_dbg_info(res, db);
1076 void free_method_entities(type *method) {
1077 assert(method && (method->type_op == type_method));
1080 /* Attention: also frees entities in value parameter subtypes! */
1081 void free_method_attrs(type *method) {
1082 assert(method && (method->type_op == type_method));
1083 free(method->attr.ma.param_type);
1084 free(method->attr.ma.res_type);
1085 if (method->attr.ma.value_params) {
1086 free_type_entities(method->attr.ma.value_params);
1087 free_type(method->attr.ma.value_params);
1089 if (method->attr.ma.value_ress) {
1090 free_type_entities(method->attr.ma.value_ress);
1091 free_type(method->attr.ma.value_ress);
1095 /* manipulate private fields of method. */
1096 int get_method_n_params (const type *method) {
1097 assert(method && (method->type_op == type_method));
1098 return method->attr.ma.n_params;
1101 type *get_method_param_type(type *method, int pos) {
1103 assert(method && (method->type_op == type_method));
1104 assert(pos >= 0 && pos < get_method_n_params(method));
1105 res = method->attr.ma.param_type[pos];
1106 assert(res != NULL && "empty method param type");
1107 return method->attr.ma.param_type[pos] = skip_tid(res);
1110 void set_method_param_type(type *method, int pos, type* tp) {
1111 assert(method && (method->type_op == type_method));
1112 assert(pos >= 0 && pos < get_method_n_params(method));
1113 method->attr.ma.param_type[pos] = tp;
1114 /* If information constructed set pass-by-value representation. */
1115 if (method->attr.ma.value_params) {
1116 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1117 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1121 /* Returns an entity that represents the copied value argument. Only necessary
1122 for compounds passed by value. */
1123 entity *get_method_value_param_ent(type *method, int pos) {
1124 assert(method && (method->type_op == type_method));
1125 assert(pos >= 0 && pos < get_method_n_params(method));
1126 if (!method->attr.ma.value_params)
1127 method->attr.ma.value_params
1128 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
1129 get_method_n_params(method), method->attr.ma.param_type);
1130 assert((get_entity_type(get_struct_member(method->attr.ma.value_params, pos))
1131 != method->attr.ma.value_params)
1132 && "param type not yet set");
1133 return get_struct_member(method->attr.ma.value_params, pos);
1137 * Returns a type that represents the copied value arguments.
1139 type *get_method_value_param_type(const type *method)
1141 assert(method && (method->type_op == type_method));
1142 return method->attr.ma.value_params;
1145 int get_method_n_ress (const type *method) {
1146 assert(method && (method->type_op == type_method));
1147 return method->attr.ma.n_res;
1150 type *get_method_res_type(type *method, int pos) {
1152 assert(method && (method->type_op == type_method));
1153 assert(pos >= 0 && pos < get_method_n_ress(method));
1154 res = method->attr.ma.res_type[pos];
1155 assert(res != NULL && "empty method return type");
1156 return method->attr.ma.res_type[pos] = skip_tid(res);
1159 void set_method_res_type(type *method, int pos, type* tp) {
1160 assert(method && (method->type_op == type_method));
1161 assert(pos >= 0 && pos < get_method_n_ress(method));
1162 /* set the result type */
1163 method->attr.ma.res_type[pos] = tp;
1164 /* If information constructed set pass-by-value representation. */
1165 if (method->attr.ma.value_ress) {
1166 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1167 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1171 /* Returns an entity that represents the copied value result. Only necessary
1172 for compounds passed by value. */
1173 entity *get_method_value_res_ent(type *method, int pos) {
1174 assert(method && (method->type_op == type_method));
1175 assert(pos >= 0 && pos < get_method_n_ress(method));
1176 if (!method->attr.ma.value_ress)
1177 method->attr.ma.value_ress
1178 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1179 get_method_n_ress(method), method->attr.ma.res_type);
1180 assert((get_entity_type(get_struct_member(method->attr.ma.value_ress, pos)) != method->attr.ma.value_ress)
1181 && "result type not yet set");
1182 return get_struct_member(method->attr.ma.value_ress, pos);
1186 * Returns a type that represents the copied value results.
1188 type *get_method_value_res_type(const type *method) {
1189 assert(method && (method->type_op == type_method));
1190 return method->attr.ma.value_ress;
1193 /* Returns the null-terminated name of this variadicity. */
1194 const char *get_variadicity_name(variadicity vari)
1196 #define X(a) case a: return #a
1198 X(variadicity_non_variadic);
1199 X(variadicity_variadic);
1206 variadicity get_method_variadicity(const type *method)
1208 assert(method && (method->type_op == type_method));
1209 return method->attr.ma.variadicity;
1212 void set_method_variadicity(type *method, variadicity vari)
1214 assert(method && (method->type_op == type_method));
1215 method->attr.ma.variadicity = vari;
1219 * Returns the first variadic parameter index of a type.
1220 * If this index was NOT set, the index of the last parameter
1221 * of the method type plus one is returned for variadic functions.
1222 * Non-variadic function types always return -1 here.
1224 int get_method_first_variadic_param_index(const type *method)
1226 assert(method && (method->type_op == type_method));
1228 if (method->attr.ma.variadicity == variadicity_non_variadic)
1231 if (method->attr.ma.first_variadic_param == -1)
1232 return get_method_n_params(method);
1233 return method->attr.ma.first_variadic_param;
1237 * Sets the first variadic parameter index. This allows to specify
1238 * a complete call type (containing the type of all parameters)
1239 * but still have the knowledge, which parameter must be passed as
1242 void set_method_first_variadic_param_index(type *method, int index)
1244 assert(method && (method->type_op == type_method));
1245 assert(index >= 0 && index <= get_method_n_params(method));
1247 method->attr.ma.first_variadic_param = index;
1251 int (is_Method_type)(const type *method) {
1252 return _is_method_type(method);
1255 /*-----------------------------------------------------------------*/
1257 /*-----------------------------------------------------------------*/
1259 /* create a new type uni */
1260 type *new_type_union (ident *name) {
1262 res = new_type(type_union, NULL, name);
1263 /*res->attr.ua.unioned_type = xcalloc(n_types, sizeof(res->attr.ua.unioned_type[0]));
1264 res->attr.ua.delim_names = xcalloc(n_types, sizeof(res->attr.ua.delim_names[0])); */
1265 res->attr.ua.members = NEW_ARR_F (entity *, 0);
1268 type *new_d_type_union (ident *name, dbg_info* db) {
1269 type *res = new_type_union (name);
1270 set_type_dbg_info(res, db);
1273 void free_union_entities (type *uni) {
1275 assert(uni && (uni->type_op == type_union));
1276 for (i = get_union_n_members(uni)-1; i >= 0; --i)
1277 free_entity(get_union_member(uni, i));
1279 void free_union_attrs (type *uni) {
1280 assert(uni && (uni->type_op == type_union));
1281 DEL_ARR_F(uni->attr.ua.members);
1283 /* manipulate private fields of union */
1285 int get_union_n_types (type *uni) {
1286 assert(uni && (uni->type_op == type_union));
1287 return uni->attr.ua.n_types;
1289 type *get_union_unioned_type (type *uni, int pos) {
1290 assert(uni && (uni->type_op == type_union));
1291 assert(pos >= 0 && pos < get_union_n_types(uni));
1292 return uni->attr.ua.unioned_type[pos] = skip_tid(uni->attr.ua.unioned_type[pos]);
1294 void set_union_unioned_type (type *uni, int pos, type *tp) {
1295 assert(uni && (uni->type_op == type_union));
1296 assert(pos >= 0 && pos < get_union_n_types(uni));
1297 uni->attr.ua.unioned_type[pos] = tp;
1299 ident *get_union_delim_nameid (type *uni, int pos) {
1300 assert(uni && (uni->type_op == type_union));
1301 assert(pos >= 0 && pos < get_union_n_types(uni));
1302 return uni->attr.ua.delim_names[pos];
1304 const char *get_union_delim_name (type *uni, int pos) {
1305 assert(uni && (uni->type_op == type_union));
1306 assert(pos >= 0 && pos < get_union_n_types(uni));
1307 return get_id_str(uni->attr.ua.delim_names[pos]);
1309 void set_union_delim_nameid (type *uni, int pos, ident *id) {
1310 assert(uni && (uni->type_op == type_union));
1311 assert(pos >= 0 && pos < get_union_n_types(uni));
1312 uni->attr.ua.delim_names[pos] = id;
1315 int get_union_n_members (const type *uni) {
1316 assert(uni && (uni->type_op == type_union));
1317 return (ARR_LEN (uni->attr.ua.members));
1319 void add_union_member (type *uni, entity *member) {
1320 assert(uni && (uni->type_op == type_union));
1321 ARR_APP1 (entity *, uni->attr.ua.members, member);
1323 entity *get_union_member (const type *uni, int pos) {
1324 assert(uni && (uni->type_op == type_union));
1325 assert(pos >= 0 && pos < get_union_n_members(uni));
1326 return uni->attr.ua.members[pos];
1328 void set_union_member (type *uni, int pos, entity *member) {
1329 assert(uni && (uni->type_op == type_union));
1330 assert(pos >= 0 && pos < get_union_n_members(uni));
1331 uni->attr.ua.members[pos] = member;
1333 void remove_union_member(type *uni, entity *member) {
1335 assert(uni && (uni->type_op == type_union));
1336 for (i = 0; i < (ARR_LEN (uni->attr.ua.members)); i++)
1337 if (uni->attr.ua.members[i] == member) {
1338 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1339 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1340 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1346 int (is_Union_type)(const type *uni) {
1347 return _is_union_type(uni);
1350 /*-----------------------------------------------------------------*/
1352 /*-----------------------------------------------------------------*/
1355 /* create a new type array -- set dimension sizes independently */
1356 type *new_type_array (ident *name, int n_dimensions,
1357 type *element_type) {
1360 ir_graph *rem = current_ir_graph;
1361 assert(!is_Method_type(element_type));
1363 res = new_type(type_array, NULL, name);
1364 res->attr.aa.n_dimensions = n_dimensions;
1365 res->attr.aa.lower_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.lower_bound));
1366 res->attr.aa.upper_bound = xcalloc(n_dimensions, sizeof(*res->attr.aa.upper_bound));
1367 res->attr.aa.order = xcalloc(n_dimensions, sizeof(*res->attr.aa.order));
1369 current_ir_graph = get_const_code_irg();
1370 for (i = 0; i < n_dimensions; i++) {
1371 res->attr.aa.lower_bound[i] = new_Unknown(mode_Iu);
1372 res->attr.aa.upper_bound[i] = new_Unknown(mode_Iu);
1373 res->attr.aa.order[i] = i;
1375 current_ir_graph = rem;
1377 res->attr.aa.element_type = element_type;
1378 new_entity(res, mangle_u(name, new_id_from_chars("elem_ent", 8)), element_type);
1383 type *new_d_type_array (ident *name, int n_dimensions,
1384 type *element_type, dbg_info* db) {
1385 type *res = new_type_array (name, n_dimensions, element_type);
1386 set_type_dbg_info(res, db);
1390 void free_array_entities (type *array) {
1391 assert(array && (array->type_op == type_array));
1394 void free_array_attrs (type *array) {
1395 assert(array && (array->type_op == type_array));
1396 free(array->attr.aa.lower_bound);
1397 free(array->attr.aa.upper_bound);
1400 /* manipulate private fields of array type */
1401 int get_array_n_dimensions (const type *array) {
1402 assert(array && (array->type_op == type_array));
1403 return array->attr.aa.n_dimensions;
1407 set_array_bounds (type *array, int dimension, ir_node * lower_bound,
1408 ir_node * upper_bound) {
1409 assert(array && (array->type_op == type_array));
1410 assert(lower_bound && "lower_bound node may not be NULL.");
1411 assert(upper_bound && "upper_bound node may not be NULL.");
1412 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1413 array->attr.aa.lower_bound[dimension] = lower_bound;
1414 array->attr.aa.upper_bound[dimension] = upper_bound;
1417 set_array_bounds_int (type *array, int dimension, int lower_bound,
1419 ir_graph *rem = current_ir_graph;
1420 current_ir_graph = get_const_code_irg();
1421 set_array_bounds (array, dimension,
1422 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1423 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1424 current_ir_graph = rem;
1427 set_array_lower_bound (type *array, int dimension, ir_node * lower_bound) {
1428 assert(array && (array->type_op == type_array));
1429 assert(lower_bound && "lower_bound node may not be NULL.");
1430 array->attr.aa.lower_bound[dimension] = lower_bound;
1432 void set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
1433 ir_graph *rem = current_ir_graph;
1434 current_ir_graph = get_const_code_irg();
1435 set_array_lower_bound (array, dimension,
1436 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1437 current_ir_graph = rem;
1440 set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
1441 assert(array && (array->type_op == type_array));
1442 assert(upper_bound && "upper_bound node may not be NULL.");
1443 array->attr.aa.upper_bound[dimension] = upper_bound;
1445 void set_array_upper_bound_int (type *array, int dimension, int upper_bound) {
1446 ir_graph *rem = current_ir_graph;
1447 current_ir_graph = get_const_code_irg();
1448 set_array_upper_bound (array, dimension,
1449 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1450 current_ir_graph = rem;
1452 int has_array_lower_bound (const type *array, int dimension) {
1453 assert(array && (array->type_op == type_array));
1454 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1456 ir_node *get_array_lower_bound (const type *array, int dimension) {
1457 assert(array && (array->type_op == type_array));
1458 return array->attr.aa.lower_bound[dimension];
1460 long get_array_lower_bound_int (const type *array, int dimension) {
1462 assert(array && (array->type_op == type_array));
1463 node = array->attr.aa.lower_bound[dimension];
1464 assert(get_irn_op(node) == op_Const);
1465 return get_tarval_long(get_Const_tarval(node));
1467 int has_array_upper_bound (const type *array, int dimension) {
1468 assert(array && (array->type_op == type_array));
1469 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1471 ir_node * get_array_upper_bound (const type *array, int dimension) {
1472 assert(array && (array->type_op == type_array));
1473 return array->attr.aa.upper_bound[dimension];
1475 long get_array_upper_bound_int (const type *array, int dimension) {
1477 assert(array && (array->type_op == type_array));
1478 node = array->attr.aa.upper_bound[dimension];
1479 assert(get_irn_op(node) == op_Const);
1480 return get_tarval_long(get_Const_tarval(node));
1483 void set_array_order (type *array, int dimension, int order) {
1484 assert(array && (array->type_op == type_array));
1485 array->attr.aa.order[dimension] = order;
1487 int get_array_order (const type *array, int dimension) {
1488 assert(array && (array->type_op == type_array));
1489 return array->attr.aa.order[dimension];
1492 void set_array_element_type (type *array, type *tp) {
1493 assert(array && (array->type_op == type_array));
1494 assert(!is_Method_type(tp));
1495 array->attr.aa.element_type = tp;
1497 type *get_array_element_type (type *array) {
1498 assert(array && (array->type_op == type_array));
1499 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1502 void set_array_element_entity (type *array, entity *ent) {
1503 assert(array && (array->type_op == type_array));
1504 assert((get_entity_type(ent)->type_op != type_method));
1505 array->attr.aa.element_ent = ent;
1506 array->attr.aa.element_type = get_entity_type(ent);
1508 entity *get_array_element_entity (const type *array) {
1509 assert(array && (array->type_op == type_array));
1510 return array->attr.aa.element_ent;
1514 int (is_Array_type)(const type *array) {
1515 return _is_array_type(array);
1518 /*-----------------------------------------------------------------*/
1519 /* TYPE_ENUMERATION */
1520 /*-----------------------------------------------------------------*/
1522 /* create a new type enumeration -- set the enumerators independently */
1523 type *new_type_enumeration (ident *name, int n_enums) {
1525 res = new_type(type_enumeration, NULL, name);
1526 res->attr.ea.n_enums = n_enums;
1527 res->attr.ea.enumer = xcalloc(n_enums, sizeof(res->attr.ea.enumer[0]));
1528 res->attr.ea.enum_nameid = xcalloc(n_enums, sizeof(res->attr.ea.enum_nameid[0]));
1531 type *new_d_type_enumeration (ident *name, int n_enums, dbg_info* db) {
1532 type *res = new_type_enumeration (name, n_enums);
1533 set_type_dbg_info(res, db);
1537 void free_enumeration_entities(type *enumeration) {
1538 assert(enumeration && (enumeration->type_op == type_enumeration));
1540 void free_enumeration_attrs(type *enumeration) {
1541 assert(enumeration && (enumeration->type_op == type_enumeration));
1542 free(enumeration->attr.ea.enumer);
1543 free(enumeration->attr.ea.enum_nameid);
1546 /* manipulate fields of enumeration type. */
1547 int get_enumeration_n_enums (const type *enumeration) {
1548 assert(enumeration && (enumeration->type_op == type_enumeration));
1549 return enumeration->attr.ea.n_enums;
1551 void set_enumeration_enum (type *enumeration, int pos, tarval *con) {
1552 assert(enumeration && (enumeration->type_op == type_enumeration));
1553 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1554 enumeration->attr.ea.enumer[pos] = con;
1556 tarval *get_enumeration_enum (const type *enumeration, int pos) {
1557 assert(enumeration && (enumeration->type_op == type_enumeration));
1558 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1559 return enumeration->attr.ea.enumer[pos];
1561 void set_enumeration_nameid (type *enumeration, int pos, ident *id) {
1562 assert(enumeration && (enumeration->type_op == type_enumeration));
1563 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1564 enumeration->attr.ea.enum_nameid[pos] = id;
1566 ident *get_enumeration_nameid (const type *enumeration, int pos) {
1567 assert(enumeration && (enumeration->type_op == type_enumeration));
1568 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1569 return enumeration->attr.ea.enum_nameid[pos];
1571 const char *get_enumeration_name(const type *enumeration, int pos) {
1572 assert(enumeration && (enumeration->type_op == type_enumeration));
1573 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1574 return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
1578 int (is_Enumeration_type)(const type *enumeration) {
1579 return _is_enumeration_type(enumeration);
1582 /*-----------------------------------------------------------------*/
1584 /*-----------------------------------------------------------------*/
1586 /* Create a new type pointer */
1587 type *new_type_pointer_mode (ident *name, type *points_to, ir_mode *ptr_mode) {
1589 assert(mode_is_reference(ptr_mode));
1590 res = new_type(type_pointer, ptr_mode, name);
1591 res->attr.pa.points_to = points_to;
1592 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1593 res->size = get_mode_size_bits(res->mode);
1594 res->state = layout_fixed;
1597 type *new_d_type_pointer (ident *name, type *points_to, ir_mode *ptr_mode, dbg_info* db) {
1598 type *res = new_type_pointer_mode (name, points_to, ptr_mode);
1599 set_type_dbg_info(res, db);
1602 void free_pointer_entities (type *pointer) {
1603 assert(pointer && (pointer->type_op == type_pointer));
1605 void free_pointer_attrs (type *pointer) {
1606 assert(pointer && (pointer->type_op == type_pointer));
1608 /* manipulate fields of type_pointer */
1609 void set_pointer_points_to_type (type *pointer, type *tp) {
1610 assert(pointer && (pointer->type_op == type_pointer));
1611 pointer->attr.pa.points_to = tp;
1613 type *get_pointer_points_to_type (type *pointer) {
1614 assert(pointer && (pointer->type_op == type_pointer));
1615 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1619 int (is_Pointer_type)(const type *pointer) {
1620 return _is_pointer_type(pointer);
1623 /* Returns the first pointer type that has as points_to tp.
1624 * Not efficient: O(#types).
1625 * If not found returns firm_unknown_type. */
1626 type *find_pointer_type_to_type (type *tp) {
1628 for (i = 0; i < get_irp_n_types(); ++i) {
1629 type *found = get_irp_type(i);
1630 if (is_Pointer_type(found) && get_pointer_points_to_type(found) == tp)
1633 return firm_unknown_type;
1638 /*-----------------------------------------------------------------*/
1639 /* TYPE_PRIMITIVE */
1640 /*-----------------------------------------------------------------*/
1642 /* create a new type primitive */
1643 type *new_type_primitive (ident *name, ir_mode *mode) {
1645 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1646 res = new_type(type_primitive, mode, name);
1647 res->size = get_mode_size_bits(mode);
1648 res->state = layout_fixed;
1651 type *new_d_type_primitive (ident *name, ir_mode *mode, dbg_info* db) {
1652 type *res = new_type_primitive (name, mode);
1653 set_type_dbg_info(res, db);
1656 void free_primitive_entities (type *primitive) {
1657 assert(primitive && (primitive->type_op == type_primitive));
1659 void free_primitive_attrs (type *primitive) {
1660 assert(primitive && (primitive->type_op == type_primitive));
1664 int (is_Primitive_type)(const type *primitive) {
1665 return _is_primitive_type(primitive);
1668 /*-----------------------------------------------------------------*/
1669 /* common functionality */
1670 /*-----------------------------------------------------------------*/
1673 int (is_atomic_type)(const type *tp) {
1674 return _is_atomic_type(tp);
1678 * Gets the number of elements in a firm compound type.
1680 int get_compound_n_members(const type *tp)
1684 if (is_Struct_type(tp))
1685 res = get_struct_n_members(tp);
1686 else if (is_Class_type(tp))
1687 res = get_class_n_members(tp);
1688 else if (is_Union_type(tp))
1689 res = get_union_n_members(tp);
1691 assert(0 && "need struct, union or class for member count");
1697 * Gets the member of a firm compound type at position pos.
1699 entity *get_compound_member(const type *tp, int pos)
1703 if (is_Struct_type(tp))
1704 res = get_struct_member(tp, pos);
1705 else if (is_Class_type(tp))
1706 res = get_class_member(tp, pos);
1707 else if (is_Union_type(tp))
1708 res = get_union_member(tp, pos);
1711 assert(0 && "need struct, union or class to get a member");
1719 int is_compound_type(const type *tp) {
1720 assert(tp && tp->kind == k_type);
1721 return tp->type_op->flags & TP_OP_FLAG_COMPOUND;