Vectorizing HIRLAM 4: complicated access patterns examined.

[Toon Moene]

I wrote:

	I'm now going to try to compile HIRLAM with 32 bit pointers.

And ... here are the results:

With 64-bit pointers: 2685 out of 9799 loops vectorized.
With 32-bit pointers: 3269 out of 8854 loops vectorized.

Why there are more loops in the 64-bit case is beyond my understanding -
it's the same code base as I worked on with the 32-bit compilation ...

Kind regards,

-- 
Toon Moene - e-mail: toon@moene.indiv.nluug.nl - phone: +31 346 214290
Saturnushof 14, 3738 XG  Maartensdijk, The Netherlands
A maintainer of GNU Fortran 95: http://gcc.gnu.org/fortran/