sched_analyze_2 (XEXP (note, 0), insn);
}
- EXECUTE_IF_SET_AND_RESET_IN_REG_SET (reg_pending_sets, 0, i,
- {
- reg_last_sets[i] = insn;
- });
+ EXECUTE_IF_SET_IN_REG_SET (reg_pending_sets, 0, i,
+ {
+ reg_last_sets[i] = insn;
+ });
+ CLEAR_REG_SET (reg_pending_sets);
if (reg_pending_sets_all)
{
to schedule this block. */
if (head == tail
&& (GET_CODE (head) == NOTE || GET_CODE (head) == CODE_LABEL))
- return;
+ goto ret;
#if 0
/* This short-cut doesn't work. It does not count call insns crossed by
has one insn, so this won't slow down this pass by much. */
if (head == tail)
- return;
+ goto ret;
#endif
/* Now HEAD through TAIL are the insns actually to be rearranged;
if (n_insns == 0)
{
free_pending_lists ();
- return;
+ goto ret;
}
/* Allocate vector to hold insns to be rearranged (except those
finish_sometimes_live (regs_sometimes_live, sometimes_max);
}
free_pending_lists ();
- return;
+ goto ret;
}
#endif
/* Yow! We're done! */
free_pending_lists ();
+ret:
+ FREE_REG_SET (reg_pending_sets);
+ FREE_REG_SET (old_live_regs);
+
return;
}
\f
REG_N_CALLS_CROSSED (regno) = sched_reg_n_calls_crossed[regno];
}
}
+
+ if (reload_completed == 0)
+ {
+ FREE_REG_SET (bb_dead_regs);
+ FREE_REG_SET (bb_live_regs);
+ }
+
}
#endif /* INSN_SCHEDULING */