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 Lowering of Calls with compound parameters and return types.
23 * @author Michael Beck
40 #include "iroptimize.h"
45 /** A type map for def_find_pointer_type. */
46 static pmap *type_map;
49 * Default implementation for finding a pointer type for a given element type.
50 * Simple create a new one.
52 static ir_type *def_find_pointer_type(ir_type *e_type, ir_mode *mode, int alignment)
57 /* Mode and alignment are always identical in all calls to def_find_pointer_type(), so
58 we simply can use a map from the element type to the pointer type. */
59 e = pmap_find(type_map, e_type);
63 res = new_type_pointer(mangle_u(get_type_ident(e_type), new_id_from_chars("Ptr", 3)), e_type, mode);
64 set_type_alignment_bytes(res, alignment);
65 pmap_insert(type_map, e_type, res);
71 * Creates a new lowered type for a method type with compound
72 * arguments. The new type is associated to the old one and returned.
74 * @param lp parameter struct
75 * @param mtp the method type to lower
77 * The current implementation expects that a lowered type already
78 * includes the necessary changes ...
80 static ir_type *create_modified_mtd_type(const lower_params_t *lp, ir_type *mtp)
82 ir_type *lowered, *ptr_tp;
83 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 first_variadic = get_method_first_variadic_param_index(mtp);
108 hidden_params = lp->hidden_params;
109 if (hidden_params == ADD_HIDDEN_SMART &&
110 get_method_variadicity(mtp) == variadicity_variadic)
111 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
113 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
114 /* add hidden in front */
115 for (nn_ress = nn_params = i = 0; i < n_ress; ++i) {
116 res_tp = get_method_res_type(mtp, i);
118 if (is_compound_type(res_tp)) {
121 if (lp->flags & LF_SMALL_CMP_IN_REGS)
122 n_regs = lp->ret_compound_in_regs(res_tp, modes);
125 /* this compound will be returned solely in registers */
129 /* this compound will be allocated on callers stack and its
130 address will be transmitted as a hidden parameter. */
131 ptr_tp = lp->find_pointer_type(res_tp, get_modeP_data(), lp->def_ptr_alignment);
132 params[nn_params++] = ptr_tp;
134 if (lp->flags & LF_RETURN_HIDDEN)
135 results[nn_ress++] = ptr_tp;
139 results[nn_ress++] = res_tp;
142 /* move the index of the first variadic parameter */
143 first_variadic += nn_params;
145 for (i = 0; i < n_params; ++i)
146 params[nn_params++] = get_method_param_type(mtp, i);
149 /* add hidden parameters last */
150 assert(get_method_variadicity(mtp) == variadicity_non_variadic &&
151 "Cannot add hidden parameters at end of variadic function");
153 for (nn_params = 0; nn_params < n_params; ++nn_params)
154 params[nn_params] = get_method_param_type(mtp, nn_params);
156 for (nn_ress = i = 0; i < n_ress; ++i) {
157 res_tp = get_method_res_type(mtp, i);
159 if (is_compound_type(res_tp))
160 params[nn_params++] = lp->find_pointer_type(res_tp, get_modeP_data(), lp->def_ptr_alignment);
162 results[nn_ress++] = res_tp;
166 /* create the new type */
167 id = mangle_u(new_id_from_chars("L", 1), get_type_ident(mtp));
168 lowered = new_d_type_method(id, nn_params, nn_ress, get_type_dbg_info(mtp));
171 for (i = 0; i < nn_params; ++i)
172 set_method_param_type(lowered, i, params[i]);
173 for (i = 0; i < nn_ress; ++i)
174 set_method_res_type(lowered, i, results[i]);
176 var = get_method_variadicity(mtp);
177 set_method_variadicity(lowered, var);
178 if (var == variadicity_variadic)
179 set_method_first_variadic_param_index(lowered, first_variadic);
181 /* associate the lowered type with the original one for easier access */
183 set_method_calling_convention(lowered,
184 get_method_calling_convention(mtp) | cc_compound_ret);
186 set_lowered_type(mtp, lowered);
194 typedef struct cl_entry cl_entry;
196 cl_entry *next; /**< Pointer to the next entry. */
197 ir_node *call; /**< Pointer to the Call node. */
198 ir_node *copyb; /**< List of all CopyB nodes. */
202 * Walker environment for fix_args_and_collect_calls().
204 typedef struct _wlk_env_t {
205 int arg_shift; /**< The Argument index shift for parameters. */
206 int first_hidden; /**< The index of the first hidden argument. */
207 struct obstack obst; /**< An obstack to allocate the data on. */
208 cl_entry *cl_list; /**< The call list. */
209 pmap *dummy_map; /**< A map for finding the dummy arguments. */
210 unsigned dnr; /**< The dummy index number. */
211 const lower_params_t *params; /**< lowering parameters */
215 * Return the call list entry of a call node.
216 * If no entry exists yet, allocate one and enter the node into
217 * the call list of the environment.
219 * @param call A Call node.
220 * @param env The environment.
222 static cl_entry *get_Call_entry(ir_node *call, wlk_env *env) {
223 cl_entry *res = get_irn_link(call);
225 cl_entry *res = obstack_alloc(&env->obst, sizeof(*res));
226 res->next = env->cl_list;
229 set_irn_link(call, res);
236 * Post walker: shift all parameter indeces
237 * and collect Calls with compound returns in the call list.
239 static void fix_args_and_collect_calls(ir_node *n, void *ctx) {
243 ir_op *op = get_irn_op(n);
245 if (env->arg_shift > 0 && op == op_Proj) {
246 ir_node *pred = get_Proj_pred(n);
248 /* Fix the argument numbers */
249 if (pred == get_irg_args(current_ir_graph)) {
250 long pnr = get_Proj_proj(n);
251 set_Proj_proj(n, pnr + env->arg_shift);
254 else if (op == op_Call) {
255 ctp = get_Call_type(n);
256 if (env->params->flags & LF_COMPOUND_RETURN) {
257 /* check for compound returns */
258 for (i = get_method_n_ress(ctp) -1; i >= 0; --i) {
259 if (is_compound_type(get_method_res_type(ctp, i))) {
261 * This is a call with a compound return. As the result
262 * might be ignored, we must put it in the list.
264 (void)get_Call_entry(n, env);
270 else if (op == op_CopyB && env->params->flags & LF_COMPOUND_RETURN) {
271 /* check for compound returns */
272 ir_node *src = get_CopyB_src(n);
273 /* older scheme using value_res_ent */
275 ir_node *proj = get_Sel_ptr(src);
276 if (is_Proj(proj) && get_Proj_proj(proj) == pn_Call_P_value_res_base) {
277 ir_node *call = get_Proj_pred(proj);
279 /* found a CopyB from compound Call result */
280 cl_entry *e = get_Call_entry(call, env);
281 set_irn_link(n, e->copyb);
286 /* new scheme: compound results are determined by the call type only */
288 ir_node *proj = get_Proj_pred(src);
289 if (is_Proj(proj) && get_Proj_proj(proj) == pn_Call_T_result) {
290 ir_node *call = get_Proj_pred(proj);
292 ctp = get_Call_type(call);
293 if (is_compound_type(get_method_res_type(ctp, get_Proj_proj(src)))) {
294 /* found a CopyB from compound Call result */
295 cl_entry *e = get_Call_entry(call, env);
296 set_irn_link(n, e->copyb);
306 * Returns non-zero if a node is a compound address
307 * of a frame-type entity.
309 * @param ft the frame type
310 * @param adr the node
312 static int is_compound_address(ir_type *ft, ir_node *adr)
318 if (get_Sel_n_indexs(adr) != 0)
320 ent = get_Sel_entity(adr);
321 return get_entity_owner(ent) == ft;
324 /** A pair for the copy-return-optimization. */
325 typedef struct cr_pair {
326 ir_entity *ent; /**< the entity than can be removed from the frame */
327 ir_node *arg; /**< the argument that replaces the entities address */
331 * Post walker: fixes all entities addresses for the copy-return
334 * Note: We expect the length of the cr_pair array (ie number of compound
335 * return values) to be 1 (C, C++) in almost all cases, so ignore the
336 * linear search complexity here.
338 static void do_copy_return_opt(ir_node *n, void *ctx) {
343 ir_entity *ent = get_Sel_entity(n);
345 for (i = ARR_LEN(arr) - 1; i >= 0; --i) {
346 if (ent == arr[i].ent) {
347 exchange(n, arr[i].arg);
355 * Return a Sel node that selects a dummy argument of type tp.
356 * Dummy arguments are only needed once and we use a map
358 * We could even assign all dummy arguments the same offset
359 * in the frame type ...
361 * @param irg the graph
362 * @param block the block where a newly create Sel should be placed
363 * @param tp the type of the dummy entity that should be create
364 * @param env the environment
366 static ir_node *get_dummy_sel(ir_graph *irg, ir_node *block, ir_type *tp, wlk_env *env)
371 /* use a map the check if we already create such an entity */
372 e = pmap_find(env->dummy_map, tp);
376 ir_type *ft = get_irg_frame_type(irg);
379 snprintf(buf, sizeof(buf), "dummy.%u", env->dnr++);
380 ent = new_entity(ft, new_id_from_str(buf), tp);
381 pmap_insert(env->dummy_map, tp, ent);
383 if (get_type_state(ft) == layout_fixed) {
384 /* Fix the layout again */
385 assert(0 && "Fixed layout not implemented");
388 return new_r_simpleSel(
397 * Add the hidden parameter from the CopyB node to the Call node.
399 * @param irg the graph
400 * @param n_com number of compound results (will be number of hidden parameters)
401 * @param ins in array to store the hidden parameters into
402 * @param entry the call list
403 * @param env the environment
405 static void add_hidden_param(ir_graph *irg, int n_com, ir_node **ins, cl_entry *entry, wlk_env *env)
407 ir_node *p, *n, *src, *mem, *blk;
413 for (p = entry->copyb; p; p = n) {
415 src = get_CopyB_src(p);
417 /* old scheme using value_res_ent */
419 ent = get_Sel_entity(src);
420 owner = get_entity_owner(ent);
422 /* find the hidden parameter index */
423 for (idx = 0; idx < get_struct_n_members(owner); ++idx)
424 if (get_struct_member(owner, idx) == ent)
426 assert(idx < get_struct_n_members(owner));
430 /* new scheme: compound returns are determined by the call type and are Proj's */
431 idx = get_Proj_proj(src);
433 ins[idx] = get_CopyB_dst(p);
434 mem = get_CopyB_mem(p);
435 blk = get_nodes_block(p);
437 /* get rid of the CopyB */
438 turn_into_tuple(p, pn_CopyB_max);
439 set_Tuple_pred(p, pn_CopyB_M_regular, mem);
440 set_Tuple_pred(p, pn_CopyB_M_except, get_irg_bad(irg));
441 set_Tuple_pred(p, pn_CopyB_X_regular, new_r_Jmp(irg, blk));
442 set_Tuple_pred(p, pn_CopyB_X_except, get_irg_bad(irg));
446 /* now create dummy entities for function with ignored return value */
447 if (n_args < n_com) {
448 ir_type *ctp = get_Call_type(entry->call);
451 if (is_lowered_type(ctp))
452 ctp = get_associated_type(ctp);
454 for (j = i = 0; i < get_method_n_ress(ctp); ++i) {
455 ir_type *rtp = get_method_res_type(ctp, i);
456 if (is_compound_type(rtp)) {
458 ins[j] = get_dummy_sel(irg, get_nodes_block(entry->call), rtp, env);
466 * Fix all calls on a call list by adding hidden parameters.
468 * @param irg the graph
469 * @param env the environment
471 static void fix_call_list(ir_graph *irg, wlk_env *env) {
472 const lower_params_t *lp = env->params;
474 ir_node *call, **new_in;
475 ir_type *ctp, *lowered_mtp;
476 add_hidden hidden_params;
477 int i, n_params, n_com, pos;
479 new_in = NEW_ARR_F(ir_node *, 0);
480 for (p = env->cl_list; p; p = p->next) {
482 ctp = get_Call_type(call);
483 lowered_mtp = create_modified_mtd_type(lp, ctp);
484 set_Call_type(call, lowered_mtp);
486 hidden_params = lp->hidden_params;
487 if (hidden_params == ADD_HIDDEN_SMART &&
488 get_method_variadicity(ctp) == variadicity_variadic)
489 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
491 n_params = get_Call_n_params(call);
494 for (i = get_method_n_ress(ctp) - 1; i >= 0; --i) {
495 if (is_compound_type(get_method_res_type(ctp, i)))
499 ARR_RESIZE(ir_node *, new_in, n_params + n_com + pos);
500 memset(new_in, 0, sizeof(*new_in) * (n_params + n_com + pos));
501 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
502 add_hidden_param(irg, n_com, &new_in[pos], p, env);
505 /* copy all other parameters */
506 for (i = 0; i < n_params; ++i)
507 new_in[pos++] = get_Call_param(call, i);
508 if (hidden_params == ADD_HIDDEN_ALWAYS_LAST) {
509 add_hidden_param(irg, n_com, &new_in[pos], p, env);
512 new_in[0] = get_Call_mem(call);
513 new_in[1] = get_Call_ptr(call);
515 set_irn_in(call, n_params + n_com + 2, new_in);
520 * Transform a graph. If it has compound parameter returns,
521 * remove them and use the hidden parameter instead.
522 * If it calls methods with compound parameter returns, add hidden
525 * @param lp parameter struct
526 * @param irg the graph to transform
528 static void transform_irg(const lower_params_t *lp, ir_graph *irg)
530 ir_entity *ent = get_irg_entity(irg);
531 ir_type *mtp, *lowered_mtp, *tp, *ft;
532 int i, j, k, n_ress = 0, n_ret_com = 0, n_cr_opt;
533 ir_node **new_in, *ret, *endbl, *bl, *mem, *copy;
536 add_hidden hidden_params;
538 assert(ent && "Cannot tranform graph without an entity");
539 assert(get_irg_phase_state(irg) == phase_high && "call lowering must be done in phase high");
541 mtp = get_entity_type(ent);
543 if (lp->flags & LF_COMPOUND_RETURN) {
544 /* calculate the number of compound returns */
545 n_ress = get_method_n_ress(mtp);
546 for (n_ret_com = i = 0; i < n_ress; ++i) {
547 tp = get_method_res_type(mtp, i);
549 if (is_compound_type(tp))
555 /* much easier if we have only one return */
556 normalize_one_return(irg);
558 /* This graph has a compound argument. Create a new type */
559 lowered_mtp = create_modified_mtd_type(lp, mtp);
560 set_entity_type(ent, lowered_mtp);
562 hidden_params = lp->hidden_params;
563 if (hidden_params == ADD_HIDDEN_SMART &&
564 get_method_variadicity(mtp) == variadicity_variadic)
565 hidden_params = ADD_HIDDEN_ALWAYS_IN_FRONT;
567 if (hidden_params == ADD_HIDDEN_ALWAYS_IN_FRONT) {
568 /* hidden arguments are added first */
569 env.arg_shift = n_ret_com;
570 env.first_hidden = 0;
573 /* hidden arguments are added last */
575 env.first_hidden = get_method_n_params(mtp);
579 /* we must only search for calls */
582 obstack_init(&env.obst);
584 env.dummy_map = pmap_create_ex(8);
588 /* scan the code, fix argument numbers and collect calls. */
589 irg_walk_graph(irg, firm_clear_link, fix_args_and_collect_calls, &env);
593 fix_call_list(irg, &env);
597 * Now fix the Return node of the current graph.
600 /* STEP 1: find the return. This is simple, we have normalized the graph. */
601 endbl = get_irg_end_block(irg);
603 for (i = get_Block_n_cfgpreds(endbl) - 1; i >= 0; --i) {
604 ir_node *pred = get_Block_cfgpred(endbl, i);
606 if (is_Return(pred)) {
611 /* there should always be a return */
615 * STEP 2: fix it. For all compound return values add a CopyB,
616 * all others are copied.
618 NEW_ARR_A(ir_node *, new_in, n_ress + 1);
620 bl = get_nodes_block(ret);
621 mem = get_Return_mem(ret);
623 ft = get_irg_frame_type(irg);
624 NEW_ARR_A(cr_pair, cr_opt, n_ret_com);
626 for (j = 1, i = k = 0; i < n_ress; ++i) {
627 ir_node *pred = get_Return_res(ret, i);
628 tp = get_method_res_type(mtp, i);
630 if (is_compound_type(tp)) {
631 ir_node *arg = get_irg_args(irg);
632 arg = new_r_Proj(irg, get_nodes_block(arg), arg, mode_P_data, env.first_hidden + k);
635 if (is_compound_address(ft, pred)) {
636 /* we can do the copy-return optimization here */
637 cr_opt[n_cr_opt].ent = get_Sel_entity(pred);
638 cr_opt[n_cr_opt].arg = arg;
641 else { /* copy-return optimization is impossible, do the copy. */
649 mem = new_r_Proj(irg, bl, copy, mode_M, pn_CopyB_M_regular);
651 if (lp->flags & LF_RETURN_HIDDEN) {
656 else { /* scalar return value */
661 /* replace the in of the Return */
663 set_irn_in(ret, j, new_in);
666 irg_walk_graph(irg, NULL, do_copy_return_opt, cr_opt);
668 for (i = ARR_LEN(cr_opt) - 1; i >= 0; --i) {
669 remove_class_member(ft, cr_opt[i].ent);
672 } /* if (n_ret_com) */
674 pmap_destroy(env.dummy_map);
675 obstack_free(&env.obst, NULL);
679 * Returns non-zero if the given type is a method
680 * type that must be lowered.
682 * @param lp lowering parameters
683 * @param tp The type.
685 static int must_be_lowered(const lower_params_t *lp, ir_type *tp) {
689 if (is_Method_type(tp)) {
690 if (lp->flags & LF_COMPOUND_RETURN) {
691 /* check for compound returns */
692 n_ress = get_method_n_ress(tp);
693 for (i = 0; i < n_ress; ++i) {
694 res_tp = get_method_res_type(tp, i);
696 if (is_compound_type(res_tp))
705 * type-walker: lower all method types of entities
706 * and points-to types.
708 static void lower_method_types(type_or_ent *tore, void *env)
710 const lower_params_t *lp = env;
713 /* fix method entities */
714 if (is_entity(tore)) {
715 ir_entity *ent = (ir_entity *)tore;
716 tp = get_entity_type(ent);
718 if (must_be_lowered(lp, tp)) {
719 tp = create_modified_mtd_type(lp, tp);
720 set_entity_type(ent, tp);
724 tp = (ir_type *)tore;
726 /* fix pointer to methods */
727 if (is_Pointer_type(tp)) {
728 ir_type *etp = get_pointer_points_to_type(tp);
729 if (must_be_lowered(lp, etp)) {
730 etp = create_modified_mtd_type(lp, etp);
731 set_pointer_points_to_type(tp, etp);
738 * Lower calls with compound parameters and return types.
739 * This function does the following transformations:
741 * - Adds a new (hidden) pointer parameter for
742 * any return compound type.
744 * - Use of the hidden parameters in the function code.
746 * - Change all calls to functions with compound return
747 * by providing space for the hidden parameter on the callers
750 * - Replace a possible block copy after the function call.
752 void lower_calls_with_compounds(const lower_params_t *params)
756 lower_params_t param = *params;
758 if (param.find_pointer_type == NULL) {
759 param.find_pointer_type = def_find_pointer_type;
760 type_map = pmap_create_ex(8);
765 /* first step: Transform all graphs */
766 for (i = get_irp_n_irgs() - 1; i >= 0; --i) {
767 irg = get_irp_irg(i);
769 if (irg == get_const_code_irg())
772 transform_irg(¶m, irg);
775 /* second step: Lower all method types of visible entities */
776 type_walk(NULL, lower_method_types, ¶m);
779 pmap_destroy(type_map);