- int i, j, n, n_rets, n_finals, n_ret_vals;
- ir_node *list = NULL;
- ir_node *final = NULL;
- ir_node **in;
- ir_node *endbl = get_irg_end_block(irg);
- ir_node *end;
-
- /*
- * First, link all returns:
- * These must be predecessors of the endblock.
- * Place Returns that can be moved on list, all others
- * on final.
- */
- n = get_Block_n_cfgpreds(endbl);
- for (n_finals = n_rets = i = 0; i < n; ++i) {
- ir_node *ret = get_Block_cfgpred(endbl, i);
-
- if (is_Return(ret) && can_move_ret(ret)) {
- /*
- * Ok, all conditions met, we can move this Return, put it
- * on our work list.
- */
- set_irn_link(ret, list);
- list = ret;
- ++n_rets;
- }
- else {
- /* Put all nodes that are not changed on the final list. */
- set_irn_link(ret, final);
- final = ret;
- ++n_finals;
- }
- }
-
- if (n_rets <= 0)
- return;
-
- /*
- * Now move the Returns upwards. We move always one block up (and create n
- * new Returns), than we check if a newly created Return can be moved even further.
- * If yes, we simply add it to our work list, else to the final list.
- */
- end = get_irg_end(irg);
- n_ret_vals = get_irn_arity(list);
- in = alloca(sizeof(*in) * n_ret_vals);
- while (list) {
- ir_node *ret = list;
- ir_node *block = get_nodes_block(ret);
- ir_node *phiM;
-
- list = get_irn_link(ret);
- --n_rets;
-
- n = get_Block_n_cfgpreds(block);
- for (i = 0; i < n; ++i) {
- ir_node *jmp = get_Block_cfgpred(block, i);
- ir_node *new_bl, *new_ret;
-
- if (get_irn_op(jmp) != op_Jmp)
- continue;
-
- new_bl = get_nodes_block(jmp);
-
- /* create the in-array for the new Ret */
- for (j = 0; j < n_ret_vals; ++j) {
- ir_node *pred = get_irn_n(ret, j);
-
- in[j] = (is_Phi(pred) && get_nodes_block(pred) == block) ? get_Phi_pred(pred, i) : pred;
- }
-
- new_ret = new_r_Return(irg, new_bl, in[0], n_ret_vals - 1, &in[1]);
-
- if (! is_Bad(new_ret)) {
- /*
- * The newly created node might be bad, if we
- * create it in a block with only Bad predecessors.
- * In that case ignore this block.
- *
- * We could even kill the jmp then ...
- */
- if (can_move_ret(new_ret)) {
- set_irn_link(new_ret, list);
- list = new_ret;
- ++n_rets;
- }
- else {
- set_irn_link(new_ret, final);
- final = new_ret;
- ++n_finals;
- }
- }
-
- /* remove the Jmp, we have placed a Return here */
- exchange(jmp, new_r_Bad(irg));
- }
-
- /*
- * if the memory of the old Return is a PhiM, remove it
- * from the keep-alives, or it will keep the block which
- * will crash the dominator algorithm.
- */
- phiM = get_Return_mem(ret);
- if (is_Phi(phiM)) {
- n = get_End_n_keepalives(end);
- for (i = 0; i < n; ++i) {
- if (get_End_keepalive(end, i) == phiM) {
- set_End_keepalive(end, i, new_r_Bad(irg));
- break;
- }
- }
- }
- }
-
- /*
- * Last step: Create a new endblock, with all nodes on the final
- * list as predecessors.
- */
- in = alloca(sizeof(*in) * n_finals);
-
- for (i = 0; final; ++i, final = get_irn_link(final))
- in[i] = final;
-
- exchange(endbl, new_r_Block(irg, n_finals, in));
-
- /* the end block is not automatically skipped, so do it here */
- set_irg_end_block(irg, skip_Id(get_irg_end_block(irg)));
-
- /* Invalidate analysis information:
- * Blocks become dead and new Returns were deleted, so dominator, outs and loop are inconsistent,
- * trouts and callee-state should be still valid
- */
- set_irg_doms_inconsistent(irg);
- set_irg_outs_inconsistent(irg);
- set_irg_loopinfo_state(current_ir_graph, loopinfo_cf_inconsistent);
+ int i, j, n, n_rets, n_finals, n_ret_vals;
+ ir_node *list = NULL;
+ ir_node *final = NULL;
+ ir_node **in;
+ ir_node *endbl = get_irg_end_block(irg);
+ ir_node *end;
+
+ /*
+ * First, link all returns:
+ * These must be predecessors of the endblock.
+ * Place Returns that can be moved on list, all others
+ * on final.
+ */
+ n = get_Block_n_cfgpreds(endbl);
+ for (n_finals = n_rets = i = 0; i < n; ++i) {
+ ir_node *ret = get_Block_cfgpred(endbl, i);
+
+ if (is_Return(ret) && can_move_ret(ret)) {
+ /*
+ * Ok, all conditions met, we can move this Return, put it
+ * on our work list.
+ */
+ set_irn_link(ret, list);
+ list = ret;
+ ++n_rets;
+ } else {
+ /* Put all nodes that are not changed on the final list. */
+ set_irn_link(ret, final);
+ final = ret;
+ ++n_finals;
+ }
+ }
+
+ if (n_rets <= 0)
+ return;
+
+ /*
+ * Now move the Returns upwards. We move always one block up (and create n
+ * new Returns), than we check if a newly created Return can be moved even further.
+ * If yes, we simply add it to our work list, else to the final list.
+ */
+ end = get_irg_end(irg);
+ n_ret_vals = get_irn_arity(list);
+ in = ALLOCAN(ir_node*, n_ret_vals);
+ while (list) {
+ ir_node *ret = list;
+ ir_node *block = get_nodes_block(ret);
+ dbg_info *dbgi = get_irn_dbg_info(ret);
+ ir_node *phiM;
+
+ list = (ir_node*)get_irn_link(ret);
+ --n_rets;
+
+ n = get_Block_n_cfgpreds(block);
+ for (i = 0; i < n; ++i) {
+ ir_node *jmp = get_Block_cfgpred(block, i);
+ ir_node *new_bl, *new_ret;
+
+ if (is_Bad(jmp))
+ continue;
+ assert(is_Jmp(jmp));
+
+ new_bl = get_nodes_block(jmp);
+
+ /* create the in-array for the new Return */
+ for (j = 0; j < n_ret_vals; ++j) {
+ ir_node *pred = get_irn_n(ret, j);
+
+ in[j] = (is_Phi(pred) && get_nodes_block(pred) == block) ? get_Phi_pred(pred, i) : pred;
+ }
+
+ new_ret = new_rd_Return(dbgi, new_bl, in[0], n_ret_vals - 1, &in[1]);
+
+ if (! is_Bad(new_ret)) {
+ /*
+ * The newly created node might be bad, if we
+ * create it in a block with only Bad predecessors.
+ * In that case ignore this block.
+ *
+ * We could even kill the jmp then ...
+ */
+ if (can_move_ret(new_ret)) {
+ set_irn_link(new_ret, list);
+ list = new_ret;
+ ++n_rets;
+ } else {
+ set_irn_link(new_ret, final);
+ final = new_ret;
+ ++n_finals;
+ }
+ }
+
+ /* remove the Jmp, we have placed a Return here */
+ exchange(jmp, new_r_Bad(irg, mode_X));
+ }
+
+ /*
+ * if the memory of the old Return is a PhiM, remove it
+ * from the keep-alives, or it will keep the block which
+ * will crash the dominator algorithm.
+ */
+ phiM = get_Return_mem(ret);
+ if (is_Phi(phiM)) {
+ n = get_End_n_keepalives(end);
+ for (i = 0; i < n; ++i) {
+ if (get_End_keepalive(end, i) == phiM) {
+ set_End_keepalive(end, i, new_r_Bad(irg, mode_M));
+ break;
+ }
+ }
+ }
+ }
+
+ /*
+ * Last step: Create a new endblock, with all nodes on the final
+ * list as predecessors.
+ */
+ in = ALLOCAN(ir_node*, n_finals);
+
+ for (i = 0; final != NULL; ++i, final = (ir_node*)get_irn_link(final))
+ in[i] = final;
+
+ exchange(endbl, new_r_Block(irg, n_finals, in));
+
+ /* the end block is not automatically skipped, so do it here */
+ set_irg_end_block(irg, skip_Id(get_irg_end_block(irg)));
+
+ /* Invalidate analysis information:
+ * Blocks become dead and new Returns were deleted, so dominator, outs and loop are inconsistent,
+ * trouts and callee-state should be still valid
+ */
+ set_irg_doms_inconsistent(irg);
+ set_irg_extblk_inconsistent(irg); /* may not be needed */
+}
+
+/* Create a graph pass. */
+ir_graph_pass_t *normalize_n_returns_pass(const char *name)
+{
+ return def_graph_pass(name ? name : "n_rets", normalize_n_returns);