This is the mail archive of the
gcc-patches@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: David Edelsohn <dje at watson dot ibm dot com>
- Date: Fri, 28 Sep 2001 13:12:06 -0400
- cc: Daniel Berlin <dan at cgsoftware dot com>, Daniel Egger <degger at fhm dot edu>, gcc-patches at gcc dot gnu dot org, gcc at gcc dot gnu dot org
>>>>> Richard Henderson writes:
Richard> 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/
Richard> Yes, I've seen that one. While a nice starting point, I don't
Richard> think it's as powerful as some of the other loop-based vectorization
Richard> algorithms.
I thought the point of the paper is that it is a generalization
that does not require loops. For SIMD, as opposed to vector,
architectures, it might be better because it can take advantage of such
instructions without the loop setup overhead.
David