On 07/09/15 10:27, Ramana Radhakrishnan wrote:
On 24/07/15 11:55, Kyrill Tkachov wrote:
commit d562629e36ba013b8f77956a74139330d191bc30
Author: Kyrylo Tkachov
Date: Fri Jul 17 16:30:01 2015 +0100
[ARM][3/3] Expand mod by power of 2
diff --git a/gcc/config/arm/arm.c b/gcc/config/arm/a
On 24/07/15 11:55, Kyrill Tkachov wrote:
>
> commit d562629e36ba013b8f77956a74139330d191bc30
> Author: Kyrylo Tkachov
> Date: Fri Jul 17 16:30:01 2015 +0100
>
> [ARM][3/3] Expand mod by power of 2
>
> diff --git a/gcc/config/arm/arm.c b/gcc/config/arm/arm.c
> index e1bc727..6ade07c 1006
12:14
To: GCC Patches
Cc: Ramana Radhakrishnan; Richard Earnshaw; Marcus Shawcroft; James
Greenhalgh
Subject: Re: [PATCH][ARM][3/3] Expand mod by power of 2
Here is a slight respin.
The important parts are the same, just the expander now uses the slightly
shorter arm_gen_compare_reg and the rtx
mana Radhakrishnan; Richard Earnshaw; Marcus Shawcroft; James
> Greenhalgh
> Subject: Re: [PATCH][ARM][3/3] Expand mod by power of 2
>
> Here is a slight respin.
> The important parts are the same, just the expander now uses the slightly
> shorter arm_gen_compare_reg and the rtx costs hu
Here is a slight respin.
The important parts are the same, just the expander now uses the slightly
shorter
arm_gen_compare_reg and the rtx costs hunk is moved under an explicit case MOD.
Note, the tests still require patch 1/3 that does this for aarch64 that I hope
to post
a respinned version o
Ping.
https://gcc.gnu.org/ml/gcc-patches/2015-07/msg02037.html
Thanks,
Kyrill
On 24/07/15 11:55, Kyrill Tkachov wrote:
Hi all,
This third patch implements the same algorithm as patch 1/3 but for arm.
That is, for X % N where N is a power of 2 we do:
rsbsr1, r0, #0
and r0, r0, #(
Hi all,
This third patch implements the same algorithm as patch 1/3 but for arm.
That is, for X % N where N is a power of 2 we do:
rsbsr1, r0, #0
and r0, r0, #(N - 1)
and r1, r1, #(N - 1)
rsbpl r0, r1, #0
For the special case where N is 2 we do the shorter:
cmp r0, #0
