max_issue (struct ready_list *ready, int privileged_n, state_t state,
int *index)
{
- int n, i, all, n_ready, best, delay, tries_num, points = -1, max_points;
+ int n, i, all, n_ready, best, delay, tries_num, max_points;
int more_issue;
struct choice_entry *top;
rtx insn;
/* This is the index of the insn issued first in this
solution. */
*index = choice_stack [1].index;
- points = top->n;
if (top->n == max_points || best == all)
break;
}
{
rtx label;
rtx jump;
- edge e;
int edge_flags;
/* This is fixing of incoming edge. */
else
edge_flags = 0;
- e = make_edge (first_bb, rec, edge_flags);
+ make_edge (first_bb, rec, edge_flags);
label = block_label (second_bb);
jump = emit_jump_insn_after (gen_jump (label), BB_END (rec));
JUMP_LABEL (jump) = label;