/*
* Normalize the Returns of a graph by creating a new End block
* with One Return(Phi).
- * This is the prefered input for the if-conversion.
+ * This is the preferred input for the if-conversion.
*
* In pseudocode, it means:
*
/* look, if we have more than one return */
n = get_Block_n_cfgpreds(endbl);
+ assert(n > 0);
returns = alloca((n + 7) >> 3);
memset(returns, 0, (n + 7) >> 3);
* a new Block was added, so dominator, outs and loop are inconsistent,
* trouts and callee-state should be still valid
*/
- set_irg_dom_inconsistent(irg);
+ set_irg_doms_inconsistent(irg);
set_irg_outs_inconsistent(irg);
set_irg_loopinfo_state(current_ir_graph, loopinfo_cf_inconsistent);
}
/*
* Normalize the Returns of a graph by moving
* the Returns upwards as much as possible.
- * This might be prefered for code generation.
+ * This might be preferred for code generation.
*
* In pseudocode, it means:
*
exchange(endbl, new_r_Block(irg, n_finals, in));
- /* the end block is not automatically skiped, so do it here */
+ /* 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 Eeturns were deleted, so dominator, outs and loop are inconsistent,
+ * 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_dom_inconsistent(irg);
+ set_irg_doms_inconsistent(irg);
set_irg_outs_inconsistent(irg);
set_irg_loopinfo_state(current_ir_graph, loopinfo_cf_inconsistent);
}