3 * File name: ir/ana/cgana.c
4 * Purpose: Intraprozedural analyses to estimate the call graph.
5 * Author: Hubert Schmid
9 * Copyright: (c) 1999-2003 Universität Karlsruhe
10 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
15 * Interprocedural analysis to estimate the calling relation.
17 * This analysis computes all entities representing methods that
18 * can be called at a Call node. Further it computes a set of
19 * methods that are 'free', i.e., their adress is handled by
20 * the program directly, or they are visible external.
44 #include "dbginfo_t.h"
45 #include "iropt_dbg.h"
57 /* Eindeutige Adresse zur Markierung von besuchten Knoten und zur
58 * Darstellung der unbekannten Methode. */
59 static void *MARK = &MARK;
61 static eset *entities = NULL;
63 /*--------------------------------------------------------------------------*/
65 /*--------------------------------------------------------------------------*/
68 /*--------------------------------------------------------------------------*/
69 /* Initialize datastructures, remove unwanted constructs, optimize */
70 /* call target computations. */
71 /*--------------------------------------------------------------------------*/
73 /** Returns the entity that contains the implementation of the inherited
74 * entity if available, else returns the entity passed. */
75 static entity *get_inherited_methods_implementation(entity *inh_meth) {
76 assert(get_atomic_ent_value(inh_meth) && "constant entity without value");
77 assert((get_irn_op(get_atomic_ent_value(inh_meth)) == op_SymConst) &&
78 (get_SymConst_kind(get_atomic_ent_value(inh_meth)) == symconst_addr_ent) &&
79 "Complex constant values not supported -- address of method should be straight constant!");
81 return get_SymConst_entity(get_atomic_ent_value(inh_meth));
84 /** Collect the entity representing the implementation of this
85 * entity (not the same if inherited) and all entities for overwriting
86 * implementations in "set".
87 * If the implementation of the method is not included in the
88 * compilation unit "open" is set to true.
89 * A recursive descend in the overwritten relation.
90 * Cycle-free, therefore must terminate.
93 * @param set A set of entities.
94 * @param size Number of entities in set.
97 static void collect_impls(entity *method, eset *set, int *size, bool *open) {
101 /* Add the implementation to the set if it contains an irg, else
102 remember that there are more methods called. */
104 if (get_entity_peculiarity(method) == peculiarity_inherited)
105 impl = get_inherited_methods_implementation(method);
107 if (get_entity_peculiarity(method) != peculiarity_description) {
108 eset_insert(set, impl);
112 /*- recursive descent -*/
113 for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i)
114 collect_impls(get_entity_overwrittenby(method, i), set, size, open);
117 /** Alle Methoden bestimmen, die die übergebene Methode überschreiben
118 * (und implementieren). In der zurückgegebenen Reihung kommt jede
119 * Methode nur einmal vor. Der Wert 'NULL' steht für unbekannte
120 * (externe) Methoden. Die zurückgegebene Reihung muß vom Aufrufer
121 * wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es überhaupt
122 * keine Methoden, die "method" überschreiben, so gibt die Methode
127 static entity ** get_impl_methods(entity * method) {
128 eset * set = eset_create();
133 /* Collect all method entities that can be called here */
134 collect_impls(method, set, &size, &open);
136 /* Vorgaenger einfuegen. */
137 if (size == 0 && !open) {
138 /* keine implementierte überschriebene Methode */
142 arr = NEW_ARR_F(entity *, size + 1);
143 arr[0] = NULL; /* Represents open method */
144 for (ent = eset_first(set); size > 0; ent = eset_next(set), --size)
148 arr = NEW_ARR_F(entity *, size);
149 for (size -= 1, ent = eset_first(set); size >= 0; ent = eset_next(set), --size)
156 /** Analyze address computations.
158 * Compute for all Sel nodes the set of methods that can be selected.
159 * For each entity we store the set of subentities in the link field.
161 * Further do some optimizations:
162 * - Call standard optimizations for Sel nodes: this removes polymorphic
164 * - If the node is a SymConst(name) replace it by SymConst(ent) if possible.
165 * For this we precomputed a map name->entity. Nowadays, we no more support
167 * - If the node is a Sel:
168 * If we found only a single method that can be called, replace the Sel
169 * by a SymConst. This is more powerful than the analysis in opt_polymorphy,
170 * as here we walk the type graph. In opt_polymorphy we only apply a local
173 * @param node The node to analyze
174 * @param env A map that maps names of entities to the entities.
176 static void sel_methods_walker(ir_node * node, void *env) {
177 pmap *ldname_map = env;
180 /* Call standard optimizations */
181 if (get_irn_op(node) == op_Sel) {
182 ir_node *new_node = optimize_in_place(node);
183 if (node != new_node) exchange(node, new_node);
186 /* replace SymConst(name)-operations by SymConst(ent) */
187 if (get_irn_op(node) == op_SymConst) {
188 if (get_SymConst_kind(node) == symconst_addr_name) {
189 pmap_entry * entry = pmap_find(ldname_map, (void *) get_SymConst_name(node));
190 if (entry != NULL) { /* Method is declared in the compiled code */
191 assert(0 && "There should not be a SymConst[addr_name] addressing a method with an implementation"
192 "in this compilation unit. Use a SymConst[addr_ent].");
196 else if (get_irn_op(node) == op_Sel &&
197 is_Method_type(get_entity_type(get_Sel_entity(node)))) {
198 entity * ent = get_SymConst_entity(get_atomic_ent_value(get_Sel_entity(node)));
199 assert(get_entity_peculiarity(ent) != peculiarity_inherited);
201 if (!eset_contains(entities, ent)) {
202 /* Entity not yet handled. Find all (internal or external)
203 * implemented methods that overwrites this entity.
204 * This set is stored in the entity link. */
205 set_entity_link(ent, get_impl_methods(ent));
206 eset_insert(entities, ent);
209 /* -- As an add on we get an optimization that removes polymorphic calls.
210 This optimization is more powerful than that in transform_node_Sel(). -- */
211 arr = get_entity_link(ent);
214 * The Sel node never returns a pointer to a usable method.
215 * We could not call it, but it may be description:
216 * We call a method in a dead part of the program.
218 assert (get_entity_peculiarity(ent) == peculiarity_description);
220 else if (get_opt_optimize() && get_opt_dyn_meth_dispatch() &&
221 (ARR_LEN(arr) == 1 && arr[0] != NULL)) {
225 * The Sel node returns only one possible method.
226 * So we could replace the Sel node by a SymConst.
227 * This method must exists.
229 set_irg_current_block(current_ir_graph, get_nodes_block(node));
230 assert(get_entity_peculiarity(get_SymConst_entity(get_atomic_ent_value(arr[0]))) ==
231 peculiarity_existent);
232 new_node = copy_const_value(get_atomic_ent_value(arr[0]));
233 DBG_OPT_POLY(node, new_node);
234 exchange(node, new_node);
239 /** Initialize auxiliary data structures.
241 * Computes a set of entities that overwrite an entity and contain
242 * an implementation. The set is stored in the entity's link field.
244 * Further replaces Sel nodes where this set contains exactly one
245 * method by SymConst nodes.
246 * Finally asserts if there is a SymConst(name) if there could be a
248 static void sel_methods_init(void) {
250 pmap * ldname_map = pmap_create(); /* Map entity names to entities: to replace
251 SymConst(name) by SymConst(ent). */
252 assert(entities == NULL);
253 entities = eset_create();
254 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
255 entity * ent = get_irg_entity(get_irp_irg(i));
256 /* only external visible methods are allowed to call by a SymConst_ptr_name */
257 if (get_entity_visibility(ent) != visibility_local) {
258 pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent);
262 all_irg_walk(sel_methods_walker, NULL, ldname_map);
263 pmap_destroy(ldname_map);
266 /*--------------------------------------------------------------------------*/
267 /* Find free methods.
269 * We expect that each entity has an array with all implementations in its
271 /*--------------------------------------------------------------------------*/
274 * Returns an array of all methods that could be called at a Sel node.
275 * This array contains every entry only once.
277 * @param sel the Sel node
279 static entity ** get_Sel_arr(ir_node * sel) {
280 static entity ** NULL_ARRAY = NULL;
284 assert(sel && get_irn_op(sel) == op_Sel);
285 ent = get_Sel_entity(sel);
286 ent = get_inherited_methods_implementation(ent);
288 assert(is_Method_type(get_entity_type(ent))); /* what else? */
289 arr = get_entity_link(ent);
293 /* "NULL" zeigt an, dass keine Implementierung existiert. Dies
294 * kann für polymorphe (abstrakte) Methoden passieren. */
296 NULL_ARRAY = NEW_ARR_F(entity *, 0);
303 * Returns the number of possible called methods at a Sel node.
305 * @param sel the Sel node
307 static int get_Sel_n_methods(ir_node * sel) {
308 return ARR_LEN(get_Sel_arr(sel));
312 * Returns the ith possible called method entity at a Sel node.
314 static entity * get_Sel_method(ir_node * sel, int pos) {
315 entity ** arr = get_Sel_arr(sel);
316 assert(pos >= 0 && pos < ARR_LEN(arr));
320 static void free_mark(ir_node * node, eset * set);
322 static void free_mark_proj(ir_node * node, long n, eset * set) {
323 assert(get_irn_mode(node) == mode_T);
324 if (get_irn_link(node) == MARK) {
325 /* already visited */
328 set_irn_link(node, MARK);
329 switch (get_irn_opcode(node)) {
331 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
332 * op_Tuple oder ein Knoten, der in "free_ana_walker" behandelt
334 ir_node * pred = get_Proj_pred(node);
335 if (get_irn_link(pred) != MARK && get_irn_op(pred) == op_Tuple) {
336 free_mark_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, set);
338 /* nothing: da in "free_ana_walker" behandelt. */
344 free_mark(get_Tuple_pred(node, n), set);
348 free_mark_proj(get_Id_pred(node), n, set);
354 /* nothing: Die Operationen werden in free_ana_walker() selbst
359 assert(0 && "unexpected opcode or opcode not implemented");
362 set_irn_link(node, NULL);
366 * Called for predecessors nodes of "interesting" ones.
367 * Interesting ones include all nodes that can somehow make
370 * If a method (or a set of methods in case of polymorph calls) gets visible,
371 * add it to the set of 'free' methods
373 * @param node the current visited node
374 * @param set the set of all free methods
376 static void free_mark(ir_node *node, eset * set) {
379 if (get_irn_link(node) == MARK)
380 return; /* already visited */
382 set_irn_link(node, MARK);
384 switch (get_irn_opcode(node)) {
386 entity * ent = get_Sel_entity(node);
387 if (is_Method_type(get_entity_type(ent))) {
388 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
389 eset_insert(set, get_Sel_method(node, i));
395 if (get_SymConst_kind(node) == symconst_addr_ent) {
396 entity * ent = get_SymConst_entity(node);
397 if (is_Method_type(get_entity_type(ent))) {
398 eset_insert(set, ent);
401 assert(get_SymConst_kind(node) == symconst_addr_name);
402 /* nothing: SymConst points to extern method */
407 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
408 free_mark(get_Phi_pred(node, i), set);
412 free_mark(get_Id_pred(node), set);
415 free_mark_proj(get_Proj_pred(node), get_Proj_proj(node), set);
418 /* nothing: Wird unten behandelt! */
421 set_irn_link(node, NULL);
425 * post-walker. Find method addresses.
427 static void free_ana_walker(ir_node *node, void *env) {
431 if (get_irn_link(node) == MARK) {
432 /* already visited */
435 switch (get_irn_opcode(node)) {
446 /* Sonderbehandlung, da der Funktionszeigereingang natürlich kein
449 set_irn_link(node, MARK);
450 for (i = get_Call_n_params(node) - 1; i >= 0; --i) {
451 ir_node *pred = get_Call_param(node, i);
452 if (mode_is_reference(get_irn_mode(pred))) {
453 free_mark(pred, set);
457 /* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis
458 * jemand das Gegenteil implementiert. */
460 set_irn_link(node, MARK);
461 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
462 ir_node * pred = get_irn_n(node, i);
463 if (mode_is_reference(get_irn_mode(pred))) {
464 free_mark(pred, set);
469 set_irn_link(node, NULL);
473 * returns a list of 'free' methods, i.e., the methods that can be called
474 * from external or via function pointers.
476 * Die Datenstrukturen für sel-Methoden (sel_methods) muß vor dem
477 * Aufruf von "get_free_methods" aufgebaut sein. Die (internen)
478 * SymConst(name)-Operationen müssen in passende SymConst(ent)-Operationen
479 * umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer
480 * auf eine echt externe Methode.
482 static entity ** get_free_methods(void)
484 eset * set = eset_create();
486 entity ** arr = NEW_ARR_F(entity *, 0);
489 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
490 ir_graph * irg = get_irp_irg(i);
491 entity * ent = get_irg_entity(irg);
492 /* insert "external visible" methods. */
493 if (get_entity_visibility(ent) != visibility_local) {
494 eset_insert(set, ent);
496 /* Finde alle Methoden die in dieser Methode extern sichtbar werden,
497 z.B. da die Adresse einer Methode abgespeichert wird. */
498 irg_walk_graph(irg, NULL, free_ana_walker, set);
501 /* insert sticky methods, too */
502 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
503 entity * ent = get_irg_entity(get_irp_irg(i));
504 /* insert "sticky" methods. */
505 if (get_entity_stickyness (ent) == stickyness_sticky) {
506 eset_insert(set, ent);
510 /* insert all methods the initializes global variables */
512 /* the main program is even then "free", if it's not external visible. */
513 if (get_irp_main_irg())
514 eset_insert(set, get_irg_entity(get_irp_main_irg()));
516 /* Finally, transform the set into an array. */
517 for (ent = eset_first(set); ent; ent = eset_next(set)) {
518 ARR_APP1(entity *, arr, ent);
525 /*--------------------------------------------------------------------------*/
526 /* Callee analysis. */
527 /*--------------------------------------------------------------------------*/
529 static void callee_ana_node(ir_node * node, eset * methods);
531 static void callee_ana_proj(ir_node * node, long n, eset * methods) {
532 assert(get_irn_mode(node) == mode_T);
533 if (get_irn_link(node) == MARK) {
534 /* already visited */
537 set_irn_link(node, MARK);
539 switch (get_irn_opcode(node)) {
541 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
542 * op_Tuple oder ein Knoten, der eine "freie Methode"
544 ir_node * pred = get_Proj_pred(node);
545 if (get_irn_link(pred) != MARK) {
546 if (get_irn_op(pred) == op_Tuple) {
547 callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods);
549 eset_insert(methods, MARK); /* free method -> unknown */
556 callee_ana_node(get_Tuple_pred(node, n), methods);
560 callee_ana_proj(get_Id_pred(node), n, methods);
564 eset_insert(methods, MARK); /* free method -> unknown */
568 set_irn_link(node, NULL);
572 static void callee_ana_node(ir_node * node, eset * methods) {
575 assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node));
576 /* rekursion verhindern */
577 if (get_irn_link(node) == MARK) {
578 /* already visited */
581 set_irn_link(node, MARK);
583 switch (get_irn_opcode(node)) {
585 if (get_SymConst_kind(node) == symconst_addr_ent) {
586 entity * ent = get_SymConst_entity(node);
587 assert(ent && is_Method_type(get_entity_type(ent)));
588 eset_insert(methods, ent);
590 assert(get_SymConst_kind(node) == symconst_addr_name);
591 /* externe Methode (wegen fix_symconst!) */
592 eset_insert(methods, MARK); /* free method -> unknown */
596 /* polymorphe Methode */
597 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
598 entity * ent = get_Sel_method(node, i);
600 eset_insert(methods, ent);
602 eset_insert(methods, MARK);
611 case iro_Phi: /* Vereinigung */
612 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
613 callee_ana_node(get_Phi_pred(node, i), methods);
618 callee_ana_node(get_Mux_false(node), methods);
619 callee_ana_node(get_Mux_true(node), methods);
623 callee_ana_node(get_Id_pred(node), methods);
627 callee_ana_proj(get_Proj_pred(node), get_Proj_proj(node), methods);
634 eset_insert(methods, MARK); /* free method -> unknown */
638 assert(0 && "invalid opcode or opcode not implemented");
642 set_irn_link(node, NULL);
646 static void callee_walker(ir_node * call, void * env) {
647 if (get_irn_op(call) == op_Call) {
648 eset * methods = eset_create();
650 entity ** arr = NEW_ARR_F(entity *, 0);
651 assert(get_irn_op(get_Call_ptr(call)) != op_Id);
652 callee_ana_node(get_Call_ptr(call), methods);
653 if (eset_contains(methods, MARK)) { /* unknown method */
654 ARR_APP1(entity *, arr, unknown_entity);
656 for (ent = eset_first(methods); ent; ent = eset_next(methods)) {
658 ARR_APP1(entity *, arr, ent);
661 #if 0 /* This generates Bad nodes when we don't want it.
662 Call it with a check for valid cgana information in local_optimize. */
663 if (ARR_LEN(arr) == 0 && get_opt_optimize() && get_opt_dyn_meth_dispatch()) {
664 /* Kann vorkommen, wenn der Vorgänger beispielsweise eine
665 * Sel-Operation war, die keine Methoden zurückgeben
666 * konnte. Wir ersetzen die Call-Operation ebenfalls durch
667 * eine Bad-Operation. Die Verlinkung muss wiederhergestellt
669 ir_node *mem = get_Call_mem(call);
670 turn_into_tuple (call, 5 /* pn_Call_max */);
671 set_Tuple_pred(call, pn_Call_M_regular , mem);
672 set_Tuple_pred(call, pn_Call_T_result , new_Bad());
673 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
674 set_Tuple_pred(call, pn_Call_X_except , new_Bad()); /* new_Jmp() ?? new_Raise() ?? */
675 set_Tuple_pred(call, pn_Call_M_except , new_Bad());
680 set_Call_callee_arr(call, ARR_LEN(arr), arr);
683 eset_destroy(methods);
688 static void remove_Tuples(ir_node * proj, void * env) {
690 if (get_irn_opcode(proj) != iro_Proj) return;
692 new = skip_Tuple(proj);
693 if (new != proj) exchange(proj, new);
697 /* Bestimmt für jede Call-Operation die Menge der aufrufbaren Methode
698 * und speichert das Ergebnis in der Call-Operation. (siehe
699 * "set_Call_callee"). "sel_methods" wird für den Aufbau benötigt und
700 * muss bereits aufgebaut sein. */
701 static void callee_ana(void) {
703 /* Alle Graphen analysieren. */
704 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
705 irg_walk_graph(get_irp_irg(i), callee_walker, remove_Tuples, NULL);
706 set_irg_callee_info_state(get_irp_irg(i), irg_callee_info_consistent);
708 set_irp_callee_info_state(irg_callee_info_consistent);
711 /*--------------------------------------------------------------------------*/
712 /* Cleanup after analyses. */
713 /*--------------------------------------------------------------------------*/
715 /** Frees intermediate data structures. */
716 static void sel_methods_dispose(void) {
719 for (ent = eset_first(entities); ent; ent = eset_next(entities)) {
720 entity ** arr = get_entity_link(ent);
724 set_entity_link(ent, NULL);
726 eset_destroy(entities);
730 /*--------------------------------------------------------------------------*/
731 /* Freeing the callee arrays. */
732 /*--------------------------------------------------------------------------*/
734 static void destruct_walker(ir_node * node, void * env) {
735 if (get_irn_op(node) == op_Call) {
736 remove_Call_callee_arr(node);
740 /*--------------------------------------------------------------------------*/
742 /*--------------------------------------------------------------------------*/
744 void cgana(int *length, entity ***free_methods) {
745 entity ** free_meths, **p;
747 /* Optimize Sel/SymConst nodes and compute all methods that implement an entity. */
749 free_meths = get_free_methods();
751 sel_methods_dispose();
753 /* Convert the flexible array to an array that can be handled
755 p = xmalloc(sizeof(*p) * ARR_LEN(free_meths));
756 memcpy(p, free_meths, ARR_LEN(free_meths) * sizeof(*p));
758 *length = ARR_LEN(free_meths);
761 DEL_ARR_F(free_meths);
764 void free_callee_info(ir_graph *irg) {
765 irg_walk_graph(irg, destruct_walker, NULL, NULL);
766 set_irg_callee_info_state(irg, irg_callee_info_none);
769 void free_irp_callee_info(void) {
771 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
772 free_callee_info(get_irp_irg(i));
776 /* Optimize the address expressions passed to call nodes.
778 * This optimization performs the following transformations for
780 * - All SymConst operations that refer to intern methods are replaced
781 * by Const operations referring to the corresponding entity.
782 * - Sel nodes, that select entities that are not overwritten are
783 * replaced by Const nodes referring to the selected entity.
784 * - Sel nodes, for which no method exists at all are replaced by Bad
786 * - Sel nodes with a pointer input that is an Alloc node are replaced
787 * by Const nodes referring to the entity that implements the method in
788 * the type given by the Alloc node.
790 void opt_call_addrs(void) {
792 sel_methods_dispose();