2 * Copyright (C) 1995-2011 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 Lowering of Calls with compound parameters and return types.
23 * @author Michael Beck
39 #include "iroptimize.h"
44 /** A type map for def_find_pointer_type. */
45 static pmap *type_map;
48 * Default implementation for finding a pointer type for a given element type.
49 * Simple create a new one.
51 static ir_type *def_find_pointer_type(ir_type *e_type, ir_mode *mode,
54 /* Mode and alignment are always identical in all calls to def_find_pointer_type(), so
55 we simply can use a map from the element type to the pointer type. */
56 ir_type *res = (ir_type*)pmap_get(type_map, e_type);
57 if (res == NULL || get_type_mode(res) != mode) {
58 res = new_type_pointer(e_type);
59 set_type_mode(res, mode);
60 set_type_alignment_bytes(res, alignment);
61 pmap_insert(type_map, e_type, res);
67 * Creates a new lowered type for a method type with compound
68 * arguments. The new type is associated to the old one and returned.
70 * @param lp parameter struct
71 * @param mtp the method type to lower
73 * The current implementation expects that a lowered type already
74 * includes the necessary changes ...
76 static ir_type *create_modified_mtd_type(const lower_params_t *lp, ir_type *mtp)
78 ir_type *lowered, *ptr_tp, *value_type;
79 ir_type **params, **results, *res_tp;
81 ir_mode *modes[MAX_REGISTER_RET_VAL];
82 size_t n_ress, n_params, nn_ress, nn_params, i;
83 add_hidden hidden_params;
87 if (is_lowered_type(mtp)) {
88 /* the type is already lowered. Not handled yet. */
89 assert(0 && "lowered types NYI");
92 lowered = get_associated_type(mtp);
96 n_ress = get_method_n_ress(mtp);
97 NEW_ARR_A(ir_type *, results, n_ress);
99 n_params = get_method_n_params(mtp);
100 NEW_ARR_A(ir_type *, params, n_params + n_ress);
102 NEW_ARR_A(size_t, param_map, n_params + n_ress);
104 hidden_params = lp->hidden_params;
105 if (hidden_params == ADD_HIDDEN_SMART &&
106 get_method_variadicity(mtp) == variadicity_variadic)
107 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
109 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
110 /* add hidden in front */
111 for (nn_ress = nn_params = i = 0; i < n_ress; ++i) {
112 res_tp = get_method_res_type(mtp, i);
114 if (is_compound_type(res_tp)) {
117 if (lp->flags & LF_SMALL_CMP_IN_REGS)
118 n_regs = lp->ret_compound_in_regs(res_tp, modes);
121 /* this compound will be returned solely in registers */
122 panic("Returning compounds in registers not yet implemented");
125 /* this compound will be allocated on callers stack and its
126 address will be transmitted as a hidden parameter. */
127 ptr_tp = lp->find_pointer_type(res_tp, get_modeP_data(), lp->def_ptr_alignment);
128 params[nn_params] = ptr_tp;
129 param_map[nn_params] = n_params + i;
132 if (lp->flags & LF_RETURN_HIDDEN)
133 results[nn_ress++] = ptr_tp;
137 results[nn_ress++] = res_tp;
141 for (i = 0; i < n_params; ++i, ++nn_params) {
142 params[nn_params] = get_method_param_type(mtp, i);
143 param_map[nn_params] = i;
146 /* add hidden parameters last */
147 assert(get_method_variadicity(mtp) == variadicity_non_variadic &&
148 "Cannot add hidden parameters at end of variadic function");
150 for (nn_params = 0; nn_params < n_params; ++nn_params) {
151 params[nn_params] = get_method_param_type(mtp, nn_params);
152 param_map[nn_params] = nn_params;
155 for (nn_ress = i = 0; i < n_ress; ++i) {
156 res_tp = get_method_res_type(mtp, i);
158 if (is_compound_type(res_tp)) {
159 params[nn_params] = lp->find_pointer_type(res_tp, get_modeP_data(), lp->def_ptr_alignment);
160 param_map[nn_params] = n_params + i;
163 results[nn_ress++] = res_tp;
168 /* create the new type */
169 lowered = new_d_type_method(nn_params, nn_ress, get_type_dbg_info(mtp));
172 for (i = 0; i < nn_params; ++i)
173 set_method_param_type(lowered, i, params[i]);
174 for (i = 0; i < nn_ress; ++i)
175 set_method_res_type(lowered, i, results[i]);
177 var = get_method_variadicity(mtp);
178 set_method_variadicity(lowered, var);
180 /* associate the lowered type with the original one for easier access */
182 set_method_calling_convention(lowered, get_method_calling_convention(mtp) | cc_compound_ret);
185 set_lowered_type(mtp, lowered);
187 value_type = get_method_value_param_type(mtp);
188 if (value_type != NULL) {
189 /* set new param positions */
190 for (i = 0; i < nn_params; ++i) {
191 ir_entity *ent = get_method_value_param_ent(lowered, i);
192 size_t pos = param_map[i];
195 set_entity_link(ent, INT_TO_PTR(pos));
196 if (pos >= n_params) {
197 /* formally return value, ignore for now */
201 id = get_method_param_ident(mtp, pos);
203 set_method_param_ident(lowered, i, id);
204 set_entity_ident(ent, id);
208 set_lowered_type(value_type, get_method_value_param_type(lowered));
217 typedef struct cl_entry cl_entry;
219 cl_entry *next; /**< Pointer to the next entry. */
220 ir_node *call; /**< Pointer to the Call node. */
221 ir_node *copyb; /**< List of all CopyB nodes. */
225 * Walker environment for fix_args_and_collect_calls().
227 typedef struct wlk_env_t {
228 size_t arg_shift; /**< The Argument index shift for parameters. */
229 size_t first_hidden; /**< The index of the first hidden argument. */
230 struct obstack obst; /**< An obstack to allocate the data on. */
231 cl_entry *cl_list; /**< The call list. */
232 pmap *dummy_map; /**< A map for finding the dummy arguments. */
233 unsigned dnr; /**< The dummy index number. */
234 const lower_params_t *params; /**< Lowering parameters. */
235 ir_type *lowered_mtp; /**< The lowered method type of the current irg if any. */
236 ir_type *value_params; /**< The value params type if any. */
237 unsigned only_local_mem:1; /**< Set if only local memory access was found. */
238 unsigned changed:1; /**< Set if the current graph was changed. */
242 * Return the call list entry of a call node.
243 * If no entry exists yet, allocate one and enter the node into
244 * the call list of the environment.
246 * @param call A Call node.
247 * @param env The environment.
249 static cl_entry *get_Call_entry(ir_node *call, wlk_env *env)
251 cl_entry *res = (cl_entry*)get_irn_link(call);
253 cl_entry *res = OALLOC(&env->obst, cl_entry);
254 res->next = env->cl_list;
257 set_irn_link(call, res);
264 * Finds the base address of an address by skipping Sel's and address
267 * @param adr the address
268 * @param pEnt points to the base entity if any
270 static ir_node *find_base_adr(ir_node *ptr, ir_entity **pEnt)
272 ir_entity *ent = NULL;
273 assert(mode_is_reference(get_irn_mode(ptr)));
277 ent = get_Sel_entity(ptr);
278 ptr = get_Sel_ptr(ptr);
280 else if (is_Add(ptr)) {
281 ir_node *left = get_Add_left(ptr);
282 if (mode_is_reference(get_irn_mode(left)))
285 ptr = get_Add_right(ptr);
287 } else if (is_Sub(ptr)) {
288 ptr = get_Sub_left(ptr);
298 * Check if a given pointer represents non-local memory.
300 static void check_ptr(ir_node *ptr, wlk_env *env)
302 ir_storage_class_class_t sc;
305 /* still alias free */
306 ptr = find_base_adr(ptr, &ent);
307 sc = get_base_sc(classify_pointer(ptr, ent));
308 if (sc != ir_sc_localvar && sc != ir_sc_malloced) {
309 /* non-local memory access */
310 env->only_local_mem = 0;
315 * Post walker: shift all parameter indexes
316 * and collect Calls with compound returns in the call list.
317 * If a non-alias free memory access is found, reset the alias free
320 static void fix_args_and_collect_calls(ir_node *n, void *ctx)
322 wlk_env *env = (wlk_env*)ctx;
326 switch (get_irn_opcode(n)) {
328 if (env->lowered_mtp != NULL && env->value_params != NULL) {
329 ir_entity *ent = get_Sel_entity(n);
331 if (get_entity_owner(ent) == env->value_params) {
332 size_t pos = get_struct_member_index(env->value_params, ent) + env->arg_shift;
335 new_ent = get_method_value_param_ent(env->lowered_mtp, pos);
336 set_entity_ident(new_ent, get_entity_ident(ent));
337 set_Sel_entity(n, new_ent);
343 if (env->only_local_mem) {
344 ptr = get_irn_n(n, 1);
349 if (env->arg_shift > 0) {
350 ir_node *pred = get_Proj_pred(n);
352 /* Fix the argument numbers */
353 if (pred == get_irg_args(current_ir_graph)) {
354 long pnr = get_Proj_proj(n);
355 set_Proj_proj(n, pnr + env->arg_shift);
361 if (! is_self_recursive_Call(n)) {
362 /* any non self recursive call might access global memory */
363 env->only_local_mem = 0;
366 ctp = get_Call_type(n);
367 if (env->params->flags & LF_COMPOUND_RETURN) {
368 /* check for compound returns */
370 for (i = 0, n_res = get_method_n_ress(ctp); i < n_res; ++i) {
371 if (is_compound_type(get_method_res_type(ctp, i))) {
373 * This is a call with a compound return. As the result
374 * might be ignored, we must put it in the list.
376 (void)get_Call_entry(n, env);
383 if (env->only_local_mem) {
384 check_ptr(get_CopyB_src(n), env);
385 if (env->only_local_mem)
386 check_ptr(get_CopyB_dst(n), env);
388 if (env->params->flags & LF_COMPOUND_RETURN) {
389 /* check for compound returns */
390 ir_node *src = get_CopyB_src(n);
391 /* older scheme using value_res_ent */
393 ir_node *proj = get_Sel_ptr(src);
394 if (is_Proj(proj) && get_Proj_proj(proj) == pn_Call_P_value_res_base) {
395 ir_node *call = get_Proj_pred(proj);
397 /* found a CopyB from compound Call result */
398 cl_entry *e = get_Call_entry(call, env);
399 set_irn_link(n, e->copyb);
404 /* new scheme: compound results are determined by the call type only */
406 ir_node *proj = get_Proj_pred(src);
407 if (is_Proj(proj) && get_Proj_proj(proj) == pn_Call_T_result) {
408 ir_node *call = get_Proj_pred(proj);
410 ctp = get_Call_type(call);
411 if (is_compound_type(get_method_res_type(ctp, get_Proj_proj(src)))) {
412 /* found a CopyB from compound Call result */
413 cl_entry *e = get_Call_entry(call, env);
414 set_irn_link(n, e->copyb);
430 * Returns non-zero if a node is a compound address
431 * of a frame-type entity.
433 * @param ft the frame type
434 * @param adr the node
436 static int is_compound_address(ir_type *ft, ir_node *adr)
442 if (get_Sel_n_indexs(adr) != 0)
444 ent = get_Sel_entity(adr);
445 return get_entity_owner(ent) == ft;
448 /** A pair for the copy-return-optimization. */
449 typedef struct cr_pair {
450 ir_entity *ent; /**< the entity than can be removed from the frame */
451 ir_node *arg; /**< the argument that replaces the entities address */
455 * Post walker: fixes all entities addresses for the copy-return
458 * Note: We expect the length of the cr_pair array (i.e. number of compound
459 * return values) to be 1 (C, C++) in almost all cases, so ignore the
460 * linear search complexity here.
462 static void do_copy_return_opt(ir_node *n, void *ctx)
465 ir_entity *ent = get_Sel_entity(n);
466 cr_pair *arr = (cr_pair*)ctx;
469 for (i = 0, l = ARR_LEN(arr); i < l; ++i) {
470 if (ent == arr[i].ent) {
471 exchange(n, arr[i].arg);
479 * Return a Sel node that selects a dummy argument of type tp.
480 * Dummy arguments are only needed once and we use a map
482 * We could even assign all dummy arguments the same offset
483 * in the frame type ...
485 * @param irg the graph
486 * @param block the block where a newly create Sel should be placed
487 * @param tp the type of the dummy entity that should be create
488 * @param env the environment
490 static ir_node *get_dummy_sel(ir_graph *irg, ir_node *block, ir_type *tp, wlk_env *env)
495 /* use a map the check if we already create such an entity */
496 e = pmap_find(env->dummy_map, tp);
498 ent = (ir_entity*)e->value;
500 ir_type *ft = get_irg_frame_type(irg);
503 snprintf(buf, sizeof(buf), "dummy.%u", env->dnr++);
504 ent = new_entity(ft, new_id_from_str(buf), tp);
505 pmap_insert(env->dummy_map, tp, ent);
507 if (get_type_state(ft) == layout_fixed) {
508 /* Fix the layout again */
509 assert(0 && "Fixed layout not implemented");
512 return new_r_simpleSel(
520 * Add the hidden parameter from the CopyB node to the Call node.
522 * @param irg the graph
523 * @param n_com number of compound results (will be number of hidden parameters)
524 * @param ins in array to store the hidden parameters into
525 * @param entry the call list
526 * @param env the environment
528 static void add_hidden_param(ir_graph *irg, size_t n_com, ir_node **ins, cl_entry *entry, wlk_env *env)
530 ir_node *p, *n, *src, *mem, *blk;
536 for (p = entry->copyb; p; p = n) {
538 n = (ir_node*)get_irn_link(p);
539 src = get_CopyB_src(p);
541 /* old scheme using value_res_ent */
543 ent = get_Sel_entity(src);
544 owner = get_entity_owner(ent);
546 /* find the hidden parameter index */
547 for (idx = 0; idx < get_struct_n_members(owner); ++idx)
548 if (get_struct_member(owner, idx) == ent)
550 assert(idx < get_struct_n_members(owner));
552 /* new scheme: compound returns are determined by the call type and are Proj's */
553 idx = get_Proj_proj(src);
556 ins[idx] = get_CopyB_dst(p);
557 mem = get_CopyB_mem(p);
558 blk = get_nodes_block(p);
560 /* get rid of the CopyB */
561 turn_into_tuple(p, pn_CopyB_max);
562 set_Tuple_pred(p, pn_CopyB_M, mem);
563 set_Tuple_pred(p, pn_CopyB_X_regular, new_r_Jmp(blk));
564 set_Tuple_pred(p, pn_CopyB_X_except, get_irg_bad(irg));
568 /* now create dummy entities for function with ignored return value */
569 if (n_args < n_com) {
570 ir_type *ctp = get_Call_type(entry->call);
574 if (is_lowered_type(ctp))
575 ctp = get_associated_type(ctp);
577 for (j = i = 0; i < get_method_n_ress(ctp); ++i) {
578 ir_type *rtp = get_method_res_type(ctp, i);
579 if (is_compound_type(rtp)) {
581 ins[j] = get_dummy_sel(irg, get_nodes_block(entry->call), rtp, env);
589 * Fix all calls on a call list by adding hidden parameters.
591 * @param irg the graph
592 * @param env the environment
594 static void fix_call_list(ir_graph *irg, wlk_env *env)
596 const lower_params_t *lp = env->params;
598 ir_node *call, **new_in;
599 ir_type *ctp, *lowered_mtp;
600 add_hidden hidden_params;
601 size_t i, n_res, n_params, n_com, pos;
603 new_in = NEW_ARR_F(ir_node *, 0);
604 for (p = env->cl_list; p; p = p->next) {
606 ctp = get_Call_type(call);
607 lowered_mtp = create_modified_mtd_type(lp, ctp);
608 set_Call_type(call, lowered_mtp);
610 hidden_params = lp->hidden_params;
611 if (hidden_params == ADD_HIDDEN_SMART &&
612 get_method_variadicity(ctp) == variadicity_variadic)
613 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
615 n_params = get_Call_n_params(call);
618 for (i = 0, n_res = get_method_n_ress(ctp); i < n_res; ++i) {
619 if (is_compound_type(get_method_res_type(ctp, i)))
623 ARR_RESIZE(ir_node *, new_in, n_params + n_com + pos);
624 memset(new_in, 0, sizeof(*new_in) * (n_params + n_com + pos));
625 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
626 add_hidden_param(irg, n_com, &new_in[pos], p, env);
629 /* copy all other parameters */
630 for (i = 0; i < n_params; ++i)
631 new_in[pos++] = get_Call_param(call, i);
632 if (hidden_params == ADD_HIDDEN_ALWAYS_LAST) {
633 add_hidden_param(irg, n_com, &new_in[pos], p, env);
636 new_in[0] = get_Call_mem(call);
637 new_in[1] = get_Call_ptr(call);
639 set_irn_in(call, n_params + n_com + 2, new_in);
644 * Transform a graph. If it has compound parameter returns,
645 * remove them and use the hidden parameter instead.
646 * If it calls methods with compound parameter returns, add hidden
649 * @param lp parameter struct
650 * @param irg the graph to transform
652 static void transform_irg(const lower_params_t *lp, ir_graph *irg)
654 ir_graph *rem = current_ir_graph;
655 ir_entity *ent = get_irg_entity(irg);
656 ir_type *mtp, *lowered_mtp, *tp, *ft;
657 size_t i, j, k, n_ress = 0, n_ret_com = 0;
659 ir_node **new_in, *ret, *endbl, *bl, *mem, *copy;
662 add_hidden hidden_params;
664 current_ir_graph = irg;
666 assert(ent && "Cannot transform graph without an entity");
667 assert(get_irg_phase_state(irg) == phase_high && "call lowering must be done in phase high");
669 mtp = get_entity_type(ent);
671 if (lp->flags & LF_COMPOUND_RETURN) {
672 /* calculate the number of compound returns */
673 n_ress = get_method_n_ress(mtp);
674 for (n_ret_com = i = 0; i < n_ress; ++i) {
675 tp = get_method_res_type(mtp, i);
677 if (is_compound_type(tp))
683 /* much easier if we have only one return */
684 normalize_one_return(irg);
686 /* This graph has a compound argument. Create a new type */
687 lowered_mtp = create_modified_mtd_type(lp, mtp);
688 set_entity_type(ent, lowered_mtp);
690 hidden_params = lp->hidden_params;
691 if (hidden_params == ADD_HIDDEN_SMART &&
692 get_method_variadicity(mtp) == variadicity_variadic)
693 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
695 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
696 /* hidden arguments are added first */
697 env.arg_shift = n_ret_com;
698 env.first_hidden = 0;
700 /* hidden arguments are added last */
702 env.first_hidden = get_method_n_params(mtp);
705 /* we must only search for calls */
709 obstack_init(&env.obst);
711 env.dummy_map = pmap_create_ex(8);
714 env.lowered_mtp = lowered_mtp;
715 env.value_params = get_method_value_param_type(mtp);
716 env.only_local_mem = 1;
719 /* scan the code, fix argument numbers and collect calls. */
720 irg_walk_graph(irg, firm_clear_link, fix_args_and_collect_calls, &env);
724 fix_call_list(irg, &env);
732 * Now fix the Return node of the current graph.
736 /* STEP 1: find the return. This is simple, we have normalized the graph. */
737 endbl = get_irg_end_block(irg);
739 for (idx = get_Block_n_cfgpreds(endbl) - 1; idx >= 0; --idx) {
740 ir_node *pred = get_Block_cfgpred(endbl, idx);
742 if (is_Return(pred)) {
747 /* there should always be a return */
751 * STEP 2: fix it. For all compound return values add a CopyB,
752 * all others are copied.
754 NEW_ARR_A(ir_node *, new_in, n_ress + 1);
756 bl = get_nodes_block(ret);
757 mem = get_Return_mem(ret);
759 ft = get_irg_frame_type(irg);
760 NEW_ARR_A(cr_pair, cr_opt, n_ret_com);
762 for (j = 1, i = k = 0; i < n_ress; ++i) {
763 ir_node *pred = get_Return_res(ret, i);
764 tp = get_method_res_type(mtp, i);
766 if (is_compound_type(tp)) {
767 ir_node *arg = get_irg_args(irg);
768 arg = new_r_Proj(arg, mode_P_data, env.first_hidden + k);
771 if (is_Unknown(pred)) {
772 /* The Return(Unknown) is the Firm construct for a missing return.
776 * Sorrily detecting that copy-return is possible isn't that simple.
777 * We must check, that the hidden address is alias free during the whole
779 * A simple heuristic: all Loads/Stores inside
780 * the function access only local frame.
782 if (env.only_local_mem && is_compound_address(ft, pred)) {
783 /* we can do the copy-return optimization here */
784 cr_opt[n_cr_opt].ent = get_Sel_entity(pred);
785 cr_opt[n_cr_opt].arg = arg;
787 } else { /* copy-return optimization is impossible, do the copy. */
795 mem = new_r_Proj(copy, mode_M, pn_CopyB_M);
798 if (lp->flags & LF_RETURN_HIDDEN) {
802 } else { /* scalar return value */
807 /* replace the in of the Return */
809 set_irn_in(ret, j, new_in);
814 irg_walk_graph(irg, NULL, do_copy_return_opt, cr_opt);
816 for (i = 0, n = ARR_LEN(cr_opt); i < n; ++i) {
817 free_entity(cr_opt[i].ent);
820 } /* if (n_ret_com) */
822 pmap_destroy(env.dummy_map);
823 obstack_free(&env.obst, NULL);
826 /* invalidate the analysis info */
827 set_irg_outs_inconsistent(irg);
828 set_irg_loopinfo_state(irg, loopinfo_inconsistent);
830 current_ir_graph = rem;
834 * Returns non-zero if the given type is a method
835 * type that must be lowered.
837 * @param lp lowering parameters
838 * @param tp The type.
840 static int must_be_lowered(const lower_params_t *lp, ir_type *tp)
845 if (is_Method_type(tp)) {
846 if (lp->flags & LF_COMPOUND_RETURN) {
847 /* check for compound returns */
848 n_ress = get_method_n_ress(tp);
849 for (i = 0; i < n_ress; ++i) {
850 res_tp = get_method_res_type(tp, i);
852 if (is_compound_type(res_tp))
861 * type-walker: lower all method types of entities
862 * and points-to types.
864 static void lower_method_types(type_or_ent tore, void *env)
866 const lower_params_t *lp = (const lower_params_t*)env;
869 /* fix method entities */
870 if (is_entity(tore.ent)) {
871 ir_entity *ent = tore.ent;
872 tp = get_entity_type(ent);
874 if (must_be_lowered(lp, tp)) {
875 tp = create_modified_mtd_type(lp, tp);
876 set_entity_type(ent, tp);
881 /* fix pointer to methods */
882 if (is_Pointer_type(tp)) {
883 ir_type *etp = get_pointer_points_to_type(tp);
884 if (must_be_lowered(lp, etp)) {
885 etp = create_modified_mtd_type(lp, etp);
886 set_pointer_points_to_type(tp, etp);
893 * Lower calls with compound parameters and return types.
894 * This function does the following transformations:
896 * - Adds a new (hidden) pointer parameter for
897 * any return compound type.
899 * - Use of the hidden parameters in the function code.
901 * - Change all calls to functions with compound return
902 * by providing space for the hidden parameter on the callers
905 * - Replace a possible block copy after the function call.
907 void lower_calls_with_compounds(const lower_params_t *params)
911 lower_params_t param = *params;
913 if (param.find_pointer_type == NULL) {
914 param.find_pointer_type = def_find_pointer_type;
915 type_map = pmap_create_ex(8);
919 /* first step: Transform all graphs */
920 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
921 irg = get_irp_irg(i);
923 transform_irg(¶m, irg);
926 /* second step: Lower all method types of visible entities */
927 type_walk(NULL, lower_method_types, ¶m);
930 pmap_destroy(type_map);