On Mon, 4 Dec 2017, Richard Biener wrote:
> On Mon, 4 Dec 2017, Bin.Cheng wrote:
>
> > On Mon, Dec 4, 2017 at 1:11 PM, Richard Biener wrote:
> > >
> > > I've noticed we perform FP reduction association without the required
> > > checks for associative math. I've added
> > > gcc.dg/tree-ssa/loop
On Mon, Dec 4, 2017 at 1:11 PM, Richard Biener wrote:
>
> I've noticed we perform FP reduction association without the required
> checks for associative math. I've added
> gcc.dg/tree-ssa/loop-interchange-1b.c to cover this.
>
> I also noticed we happily interchange a loop with a reduction like
>
On Mon, 4 Dec 2017, Bin.Cheng wrote:
> On Mon, Dec 4, 2017 at 1:11 PM, Richard Biener wrote:
> >
> > I've noticed we perform FP reduction association without the required
> > checks for associative math. I've added
> > gcc.dg/tree-ssa/loop-interchange-1b.c to cover this.
> >
> > I also noticed w
On Mon, Dec 4, 2017 at 1:11 PM, Richard Biener wrote:
>
> I've noticed we perform FP reduction association without the required
> checks for associative math. I've added
> gcc.dg/tree-ssa/loop-interchange-1b.c to cover this.
>
> I also noticed we happily interchange a loop with a reduction like
>
I've noticed we perform FP reduction association without the required
checks for associative math. I've added
gcc.dg/tree-ssa/loop-interchange-1b.c to cover this.
I also noticed we happily interchange a loop with a reduction like
sum = a[i] - sum;
where a change in order of elements isn't ok
