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 (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 (unknown_type, 0);
84 set_type_state (unknown_type, layout_fixed);
85 remove_irp_type(unknown_type);
88 unsigned long type_visited;
89 INLINE void set_master_type_visited(unsigned long val) { type_visited = val; }
90 INLINE unsigned long get_master_type_visited() { return type_visited; }
91 INLINE void inc_master_type_visited() { type_visited++; }
95 new_type(tp_op *type_op, ir_mode *mode, ident* name) {
99 assert(type_op != type_id);
100 assert(!id_contains_char(name, ' ') && "type name should not contain spaces");
102 node_size = offsetof (type, attr) + type_op->attr_size;
103 res = (type *) xmalloc (node_size);
104 add_irp_type(res); /* Remember the new type global. */
107 res->type_op = type_op;
110 res->state = layout_undefined;
115 res->nr = get_irp_new_node_nr();
121 void free_type(type *tp) {
122 if ((get_type_tpop(tp) == tpop_none) || (get_type_tpop(tp) == tpop_unknown))
124 /* Remove from list of all types */
126 /* Free the attributes of the type. */
128 /* Free entities automatically allocated with the type */
129 if (is_array_type(tp))
130 free_entity(get_array_element_entity(tp));
131 /* And now the type itself... */
136 void free_type_entities(type *tp) {
137 switch(get_type_tpop_code(tp)) {
138 case tpo_class: { free_class_entities(tp); } break;
139 case tpo_struct: { free_struct_entities(tp); } break;
140 case tpo_method: { free_method_entities(tp); } break;
141 case tpo_union: { free_union_entities(tp); } break;
142 case tpo_array: { free_array_entities(tp); } break;
143 case tpo_enumeration: { free_enumeration_entities(tp); } break;
144 case tpo_pointer: { free_pointer_entities(tp); } break;
145 case tpo_primitive: { free_primitive_entities(tp); } break;
150 void free_type_attrs(type *tp) {
151 switch(get_type_tpop_code(tp)) {
152 case tpo_class: { free_class_attrs(tp); } break;
153 case tpo_struct: { free_struct_attrs(tp); } break;
154 case tpo_method: { free_method_attrs(tp); } break;
155 case tpo_union: { free_union_attrs(tp); } break;
156 case tpo_array: { free_array_attrs(tp); } break;
157 case tpo_enumeration: { free_enumeration_attrs(tp); } break;
158 case tpo_pointer: { free_pointer_attrs(tp); } break;
159 case tpo_primitive: { free_primitive_attrs(tp); } break;
164 /* set/get the link field */
165 void *get_type_link(type *tp)
167 assert(tp && tp->kind == k_type);
171 void set_type_link(type *tp, void *l)
173 assert(tp && tp->kind == k_type);
177 tp_op* get_type_tpop(type *tp) {
178 assert(tp && tp->kind == k_type);
182 ident* get_type_tpop_nameid(type *tp) {
183 assert(tp && tp->kind == k_type);
184 return tp->type_op->name;
187 const char* get_type_tpop_name(type *tp) {
188 assert(tp && tp->kind == k_type);
189 return get_id_str(tp->type_op->name);
192 tp_opcode get_type_tpop_code(type *tp) {
193 assert(tp && tp->kind == k_type);
194 return tp->type_op->code;
197 ir_mode* get_type_mode(type *tp) {
198 assert(tp && tp->kind == k_type);
202 void set_type_mode(type *tp, ir_mode* m) {
203 assert(tp && tp->kind == k_type);
205 assert(((tp->type_op != type_primitive) || mode_is_data(m)) &&
206 /* Modes of primitives must be data */
207 ((tp->type_op != type_enumeration) || mode_is_int(m)) &&
208 /* Modes of enumerations must be integers */
209 ((tp->type_op != type_pointer) || mode_is_reference(m)) );
210 /* Modes of pointers must be references. */
212 if ((tp->type_op == type_primitive) ||
213 (tp->type_op == type_enumeration) ||
214 (tp->type_op == type_pointer) ) {
215 /* For pointer, primitive and enumeration size depends on the mode. */
216 assert((get_mode_size_bytes(m) != -1) && "unorthodox modes not implemented");
217 tp->size = get_mode_size_bytes(m);
222 ident* get_type_ident(type *tp) {
223 assert(tp && tp->kind == k_type);
227 void set_type_ident(type *tp, ident* id) {
228 assert(tp && tp->kind == k_type);
232 /* Outputs a unique number for this node */
234 get_type_nr(type *tp) {
243 const char* get_type_name(type *tp) {
244 assert(tp && tp->kind == k_type);
245 return (get_id_str(tp->name));
248 int get_type_size(type *tp) {
249 assert(tp && tp->kind == k_type);
254 set_type_size(type *tp, int size) {
255 assert(tp && tp->kind == k_type);
256 /* For pointer enumeration and primitive size depends on the mode.
257 Methods don't have a size. */
258 if ((tp->type_op != type_pointer) && (tp->type_op != type_primitive) &&
259 (tp->type_op != type_enumeration) && (tp->type_op != type_method))
264 get_type_state(type *tp) {
265 assert(tp && tp->kind == k_type);
270 set_type_state(type *tp, type_state state) {
271 assert(tp && tp->kind == k_type);
273 if ((tp->type_op == type_pointer) || (tp->type_op == type_primitive) ||
274 (tp->type_op == type_method))
277 /* Just a correctness check: */
278 if (state == layout_fixed) {
280 switch (get_type_tpop_code(tp)) {
283 assert(get_type_size(tp) > -1);
284 if (tp != get_glob_type())
285 for (i = 0; i < get_class_n_members(tp); i++) {
286 if (get_entity_offset(get_class_member(tp, i)) <= -1)
287 { DDMT(tp); DDME(get_class_member(tp, i)); }
288 assert(get_entity_offset(get_class_member(tp, i)) > -1);
290 assert(is_method_type(get_entity_type(get_class_member(tp, i))) ||
291 (get_entity_allocation(get_class_member(tp, i)) == allocation_automatic));
297 assert(get_type_size(tp) > -1);
298 for (i = 0; i < get_struct_n_members(tp); i++) {
299 assert(get_entity_offset(get_struct_member(tp, i)) > -1);
300 assert((get_entity_allocation(get_struct_member(tp, i)) == allocation_automatic));
309 Assure that only innermost dimension is dynamic? */
311 case tpo_enumeration:
313 assert(get_type_mode != NULL);
314 for (i = 0; i < get_enumeration_n_enums(tp); i++)
315 assert(get_enumeration_enum(tp, i) != NULL);
323 unsigned long get_type_visited(type *tp) {
324 assert(tp && tp->kind == k_type);
328 void set_type_visited(type *tp, unsigned long num) {
329 assert(tp && tp->kind == k_type);
332 /* Sets visited field in type to type_visited. */
333 void mark_type_visited(type *tp) {
334 assert(tp && tp->kind == k_type);
335 assert(tp->visit < type_visited);
336 tp->visit = type_visited;
338 /* @@@ name clash with master flag
339 bool type_visited(type *tp) {
340 assert(tp && tp->kind == k_type);
341 return tp->visit >= type_visited;
343 bool type_not_visited(type *tp) {
344 assert(tp && tp->kind == k_type);
345 return tp->visit < type_visited;
349 int is_type (void *thing) {
351 if (get_kind(thing) == k_type)
358 bool equal_type(type *typ1, type *typ2) {
363 if (typ1 == typ2) return true;
365 if ((get_type_tpop_code(typ1) != get_type_tpop_code(typ2)) ||
366 (get_type_ident(typ1) != get_type_ident(typ2)) ||
367 (get_type_mode(typ1) != get_type_mode(typ2)) ||
368 (get_type_state(typ1) != get_type_state(typ2)))
370 if ((get_type_state(typ1) == layout_fixed) &&
371 (get_type_size(typ1) != get_type_size(typ2)))
374 switch(get_type_tpop_code(typ1)) {
376 if (get_class_n_members(typ1) != get_class_n_members(typ2)) return false;
377 if (get_class_n_subtypes(typ1) != get_class_n_subtypes(typ2)) return false;
378 if (get_class_n_supertypes(typ1) != get_class_n_supertypes(typ2)) return false;
379 if (get_class_peculiarity(typ1) != get_class_peculiarity(typ2)) return false;
380 /** Compare the members **/
381 m = alloca(sizeof(entity *) * get_class_n_members(typ1));
382 memset(m, 0, sizeof(entity *) * get_class_n_members(typ1));
383 /* First sort the members of typ2 */
384 for (i = 0; i < get_class_n_members(typ1); i++) {
385 entity *e1 = get_class_member(typ1, i);
386 for (j = 0; j < get_class_n_members(typ2); j++) {
387 entity *e2 = get_class_member(typ2, j);
388 if (get_entity_name(e1) == get_entity_name(e2))
392 for (i = 0; i < get_class_n_members(typ1); i++) {
393 if (!m[i] || /* Found no counterpart */
394 !equal_entity(get_class_member(typ1, i), m[i]))
397 /** Compare the supertypes **/
398 t = alloca(sizeof(entity *) * get_class_n_supertypes(typ1));
399 memset(t, 0, sizeof(entity *) * get_class_n_supertypes(typ1));
400 /* First sort the supertypes of typ2 */
401 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
402 type *t1 = get_class_supertype(typ1, i);
403 for (j = 0; j < get_class_n_supertypes(typ2); j++) {
404 type *t2 = get_class_supertype(typ2, j);
405 if (get_type_ident(t2) == get_type_ident(t1))
409 for (i = 0; i < get_class_n_supertypes(typ1); i++) {
410 if (!t[i] || /* Found no counterpart */
411 get_class_supertype(typ1, i) != t[i])
416 if (get_struct_n_members(typ1) != get_struct_n_members(typ2)) return false;
417 m = alloca(sizeof(entity *) * get_struct_n_members(typ1));
418 memset(m, 0, sizeof(entity *) * get_struct_n_members(typ1));
419 /* First sort the members of lt */
420 for (i = 0; i < get_struct_n_members(typ1); i++) {
421 entity *e1 = get_struct_member(typ1, i);
422 for (j = 0; j < get_struct_n_members(typ2); j++) {
423 entity *e2 = get_struct_member(typ2, j);
424 if (get_entity_name(e1) == get_entity_name(e2))
428 for (i = 0; i < get_struct_n_members(typ1); i++) {
429 if (!m[i] || /* Found no counterpart */
430 !equal_entity(get_struct_member(typ1, i), m[i]))
435 if (get_method_variadicity(typ1) != get_method_variadicity(typ2)) return false;
436 if (get_method_n_params(typ1) != get_method_n_params(typ2)) return false;
437 if (get_method_n_ress(typ1) != get_method_n_ress(typ2)) return false;
438 for (i = 0; i < get_method_n_params(typ1); i++) {
439 if (!equal_type(get_method_param_type(typ1, i), get_method_param_type(typ2, i)))
442 for (i = 0; i < get_method_n_ress(typ1); i++) {
443 if (!equal_type(get_method_res_type(typ1, i), get_method_res_type(typ2, i)))
448 if (get_union_n_members(typ1) != get_union_n_members(typ2)) return false;
449 m = alloca(sizeof(entity *) * get_union_n_members(typ1));
450 memset(m, 0, sizeof(entity *) * get_union_n_members(typ1));
451 /* First sort the members of lt */
452 for (i = 0; i < get_union_n_members(typ1); i++) {
453 entity *e1 = get_union_member(typ1, i);
454 for (j = 0; j < get_union_n_members(typ2); j++) {
455 entity *e2 = get_union_member(typ2, j);
456 if (get_entity_name(e1) == get_entity_name(e2))
460 for (i = 0; i < get_union_n_members(typ1); i++) {
461 if (!m[i] || /* Found no counterpart */
462 !equal_entity(get_union_member(typ1, i), m[i]))
467 if (get_array_n_dimensions(typ1) != get_array_n_dimensions(typ2))
469 if (!equal_type(get_array_element_type(typ1), get_array_element_type(typ2)))
471 for(i = 0; i < get_array_n_dimensions(typ1); i++) {
472 if (get_array_lower_bound(typ1, i) != get_array_lower_bound(typ2, i) ||
473 get_array_upper_bound(typ1, i) != get_array_upper_bound(typ2, i))
475 if (get_array_order(typ1, i) != get_array_order(typ2, i))
476 assert(0 && "type compare with different dimension orders not implemented");
479 case tpo_enumeration: {
480 assert(0 && "enumerations not implemented");
483 if (get_pointer_points_to_type(typ1) != get_pointer_points_to_type(typ2))
486 case tpo_primitive: {
493 bool smaller_type (type *st, type *lt) {
497 if (st == lt) return true;
499 if (get_type_tpop_code(st) != get_type_tpop_code(lt))
502 switch(get_type_tpop_code(st)) {
504 return is_subclass_of(st, lt);
507 if (get_struct_n_members(st) != get_struct_n_members(lt)) return false;
508 m = alloca(sizeof(entity *) * get_struct_n_members(st));
509 memset(m, 0, sizeof(entity *) * get_struct_n_members(st));
510 /* First sort the members of lt */
511 for (i = 0; i < get_struct_n_members(st); i++) {
512 entity *se = get_struct_member(st, i);
513 for (j = 0; j < get_struct_n_members(lt); j++) {
514 entity *le = get_struct_member(lt, j);
515 if (get_entity_name(le) == get_entity_name(se))
519 for (i = 0; i < get_struct_n_members(st); i++) {
520 if (!m[i] || /* Found no counterpart */
521 !smaller_type(get_entity_type(get_struct_member(st, i)),
522 get_entity_type(m[i])))
527 if (get_method_variadicity(st) != get_method_variadicity(lt)) return false;
528 if (get_method_n_params(st) != get_method_n_params(lt)) return false;
529 if (get_method_n_ress(st) != get_method_n_ress(lt)) return false;
530 for (i = 0; i < get_method_n_params(st); i++) {
531 if (!smaller_type(get_method_param_type(st, i), get_method_param_type(lt, i)))
534 for (i = 0; i < get_method_n_ress(st); i++) {
535 if (!smaller_type(get_method_res_type(st, i), get_method_res_type(lt, i)))
540 if (get_union_n_members(st) != get_union_n_members(lt)) return false;
541 m = alloca(sizeof(entity *) * get_union_n_members(st));
542 memset(m, 0, sizeof(entity *) * get_union_n_members(st));
543 /* First sort the members of lt */
544 for (i = 0; i < get_union_n_members(st); i++) {
545 entity *se = get_union_member(st, i);
546 for (j = 0; j < get_union_n_members(lt); j++) {
547 entity *le = get_union_member(lt, j);
548 if (get_entity_name(le) == get_entity_name(se))
552 for (i = 0; i < get_union_n_members(st); i++) {
553 if (!m[i] || /* Found no counterpart */
554 !smaller_type(get_entity_type(get_union_member(st, i)),
555 get_entity_type(m[i])))
560 type *set, *let; /* small/large elt. type */
561 if (get_array_n_dimensions(st) != get_array_n_dimensions(lt))
563 set = get_array_element_type(st);
564 let = get_array_element_type(lt);
566 /* If the elt types are different, set must be convertible
567 to let, and they must have the same size so that address
568 computations work out. To have a size the layout must
570 if ((get_type_state(set) != layout_fixed) ||
571 (get_type_state(let) != layout_fixed))
573 if (!smaller_type(set, let) ||
574 get_type_size(set) != get_type_size(let))
577 for(i = 0; i < get_array_n_dimensions(st); i++) {
578 if (get_array_lower_bound(lt, i))
579 if(get_array_lower_bound(st, i) != get_array_lower_bound(lt, i))
581 if (get_array_upper_bound(lt, i))
582 if(get_array_upper_bound(st, i) != get_array_upper_bound(lt, i))
586 case tpo_enumeration: {
587 assert(0 && "enumerations not implemented");
590 if (!smaller_type(get_pointer_points_to_type(st),
591 get_pointer_points_to_type(lt)))
594 case tpo_primitive: {
595 if (!smaller_mode(get_type_mode(st), get_type_mode(lt)))
603 /*******************************************************************/
605 /*******************************************************************/
607 /* create a new class type */
608 INLINE type *new_type_class (ident *name) {
611 res = new_type(type_class, NULL, name);
613 res->attr.ca.members = NEW_ARR_F (entity *, 1);
614 res->attr.ca.subtypes = NEW_ARR_F (type *, 1);
615 res->attr.ca.supertypes = NEW_ARR_F (type *, 1);
616 res->attr.ca.peculiarity = peculiarity_existent;
617 res->attr.ca.dfn = 0;
621 type *new_d_type_class (ident *name, dbg_info* db) {
622 type *res = new_type_class (name);
623 set_type_dbg_info(res, db);
627 INLINE void free_class_entities(type *clss) {
629 assert(clss && (clss->type_op == type_class));
630 for (i = get_class_n_members(clss)-1; i >= 0; --i)
631 free_entity(get_class_member(clss, i));
634 INLINE void free_class_attrs(type *clss) {
635 assert(clss && (clss->type_op == type_class));
636 DEL_ARR_F(clss->attr.ca.members);
637 DEL_ARR_F(clss->attr.ca.subtypes);
638 DEL_ARR_F(clss->attr.ca.supertypes);
641 /* manipulate private fields of class type */
642 void add_class_member (type *clss, entity *member) {
643 assert(clss && (clss->type_op == type_class));
644 ARR_APP1 (entity *, clss->attr.ca.members, member);
646 int get_class_n_members (type *clss) {
647 assert(clss && (clss->type_op == type_class));
648 return (ARR_LEN (clss->attr.ca.members))-1;
650 int get_class_member_index(type *clss, entity *mem) {
652 assert(clss && (clss->type_op == type_class));
653 for (i = 0; i < get_class_n_members(clss); i++)
654 if (get_class_member(clss, i) == mem)
658 entity *get_class_member (type *clss, int pos) {
659 assert(clss && (clss->type_op == type_class));
660 assert(pos >= 0 && pos < get_class_n_members(clss));
661 return clss->attr.ca.members[pos+1];
663 void set_class_member (type *clss, entity *member, int pos) {
664 assert(clss && (clss->type_op == type_class));
665 assert(pos >= 0 && pos < get_class_n_members(clss));
666 clss->attr.ca.members[pos+1] = member;
668 void set_class_members (type *clss, entity **members, int arity) {
670 assert(clss && (clss->type_op == type_class));
671 DEL_ARR_F(clss->attr.ca.members);
672 clss->attr.ca.members = NEW_ARR_F (entity *, 1);
673 for (i = 0; i < arity; i++) {
674 set_entity_owner(members[i], clss);
675 ARR_APP1 (entity *, clss->attr.ca.members, members[i]);
678 void remove_class_member(type *clss, entity *member) {
680 assert(clss && (clss->type_op == type_class));
681 for (i = 1; i < (ARR_LEN (clss->attr.ca.members)); i++) {
682 if (clss->attr.ca.members[i] == member) {
683 for(; i < (ARR_LEN (clss->attr.ca.members)) - 1; i++)
684 clss->attr.ca.members[i] = clss->attr.ca.members[i + 1];
685 ARR_SETLEN(entity*, clss->attr.ca.members, ARR_LEN(clss->attr.ca.members) - 1);
691 void add_class_subtype (type *clss, type *subtype) {
693 assert(clss && (clss->type_op == type_class));
694 ARR_APP1 (type *, clss->attr.ca.subtypes, subtype);
695 for (i = 0; i < get_class_n_supertypes(subtype); i++)
696 if (get_class_supertype(subtype, i) == clss)
697 /* Class already registered */
699 ARR_APP1 (type *, subtype->attr.ca.supertypes, clss);
701 int get_class_n_subtypes (type *clss) {
702 assert(clss && (clss->type_op == type_class));
703 return (ARR_LEN (clss->attr.ca.subtypes))-1;
705 type *get_class_subtype (type *clss, int pos) {
706 assert(clss && (clss->type_op == type_class));
707 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
708 return clss->attr.ca.subtypes[pos+1] = skip_tid(clss->attr.ca.subtypes[pos+1]);
710 void set_class_subtype (type *clss, type *subtype, int pos) {
711 assert(clss && (clss->type_op == type_class));
712 assert(pos >= 0 && pos < get_class_n_subtypes(clss));
713 clss->attr.ca.subtypes[pos+1] = subtype;
715 void remove_class_subtype(type *clss, type *subtype) {
717 assert(clss && (clss->type_op == type_class));
718 for (i = 1; i < (ARR_LEN (clss->attr.ca.subtypes)); i++)
719 if (clss->attr.ca.subtypes[i] == subtype) {
720 for(; i < (ARR_LEN (clss->attr.ca.subtypes))-1; i++)
721 clss->attr.ca.subtypes[i] = clss->attr.ca.subtypes[i+1];
722 ARR_SETLEN(entity*, clss->attr.ca.subtypes, ARR_LEN(clss->attr.ca.subtypes) - 1);
727 void add_class_supertype (type *clss, type *supertype) {
729 assert(clss && (clss->type_op == type_class));
730 assert(supertype && (supertype -> type_op == type_class));
731 ARR_APP1 (type *, clss->attr.ca.supertypes, supertype);
732 for (i = 0; i < get_class_n_subtypes(supertype); i++)
733 if (get_class_subtype(supertype, i) == clss)
734 /* Class already registered */
736 ARR_APP1 (type *, supertype->attr.ca.subtypes, clss);
738 int get_class_n_supertypes (type *clss) {
739 assert(clss && (clss->type_op == type_class));
740 return (ARR_LEN (clss->attr.ca.supertypes))-1;
742 int get_class_supertype_index(type *clss, type *super_clss) {
744 assert(clss && (clss->type_op == type_class));
745 assert(super_clss && (super_clss->type_op == type_class));
746 for (i = 0; i < get_class_n_supertypes(clss); i++)
747 if (get_class_supertype(clss, i) == super_clss)
751 type *get_class_supertype (type *clss, int pos) {
752 assert(clss && (clss->type_op == type_class));
753 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
754 return clss->attr.ca.supertypes[pos+1] = skip_tid(clss->attr.ca.supertypes[pos+1]);
756 void set_class_supertype (type *clss, type *supertype, int pos) {
757 assert(clss && (clss->type_op == type_class));
758 assert(pos >= 0 && pos < get_class_n_supertypes(clss));
759 clss->attr.ca.supertypes[pos+1] = supertype;
761 void remove_class_supertype(type *clss, type *supertype) {
763 assert(clss && (clss->type_op == type_class));
764 for (i = 1; i < (ARR_LEN (clss->attr.ca.supertypes)); i++)
765 if (clss->attr.ca.supertypes[i] == supertype) {
766 for(; i < (ARR_LEN (clss->attr.ca.supertypes))-1; i++)
767 clss->attr.ca.supertypes[i] = clss->attr.ca.supertypes[i+1];
768 ARR_SETLEN(entity*, clss->attr.ca.supertypes, ARR_LEN(clss->attr.ca.supertypes) - 1);
773 char *get_peculiarity_string(peculiarity p) {
774 if (p == peculiarity_description)
775 return "peculiarity_description";
776 if (p == peculiarity_inherited)
777 return "peculiarity_inherited";
778 return "peculiarity_existent";
781 INLINE peculiarity get_class_peculiarity (type *clss) {
782 assert(clss && (clss->type_op == type_class));
783 return clss->attr.ca.peculiarity;
785 INLINE void set_class_peculiarity (type *clss, peculiarity pec) {
786 assert(clss && (clss->type_op == type_class));
787 assert(pec != peculiarity_inherited); /* There is no inheritance of types in libFirm. */
788 clss->attr.ca.peculiarity = pec;
791 void set_class_dfn (type *clss, int dfn)
793 clss->attr.ca.dfn = dfn;
796 int get_class_dfn (type *clss)
798 return (clss->attr.ca.dfn);
802 bool is_class_type(type *clss) {
804 if (clss->type_op == type_class) return 1; else return 0;
807 bool is_subclass_of(type *low, type *high) {
809 assert(is_class_type(low) && is_class_type(high));
810 if (low == high) return true;
811 /* depth first search from high downwards. */
812 for (i = 0; i < get_class_n_subtypes(high); i++) {
813 if (low == get_class_subtype(high, i))
815 if (is_subclass_of(low, get_class_subtype(high, i)))
821 /*******************************************************************/
823 /*******************************************************************/
825 /* create a new type struct */
826 INLINE type *new_type_struct (ident *name) {
828 res = new_type(type_struct, NULL, name);
829 res->attr.sa.members = NEW_ARR_F (entity *, 1);
832 type *new_d_type_struct (ident *name, dbg_info* db) {
833 type *res = new_type_struct (name);
834 set_type_dbg_info(res, db);
837 INLINE void free_struct_entities (type *strct) {
839 assert(strct && (strct->type_op == type_struct));
840 for (i = get_struct_n_members(strct)-1; i >= 0; --i)
841 free_entity(get_struct_member(strct, i));
843 INLINE void free_struct_attrs (type *strct) {
844 assert(strct && (strct->type_op == type_struct));
845 DEL_ARR_F(strct->attr.sa.members);
848 /* manipulate private fields of struct */
849 int get_struct_n_members (type *strct) {
850 assert(strct && (strct->type_op == type_struct));
851 return (ARR_LEN (strct->attr.sa.members))-1;
853 void add_struct_member (type *strct, entity *member) {
854 assert(strct && (strct->type_op == type_struct));
855 assert(get_type_tpop(get_entity_type(member)) != type_method);
856 /* @@@ lowerfirm geht nicht durch */
857 ARR_APP1 (entity *, strct->attr.sa.members, member);
859 entity *get_struct_member (type *strct, int pos) {
860 assert(strct && (strct->type_op == type_struct));
861 assert(pos >= 0 && pos < get_struct_n_members(strct));
862 return strct->attr.sa.members[pos+1];
864 void set_struct_member (type *strct, int pos, entity *member) {
865 assert(strct && (strct->type_op == type_struct));
866 assert(pos >= 0 && pos < get_struct_n_members(strct));
867 assert(get_entity_type(member)->type_op != type_method);/* @@@ lowerfirm !!*/
868 strct->attr.sa.members[pos+1] = member;
870 void remove_struct_member(type *strct, entity *member) {
872 assert(strct && (strct->type_op == type_struct));
873 for (i = 1; i < (ARR_LEN (strct->attr.sa.members)); i++)
874 if (strct->attr.sa.members[i] == member) {
875 for(; i < (ARR_LEN (strct->attr.sa.members))-1; i++)
876 strct->attr.sa.members[i] = strct->attr.sa.members[i+1];
877 ARR_SETLEN(entity*, strct->attr.sa.members, ARR_LEN(strct->attr.sa.members) - 1);
883 bool is_struct_type(type *strct) {
885 if (strct->type_op == type_struct) return 1; else return 0;
888 /*******************************************************************/
890 /*******************************************************************/
892 /* Lazy construction of value argument / result representation. */
894 build_value_type(ident *name, int len, type **tps) {
896 type *res = new_type_struct(name);
897 /* Remove type from type list. Must be treated differently than other types. */
898 remove_irp_type_from_list(res);
899 for (i = 0; i < len; i++) {
900 type *elt_type = res; /* use res as default if corresponding type is not yet set. */
901 if (tps[i]) elt_type = tps[i];
902 new_entity(res, mangle_u(name, get_type_ident(elt_type)), elt_type);
907 /* Create a new method type.
908 N_param is the number of parameters, n_res the number of results. */
909 INLINE type *new_type_method (ident *name, int n_param, int n_res) {
911 res = new_type(type_method, mode_P_mach, name);
912 res->state = layout_fixed;
913 assert((get_mode_size_bytes(mode_P_mach) != -1) && "unorthodox modes not implemented");
914 res->size = get_mode_size_bytes(mode_P_mach);
915 res->attr.ma.n_params = n_param;
916 res->attr.ma.param_type = (type **) xmalloc (sizeof (type *) * n_param);
917 res->attr.ma.value_params = NULL;
918 res->attr.ma.n_res = n_res;
919 res->attr.ma.res_type = (type **) xmalloc (sizeof (type *) * n_res);
920 res->attr.ma.value_ress = NULL;
921 res->attr.ma.variadicity = variadicity_non_variadic;
926 type *new_d_type_method (ident *name, int n_param, int n_res, dbg_info* db) {
927 type *res = new_type_method (name, n_param, n_res);
928 set_type_dbg_info(res, db);
932 INLINE void free_method_entities(type *method) {
933 assert(method && (method->type_op == type_method));
935 /* Attention: also frees entities in value parameter subtypes! */
936 INLINE void free_method_attrs(type *method) {
937 assert(method && (method->type_op == type_method));
938 free(method->attr.ma.param_type);
939 free(method->attr.ma.res_type);
940 if (method->attr.ma.value_params) {
941 free_type_entities(method->attr.ma.value_params);
942 free_type(method->attr.ma.value_params);
944 if (method->attr.ma.value_ress) {
945 free_type_entities(method->attr.ma.value_ress);
946 free_type(method->attr.ma.value_ress);
950 /* manipulate private fields of method. */
951 int get_method_n_params (type *method) {
952 assert(method && (method->type_op == type_method));
953 return method->attr.ma.n_params;
955 type *get_method_param_type(type *method, int pos) {
957 assert(method && (method->type_op == type_method));
958 assert(pos >= 0 && pos < get_method_n_params(method));
959 res = method->attr.ma.param_type[pos];
960 assert(res != NULL && "empty method param type");
961 return method->attr.ma.param_type[pos] = skip_tid(res);
963 void set_method_param_type(type *method, int pos, type* tp) {
964 assert(method && (method->type_op == type_method));
965 assert(pos >= 0 && pos < get_method_n_params(method));
966 method->attr.ma.param_type[pos] = tp;
967 /* If information constructed set pass-by-value representation. */
968 if (method->attr.ma.value_params) {
969 assert(get_method_n_params(method) == get_struct_n_members(method->attr.ma.value_params));
970 set_entity_type(get_struct_member(method->attr.ma.value_params, pos), tp);
973 /* Returns an entity that represents the copied value argument. Only necessary
974 for compounds passed by value. */
975 entity *get_method_value_param_ent(type *method, int pos) {
976 assert(method && (method->type_op == type_method));
977 assert(pos >= 0 && pos < get_method_n_params(method));
978 if (!method->attr.ma.value_params)
979 method->attr.ma.value_params
980 = build_value_type(mangle_u(get_type_ident(method), value_params_suffix),
981 get_method_n_params(method), method->attr.ma.param_type);
982 assert((get_entity_type(get_struct_member(method->attr.ma.value_params, pos))
983 != method->attr.ma.value_params)
984 && "param type not yet set");
985 return get_struct_member(method->attr.ma.value_params, pos);
988 type *get_method_value_res_type(type *method) {
989 assert(method && (method->type_op == type_method));
990 return method->attr.ma.value_params;
994 int get_method_n_ress (type *method) {
995 assert(method && (method->type_op == type_method));
996 return method->attr.ma.n_res;
998 type *get_method_res_type(type *method, int pos) {
1000 assert(method && (method->type_op == type_method));
1001 assert(pos >= 0 && pos < get_method_n_ress(method));
1002 res = method->attr.ma.res_type[pos];
1003 assert(res != NULL && "empty method return type");
1004 return method->attr.ma.res_type[pos] = skip_tid(res);
1006 void set_method_res_type(type *method, int pos, type* tp) {
1007 assert(method && (method->type_op == type_method));
1008 assert(pos >= 0 && pos < get_method_n_ress(method));
1009 /* set the result type */
1010 method->attr.ma.res_type[pos] = tp;
1011 /* If information constructed set pass-by-value representation. */
1012 if (method->attr.ma.value_ress) {
1013 assert(get_method_n_ress(method) == get_struct_n_members(method->attr.ma.value_ress));
1014 set_entity_type(get_struct_member(method->attr.ma.value_ress, pos), tp);
1017 /* Returns an entity that represents the copied value result. Only necessary
1018 for compounds passed by value. */
1019 entity *get_method_value_res_ent(type *method, int pos) {
1020 assert(method && (method->type_op == type_method));
1021 assert(pos >= 0 && pos < get_method_n_ress(method));
1022 if (!method->attr.ma.value_ress)
1023 method->attr.ma.value_ress
1024 = build_value_type(mangle_u(get_type_ident(method), value_ress_suffix),
1025 get_method_n_ress(method), method->attr.ma.res_type);
1026 assert((get_entity_type(get_struct_member(method->attr.ma.value_ress, pos)) != method->attr.ma.value_ress)
1027 && "result type not yet set");
1028 return get_struct_member(method->attr.ma.value_ress, pos);
1031 /* Returns the null-terminated name of this variadicity. */
1032 const char *get_variadicity_name(variadicity vari)
1034 #define X(a) case a: return #a
1036 X(variadicity_non_variadic);
1037 X(variadicity_variadic);
1044 variadicity get_method_variadicity(type *method)
1046 assert(method && (method->type_op == type_method));
1047 return method->attr.ma.variadicity;
1050 void set_method_variadicity(type *method, variadicity vari)
1052 assert(method && (method->type_op == type_method));
1053 method->attr.ma.variadicity = vari;
1057 bool is_method_type (type *method) {
1059 if (method->type_op == type_method) return 1; else return 0;
1062 /*******************************************************************/
1064 /*******************************************************************/
1066 /* create a new type uni */
1067 INLINE type *new_type_union (ident *name) {
1069 res = new_type(type_union, NULL, name);
1070 /*res->attr.ua.unioned_type = (type **) xmalloc (sizeof (type *) * n_types);
1071 res->attr.ua.delim_names = (ident **) xmalloc (sizeof (ident *) * n_types); */
1072 res->attr.ua.members = NEW_ARR_F (entity *, 1);
1075 type *new_d_type_union (ident *name, dbg_info* db) {
1076 type *res = new_type_union (name);
1077 set_type_dbg_info(res, db);
1080 INLINE void free_union_entities (type *uni) {
1082 assert(uni && (uni->type_op == type_union));
1083 for (i = get_union_n_members(uni)-1; i >= 0; --i)
1084 free_entity(get_union_member(uni, i));
1086 INLINE void free_union_attrs (type *uni) {
1087 assert(uni && (uni->type_op == type_union));
1088 DEL_ARR_F(uni->attr.ua.members);
1090 /* manipulate private fields of union */
1092 int get_union_n_types (type *uni) {
1093 assert(uni && (uni->type_op == type_union));
1094 return uni->attr.ua.n_types;
1096 type *get_union_unioned_type (type *uni, int pos) {
1097 assert(uni && (uni->type_op == type_union));
1098 assert(pos >= 0 && pos < get_union_n_types(uni));
1099 return uni->attr.ua.unioned_type[pos] = skip_tid(uni->attr.ua.unioned_type[pos]);
1101 void set_union_unioned_type (type *uni, int pos, type *tp) {
1102 assert(uni && (uni->type_op == type_union));
1103 assert(pos >= 0 && pos < get_union_n_types(uni));
1104 uni->attr.ua.unioned_type[pos] = tp;
1106 ident *get_union_delim_nameid (type *uni, int pos) {
1107 assert(uni && (uni->type_op == type_union));
1108 assert(pos >= 0 && pos < get_union_n_types(uni));
1109 return uni->attr.ua.delim_names[pos];
1111 const char *get_union_delim_name (type *uni, int pos) {
1112 assert(uni && (uni->type_op == type_union));
1113 assert(pos >= 0 && pos < get_union_n_types(uni));
1114 return get_id_str(uni->attr.ua.delim_names[pos]);
1116 void set_union_delim_nameid (type *uni, int pos, ident *id) {
1117 assert(uni && (uni->type_op == type_union));
1118 assert(pos >= 0 && pos < get_union_n_types(uni));
1119 uni->attr.ua.delim_names[pos] = id;
1122 int get_union_n_members (type *uni) {
1123 assert(uni && (uni->type_op == type_union));
1124 return (ARR_LEN (uni->attr.ua.members))-1;
1126 void add_union_member (type *uni, entity *member) {
1127 assert(uni && (uni->type_op == type_union));
1128 ARR_APP1 (entity *, uni->attr.ua.members, member);
1130 entity *get_union_member (type *uni, int pos) {
1131 assert(uni && (uni->type_op == type_union));
1132 assert(pos >= 0 && pos < get_union_n_members(uni));
1133 return uni->attr.ua.members[pos+1];
1135 void set_union_member (type *uni, int pos, entity *member) {
1136 assert(uni && (uni->type_op == type_union));
1137 assert(pos >= 0 && pos < get_union_n_members(uni));
1138 uni->attr.ua.members[pos+1] = member;
1140 void remove_union_member(type *uni, entity *member) {
1142 assert(uni && (uni->type_op == type_union));
1143 for (i = 1; i < (ARR_LEN (uni->attr.ua.members)); i++)
1144 if (uni->attr.ua.members[i] == member) {
1145 for(; i < (ARR_LEN (uni->attr.ua.members))-1; i++)
1146 uni->attr.ua.members[i] = uni->attr.ua.members[i+1];
1147 ARR_SETLEN(entity*, uni->attr.ua.members, ARR_LEN(uni->attr.ua.members) - 1);
1153 bool is_union_type (type *uni) {
1155 if (uni->type_op == type_union) return 1; else return 0;
1158 /*******************************************************************/
1160 /*******************************************************************/
1163 /* create a new type array -- set dimension sizes independently */
1164 INLINE type *new_type_array (ident *name, int n_dimensions,
1165 type *element_type) {
1168 ir_graph *rem = current_ir_graph;
1169 assert(!is_method_type(element_type));
1171 res = new_type(type_array, NULL, name);
1172 res->attr.aa.n_dimensions = n_dimensions;
1173 res->attr.aa.lower_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
1174 res->attr.aa.upper_bound = (ir_node **) xmalloc (sizeof (ir_node *) * n_dimensions);
1175 res->attr.aa.order = (int *) xmalloc (sizeof (int) * n_dimensions);
1177 current_ir_graph = get_const_code_irg();
1178 for (i = 0; i < n_dimensions; i++) {
1179 res->attr.aa.lower_bound[i] = new_Unknown(mode_Iu);
1180 res->attr.aa.upper_bound[i] = new_Unknown(mode_Iu);
1181 res->attr.aa.order[i] = i;
1183 current_ir_graph = rem;
1185 res->attr.aa.element_type = element_type;
1186 new_entity(res, mangle_u(name, id_from_str("elem_ent", 8)), element_type);
1190 type *new_d_type_array (ident *name, int n_dimensions,
1191 type *element_type, dbg_info* db) {
1192 type *res = new_type_array (name, n_dimensions, element_type);
1193 set_type_dbg_info(res, db);
1197 INLINE void free_array_entities (type *array) {
1198 assert(array && (array->type_op == type_array));
1200 INLINE void free_array_attrs (type *array) {
1201 assert(array && (array->type_op == type_array));
1202 free(array->attr.aa.lower_bound);
1203 free(array->attr.aa.upper_bound);
1206 /* manipulate private fields of array type */
1207 int get_array_n_dimensions (type *array) {
1208 assert(array && (array->type_op == type_array));
1209 return array->attr.aa.n_dimensions;
1213 set_array_bounds (type *array, int dimension, ir_node * lower_bound,
1214 ir_node * upper_bound) {
1215 assert(array && (array->type_op == type_array));
1216 assert(lower_bound && "lower_bound node may not be NULL.");
1217 assert(upper_bound && "upper_bound node may not be NULL.");
1218 assert(dimension < array->attr.aa.n_dimensions && dimension >= 0);
1219 array->attr.aa.lower_bound[dimension] = lower_bound;
1220 array->attr.aa.upper_bound[dimension] = upper_bound;
1223 set_array_bounds_int (type *array, int dimension, int lower_bound,
1225 ir_graph *rem = current_ir_graph;
1226 current_ir_graph = get_const_code_irg();
1227 set_array_bounds (array, dimension,
1228 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)),
1229 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu )));
1230 current_ir_graph = rem;
1233 set_array_lower_bound (type *array, int dimension, ir_node * lower_bound) {
1234 assert(array && (array->type_op == type_array));
1235 assert(lower_bound && "lower_bound node may not be NULL.");
1236 array->attr.aa.lower_bound[dimension] = lower_bound;
1238 void set_array_lower_bound_int (type *array, int dimension, int lower_bound) {
1239 ir_graph *rem = current_ir_graph;
1240 current_ir_graph = get_const_code_irg();
1241 set_array_lower_bound (array, dimension,
1242 new_Const(mode_Iu, new_tarval_from_long (lower_bound, mode_Iu)));
1243 current_ir_graph = rem;
1246 set_array_upper_bound (type *array, int dimension, ir_node * upper_bound) {
1247 assert(array && (array->type_op == type_array));
1248 assert(upper_bound && "upper_bound node may not be NULL.");
1249 array->attr.aa.upper_bound[dimension] = upper_bound;
1251 void set_array_upper_bound_int (type *array, int dimension, int upper_bound) {
1252 ir_graph *rem = current_ir_graph;
1253 current_ir_graph = get_const_code_irg();
1254 set_array_upper_bound (array, dimension,
1255 new_Const(mode_Iu, new_tarval_from_long (upper_bound, mode_Iu)));
1256 current_ir_graph = rem;
1258 int has_array_lower_bound (type *array, int dimension) {
1259 assert(array && (array->type_op == type_array));
1260 return (get_irn_op(array->attr.aa.lower_bound[dimension]) != op_Unknown);
1262 ir_node * get_array_lower_bound (type *array, int dimension) {
1263 assert(array && (array->type_op == type_array));
1264 return array->attr.aa.lower_bound[dimension];
1266 int has_array_upper_bound (type *array, int dimension) {
1267 assert(array && (array->type_op == type_array));
1268 return (get_irn_op(array->attr.aa.upper_bound[dimension]) != op_Unknown);
1270 ir_node * get_array_upper_bound (type *array, int dimension) {
1271 assert(array && (array->type_op == type_array));
1272 return array->attr.aa.upper_bound[dimension];
1275 void set_array_order (type *array, int dimension, int order) {
1276 assert(array && (array->type_op == type_array));
1277 array->attr.aa.order[dimension] = order;
1279 int get_array_order (type *array, int dimension) {
1280 assert(array && (array->type_op == type_array));
1281 return array->attr.aa.order[dimension];
1284 void set_array_element_type (type *array, type *tp) {
1285 assert(array && (array->type_op == type_array));
1286 assert(!is_method_type(tp));
1287 array->attr.aa.element_type = tp;
1289 type *get_array_element_type (type *array) {
1290 assert(array && (array->type_op == type_array));
1291 return array->attr.aa.element_type = skip_tid(array->attr.aa.element_type);
1294 void set_array_element_entity (type *array, entity *ent) {
1295 assert(array && (array->type_op == type_array));
1296 assert((get_entity_type(ent)->type_op != type_method));
1297 array->attr.aa.element_ent = ent;
1298 array->attr.aa.element_type = get_entity_type(ent);
1300 entity *get_array_element_entity (type *array) {
1301 assert(array && (array->type_op == type_array));
1302 return array->attr.aa.element_ent;
1306 bool is_array_type (type *array) {
1308 if (array->type_op == type_array) return 1; else return 0;
1311 /*******************************************************************/
1312 /** TYPE_ENUMERATION **/
1313 /*******************************************************************/
1315 /* create a new type enumeration -- set the enumerators independently */
1316 INLINE type *new_type_enumeration (ident *name, int n_enums) {
1318 res = new_type(type_enumeration, NULL, name);
1319 res->attr.ea.n_enums = n_enums;
1320 res->attr.ea.enumer = (tarval **)xmalloc(sizeof(res->attr.ea.enumer[0]) * n_enums);
1321 res->attr.ea.enum_nameid = (ident **)xmalloc(sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
1322 memset(res->attr.ea.enumer, 0, sizeof(res->attr.ea.enumer[0]) * n_enums);
1323 memset(res->attr.ea.enum_nameid, 0, sizeof(res->attr.ea.enum_nameid[0]) * n_enums);
1326 type *new_d_type_enumeration (ident *name, int n_enums, dbg_info* db) {
1327 type *res = new_type_enumeration (name, n_enums);
1328 set_type_dbg_info(res, db);
1332 INLINE void free_enumeration_entities(type *enumeration) {
1333 assert(enumeration && (enumeration->type_op == type_enumeration));
1335 INLINE void free_enumeration_attrs(type *enumeration) {
1336 assert(enumeration && (enumeration->type_op == type_enumeration));
1337 free(enumeration->attr.ea.enumer);
1338 free(enumeration->attr.ea.enum_nameid);
1341 /* manipulate fields of enumeration type. */
1342 int get_enumeration_n_enums (type *enumeration) {
1343 assert(enumeration && (enumeration->type_op == type_enumeration));
1344 return enumeration->attr.ea.n_enums;
1346 void set_enumeration_enum (type *enumeration, int pos, tarval *con) {
1347 assert(enumeration && (enumeration->type_op == type_enumeration));
1348 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1349 enumeration->attr.ea.enumer[pos] = con;
1351 tarval *get_enumeration_enum (type *enumeration, int pos) {
1352 assert(enumeration && (enumeration->type_op == type_enumeration));
1353 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1354 return enumeration->attr.ea.enumer[pos];
1356 void set_enumeration_nameid (type *enumeration, int pos, ident *id) {
1357 assert(enumeration && (enumeration->type_op == type_enumeration));
1358 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1359 enumeration->attr.ea.enum_nameid[pos] = id;
1361 ident *get_enumeration_nameid (type *enumeration, int pos) {
1362 assert(enumeration && (enumeration->type_op == type_enumeration));
1363 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1364 return enumeration->attr.ea.enum_nameid[pos];
1366 const char *get_enumeration_name(type *enumeration, int pos) {
1367 assert(enumeration && (enumeration->type_op == type_enumeration));
1368 assert(pos >= 0 && pos < get_enumeration_n_enums(enumeration));
1369 return get_id_str(enumeration->attr.ea.enum_nameid[pos]);
1373 bool is_enumeration_type (type *enumeration) {
1374 assert(enumeration);
1375 if (enumeration->type_op == type_enumeration) return 1; else return 0;
1378 /*******************************************************************/
1379 /** TYPE_POINTER **/
1380 /*******************************************************************/
1382 /* Create a new type pointer */
1383 INLINE type *new_type_pointer_mode (ident *name, type *points_to, ir_mode *ptr_mode) {
1385 assert(mode_is_reference(ptr_mode));
1386 res = new_type(type_pointer, ptr_mode, name);
1387 res->attr.pa.points_to = points_to;
1388 assert((get_mode_size_bytes(res->mode) != -1) && "unorthodox modes not implemented");
1389 res->size = get_mode_size_bytes(res->mode);
1390 res->state = layout_fixed;
1393 type *new_d_type_pointer (ident *name, type *points_to, ir_mode *ptr_mode, dbg_info* db) {
1394 type *res = new_type_pointer_mode (name, points_to, ptr_mode);
1395 set_type_dbg_info(res, db);
1398 INLINE void free_pointer_entities (type *pointer) {
1399 assert(pointer && (pointer->type_op == type_pointer));
1401 INLINE void free_pointer_attrs (type *pointer) {
1402 assert(pointer && (pointer->type_op == type_pointer));
1404 /* manipulate fields of type_pointer */
1405 void set_pointer_points_to_type (type *pointer, type *tp) {
1406 assert(pointer && (pointer->type_op == type_pointer));
1407 pointer->attr.pa.points_to = tp;
1409 type *get_pointer_points_to_type (type *pointer) {
1410 assert(pointer && (pointer->type_op == type_pointer));
1411 return pointer->attr.pa.points_to = skip_tid(pointer->attr.pa.points_to);
1415 bool is_pointer_type (type *pointer) {
1417 if (pointer->type_op == type_pointer) return 1; else return 0;
1420 /* Returns the first pointer type that has as points_to tp.
1421 * Not efficient: O(#types).
1422 * If not found returns unknown_type. */
1423 type *find_pointer_type_to_type (type *tp) {
1425 for (i = 0; i < get_irp_n_types(); ++i) {
1426 type *found = get_irp_type(i);
1427 if (is_pointer_type(found) && get_pointer_points_to_type(found) == tp)
1430 return unknown_type;
1435 /*******************************************************************/
1436 /** TYPE_PRIMITIVE **/
1437 /*******************************************************************/
1439 /* create a new type primitive */
1440 INLINE type *new_type_primitive (ident *name, ir_mode *mode) {
1442 /* @@@ assert( mode_is_data(mode) && (!mode_is_reference(mode))); */
1443 res = new_type(type_primitive, mode, name);
1444 assert((get_mode_size_bytes(mode) != -1) && "unorthodox modes not implemented");
1445 res->size = get_mode_size_bytes(mode);
1446 res->state = layout_fixed;
1449 type *new_d_type_primitive (ident *name, ir_mode *mode, dbg_info* db) {
1450 type *res = new_type_primitive (name, mode);
1451 set_type_dbg_info(res, db);
1454 INLINE void free_primitive_entities (type *primitive) {
1455 assert(primitive && (primitive->type_op == type_primitive));
1457 INLINE void free_primitive_attrs (type *primitive) {
1458 assert(primitive && (primitive->type_op == type_primitive));
1462 bool is_primitive_type (type *primitive) {
1463 assert(primitive && primitive->kind == k_type);
1464 if (primitive->type_op == type_primitive) return 1; else return 0;
1467 /*******************************************************************/
1468 /** common functionality **/
1469 /*******************************************************************/
1472 INLINE int is_atomic_type(type *tp) {
1473 assert(tp && tp->kind == k_type);
1474 return (is_primitive_type(tp) || is_pointer_type(tp) ||
1475 is_enumeration_type(tp));
1479 * Gets the number of elements in a firm compound type.
1481 int get_compound_n_members(type *tp)
1485 if (is_struct_type(tp))
1486 res = get_struct_n_members(tp);
1487 else if (is_class_type(tp))
1488 res = get_class_n_members(tp);
1489 else if (is_union_type(tp))
1490 res = get_union_n_members(tp);
1492 assert(0 && "need struct, union or class for member count");
1498 * Gets the member of a firm compound type at position pos.
1500 entity *get_compound_member(type *tp, int pos)
1504 if (is_struct_type(tp))
1505 res = get_struct_member(tp, pos);
1506 else if (is_class_type(tp))
1507 res = get_class_member(tp, pos);
1508 else if (is_union_type(tp))
1509 res = get_union_member(tp, pos);
1512 assert(0 && "need struct, union or class to get a member");
1520 INLINE int is_compound_type(type *tp) {
1521 assert(tp && tp->kind == k_type);
1522 return (is_class_type(tp) || is_struct_type(tp) ||
1523 is_array_type(tp) || is_union_type(tp));