This is the mail archive of the
mailing list for the GCC project.
Re: [tree-ssa] AST optimizer in C++?
- From: Chris Lattner <sabre at nondot dot org>
- To: Daniel Berlin <dberlin at dberlin dot org>
- Cc: Diego Novillo <dnovillo at redhat dot com>,Pop Sébastian <pop at gauvain dot u-strasbg dot fr>,<gcc at gcc dot gnu dot org>
- Date: Mon, 26 Aug 2002 20:15:54 -0500 (CDT)
- Subject: Re: [tree-ssa] AST optimizer in C++?
> > IMHO, the advantages of using SSA and having it available (for both
> > convenience, optimizer efficiency, and more powerful algorithms than data
> > flow can provide at times) greatly out-weigh the disadvantages of having
> > to update it.
> We already have it available, and used.
> Nobody is saying we shouldn't use SSA algorithms when possible, or convert
> algorithms to SSA.
> We aren't talking about whether to use SSA or not, we are talking about
> whether to keep it as annotations, or encode it into the IR.
> Please address the benefits of *that*, not of SSA in general.
> > What kinds of transformations do you have in mind that would be
> > inconvenient to implement in SSA form?
> That's not quite relevant.
> The real question is:
> What does encoding it directly into the IR, rather than doing is as we do
> now, buy us, that makes it worth it, given the disadvantages?