On Thu, Feb 03, 2011 at 11:08:09AM +0100, Richard Guenther wrote:
> On Thu, Feb 3, 2011 at 6:43 AM, Jack Howarth <howa...@bromo.med.uc.edu> wrote:
> > Sebastian,
> > Below are the results for the Polyhedron 2005 benchmarks on
> > x86_64-apple-darwin10 using -O3 -ffast-math -funroll-loops under gcc
> > trunk at r169776, with -fgraphite-identity and with -fgraphite-identity
> > -ftree-loop-linear. I am surprised at the absence of any impact from
> > -ftree-loop-linear in either run-time or executable size. The increase
> > in compile time on some of the benchmarks suggested it was in effect.
> > Is this a poor combination of optimizations for -ftree-loop-linear or
> > is fortran less effective in using that optimization?
>
> Well, I don't know of any bogously nested (hot) loop in polyhedron, do you?
>
> Richard.
>
Richard,
In that case, I guess the most interesting observation from the data
would be that the increased compile times for the induct benchmark
makes it a good candidate for profiling -floop-interchange for hot
spots that could be improved.
Jack
> > induct 6.59 6.77 8.81
