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.
35 #include "dbginfo_t.h"
41 /* Eindeutige Adresse zur Markierung von besuchten Knoten und zur
42 * Darstellung der unbekannten Methode. */
43 static void * MARK = &MARK;
47 /* --- sel methods ---------------------------------------------------------- */
50 static eset * entities = NULL;
53 /** Bestimmt die eindeutige Methode, die die Methode für den
54 * übergebenen (dynamischen) Typ überschreibt. */
55 static entity * get_implementation(type * class, entity * method) {
57 if (get_entity_peculiarity(method) != peculiarity_description &&
58 get_entity_owner(method) == class) {
61 for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i) {
62 entity * e = get_entity_overwrittenby(method, i);
63 if (get_entity_peculiarity(e) != peculiarity_description && get_entity_owner(e) == class) {
67 for (i = get_class_n_supertypes(class) - 1; i >= 0; --i) {
68 entity * e = get_implementation(get_class_supertype(class, i), method);
73 assert(0 && "implementation not found");
77 /** Returns the entity that contains the implementation of the inherited
78 entity if available, else returns the entity passed. */
79 static entity *get_inherited_methods_implementation(entity *inh_meth) {
80 entity *impl_meth = NULL;
81 ir_node *addr = get_atomic_ent_value(inh_meth);
82 assert(addr && "constant entity without value");
83 if ((get_irn_op(addr) == op_SymConst) &&
84 (get_SymConst_kind(addr) == symconst_addr_ent)) {
85 impl_meth = get_SymConst_entity(addr);
87 assert(0 && "Complex constant values not supported -- address of method should be straight constant!");
89 if (impl_meth && (get_entity_peculiarity(impl_meth) != peculiarity_existent)) {
91 printf("this_meth: "); DDMEO(inh_meth);
92 printf("impl meth: "); DDMEO(impl_meth);
93 assert(!impl_meth || get_entity_peculiarity(impl_meth) == peculiarity_existent);
97 return impl_meth? impl_meth : inh_meth;
101 /** Collect the entity representing the implementation of this
102 * entity (not the same if inherited) and all entities for overwriting
103 * implementations in "set".
104 * If the implementation of the method is not included in the
105 * compilation unit "open" is set to true.
106 * A recursive descend in the overwritten relation.
107 * Cycle-free, therefore must terminate.
110 * @param set A set of entities.
111 * @param size Number of entities in set.
114 static void collect_impls(entity *method, eset *set, int *size, bool *open) {
117 if (get_entity_peculiarity(method) == peculiarity_existent) {
118 if (get_entity_visibility(method) == visibility_external_allocated) {
119 assert(get_entity_irg(method) == NULL);
122 assert(get_entity_irg(method) != NULL);
123 if (!eset_contains(set, method)) {
124 eset_insert(set, method);
130 if (get_entity_peculiarity(method) == peculiarity_inherited) {
131 entity *impl_ent = get_inherited_methods_implementation(method);
132 assert(impl_ent && "no implementation for inherited entity");
133 if (get_entity_visibility(impl_ent) == visibility_external_allocated) {
134 assert(get_entity_irg(impl_ent) == NULL);
137 assert(get_entity_irg(impl_ent) != NULL);
138 if (!eset_contains(set, impl_ent)) {
139 eset_insert(set, impl_ent);
144 /** recursive descent **/
145 for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i)
146 collect_impls(get_entity_overwrittenby(method, i), set, size, open);
150 /** Alle Methoden bestimmen, die die übergebene Methode überschreiben
151 * (und implementieren). In der zurückgegebenen Reihung kommt jede
152 * Methode nur einmal vor. Der Wert 'NULL' steht für unbekannte
153 * (externe) Methoden. Die zurückgegebene Reihung muß vom Aufrufer
154 * wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es überhaupt
155 * keine Methoden, die "method" überschreiben, so gibt die Methode
160 static entity ** get_impl_methods(entity * method) {
161 eset * set = eset_create();
166 /* Collect all method entities that can be called here */
167 collect_impls(method, set, &size, &open);
169 /* Vorgaenger einfuegen. */
170 if (size == 0 && !open) {
171 /* keine implementierte überschriebene Methode */
175 arr = NEW_ARR_F(entity *, size + 1);
176 arr[0] = NULL; /* Represents open method */
177 for (ent = eset_first(set); size > 0; ent = eset_next(set), --size)
181 arr = NEW_ARR_F(entity *, size);
182 for (size -= 1, ent = eset_first(set); size >= 0; ent = eset_next(set), --size)
190 /* debug makros used in sel_methods_walker */
191 #define SIZ(x) sizeof(x)/sizeof((x)[0])
193 #define DBG_OPT_NORMALIZE \
194 __dbg_info_merge_pair(new_node, node, dbg_const_eval)
195 #define DBG_OPT_POLY_ALLOC \
199 ons[1] = skip_Proj(get_Sel_ptr(node)); \
200 __dbg_info_merge_sets(&new_node, 1, ons, SIZ(ons), dbg_rem_poly_call); \
202 #define DBG_OPT_POLY \
203 __dbg_info_merge_pair(new_node, node, dbg_rem_poly_call)
207 /** Analyse address computations.
209 * - If the node is a SymConst replace it by Const(ent) if possible.
210 * - If the node is a Sel:
211 * * If the pointer to the Sel comes directly from an Alloc node
212 * replace the Sel by a Const(ent).
215 * @param node The node to analyze
216 * @param ldname_map A map that mapps names of entities to the entities.
218 static void sel_methods_walker(ir_node * node, pmap * ldname_map) {
220 if (get_irn_op(node) == op_SymConst) {
221 /* Wenn möglich SymConst-Operation durch Const-Operation
223 if (get_SymConst_kind(node) == symconst_addr_name) {
224 pmap_entry * entry = pmap_find(ldname_map, (void *) get_SymConst_name(node));
225 if (entry != NULL) { /* Method is declared in the compiled code */
226 entity * ent = entry->value;
227 if (get_opt_normalize() && (get_entity_visibility(ent) != visibility_external_allocated)) { /* Meth. is defined */
230 assert(get_entity_irg(ent));
232 set_irg_current_block(current_ir_graph, get_nodes_block(node));
233 new_node = new_d_SymConst(get_irn_dbg_info(node), sym, symconst_addr_ent); DBG_OPT_NORMALIZE;
235 exchange(node, new_node);
239 } else if (get_irn_op(node) == op_Sel &&
240 is_method_type(get_entity_type(get_Sel_entity(node)))) {
241 entity * ent = get_Sel_entity(node);
242 if (get_opt_optimize() && get_opt_dyn_meth_dispatch() &&
243 (get_irn_op(skip_Proj(get_Sel_ptr(node))) == op_Alloc)) {
246 /* We know which method will be called, no dispatch necessary. */
248 assert(get_entity_peculiarity(ent) != peculiarity_description);
249 set_irg_current_block(current_ir_graph, get_nodes_block(node));
250 /* @@@ Is this correct?? Alloc could reference a subtype of the owner
251 of Sel that overwrites the method referenced in Sel. */
252 /* @@@ Yes, this is wrong. GL, 10.3.04 */
253 new_node = copy_const_value(get_atomic_ent_value(ent)); DBG_OPT_POLY_ALLOC;
255 called_ent = resolve_ent_polymorphy(get_Alloc_type(skip_Proj(get_Sel_ptr(node))), ent);
256 set_irg_current_block(current_ir_graph, get_nodes_block(node));
257 /* called_ent may not be description: has no Address/Const to Call! */
258 assert(get_entity_peculiarity(called_ent) != peculiarity_description);
259 new_node = copy_const_value(get_atomic_ent_value(called_ent)); DBG_OPT_POLY_ALLOC;
261 exchange (node, new_node);
263 assert(get_entity_peculiarity(ent) != peculiarity_inherited);
264 if (!eset_contains(entities, ent)) {
265 /* Entity noch nicht behandelt. Alle (intern oder extern)
266 * implementierten Methoden suchen, die diese Entity
267 * überschreiben. Die Menge an entity.link speichern. */
268 set_entity_link(ent, get_impl_methods(ent));
269 eset_insert(entities, ent);
271 if (get_entity_link(ent) == NULL) {
272 /* Die Sel-Operation kann nie einen Zeiger auf eine aufrufbare
273 * Methode zurückgeben. Damit ist sie insbesondere nicht
274 * ausführbar und nicht erreichbar. */
275 /* Gib eine Warnung aus wenn die Entitaet eine Beschreibung ist
276 fuer die es keine Implementierung gibt. */
277 if (get_entity_peculiarity(ent) == peculiarity_description) {
278 /* @@@ GL Methode um Fehler anzuzeigen aufrufen! */
279 printf("WARNING: Calling method description %s\n in method %s\n of class %s\n which has "
280 "no implementation!\n", get_entity_name(ent),
281 get_entity_name(get_irg_entity(current_ir_graph)),
282 get_type_name(get_entity_owner(get_irg_entity(current_ir_graph))));
283 printf("This happens when compiling a Java Interface that's never really used, i.e., "
284 "no class implementing the interface is ever used.\n");
286 exchange(node, new_Bad());
289 entity ** arr = get_entity_link(ent);
293 printf("\nCall site "); DDMN(node);
294 printf(" in "); DDME(get_irg_entity(current_ir_graph));
295 printf(" can call:\n");
296 for (i = 0; i < ARR_LEN(arr); i++) {
297 printf(" - "); DDME(arr[i]);
298 printf(" with owner "); DDMT(get_entity_owner(arr[i]));
303 if (get_opt_optimize() && get_opt_dyn_meth_dispatch() &&
304 (ARR_LEN(arr) == 1 && arr[0] != NULL)) {
306 /* Die Sel-Operation kann immer nur einen Wert auf eine
307 * interne Methode zurückgeben. Wir können daher die
308 * Sel-Operation durch eine Const- bzw. SymConst-Operation
310 set_irg_current_block(current_ir_graph, get_nodes_block(node));
311 /* assert(get_entity_peculiarity(tarval_to_entity(get_Const_tarval(get_atomic_ent_value(arr[0])))) == peculiarity_existent); */
312 new_node = copy_const_value(get_atomic_ent_value(arr[0])); DBG_OPT_POLY;
313 exchange (node, new_node);
321 /** Datenstruktur initialisieren. Zusätzlich werden alle
322 * SymConst-Operationen, die auf interne Methoden verweisen, durch
323 * Const-Operationen ersetzt. */
324 static void sel_methods_init(void) {
326 pmap * ldname_map = pmap_create(); /* Map entitiy names to entities: to replace SymConst by Const(ent). */
327 assert(entities == NULL);
328 entities = eset_create();
329 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
330 entity * ent = get_irg_entity(get_irp_irg(i));
331 /* Nur extern sichtbare Methode können überhaupt mit SymConst
332 * aufgerufen werden. */
333 if (get_entity_visibility(ent) != visibility_local) {
334 pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent);
337 all_irg_walk((irg_walk_func *) sel_methods_walker, NULL, ldname_map);
338 pmap_destroy(ldname_map);
341 /*****************************************************************************/
343 /* Datenstruktur freigeben. */
344 static void sel_methods_dispose(void) {
347 for (ent = eset_first(entities); ent; ent = eset_next(entities)) {
348 entity ** arr = get_entity_link(ent);
352 set_entity_link(ent, NULL);
354 eset_destroy(entities);
359 /* Gibt die Menge aller Methoden zurück, die an diesem Sel-Knoten
360 * zurückgegeben werden können. Die Liste enthält keine doppelten
362 static entity ** get_Sel_arr(ir_node * sel) {
363 static entity ** NULL_ARRAY = NULL;
366 assert(sel && get_irn_op(sel) == op_Sel);
367 ent = get_Sel_entity(sel);
368 assert(is_method_type(get_entity_type(ent))); /* what else? */
369 arr = get_entity_link(ent);
373 /* "NULL" zeigt an, dass keine Implementierung existiert. Dies
374 * kann für polymorphe (abstrakte) Methoden passieren. */
376 NULL_ARRAY = NEW_ARR_F(entity *, 0);
383 static int get_Sel_n_methods(ir_node * sel) {
384 return ARR_LEN(get_Sel_arr(sel));
388 static entity * get_Sel_method(ir_node * sel, int pos) {
389 entity ** arr = get_Sel_arr(sel);
390 assert(pos >= 0 && pos < ARR_LEN(arr));
396 /* --- callee analysis ------------------------------------------------------ */
399 static void callee_ana_node(ir_node * node, eset * methods);
402 static void callee_ana_proj(ir_node * node, long n, eset * methods) {
403 assert(get_irn_mode(node) == mode_T);
404 if (get_irn_link(node) == MARK) {
405 /* already visited */
408 set_irn_link(node, MARK);
410 switch (get_irn_opcode(node)) {
412 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
413 * op_Tuple oder ein Knoten, der eine "freie Methode"
415 ir_node * pred = get_Proj_pred(node);
416 if (get_irn_link(pred) != MARK) {
417 if (get_irn_op(pred) == op_Tuple) {
418 callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods);
420 eset_insert(methods, MARK); /* free method -> unknown */
427 callee_ana_node(get_Tuple_pred(node, n), methods);
431 callee_ana_proj(get_Id_pred(node), n, methods);
435 eset_insert(methods, MARK); /* free method -> unknown */
439 set_irn_link(node, NULL);
443 static void callee_ana_node(ir_node * node, eset * methods) {
446 assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node));
447 /* rekursion verhindern */
448 if (get_irn_link(node) == MARK) {
449 /* already visited */
452 set_irn_link(node, MARK);
454 switch (get_irn_opcode(node)) {
456 if (get_SymConst_kind(node) == symconst_addr_ent) {
457 entity * ent = get_SymConst_entity(node);
458 assert(ent && is_method_type(get_entity_type(ent)));
459 if (get_entity_visibility(ent) != visibility_external_allocated) {
460 assert(get_entity_irg(ent));
461 eset_insert(methods, ent);
463 eset_insert(methods, MARK); /* free method -> unknown */
466 assert(get_SymConst_kind(node) == symconst_addr_name);
467 /* externe Methode (wegen fix_symconst!) */
468 eset_insert(methods, MARK); /* free method -> unknown */
472 /* polymorphe Methode */
473 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
474 entity * ent = get_Sel_method(node, i);
476 eset_insert(methods, ent);
478 eset_insert(methods, MARK);
487 case iro_Phi: /* Vereinigung */
488 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
489 callee_ana_node(get_Phi_pred(node, i), methods);
494 callee_ana_node(get_Id_pred(node), methods);
498 callee_ana_proj(get_Proj_pred(node), get_Proj_proj(node), methods);
505 eset_insert(methods, MARK); /* free method -> unknown */
509 assert(0 && "invalid opcode or opcode not implemented");
513 set_irn_link(node, NULL);
517 static void callee_walker(ir_node * call, void * env) {
518 if (get_irn_op(call) == op_Call) {
519 eset * methods = eset_create();
521 entity ** arr = NEW_ARR_F(entity *, 0);
522 callee_ana_node(skip_Id(get_Call_ptr(call)), methods);
523 if (eset_contains(methods, MARK)) { /* unknown method */
524 ARR_APP1(entity *, arr, NULL);
526 for (ent = eset_first(methods); ent; ent = eset_next(methods)) {
528 ARR_APP1(entity *, arr, ent);
531 if (ARR_LEN(arr) == 0) {
532 /* Kann vorkommen, wenn der Vorgänger beispielsweise eine
533 * Sel-Operation war, die keine Methoden zurückgeben
534 * konnte. Wir ersetzen die Call-Operation ebenfalls durch
535 * eine Bad-Operation. Die Verlinkung muss wiederhergestellt
537 /* exchange(call, new_Bad()); invalid firm */
539 ir_node *mem = get_Call_mem(call);
540 turn_into_tuple (call, 5 /* pn_Call_max */);
541 set_Tuple_pred(call, pn_Call_M_regular , mem);
542 set_Tuple_pred(call, pn_Call_T_result , new_Bad());
543 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
544 set_Tuple_pred(call, pn_Call_X_except , new_Bad()); /* new_Jmp() ?? new_Raise() ?? */
545 set_Tuple_pred(call, pn_Call_M_except , mem);
548 set_Call_callee_arr(call, ARR_LEN(arr), arr);
551 eset_destroy(methods);
556 /* Bestimmt für jede Call-Operation die Menge der aufrufbaren Methode
557 * und speichert das Ergebnis in der Call-Operation. (siehe
558 * "set_Call_callee"). "sel_methods" wird für den Aufbau benötigt und
559 * muss bereits aufgebaut sein. */
560 static void callee_ana(void) {
562 /* Alle Graphen analysieren. */
563 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
564 irg_walk_graph(get_irp_irg(i), callee_walker, NULL, NULL);
565 set_irg_callee_info_state(get_irp_irg(i), irg_callee_info_consistent);
571 /* --- free method analysis ------------------------------------------------- */
574 static void free_mark(ir_node * node, eset * set);
576 static void free_mark_proj(ir_node * node, long n, eset * set) {
577 assert(get_irn_mode(node) == mode_T);
578 if (get_irn_link(node) == MARK) {
579 /* already visited */
582 set_irn_link(node, MARK);
583 switch (get_irn_opcode(node)) {
585 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
586 * op_Tuple oder ein Knoten, der in "free_ana_walker" behandelt
588 ir_node * pred = get_Proj_pred(node);
589 if (get_irn_link(pred) != MARK && get_irn_op(pred) == op_Tuple) {
590 free_mark_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, set);
592 /* nothing: da in "free_ana_walker" behandelt. */
598 free_mark(get_Tuple_pred(node, n), set);
602 free_mark_proj(get_Id_pred(node), n, set);
608 /* nothing: Die Operationen werden in "free_ana_walker" selbst
613 assert(0 && "unexpected opcode or opcode not implemented");
616 set_irn_link(node, NULL);
620 static void free_mark(ir_node * node, eset * set) {
622 assert(mode_is_reference(get_irn_mode(node)));
623 if (get_irn_link(node) == MARK) {
624 return; /* already visited */
626 set_irn_link(node, MARK);
627 switch (get_irn_opcode(node)) {
629 entity * ent = get_Sel_entity(node);
630 if (is_method_type(get_entity_type(ent))) {
631 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
632 eset_insert(set, get_Sel_method(node, i));
638 if (get_SymConst_kind(node) == symconst_addr_ent) {
639 entity * ent = get_SymConst_entity(node);
640 if (is_method_type(get_entity_type(ent))) {
641 eset_insert(set, ent);
644 assert(get_SymConst_kind(node) == symconst_addr_name);
645 /* nothing: SymConst points to extern method */
650 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
651 free_mark(get_Phi_pred(node, i), set);
655 free_mark(get_Id_pred(node), set);
658 free_mark_proj(get_Proj_pred(node), get_Proj_proj(node), set);
661 /* nothing: Wird unten behandelt! */
664 set_irn_link(node, NULL);
668 static void free_ana_walker(ir_node * node, eset * set) {
670 if (get_irn_link(node) == MARK) {
671 /* bereits in einem Zyklus besucht. */
674 switch (get_irn_opcode(node)) {
685 /* Sonderbehandlung, da der Funktionszeigereingang natürlich kein
688 set_irn_link(node, MARK);
689 for (i = get_Call_arity(node) - 1; i >= 0; --i) {
690 ir_node * pred = get_Call_param(node, i);
691 if (mode_is_reference(get_irn_mode(pred))) {
692 free_mark(pred, set);
696 /* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis
697 * jemand das Gegenteil implementiert. */
699 set_irn_link(node, MARK);
700 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
701 ir_node * pred = get_irn_n(node, i);
702 if (mode_is_reference(get_irn_mode(pred))) {
703 free_mark(pred, set);
708 set_irn_link(node, NULL);
712 /* Die Datenstrukturen für sel-Methoden (sel_methods) muß vor dem
713 * Aufruf von "get_free_methods" aufgebaut sein. Die (internen)
714 * SymConst-Operationen müssen in passende Const-Operationen
715 * umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer
716 * auf eine echt externe Methode. */
717 static entity ** get_free_methods(int whole)
719 eset * set = eset_create();
721 entity ** arr = NEW_ARR_F(entity *, 0);
725 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
726 ir_graph * irg = get_irp_irg(i);
727 entity * ent = get_irg_entity(irg);
728 /* insert "external visible" methods. */
729 if (get_entity_visibility(ent) != visibility_local) {
730 eset_insert(set, ent);
732 /* Finde alle Methoden die in dieser Methode extern sichtbar werden,
733 z.B. da die Adresse einer Methode abgespeichert wird. */
734 irg_walk_graph(irg, NULL, (irg_walk_func *) free_ana_walker, set);
738 /* insert sticky methods, too */
739 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
740 ir_graph * irg = get_irp_irg(i);
741 entity * ent = get_irg_entity(irg);
742 /* insert "external visible" methods. */
743 if (get_entity_stickyness (ent) == stickyness_sticky) {
744 eset_insert(set, ent);
748 /* Hauptprogramm ist auch dann frei, wenn es nicht "external
750 if (get_irp_main_irg()) {
751 eset_insert(set, get_irg_entity(get_irp_main_irg()));
753 /* Wandle Menge in Feld um. Effizienter. */
754 for (ent = eset_first(set); ent; ent = eset_next(set)) {
755 ARR_APP1(entity *, arr, ent);
762 void cgana(int *length, entity ***free_methods, int whole) {
763 entity ** free_meths;
767 free_meths = get_free_methods(whole);
769 sel_methods_dispose();
771 /* Convert the flexible array to an array that can be handled
773 *length = ARR_LEN(free_meths);
774 *free_methods = (entity **)malloc(sizeof(entity *) * (*length));
775 for (i = 0; i < (*length); i++) (*free_methods)[i] = free_meths[i];
776 DEL_ARR_F(free_meths);
781 static void destruct_walker(ir_node * node, void * env) {
782 if (get_irn_op(node) == op_Call) {
783 remove_Call_callee_arr(node);
787 void free_callee_info(ir_graph *irg) {
788 irg_walk_graph(irg, destruct_walker, NULL, NULL);
789 set_irg_callee_info_state(irg, irg_callee_info_none);
793 /* Optimize the address expressions passed to call nodes.
795 * This optimization performs the following transformations for
797 * - All SymConst operations that refer to intern methods are replaced
798 * by Const operations refering to the corresponding entity.
799 * - Sel nodes, that select entities that are not overwritten are
800 * replaced by Const nodes refering to the selected entity.
801 * - Sel nodes, for witch no method exists at all are replaced by Bad
803 * - Sel nodes with a pointer input that is an Alloc node are replaced
804 * by Const nodes refering to the entity that implements the method in
805 * the type given by the Alloc node.
807 void opt_call_addrs(void) {
809 sel_methods_dispose();
812 pmap * ldname_map = pmap_create();
813 assert(entities == NULL);
814 entities = eset_create();
815 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
816 entity * ent = get_irg_entity(get_irp_irg(i));
817 /* Nur extern sichtbare Methoden können überhaupt mit SymConst
818 * aufgerufen werden. */
819 if (get_entity_visibility(ent) != local) {
820 pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent);
823 all_irg_walk((irg_walk_func *) sel_methods_walker, NULL, ldname_map);
824 pmap_destroy(ldname_map);