Commit bd5a664e by Richard Kenner

(init_loop): Remove decls of unused variables.

(loop_optimize): Remove decl of unused variable END.
(combine_movables): Remove decls of unused variables.
(check_final_value): Remove decl of unused variable TEM.
(check_dbra_loop): Remove decls of unused variables.
(maybe_eliminate_biv): Remove decls of unused variables SET and V.

From-SVN: r6889
parent 5de22273
...@@ -297,9 +297,6 @@ init_loop () ...@@ -297,9 +297,6 @@ init_loop ()
{ {
char *free_point = (char *) oballoc (1); char *free_point = (char *) oballoc (1);
rtx reg = gen_rtx (REG, word_mode, 0); rtx reg = gen_rtx (REG, word_mode, 0);
rtx pow2 = GEN_INT (32);
rtx lea;
int i;
add_cost = rtx_cost (gen_rtx (PLUS, word_mode, reg, reg), SET); add_cost = rtx_cost (gen_rtx (PLUS, word_mode, reg, reg), SET);
...@@ -329,7 +326,6 @@ loop_optimize (f, dumpfile) ...@@ -329,7 +326,6 @@ loop_optimize (f, dumpfile)
{ {
register rtx insn; register rtx insn;
register int i; register int i;
rtx end;
rtx last_insn; rtx last_insn;
loop_dump_stream = dumpfile; loop_dump_stream = dumpfile;
...@@ -1241,7 +1237,6 @@ combine_movables (movables, nregs) ...@@ -1241,7 +1237,6 @@ combine_movables (movables, nregs)
{ {
register struct movable *m1; register struct movable *m1;
int regno = m->regno; int regno = m->regno;
rtx reg_note, reg_note1;
bzero (matched_regs, nregs); bzero (matched_regs, nregs);
matched_regs[regno] = 1; matched_regs[regno] = 1;
...@@ -4504,7 +4499,6 @@ check_final_value (v, loop_start, loop_end) ...@@ -4504,7 +4499,6 @@ check_final_value (v, loop_start, loop_end)
{ {
struct iv_class *bl; struct iv_class *bl;
rtx final_value = 0; rtx final_value = 0;
rtx tem;
bl = reg_biv_class[REGNO (v->src_reg)]; bl = reg_biv_class[REGNO (v->src_reg)];
...@@ -5609,7 +5603,6 @@ check_dbra_loop (loop_end, insn_count, loop_start) ...@@ -5609,7 +5603,6 @@ check_dbra_loop (loop_end, insn_count, loop_start)
rtx jump_label; rtx jump_label;
rtx final_value; rtx final_value;
rtx start_value; rtx start_value;
enum rtx_code branch_code;
rtx new_add_val; rtx new_add_val;
rtx comparison; rtx comparison;
rtx before_comparison; rtx before_comparison;
...@@ -5770,8 +5763,6 @@ check_dbra_loop (loop_end, insn_count, loop_start) ...@@ -5770,8 +5763,6 @@ check_dbra_loop (loop_end, insn_count, loop_start)
|| (bl->giv_count + bl->biv_count + num_mem_sets || (bl->giv_count + bl->biv_count + num_mem_sets
+ num_movables + 2 == insn_count))) + num_movables + 2 == insn_count)))
{ {
rtx condition = get_condition_for_loop (PREV_INSN (loop_end));
int win;
rtx tem; rtx tem;
/* Loop can be reversed. */ /* Loop can be reversed. */
...@@ -5901,8 +5892,7 @@ maybe_eliminate_biv (bl, loop_start, end, eliminate_p, threshold, insn_count) ...@@ -5901,8 +5892,7 @@ maybe_eliminate_biv (bl, loop_start, end, eliminate_p, threshold, insn_count)
int threshold, insn_count; int threshold, insn_count;
{ {
rtx reg = bl->biv->dest_reg; rtx reg = bl->biv->dest_reg;
rtx p, set; rtx p;
struct induction *v;
/* Scan all insns in the loop, stopping if we find one that uses the /* Scan all insns in the loop, stopping if we find one that uses the
biv in a way that we cannot eliminate. */ biv in a way that we cannot eliminate. */
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment