This is the mail archive of the gcc-patches@gcc.gnu.org mailing list for the GCC project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

Re: [tree-ssa] un-ssa - part 1



On Mon, 31 Mar 2003, Diego Novillo wrote:

> On Mon, 31 Mar 2003, Andrew Macleod wrote:
>
> > This patch takes a first crack at the un-ssa pass. It implements a basic
> > partitioner which doesn't do anything different than we have today (ie, it
> > puts all versions of a variable into the same partition, so we still
> > aren't taking care of overlapping live ranges.).

Out of curiosity, why didn't you reuse the conflict graph + partition used
to do this exact same thing for RTL-SSA.
It seems it would be trivial to do the conflict graph reuse (the only part
that actually does anything related to RTL is conflict_graph_compute, which you'd need to
rewrite anyway to use for the tree un-ssa. The rest uses standard
datatypes like int).

and at the very least, the partition stuff has 0 RTL dependencies. It's
even in libiberty.

You've just reimplemented this stuff.
--Dan


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]