2 * Copyright (C) 1995-2008 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, int alignment)
56 /* Mode and alignment are always identical in all calls to def_find_pointer_type(), so
57 we simply can use a map from the element type to the pointer type. */
58 e = pmap_find(type_map, e_type);
62 res = new_type_pointer(id_mangle_u(get_type_ident(e_type), new_id_from_chars("Ptr", 3)), e_type, mode);
63 set_type_alignment_bytes(res, alignment);
64 pmap_insert(type_map, e_type, res);
70 * Creates a new lowered type for a method type with compound
71 * arguments. The new type is associated to the old one and returned.
73 * @param lp parameter struct
74 * @param mtp the method type to lower
76 * The current implementation expects that a lowered type already
77 * includes the necessary changes ...
79 static ir_type *create_modified_mtd_type(const lower_params_t *lp, ir_type *mtp)
81 ir_type *lowered, *ptr_tp, *value_type;
82 ir_type **params, **results, *res_tp;
84 ir_mode *modes[MAX_REGISTER_RET_VAL];
85 int n_ress, n_params, nn_ress, nn_params, i, first_variadic;
87 add_hidden hidden_params;
91 if (is_lowered_type(mtp)) {
92 /* the type is already lowered. Not handled yet. */
93 assert(0 && "lowered types NYI");
96 lowered = get_associated_type(mtp);
100 n_ress = get_method_n_ress(mtp);
101 NEW_ARR_A(ir_type *, results, n_ress);
103 n_params = get_method_n_params(mtp);
104 NEW_ARR_A(ir_type *, params, n_params + n_ress);
106 NEW_ARR_A(int, param_map, n_params + n_ress);
108 first_variadic = get_method_first_variadic_param_index(mtp);
110 hidden_params = lp->hidden_params;
111 if (hidden_params == ADD_HIDDEN_SMART &&
112 get_method_variadicity(mtp) == variadicity_variadic)
113 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
115 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
116 /* add hidden in front */
117 for (nn_ress = nn_params = i = 0; i < n_ress; ++i) {
118 res_tp = get_method_res_type(mtp, i);
120 if (is_compound_type(res_tp)) {
123 if (lp->flags & LF_SMALL_CMP_IN_REGS)
124 n_regs = lp->ret_compound_in_regs(res_tp, modes);
127 /* this compound will be returned solely in registers */
128 panic("Returning compounds in registers not yet implemented");
131 /* this compound will be allocated on callers stack and its
132 address will be transmitted as a hidden parameter. */
133 ptr_tp = lp->find_pointer_type(res_tp, get_modeP_data(), lp->def_ptr_alignment);
134 params[nn_params] = ptr_tp;
135 param_map[nn_params] = -1 - i;
138 if (lp->flags & LF_RETURN_HIDDEN)
139 results[nn_ress++] = ptr_tp;
143 results[nn_ress++] = res_tp;
147 /* move the index of the first variadic parameter */
148 first_variadic += nn_params;
150 for (i = 0; i < n_params; ++i, ++nn_params) {
151 params[nn_params] = get_method_param_type(mtp, i);
152 param_map[nn_params] = i;
155 /* add hidden parameters last */
156 assert(get_method_variadicity(mtp) == variadicity_non_variadic &&
157 "Cannot add hidden parameters at end of variadic function");
159 for (nn_params = 0; nn_params < n_params; ++nn_params) {
160 params[nn_params] = get_method_param_type(mtp, nn_params);
161 param_map[nn_params] = nn_params;
164 for (nn_ress = i = 0; i < n_ress; ++i) {
165 res_tp = get_method_res_type(mtp, i);
167 if (is_compound_type(res_tp)) {
168 params[nn_params] = lp->find_pointer_type(res_tp, get_modeP_data(), lp->def_ptr_alignment);
169 param_map[nn_params] = -1 - i;
172 results[nn_ress++] = res_tp;
177 /* create the new type */
178 id = id_mangle_u(new_id_from_chars("L", 1), get_type_ident(mtp));
179 lowered = new_d_type_method(id, nn_params, nn_ress, get_type_dbg_info(mtp));
182 for (i = 0; i < nn_params; ++i)
183 set_method_param_type(lowered, i, params[i]);
184 for (i = 0; i < nn_ress; ++i)
185 set_method_res_type(lowered, i, results[i]);
187 var = get_method_variadicity(mtp);
188 set_method_variadicity(lowered, var);
189 if (var == variadicity_variadic)
190 set_method_first_variadic_param_index(lowered, first_variadic);
192 /* associate the lowered type with the original one for easier access */
194 set_method_calling_convention(lowered, get_method_calling_convention(mtp) | cc_compound_ret);
197 set_lowered_type(mtp, lowered);
199 value_type = get_method_value_param_type(mtp);
200 if (value_type != NULL) {
201 /* set new param positions */
202 for (i = 0; i < nn_params; ++i) {
203 ir_entity *ent = get_method_value_param_ent(lowered, i);
204 int pos = param_map[i];
207 set_entity_link(ent, INT_TO_PTR(pos));
209 /* formally return value, ignore for now */
213 id = get_method_param_ident(mtp, pos);
215 set_method_param_ident(lowered, i, id);
216 set_entity_ident(ent, id);
220 set_lowered_type(value_type, get_method_value_param_type(lowered));
229 typedef struct cl_entry cl_entry;
231 cl_entry *next; /**< Pointer to the next entry. */
232 ir_node *call; /**< Pointer to the Call node. */
233 ir_node *copyb; /**< List of all CopyB nodes. */
237 * Walker environment for fix_args_and_collect_calls().
239 typedef struct _wlk_env_t {
240 int arg_shift; /**< The Argument index shift for parameters. */
241 int first_hidden; /**< The index of the first hidden argument. */
242 struct obstack obst; /**< An obstack to allocate the data on. */
243 cl_entry *cl_list; /**< The call list. */
244 pmap *dummy_map; /**< A map for finding the dummy arguments. */
245 unsigned dnr; /**< The dummy index number. */
246 const lower_params_t *params; /**< Lowering parameters. */
247 ir_type *lowered_mtp; /**< The lowered method type of the current irg if any. */
248 ir_type *value_params; /**< The value params type if any. */
249 unsigned only_local_mem:1; /**< Set if only local memory access was found. */
250 unsigned changed:1; /**< Set if the current graph was changed. */
254 * Return the call list entry of a call node.
255 * If no entry exists yet, allocate one and enter the node into
256 * the call list of the environment.
258 * @param call A Call node.
259 * @param env The environment.
261 static cl_entry *get_Call_entry(ir_node *call, wlk_env *env) {
262 cl_entry *res = get_irn_link(call);
264 cl_entry *res = OALLOC(&env->obst, cl_entry);
265 res->next = env->cl_list;
268 set_irn_link(call, res);
275 * Finds the base address of an address by skipping Sel's and address
278 * @param adr the address
279 * @param pEnt points to the base entity if any
281 static ir_node *find_base_adr(ir_node *ptr, ir_entity **pEnt) {
282 ir_entity *ent = NULL;
283 assert(mode_is_reference(get_irn_mode(ptr)));
287 ent = get_Sel_entity(ptr);
288 ptr = get_Sel_ptr(ptr);
290 else if (is_Add(ptr)) {
291 ir_node *left = get_Add_left(ptr);
292 if (mode_is_reference(get_irn_mode(left)))
295 ptr = get_Add_right(ptr);
297 } else if (is_Sub(ptr)) {
298 ptr = get_Sub_left(ptr);
308 * Check if a given pointer represents non-local memory.
310 static void check_ptr(ir_node *ptr, wlk_env *env) {
311 ir_storage_class_class_t sc;
314 /* still alias free */
315 ptr = find_base_adr(ptr, &ent);
316 sc = GET_BASE_SC(classify_pointer(current_ir_graph, ptr, ent));
317 if (sc != ir_sc_localvar && sc != ir_sc_malloced) {
318 /* non-local memory access */
319 env->only_local_mem = 0;
324 * Post walker: shift all parameter indexes
325 * and collect Calls with compound returns in the call list.
326 * If a non-alias free memory access is found, reset the alias free
329 static void fix_args_and_collect_calls(ir_node *n, void *ctx) {
335 switch (get_irn_opcode(n)) {
337 if (env->lowered_mtp != NULL && env->value_params != NULL) {
338 ir_entity *ent = get_Sel_entity(n);
340 if (get_entity_owner(ent) == env->value_params) {
341 int pos = get_struct_member_index(env->value_params, ent) + env->arg_shift;
344 new_ent = get_method_value_param_ent(env->lowered_mtp, pos);
345 set_entity_ident(new_ent, get_entity_ident(ent));
346 set_Sel_entity(n, new_ent);
352 if (env->only_local_mem) {
353 ptr = get_irn_n(n, 1);
358 if (env->arg_shift > 0) {
359 ir_node *pred = get_Proj_pred(n);
361 /* Fix the argument numbers */
362 if (pred == get_irg_args(current_ir_graph)) {
363 long pnr = get_Proj_proj(n);
364 set_Proj_proj(n, pnr + env->arg_shift);
370 if (! is_self_recursive_Call(n)) {
371 /* any non self recursive call might access global memory */
372 env->only_local_mem = 0;
375 ctp = get_Call_type(n);
376 if (env->params->flags & LF_COMPOUND_RETURN) {
377 /* check for compound returns */
378 for (i = get_method_n_ress(ctp) -1; i >= 0; --i) {
379 if (is_compound_type(get_method_res_type(ctp, i))) {
381 * This is a call with a compound return. As the result
382 * might be ignored, we must put it in the list.
384 (void)get_Call_entry(n, env);
391 if (env->only_local_mem) {
392 check_ptr(get_CopyB_src(n), env);
393 if (env->only_local_mem)
394 check_ptr(get_CopyB_dst(n), env);
396 if (env->params->flags & LF_COMPOUND_RETURN) {
397 /* check for compound returns */
398 ir_node *src = get_CopyB_src(n);
399 /* older scheme using value_res_ent */
401 ir_node *proj = get_Sel_ptr(src);
402 if (is_Proj(proj) && get_Proj_proj(proj) == pn_Call_P_value_res_base) {
403 ir_node *call = get_Proj_pred(proj);
405 /* found a CopyB from compound Call result */
406 cl_entry *e = get_Call_entry(call, env);
407 set_irn_link(n, e->copyb);
412 /* new scheme: compound results are determined by the call type only */
414 ir_node *proj = get_Proj_pred(src);
415 if (is_Proj(proj) && get_Proj_proj(proj) == pn_Call_T_result) {
416 ir_node *call = get_Proj_pred(proj);
418 ctp = get_Call_type(call);
419 if (is_compound_type(get_method_res_type(ctp, get_Proj_proj(src)))) {
420 /* found a CopyB from compound Call result */
421 cl_entry *e = get_Call_entry(call, env);
422 set_irn_link(n, e->copyb);
438 * Returns non-zero if a node is a compound address
439 * of a frame-type entity.
441 * @param ft the frame type
442 * @param adr the node
444 static int is_compound_address(ir_type *ft, ir_node *adr)
450 if (get_Sel_n_indexs(adr) != 0)
452 ent = get_Sel_entity(adr);
453 return get_entity_owner(ent) == ft;
456 /** A pair for the copy-return-optimization. */
457 typedef struct cr_pair {
458 ir_entity *ent; /**< the entity than can be removed from the frame */
459 ir_node *arg; /**< the argument that replaces the entities address */
463 * Post walker: fixes all entities addresses for the copy-return
466 * Note: We expect the length of the cr_pair array (ie number of compound
467 * return values) to be 1 (C, C++) in almost all cases, so ignore the
468 * linear search complexity here.
470 static void do_copy_return_opt(ir_node *n, void *ctx) {
475 ir_entity *ent = get_Sel_entity(n);
477 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
478 if (ent == arr[i].ent) {
479 exchange(n, arr[i].arg);
487 * Return a Sel node that selects a dummy argument of type tp.
488 * Dummy arguments are only needed once and we use a map
490 * We could even assign all dummy arguments the same offset
491 * in the frame type ...
493 * @param irg the graph
494 * @param block the block where a newly create Sel should be placed
495 * @param tp the type of the dummy entity that should be create
496 * @param env the environment
498 static ir_node *get_dummy_sel(ir_graph *irg, ir_node *block, ir_type *tp, wlk_env *env)
503 /* use a map the check if we already create such an entity */
504 e = pmap_find(env->dummy_map, tp);
508 ir_type *ft = get_irg_frame_type(irg);
511 snprintf(buf, sizeof(buf), "dummy.%u", env->dnr++);
512 ent = new_entity(ft, new_id_from_str(buf), tp);
513 pmap_insert(env->dummy_map, tp, ent);
515 if (get_type_state(ft) == layout_fixed) {
516 /* Fix the layout again */
517 assert(0 && "Fixed layout not implemented");
520 return new_r_simpleSel(
528 * Add the hidden parameter from the CopyB node to the Call node.
530 * @param irg the graph
531 * @param n_com number of compound results (will be number of hidden parameters)
532 * @param ins in array to store the hidden parameters into
533 * @param entry the call list
534 * @param env the environment
536 static void add_hidden_param(ir_graph *irg, int n_com, ir_node **ins, cl_entry *entry, wlk_env *env)
538 ir_node *p, *n, *src, *mem, *blk;
544 for (p = entry->copyb; p; p = n) {
546 src = get_CopyB_src(p);
548 /* old scheme using value_res_ent */
550 ent = get_Sel_entity(src);
551 owner = get_entity_owner(ent);
553 /* find the hidden parameter index */
554 for (idx = 0; idx < get_struct_n_members(owner); ++idx)
555 if (get_struct_member(owner, idx) == ent)
557 assert(idx < get_struct_n_members(owner));
559 /* new scheme: compound returns are determined by the call type and are Proj's */
560 idx = get_Proj_proj(src);
563 ins[idx] = get_CopyB_dst(p);
564 mem = get_CopyB_mem(p);
565 blk = get_nodes_block(p);
567 /* get rid of the CopyB */
568 turn_into_tuple(p, pn_CopyB_max);
569 set_Tuple_pred(p, pn_CopyB_M_regular, mem);
570 set_Tuple_pred(p, pn_CopyB_M_except, get_irg_bad(irg));
571 set_Tuple_pred(p, pn_CopyB_X_regular, new_r_Jmp(blk));
572 set_Tuple_pred(p, pn_CopyB_X_except, get_irg_bad(irg));
576 /* now create dummy entities for function with ignored return value */
577 if (n_args < n_com) {
578 ir_type *ctp = get_Call_type(entry->call);
581 if (is_lowered_type(ctp))
582 ctp = get_associated_type(ctp);
584 for (j = i = 0; i < get_method_n_ress(ctp); ++i) {
585 ir_type *rtp = get_method_res_type(ctp, i);
586 if (is_compound_type(rtp)) {
588 ins[j] = get_dummy_sel(irg, get_nodes_block(entry->call), rtp, env);
596 * Fix all calls on a call list by adding hidden parameters.
598 * @param irg the graph
599 * @param env the environment
601 static void fix_call_list(ir_graph *irg, wlk_env *env) {
602 const lower_params_t *lp = env->params;
604 ir_node *call, **new_in;
605 ir_type *ctp, *lowered_mtp;
606 add_hidden hidden_params;
607 int i, n_params, n_com, pos;
609 new_in = NEW_ARR_F(ir_node *, 0);
610 for (p = env->cl_list; p; p = p->next) {
612 ctp = get_Call_type(call);
613 lowered_mtp = create_modified_mtd_type(lp, ctp);
614 set_Call_type(call, lowered_mtp);
616 hidden_params = lp->hidden_params;
617 if (hidden_params == ADD_HIDDEN_SMART &&
618 get_method_variadicity(ctp) == variadicity_variadic)
619 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
621 n_params = get_Call_n_params(call);
624 for (i = get_method_n_ress(ctp) - 1; i >= 0; --i) {
625 if (is_compound_type(get_method_res_type(ctp, i)))
629 ARR_RESIZE(ir_node *, new_in, n_params + n_com + pos);
630 memset(new_in, 0, sizeof(*new_in) * (n_params + n_com + pos));
631 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
632 add_hidden_param(irg, n_com, &new_in[pos], p, env);
635 /* copy all other parameters */
636 for (i = 0; i < n_params; ++i)
637 new_in[pos++] = get_Call_param(call, i);
638 if (hidden_params == ADD_HIDDEN_ALWAYS_LAST) {
639 add_hidden_param(irg, n_com, &new_in[pos], p, env);
642 new_in[0] = get_Call_mem(call);
643 new_in[1] = get_Call_ptr(call);
645 set_irn_in(call, n_params + n_com + 2, new_in);
650 * Transform a graph. If it has compound parameter returns,
651 * remove them and use the hidden parameter instead.
652 * If it calls methods with compound parameter returns, add hidden
655 * @param lp parameter struct
656 * @param irg the graph to transform
658 static void transform_irg(const lower_params_t *lp, ir_graph *irg)
660 ir_graph * rem = current_ir_graph;
661 ir_entity *ent = get_irg_entity(irg);
662 ir_type *mtp, *lowered_mtp, *tp, *ft;
663 int i, j, k, n_ress = 0, n_ret_com = 0, n_cr_opt;
664 ir_node **new_in, *ret, *endbl, *bl, *mem, *copy;
667 add_hidden hidden_params;
669 current_ir_graph = irg;
671 assert(ent && "Cannot transform graph without an entity");
672 assert(get_irg_phase_state(irg) == phase_high && "call lowering must be done in phase high");
674 mtp = get_entity_type(ent);
676 if (lp->flags & LF_COMPOUND_RETURN) {
677 /* calculate the number of compound returns */
678 n_ress = get_method_n_ress(mtp);
679 for (n_ret_com = i = 0; i < n_ress; ++i) {
680 tp = get_method_res_type(mtp, i);
682 if (is_compound_type(tp))
688 /* much easier if we have only one return */
689 normalize_one_return(irg);
691 /* This graph has a compound argument. Create a new type */
692 lowered_mtp = create_modified_mtd_type(lp, mtp);
693 set_entity_type(ent, lowered_mtp);
695 hidden_params = lp->hidden_params;
696 if (hidden_params == ADD_HIDDEN_SMART &&
697 get_method_variadicity(mtp) == variadicity_variadic)
698 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
700 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
701 /* hidden arguments are added first */
702 env.arg_shift = n_ret_com;
703 env.first_hidden = 0;
705 /* hidden arguments are added last */
707 env.first_hidden = get_method_n_params(mtp);
710 /* we must only search for calls */
714 obstack_init(&env.obst);
716 env.dummy_map = pmap_create_ex(8);
719 env.lowered_mtp = lowered_mtp;
720 env.value_params = get_method_value_param_type(mtp);
721 env.only_local_mem = 1;
724 /* scan the code, fix argument numbers and collect calls. */
725 irg_walk_graph(irg, firm_clear_link, fix_args_and_collect_calls, &env);
729 fix_call_list(irg, &env);
735 * Now fix the Return node of the current graph.
739 /* STEP 1: find the return. This is simple, we have normalized the graph. */
740 endbl = get_irg_end_block(irg);
742 for (i = get_Block_n_cfgpreds(endbl) - 1; i >= 0; --i) {
743 ir_node *pred = get_Block_cfgpred(endbl, i);
745 if (is_Return(pred)) {
750 /* there should always be a return */
754 * STEP 2: fix it. For all compound return values add a CopyB,
755 * all others are copied.
757 NEW_ARR_A(ir_node *, new_in, n_ress + 1);
759 bl = get_nodes_block(ret);
760 mem = get_Return_mem(ret);
762 ft = get_irg_frame_type(irg);
763 NEW_ARR_A(cr_pair, cr_opt, n_ret_com);
765 for (j = 1, i = k = 0; i < n_ress; ++i) {
766 ir_node *pred = get_Return_res(ret, i);
767 tp = get_method_res_type(mtp, i);
769 if (is_compound_type(tp)) {
770 ir_node *arg = get_irg_args(irg);
771 arg = new_r_Proj(get_nodes_block(arg), arg, mode_P_data, env.first_hidden + k);
774 if (is_Unknown(pred)) {
775 /* The Return(Unknown) is the Firm construct for a missing return.
779 * Sorrily detecting that copy-return is possible isn't that simple.
780 * We must check, that the hidden address is alias free during the whole
782 * A simple heuristic: all Loads/Stores inside
783 * the function access only local frame.
785 if (env.only_local_mem && is_compound_address(ft, pred)) {
786 /* we can do the copy-return optimization here */
787 cr_opt[n_cr_opt].ent = get_Sel_entity(pred);
788 cr_opt[n_cr_opt].arg = arg;
790 } else { /* copy-return optimization is impossible, do the copy. */
798 mem = new_r_Proj(bl, copy, mode_M, pn_CopyB_M_regular);
801 if (lp->flags & LF_RETURN_HIDDEN) {
805 } else { /* scalar return value */
810 /* replace the in of the Return */
812 set_irn_in(ret, j, new_in);
815 irg_walk_graph(irg, NULL, do_copy_return_opt, cr_opt);
817 for (i = ARR_LEN(cr_opt) - 1; i >= 0; --i) {
818 remove_class_member(ft, cr_opt[i].ent);
821 } /* if (n_ret_com) */
823 pmap_destroy(env.dummy_map);
824 obstack_free(&env.obst, NULL);
827 /* invalidate the analysis info */
828 set_irg_outs_inconsistent(irg);
829 set_irg_loopinfo_state(irg, loopinfo_inconsistent);
831 current_ir_graph = rem;
835 * Returns non-zero if the given type is a method
836 * type that must be lowered.
838 * @param lp lowering parameters
839 * @param tp The type.
841 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 = 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 = get_irp_n_irgs() - 1; i >= 0; --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);