Re: ADA Performance

[cis.ohio-state.edu!news.sei.cmu.edu!firth@ucbvax.Berkeley.EDU (Robert Fi]

In article <1993Apr28.204735.19177@netfs.dnd.ca> BERRYMAN@orca.drep.dnd.ca (DON
 BERRYMAN) writes:

>begin
>
>   for i in v1'range loop
>       v1(i) := cmplx(1.0,2.0);
>       v2(i) := cmplx(0.1,0.2);
>   end loop;
>
>   start := clock;                       -- Note the start time
>
>   for n in 1..100 loop                  -- Do the Vector Sum 100 times
>       a := cmplx (0.0, 0.0);
>       for i in v1'range loop
>           a := a + v1(i) * v2(i);
>       end loop;
>   end loop;

As a matter of interest, did any of the copmpilers optimise away the
entire program?  In principle, value tracking and constant folding
can compute the final value of A at compile time.