2 * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief Representation of all program known entities.
23 * @author Martin Trapp, Christian Schaefer, Goetz Lindenmaier, Michael Beck
34 #include "firm_common_t.h"
43 /* All this is needed to build the constant node for methods: */
47 #include "irdump.h" /* for output if errors occur. */
49 #include "callgraph.h" /* for dumping debug output */
52 * An interval initializer.
54 typedef struct interval_initializer interval_initializer;
57 * A value initializer.
59 typedef struct value_initializer value_initializer;
61 struct interval_initializer {
62 int first_index; /**< The first index of the initialized interval. */
63 int last_index; /**< The last index of the initialized interval. */
64 interval_initializer *next; /**< Points to the next interval initializer. */
67 struct value_initializer {
68 ir_entity *ent; /**< The initialized entity. */
69 value_initializer *next; /**< Points to the next value initializer. */
72 typedef union initializer {
73 ir_node *value; /**< The value of the initializer. */
74 ir_node **values; /**< The values of an interval. */
75 value_initializer *val_init; /**< Points the the head of the next value initializers. */
76 interval_initializer *int_init; /**< Points to the head of the next value initializers. */
79 /*-----------------------------------------------------------------*/
81 /*-----------------------------------------------------------------*/
83 ir_entity *unknown_entity = NULL;
85 ir_entity *get_unknown_entity(void) { return unknown_entity; }
87 /** The name of the unknown entity. */
88 #define UNKNOWN_ENTITY_NAME "unknown_entity"
90 /*-----------------------------------------------------------------*/
92 /*-----------------------------------------------------------------*/
95 * Add an entity to it's already set owner type.
97 static INLINE void insert_entity_in_owner(ir_entity *ent) {
98 ir_type *owner = ent->owner;
99 switch (get_type_tpop_code(owner)) {
101 add_class_member(owner, ent);
104 add_struct_member(owner, ent);
107 add_union_member(owner, ent);
110 set_array_element_entity(owner, ent);
114 } /* insert_entity_in_owner */
117 * Creates a new entity. This entity is NOT inserted in the owner type.
119 * @param db debug info for this entity
120 * @param owner the owner type of the new entity
121 * @param name the name of the new entity
122 * @param type the type of the new entity
124 * @return the new created entity
126 static INLINE ir_entity *
127 new_rd_entity(dbg_info *db, ir_type *owner, ident *name, ir_type *type)
132 assert(!id_contains_char(name, ' ') && "entity name should not contain spaces");
134 res = xmalloc(sizeof(*res));
135 memset(res, 0, sizeof(*res));
137 res->kind = k_entity;
143 res->allocation = allocation_automatic;
144 res->visibility = visibility_local;
145 res->volatility = volatility_non_volatile;
146 res->stickyness = stickyness_unsticky;
147 res->peculiarity = peculiarity_existent;
148 res->address_taken = ir_address_taken_unknown;
150 res->compiler_gen = 0;
151 res->backend_marked = 0;
153 res->offset_bit_remainder = 0;
155 res->repr_class = NULL;
157 if (is_Method_type(type)) {
160 rem = current_ir_graph;
161 current_ir_graph = get_const_code_irg();
162 res->value = new_SymConst(sym, symconst_addr_ent);
163 current_ir_graph = rem;
164 res->allocation = allocation_static;
165 res->variability = variability_constant;
166 res->attr.mtd_attr.irg_add_properties = mtp_property_inherited;
167 res->attr.mtd_attr.vtable_number = VTABLE_NUM_NOT_SET;
168 res->attr.mtd_attr.param_access = NULL;
169 res->attr.mtd_attr.param_weight = NULL;
170 res->attr.mtd_attr.irg = NULL;
171 res->attr.mtd_attr.section = section_text;
172 } else if (is_compound_type(type)) {
173 res->variability = variability_uninitialized;
175 res->attr.cmpd_attr.values = NULL;
176 res->attr.cmpd_attr.val_paths = NULL;
178 res->variability = variability_uninitialized;
182 if (is_Class_type(owner)) {
183 res->overwrites = NEW_ARR_F(ir_entity *, 0);
184 res->overwrittenby = NEW_ARR_F(ir_entity *, 0);
186 res->overwrites = NULL;
187 res->overwrittenby = NULL;
191 res->nr = get_irp_new_node_nr();
192 #endif /* DEBUG_libfirm */
195 set_entity_dbg_info(res, db);
198 } /* new_rd_entity */
201 new_d_entity(ir_type *owner, ident *name, ir_type *type, dbg_info *db) {
204 assert(is_compound_type(owner));
205 res = new_rd_entity(db, owner, name, type);
206 /* Remember entity in it's owner. */
207 insert_entity_in_owner(res);
209 hook_new_entity(res);
214 new_entity(ir_type *owner, ident *name, ir_type *type) {
215 return new_d_entity(owner, name, type, NULL);
219 * Free entity attributes.
221 * @param ent the entity
223 static void free_entity_attrs(ir_entity *ent) {
225 if (get_type_tpop(get_entity_owner(ent)) == type_class) {
226 DEL_ARR_F(ent->overwrites); ent->overwrites = NULL;
227 DEL_ARR_F(ent->overwrittenby); ent->overwrittenby = NULL;
229 assert(ent->overwrites == NULL);
230 assert(ent->overwrittenby == NULL);
232 if (is_compound_entity(ent)) {
233 if (ent->attr.cmpd_attr.val_paths) {
234 for (i = get_compound_ent_n_values(ent) - 1; i >= 0; --i)
235 if (ent->attr.cmpd_attr.val_paths[i]) {
236 /* free_compound_graph_path(ent->attr.cmpd_attr.val_paths[i]) ; * @@@ warum nich? */
237 /* Geht nich: wird mehrfach verwendet!!! ==> mehrfach frei gegeben. */
238 /* DEL_ARR_F(ent->attr.cmpd_attr.val_paths); */
240 ent->attr.cmpd_attr.val_paths = NULL;
242 /* if (ent->attr.cmpd_attr.values) DEL_ARR_F(ent->attr.cmpd_attr.values); *//* @@@ warum nich? */
243 ent->attr.cmpd_attr.values = NULL;
244 } else if (is_method_entity(ent)) {
245 if (ent->attr.mtd_attr.param_access) {
246 DEL_ARR_F(ent->attr.mtd_attr.param_access);
247 ent->attr.mtd_attr.param_access = NULL;
249 if (ent->attr.mtd_attr.param_weight) {
250 DEL_ARR_F(ent->attr.mtd_attr.param_weight);
251 ent->attr.mtd_attr.param_weight = NULL;
254 } /* free_entity_attrs */
257 copy_entity_own(ir_entity *old, ir_type *new_owner) {
259 assert(is_entity(old));
260 assert(is_compound_type(new_owner));
262 if (old->owner == new_owner) return old;
263 newe = xmalloc(sizeof(*newe));
264 memcpy(newe, old, sizeof(*newe));
265 newe->owner = new_owner;
266 if (is_Class_type(new_owner)) {
267 newe->overwrites = NEW_ARR_F(ir_entity *, 0);
268 newe->overwrittenby = NEW_ARR_F(ir_entity *, 0);
271 newe->nr = get_irp_new_node_nr();
274 insert_entity_in_owner(newe);
277 } /* copy_entity_own */
280 copy_entity_name(ir_entity *old, ident *new_name) {
282 assert(old && old->kind == k_entity);
284 if (old->name == new_name) return old;
285 newe = xmalloc(sizeof(*newe));
286 memcpy(newe, old, sizeof(*newe));
287 newe->name = new_name;
288 newe->ld_name = NULL;
289 if (is_Class_type(newe->owner)) {
290 newe->overwrites = DUP_ARR_F(ir_entity *, old->overwrites);
291 newe->overwrittenby = DUP_ARR_F(ir_entity *, old->overwrittenby);
294 newe->nr = get_irp_new_node_nr();
297 insert_entity_in_owner(newe);
300 } /* copy_entity_name */
304 free_entity(ir_entity *ent) {
305 assert(ent && ent->kind == k_entity);
306 free_entity_attrs(ent);
311 /* Outputs a unique number for this node */
313 get_entity_nr(const ir_entity *ent) {
314 assert(ent && ent->kind == k_entity);
318 return (long)PTR_TO_INT(ent);
320 } /* get_entity_nr */
323 (get_entity_name)(const ir_entity *ent) {
324 return _get_entity_name(ent);
325 } /* get_entity_name */
328 (get_entity_ident)(const ir_entity *ent) {
329 return _get_entity_ident(ent);
330 } /* get_entity_ident */
333 (set_entity_ident)(ir_entity *ent, ident *id) {
334 _set_entity_ident(ent, id);
335 } /* set_entity_ident */
338 (get_entity_owner)(ir_entity *ent) {
339 return _get_entity_owner(ent);
340 } /* get_entity_owner */
343 set_entity_owner(ir_entity *ent, ir_type *owner) {
344 assert(is_entity(ent));
345 assert(is_compound_type(owner));
347 } /* set_entity_owner */
350 (get_entity_ld_ident)(ir_entity *ent) {
351 return _get_entity_ld_ident(ent);
352 } /* get_entity_ld_ident */
355 (set_entity_ld_ident)(ir_entity *ent, ident *ld_ident) {
356 _set_entity_ld_ident(ent, ld_ident);
357 } /* set_entity_ld_ident */
360 (get_entity_ld_name)(ir_entity *ent) {
361 return _get_entity_ld_name(ent);
362 } /* get_entity_ld_name */
365 (get_entity_type)(ir_entity *ent) {
366 return _get_entity_type(ent);
367 } /* get_entity_type */
370 (set_entity_type)(ir_entity *ent, ir_type *type) {
371 _set_entity_type(ent, type);
372 } /* set_entity_type */
375 (get_entity_allocation)(const ir_entity *ent) {
376 return _get_entity_allocation(ent);
377 } /* get_entity_allocation */
380 (set_entity_allocation)(ir_entity *ent, ir_allocation al) {
381 _set_entity_allocation(ent, al);
382 } /* set_entity_allocation */
384 /* return the name of the visibility */
385 const char *get_allocation_name(ir_allocation all)
387 #define X(a) case a: return #a
389 X(allocation_automatic);
390 X(allocation_parameter);
391 X(allocation_dynamic);
392 X(allocation_static);
393 default: return "BAD VALUE";
396 } /* get_allocation_name */
399 (get_entity_visibility)(const ir_entity *ent) {
400 return _get_entity_visibility(ent);
401 } /* get_entity_visibility */
404 set_entity_visibility(ir_entity *ent, ir_visibility vis) {
405 assert(ent && ent->kind == k_entity);
406 if (vis != visibility_local)
407 assert((ent->allocation == allocation_static) ||
408 (ent->allocation == allocation_automatic));
409 /* @@@ Test that the owner type is not local, but how??
410 && get_class_visibility(get_entity_owner(ent)) != local));*/
411 ent->visibility = vis;
412 } /* set_entity_visibility */
414 /* return the name of the visibility */
415 const char *get_visibility_name(ir_visibility vis)
417 #define X(a) case a: return #a
420 X(visibility_external_visible);
421 X(visibility_external_allocated);
422 default: return "BAD VALUE";
425 } /* get_visibility_name */
428 (get_entity_variability)(const ir_entity *ent) {
429 return _get_entity_variability(ent);
430 } /* get_entity_variability */
433 set_entity_variability(ir_entity *ent, ir_variability var)
435 assert(ent && ent->kind == k_entity);
436 if (var == variability_part_constant)
437 assert(is_Class_type(ent->type) || is_Struct_type(ent->type));
439 if ((is_compound_type(ent->type)) &&
440 (ent->variability == variability_uninitialized) && (var != variability_uninitialized)) {
441 /* Allocate data structures for constant values */
442 ent->attr.cmpd_attr.values = NEW_ARR_F(ir_node *, 0);
443 ent->attr.cmpd_attr.val_paths = NEW_ARR_F(compound_graph_path *, 0);
445 if ((is_atomic_type(ent->type)) &&
446 (ent->variability == variability_uninitialized) && (var != variability_uninitialized)) {
447 /* Set default constant value. */
448 ent->value = new_rd_Unknown(get_const_code_irg(), get_type_mode(ent->type));
451 if ((is_compound_type(ent->type)) &&
452 (var == variability_uninitialized) && (ent->variability != variability_uninitialized)) {
453 /* Free data structures for constant values */
454 DEL_ARR_F(ent->attr.cmpd_attr.values); ent->attr.cmpd_attr.values = NULL;
455 DEL_ARR_F(ent->attr.cmpd_attr.val_paths); ent->attr.cmpd_attr.val_paths = NULL;
457 ent->variability = var;
458 } /* set_entity_variability */
460 /* return the name of the variability */
461 const char *get_variability_name(ir_variability var)
463 #define X(a) case a: return #a
465 X(variability_uninitialized);
466 X(variability_initialized);
467 X(variability_part_constant);
468 X(variability_constant);
469 default: return "BAD VALUE";
472 } /* get_variability_name */
475 (get_entity_volatility)(const ir_entity *ent) {
476 return _get_entity_volatility(ent);
477 } /* get_entity_volatility */
480 (set_entity_volatility)(ir_entity *ent, ir_volatility vol) {
481 _set_entity_volatility(ent, vol);
482 } /* set_entity_volatility */
484 /* Return the name of the volatility. */
485 const char *get_volatility_name(ir_volatility var)
487 #define X(a) case a: return #a
489 X(volatility_non_volatile);
490 X(volatility_is_volatile);
491 default: return "BAD VALUE";
494 } /* get_volatility_name */
496 /* Return the name of the alignment. */
497 const char *get_align_name(ir_align a)
499 #define X(a) case a: return #a
501 X(align_non_aligned);
503 default: return "BAD VALUE";
506 } /* get_align_name */
509 (get_entity_peculiarity)(const ir_entity *ent) {
510 return _get_entity_peculiarity(ent);
511 } /* get_entity_peculiarity */
514 (set_entity_peculiarity)(ir_entity *ent, ir_peculiarity pec) {
515 _set_entity_peculiarity(ent, pec);
516 } /* set_entity_peculiarity */
518 /* Checks if an entity cannot be overridden anymore. */
519 int (is_entity_final)(const ir_entity *ent) {
520 return _is_entity_final(ent);
521 } /* is_entity_final */
523 /* Sets/resets the final flag of an entity. */
524 void (set_entity_final)(ir_entity *ent, int final) {
525 _set_entity_final(ent, final);
526 } /* set_entity_final */
528 /* Checks if an entity is compiler generated */
529 int (is_entity_compiler_generated)(const ir_entity *ent) {
530 return _is_entity_compiler_generated(ent);
531 } /* is_entity_compiler_generated */
533 /* Sets/resets the compiler generated flag */
534 void (set_entity_compiler_generated)(ir_entity *ent, int flag) {
535 _set_entity_compiler_generated(ent, flag);
536 } /* set_entity_compiler_generated */
538 /* Checks if an entity is marked by the backend */
539 int (is_entity_backend_marked)(const ir_entity *ent) {
540 return _is_entity_backend_marked(ent);
541 } /* is_entity_backend_marked */
543 /* Sets/resets the compiler generated flag */
544 void (set_entity_backend_marked)(ir_entity *ent, int flag) {
545 _set_entity_backend_marked(ent, flag);
546 } /* set_entity_backend_marked */
548 /* Checks if the address of an entity was taken. */
549 ir_address_taken_state (get_entity_address_taken)(const ir_entity *ent) {
550 return _get_entity_address_taken(ent);
551 } /* is_entity_address_taken */
553 /* Sets/resets the address taken flag. */
554 void (set_entity_address_taken)(ir_entity *ent, ir_address_taken_state flag) {
555 _set_entity_address_taken(ent, flag);
556 } /* set_entity_address_taken */
558 /* Return the name of the address_taken state. */
559 const char *get_address_taken_state_name(ir_address_taken_state state) {
560 #define X(a) case a: return #a
562 X(ir_address_not_taken);
563 X(ir_address_taken_unknown);
565 default: return "BAD VALUE";
568 } /* get_address_taken_state_name */
570 /* Get the entity's stickyness */
572 (get_entity_stickyness)(const ir_entity *ent) {
573 return _get_entity_stickyness(ent);
574 } /* get_entity_stickyness */
576 /* Set the entity's stickyness */
578 (set_entity_stickyness)(ir_entity *ent, ir_stickyness stickyness) {
579 _set_entity_stickyness(ent, stickyness);
580 } /* set_entity_stickyness */
582 /* Set has no effect for existent entities of type method. */
584 get_atomic_ent_value(ir_entity *ent)
586 assert(ent && is_atomic_entity(ent));
587 assert(ent->variability != variability_uninitialized);
588 return skip_Id(ent->value);
589 } /* get_atomic_ent_value */
592 set_atomic_ent_value(ir_entity *ent, ir_node *val) {
593 assert(is_atomic_entity(ent) && (ent->variability != variability_uninitialized));
594 if (is_Method_type(ent->type) && (ent->peculiarity == peculiarity_existent))
597 } /* set_atomic_ent_value */
599 /* Returns true if the the node is representable as code on
601 int is_irn_const_expression(ir_node *n) {
604 /* we are in danger iff an exception will arise. TODO: be more precisely,
605 * for instance Div. will NOT rise if divisor != 0
607 if (is_binop(n) && !is_fragile_op(n))
608 return is_irn_const_expression(get_binop_left(n)) && is_irn_const_expression(get_binop_right(n));
611 switch (get_irn_opcode(n)) {
618 return is_irn_const_expression(get_irn_n(n, 0));
623 } /* is_irn_const_expression */
626 * Copies a firm subgraph that complies to the restrictions for
627 * constant expressions to current_block in current_ir_graph.
629 ir_node *copy_const_value(dbg_info *dbg, ir_node *n) {
633 /* @@@ GL I think we should implement this using the routines from irgopt for
634 dead node elimination/inlineing. */
637 switch (get_irn_opcode(n)) {
639 nn = new_d_Const_type(dbg, m, get_Const_tarval(n), get_Const_type(n));
642 nn = new_d_SymConst_type(dbg, get_SymConst_symbol(n), get_SymConst_kind(n),
643 get_SymConst_value_type(n));
646 nn = new_d_Add(dbg, copy_const_value(dbg, get_Add_left(n)),
647 copy_const_value(dbg, get_Add_right(n)), m); break;
649 nn = new_d_Sub(dbg, copy_const_value(dbg, get_Sub_left(n)),
650 copy_const_value(dbg, get_Sub_right(n)), m); break;
652 nn = new_d_Mul(dbg, copy_const_value(dbg, get_Mul_left(n)),
653 copy_const_value(dbg, get_Mul_right(n)), m); break;
655 nn = new_d_And(dbg, copy_const_value(dbg, get_And_left(n)),
656 copy_const_value(dbg, get_And_right(n)), m); break;
658 nn = new_d_Or(dbg, copy_const_value(dbg, get_Or_left(n)),
659 copy_const_value(dbg, get_Or_right(n)), m); break;
661 nn = new_d_Eor(dbg, copy_const_value(dbg, get_Eor_left(n)),
662 copy_const_value(dbg, get_Eor_right(n)), m); break;
664 nn = new_d_Cast(dbg, copy_const_value(dbg, get_Cast_op(n)), get_Cast_type(n)); break;
666 nn = new_d_Conv(dbg, copy_const_value(dbg, get_Conv_op(n)), m); break;
668 nn = new_d_Unknown(m); break;
670 assert(0 && "opcode invalid or not implemented");
675 } /* copy_const_value */
677 /* Creates a new compound graph path. */
678 compound_graph_path *
679 new_compound_graph_path(ir_type *tp, int length) {
680 compound_graph_path *res;
682 assert(is_compound_type(tp));
685 res = xmalloc(sizeof(*res) + (length-1) * sizeof(res->list[0]));
686 memset(res, 0, sizeof(*res) + (length-1) * sizeof(res->list[0]));
687 res->kind = k_ir_compound_graph_path;
692 } /* new_compound_graph_path */
694 /* Frees an graph path object */
695 void free_compound_graph_path (compound_graph_path *gr) {
696 assert(gr && is_compound_graph_path(gr));
699 } /* free_compound_graph_path */
701 /* Returns non-zero if an object is a compound graph path */
702 int is_compound_graph_path(const void *thing) {
703 return (get_kind(thing) == k_ir_compound_graph_path);
704 } /* is_compound_graph_path */
706 /* Checks whether the path up to pos is correct. If the path contains a NULL,
707 * assumes the path is not complete and returns 'true'. */
708 int is_proper_compound_graph_path(compound_graph_path *gr, int pos) {
711 ir_type *owner = gr->tp;
713 for (i = 0; i <= pos; i++) {
714 node = get_compound_graph_path_node(gr, i);
716 /* Path not yet complete. */
718 if (get_entity_owner(node) != owner)
720 owner = get_entity_type(node);
722 if (pos == get_compound_graph_path_length(gr))
723 if (!is_atomic_type(owner))
726 } /* is_proper_compound_graph_path */
728 /* Returns the length of a graph path */
729 int get_compound_graph_path_length(const compound_graph_path *gr) {
730 assert(gr && is_compound_graph_path(gr));
732 } /* get_compound_graph_path_length */
735 get_compound_graph_path_node(const compound_graph_path *gr, int pos) {
736 assert(gr && is_compound_graph_path(gr));
737 assert(pos >= 0 && pos < gr->len);
738 return gr->list[pos].node;
739 } /* get_compound_graph_path_node */
742 set_compound_graph_path_node(compound_graph_path *gr, int pos, ir_entity *node) {
743 assert(gr && is_compound_graph_path(gr));
744 assert(pos >= 0 && pos < gr->len);
745 assert(is_entity(node));
746 gr->list[pos].node = node;
747 assert(is_proper_compound_graph_path(gr, pos));
748 } /* set_compound_graph_path_node */
751 get_compound_graph_path_array_index(const compound_graph_path *gr, int pos) {
752 assert(gr && is_compound_graph_path(gr));
753 assert(pos >= 0 && pos < gr->len);
754 return gr->list[pos].index;
755 } /* get_compound_graph_path_array_index */
758 set_compound_graph_path_array_index(compound_graph_path *gr, int pos, int index) {
759 assert(gr && is_compound_graph_path(gr));
760 assert(pos >= 0 && pos < gr->len);
761 gr->list[pos].index = index;
762 } /* set_compound_graph_path_array_index */
764 /* A value of a compound entity is a pair of value and the corresponding path to a member of
767 add_compound_ent_value_w_path(ir_entity *ent, ir_node *val, compound_graph_path *path) {
768 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
769 assert(is_compound_graph_path(path));
770 ARR_APP1(ir_node *, ent->attr.cmpd_attr.values, val);
771 ARR_APP1(compound_graph_path *, ent->attr.cmpd_attr.val_paths, path);
772 } /* add_compound_ent_value_w_path */
775 set_compound_ent_value_w_path(ir_entity *ent, ir_node *val, compound_graph_path *path, int pos) {
776 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
777 assert(is_compound_graph_path(path));
778 assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.values));
779 ent->attr.cmpd_attr.values[pos] = val;
780 ent->attr.cmpd_attr.val_paths[pos] = path;
781 } /* set_compound_ent_value_w_path */
784 get_compound_ent_n_values(ir_entity *ent) {
785 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
786 return ARR_LEN(ent->attr.cmpd_attr.values);
787 } /* get_compound_ent_n_values */
790 get_compound_ent_value(ir_entity *ent, int pos) {
791 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
792 assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.values));
793 return ent->attr.cmpd_attr.values[pos];
794 } /* get_compound_ent_value */
796 compound_graph_path *
797 get_compound_ent_value_path(ir_entity *ent, int pos) {
798 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
799 assert(0 <= pos && pos < ARR_LEN(ent->attr.cmpd_attr.val_paths));
800 return ent->attr.cmpd_attr.val_paths[pos];
801 } /* get_compound_ent_value_path */
804 * Returns non-zero, if two compound_graph_pathes are equal
806 * @param path1 the first path
807 * @param visited_indices
808 * @param path2 the second path
810 static int equal_paths(compound_graph_path *path1, int *visited_indices, compound_graph_path *path2) {
812 int len1 = get_compound_graph_path_length(path1);
813 int len2 = get_compound_graph_path_length(path2);
815 if (len2 != len1) return 0;
817 for (i = 0; i < len1; i++) {
819 ir_entity *node1 = get_compound_graph_path_node(path1, i);
820 ir_entity *node2 = get_compound_graph_path_node(path2, i);
822 if (node1 != node2) return 0;
824 /* FIXME: Strange code. What is it good for? */
825 tp = get_entity_owner(node1);
826 if (is_Array_type(tp)) {
829 /* Compute the index of this node. */
830 assert(get_array_n_dimensions(tp) == 1 && "multidim not implemented");
832 low = get_array_lower_bound_int(tp, 0);
833 if (low + visited_indices[i] < get_compound_graph_path_array_index(path2, i)) {
834 visited_indices[i]++;
837 assert(low + visited_indices[i] == get_compound_graph_path_array_index(path2, i));
844 * Returns the position of a value with the given path.
845 * The path must contain array indices for all array element entities.
847 * @todo This implementation is very slow (O(number of initializers^2) and should
848 * be replaced when the new tree oriented
849 * value representation is finally implemented.
851 static int get_compound_ent_pos_by_path(ir_entity *ent, compound_graph_path *path) {
852 int i, n_paths = get_compound_ent_n_values(ent);
853 int *visited_indices;
854 int path_len = get_compound_graph_path_length(path);
856 NEW_ARR_A(int *, visited_indices, path_len);
857 memset(visited_indices, 0, sizeof(*visited_indices) * path_len);
858 for (i = 0; i < n_paths; i ++) {
859 if (equal_paths(get_compound_ent_value_path(ent, i), visited_indices, path))
866 printf(">>>>>>>>>>>>>>>>>>>>>>>>>>>>\n");
867 printf("Entity %s : ", get_entity_name(ent));
868 for (j = 0; j < get_compound_graph_path_length(path); ++j) {
869 ir_entity *node = get_compound_graph_path_node(path, j);
870 printf("%s", get_entity_name(node));
871 if (is_Array_type(get_entity_owner(node)))
872 printf("[%d]", get_compound_graph_path_array_index(path, j));
874 printf(">>>>>>>>>>>>>>>>>>>>>>>>>>>>\n");
878 assert(0 && "path not found");
880 } /* get_compound_ent_pos_by_path */
882 /* Returns a constant value given the access path.
883 * The path must contain array indices for all array element entities. */
884 ir_node *get_compound_ent_value_by_path(ir_entity *ent, compound_graph_path *path) {
885 return get_compound_ent_value(ent, get_compound_ent_pos_by_path(ent, path));
886 } /* get_compound_ent_value_by_path */
890 remove_compound_ent_value(ir_entity *ent, ir_entity *value_ent) {
892 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
893 for (i = 0; i < (ARR_LEN(ent->attr.cmpd_attr.val_paths)); ++i) {
894 compound_graph_path *path = ent->attr.cmpd_attr.val_paths[i];
895 if (path->list[path->len-1].node == value_ent) {
896 for (; i < (ARR_LEN(ent->attr.cmpd_attr.val_paths))-1; ++i) {
897 ent->attr.cmpd_attr.val_paths[i] = ent->attr.cmpd_attr.val_paths[i+1];
898 ent->attr.cmpd_attr.values[i] = ent->attr.cmpd_attr.values[i+1];
900 ARR_SETLEN(ir_entity*, ent->attr.cmpd_attr.val_paths, ARR_LEN(ent->attr.cmpd_attr.val_paths) - 1);
901 ARR_SETLEN(ir_node*, ent->attr.cmpd_attr.values, ARR_LEN(ent->attr.cmpd_attr.values) - 1);
905 } /* remove_compound_ent_value */
908 add_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member) {
909 compound_graph_path *path;
910 ir_type *owner_tp = get_entity_owner(member);
911 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
912 path = new_compound_graph_path(get_entity_type(ent), 1);
913 path->list[0].node = member;
914 if (is_Array_type(owner_tp)) {
918 assert(get_array_n_dimensions(owner_tp) == 1 && has_array_lower_bound(owner_tp, 0));
919 max = get_array_lower_bound_int(owner_tp, 0) -1;
920 for (i = 0, n = get_compound_ent_n_values(ent); i < n; ++i) {
921 int index = get_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0);
926 path->list[0].index = max + 1;
928 add_compound_ent_value_w_path(ent, val, path);
929 } /* add_compound_ent_value */
933 get_compound_ent_value_member(ir_entity *ent, int pos) {
934 compound_graph_path *path;
935 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
936 path = get_compound_ent_value_path(ent, pos);
938 return get_compound_graph_path_node(path, get_compound_graph_path_length(path)-1);
939 } /* get_compound_ent_value_member */
942 set_compound_ent_value(ir_entity *ent, ir_node *val, ir_entity *member, int pos) {
943 compound_graph_path *path;
944 assert(is_compound_entity(ent) && (ent->variability != variability_uninitialized));
945 path = get_compound_ent_value_path(ent, pos);
946 set_compound_graph_path_node(path, 0, member);
947 set_compound_ent_value_w_path(ent, val, path, pos);
948 } /* set_compound_ent_value */
951 set_array_entity_values(ir_entity *ent, tarval **values, int num_vals) {
953 ir_graph *rem = current_ir_graph;
954 ir_type *arrtp = get_entity_type(ent);
956 ir_type *elttp = get_array_element_type(arrtp);
958 assert(is_Array_type(arrtp));
959 assert(get_array_n_dimensions(arrtp) == 1);
960 /* One bound is sufficient, the number of constant fields makes the
962 assert(get_array_lower_bound (arrtp, 0) || get_array_upper_bound (arrtp, 0));
963 assert(get_entity_variability(ent) != variability_uninitialized);
964 current_ir_graph = get_const_code_irg();
966 for (i = 0; i < num_vals; i++) {
967 val = new_Const_type(values[i], elttp);
968 add_compound_ent_value(ent, val, get_array_element_entity(arrtp));
969 set_compound_graph_path_array_index(get_compound_ent_value_path(ent, i), 0, i);
971 current_ir_graph = rem;
972 } /* set_array_entity_values */
974 /* Return the overall offset of value at position pos in bytes. */
975 int get_compound_ent_value_offset_bytes(ir_entity *ent, int pos) {
976 compound_graph_path *path;
981 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
983 path = get_compound_ent_value_path(ent, pos);
984 path_len = get_compound_graph_path_length(path);
987 for (i = 0; i < path_len; ++i) {
988 ir_entity *node = get_compound_graph_path_node(path, i);
989 ir_type *node_tp = get_entity_type(node);
991 if (is_Array_type(curr_tp)) {
992 int size = get_type_size_bits(node_tp);
993 int align = get_type_alignment_bits(node_tp);
997 if(size % align > 0) {
998 size += align - (size % align);
1000 assert(size % 8 == 0);
1002 idx = get_compound_graph_path_array_index(path, i);
1004 offset += size * idx;
1006 offset += get_entity_offset(node);
1012 } /* get_compound_ent_value_offset_bytes */
1014 /* Return the offset in bits from the last byte address. */
1015 int get_compound_ent_value_offset_bit_remainder(ir_entity *ent, int pos) {
1016 compound_graph_path *path;
1018 ir_entity *last_node;
1020 assert(get_type_state(get_entity_type(ent)) == layout_fixed);
1022 path = get_compound_ent_value_path(ent, pos);
1023 path_len = get_compound_graph_path_length(path);
1024 last_node = get_compound_graph_path_node(path, path_len - 1);
1026 return get_entity_offset_bits_remainder(last_node);
1027 } /* get_compound_ent_value_offset_bit_remainder */
1030 (get_entity_offset)(const ir_entity *ent) {
1031 return _get_entity_offset(ent);
1032 } /* get_entity_offset */
1035 (set_entity_offset)(ir_entity *ent, int offset) {
1036 _set_entity_offset(ent, offset);
1037 } /* set_entity_offset */
1040 (get_entity_offset_bits_remainder)(const ir_entity *ent) {
1041 return _get_entity_offset_bits_remainder(ent);
1042 } /* get_entity_offset_bits_remainder */
1045 (set_entity_offset_bits_remainder)(ir_entity *ent, unsigned char offset) {
1046 _set_entity_offset_bits_remainder(ent, offset);
1047 } /* set_entity_offset_bits_remainder */
1050 add_entity_overwrites(ir_entity *ent, ir_entity *overwritten) {
1052 ir_type *owner = get_entity_owner(ent);
1053 ir_type *ovw_ovner = get_entity_owner(overwritten);
1054 assert(is_Class_type(owner));
1055 assert(is_Class_type(ovw_ovner));
1056 assert(! is_class_final(ovw_ovner));
1058 ARR_APP1(ir_entity *, ent->overwrites, overwritten);
1059 ARR_APP1(ir_entity *, overwritten->overwrittenby, ent);
1060 } /* add_entity_overwrites */
1063 get_entity_n_overwrites(ir_entity *ent) {
1064 assert(is_Class_type(get_entity_owner(ent)));
1065 return (ARR_LEN(ent->overwrites));
1066 } /* get_entity_n_overwrites */
1069 get_entity_overwrites_index(ir_entity *ent, ir_entity *overwritten) {
1071 assert(is_Class_type(get_entity_owner(ent)));
1072 for (i = 0; i < get_entity_n_overwrites(ent); i++)
1073 if (get_entity_overwrites(ent, i) == overwritten)
1076 } /* get_entity_overwrites_index */
1079 get_entity_overwrites(ir_entity *ent, int pos) {
1080 assert(is_Class_type(get_entity_owner(ent)));
1081 assert(pos < get_entity_n_overwrites(ent));
1082 return ent->overwrites[pos];
1083 } /* get_entity_overwrites */
1086 set_entity_overwrites(ir_entity *ent, int pos, ir_entity *overwritten) {
1087 assert(is_Class_type(get_entity_owner(ent)));
1088 assert(pos < get_entity_n_overwrites(ent));
1089 ent->overwrites[pos] = overwritten;
1090 } /* set_entity_overwrites */
1093 remove_entity_overwrites(ir_entity *ent, ir_entity *overwritten) {
1095 assert(is_Class_type(get_entity_owner(ent)));
1096 for (i = 0; i < (ARR_LEN (ent->overwrites)); i++)
1097 if (ent->overwrites[i] == overwritten) {
1098 for(; i < (ARR_LEN (ent->overwrites))-1; i++)
1099 ent->overwrites[i] = ent->overwrites[i+1];
1100 ARR_SETLEN(ir_entity*, ent->overwrites, ARR_LEN(ent->overwrites) - 1);
1103 } /* remove_entity_overwrites */
1106 add_entity_overwrittenby(ir_entity *ent, ir_entity *overwrites) {
1107 add_entity_overwrites(overwrites, ent);
1108 } /* add_entity_overwrittenby */
1111 get_entity_n_overwrittenby(ir_entity *ent) {
1112 assert(is_Class_type(get_entity_owner(ent)));
1113 return (ARR_LEN (ent->overwrittenby));
1114 } /* get_entity_n_overwrittenby */
1117 get_entity_overwrittenby_index(ir_entity *ent, ir_entity *overwrites) {
1119 assert(is_Class_type(get_entity_owner(ent)));
1120 for (i = 0; i < get_entity_n_overwrittenby(ent); i++)
1121 if (get_entity_overwrittenby(ent, i) == overwrites)
1124 } /* get_entity_overwrittenby_index */
1127 get_entity_overwrittenby(ir_entity *ent, int pos) {
1128 assert(is_Class_type(get_entity_owner(ent)));
1129 assert(pos < get_entity_n_overwrittenby(ent));
1130 return ent->overwrittenby[pos];
1131 } /* get_entity_overwrittenby */
1134 set_entity_overwrittenby(ir_entity *ent, int pos, ir_entity *overwrites) {
1135 assert(is_Class_type(get_entity_owner(ent)));
1136 assert(pos < get_entity_n_overwrittenby(ent));
1137 ent->overwrittenby[pos] = overwrites;
1138 } /* set_entity_overwrittenby */
1140 void remove_entity_overwrittenby(ir_entity *ent, ir_entity *overwrites) {
1142 assert(is_Class_type(get_entity_owner(ent)));
1143 for (i = 0; i < (ARR_LEN (ent->overwrittenby)); i++)
1144 if (ent->overwrittenby[i] == overwrites) {
1145 for(; i < (ARR_LEN (ent->overwrittenby))-1; i++)
1146 ent->overwrittenby[i] = ent->overwrittenby[i+1];
1147 ARR_SETLEN(ir_entity*, ent->overwrittenby, ARR_LEN(ent->overwrittenby) - 1);
1150 } /* remove_entity_overwrittenby */
1152 /* A link to store intermediate information */
1154 (get_entity_link)(const ir_entity *ent) {
1155 return _get_entity_link(ent);
1156 } /* get_entity_link */
1159 (set_entity_link)(ir_entity *ent, void *l) {
1160 _set_entity_link(ent, l);
1161 } /* set_entity_link */
1164 (get_entity_irg)(const ir_entity *ent) {
1165 return _get_entity_irg(ent);
1166 } /* get_entity_irg */
1169 set_entity_irg(ir_entity *ent, ir_graph *irg) {
1170 assert(is_method_entity(ent));
1171 /* Wie kann man die Referenz auf einen IRG löschen, z.B. wenn die
1172 * Methode selbst nicht mehr aufgerufen werden kann, die Entität
1173 * aber erhalten bleiben soll? Wandle die Entitaet in description oder
1176 assert((irg && ent->peculiarity == peculiarity_existent) ||
1177 (!irg && (ent->peculiarity == peculiarity_existent)
1178 && (ent -> visibility == visibility_external_allocated)) ||
1179 (!irg && ent->peculiarity == peculiarity_description) ||
1180 (!irg && ent->peculiarity == peculiarity_inherited));
1181 ent->attr.mtd_attr.irg = irg;
1182 } /* set_entity_irg */
1184 unsigned get_entity_vtable_number(const ir_entity *ent) {
1185 assert(is_method_entity((ir_entity *)ent));
1186 return ent->attr.mtd_attr.vtable_number;
1187 } /* get_entity_vtable_number */
1189 void set_entity_vtable_number(ir_entity *ent, unsigned vtable_number) {
1190 assert(is_method_entity(ent));
1191 ent->attr.mtd_attr.vtable_number = vtable_number;
1192 } /* set_entity_vtable_number */
1194 /* Returns the section of a method. */
1195 ir_img_section get_method_img_section(const ir_entity *ent) {
1196 assert(is_method_entity((ir_entity *)ent));
1197 return ent->attr.mtd_attr.section;
1198 } /* get_method_img_section */
1200 /* Sets the section of a method. */
1201 void set_method_img_section(ir_entity *ent, ir_img_section section) {
1202 assert(is_method_entity(ent));
1203 ent->attr.mtd_attr.section = section;
1204 } /* set_method_img_section */
1207 (is_entity)(const void *thing) {
1208 return _is_entity(thing);
1211 int is_atomic_entity(ir_entity *ent) {
1212 ir_type *t = get_entity_type(ent);
1213 const tp_op *op = get_type_tpop(t);
1214 return (op == type_primitive || op == type_pointer ||
1215 op == type_enumeration || op == type_method);
1216 } /* is_atomic_entity */
1218 int is_compound_entity(ir_entity *ent) {
1219 ir_type *t = get_entity_type(ent);
1220 const tp_op *op = get_type_tpop(t);
1221 return (op == type_class || op == type_struct ||
1222 op == type_array || op == type_union);
1223 } /* is_compound_entity */
1225 int is_method_entity(ir_entity *ent) {
1226 ir_type *t = get_entity_type(ent);
1227 return is_Method_type(t);
1228 } /* is_method_entity */
1231 * @todo not implemented!!! */
1232 int equal_entity(ir_entity *ent1, ir_entity *ent2) {
1235 fprintf(stderr, " calling unimplemented equal entity!!! \n");
1237 } /* equal_entity */
1240 unsigned long (get_entity_visited)(ir_entity *ent) {
1241 return _get_entity_visited(ent);
1242 } /* get_entity_visited */
1244 void (set_entity_visited)(ir_entity *ent, unsigned long num) {
1245 _set_entity_visited(ent, num);
1246 } /* set_entity_visited */
1248 /* Sets visited field in ir_entity to entity_visited. */
1249 void (mark_entity_visited)(ir_entity *ent) {
1250 _mark_entity_visited(ent);
1251 } /* mark_entity_visited */
1253 int (entity_visited)(ir_entity *ent) {
1254 return _entity_visited(ent);
1255 } /* entity_visited */
1257 int (entity_not_visited)(ir_entity *ent) {
1258 return _entity_not_visited(ent);
1259 } /* entity_not_visited */
1261 /* Returns the mask of the additional entity properties. */
1262 unsigned get_entity_additional_properties(ir_entity *ent) {
1265 assert(is_method_entity(ent));
1267 /* first check, if the graph has additional properties */
1268 irg = get_entity_irg(ent);
1271 return get_irg_additional_properties(irg);
1273 if (ent->attr.mtd_attr.irg_add_properties & mtp_property_inherited)
1274 return get_method_additional_properties(get_entity_type(ent));
1276 return ent->attr.mtd_attr.irg_add_properties;
1277 } /* get_entity_additional_properties */
1279 /* Sets the mask of the additional graph properties. */
1280 void set_entity_additional_properties(ir_entity *ent, unsigned property_mask)
1284 assert(is_method_entity(ent));
1286 /* first check, if the graph exists */
1287 irg = get_entity_irg(ent);
1289 set_irg_additional_properties(irg, property_mask);
1291 /* do not allow to set the mtp_property_inherited flag or
1292 * the automatic inheritance of flags will not work */
1293 ent->attr.mtd_attr.irg_add_properties = property_mask & ~mtp_property_inherited;
1295 } /* set_entity_additional_properties */
1297 /* Sets one additional graph property. */
1298 void set_entity_additional_property(ir_entity *ent, mtp_additional_property flag)
1302 assert(is_method_entity(ent));
1304 /* first check, if the graph exists */
1305 irg = get_entity_irg(ent);
1307 set_irg_additional_property(irg, flag);
1309 unsigned mask = ent->attr.mtd_attr.irg_add_properties;
1311 if (mask & mtp_property_inherited)
1312 mask = get_method_additional_properties(get_entity_type(ent));
1314 /* do not allow to set the mtp_property_inherited flag or
1315 * the automatic inheritance of flags will not work */
1316 ent->attr.mtd_attr.irg_add_properties = mask | (flag & ~mtp_property_inherited);
1318 } /* set_entity_additional_property */
1320 /* Returns the class type that this type info entity represents or NULL
1321 if ent is no type info entity. */
1322 ir_type *(get_entity_repr_class)(const ir_entity *ent) {
1323 return _get_entity_repr_class(ent);
1324 } /* get_entity_repr_class */
1326 dbg_info *(get_entity_dbg_info)(const ir_entity *ent) {
1327 return _get_entity_dbg_info(ent);
1328 } /* get_entity_dbg_info */
1330 void (set_entity_dbg_info)(ir_entity *ent, dbg_info *db) {
1331 _set_entity_dbg_info(ent, db);
1332 } /* set_entity_dbg_info */
1334 /* Initialize entity module. */
1335 void firm_init_entity(void)
1337 symconst_symbol sym;
1339 assert(firm_unknown_type && "Call init_type() before firm_init_entity()!");
1340 assert(!unknown_entity && "Call firm_init_entity() only once!");
1342 unknown_entity = new_rd_entity(NULL, firm_unknown_type, new_id_from_str(UNKNOWN_ENTITY_NAME), firm_unknown_type);
1343 set_entity_visibility(unknown_entity, visibility_external_allocated);
1344 set_entity_ld_ident(unknown_entity, get_entity_ident(unknown_entity));
1346 current_ir_graph = get_const_code_irg();
1347 sym.entity_p = unknown_entity;
1348 unknown_entity->value = new_SymConst(sym, symconst_addr_ent);
1349 } /* firm_init_entity */