static unsigned int
tree_ssa_ifcombine (void)
{
basic_block *bbs;
bool cfg_changed = false;
int i;
bbs = single_pred_before_succ_order ();
calculate_dominance_info (CDI_DOMINATORS);
/* Search every basic block for COND_EXPR we may be able to optimize.
We walk the blocks in order that guarantees that a block with
a single predecessor is processed after the predecessor.
This ensures that we collapse outter ifs before visiting the
inner ones, and also that we do not try to visit a removed
block. This is opposite of PHI-OPT, because we cascade the
combining rather than cascading PHIs. */
for (i = n_basic_blocks_for_fn (cfun) - NUM_FIXED_BLOCKS - 1; i >= 0; i--)
{
basic_block bb = bbs[i];
gimple stmt = last_stmt (bb);
if (stmt
&& gimple_code (stmt) == GIMPLE_COND)
cfg_changed |= tree_ssa_ifcombine_bb (bb);
}
free (bbs);
return cfg_changed ? TODO_cleanup_cfg : 0;
}
static unsigned int
tree_ssa_ifcombine (void)
{
basic_block *bbs;
bool cfg_changed = false;
int i;
bbs = blocks_in_phiopt_order ();
for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; ++i)
{
basic_block bb = bbs[i];
gimple stmt = last_stmt (bb);
if (stmt
&& gimple_code (stmt) == GIMPLE_COND)
cfg_changed |= tree_ssa_ifcombine_bb (bb);
}
free (bbs);
return cfg_changed ? TODO_cleanup_cfg : 0;
}
static unsigned int
tree_ssa_ifcombine (void)
{
basic_block *bbs;
bool cfg_changed = false;
int i;
bbs = single_pred_before_succ_order ();
calculate_dominance_info (CDI_DOMINATORS);
for (i = 0; i < n_basic_blocks - NUM_FIXED_BLOCKS; ++i)
{
basic_block bb = bbs[i];
gimple stmt = last_stmt (bb);
if (stmt
&& gimple_code (stmt) == GIMPLE_COND)
cfg_changed |= tree_ssa_ifcombine_bb (bb);
}
free (bbs);
return cfg_changed ? TODO_cleanup_cfg : 0;
}
