This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Vectorizing HIRLAM 4: complicated access patterns examined.
- From: Toon Moene <toon at moene dot indiv dot nluug dot nl>
- To: DORIT at il dot ibm dot com, toon at moene dot indiv dot nluug dot nl
- Cc: fortran at gcc dot gnu dot org, gcc at gcc dot gnu dot org, IRAR at il dot ibm dot com, pop at icps dot u-strasbg dot fr
- Date: Thu, 27 Oct 2005 21:13:06 +0200
- Subject: Re: Vectorizing HIRLAM 4: complicated access patterns examined.
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/