static void
clear_units ()
{
- int unit;
-
bzero (unit_last_insn, sizeof (unit_last_insn));
bzero (unit_tick, sizeof (unit_tick));
bzero (unit_n_insns, sizeof (unit_n_insns));
int unit, instance, clock, cost;
rtx insn;
{
- int i;
int tick = unit_tick[instance];
if (tick - clock > cost)
{
/* Find the instance of the function unit with the minimum hazard. */
int instance = unit;
- int best = instance;
int best_cost = actual_hazard_this_instance (unit, instance, insn,
clock, cost);
int this_cost;
clock, cost);
if (this_cost < best_cost)
{
- best = instance;
best_cost = this_cost;
if (this_cost <= cost)
break;
if (GET_CODE (dest) == REG)
{
- register int offset, bit, i;
+ register int i;
regno = REGNO (dest);
}
else if (GET_CODE (insn) == CALL_INSN)
{
- rtx dest = 0;
rtx x;
register int i;
rtx x;
int death;
{
- register int regno, j;
+ register int regno;
register rtx reg = SET_DEST (x);
int subreg_p = 0;
create_reg_dead_note (reg, insn)
rtx reg, insn;
{
- rtx link, backlink;
+ rtx link;
/* The number of registers killed after scheduling must be the same as the
number of registers killed before scheduling. The number of REG_DEAD
{
register struct sometimes *p;
register int regno = offset * REGSET_ELT_BITS + bit;
- int i;
/* There should never be a register greater than max_regno here. If there
is, it means that a define_split has created a new pseudo reg. This
FILE *file;
{
rtx insn, last;
- rtx last_note = 0;
rtx *ready, link;
int i, j, n_ready = 0, new_ready, n_insns = 0;
int sched_n_insns = 0;
/* Need to know what registers this insn kills. */
for (prev = 0, link = REG_NOTES (insn); link; link = next)
{
- int regno;
-
next = XEXP (link, 1);
if ((REG_NOTE_KIND (link) == REG_DEAD
|| REG_NOTE_KIND (link) == REG_UNUSED)
FILE *dump_file;
{
int max_uid = MAX_INSNS_PER_SPLIT * (get_max_uid () + 1);
- int i, b;
+ int b;
rtx insn;
/* Taking care of this degenerate case makes the rest of
for (b = 0; b < n_basic_blocks; b++)
{
rtx insn, next;
- rtx insns;
note_list = 0;