On Fri, 24 Jun 2022, Richard Sandiford wrote:
> Richard Biener writes:
> > On Thu, 23 Jun 2022, Richard Sandiford wrote:
> >> In a reduction pair like:
> >>
> >> typedef float T;
> >>
> >> void
> >> f1 (T *x)
> >> {
> >> T res1 = 0;
> >> T res2 = 0;
> >> for (int i = 0; i <
Richard Biener writes:
> On Thu, 23 Jun 2022, Richard Sandiford wrote:
>> In a reduction pair like:
>>
>> typedef float T;
>>
>> void
>> f1 (T *x)
>> {
>> T res1 = 0;
>> T res2 = 0;
>> for (int i = 0; i < 100; ++i)
>> {
>> res1 += x[i * 2];
>> res2 += x[i * 2
On Thu, 23 Jun 2022, Richard Sandiford wrote:
> In a reduction pair like:
>
> typedef float T;
>
> void
> f1 (T *x)
> {
> T res1 = 0;
> T res2 = 0;
> for (int i = 0; i < 100; ++i)
> {
> res1 += x[i * 2];
> res2 += x[i * 2 + 1];
> }
> x[0] = res1;
>
In a reduction pair like:
typedef float T;
void
f1 (T *x)
{
T res1 = 0;
T res2 = 0;
for (int i = 0; i < 100; ++i)
{
res1 += x[i * 2];
res2 += x[i * 2 + 1];
}
x[0] = res1;
x[1] = res2;
}
it isn't easy to predict whether the initial reducti
