On Sun, 11 Oct 2015, Dominique d'Humières wrote:
> > It seems there was regression on fatigue/fatigue2
> > http://gcc.opensuse.org/c++bench/pb11/ Fatigue
> > was one of reasons to intorduce the heuristics, so it may be related to the
> > patch :(
>
> The test in pr 64099 comment 14 now require
> It seems there was regression on fatigue/fatigue2
> http://gcc.opensuse.org/c++bench/pb11/ Fatigue
> was one of reasons to intorduce the heuristics, so it may be related to the
> patch :(
The test in pr 64099 comment 14 now requires -fwhole-program to inline the
subroutine perdida:
[Book15]
>
> Ah, sorry. I wrote you a reply but apparently did not send. Yes, the patch
> looks
> resonable - it is a heuristics after all. Lets watch if the change make any
> difference
> on polyhedron and other benchmarks.
It seems there was regression on fatigue/fatigue2
http://gcc.opensuse.org/c+
> On Thu, 1 Oct 2015, Richard Biener wrote:
>
> >
> > The following avoids quadraticness in the loop depth by only considering
> > loop header defs as IVs for the analysis of the loop_stride predicate.
> > This will miss cases like
> >
> > foo (int inv)
> > {
> > for (i = inv; i < n; ++i)
> >
On Thu, 1 Oct 2015, Richard Biener wrote:
>
> The following avoids quadraticness in the loop depth by only considering
> loop header defs as IVs for the analysis of the loop_stride predicate.
> This will miss cases like
>
> foo (int inv)
> {
> for (i = inv; i < n; ++i)
> {
> int derived_i
On Thu, 1 Oct 2015, Richard Biener wrote:
>
> The following avoids quadraticness in the loop depth by only considering
> loop header defs as IVs for the analysis of the loop_stride predicate.
> This will miss cases like
>
> foo (int inv)
> {
> for (i = inv; i < n; ++i)
> {
> int derived_i
The following avoids quadraticness in the loop depth by only considering
loop header defs as IVs for the analysis of the loop_stride predicate.
This will miss cases like
foo (int inv)
{
for (i = inv; i < n; ++i)
{
int derived_iv = i + i * inv;
...
}
}
but I doubt that's important in
