This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [tree-ssa] Fix gcc.dg/tree-ssa/20030530-2.c
- From: Diego Novillo <dnovillo at redhat dot com>
- To: Jeff Law <law at redhat dot com>
- Cc: Jason Merrill <jason at redhat dot com>, "gcc-patches at gcc dot gnu dot org" <gcc-patches at gcc dot gnu dot org>
- Date: 11 Jun 2003 13:52:45 -0400
- Subject: Re: [tree-ssa] Fix gcc.dg/tree-ssa/20030530-2.c
- Organization: Red Hat Canada
- References: <200306111427.h5BERVmN013283@speedy.slc.redhat.com>
On Wed, 2003-06-11 at 10:27, law@redhat.com wrote:
> In message <wvlwufsg0fp.fsf@prospero.boston.redhat.com>, Jason Merrill writes:
> >Do we need to worry about commutativity wrt the VUSEs, as well?
> Yes. My plan is to sort the VUSE array (ugh).
>
How about we tie the VUSEs to the actual sub-tree to which they're
related?
A = B + C
^
|
+-- VUSE1, VUSE2, VUSE3 ...
Right now there is a single varray with all the VUSES, maybe we could
distribute those varrays into the sub-trees of the expression.
Clearly, this needs more thought, as this would change we access the
virtual operands for a statement.
Diego.