On 8/15/13 1:35 PM, Joern Rennecke wrote:
> I see that gcc.dg/tree-ssa/ssa-pre-21.c fails for avr.
> The computation of k + 1L is done as unsigned int (16 bit),
> but later ++k is performed as unsigned long (32 bit), and thus
> array[k+1] is not re-used.
>
> Is this to be considered a big in the o
I see that gcc.dg/tree-ssa/ssa-pre-21.c fails for avr.
The computation of k + 1L is done as unsigned int (16 bit),
but later ++k is performed as unsigned long (32 bit), and thus
array[k+1] is not re-used.
Is this to be considered a big in the optimizers for not
optimizing this, or in the testsuit
