This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [PATCH] [4.3 projects] vectorization of induction
- From: Dorit Nuzman <DORIT at il dot ibm dot com>
- To: Diego Novillo <dnovillo at redhat dot com>
- Cc: gcc-patches at gcc dot gnu dot org, Victor Kaplansky <VICTORK at il dot ibm dot com>
- Date: Mon, 5 Feb 2007 11:15:44 +0200
- Subject: Re: [PATCH] [4.3 projects] vectorization of induction
Diego Novillo <dnovillo@redhat.com> wrote on 02/02/2007 22:05:08:
> Dorit Nuzman wrote on 01/01/07 11:14:
>
...
>
> OK with:
>
>
> > !
> > ! /* Check that one def is the reduction def, defined by 'phi',
> >
> s/'phi'/PHI/
>
done
> > !
> > ! /* Second - identify all reductions. */
> > ! for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
> >
> Why don't you just create a small task queue with the PHIs that you
> found interesting in the first identification pass? This would
> simplify the logic in this other loop.
you're right - we can traverse only the relevant phis in the second pass. I
fixed that, and will commit once I can pass a complete bootstrap (pending
this problem - http://gcc.gnu.org/ml/gcc/2007-02/msg00064.html)
thanks,
dorit