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
48 # include "irprog_t.h"
49 # include "typegmod.h"
56 /*******************************************************************/
58 /*******************************************************************/
60 type *none_type; type *get_none_type(void) { return none_type; }
61 type *unknown_type; type *get_unknown_type(void) { return unknown_type; }
65 /** Returns a new, unique number to number nodes or the like. */
66 int get_irp_new_node_nr(void);
69 /* Suffixes added to types used for pass-by-value representations. */
70 static ident *value_params_suffix = NULL;
71 static ident *value_ress_suffix = NULL;
73 void init_type(void) {
74 value_params_suffix = new_id_from_str(VALUE_PARAMS_SUFFIX);
75 value_ress_suffix = new_id_from_str(VALUE_RESS_SUFFIX);
77 /* construct none and unknown type. */
78 none_type = new_type(tpop_none, mode_BAD, new_id_from_str("type_none"));
79 set_type_size_bits(none_type, 0);
80 set_type_state (none_type, layout_fixed);
81 remove_irp_type(none_type);
82 unknown_type = new_type(tpop_unknown, mode_ANY, new_id_from_str("type_unknown"));
83 set_type_size_bits(unknown_type, 0);
84 set_type_state (unknown_type, layout_fixed);
85 remove_irp_type(unknown_type);
88 unsigned long type_visited;
90 void (set_master_type_visited)(unsigned long val) { __set_master_type_visited(val); }
91 unsigned long (get_master_type_visited)(void) { return __get_master_type_visited(); }
92 void (inc_master_type_visited)(void) { __inc_master_type_visited(); }
96 new_type(tp_op *type_op, ir_mode *mode, ident* name) {
100 assert(type_op != type_id);
101 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
103 node_size = offsetof(type, attr) + type_op->attr_size;
104 res = (type *) xmalloc (node_size);
105 add_irp_type(res); /* Remember the new type global. */
108 res->type_op = type_op;
111 res->state = layout_undefined;
116 res->nr = get_irp_new_node_nr();
122 void free_type(type *tp) {
123 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
125 /* Remove from list of all types */
127 /* Free the attributes of the type. */
129 /* Free entities automatically allocated with the type */
130 if (is_array_type(tp))
131 free_entity(get_array_element_entity(tp));
132 /* And now the type itself... */
137 void free_type_entities(type *tp) {
138 switch(get_type_tpop_code(tp)) {
139 case tpo_class: { free_class_entities(tp); } break;
140 case tpo_struct: { free_struct_entities(tp); } break;
141 case tpo_method: { free_method_entities(tp); } break;
142 case tpo_union: { free_union_entities(tp); } break;
143 case tpo_array: { free_array_entities(tp); } break;
144 case tpo_enumeration: { free_enumeration_entities(tp); } break;
145 case tpo_pointer: { free_pointer_entities(tp); } break;
146 case tpo_primitive: { free_primitive_entities(tp); } break;
151 void free_type_attrs(type *tp) {
152 switch(get_type_tpop_code(tp)) {
153 case tpo_class: { free_class_attrs(tp); } break;
154 case tpo_struct: { free_struct_attrs(tp); } break;
155 case tpo_method: { free_method_attrs(tp); } break;
156 case tpo_union: { free_union_attrs(tp); } break;
157 case tpo_array: { free_array_attrs(tp); } break;
158 case tpo_enumeration: { free_enumeration_attrs(tp); } break;
159 case tpo_pointer: { free_pointer_attrs(tp); } break;
160 case tpo_primitive: { free_primitive_attrs(tp); } break;
165 /* set/get the link field */
166 void *(get_type_link)(type *tp)
168 return __get_type_link(tp);
171 void (set_type_link)(type *tp, void *l)
173 __set_type_link(tp, l);
176 tp_op *(get_type_tpop)(type *tp) {
177 return __get_type_tpop(tp);
180 ident *(get_type_tpop_nameid)(type *tp) {
181 return __get_type_tpop_nameid(tp);
184 const char* get_type_tpop_name(type *tp) {
185 assert(tp && tp->kind == k_type);
186 return get_id_str(tp->type_op->name);
189 tp_opcode (get_type_tpop_code)(type *tp) {
190 return __get_type_tpop_code(tp);
193 ir_mode *(get_type_mode)(type *tp) {
194 return __get_type_mode(tp);
197 void set_type_mode(type *tp, ir_mode* m) {
198 assert(tp && tp->kind == k_type);
200 assert(((tp->type_op != type_primitive) || mode_is_data(m)) &&
201 /* Modes of primitives must be data */
202 ((tp->type_op != type_enumeration) || mode_is_int(m)) &&
203 /* Modes of enumerations must be integers */
204 ((tp->type_op != type_pointer) || mode_is_reference(m)) );
205 /* Modes of pointers must be references. */
207 if (tp->type_op == type_primitive) {
208 /* For primitive size depends on the mode. */
209 tp->size = get_mode_size_bits(m);
212 if ((tp->type_op == type_enumeration) || (tp->type_op == type_pointer)) {
213 /* For pointer and enumeration size depends on the mode, but only byte size allowed. */
214 assert((get_mode_size_bits(m) & 7) == 0 && "unorthodox modes not implemented");
215 tp->size = get_mode_size_bits(m);
220 ident *(get_type_ident)(type *tp) {
221 return __get_type_ident(tp);
224 void (set_type_ident)(type *tp, ident* id) {
225 __set_type_ident(tp, id);
228 /* Outputs a unique number for this node */
229 long (get_type_nr)(type *tp) {
230 return __get_type_nr(tp);
233 const char* get_type_name(type *tp) {
234 assert(tp && tp->kind == k_type);
235 return (get_id_str(tp->name));
238 int (get_type_size_bytes)(type *tp) {
239 return __get_type_size_bytes(tp);
242 int (get_type_size_bits)(type *tp) {
243 return __get_type_size_bits(tp);
247 set_type_size_bits(type *tp, int size) {
248 assert(tp && tp->kind == k_type);
249 /* For pointer enumeration and primitive size depends on the mode.
250 Methods don't have a size. */
251 if ((tp->type_op != type_pointer) && (tp->type_op != type_primitive) &&
252 (tp->type_op != type_enumeration) && (tp->type_op != type_method)) {
253 if (tp->type_op == type_primitive)
256 /* argh: we must allow to set negative values as "invalid size" */
257 tp->size = (size >= 0) ? (size + 7) & ~7 : size;
258 assert(tp->size == size && "setting a bit size is NOT allowed for this type");
264 set_type_size_bytes(type *tp, int size) {
265 set_type_size_bits(tp, 8*size);
268 type_state (get_type_state)(type *tp) {
269 return __get_type_state(tp);
273 set_type_state(type *tp, type_state state) {
274 assert(tp && tp->kind == k_type);
276 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
277 (tp->type_op == type_method))
280 /* Just a correctness check: */
281 if (state == layout_fixed) {
283 switch (get_type_tpop_code(tp)) {
286 assert(get_type_size_bits(tp) > -1);
287 if (tp != get_glob_type())
288 for (i = 0; i < get_class_n_members(tp); i++) {
289 if (get_entity_offset_bits(get_class_member(tp, i)) <= -1)
290 { DDMT(tp); DDME(get_class_member(tp, i)); }
291 assert(get_entity_offset_bits(get_class_member(tp, i)) > -1);
293 assert(is_method_type(get_entity_type(get_class_member(tp, i))) ||
294 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
300 assert(get_type_size_bits(tp) > -1);
301 for (i = 0; i < get_struct_n_members(tp); i++) {
302 assert(get_entity_offset_bits(get_struct_member(tp, i)) > -1);
303 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
312 Assure that only innermost dimension is dynamic? */
314 case tpo_enumeration:
316 assert(get_type_mode != NULL);
317 for (i = 0; i < get_enumeration_n_enums(tp); i++)
318 assert(get_enumeration_enum(tp, i) != NULL);
326 unsigned long (get_type_visited)(type *tp) {
327 return __get_type_visited(tp);
330 void (set_type_visited)(type *tp, unsigned long num) {
331 __set_type_visited(tp, num);
334 /* Sets visited field in type to type_visited. */
335 void (mark_type_visited)(type *tp) {
336 __mark_type_visited(tp);
339 /* @@@ name clash with master flag
340 int (type_visited)(type *tp) {
341 return __type_visited(tp);
344 int (type_not_visited)(type *tp) {
345 return __type_not_visited(tp);
348 int (is_type)(void *thing) {
349 return __is_type(thing);
352 bool equal_type(type *typ1, type *typ2) {
357 if (typ1 == typ2) return true;
359 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
360 (get_type_ident(typ1) != get_type_ident(typ2)) ||
361 (get_type_mode(typ1) != get_type_mode(typ2)) ||
362 (get_type_state(typ1) != get_type_state(typ2)))
364 if ((get_type_state(typ1) == layout_fixed) &&
365 (get_type_size_bits(typ1) != get_type_size_bits(typ2)))
368 switch(get_type_tpop_code(typ1)) {
370 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return false;
371 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return false;
372 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return false;
373 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return false;
374 /** Compare the members **/
375 m = alloca(sizeof(entity *) * get_class_n_members(typ1));
376 memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
377 /* First sort the members of typ2 */
378 for (i = 0; i < get_class_n_members(typ1); i++) {
379 entity *e1 = get_class_member(typ1, i);
380 for (j = 0; j < get_class_n_members(typ2); j++) {
381 entity *e2 = get_class_member(typ2, j);
382 if (get_entity_name(e1) == get_entity_name(e2))
386 for (i = 0; i < get_class_n_members(typ1); i++) {
387 if (!m[i] || /* Found no counterpart */
388 !equal_entity(get_class_member(typ1, i), m[i]))
391 /** Compare the supertypes **/
392 t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
393 memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
394 /* First sort the supertypes of typ2 */
395 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
396 type *t1 = get_class_supertype(typ1, i);
397 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
398 type *t2 = get_class_supertype(typ2, j);
399 if (get_type_ident(t2) == get_type_ident(t1))
403 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
404 if (!t[i] || /* Found no counterpart */
405 get_class_supertype(typ1, i) != t[i])
410 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return false;
411 m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
412 memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
413 /* First sort the members of lt */
414 for (i = 0; i < get_struct_n_members(typ1); i++) {
415 entity *e1 = get_struct_member(typ1, i);
416 for (j = 0; j < get_struct_n_members(typ2); j++) {
417 entity *e2 = get_struct_member(typ2, j);
418 if (get_entity_name(e1) == get_entity_name(e2))
422 for (i = 0; i < get_struct_n_members(typ1); i++) {
423 if (!m[i] || /* Found no counterpart */
424 !equal_entity(get_struct_member(typ1, i), m[i]))
429 int n_param1, n_param2;
431 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return false;
432 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return false;
434 if (get_method_variadicity(typ1) == variadicity_non_variadic) {
435 n_param1 = get_method_n_params(typ1);
436 n_param2 = get_method_n_params(typ2);
439 n_param1 = get_method_first_variadic_param_index(typ1);
440 n_param2 = get_method_first_variadic_param_index(typ2);
443 if (n_param1 != n_param2) return false;
445 for (i = 0; i < n_param1; i++) {
446 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
449 for (i = 0; i < get_method_n_ress(typ1); i++) {
450 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
455 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return false;
456 m = alloca(sizeof(entity *) * get_union_n_members(typ1));
457 memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
458 /* First sort the members of lt */
459 for (i = 0; i < get_union_n_members(typ1); i++) {
460 entity *e1 = get_union_member(typ1, i);
461 for (j = 0; j < get_union_n_members(typ2); j++) {
462 entity *e2 = get_union_member(typ2, j);
463 if (get_entity_name(e1) == get_entity_name(e2))
467 for (i = 0; i < get_union_n_members(typ1); i++) {
468 if (!m[i] || /* Found no counterpart */
469 !equal_entity(get_union_member(typ1, i), m[i]))
474 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
476 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
478 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
479 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
480 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
482 if (get_array_order(typ1, i) != get_array_order(typ2, i))
483 assert(0 && "type compare with different dimension orders not implemented");
486 case tpo_enumeration: {
487 assert(0 && "enumerations not implemented");
490 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
493 case tpo_primitive: {
500 bool smaller_type (type *st, type *lt) {
504 if (st == lt) return true;
506 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
509 switch(get_type_tpop_code(st)) {
511 return is_subclass_of(st, lt);
514 if (get_struct_n_members(st) != get_struct_n_members(lt)) return false;
515 m = alloca(sizeof(entity *) * get_struct_n_members(st));
516 memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
517 /* First sort the members of lt */
518 for (i = 0; i < get_struct_n_members(st); i++) {
519 entity *se = get_struct_member(st, i);
520 for (j = 0; j < get_struct_n_members(lt); j++) {
521 entity *le = get_struct_member(lt, j);
522 if (get_entity_name(le) == get_entity_name(se))
526 for (i = 0; i < get_struct_n_members(st); i++) {
527 if (!m[i] || /* Found no counterpart */
528 !smaller_type(get_entity_type(get_struct_member(st, i)),
529 get_entity_type(m[i])))
534 /** FIXME: is this still true? */
535 if (get_method_variadicity(st) != get_method_variadicity(lt)) return false;
536 if (get_method_n_params(st) != get_method_n_params(lt)) return false;
537 if (get_method_n_ress(st) != get_method_n_ress(lt)) return false;
538 for (i = 0; i < get_method_n_params(st); i++) {
539 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
542 for (i = 0; i < get_method_n_ress(st); i++) {
543 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
548 if (get_union_n_members(st) != get_union_n_members(lt)) return false;
549 m = alloca(sizeof(entity *) * get_union_n_members(st));
550 memset(m, 0, sizeof(entity *) * get_union_n_members(st));
551 /* First sort the members of lt */
552 for (i = 0; i < get_union_n_members(st); i++) {
553 entity *se = get_union_member(st, i);
554 for (j = 0; j < get_union_n_members(lt); j++) {
555 entity *le = get_union_member(lt, j);
556 if (get_entity_name(le) == get_entity_name(se))
560 for (i = 0; i < get_union_n_members(st); i++) {
561 if (!m[i] || /* Found no counterpart */
562 !smaller_type(get_entity_type(get_union_member(st, i)),
563 get_entity_type(m[i])))
568 type *set, *let; /* small/large elt. type */
569 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
571 set = get_array_element_type(st);
572 let = get_array_element_type(lt);
574 /* If the elt types are different, set must be convertible
575 to let, and they must have the same size so that address
576 computations work out. To have a size the layout must
578 if ((get_type_state(set) != layout_fixed) ||
579 (get_type_state(let) != layout_fixed))
581 if (!smaller_type(set, let) ||
582 get_type_size_bits(set) != get_type_size_bits(let))
585 for(i = 0; i < get_array_n_dimensions(st); i++) {
586 if (get_array_lower_bound(lt, i))
587 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
589 if (get_array_upper_bound(lt, i))
590 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
594 case tpo_enumeration: {
595 assert(0 && "enumerations not implemented");
598 if (!smaller_type(get_pointer_points_to_type(st),
599 get_pointer_points_to_type(lt)))
602 case tpo_primitive: {
603 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
611 /*-----------------------------------------------------------------*/
613 /*-----------------------------------------------------------------*/
615 /* create a new class type */
616 type *new_type_class (ident *name) {
619 res = new_type(type_class, NULL, name);
621 res->attr.ca.members = NEW_ARR_F (entity *, 1);
622 res->attr.ca.subtypes = NEW_ARR_F (type *, 1);
623 res->attr.ca.supertypes = NEW_ARR_F (type *, 1);
624 res->attr.ca.peculiarity = peculiarity_existent;
625 res->attr.ca.dfn = 0;
629 type *new_d_type_class (ident *name, dbg_info* db) {
630 type *res = new_type_class (name);
631 set_type_dbg_info(res, db);
635 void free_class_entities(type *clss) {
637 assert(clss && (clss->type_op == type_class));
638 for (i = get_class_n_members(clss)-1; i >= 0; --i)
639 free_entity(get_class_member(clss, i));
642 void free_class_attrs(type *clss) {
643 assert(clss && (clss->type_op == type_class));
644 DEL_ARR_F(clss->attr.ca.members);
645 DEL_ARR_F(clss->attr.ca.subtypes);
646 DEL_ARR_F(clss->attr.ca.supertypes);
649 /* manipulate private fields of class type */
650 void add_class_member (type *clss, entity *member) {
651 assert(clss && (clss->type_op == type_class));
652 ARR_APP1 (entity *, clss->attr.ca.members, member);
655 int get_class_n_members (type *clss) {
656 assert(clss && (clss->type_op == type_class));
657 return (ARR_LEN (clss->attr.ca.members))-1;
660 int get_class_member_index(type *clss, entity *mem) {
662 assert(clss && (clss->type_op == type_class));
663 for (i = 0; i < get_class_n_members(clss); i++)
664 if (get_class_member(clss, i) == mem)
669 entity *get_class_member (type *clss, int pos) {
670 assert(clss && (clss->type_op == type_class));
671 assert(pos >= 0 && pos < get_class_n_members(clss));
672 return clss->attr.ca.members[pos+1];
675 entity *get_class_member_by_name(type *clss, ident *name) {
677 assert(clss && (clss->type_op == type_class));
678 n_mem = get_class_n_members(clss);
679 for (i = 0; i < n_mem; ++i) {
680 entity *mem = get_class_member(clss, i);
681 if (get_entity_ident(mem) == name) return mem;
686 void set_class_member (type *clss, entity *member, int pos) {
687 assert(clss && (clss->type_op == type_class));
688 assert(pos >= 0 && pos < get_class_n_members(clss));
689 clss->attr.ca.members[pos+1] = member;
691 void set_class_members (type *clss, entity **members, int arity) {
693 assert(clss && (clss->type_op == type_class));
694 DEL_ARR_F(clss->attr.ca.members);
695 clss->attr.ca.members = NEW_ARR_F (entity *, 1);
696 for (i = 0; i < arity; i++) {
697 set_entity_owner(members[i], clss);
698 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
701 void remove_class_member(type *clss, entity *member) {
703 assert(clss && (clss->type_op == type_class));
704 for (i = 1; i < (ARR_LEN (clss->attr.ca.members)); i++) {
705 if (clss->attr.ca.members[i] == member) {
706 for(; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
707 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
708 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
714 void add_class_subtype (type *clss, type *subtype) {
716 assert(clss && (clss->type_op == type_class));
717 ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
718 for (i = 0; i < get_class_n_supertypes(subtype); i++)
719 if (get_class_supertype(subtype, i) == clss)
720 /* Class already registered */
722 ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
724 int get_class_n_subtypes (type *clss) {
725 assert(clss && (clss->type_op == type_class));
726 return (ARR_LEN (clss->attr.ca.subtypes))-1;
728 type *get_class_subtype (type *clss, int pos) {
729 assert(clss && (clss->type_op == type_class));
730 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
731 return clss->attr.ca.subtypes[pos+1] = skip_tid(clss->attr.ca.subtypes[pos+1]);
733 void set_class_subtype (type *clss, type *subtype, int pos) {
734 assert(clss && (clss->type_op == type_class));
735 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
736 clss->attr.ca.subtypes[pos+1] = subtype;
738 void remove_class_subtype(type *clss, type *subtype) {
740 assert(clss && (clss->type_op == type_class));
741 for (i = 1; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
742 if (clss->attr.ca.subtypes[i] == subtype) {
743 for(; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
744 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
745 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
750 void add_class_supertype (type *clss, type *supertype) {
752 assert(clss && (clss->type_op == type_class));
753 assert(supertype && (supertype -> type_op == type_class));
754 ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
755 for (i = 0; i < get_class_n_subtypes(supertype); i++)
756 if (get_class_subtype(supertype, i) == clss)
757 /* Class already registered */
759 ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
761 int get_class_n_supertypes (type *clss) {
762 assert(clss && (clss->type_op == type_class));
763 return (ARR_LEN (clss->attr.ca.supertypes))-1;
765 int get_class_supertype_index(type *clss, type *super_clss) {
767 assert(clss && (clss->type_op == type_class));
768 assert(super_clss && (super_clss->type_op == type_class));
769 for (i = 0; i < get_class_n_supertypes(clss); i++)
770 if (get_class_supertype(clss, i) == super_clss)
774 type *get_class_supertype (type *clss, int pos) {
775 assert(clss && (clss->type_op == type_class));
776 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
777 return clss->attr.ca.supertypes[pos+1] = skip_tid(clss->attr.ca.supertypes[pos+1]);
779 void set_class_supertype (type *clss, type *supertype, int pos) {
780 assert(clss && (clss->type_op == type_class));
781 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
782 clss->attr.ca.supertypes[pos+1] = supertype;
784 void remove_class_supertype(type *clss, type *supertype) {
786 assert(clss && (clss->type_op == type_class));
787 for (i = 1; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
788 if (clss->attr.ca.supertypes[i] == supertype) {
789 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
790 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
791 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
796 char *get_peculiarity_string(peculiarity p) {
797 if (p == peculiarity_description)
798 return "peculiarity_description";
799 if (p == peculiarity_inherited)
800 return "peculiarity_inherited";
801 return "peculiarity_existent";
804 peculiarity get_class_peculiarity (type *clss) {
805 assert(clss && (clss->type_op == type_class));
806 return clss->attr.ca.peculiarity;
808 void set_class_peculiarity (type *clss, peculiarity pec) {
809 assert(clss && (clss->type_op == type_class));
810 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
811 clss->attr.ca.peculiarity = pec;
814 void set_class_dfn (type *clss, int dfn)
816 clss->attr.ca.dfn = dfn;
819 int get_class_dfn (type *clss)
821 return (clss->attr.ca.dfn);
825 int (is_class_type)(type *clss) {
826 return __is_class_type(clss);
829 bool is_subclass_of(type *low, type *high) {
831 assert(is_class_type(low) && is_class_type(high));
832 if (low == high) return true;
833 /* depth first search from high downwards. */
834 for (i = 0; i < get_class_n_subtypes(high); i++) {
835 if (low == get_class_subtype(high, i))
837 if (is_subclass_of(low, get_class_subtype(high, i)))
843 /*----------------------------------------------------------------**/
845 /*----------------------------------------------------------------**/
847 /* create a new type struct */
848 type *new_type_struct (ident *name) {
850 res = new_type(type_struct, NULL, name);
851 res->attr.sa.members = NEW_ARR_F (entity *, 1);
854 type *new_d_type_struct (ident *name, dbg_info* db) {
855 type *res = new_type_struct (name);
856 set_type_dbg_info(res, db);
859 void free_struct_entities (type *strct) {
861 assert(strct && (strct->type_op == type_struct));
862 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
863 free_entity(get_struct_member(strct, i));
865 void free_struct_attrs (type *strct) {
866 assert(strct && (strct->type_op == type_struct));
867 DEL_ARR_F(strct->attr.sa.members);
870 /* manipulate private fields of struct */
871 int get_struct_n_members (type *strct) {
872 assert(strct && (strct->type_op == type_struct));
873 return (ARR_LEN (strct->attr.sa.members))-1;
876 void add_struct_member (type *strct, entity *member) {
877 assert(strct && (strct->type_op == type_struct));
878 assert(get_type_tpop(get_entity_type(member)) != type_method);
879 /* @@@ lowerfirm geht nicht durch */
880 ARR_APP1 (entity *, strct->attr.sa.members, member);
883 entity *get_struct_member (type *strct, int pos) {
884 assert(strct && (strct->type_op == type_struct));
885 assert(pos >= 0 && pos < get_struct_n_members(strct));
886 return strct->attr.sa.members[pos+1];
889 int get_struct_member_index(type *strct, entity *mem) {
891 assert(strct && (strct->type_op == type_struct));
892 for (i = 0; i < get_struct_n_members(strct); i++)
893 if (get_struct_member(strct, i) == mem)
898 void set_struct_member (type *strct, int pos, entity *member) {
899 assert(strct && (strct->type_op == type_struct));
900 assert(pos >= 0 && pos < get_struct_n_members(strct));
901 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
902 strct->attr.sa.members[pos+1] = member;
904 void remove_struct_member(type *strct, entity *member) {
906 assert(strct && (strct->type_op == type_struct));
907 for (i = 1; i < (ARR_LEN (strct->attr.sa.members)); i++)
908 if (strct->attr.sa.members[i] == member) {
909 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
910 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
911 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
917 int (is_struct_type)(type *strct) {
918 return __is_struct_type(strct);
921 /*******************************************************************/
923 /*******************************************************************/
926 * Lazy construction of value argument / result representation.
927 * Constructs a struct type and its member. The types of the members
928 * are passed in the argument list.
930 * @param name name of the type constructed
931 * @param len number of fields
932 * @param tps array of field types with length len
935 build_value_type(ident *name, int len, type **tps) {
937 type *res = new_type_struct(name);
938 /* Remove type from type list. Must be treated differently than other types. */
939 remove_irp_type_from_list(res);
940 for (i = 0; i < len; i++) {
941 type *elt_type = res; /* use res as default if corresponding type is not yet set. */
942 if (tps[i]) elt_type = tps[i];
943 new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
948 /* Create a new method type.
949 N_param is the number of parameters, n_res the number of results. */
950 type *new_type_method (ident *name, int n_param, int n_res) {
953 assert((get_mode_size_bytes(mode_P_mach) != -1) && "unorthodox modes not implemented");
954 res = new_type(type_method, mode_P_mach, name);
955 res->state = layout_fixed;
956 res->size = get_mode_size_bits(mode_P_mach);
957 res->attr.ma.n_params = n_param;
958 res->attr.ma.param_type = (type **) xmalloc (sizeof (type *) * n_param);
959 res->attr.ma.value_params = NULL;
960 res->attr.ma.n_res = n_res;
961 res->attr.ma.res_type = (type **) xmalloc (sizeof (type *) * n_res);
962 res->attr.ma.value_ress = NULL;
963 res->attr.ma.variadicity = variadicity_non_variadic;
964 res->attr.ma.first_variadic_param = -1;
969 type *new_d_type_method (ident *name, int n_param, int n_res, dbg_info* db) {
970 type *res = new_type_method (name, n_param, n_res);
971 set_type_dbg_info(res, db);
975 void free_method_entities(type *method) {
976 assert(method && (method->type_op == type_method));
979 /* Attention: also frees entities in value parameter subtypes! */
980 void free_method_attrs(type *method) {
981 assert(method && (method->type_op == type_method));
982 free(method->attr.ma.param_type);
983 free(method->attr.ma.res_type);
984 if (method->attr.ma.value_params) {
985 free_type_entities(method->attr.ma.value_params);
986 free_type(method->attr.ma.value_params);
988 if (method->attr.ma.value_ress) {
989 free_type_entities(method->attr.ma.value_ress);
990 free_type(method->attr.ma.value_ress);
994 /* manipulate private fields of method. */
995 int get_method_n_params (type *method) {
996 assert(method && (method->type_op == type_method));
997 return method->attr.ma.n_params;
1000 type *get_method_param_type(type *method, int pos) {
1002 assert(method && (method->type_op == type_method));
1003 assert(pos >= 0 && pos < get_method_n_params(method));
1004 res = method->attr.ma.param_type[pos];
1005 assert(res != NULL && "empty method param type");
1006 return method->attr.ma.param_type[pos] = skip_tid(res);
1009 void set_method_param_type(type *method, int pos, type* tp) {
1010 assert(method && (method->type_op == type_method));
1011 assert(pos >= 0 && pos < get_method_n_params(method));
1012 method->attr.ma.param_type[pos] = tp;
1013 /* If information constructed set pass-by-value representation. */
1014 if (method->attr.ma.value_params) {
1015 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
1016 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
1020 /* Returns an entity that represents the copied value argument. Only necessary
1021 for compounds passed by value. */
1022 entity *get_method_value_param_ent(type *method, int pos) {
1023 assert(method && (method->type_op == type_method));
1024 assert(pos >= 0 && pos < get_method_n_params(method));
1025 if (!method->attr.ma.value_params)
1026 method->attr.ma.value_params
1027 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
1028 get_method_n_params(method), method->attr.ma.param_type);
1029 assert((get_entity_type(get_struct_member(method->attr.ma.value_params, pos))
1030 != method->attr.ma.value_params)
1031 && "param type not yet set");
1032 return get_struct_member(method->attr.ma.value_params, pos);
1036 * Returns a type that represents the copied value arguments.
1038 type *get_method_value_param_type(type *method)
1040 assert(method && (method->type_op == type_method));
1041 return method->attr.ma.value_params;
1044 int get_method_n_ress (type *method) {
1045 assert(method && (method->type_op == type_method));
1046 return method->attr.ma.n_res;
1049 type *get_method_res_type(type *method, int pos) {
1051 assert(method && (method->type_op == type_method));
1052 assert(pos >= 0 && pos < get_method_n_ress(method));
1053 res = method->attr.ma.res_type[pos];
1054 assert(res != NULL && "empty method return type");
1055 return method->attr.ma.res_type[pos] = skip_tid(res);
1058 void set_method_res_type(type *method, int pos, type* tp) {
1059 assert(method && (method->type_op == type_method));
1060 assert(pos >= 0 && pos < get_method_n_ress(method));
1061 /* set the result type */
1062 method->attr.ma.res_type[pos] = tp;
1063 /* If information constructed set pass-by-value representation. */
1064 if (method->attr.ma.value_ress) {
1065 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1066 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1070 /* Returns an entity that represents the copied value result. Only necessary
1071 for compounds passed by value. */
1072 entity *get_method_value_res_ent(type *method, int pos) {
1073 assert(method && (method->type_op == type_method));
1074 assert(pos >= 0 && pos < get_method_n_ress(method));
1075 if (!method->attr.ma.value_ress)
1076 method->attr.ma.value_ress
1077 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1078 get_method_n_ress(method), method->attr.ma.res_type);
1079 assert((get_entity_type(get_struct_member(method->attr.ma.value_ress, pos)) != method->attr.ma.value_ress)
1080 && "result type not yet set");
1081 return get_struct_member(method->attr.ma.value_ress, pos);
1085 * Returns a type that represents the copied value results.
1087 type *get_method_value_res_type(type *method) {
1088 assert(method && (method->type_op == type_method));
1089 return method->attr.ma.value_ress;
1092 /* Returns the null-terminated name of this variadicity. */
1093 const char *get_variadicity_name(variadicity vari)
1095 #define X(a) case a: return #a
1097 X(variadicity_non_variadic);
1098 X(variadicity_variadic);
1105 variadicity get_method_variadicity(type *method)
1107 assert(method && (method->type_op == type_method));
1108 return method->attr.ma.variadicity;
1111 void set_method_variadicity(type *method, variadicity vari)
1113 assert(method && (method->type_op == type_method));
1114 method->attr.ma.variadicity = vari;
1118 * Returns the first variadic parameter index of a type.
1119 * If this index was NOT set, the index of the last parameter
1120 * of the method type plus one is returned for variadic functions.
1121 * Non-variadic function types always return -1 here.
1123 int get_method_first_variadic_param_index(type *method)
1125 assert(method && (method->type_op == type_method));
1127 if (method->attr.ma.variadicity == variadicity_non_variadic)
1130 if (method->attr.ma.first_variadic_param == -1)
1131 return get_method_n_params(method);
1132 return method->attr.ma.first_variadic_param;
1136 * Sets the first variadic parameter index. This allows to specify
1137 * a complete call type (containing the type of all parameters)
1138 * but still have the knowledge, which parameter must be passed as
1141 void set_method_first_variadic_param_index(type *method, int index)
1143 assert(method && (method->type_op == type_method));
1144 assert(index >= 0 && index <= get_method_n_params(method));
1146 method->attr.ma.first_variadic_param = index;
1150 int (is_method_type)(type *method) {
1151 return __is_method_type(method);
1154 /*-----------------------------------------------------------------*/
1156 /*-----------------------------------------------------------------*/
1158 /* create a new type uni */
1159 type *new_type_union (ident *name) {
1161 res = new_type(type_union, NULL, name);
1162 /*res->attr.ua.unioned_type = (type **) xmalloc (sizeof (type *) * n_types);
1163 res->attr.ua.delim_names = (ident **) xmalloc (sizeof (ident *) * n_types); */
1164 res->attr.ua.members = NEW_ARR_F (entity *, 1);
1167 type *new_d_type_union (ident *name, dbg_info* db) {
1168 type *res = new_type_union (name);
1169 set_type_dbg_info(res, db);
1172 void free_union_entities (type *uni) {
1174 assert(uni && (uni->type_op == type_union));
1175 for (i = get_union_n_members(uni)-1; i >= 0; --i)
1176 free_entity(get_union_member(uni, i));
1178 void free_union_attrs (type *uni) {
1179 assert(uni && (uni->type_op == type_union));
1180 DEL_ARR_F(uni->attr.ua.members);
1182 /* manipulate private fields of union */
1184 int get_union_n_types (type *uni) {
1185 assert(uni && (uni->type_op == type_union));
1186 return uni->attr.ua.n_types;
1188 type *get_union_unioned_type (type *uni, int pos) {
1189 assert(uni && (uni->type_op == type_union));
1190 assert(pos >= 0 && pos < get_union_n_types(uni));
1191 return uni->attr.ua.unioned_type[pos] = skip_tid(uni->attr.ua.unioned_type[pos]);
1193 void set_union_unioned_type (type *uni, int pos, type *tp) {
1194 assert(uni && (uni->type_op == type_union));
1195 assert(pos >= 0 && pos < get_union_n_types(uni));
1196 uni->attr.ua.unioned_type[pos] = tp;
1198 ident *get_union_delim_nameid (type *uni, int pos) {
1199 assert(uni && (uni->type_op == type_union));
1200 assert(pos >= 0 && pos < get_union_n_types(uni));
1201 return uni->attr.ua.delim_names[pos];
1203 const char *get_union_delim_name (type *uni, int pos) {
1204 assert(uni && (uni->type_op == type_union));
1205 assert(pos >= 0 && pos < get_union_n_types(uni));
1206 return get_id_str(uni->attr.ua.delim_names[pos]);
1208 void set_union_delim_nameid (type *uni, int pos, ident *id) {
1209 assert(uni && (uni->type_op == type_union));
1210 assert(pos >= 0 && pos < get_union_n_types(uni));
1211 uni->attr.ua.delim_names[pos] = id;
1214 int get_union_n_members (type *uni) {
1215 assert(uni && (uni->type_op == type_union));
1216 return (ARR_LEN (uni->attr.ua.members))-1;
1218 void add_union_member (type *uni, entity *member) {
1219 assert(uni && (uni->type_op == type_union));
1220 ARR_APP1 (entity *, uni->attr.ua.members, member);
1222 entity *get_union_member (type *uni, int pos) {
1223 assert(uni && (uni->type_op == type_union));
1224 assert(pos >= 0 && pos < get_union_n_members(uni));
1225 return uni->attr.ua.members[pos+1];
1227 void set_union_member (type *uni, int pos, entity *member) {
1228 assert(uni && (uni->type_op == type_union));
1229 assert(pos >= 0 && pos < get_union_n_members(uni));
1230 uni->attr.ua.members[pos+1] = member;
1232 void remove_union_member(type *uni, entity *member) {
1234 assert(uni && (uni->type_op == type_union));
1235 for (i = 1; i < (ARR_LEN (uni->attr.ua.members)); i++)
1236 if (uni->attr.ua.members[i] == member) {
1237 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1238 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1239 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1245 int (is_union_type)(type *uni) {
1246 return __is_union_type(uni);
1249 /*-----------------------------------------------------------------*/
1251 /*-----------------------------------------------------------------*/
1254 /* create a new type array -- set dimension sizes independently */
1255 type *new_type_array (ident *name, int n_dimensions,
1256 type *element_type) {
1259 ir_graph *rem = current_ir_graph;
1260 assert(!is_method_type(element_type));
1262 res = new_type(type_array, NULL, name);
1263 res->attr.aa.n_dimensions = n_dimensions;
1264 res->attr.aa.lower_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
1265 res->attr.aa.upper_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
1266 res->attr.aa.order = (int *) xmalloc (sizeof (int) * n_dimensions);
1268 current_ir_graph = get_const_code_irg();
1269 for (i = 0; i < n_dimensions; i++) {
1270 res->attr.aa.lower_bound[i] = new_Unknown(mode_Iu);
1271 res->attr.aa.upper_bound[i] = new_Unknown(mode_Iu);
1272 res->attr.aa.order[i] = i;
1274 current_ir_graph = rem;
1276 res->attr.aa.element_type = element_type;
1277 new_entity(res, mangle_u(name, id_from_str("elem_ent", 8)), element_type);
1282 type *new_d_type_array (ident *name, int n_dimensions,
1283 type *element_type, dbg_info* db) {
1284 type *res = new_type_array (name, n_dimensions, element_type);
1285 set_type_dbg_info(res, db);
1289 void free_array_entities (type *array) {
1290 assert(array && (array->type_op == type_array));
1293 void free_array_attrs (type *array) {
1294 assert(array && (array->type_op == type_array));
1295 free(array->attr.aa.lower_bound);
1296 free(array->attr.aa.upper_bound);
1299 /* manipulate private fields of array type */
1300 int get_array_n_dimensions (type *array) {
1301 assert(array && (array->type_op == type_array));
1302 return array->attr.aa.n_dimensions;
1306 set_array_bounds (type *array, int dimension, ir_node * lower_bound,
1307 ir_node * upper_bound) {
1308 assert(array && (array->type_op == type_array));
1309 assert(lower_bound && "lower_bound node may not be NULL.");
1310 assert(upper_bound && "upper_bound node may not be NULL.");
1311 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1312 array->attr.aa.lower_bound[dimension] = lower_bound;
1313 array->attr.aa.upper_bound[dimension] = upper_bound;
1316 set_array_bounds_int (type *array, int dimension, int lower_bound,
1318 ir_graph *rem = current_ir_graph;
1319 current_ir_graph = get_const_code_irg();
1320 set_array_bounds (array, dimension,
1321 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1322 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1323 current_ir_graph = rem;
1326 set_array_lower_bound (type *array, int dimension, ir_node * lower_bound) {
1327 assert(array && (array->type_op == type_array));
1328 assert(lower_bound && "lower_bound node may not be NULL.");
1329 array->attr.aa.lower_bound[dimension] = lower_bound;
1331 void set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
1332 ir_graph *rem = current_ir_graph;
1333 current_ir_graph = get_const_code_irg();
1334 set_array_lower_bound (array, dimension,
1335 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1336 current_ir_graph = rem;
1339 set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
1340 assert(array && (array->type_op == type_array));
1341 assert(upper_bound && "upper_bound node may not be NULL.");
1342 array->attr.aa.upper_bound[dimension] = upper_bound;
1344 void set_array_upper_bound_int (type *array, int dimension, int upper_bound) {
1345 ir_graph *rem = current_ir_graph;
1346 current_ir_graph = get_const_code_irg();
1347 set_array_upper_bound (array, dimension,
1348 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1349 current_ir_graph = rem;
1351 int has_array_lower_bound (type *array, int dimension) {
1352 assert(array && (array->type_op == type_array));
1353 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1355 ir_node * get_array_lower_bound (type *array, int dimension) {
1356 assert(array && (array->type_op == type_array));
1357 return array->attr.aa.lower_bound[dimension];
1359 int has_array_upper_bound (type *array, int dimension) {
1360 assert(array && (array->type_op == type_array));
1361 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1363 ir_node * get_array_upper_bound (type *array, int dimension) {
1364 assert(array && (array->type_op == type_array));
1365 return array->attr.aa.upper_bound[dimension];
1368 void set_array_order (type *array, int dimension, int order) {
1369 assert(array && (array->type_op == type_array));
1370 array->attr.aa.order[dimension] = order;
1372 int get_array_order (type *array, int dimension) {
1373 assert(array && (array->type_op == type_array));
1374 return array->attr.aa.order[dimension];
1377 void set_array_element_type (type *array, type *tp) {
1378 assert(array && (array->type_op == type_array));
1379 assert(!is_method_type(tp));
1380 array->attr.aa.element_type = tp;
1382 type *get_array_element_type (type *array) {
1383 assert(array && (array->type_op == type_array));
1384 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1387 void set_array_element_entity (type *array, entity *ent) {
1388 assert(array && (array->type_op == type_array));
1389 assert((get_entity_type(ent)->type_op != type_method));
1390 array->attr.aa.element_ent = ent;
1391 array->attr.aa.element_type = get_entity_type(ent);
1393 entity *get_array_element_entity (type *array) {
1394 assert(array && (array->type_op == type_array));
1395 return array->attr.aa.element_ent;
1399 int (is_array_type)(type *array) {
1400 return __is_array_type(array);
1403 /*-----------------------------------------------------------------*/
1404 /* TYPE_ENUMERATION */
1405 /*-----------------------------------------------------------------*/
1407 /* create a new type enumeration -- set the enumerators independently */
1408 type *new_type_enumeration (ident *name, int n_enums) {
1410 res = new_type(type_enumeration, NULL, name);
1411 res->attr.ea.n_enums = n_enums;
1412 res->attr.ea.enumer = (tarval **)xmalloc(sizeof(res->attr.ea.enumer[0]) * n_enums);
1413 res->attr.ea.enum_nameid = (ident **)xmalloc(sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
1414 memset(res->attr.ea.enumer, 0, sizeof(res->attr.ea.enumer[0]) * n_enums);
1415 memset(res->attr.ea.enum_nameid, 0, sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
1418 type *new_d_type_enumeration (ident *name, int n_enums, dbg_info* db) {
1419 type *res = new_type_enumeration (name, n_enums);
1420 set_type_dbg_info(res, db);
1424 void free_enumeration_entities(type *enumeration) {
1425 assert(enumeration && (enumeration->type_op == type_enumeration));
1427 void free_enumeration_attrs(type *enumeration) {
1428 assert(enumeration && (enumeration->type_op == type_enumeration));
1429 free(enumeration->attr.ea.enumer);
1430 free(enumeration->attr.ea.enum_nameid);
1433 /* manipulate fields of enumeration type. */
1434 int get_enumeration_n_enums (type *enumeration) {
1435 assert(enumeration && (enumeration->type_op == type_enumeration));
1436 return enumeration->attr.ea.n_enums;
1438 void set_enumeration_enum (type *enumeration, int pos, tarval *con) {
1439 assert(enumeration && (enumeration->type_op == type_enumeration));
1440 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1441 enumeration->attr.ea.enumer[pos] = con;
1443 tarval *get_enumeration_enum (type *enumeration, int pos) {
1444 assert(enumeration && (enumeration->type_op == type_enumeration));
1445 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1446 return enumeration->attr.ea.enumer[pos];
1448 void set_enumeration_nameid (type *enumeration, int pos, ident *id) {
1449 assert(enumeration && (enumeration->type_op == type_enumeration));
1450 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1451 enumeration->attr.ea.enum_nameid[pos] = id;
1453 ident *get_enumeration_nameid (type *enumeration, int pos) {
1454 assert(enumeration && (enumeration->type_op == type_enumeration));
1455 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1456 return enumeration->attr.ea.enum_nameid[pos];
1458 const char *get_enumeration_name(type *enumeration, int pos) {
1459 assert(enumeration && (enumeration->type_op == type_enumeration));
1460 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1461 return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
1465 int (is_enumeration_type)(type *enumeration) {
1466 return __is_enumeration_type(enumeration);
1469 /*-----------------------------------------------------------------*/
1471 /*-----------------------------------------------------------------*/
1473 /* Create a new type pointer */
1474 type *new_type_pointer_mode (ident *name, type *points_to, ir_mode *ptr_mode) {
1476 assert(mode_is_reference(ptr_mode));
1477 res = new_type(type_pointer, ptr_mode, name);
1478 res->attr.pa.points_to = points_to;
1479 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1480 res->size = get_mode_size_bits(res->mode);
1481 res->state = layout_fixed;
1484 type *new_d_type_pointer (ident *name, type *points_to, ir_mode *ptr_mode, dbg_info* db) {
1485 type *res = new_type_pointer_mode (name, points_to, ptr_mode);
1486 set_type_dbg_info(res, db);
1489 void free_pointer_entities (type *pointer) {
1490 assert(pointer && (pointer->type_op == type_pointer));
1492 void free_pointer_attrs (type *pointer) {
1493 assert(pointer && (pointer->type_op == type_pointer));
1495 /* manipulate fields of type_pointer */
1496 void set_pointer_points_to_type (type *pointer, type *tp) {
1497 assert(pointer && (pointer->type_op == type_pointer));
1498 pointer->attr.pa.points_to = tp;
1500 type *get_pointer_points_to_type (type *pointer) {
1501 assert(pointer && (pointer->type_op == type_pointer));
1502 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1506 int (is_pointer_type)(type *pointer) {
1507 return __is_pointer_type(pointer);
1510 /* Returns the first pointer type that has as points_to tp.
1511 * Not efficient: O(#types).
1512 * If not found returns unknown_type. */
1513 type *find_pointer_type_to_type (type *tp) {
1515 for (i = 0; i < get_irp_n_types(); ++i) {
1516 type *found = get_irp_type(i);
1517 if (is_pointer_type(found) && get_pointer_points_to_type(found) == tp)
1520 return unknown_type;
1525 /*-----------------------------------------------------------------*/
1526 /* TYPE_PRIMITIVE */
1527 /*-----------------------------------------------------------------*/
1529 /* create a new type primitive */
1530 type *new_type_primitive (ident *name, ir_mode *mode) {
1532 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1533 res = new_type(type_primitive, mode, name);
1534 res->size = get_mode_size_bits(mode);
1535 res->state = layout_fixed;
1538 type *new_d_type_primitive (ident *name, ir_mode *mode, dbg_info* db) {
1539 type *res = new_type_primitive (name, mode);
1540 set_type_dbg_info(res, db);
1543 void free_primitive_entities (type *primitive) {
1544 assert(primitive && (primitive->type_op == type_primitive));
1546 void free_primitive_attrs (type *primitive) {
1547 assert(primitive && (primitive->type_op == type_primitive));
1551 int (is_primitive_type)(type *primitive) {
1552 return __is_primitive_type(primitive);
1555 /*-----------------------------------------------------------------*/
1556 /* common functionality */
1557 /*-----------------------------------------------------------------*/
1560 int (is_atomic_type)(type *tp) {
1561 return __is_atomic_type(tp);
1565 * Gets the number of elements in a firm compound type.
1567 int get_compound_n_members(type *tp)
1571 if (is_struct_type(tp))
1572 res = get_struct_n_members(tp);
1573 else if (is_class_type(tp))
1574 res = get_class_n_members(tp);
1575 else if (is_union_type(tp))
1576 res = get_union_n_members(tp);
1578 assert(0 && "need struct, union or class for member count");
1584 * Gets the member of a firm compound type at position pos.
1586 entity *get_compound_member(type *tp, int pos)
1590 if (is_struct_type(tp))
1591 res = get_struct_member(tp, pos);
1592 else if (is_class_type(tp))
1593 res = get_class_member(tp, pos);
1594 else if (is_union_type(tp))
1595 res = get_union_member(tp, pos);
1598 assert(0 && "need struct, union or class to get a member");
1606 int is_compound_type(type *tp) {
1607 assert(tp && tp->kind == k_type);
1608 return (is_class_type(tp) || is_struct_type(tp) ||
1609 is_array_type(tp) || is_union_type(tp));
1613 #ifdef DEBUG_libfirm
1614 int dump_node_opcode(FILE *F, ir_node *n); /* from irdump.c */
1616 void dump_type (type *tp) {
1619 printf("%s type %s (%ld)", get_tpop_name(get_type_tpop(tp)), get_type_name(tp), get_type_nr(tp));
1621 switch (get_type_tpop_code(tp)) {
1624 printf("\n members: ");
1625 for (i = 0; i < get_class_n_members(tp); ++i) {
1626 entity *mem = get_class_member(tp, i);
1627 printf("\n (%3d) %s:\t %s",
1628 get_entity_offset_bits(mem), get_type_name(get_entity_type(mem)), get_entity_name(mem));
1630 printf("\n supertypes: ");
1631 for (i = 0; i < get_class_n_supertypes(tp); ++i) {
1632 type *stp = get_class_supertype(tp, i);
1633 printf("\n %s", get_type_name(stp));
1635 printf("\n subtypes: ");
1636 for (i = 0; i < get_class_n_subtypes(tp); ++i) {
1637 type *stp = get_class_subtype(tp, i);
1638 printf("\n %s", get_type_name(stp));
1641 printf("\n peculiarity: %s", get_peculiarity_string(get_class_peculiarity(tp)));
1646 printf("\n members: ");
1647 for (i = 0; i < get_compound_n_members(tp); ++i) {
1648 entity *mem = get_compound_member(tp, i);
1649 printf("\n (%3d) %s:\t %s",
1650 get_entity_offset_bits(mem), get_type_name(get_entity_type(mem)), get_entity_name(mem));
1655 type *tt = get_pointer_points_to_type(tp);
1657 printf("\n points to %s (%ld)", get_type_name(tt), get_type_nr(tt));
1661 printf(": details not implemented\n");
1665 #else /* DEBUG_libfirm */
1666 void dump_type (type *tp) {}
1667 #endif /* DEBUG_libfirm */