This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: SSE2 benchmarks
- To: Tim Prince <tprince at computer dot org>
- Subject: Re: SSE2 benchmarks
- From: Jan Hubicka <jh at suse dot cz>
- Date: Mon, 2 Jul 2001 11:38:47 +0200
- Cc: Paolo Carlini <pcarlini at unitus dot it>, gcc at gcc dot gnu dot org, jh at suse dot cz, dnovillo at redhat dot com
- References: <3B3CA9C2.42FB2E9B@unitus.it> <004b01c101a6$dce6b2b0$9865fea9@timayum4srqln4>
Hi from the vacantion :)
> That article scoffs at loops involving branches, but it happens that the
> gcc-3.1 -msse2 option is doing extremely well on certain cases involving
> comparison and branches, as well as on some cases involving sum
> reductions. More than one person has jumped into assuming that
> gcc -msse2 includes vectorization, but up to now it uses only serial
> sse2 instructions.
Ineed, this is confusing. I will send the patch for docs explicitly
mentioning that sse don't equal to autovectorization.
Honza
>