Re: [PATCH v3] Include checking of 0 cost dependency due to bypass in rank_for_schedule

On 11/6/20 2:37 AM, Jojo R wrote: > Insn seqs before sched: > > .L1: > a5 = insn-1 (a0) > a6 = insn-2 (a1) > a7 = insn-3 (a7, a5) > a8 = insn-4 (a8, a6) > Jmp .L1 > > Insn-3 & insn-4 is REG_DEP_TRUE of insn-1 & insn-2, > so insn-3 & insn-4 will be as the last of ready list. > And this patch will

Re: [PATCH v3] Include checking of 0 cost dependency due to bypass in rank_for_schedule

Ping … ... Jojo 在 2020年11月6日 +0800 PM5:38，Jojo R ，写道： > Insn seqs before sched: > > .L1: > a5 = insn-1 (a0) > a6 = insn-2 (a1) > a7 = insn-3 (a7, a5) > a8 = insn-4 (a8, a6) > Jmp .L1 > > Insn-3 & insn-4 is REG_DEP_TRUE of insn-1 & insn-2, > so insn-3 & insn-4 will be as the last of ready list. > A

[PATCH v3] Include checking of 0 cost dependency due to bypass in rank_for_schedule

Insn seqs before sched: .L1: a5 = insn-1 (a0) a6 = insn-2 (a1) a7 = insn-3 (a7, a5) a8 = insn-4 (a8, a6) Jmp .L1 Insn-3 & insn-4 is REG_DEP_TRUE of insn-1 & insn-2, so insn-3 & insn-4 will be as the last of ready list. And this patch will put 0 cost dependency due to a bypass as highest numbered