On 11/14/06, Sashan Govender <[EMAIL PROTECTED]> wrote:
Hi
I was looking at the vectorizer
(http://gcc.gnu.org/projects/tree-ssa/vectorization.html) and noticed
that in section 6 it says that there is no data dependence graph
implemented. Also had a search throught the mailing list archives and
noticed that although ddg.c exists its not used much?
(http://gcc.gnu.org/ml/gcc/2005-09/msg00661.html). A grep for
creat_ddg shows it's used in modulo-sched.c. So is this fertile ground
for something to be implemented? Is it worth implementing a ddg graph
for the vectorizer?
What exactly do you hope to gain by building a ddg?
If you have some algorithm that can take advantage of a ddg, sure, build one.
Thanks
