This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: A bit of vector extension documentation
- To: Richard Henderson <rth at redhat dot com>
- Subject: Re: A bit of vector extension documentation
- From: Daniel Berlin <dan at cgsoftware dot com>
- Date: Fri, 28 Sep 2001 13:07:32 -0400
- Cc: Daniel Egger <degger at fhm dot edu>, gcc-patches at gcc dot gnu dot org, gcc at gcc dot gnu dot org
On Friday, September 28, 2001, at 12:38 PM, Richard Henderson wrote:
> On Fri, Sep 28, 2001 at 11:48:31AM -0400, Daniel Berlin wrote:
>> It's based on the algorithms in the paper "Exploiting superword level
>> parallelism with multimedia instruction sets"
>> http://www.acm.org/pubs/citations/proceedings/pldi/349299/p145-larsen/
>
> Yes, I've seen that one. While a nice starting point, I don't
> think it's as powerful as some of the other loop-based vectorization
> algorithms.
I'm curious what makes you say that.
It actually should be more powerful than loop based vectorization
algorithms.
Except maybe in some very specialized cases.
>
>
>
> r~