Lines Matching defs:n_ready
228 `n_ready'.
276 int n_ready;
761 gcc_assert (ready->n_ready);
762 return ready->vec + ready->first - ready->n_ready + 1;
771 if (ready->first == ready->n_ready)
773 memmove (ready->vec + ready->veclen - ready->n_ready,
775 ready->n_ready * sizeof (rtx));
778 ready->vec[ready->first - ready->n_ready] = insn;
779 ready->n_ready++;
790 gcc_assert (ready->n_ready);
792 ready->n_ready--;
794 if (ready->n_ready == 0)
810 gcc_assert (ready->n_ready && index < ready->n_ready);
827 gcc_assert (ready->n_ready && index < ready->n_ready);
829 ready->n_ready--;
830 for (i = index; i < ready->n_ready; i++)
843 SCHED_SORT (first, ready->n_ready);
1390 && ready->n_ready > MAX_SCHED_READY_INSNS
1408 if (ready->n_ready == 0)
1605 if (ready->n_ready == 0)
1612 for (i = 0; i < ready->n_ready; i++)
1737 int n, i, all, n_ready, best, delay, tries_num;
1746 n_ready = ready->n_ready;
1747 for (all = i = 0; i < n_ready; i++)
1754 if (top->rest == 0 || i >= n_ready)
1835 for (i = 1; i < ready->n_ready; i++)
1897 ready.n_ready = 0;
1927 if (!reload_completed && ready.n_ready > MAX_SCHED_READY_INSNS)
1932 for (i = MAX_SCHED_READY_INSNS; i < ready.n_ready; i++)
1939 ";;\t\tReady list on entry: %d insns\n", ready.n_ready);
1945 while (i < ready.n_ready)
1971 gcc_assert (ready.n_ready);
1997 && (ready.n_ready == 0
2002 &ready.n_ready, clock_var);
2021 if (ready.n_ready == 0
2035 if (ready.n_ready == 0 || !can_issue_more
2126 if (ready.n_ready > 0)
2130 && (ready.n_ready == 0
2135 ready.n_ready
2137 &ready.n_ready, clock_var);