On Thu, 16 Oct 2014, Jakub Jelinek wrote:
> On Thu, Oct 16, 2014 at 03:44:50PM +0200, Richard Biener wrote:
> > --- gcc/testsuite/gcc.dg/tree-ssa/loop-42.c (revision 0)
> > +++ gcc/testsuite/gcc.dg/tree-ssa/loop-42.c (working copy)
> > @@ -0,0 +1,19 @@
> > +/* { dg-do run } */
> > +/* { dg-options
On Thu, Oct 16, 2014 at 03:44:50PM +0200, Richard Biener wrote:
> --- gcc/testsuite/gcc.dg/tree-ssa/loop-42.c (revision 0)
> +++ gcc/testsuite/gcc.dg/tree-ssa/loop-42.c (working copy)
> @@ -0,0 +1,19 @@
> +/* { dg-do run } */
> +/* { dg-options "-O2 -fdump-tree-cunroll-details" } */
> +
> +exte
>
> The following makes us infer loop bounds for loops like
>
> :
> # str_28 = PHI <"foo"(2), str_10(4)>
> ...
> str_10 = str_28 + 1;
> _4 = *str_10;
> if (_4 != 0)
> goto ;
> else
> goto ;
>
> :
> goto ;
>
> or
>
> :
> # p_15 = PHI
> p_6 = p_15 + 1;
> *p_15 = 0
The following makes us infer loop bounds for loops like
:
# str_28 = PHI <"foo"(2), str_10(4)>
...
str_10 = str_28 + 1;
_4 = *str_10;
if (_4 != 0)
goto ;
else
goto ;
:
goto ;
or
:
# p_15 = PHI
p_6 = p_15 + 1;
*p_15 = 0;
...
if (n.1_5 > i_8)
goto ;
else