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 Tail-recursion call optimization.
24 * @author Michael Beck
33 #include "iroptimize.h"
34 #include "scalar_replace.h"
41 #include "irgraph_t.h"
50 DEBUG_ONLY(static firm_dbg_module_t *dbg);
53 * the environment for collecting data
55 typedef struct collect_t {
56 ir_node *proj_X; /**< initial exec proj */
57 ir_node *block; /**< old first block */
58 int blk_idx; /**< cfgpred index of the initial exec in block */
59 ir_node *proj_m; /**< memory from start proj's */
60 ir_node *proj_data; /**< linked list of all parameter access proj's */
64 * walker for collecting data, fills a collect_t environment
66 static void collect_data(ir_node *node, void *env)
68 collect_t *data = (collect_t*)env;
72 switch (get_irn_opcode(node)) {
74 pred = get_Proj_pred(node);
76 opcode = get_irn_opcode(pred);
77 if (opcode == iro_Proj) {
78 ir_node *start = get_Proj_pred(pred);
80 if (is_Start(start)) {
81 if (get_Proj_proj(pred) == pn_Start_T_args) {
82 /* found Proj(ProjT(Start)) */
83 set_irn_link(node, data->proj_data);
84 data->proj_data = node;
87 } else if (opcode == iro_Start) {
88 if (get_Proj_proj(node) == pn_Start_X_initial_exec) {
89 /* found ProjX(Start) */
95 int i, n_pred = get_Block_n_cfgpreds(node);
98 * the first block has the initial exec as cfg predecessor
100 if (node != get_irg_start_block(get_irn_irg(node))) {
101 for (i = 0; i < n_pred; ++i) {
102 if (get_Block_cfgpred(node, i) == data->proj_X) {
116 typedef enum tail_rec_variants {
117 TR_DIRECT, /**< direct return value, i.e. return func(). */
118 TR_ADD, /**< additive return value, i.e. return x +/- func() */
119 TR_MUL, /**< multiplicative return value, i.e. return x * func() or return -func() */
120 TR_BAD, /**< any other transformation */
121 TR_UNKNOWN /**< during construction */
124 typedef struct tr_env {
125 int n_tail_calls; /**< number of tail calls found */
126 int n_ress; /**< number of return values */
127 tail_rec_variants *variants; /**< return value variants */
128 ir_node *rets; /**< list of returns that can be transformed */
133 * do the graph reconstruction for tail-recursion elimination
135 * @param irg the graph that will reconstructed
136 * @param env tail recursion environment
138 static void do_opt_tail_rec(ir_graph *irg, tr_env *env)
140 ir_node *end_block = get_irg_end_block(irg);
141 ir_node *block, *jmp, *call, *calls;
144 ir_node ***call_params;
146 int i, j, n_params, n_locs;
148 int rem = get_optimize();
149 ir_entity *ent = get_irg_entity(irg);
150 ir_type *method_tp = get_entity_type(ent);
152 assert(env->n_tail_calls > 0);
154 /* we add new blocks and change the control flow */
155 set_irg_doms_inconsistent(irg);
156 set_irg_extblk_inconsistent(irg);
158 /* we add a new loop */
159 set_irg_loopinfo_inconsistent(irg);
161 /* calls are removed */
162 set_trouts_inconsistent();
164 /* we must build some new nodes WITHOUT CSE */
167 /* collect needed data */
171 data.proj_m = get_irg_initial_mem(irg);
172 data.proj_data = NULL;
173 irg_walk_graph(irg, NULL, collect_data, &data);
175 /* check number of arguments */
176 call = (ir_node*)get_irn_link(end_block);
177 n_params = get_Call_n_params(call);
179 assert(data.proj_X && "Could not find initial exec from Start");
180 assert(data.block && "Could not find first block");
181 assert(data.proj_m && "Could not find initial memory");
182 assert((data.proj_data || n_params == 0) && "Could not find Proj(ProjT(Start)) of non-void function");
184 /* allocate in's for phi and block construction */
185 NEW_ARR_A(ir_node *, in, env->n_tail_calls + 1);
187 /* build a new header block for the loop we create */
189 in[i++] = data.proj_X;
191 /* turn Return's into Jmp's */
192 for (p = env->rets; p; p = n) {
193 ir_node *block = get_nodes_block(p);
195 n = (ir_node*)get_irn_link(p);
196 in[i++] = new_r_Jmp(block);
198 // exchange(p, new_r_Bad(irg));
200 /* we might generate an endless loop, so add
201 * the block to the keep-alive list */
202 add_End_keepalive(get_irg_end(irg), block);
204 assert(i == env->n_tail_calls + 1);
207 block = new_r_Block(irg, i, in);
208 jmp = new_r_Jmp(block);
210 /* the old first block is now the second one */
211 set_Block_cfgpred(data.block, data.blk_idx, jmp);
213 /* allocate phi's, position 0 contains the memory phi */
214 NEW_ARR_A(ir_node *, phis, n_params + 1);
216 /* build the memory phi */
218 in[i] = new_r_Proj(get_irg_start(irg), mode_M, pn_Start_M);
219 set_irg_initial_mem(irg, in[i]);
222 for (calls = call; calls != NULL; calls = (ir_node*)get_irn_link(calls)) {
223 in[i] = get_Call_mem(calls);
226 assert(i == env->n_tail_calls + 1);
228 phis[0] = new_r_Phi(block, env->n_tail_calls + 1, in, mode_M);
230 /* build the data Phi's */
236 NEW_ARR_A(ir_node **, call_params, env->n_tail_calls);
238 /* collect all parameters */
239 for (i = 0, calls = call; calls != NULL;
240 calls = (ir_node*)get_irn_link(calls)) {
241 call_params[i] = get_Call_param_arr(calls);
245 /* build new Proj's and Phi's */
246 args = get_irg_args(irg);
247 args_bl = get_nodes_block(args);
248 for (i = 0; i < n_params; ++i) {
249 ir_mode *mode = get_type_mode(get_method_param_type(method_tp, i));
251 in[0] = new_r_Proj(args, mode, i);
252 for (j = 0; j < env->n_tail_calls; ++j)
253 in[j + 1] = call_params[j][i];
255 phis[i + 1] = new_r_Phi(block, env->n_tail_calls + 1, in, mode);
260 * ok, we are here, so we have build and collected all needed Phi's
261 * now exchange all Projs into links to Phi
263 exchange(data.proj_m, phis[0]);
264 for (p = data.proj_data; p; p = n) {
265 long proj = get_Proj_proj(p);
267 assert(0 <= proj && proj < n_params);
268 n = (ir_node*)get_irn_link(p);
269 exchange(p, phis[proj + 1]);
272 /* tail recursion was done, all info is invalid */
273 set_irg_doms_inconsistent(irg);
274 set_irg_extblk_inconsistent(irg);
275 set_irg_loopinfo_state(irg, loopinfo_cf_inconsistent);
276 set_trouts_inconsistent();
277 set_irg_callee_info_state(irg, irg_callee_info_inconsistent);
281 /* check if we need new values */
283 for (i = 0; i < env->n_ress; ++i) {
284 if (env->variants[i] != TR_DIRECT) {
291 ir_node *start_block;
295 NEW_ARR_A(ir_node *, in, env->n_ress);
296 NEW_ARR_A(ir_mode *, modes, env->n_ress);
297 ssa_cons_start(irg, env->n_ress);
299 start_block = get_irg_start_block(irg);
300 set_r_cur_block(irg, start_block);
302 /* set the neutral elements for the iteration start */
303 for (i = 0; i < env->n_ress; ++i) {
304 ir_type *tp = get_method_res_type(method_tp, i);
305 ir_mode *mode = get_type_mode(tp);
308 if (env->variants[i] == TR_ADD) {
309 set_r_value(irg, i, new_r_Const(irg, get_mode_null(mode)));
310 } else if (env->variants[i] == TR_MUL) {
311 set_r_value(irg, i, new_r_Const(irg, get_mode_one(mode)));
314 mature_immBlock(start_block);
316 /* no: we can kill all returns */
317 for (p = env->rets; p; p = n) {
318 ir_node *block = get_nodes_block(p);
319 ir_node *call, *mem, *jmp, *tuple;
321 set_r_cur_block(irg, block);
322 n = (ir_node*)get_irn_link(p);
324 call = skip_Proj(get_Return_mem(p));
325 assert(is_Call(call));
327 mem = get_Call_mem(call);
329 /* create a new jump, free of CSE */
331 jmp = new_r_Jmp(block);
334 for (i = 0; i < env->n_ress; ++i) {
335 ir_mode *mode = modes[i];
336 if (env->variants[i] != TR_DIRECT) {
337 in[i] = get_r_value(irg, i, mode);
339 in[i] = new_r_Bad(irg, mode);
342 /* create a new tuple for the return values */
343 tuple = new_r_Tuple(block, env->n_ress, in);
345 turn_into_tuple(call, pn_Call_max);
346 set_Tuple_pred(call, pn_Call_M, mem);
347 set_Tuple_pred(call, pn_Call_X_regular, jmp);
348 set_Tuple_pred(call, pn_Call_X_except, new_r_Bad(irg, mode_X));
349 set_Tuple_pred(call, pn_Call_T_result, tuple);
351 for (i = 0; i < env->n_ress; ++i) {
352 ir_node *res = get_Return_res(p, i);
353 if (env->variants[i] != TR_DIRECT) {
354 set_r_value(irg, i, res);
358 exchange(p, new_r_Bad(irg, mode_X));
361 /* finally fix all other returns */
362 end_block = get_irg_end_block(irg);
363 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
364 ir_node *ret = get_Block_cfgpred(end_block, i);
367 /* search all Returns of a block */
368 if (! is_Return(ret))
371 block = get_nodes_block(ret);
372 set_r_cur_block(irg, block);
373 for (j = 0; j < env->n_ress; ++j) {
374 ir_node *pred = get_Return_res(ret, j);
377 switch (env->variants[j]) {
382 n = get_r_value(irg, j, modes[j]);
383 n = new_r_Add(block, n, pred, modes[j]);
384 set_Return_res(ret, j, n);
388 n = get_r_value(irg, j, modes[j]);
389 n = new_r_Mul(block, n, pred, modes[j]);
390 set_Return_res(ret, j, n);
394 assert(!"unexpected tail recursion variant");
398 ssa_cons_finish(irg);
400 ir_node *bad = new_r_Bad(irg, mode_X);
402 /* no: we can kill all returns */
403 for (p = env->rets; p; p = n) {
404 n = (ir_node*)get_irn_link(p);
411 * Check the lifetime of locals in the given graph.
412 * Tail recursion can only be done, if we can prove that
413 * the lifetime of locals end with the recursive call.
414 * We do this by checking that no address of a local variable is
415 * stored or transmitted as an argument to a call.
417 * @return non-zero if it's ok to do tail recursion
419 static int check_lifetime_of_locals(ir_graph *irg)
423 ir_type *frame_tp = get_irg_frame_type(irg);
425 irg_frame = get_irg_frame(irg);
426 for (i = get_irn_n_outs(irg_frame) - 1; i >= 0; --i) {
427 ir_node *succ = get_irn_out(irg_frame, i);
430 /* Check if we have compound arguments.
431 For now, we cannot handle them, */
432 if (get_entity_owner(get_Sel_entity(succ)) != frame_tp)
435 if (is_address_taken(succ))
443 * Examine irn and detect the recursion variant.
445 static tail_rec_variants find_variant(ir_node *irn, ir_node *call)
448 tail_rec_variants va, vb, res;
450 if (skip_Proj(skip_Proj(irn)) == call) {
454 switch (get_irn_opcode(irn)) {
457 a = get_Add_left(irn);
458 if (get_nodes_block(a) != get_nodes_block(call)) {
459 /* we are outside, ignore */
462 va = find_variant(a, call);
466 b = get_Add_right(irn);
467 if (get_nodes_block(b) != get_nodes_block(call)) {
468 /* we are outside, ignore */
471 vb = find_variant(b, call);
478 else if (va == TR_UNKNOWN)
480 else if (vb == TR_UNKNOWN)
483 /* they are different but none is TR_UNKNOWN -> incompatible */
486 if (res == TR_DIRECT || res == TR_ADD)
492 /* try additive, but return value must be left */
493 a = get_Sub_left(irn);
494 if (get_nodes_block(a) != get_nodes_block(call)) {
495 /* we are outside, ignore */
498 va = find_variant(a, call);
502 b = get_Sub_right(irn);
503 if (get_nodes_block(b) != get_nodes_block(call)) {
504 /* we are outside, ignore */
507 vb = find_variant(b, call);
508 if (vb != TR_UNKNOWN)
512 if (res == TR_DIRECT || res == TR_ADD)
518 /* try multiplicative */
519 a = get_Mul_left(irn);
520 if (get_nodes_block(a) != get_nodes_block(call)) {
521 /* we are outside, ignore */
524 va = find_variant(a, call);
528 b = get_Mul_right(irn);
529 if (get_nodes_block(b) != get_nodes_block(call)) {
530 /* we are outside, ignore */
533 vb = find_variant(b, call);
540 else if (va == TR_UNKNOWN)
542 else if (vb == TR_UNKNOWN)
545 /* they are different but none is TR_UNKNOWN -> incompatible */
548 if (res == TR_DIRECT || res == TR_MUL)
554 /* try multiplicative */
555 a = get_Minus_op(irn);
556 res = find_variant(a, call);
557 if (res == TR_DIRECT)
559 if (res == TR_MUL || res == TR_UNKNOWN)
571 * convert simple tail-calls into loops
573 int opt_tail_rec_irg(ir_graph *irg)
577 int i, n_ress, n_tail_calls = 0;
578 ir_node *rets = NULL;
579 ir_type *mtd_type, *call_type;
583 FIRM_DBG_REGISTER(dbg, "firm.opt.tailrec");
585 assure_irg_outs(irg);
587 if (! check_lifetime_of_locals(irg))
590 rem = current_ir_graph;
591 current_ir_graph = irg;
593 ent = get_irg_entity(irg);
594 mtd_type = get_entity_type(ent);
595 n_ress = get_method_n_ress(mtd_type);
601 NEW_ARR_A(tail_rec_variants, env.variants, n_ress);
603 for (i = 0; i < n_ress; ++i)
604 env.variants[i] = TR_DIRECT;
608 * This tail recursion optimization works best
609 * if the Returns are normalized.
611 normalize_n_returns(irg);
613 ir_reserve_resources(irg, IR_RESOURCE_IRN_LINK);
615 end_block = get_irg_end_block(irg);
616 set_irn_link(end_block, NULL);
618 for (i = get_Block_n_cfgpreds(end_block) - 1; i >= 0; --i) {
619 ir_node *ret = get_Block_cfgpred(end_block, i);
620 ir_node *call, *call_ptr;
624 /* search all Returns of a block */
625 if (! is_Return(ret))
628 /* check, if it's a Return self() */
629 call = skip_Proj(get_Return_mem(ret));
633 /* the call must be in the same block as the return */
634 if (get_nodes_block(call) != get_nodes_block(ret))
637 /* check if it's a recursive call */
638 call_ptr = get_Call_ptr(call);
640 if (! is_Global(call_ptr))
643 ent = get_Global_entity(call_ptr);
644 if (!ent || get_entity_irg(ent) != irg)
648 * Check, that the types match. At least in C
651 mtd_type = get_entity_type(ent);
652 call_type = get_Call_type(call);
654 if (mtd_type != call_type) {
656 * Hmm, the types did not match, bad.
657 * This can happen in C when no prototype is given
658 * or K&R style is used.
660 DB((dbg, LEVEL_3, " tail recursion fails because of call type mismatch: %+F != %+F\n", mtd_type, call_type));
664 /* ok, mem is routed to a recursive call, check return args */
665 ress = get_Return_res_arr(ret);
666 for (j = get_Return_n_ress(ret) - 1; j >= 0; --j) {
667 tail_rec_variants var = find_variant(ress[j], call);
670 /* cannot be transformed */
673 if (var == TR_DIRECT)
674 var = env.variants[j];
675 else if (env.variants[j] == TR_DIRECT)
676 env.variants[j] = var;
677 if (env.variants[j] != var) {
679 DB((dbg, LEVEL_3, " tail recursion fails for %d return value of %+F\n", j, ret));
686 /* here, we have found a call */
687 set_irn_link(call, get_irn_link(end_block));
688 set_irn_link(end_block, call);
691 /* link all returns, we will need this */
692 set_irn_link(ret, rets);
696 /* now, end_block->link contains the list of all tail calls */
697 if (n_tail_calls > 0) {
698 DB((dbg, LEVEL_2, " Performing tail recursion for graph %s and %d Calls\n",
699 get_entity_ld_name(get_irg_entity(irg)), n_tail_calls));
701 hook_tail_rec(irg, n_tail_calls);
703 env.n_tail_calls = n_tail_calls;
705 do_opt_tail_rec(irg, &env);
707 ir_free_resources(irg, IR_RESOURCE_IRN_LINK);
708 current_ir_graph = rem;
712 ir_graph_pass_t *opt_tail_rec_irg_pass(const char *name)
714 return def_graph_pass_ret(name ? name : "tailrec", opt_tail_rec_irg);
718 * optimize tail recursion away
720 void opt_tail_recursion(void)
723 size_t n_opt_applications = 0;
725 FIRM_DBG_REGISTER(dbg, "firm.opt.tailrec");
727 DB((dbg, LEVEL_1, "Performing tail recursion ...\n"));
728 for (i = 0, n = get_irp_n_irgs(); i < n; ++i) {
729 ir_graph *irg = get_irp_irg(i);
731 if (opt_tail_rec_irg(irg))
732 ++n_opt_applications;
735 DB((dbg, LEVEL_1, "Done for %zu of %zu graphs.\n",
736 n_opt_applications, get_irp_n_irgs()));
739 ir_prog_pass_t *opt_tail_recursion_pass(const char *name)
741 return def_prog_pass(name ? name : "tailrec", opt_tail_recursion);