Richard Biener writes:
> On Tue, Nov 17, 2020 at 2:02 PM Richard Sandiford
> wrote:
>>
>> Richard Biener via Gcc-patches writes:
>> > On Tue, Nov 17, 2020 at 12:24 PM Richard Sandiford via Gcc-patches
>> > wrote:
>> >>
>> >> We're now able to vectorise the set-up loop:
>> >>
>> >> int p =
On Tue, Nov 17, 2020 at 2:02 PM Richard Sandiford
wrote:
>
> Richard Biener via Gcc-patches writes:
> > On Tue, Nov 17, 2020 at 12:24 PM Richard Sandiford via Gcc-patches
> > wrote:
> >>
> >> We're now able to vectorise the set-up loop:
> >>
> >> int p = power2 (fns[i].po2);
> >> for
Richard Biener via Gcc-patches writes:
> On Tue, Nov 17, 2020 at 12:24 PM Richard Sandiford via Gcc-patches
> wrote:
>>
>> We're now able to vectorise the set-up loop:
>>
>> int p = power2 (fns[i].po2);
>> for (int j = 0; j < N; j++)
>> a[j] = ((p << 4) * j) / (N - 1) - (p <<
On Tue, Nov 17, 2020 at 12:24 PM Richard Sandiford via Gcc-patches
wrote:
>
> We're now able to vectorise the set-up loop:
>
> int p = power2 (fns[i].po2);
> for (int j = 0; j < N; j++)
> a[j] = ((p << 4) * j) / (N - 1) - (p << 5);
>
> Rather than adjust the expected output for