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.
14 * Intraprozedurale Analyse zur Abschätzung der Aufrufrelation. Es
15 * wird eine Menge von freien Methoden und anschließend die an den
16 * Call-Operationen aufrufbaren Methoden bestimmt.
39 #include "dbginfo_t.h"
43 /* Eindeutige Adresse zur Markierung von besuchten Knoten und zur
44 * Darstellung der unbekannten Methode. */
45 static void * MARK = &MARK;
49 /* --- sel methods ---------------------------------------------------------- */
52 static eset * entities = NULL;
55 /** Bestimmt die eindeutige Methode, die die Methode für den
56 * übergebenen (dynamischen) Typ überschreibt. */
57 static entity * get_implementation(type * class, entity * method) {
59 if (get_entity_peculiarity(method) != peculiarity_description &&
60 get_entity_owner(method) == class) {
63 for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i) {
64 entity * e = get_entity_overwrittenby(method, i);
65 if (get_entity_peculiarity(e) != peculiarity_description && get_entity_owner(e) == class) {
69 for (i = get_class_n_supertypes(class) - 1; i >= 0; --i) {
70 entity * e = get_implementation(get_class_supertype(class, i), method);
75 assert(0 && "implementation not found");
79 /** Returns the entity that contains the implementation of the inherited
80 entity if available, else returns the entity passed. */
81 static entity *get_inherited_methods_implementation(entity *inh_meth) {
82 entity *impl_meth = NULL;
83 ir_node *addr = get_atomic_ent_value(inh_meth);
84 assert(addr && "constant entity without value");
86 if (get_irn_op(addr) == op_Const) {
87 impl_meth = tarval_to_entity(get_Const_tarval(addr));
88 } else if ((get_irn_op(addr) == op_SymConst) &&
89 (get_SymConst_kind(addr) == symconst_addr_ent)) {
90 impl_meth = get_SymConst_entity(addr);
92 assert(0 && "Complex constant values not supported -- address of method should be straight constant!");
94 if (impl_meth && (get_entity_peculiarity(impl_meth) != peculiarity_existent)) {
96 printf("this_meth: "); DDMEO(inh_meth);
97 printf("impl meth: "); DDMEO(impl_meth);
98 assert(!impl_meth || get_entity_peculiarity(impl_meth) == peculiarity_existent);
102 return impl_meth? impl_meth : inh_meth;
106 /** Collect the entity representing the implementation of this
107 * entity (not the same if inherited) and all entities for overwriting
108 * implementations in "set".
109 * If the implementation of the method is not included in the
110 * compilation unit "open" is set to true.
111 * A recursive descend in the overwritten relation.
112 * Cycle-free, therefore must terminate.
115 * @param set A set of entities.
116 * @param size Number of entities in set.
119 static void collect_impls(entity *method, eset *set, int *size, bool *open) {
122 if (get_entity_peculiarity(method) == peculiarity_existent) {
123 if (get_entity_visibility(method) == visibility_external_allocated) {
124 assert(get_entity_irg(method) == NULL);
127 assert(get_entity_irg(method) != NULL);
128 if (!eset_contains(set, method)) {
129 eset_insert(set, method);
135 if (get_entity_peculiarity(method) == peculiarity_inherited) {
136 entity *impl_ent = get_inherited_methods_implementation(method);
137 assert(impl_ent && "no implementation for inherited entity");
138 if (get_entity_visibility(impl_ent) == visibility_external_allocated) {
139 assert(get_entity_irg(impl_ent) == NULL);
142 assert(get_entity_irg(impl_ent) != NULL);
143 if (!eset_contains(set, impl_ent)) {
144 eset_insert(set, impl_ent);
149 /** recursive descend **/
150 for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i)
151 collect_impls(get_entity_overwrittenby(method, i), set, size, open);
155 /** Alle Methoden bestimmen, die die übergebene Methode überschreiben
156 * (und implementieren). In der zurückgegebenen Reihung kommt jede
157 * Methode nur einmal vor. Der Wert 'NULL' steht für unbekannte
158 * (externe) Methoden. Die zurückgegebene Reihung muß vom Aufrufer
159 * wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es überhaupt
160 * keine Methoden, die "method" überschreiben, so gibt die Methode
165 static entity ** get_impl_methods(entity * method) {
166 eset * set = eset_create();
171 /* Collect all method entities that can be called here */
172 collect_impls(method, set, &size, &open);
174 /* Vorgaenger einfuegen. */
175 if (size == 0 && !open) {
176 /* keine implementierte überschriebene Methode */
180 arr = NEW_ARR_F(entity *, size + 1);
181 arr[0] = NULL; /* Represents open method */
182 for (ent = eset_first(set); size > 0; ent = eset_next(set), --size)
186 arr = NEW_ARR_F(entity *, size);
187 for (size -= 1, ent = eset_first(set); size >= 0; ent = eset_next(set), --size)
195 /* debug makros used in sel_methods_walker */
196 #define SIZ(x) sizeof(x)/sizeof((x)[0])
198 #define DBG_OPT_NORMALIZE \
199 __dbg_info_merge_pair(new_node, node, dbg_const_eval)
200 #define DBG_OPT_POLY_ALLOC \
204 ons[1] = skip_Proj(get_Sel_ptr(node)); \
205 __dbg_info_merge_sets(&new_node, 1, ons, SIZ(ons), dbg_rem_poly_call); \
207 #define DBG_OPT_POLY \
208 __dbg_info_merge_pair(new_node, node, dbg_rem_poly_call)
212 /** Analyse address computations.
214 * - If the node is a SymConst replace it by Const(ent) if possible.
215 * - If the node is a Sel:
216 * * If the pointer to the Sel comes directly from an Alloc node
217 * replace the Sel by a Const(ent).
220 * @param node The node to analyze
221 * @param ldname_map A map that mapps names of entities to the entities.
223 static void sel_methods_walker(ir_node * node, pmap * ldname_map) {
225 if (get_irn_op(node) == op_SymConst) {
226 /* Wenn möglich SymConst-Operation durch Const-Operation
228 if (get_SymConst_kind(node) == symconst_addr_name) {
229 pmap_entry * entry = pmap_find(ldname_map, (void *) get_SymConst_name(node));
230 if (entry != NULL) { /* Method is declared in the compiled code */
231 entity * ent = entry->value;
232 if (get_opt_normalize() && (get_entity_visibility(ent) != visibility_external_allocated)) { /* Meth. is defined */
235 assert(get_entity_irg(ent));
237 set_irg_current_block(current_ir_graph, get_nodes_Block(node));
238 new_node = new_d_SymConst(get_irn_dbg_info(node), sym, symconst_addr_ent); DBG_OPT_NORMALIZE;
240 exchange(node, new_node);
244 } else if (get_irn_op(node) == op_Sel &&
245 is_method_type(get_entity_type(get_Sel_entity(node)))) {
246 entity * ent = get_Sel_entity(node);
247 if (get_opt_optimize() && get_opt_dyn_meth_dispatch() &&
248 (get_irn_op(skip_Proj(get_Sel_ptr(node))) == op_Alloc)) {
251 /* We know which method will be called, no dispatch necessary. */
253 assert(get_entity_peculiarity(ent) != peculiarity_description);
254 set_irg_current_block(current_ir_graph, get_nodes_Block(node));
255 /* @@@ Is this correct?? Alloc could reference a subtype of the owner
256 of Sel that overwrites the method referenced in Sel. */
257 /* @@@ Yes, this is wrong. GL, 10.3.04 */
258 new_node = copy_const_value(get_atomic_ent_value(ent)); DBG_OPT_POLY_ALLOC;
260 called_ent = resolve_ent_polymorphy(get_Alloc_type(skip_Proj(get_Sel_ptr(node))), ent);
261 set_irg_current_block(current_ir_graph, get_nodes_Block(node));
262 /* called_ent may not be description: has no Address/Const to Call! */
263 assert(get_entity_peculiarity(called_ent) != peculiarity_description);
264 new_node = copy_const_value(get_atomic_ent_value(called_ent)); DBG_OPT_POLY_ALLOC;
266 exchange (node, new_node);
268 assert(get_entity_peculiarity(ent) != peculiarity_inherited);
269 if (!eset_contains(entities, ent)) {
270 /* Entity noch nicht behandelt. Alle (intern oder extern)
271 * implementierten Methoden suchen, die diese Entity
272 * überschreiben. Die Menge an entity.link speichern. */
273 set_entity_link(ent, get_impl_methods(ent));
274 eset_insert(entities, ent);
276 if (get_entity_link(ent) == NULL) {
277 /* Die Sel-Operation kann nie einen Zeiger auf eine aufrufbare
278 * Methode zurückgeben. Damit ist sie insbesondere nicht
279 * ausführbar und nicht erreichbar. */
280 /* Gib eine Warnung aus wenn die Entitaet eine Beschreibung ist
281 fuer die es keine Implementierung gibt. */
282 if (get_entity_peculiarity(ent) == peculiarity_description) {
283 /* @@@ GL Methode um Fehler anzuzeigen aufrufen! */
284 printf("WARNING: Calling method description %s\n in method %s\n of class %s\n which has "
285 "no implementation!\n", get_entity_name(ent),
286 get_entity_name(get_irg_ent(current_ir_graph)),
287 get_type_name(get_entity_owner(get_irg_ent(current_ir_graph))));
288 printf("This happens when compiling a Java Interface that's never really used, i.e., "
289 "no class implementing the interface is ever used.\n");
291 exchange(node, new_Bad());
294 entity ** arr = get_entity_link(ent);
298 printf("\nCall site "); DDMN(node);
299 printf(" in "); DDME(get_irg_ent(current_ir_graph));
300 printf(" can call:\n");
301 for (i = 0; i < ARR_LEN(arr); i++) {
302 printf(" - "); DDME(arr[i]);
303 printf(" with owner "); DDMT(get_entity_owner(arr[i]));
308 if (get_opt_optimize() && get_opt_dyn_meth_dispatch() &&
309 (ARR_LEN(arr) == 1 && arr[0] != NULL)) {
311 /* Die Sel-Operation kann immer nur einen Wert auf eine
312 * interne Methode zurückgeben. Wir können daher die
313 * Sel-Operation durch eine Const- bzw. SymConst-Operation
315 set_irg_current_block(current_ir_graph, get_nodes_Block(node));
316 /* assert(get_entity_peculiarity(tarval_to_entity(get_Const_tarval(get_atomic_ent_value(arr[0])))) == peculiarity_existent); */
317 new_node = copy_const_value(get_atomic_ent_value(arr[0])); DBG_OPT_POLY;
318 exchange (node, new_node);
326 /** Datenstruktur initialisieren. Zusätzlich werden alle
327 * SymConst-Operationen, die auf interne Methoden verweisen, durch
328 * Const-Operationen ersetzt. */
329 static void sel_methods_init(void) {
331 pmap * ldname_map = pmap_create(); /* Map entitiy names to entities: to replace SymConst by Const(ent). */
332 assert(entities == NULL);
333 entities = eset_create();
334 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
335 entity * ent = get_irg_ent(get_irp_irg(i));
336 /* Nur extern sichtbare Methode können überhaupt mit SymConst
337 * aufgerufen werden. */
338 if (get_entity_visibility(ent) != visibility_local) {
339 pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent);
342 all_irg_walk((irg_walk_func *) sel_methods_walker, NULL, ldname_map);
343 pmap_destroy(ldname_map);
346 /*****************************************************************************/
348 /* Datenstruktur freigeben. */
349 static void sel_methods_dispose(void) {
352 for (ent = eset_first(entities); ent; ent = eset_next(entities)) {
353 entity ** arr = get_entity_link(ent);
357 set_entity_link(ent, NULL);
359 eset_destroy(entities);
364 /* Gibt die Menge aller Methoden zurück, die an diesem Sel-Knoten
365 * zurückgegeben werden können. Die Liste enthält keine doppelten
367 static entity ** get_Sel_arr(ir_node * sel) {
368 static entity ** NULL_ARRAY = NULL;
371 assert(sel && get_irn_op(sel) == op_Sel);
372 ent = get_Sel_entity(sel);
373 assert(is_method_type(get_entity_type(ent))); /* what else? */
374 arr = get_entity_link(ent);
378 /* "NULL" zeigt an, dass keine Implementierung existiert. Dies
379 * kann für polymorphe (abstrakte) Methoden passieren. */
381 NULL_ARRAY = NEW_ARR_F(entity *, 0);
388 static int get_Sel_n_methods(ir_node * sel) {
389 return ARR_LEN(get_Sel_arr(sel));
393 static entity * get_Sel_method(ir_node * sel, int pos) {
394 entity ** arr = get_Sel_arr(sel);
395 assert(pos >= 0 && pos < ARR_LEN(arr));
401 /* --- callee analysis ------------------------------------------------------ */
404 static void callee_ana_node(ir_node * node, eset * methods);
407 static void callee_ana_proj(ir_node * node, long n, eset * methods) {
408 assert(get_irn_mode(node) == mode_T);
409 if (get_irn_link(node) == MARK) {
410 /* already visited */
413 set_irn_link(node, MARK);
415 switch (get_irn_opcode(node)) {
417 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
418 * op_Tuple oder ein Knoten, der eine "freie Methode"
420 ir_node * pred = get_Proj_pred(node);
421 if (get_irn_link(pred) != MARK) {
422 if (get_irn_op(pred) == op_Tuple) {
423 callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods);
425 eset_insert(methods, MARK); /* free method -> unknown */
432 callee_ana_node(get_Tuple_pred(node, n), methods);
436 callee_ana_proj(get_Id_pred(node), n, methods);
440 eset_insert(methods, MARK); /* free method -> unknown */
444 set_irn_link(node, NULL);
448 static void callee_ana_node(ir_node * node, eset * methods) {
451 assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node));
452 /* rekursion verhindern */
453 if (get_irn_link(node) == MARK) {
454 /* already visited */
457 set_irn_link(node, MARK);
459 switch (get_irn_opcode(node)) {
461 if (get_SymConst_kind(node) == symconst_addr_ent) {
462 entity * ent = get_SymConst_entity(node);
463 assert(ent && is_method_type(get_entity_type(ent)));
464 if (get_entity_visibility(ent) != visibility_external_allocated) {
465 assert(get_entity_irg(ent));
466 eset_insert(methods, ent);
468 eset_insert(methods, MARK); /* free method -> unknown */
471 assert(get_SymConst_kind(node) == symconst_addr_name);
472 /* externe Methode (wegen fix_symconst!) */
473 eset_insert(methods, MARK); /* free method -> unknown */
478 /* interne Methode */
479 entity * ent = tarval_to_entity(get_Const_tarval(node));
480 assert(ent && is_method_type(get_entity_type(ent)));
481 if (get_entity_visibility(ent) != visibility_external_allocated) {
482 if (!get_entity_irg(ent)) {
484 assert(get_entity_irg(ent));
486 eset_insert(methods, ent);
488 eset_insert(methods, MARK); /* free method -> unknown */
494 /* polymorphe Methode */
495 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
496 entity * ent = get_Sel_method(node, i);
498 eset_insert(methods, ent);
500 eset_insert(methods, MARK);
509 case iro_Phi: /* Vereinigung */
510 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
511 callee_ana_node(get_Phi_pred(node, i), methods);
516 callee_ana_node(get_Id_pred(node), methods);
520 callee_ana_proj(get_Proj_pred(node), get_Proj_proj(node), methods);
527 eset_insert(methods, MARK); /* free method -> unknown */
531 assert(0 && "invalid opcode or opcode not implemented");
535 set_irn_link(node, NULL);
539 static void callee_walker(ir_node * call, void * env) {
540 if (get_irn_op(call) == op_Call) {
541 eset * methods = eset_create();
543 entity ** arr = NEW_ARR_F(entity *, 0);
544 callee_ana_node(skip_nop(get_Call_ptr(call)), methods);
545 if (eset_contains(methods, MARK)) { /* unknown method */
546 ARR_APP1(entity *, arr, NULL);
548 for (ent = eset_first(methods); ent; ent = eset_next(methods)) {
550 ARR_APP1(entity *, arr, ent);
553 if (ARR_LEN(arr) == 0) {
554 /* Kann vorkommen, wenn der Vorgänger beispielsweise eine
555 * Sel-Operation war, die keine Methoden zurückgeben
556 * konnte. Wir ersetzen die Call-Operation ebenfalls durch
557 * eine Bad-Operation. Die Verlinkung muss wiederhergestellt
559 /* exchange(call, new_Bad()); invalid firm */
561 ir_node *mem = get_Call_mem(call);
562 turn_into_tuple (call, 5 /* pn_Call_max */);
563 set_Tuple_pred(call, pn_Call_M_regular , mem);
564 set_Tuple_pred(call, pn_Call_T_result , new_Bad());
565 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
566 set_Tuple_pred(call, pn_Call_X_except , new_Bad()); /* new_Jmp() ?? new_Raise() ?? */
567 set_Tuple_pred(call, pn_Call_M_except , mem);
570 set_Call_callee_arr(call, ARR_LEN(arr), arr);
573 eset_destroy(methods);
578 /* Bestimmt für jede Call-Operation die Menge der aufrufbaren Methode
579 * und speichert das Ergebnis in der Call-Operation. (siehe
580 * "set_Call_callee"). "sel_methods" wird für den Aufbau benötigt und
581 * muss bereits aufgebaut sein. */
582 static void callee_ana(void) {
584 /* Alle Graphen analysieren. */
585 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
586 irg_walk_graph(get_irp_irg(i), callee_walker, NULL, NULL);
587 set_irg_callee_info_state(get_irp_irg(i), irg_callee_info_consistent);
593 /* --- free method analysis ------------------------------------------------- */
596 static void free_mark(ir_node * node, eset * set);
598 static void free_mark_proj(ir_node * node, long n, eset * set) {
599 assert(get_irn_mode(node) == mode_T);
600 if (get_irn_link(node) == MARK) {
601 /* already visited */
604 set_irn_link(node, MARK);
605 switch (get_irn_opcode(node)) {
607 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
608 * op_Tuple oder ein Knoten, der in "free_ana_walker" behandelt
610 ir_node * pred = get_Proj_pred(node);
611 if (get_irn_link(pred) != MARK && get_irn_op(pred) == op_Tuple) {
612 free_mark_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, set);
614 /* nothing: da in "free_ana_walker" behandelt. */
620 free_mark(get_Tuple_pred(node, n), set);
624 free_mark_proj(get_Id_pred(node), n, set);
630 /* nothing: Die Operationen werden in "free_ana_walker" selbst
635 assert(0 && "unexpected opcode or opcode not implemented");
638 set_irn_link(node, NULL);
642 static void free_mark(ir_node * node, eset * set) {
644 assert(mode_is_reference(get_irn_mode(node)));
645 if (get_irn_link(node) == MARK) {
646 return; /* already visited */
648 set_irn_link(node, MARK);
649 switch (get_irn_opcode(node)) {
651 entity * ent = get_Sel_entity(node);
652 if (is_method_type(get_entity_type(ent))) {
653 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
654 eset_insert(set, get_Sel_method(node, i));
660 if (get_SymConst_kind(node) == symconst_addr_ent) {
661 entity * ent = get_SymConst_entity(node);
662 if (is_method_type(get_entity_type(ent))) {
663 eset_insert(set, ent);
666 assert(get_SymConst_kind(node) == symconst_addr_name);
667 /* nothing: SymConst points to extern method */
671 tarval * val = get_Const_tarval(node);
672 if (tarval_is_entity(val)) { /* filter null pointer */
673 entity * ent = tarval_to_entity(val);
674 if (is_method_type(get_entity_type(ent))) {
675 eset_insert(set, ent);
681 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
682 free_mark(get_Phi_pred(node, i), set);
686 free_mark(get_Id_pred(node), set);
689 free_mark_proj(get_Proj_pred(node), get_Proj_proj(node), set);
692 /* nothing: Wird unten behandelt! */
695 set_irn_link(node, NULL);
699 static void free_ana_walker(ir_node * node, eset * set) {
701 if (get_irn_link(node) == MARK) {
702 /* bereits in einem Zyklus besucht. */
705 switch (get_irn_opcode(node)) {
716 /* Sonderbehandlung, da der Funktionszeigereingang natürlich kein
719 set_irn_link(node, MARK);
720 for (i = get_Call_arity(node) - 1; i >= 0; --i) {
721 ir_node * pred = get_Call_param(node, i);
722 if (mode_is_reference(get_irn_mode(pred))) {
723 free_mark(pred, set);
727 /* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis
728 * jemand das Gegenteil implementiert. */
730 set_irn_link(node, MARK);
731 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
732 ir_node * pred = get_irn_n(node, i);
733 if (mode_is_reference(get_irn_mode(pred))) {
734 free_mark(pred, set);
739 set_irn_link(node, NULL);
743 /* Die Datenstrukturen für sel-Methoden (sel_methods) muß vor dem
744 * Aufruf von "get_free_methods" aufgebaut sein. Die (internen)
745 * SymConst-Operationen müssen in passende Const-Operationen
746 * umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer
747 * auf eine echt externe Methode. */
748 static entity ** get_free_methods(void) {
749 eset * set = eset_create();
751 entity ** arr = NEW_ARR_F(entity *, 0);
754 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
755 ir_graph * irg = get_irp_irg(i);
756 entity * ent = get_irg_ent(irg);
757 /* insert "external visible" methods. */
758 if (get_entity_visibility(ent) != visibility_local) {
759 eset_insert(set, ent);
761 /* Finde alle Methoden die in dieser Methode extern sichtbar werden,
762 z.B. da die Adresse einer Methode abgespeichert wird. */
763 irg_walk_graph(irg, NULL, (irg_walk_func *) free_ana_walker, set);
765 /* Hauptprogramm ist auch dann frei, wenn es nicht "external
767 if (get_irp_main_irg()) {
768 eset_insert(set, get_irg_ent(get_irp_main_irg()));
770 /* Wandle Menge in Feld um. Effizienter. */
771 for (ent = eset_first(set); ent; ent = eset_next(set)) {
772 ARR_APP1(entity *, arr, ent);
779 void cgana(int *length, entity ***free_methods) {
780 entity ** free_meths;
784 free_meths = get_free_methods();
786 sel_methods_dispose();
788 /* Convert the flexible array to an array that can be handled
790 *length = ARR_LEN(free_meths);
791 *free_methods = (entity **)malloc(sizeof(entity *) * (*length));
792 for (i = 0; i < (*length); i++) (*free_methods)[i] = free_meths[i];
793 DEL_ARR_F(free_meths);
798 static void destruct_walker(ir_node * node, void * env) {
799 if (get_irn_op(node) == op_Call) {
800 remove_Call_callee_arr(node);
804 void free_callee_info(ir_graph *irg) {
805 irg_walk_graph(irg, destruct_walker, NULL, NULL);
806 set_irg_callee_info_state(irg, irg_callee_info_none);
810 /* Optimize the address expressions passed to call nodes.
812 * This optimization performs the following transformations for
814 * - All SymConst operations that refer to intern methods are replaced
815 * by Const operations refering to the corresponding entity.
816 * - Sel nodes, that select entities that are not overwritten are
817 * replaced by Const nodes refering to the selected entity.
818 * - Sel nodes, for witch no method exists at all are replaced by Bad
820 * - Sel nodes with a pointer input that is an Alloc node are replaced
821 * by Const nodes refering to the entity that implements the method in
822 * the type given by the Alloc node.
824 void opt_call_addrs(void) {
826 sel_methods_dispose();
829 pmap * ldname_map = pmap_create();
830 assert(entities == NULL);
831 entities = eset_create();
832 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
833 entity * ent = get_irg_ent(get_irp_irg(i));
834 /* Nur extern sichtbare Methoden können überhaupt mit SymConst
835 * aufgerufen werden. */
836 if (get_entity_visibility(ent) != local) {
837 pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent);
840 all_irg_walk((irg_walk_func *) sel_methods_walker, NULL, ldname_map);
841 pmap_destroy(ldname_map);