Re: Ada and vectorization

[Guillaume Foliard <guifo@wanadoo.fr>]

Matthias Kretschmer wrote:

> As suggest in this thread using pragma for loops only isn't enough I think
> (so making it complicated I think - bloating the language up), because if
> you just think about something like:
>   a := a1*a2;
>   b := b1*b2;
>   c := c1*c2;
>   d := d1*d2
> wouldn't be cool if it is vectorized? you may say, throw anything in an
> array and then put it in a loop, but can't it happen, that these a,b,c and
> d aren't related, so putting it together into one array wouldn't be very
> wise.

Even if there not related from a semantic point of view, they are from a 
computational point of view. For the sake of performance, if performance 
matters of course, why should not we layout data in a efficient manner ? 
This does not break data abstraction, just the layout.

> Btw. are there Ada compilers available (beside gcc 3.1 - yes the backend
> is capable of using the vector units of at least x86-based cpus as stated
> on gcc.gnu.org) which currently use vectorization and/or inter-procedure
> optimization?

Just a precision here, GCC 3.1 does not vectorize, it just uses the vector 
unit in a scalar manner as a faster x87 FPU.
Have you got any links talking about "inter-procedure optimization" ?