Searched refs:queue_insn (Results 1 - 3 of 3) sorted by relevance

/haiku-buildtools/legacy/gcc/gcc/
H A Dsched.c334 static void queue_insn PROTO((rtx, int));
1916 queue_insn (insn, n_cycles)
2066 queue_insn (prev, cost);
2106 queue_insn (insn, cost);
1908 queue_insn (insn, n_cycles) function
H A Dhaifa-sched.c390 The transition (R->Q) is implemented in `queue_insn' when an
447 static void queue_insn PROTO ((rtx, int));
4259 queue_insn (insn, n_cycles)
4463 queue_insn (next, effective_cost);
6942 queue_insn (insn, cost);
4251 queue_insn (insn, n_cycles) function
/haiku-buildtools/gcc/gcc/
H A Dhaifa-sched.c855 static void queue_insn (rtx_insn *, int, const char *);
2882 queue_insn (rtx_insn *insn, int n_cycles, const char *reason)
5193 queue_insn (insn, 1, "ready full");
6331 queue_insn (insn, SCHED_GROUP_P (insn) ? 1 : cost, reason);
6558 queue_insn (insn, 1, "list truncated");
6921 queue_insn (failed_insn, 1, "backtracked");
7712 queue_insn (next, delay, "change queue index");
2870 queue_insn (rtx_insn *insn, int n_cycles, const char *reason) function

Completed in 103 milliseconds