On Oct 22, 2014, at 9:24 AM, Richard Sandiford
wrote:
> Maxim Kuvyrkov writes:
>> On Oct 21, 2014, at 9:11 PM, Richard Sandiford
>> wrote:
>>
>>> Maxim Kuvyrkov writes:
This patch improves model_order_p to use non-reg-pressure version of
rank_for_schedule when it needs to break the
Maxim Kuvyrkov writes:
> On Oct 21, 2014, at 9:11 PM, Richard Sandiford
> wrote:
>
>> Maxim Kuvyrkov writes:
>>> This patch improves model_order_p to use non-reg-pressure version of
>>> rank_for_schedule when it needs to break the tie. At the moment it is
>>> comparing INSN_PRIORITY by itself,
On Oct 21, 2014, at 9:11 PM, Richard Sandiford
wrote:
> Maxim Kuvyrkov writes:
>> This patch improves model_order_p to use non-reg-pressure version of
>> rank_for_schedule when it needs to break the tie. At the moment it is
>> comparing INSN_PRIORITY by itself, and it seems prudent to outsourc
Maxim Kuvyrkov writes:
> This patch improves model_order_p to use non-reg-pressure version of
> rank_for_schedule when it needs to break the tie. At the moment it is
> comparing INSN_PRIORITY by itself, and it seems prudent to outsource
> that to rank_for_schedule.
Do you have an example of wher
Hi,
This patch improves model_order_p to use non-reg-pressure version of
rank_for_schedule when it needs to break the tie. At the moment it is
comparing INSN_PRIORITY by itself, and it seems prudent to outsource that to
rank_for_schedule.
Bootstrapped on x86_64-linux-gnu and regtested on arm-
