Searched refs:rank_for_schedule (Results 1 - 3 of 3) sorted by relevance
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | sched.c | 332 static int rank_for_schedule PROTO((const GENERIC_PTR, const GENERIC_PTR)); 528 /* Pointer to the last instruction scheduled. Used by rank_for_schedule, 1837 qsort (READY, NEW_READY, sizeof (rtx), rank_for_schedule); } \ function 1845 rank_for_schedule (x, y) 1902 while (i >= 0 && rank_for_schedule (a+i, &insn) >= 0)
|
H A D | haifa-sched.c | 445 static int rank_for_schedule PROTO ((const GENERIC_PTR, const GENERIC_PTR)); 684 /* parameters affecting the decision of rank_for_schedule() */ 1044 /* Pointer to the last instruction scheduled. Used by rank_for_schedule, 4137 qsort (READY, N_READY, sizeof (rtx), rank_for_schedule); } \ function 4145 rank_for_schedule (x, y) 4244 while (i >= 0 && rank_for_schedule (a + i, &insn) >= 0)
|
/haiku-buildtools/gcc/gcc/ |
H A D | haifa-sched.c | 853 static int rank_for_schedule (const void *, const void *); 1401 rank_for_schedule, so that insns independent of the last scheduled 1832 (= insn_delay). This allows rank_for_schedule to choose between 1840 - rank_for_schedule ranks instructions based on: 2586 /* Enum of rank_for_schedule heuristic decisions. */ 2602 /* Statistical breakdown of rank_for_schedule decisions. */ 2646 rank_for_schedule (const void *x, const void *y) 2868 while (i >= 0 && rank_for_schedule (a + i, &insn) >= 0) 3072 /* Print rank_for_schedule statistics. */ 3137 qsort (first, n_ready_real, sizeof (rtx), rank_for_schedule); 2634 rank_for_schedule (const void *x, const void *y) function [all...] |
Completed in 130 milliseconds