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 Intraprozedural analyses to estimate the call graph.
23 * @author Hubert Schmid
27 * Interprocedural analysis to estimate the calling relation.
29 * This analysis computes all entities representing methods that
30 * can be called at a Call node. Further it computes a set of
31 * methods that are 'free', i.e., their adress is handled by
32 * the program directly, or they are visible external.
55 #include "dbginfo_t.h"
56 #include "iropt_dbg.h"
68 /* unambiguous address used as a mark. */
69 static void *MARK = &MARK;
71 static eset *entities = NULL;
73 /*--------------------------------------------------------------------------*/
75 /*--------------------------------------------------------------------------*/
78 /*--------------------------------------------------------------------------*/
79 /* Initialize datastructures, remove unwanted constructs, optimize */
80 /* call target computations. */
81 /*--------------------------------------------------------------------------*/
83 /** Returns the entity that contains the implementation of the inherited
84 * entity if available, else returns the entity passed. */
85 static ir_entity *get_inherited_methods_implementation(ir_entity *inh_meth) {
86 assert(get_atomic_ent_value(inh_meth) && "constant entity without value");
87 assert((get_irn_op(get_atomic_ent_value(inh_meth)) == op_SymConst) &&
88 (get_SymConst_kind(get_atomic_ent_value(inh_meth)) == symconst_addr_ent) &&
89 "Complex constant values not supported -- address of method should be straight constant!");
91 return get_SymConst_entity(get_atomic_ent_value(inh_meth));
94 /** Collect the entity representing the implementation of this
95 * method (not the same if inherited) and all entities for overwriting
96 * implementations in "set".
97 * If the implementation of the method is not included in the
98 * compilation unit "open" is set to true.
99 * A recursive descend in the overwritten relation.
100 * Cycle-free, therefore must terminate.
103 * @param set A set of entities.
104 * @param size Number of entities in set.
107 static void collect_impls(ir_entity *method, eset *set, int *size, int *open) {
111 /* Add the implementation to the set if it contains an irg, else
112 remember that there are more methods called. */
114 if (get_entity_peculiarity(method) == peculiarity_inherited)
115 impl = get_inherited_methods_implementation(method);
117 if (get_entity_peculiarity(method) != peculiarity_description) {
118 eset_insert(set, impl);
122 /*- recursive descent -*/
123 for (i = get_entity_n_overwrittenby(method) - 1; i >= 0; --i)
124 collect_impls(get_entity_overwrittenby(method, i), set, size, open);
127 /** Alle Methoden bestimmen, die die übergebene Methode überschreiben
128 * (und implementieren). In der zurückgegebenen Reihung kommt jede
129 * Methode nur einmal vor. Der Wert 'NULL' steht für unbekannte
130 * (externe) Methoden. Die zurückgegebene Reihung muß vom Aufrufer
131 * wieder freigegeben werden (siehe "DEL_ARR_F"). Gibt es überhaupt
132 * keine Methoden, die "method" überschreiben, so gibt die Methode
137 static ir_entity ** get_impl_methods(ir_entity * method) {
138 eset * set = eset_create();
143 /* Collect all method entities that can be called here */
144 collect_impls(method, set, &size, &open);
146 /* Vorgaenger einfuegen. */
147 if (size == 0 && !open) {
148 /* keine implementierte überschriebene Methode */
152 arr = NEW_ARR_F(ir_entity *, size + 1);
153 arr[0] = NULL; /* Represents open method */
154 for (ent = eset_first(set); size > 0; ent = eset_next(set), --size)
158 arr = NEW_ARR_F(ir_entity *, size);
159 for (size -= 1, ent = eset_first(set); size >= 0; ent = eset_next(set), --size)
166 /** Analyze address computations.
168 * Compute for all Sel nodes the set of methods that can be selected.
169 * For each entity we store the set of subentities in the link field.
171 * Further do some optimizations:
172 * - Call standard optimizations for Sel nodes: this removes polymorphic
174 * - If the node is a SymConst(name) replace it by SymConst(ent) if possible.
175 * For this we precomputed a map name->entity. Nowadays, we no more support
177 * - If the node is a Sel:
178 * If we found only a single method that can be called, replace the Sel
179 * by a SymConst. This is more powerful than the analysis in opt_polymorphy,
180 * as here we walk the type graph. In opt_polymorphy we only apply a local
183 * @param node The node to analyze
184 * @param env A map that maps names of entities to the entities.
186 static void sel_methods_walker(ir_node * node, void *env) {
187 pmap *ldname_map = env;
190 /* Call standard optimizations */
192 ir_node *new_node = optimize_in_place(node);
193 if (node != new_node)
194 exchange(node, new_node);
197 /* replace SymConst(name)-operations by SymConst(ent) */
198 if (get_irn_op(node) == op_SymConst) {
199 if (get_SymConst_kind(node) == symconst_addr_name) {
200 pmap_entry * entry = pmap_find(ldname_map, (void *) get_SymConst_name(node));
201 if (entry != NULL) { /* Method is declared in the compiled code */
202 assert(0 && "There should not be a SymConst[addr_name] addressing a method with an implementation"
203 "in this compilation unit. Use a SymConst[addr_ent].");
207 else if (get_irn_op(node) == op_Sel &&
208 is_Method_type(get_entity_type(get_Sel_entity(node)))) {
209 ir_entity * ent = get_SymConst_entity(get_atomic_ent_value(get_Sel_entity(node)));
210 assert(get_entity_peculiarity(ent) != peculiarity_inherited);
212 if (!eset_contains(entities, ent)) {
213 /* Entity not yet handled. Find all (internal or external)
214 * implemented methods that overwrites this entity.
215 * This set is stored in the entity link. */
216 set_entity_link(ent, get_impl_methods(ent));
217 eset_insert(entities, ent);
220 /* -- As an add on we get an optimization that removes polymorphic calls.
221 This optimization is more powerful than that in transform_node_Sel(). -- */
222 arr = get_entity_link(ent);
225 * The Sel node never returns a pointer to a usable method.
226 * We could not call it, but it may be description:
227 * We call a method in a dead part of the program.
229 assert (get_entity_peculiarity(ent) == peculiarity_description);
231 else if (get_opt_optimize() && get_opt_closed_world() && get_opt_dyn_meth_dispatch() &&
232 (ARR_LEN(arr) == 1 && arr[0] != NULL)) {
236 * The Sel node returns only one possible method.
237 * So we could replace the Sel node by a SymConst.
238 * This method must exists.
240 set_irg_current_block(current_ir_graph, get_nodes_block(node));
241 assert(get_entity_peculiarity(get_SymConst_entity(get_atomic_ent_value(arr[0]))) ==
242 peculiarity_existent);
243 new_node = copy_const_value(get_irn_dbg_info(node), get_atomic_ent_value(arr[0]));
244 DBG_OPT_POLY(node, new_node);
245 exchange(node, new_node);
250 /** Initialize auxiliary data structures.
252 * Computes a set of entities that overwrite an entity and contain
253 * an implementation. The set is stored in the entity's link field.
255 * Further replaces Sel nodes where this set contains exactly one
256 * method by SymConst nodes.
257 * Finally asserts if there is a SymConst(name) if there could be a
259 static void sel_methods_init(void) {
261 pmap * ldname_map = pmap_create(); /* Map entity names to entities: to replace
262 SymConst(name) by SymConst(ent). */
263 assert(entities == NULL);
264 entities = eset_create();
265 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
266 ir_entity * ent = get_irg_entity(get_irp_irg(i));
267 /* only external visible methods are allowed to call by a SymConst_ptr_name */
268 if (get_entity_visibility(ent) != visibility_local) {
269 pmap_insert(ldname_map, (void *) get_entity_ld_ident(ent), ent);
273 all_irg_walk(sel_methods_walker, NULL, ldname_map);
274 pmap_destroy(ldname_map);
277 /*--------------------------------------------------------------------------*/
278 /* Find free methods.
280 * We expect that each entity has an array with all implementations in its
282 /*--------------------------------------------------------------------------*/
285 * Returns an array of all methods that could be called at a Sel node.
286 * This array contains every entry only once.
288 * @param sel the Sel node
290 static ir_entity ** get_Sel_arr(ir_node * sel) {
291 static ir_entity ** NULL_ARRAY = NULL;
296 ent = get_Sel_entity(sel);
297 ent = get_inherited_methods_implementation(ent);
299 assert(is_Method_type(get_entity_type(ent))); /* what else? */
300 arr = get_entity_link(ent);
304 /* "NULL" zeigt an, dass keine Implementierung existiert. Dies
305 * kann für polymorphe (abstrakte) Methoden passieren. */
307 NULL_ARRAY = NEW_ARR_F(ir_entity *, 0);
314 * Returns the number of possible called methods at a Sel node.
316 * @param sel the Sel node
318 static int get_Sel_n_methods(ir_node * sel) {
319 return ARR_LEN(get_Sel_arr(sel));
323 * Returns the ith possible called method entity at a Sel node.
325 static ir_entity * get_Sel_method(ir_node * sel, int pos) {
326 ir_entity ** arr = get_Sel_arr(sel);
327 assert(pos >= 0 && pos < ARR_LEN(arr));
331 static void free_mark(ir_node * node, eset * set);
333 static void free_mark_proj(ir_node * node, long n, eset * set) {
334 assert(get_irn_mode(node) == mode_T);
335 if (get_irn_link(node) == MARK) {
336 /* already visited */
339 set_irn_link(node, MARK);
340 switch (get_irn_opcode(node)) {
342 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
343 * op_Tuple oder ein Knoten, der in "free_ana_walker" behandelt
345 ir_node * pred = get_Proj_pred(node);
346 if (get_irn_link(pred) != MARK && get_irn_op(pred) == op_Tuple) {
347 free_mark_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, set);
349 /* nothing: da in "free_ana_walker" behandelt. */
355 free_mark(get_Tuple_pred(node, n), set);
359 free_mark_proj(get_Id_pred(node), n, set);
365 /* nothing: Die Operationen werden in free_ana_walker() selbst
370 assert(0 && "unexpected opcode or opcode not implemented");
373 set_irn_link(node, NULL);
377 * Called for predecessors nodes of "interesting" ones.
378 * Interesting ones include all nodes that can somehow make
381 * If a method (or a set of methods in case of polymorph calls) gets visible,
382 * add it to the set of 'free' methods
384 * @param node the current visited node
385 * @param set the set of all free methods
387 static void free_mark(ir_node *node, eset * set) {
390 if (get_irn_link(node) == MARK)
391 return; /* already visited */
393 set_irn_link(node, MARK);
395 switch (get_irn_opcode(node)) {
397 ir_entity * ent = get_Sel_entity(node);
398 if (is_Method_type(get_entity_type(ent))) {
399 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
400 eset_insert(set, get_Sel_method(node, i));
406 if (get_SymConst_kind(node) == symconst_addr_ent) {
407 ir_entity * ent = get_SymConst_entity(node);
408 if (is_Method_type(get_entity_type(ent))) {
409 eset_insert(set, ent);
412 assert(get_SymConst_kind(node) == symconst_addr_name);
413 /* nothing: SymConst points to extern method */
418 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
419 free_mark(get_Phi_pred(node, i), set);
423 free_mark(get_Id_pred(node), set);
426 free_mark_proj(get_Proj_pred(node), get_Proj_proj(node), set);
429 /* nothing: Wird unten behandelt! */
432 set_irn_link(node, NULL);
436 * post-walker. Find method addresses.
438 static void free_ana_walker(ir_node *node, void *env) {
442 if (get_irn_link(node) == MARK) {
443 /* already visited */
446 switch (get_irn_opcode(node)) {
457 /* Sonderbehandlung, da der Funktionszeigereingang natürlich kein
460 set_irn_link(node, MARK);
461 for (i = get_Call_n_params(node) - 1; i >= 0; --i) {
462 ir_node *pred = get_Call_param(node, i);
463 if (mode_is_reference(get_irn_mode(pred))) {
464 free_mark(pred, set);
468 /* other nodes: Alle anderen Knoten nehmen wir als Verräter an, bis
469 * jemand das Gegenteil implementiert. */
471 set_irn_link(node, MARK);
472 for (i = get_irn_arity(node) - 1; i >= 0; --i) {
473 ir_node * pred = get_irn_n(node, i);
474 if (mode_is_reference(get_irn_mode(pred))) {
475 free_mark(pred, set);
480 set_irn_link(node, NULL);
484 * Add all method addresses in global initializers to the set.
487 * We do NOT check the type here, just it it's an entity address.
488 * The reason for this is code like:
490 * void *p = function;
492 * which is sometimes used to anchor functions.
494 static void add_method_address(ir_entity *ent, eset *set)
500 /* do not check uninitialized values */
501 if (get_entity_variability(ent) == variability_uninitialized)
504 if (is_atomic_entity(ent)) {
505 tp = get_entity_type(ent);
507 /* ignore methods: these of course reference it's address */
508 if (is_Method_type(tp))
511 /* let's check if it's the address of a function */
512 n = get_atomic_ent_value(ent);
513 if (get_irn_op(n) == op_SymConst) {
514 if (get_SymConst_kind(n) == symconst_addr_ent) {
515 ent = get_SymConst_entity(n);
517 if (is_Method_type(get_entity_type(ent)))
518 eset_insert(set, ent);
523 for (i = get_compound_ent_n_values(ent) - 1; i >= 0; --i) {
524 n = get_compound_ent_value(ent, i);
526 /* let's check if it's the address of a function */
527 if (get_irn_op(n) == op_SymConst) {
528 if (get_SymConst_kind(n) == symconst_addr_ent) {
529 ir_entity *ent = get_SymConst_entity(n);
531 if (is_Method_type(get_entity_type(ent)))
532 eset_insert(set, ent);
540 * returns a list of 'free' methods, i.e., the methods that can be called
541 * from external or via function pointers.
543 * Die Datenstrukturen für sel-Methoden (sel_methods) muß vor dem
544 * Aufruf von "get_free_methods" aufgebaut sein. Die (internen)
545 * SymConst(name)-Operationen müssen in passende SymConst(ent)-Operationen
546 * umgewandelt worden sein, d.h. SymConst-Operationen verweisen immer
547 * auf eine echt externe Methode.
549 static ir_entity ** get_free_methods(void)
551 eset *free_set = eset_create();
553 ir_entity **arr = NEW_ARR_F(ir_entity *, 0);
558 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
559 irg = get_irp_irg(i);
560 ent = get_irg_entity(irg);
561 /* insert "external visible" methods. */
562 if (get_entity_visibility(ent) != visibility_local) {
563 eset_insert(free_set, ent);
565 /* Finde alle Methoden die in dieser Methode extern sichtbar werden,
566 z.B. da die Adresse einer Methode abgespeichert wird. */
567 irg_walk_graph(irg, NULL, free_ana_walker, free_set);
570 /* insert sticky methods, too */
571 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
572 ent = get_irg_entity(get_irp_irg(i));
573 /* insert "sticky" methods. */
574 if (get_entity_stickyness (ent) == stickyness_sticky) {
575 eset_insert(free_set, ent);
579 /* insert all methods the initializes global variables */
580 glob = get_glob_type();
581 for (i = get_class_n_members(glob) - 1; i >= 0; --i) {
582 ent = get_class_member(glob, i);
584 add_method_address(ent, free_set);
587 /* the main program is even then "free", if it's not external visible. */
588 irg = get_irp_main_irg();
590 eset_insert(free_set, get_irg_entity(irg));
592 /* Finally, transform the set into an array. */
593 for (ent = eset_first(free_set); ent; ent = eset_next(free_set)) {
594 ARR_APP1(ir_entity *, arr, ent);
596 eset_destroy(free_set);
601 /*--------------------------------------------------------------------------*/
602 /* Callee analysis. */
603 /*--------------------------------------------------------------------------*/
605 static void callee_ana_node(ir_node * node, eset * methods);
607 static void callee_ana_proj(ir_node * node, long n, eset * methods) {
608 assert(get_irn_mode(node) == mode_T);
609 if (get_irn_link(node) == MARK) {
610 /* already visited */
613 set_irn_link(node, MARK);
615 switch (get_irn_opcode(node)) {
617 /* proj_proj: in einem "sinnvollen" Graphen kommt jetzt ein
618 * op_Tuple oder ein Knoten, der eine "freie Methode"
620 ir_node * pred = get_Proj_pred(node);
621 if (get_irn_link(pred) != MARK) {
622 if (get_irn_op(pred) == op_Tuple) {
623 callee_ana_proj(get_Tuple_pred(pred, get_Proj_proj(node)), n, methods);
625 eset_insert(methods, MARK); /* free method -> unknown */
632 callee_ana_node(get_Tuple_pred(node, n), methods);
636 callee_ana_proj(get_Id_pred(node), n, methods);
640 eset_insert(methods, MARK); /* free method -> unknown */
644 set_irn_link(node, NULL);
648 * Analyse a Call address.
650 * @param node the node representing the call address
651 * @param methods after call contains the set of all possibly called entities
653 static void callee_ana_node(ir_node *node, eset *methods) {
656 assert(mode_is_reference(get_irn_mode(node)) || is_Bad(node));
657 /* Beware of recursion */
658 if (get_irn_link(node) == MARK) {
659 /* already visited */
662 set_irn_link(node, MARK);
664 switch (get_irn_opcode(node)) {
666 /* A direct address call. We tread this as an external
667 call and ignore it completely. */
668 eset_insert(methods, MARK); /* free method -> unknown */
671 if (get_SymConst_kind(node) == symconst_addr_ent) {
672 ir_entity *ent = get_SymConst_entity(node);
673 assert(ent && is_Method_type(get_entity_type(ent)));
674 eset_insert(methods, ent);
676 assert(get_SymConst_kind(node) == symconst_addr_name);
677 /* externe Methode (wegen fix_symconst!) */
678 eset_insert(methods, MARK); /* free method -> unknown */
682 /* polymorphe Methode */
683 for (i = get_Sel_n_methods(node) - 1; i >= 0; --i) {
684 ir_entity * ent = get_Sel_method(node, i);
686 eset_insert(methods, ent);
688 eset_insert(methods, MARK);
698 for (i = get_Phi_n_preds(node) - 1; i >= 0; --i) {
699 callee_ana_node(get_Phi_pred(node, i), methods);
704 callee_ana_node(get_Mux_false(node), methods);
705 callee_ana_node(get_Mux_true(node), methods);
709 for (i = get_Psi_n_conds(node) - 1; i >= 0; --i) {
710 callee_ana_node(get_Psi_val(node, i), methods);
712 callee_ana_node(get_Psi_default(node), methods);
716 callee_ana_node(get_Id_pred(node), methods);
720 callee_ana_proj(get_Proj_pred(node), get_Proj_proj(node), methods);
727 eset_insert(methods, MARK); /* free method -> unknown */
731 assert(0 && "invalid opcode or opcode not implemented");
735 set_irn_link(node, NULL);
739 * Walker: Analyses every call node and calculates an array of possible
740 * callees for that call.
742 static void callee_walker(ir_node * call, void * env) {
744 eset * methods = eset_create();
746 ir_entity ** arr = NEW_ARR_F(ir_entity *, 0);
747 assert(get_irn_op(get_Call_ptr(call)) != op_Id);
748 callee_ana_node(get_Call_ptr(call), methods);
749 if (eset_contains(methods, MARK)) { /* unknown method */
750 ARR_APP1(ir_entity *, arr, unknown_entity);
752 for (ent = eset_first(methods); ent; ent = eset_next(methods)) {
754 ARR_APP1(ir_entity *, arr, ent);
757 #if 0 /* This generates Bad nodes when we don't want it.
758 Call it with a check for valid cgana information in local_optimize. */
759 if (ARR_LEN(arr) == 0 && get_opt_optimize() && get_opt_closed_world() && get_opt_dyn_meth_dispatch()) {
760 /* Kann vorkommen, wenn der Vorgänger beispielsweise eine
761 * Sel-Operation war, die keine Methoden zurückgeben
762 * konnte. Wir ersetzen die Call-Operation ebenfalls durch
763 * eine Bad-Operation. Die Verlinkung muss wiederhergestellt
765 ir_node *mem = get_Call_mem(call);
766 turn_into_tuple (call, 5 /* pn_Call_max */);
767 set_Tuple_pred(call, pn_Call_M_regular , mem);
768 set_Tuple_pred(call, pn_Call_T_result , new_Bad());
769 set_Tuple_pred(call, pn_Call_P_value_res_base, new_Bad());
770 set_Tuple_pred(call, pn_Call_X_except , new_Bad()); /* new_Jmp() ?? new_Raise() ?? */
771 set_Tuple_pred(call, pn_Call_M_except , new_Bad());
776 set_Call_callee_arr(call, ARR_LEN(arr), arr);
779 eset_destroy(methods);
784 * Walker: Removes all tuple.
786 static void remove_Tuples(ir_node *proj, void *env) {
788 if (! is_Proj(proj)) return;
790 nn = skip_Tuple(proj);
791 if (nn != proj) exchange(proj, nn);
795 /* Bestimmt für jede Call-Operation die Menge der aufrufbaren Methode
796 * und speichert das Ergebnis in der Call-Operation. (siehe
797 * "set_Call_callee"). "sel_methods" wird für den Aufbau benötigt und
798 * muss bereits aufgebaut sein. */
799 static void callee_ana(void) {
801 /* Alle Graphen analysieren. */
802 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
803 ir_graph *irg = get_irp_irg(i);
804 irg_walk_graph(irg, callee_walker, remove_Tuples, NULL);
805 set_irg_callee_info_state(irg, irg_callee_info_consistent);
807 set_irp_callee_info_state(irg_callee_info_consistent);
810 /*--------------------------------------------------------------------------*/
811 /* Cleanup after analyses. */
812 /*--------------------------------------------------------------------------*/
814 /** Frees intermediate data structures. */
815 static void sel_methods_dispose(void) {
818 for (ent = eset_first(entities); ent; ent = eset_next(entities)) {
819 ir_entity ** arr = get_entity_link(ent);
823 set_entity_link(ent, NULL);
825 eset_destroy(entities);
829 /*--------------------------------------------------------------------------*/
830 /* Freeing the callee arrays. */
831 /*--------------------------------------------------------------------------*/
833 static void destruct_walker(ir_node * node, void * env) {
835 remove_Call_callee_arr(node);
839 /*--------------------------------------------------------------------------*/
841 /*--------------------------------------------------------------------------*/
843 void cgana(int *length, ir_entity ***free_methods) {
844 ir_entity ** free_meths, **p;
846 /* Optimize Sel/SymConst nodes and compute all methods that implement an entity. */
848 free_meths = get_free_methods();
850 sel_methods_dispose();
852 /* Convert the flexible array to an array that can be handled
854 p = xmalloc(sizeof(*p) * ARR_LEN(free_meths));
855 memcpy(p, free_meths, ARR_LEN(free_meths) * sizeof(*p));
857 *length = ARR_LEN(free_meths);
860 DEL_ARR_F(free_meths);
863 void free_callee_info(ir_graph *irg) {
864 irg_walk_graph(irg, destruct_walker, NULL, NULL);
865 set_irg_callee_info_state(irg, irg_callee_info_none);
868 void free_irp_callee_info(void) {
870 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
871 free_callee_info(get_irp_irg(i));
875 /* Optimize the address expressions passed to call nodes.
877 * This optimization performs the following transformations for
879 * - All SymConst operations that refer to intern methods are replaced
880 * by Const operations referring to the corresponding entity.
881 * - Sel nodes, that select entities that are not overwritten are
882 * replaced by Const nodes referring to the selected entity.
883 * - Sel nodes, for which no method exists at all are replaced by Bad
885 * - Sel nodes with a pointer input that is an Alloc node are replaced
886 * by Const nodes referring to the entity that implements the method in
887 * the type given by the Alloc node.
889 void opt_call_addrs(void) {
891 sel_methods_dispose();