3 * File name: ir/opt/return.c
4 * Purpose: normalize returns
8 * Copyright: (c) 1998-2005 Universität Karlsruhe
9 * Licence: This file protected by GPL - GNU GENERAL PUBLIC LICENSE.
22 #include "irgraph_t.h"
27 #define set_bit(n) (returns[(n) >> 3] |= 1 << ((n) & 7))
28 #define get_bit(n) (returns[(n) >> 3] & (1 << ((n) & 7)))
31 #define IMAX(a, b) ((a) > (b) ? (a) : (b))
34 * Normalize the Returns of a graph by creating a new End block
35 * with One Return(Phi).
36 * This is the preferred input for the if-conversion.
38 * In pseudocode, it means:
53 void normalize_one_return(ir_graph *irg)
55 ir_node *endbl = get_irg_end_block(irg);
56 int i, j, k, n, last_idx, n_rets, n_ret_vals = -1;
57 unsigned char *returns;
58 ir_node **in, **retvals, **endbl_in;
62 /* look, if we have more than one return */
63 n = get_Block_n_cfgpreds(endbl);
65 returns = alloca((n + 7) >> 3);
66 memset(returns, 0, (n + 7) >> 3);
68 for (n_rets = i = 0; i < n; ++i) {
69 ir_node *node = get_Block_cfgpred(endbl, i);
71 if (is_Return(node)) {
77 n_ret_vals = get_irn_arity(node);
81 /* there should be at least one Return node in Firm */
85 in = alloca(sizeof(*in) * IMAX(n_rets, n_ret_vals));
86 retvals = alloca(sizeof(*retvals) * n_rets * n_ret_vals);
87 endbl_in = alloca(sizeof(*endbl_in) * n);
90 for (j = i = 0; i < n; ++i) {
91 ir_node *ret = get_Block_cfgpred(endbl, i);
94 ir_node *block = get_nodes_block(ret);
96 /* create a new Jmp for every Ret and place the in in */
97 in[j] = new_r_Jmp(irg, block);
99 /* save the return values and shuffle them */
100 for (k = 0; k < n_ret_vals; ++k)
101 retvals[j + k*n_rets] = get_irn_n(ret, k);
106 endbl_in[last_idx++] = ret;
109 /* ok, create a new block with all created in's */
110 block = new_r_Block(irg, n_rets, in);
112 /* now create the Phi nodes */
113 for (j = i = 0; i < n_ret_vals; ++i, j += n_rets) {
116 /* the return values are already shuffled */
118 /* Beware: normally the Phi constructor automatically replaces a Phi(a,...a) into a
119 but NOT, if a is Unknown. Here, we known that this case can be optimize also,
121 first = retvals[j + 0];
122 for (k = 1; k < n_rets; ++k) {
123 if (retvals[j + k] != first) {
131 in[i] = new_r_Phi(irg, block, n_rets, &retvals[j], get_irn_mode(retvals[j]));
134 endbl_in[last_idx++] = new_r_Return(irg, block, in[0], n_ret_vals-1, &in[1]);
136 set_irn_in(endbl, last_idx, endbl_in);
138 /* invalidate analysis information:
139 * a new Block was added, so dominator, outs and loop are inconsistent,
140 * trouts and callee-state should be still valid
142 set_irg_doms_inconsistent(irg);
143 set_irg_outs_inconsistent(irg);
144 set_irg_extblk_inconsistent(irg);
145 set_irg_loopinfo_state(irg, loopinfo_cf_inconsistent);
149 * check, whether a Ret can be moved on block upwards.
151 * In a block with a Return, all live nodes must be linked
152 * with the Return, otherwise they are dead (because the Return leaves
153 * the graph, so no more users of the other nodes can exists.
155 * We can move a Return, if it's predecessors are Phi nodes or
156 * comes from another block. In the later case, it is always possible
157 * to move the Return one block up, because the predecessor block must
158 * dominate the Return block (SSA) and then it dominates the predecessor
159 * block of the Return block as well.
161 * All predecessors of the Return block must be Jmp's of course, or we
162 * cannot move it up, so we check this either.
164 static int can_move_ret(ir_node *ret)
166 ir_node *retbl = get_nodes_block(ret);
167 int i, n = get_irn_arity(ret);
169 for (i = 0; i < n; ++i) {
170 ir_node *pred = get_irn_n(ret, i);
172 if (! is_Phi(pred) && retbl == get_nodes_block(pred)) {
173 /* first condition failed, found a non-Phi predecessor
174 * then is in the Return block */
179 /* check, that predecessors are Jmps */
180 n = get_Block_n_cfgpreds(retbl);
181 for (i = 0; i < n; ++i)
182 if (get_irn_op(get_Block_cfgpred(retbl, i)) != op_Jmp)
185 /* if we have 0 control flow predecessors, we cannot move :-) */
190 * Normalize the Returns of a graph by moving
191 * the Returns upwards as much as possible.
192 * This might be preferred for code generation.
194 * In pseudocode, it means:
202 * is transformed into
209 void normalize_n_returns(ir_graph *irg)
211 int i, j, n, n_rets, n_finals, n_ret_vals;
212 ir_node *list = NULL;
213 ir_node *final = NULL;
215 ir_node *endbl = get_irg_end_block(irg);
219 * First, link all returns:
220 * These must be predecessors of the endblock.
221 * Place Returns that can be moved on list, all others
224 n = get_Block_n_cfgpreds(endbl);
225 for (n_finals = n_rets = i = 0; i < n; ++i) {
226 ir_node *ret = get_Block_cfgpred(endbl, i);
228 if (is_Return(ret) && can_move_ret(ret)) {
230 * Ok, all conditions met, we can move this Return, put it
233 set_irn_link(ret, list);
238 /* Put all nodes that are not changed on the final list. */
239 set_irn_link(ret, final);
249 * Now move the Returns upwards. We move always one block up (and create n
250 * new Returns), than we check if a newly created Return can be moved even further.
251 * If yes, we simply add it to our work list, else to the final list.
253 end = get_irg_end(irg);
254 n_ret_vals = get_irn_arity(list);
255 in = alloca(sizeof(*in) * n_ret_vals);
258 ir_node *block = get_nodes_block(ret);
261 list = get_irn_link(ret);
264 n = get_Block_n_cfgpreds(block);
265 for (i = 0; i < n; ++i) {
266 ir_node *jmp = get_Block_cfgpred(block, i);
267 ir_node *new_bl, *new_ret;
269 if (get_irn_op(jmp) != op_Jmp)
272 new_bl = get_nodes_block(jmp);
274 /* create the in-array for the new Ret */
275 for (j = 0; j < n_ret_vals; ++j) {
276 ir_node *pred = get_irn_n(ret, j);
278 in[j] = (is_Phi(pred) && get_nodes_block(pred) == block) ? get_Phi_pred(pred, i) : pred;
281 new_ret = new_r_Return(irg, new_bl, in[0], n_ret_vals - 1, &in[1]);
283 if (! is_Bad(new_ret)) {
285 * The newly created node might be bad, if we
286 * create it in a block with only Bad predecessors.
287 * In that case ignore this block.
289 * We could even kill the jmp then ...
291 if (can_move_ret(new_ret)) {
292 set_irn_link(new_ret, list);
297 set_irn_link(new_ret, final);
303 /* remove the Jmp, we have placed a Return here */
304 exchange(jmp, new_r_Bad(irg));
308 * if the memory of the old Return is a PhiM, remove it
309 * from the keep-alives, or it will keep the block which
310 * will crash the dominator algorithm.
312 phiM = get_Return_mem(ret);
314 n = get_End_n_keepalives(end);
315 for (i = 0; i < n; ++i) {
316 if (get_End_keepalive(end, i) == phiM) {
317 set_End_keepalive(end, i, new_r_Bad(irg));
325 * Last step: Create a new endblock, with all nodes on the final
326 * list as predecessors.
328 in = alloca(sizeof(*in) * n_finals);
330 for (i = 0; final; ++i, final = get_irn_link(final))
333 exchange(endbl, new_r_Block(irg, n_finals, in));
335 /* the end block is not automatically skipped, so do it here */
336 set_irg_end_block(irg, skip_Id(get_irg_end_block(irg)));
338 /* Invalidate analysis information:
339 * Blocks become dead and new Returns were deleted, so dominator, outs and loop are inconsistent,
340 * trouts and callee-state should be still valid
342 set_irg_doms_inconsistent(irg);
343 set_irg_outs_inconsistent(irg);
344 set_irg_loopinfo_state(current_ir_graph, loopinfo_cf_inconsistent);