* Returns the number of block successors.
* we are interested only in 1, 2 and >2.
*/
-static int get_block_n_succs(ir_node *block) {
+static int get_block_n_succs(ir_node *block)
+{
if (edges_activated(current_ir_graph)) {
const ir_edge_t *edge;
basic block, so create a new one here.
*/
if (get_block_n_succs(block) > 2) {
- const ir_edge_t *edge;
-
foreach_block_succ(block, edge) {
ir_node *succ = get_edge_src_irn(edge);
create_extblk(succ, env);
ir_node *succ = get_edge_src_irn(edge);
double execfreq;
- if(irn_visited(succ))
+ if (irn_visited(succ))
continue;
- if(get_Block_n_cfgpreds(succ) > 1) {
+ if (get_Block_n_cfgpreds(succ) > 1) {
create_extblk(succ, env);
continue;
}
}
/* add best successor and recursively try to pick more */
- if(best_succ != NULL) {
+ if (best_succ != NULL) {
addto_extblk(extblk, best_succ);
mark_irn_visited(best_succ);
pick_successor(best_succ, extblk, env);
/*
* Compute the extended basic blocks for a graph
*/
-void compute_extbb_execfreqs(ir_graph *irg, ir_exec_freq *execfreqs) {
+void compute_extbb_execfreqs(ir_graph *irg, ir_exec_freq *execfreqs)
+{
env_t env;
ir_extblk *extbb, *next;
ir_node *endblock;
}
#if 0
- for(i = 0; i < len; ++i) {
- if(i > 0)
+ for (i = 0; i < len; ++i) {
+ if (i > 0)
printf(", ");
ir_printf("%+F", extbb->blks[i]);
}