Peter Steinmetz wrote:
Currently, within the ready_sort macro in haifa-sched.c, the call to qsort
is passed "rank_for_schedule" to help it decide which of two instructions
should be placed further towards the front of the ready list.
Rank_for_schedule uses a set of ordered heuristics (rank, prior
Peter Steinmetz <[EMAIL PROTECTED]> writes:
> Currently, within the ready_sort macro in haifa-sched.c, the call to qsort
> is passed "rank_for_schedule" to help it decide which of two instructions
> should be placed further towards the front of the ready list.
> Rank_for_schedule uses a set of ord
I've been looking a bit at how haifa_sched.c sorts the ready list and think
there may be some room for added flexibility and/or improvement. I'll
throw out a few ideas for discussion.
Currently, within the ready_sort macro in haifa-sched.c, the call to qsort
is passed "rank_for_schedule" to help
