diff options
Diffstat (limited to 'gcc/cfgloopanal.c')
| -rw-r--r-- | gcc/cfgloopanal.c | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/gcc/cfgloopanal.c b/gcc/cfgloopanal.c index 856332bef4d..060c9c2ddd8 100644 --- a/gcc/cfgloopanal.c +++ b/gcc/cfgloopanal.c @@ -178,7 +178,7 @@ dfs (struct graph *g, int *qs, int nq, int *qt, bool forward) { if (qt) qt[tick] = v; - g->vertices[v].post = tick++; + g->vertices[v].post = tick++; if (!top) break; @@ -257,7 +257,7 @@ free_graph (struct graph *g) for parts of cycles that only "pass" through some loop -- i.e. for each cycle, we want to mark blocks that belong directly to innermost loop containing the whole cycle. - + LOOPS is the loop tree. */ #define LOOP_REPR(LOOP) ((LOOP)->num + last_basic_block) @@ -290,8 +290,8 @@ mark_irreducible_loops (struct loops *loops) FOR_BB_BETWEEN (act, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) FOR_EACH_EDGE (e, ei, act->succs) { - /* Ignore edges to exit. */ - if (e->dest == EXIT_BLOCK_PTR) + /* Ignore edges to exit. */ + if (e->dest == EXIT_BLOCK_PTR) continue; /* And latch edges. */ @@ -433,9 +433,9 @@ expected_loop_iterations (const struct loop *loop) count_in += e->count; if (count_in == 0) - expected = count_latch * 2; + expected = count_latch * 2; else - expected = (count_latch + count_in - 1) / count_in; + expected = (count_latch + count_in - 1) / count_in; /* Avoid overflows. */ return (expected > REG_BR_PROB_BASE ? REG_BR_PROB_BASE : expected); @@ -526,7 +526,7 @@ init_set_costs (void) target_res_regs = 3; /* These are really just heuristic values. */ - + start_sequence (); emit_move_insn (reg1, reg2); seq = get_insns (); @@ -572,7 +572,7 @@ mark_loop_exit_edges (struct loops *loops) { basic_block bb; edge e; - + if (loops->num <= 1) return; |
