This is the mail archive of the gcc@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] AST optimizer in C++?

From: Pop Sébastian <pop at gauvain dot u-strasbg dot fr>
To: Daniel Berlin <dberlin at dberlin dot org>
Cc: Chris Lattner <sabre at nondot dot org>, Diego Novillo <dnovillo at redhat dot com>,gcc at gcc dot gnu dot org
Date: Mon, 26 Aug 2002 16:02:07 +0200
Subject: Re: [tree-ssa] AST optimizer in C++?
References: <Pine.LNX.4.30.0208251746470.31996-100000@nondot.org> <Pine.LNX.4.44.0208251908230.6334-100000@dberlin.org>

On Sun, Aug 25, 2002 at 07:12:03PM -0400, Daniel Berlin wrote:
> Plus, there are optimization passes that might not be run on SSA (some 
> loop optimizations).
> 
> Once again, forcing SSA on the representation itself means they have to 
> care about it (or you've limited when they can be run), while annotations 
> have no such limitations.
> 
okay.  I get the idea.

> There is no good reason to actually make it part of the form, 

  I'd like we examine also the case of DECL_STMTs that seems to fall under the 
same pattern.  
  For now we have a symbol table that spreads all over the tree.  DECL_ nodes
define entries in this symbol table.  Isn't a "stand alone" symbol table a better 
representation for storing this information?  It's probably a good way to store 
variable declarations in C-like languages, but what about fortran and other 
languages?

Follow-Ups:
- Re: [tree-ssa] AST optimizer in C++?
  - From: Steven Bosscher

References:
- Re: [tree-ssa] AST optimizer in C++?
  - From: Chris Lattner
- Re: [tree-ssa] AST optimizer in C++?
  - From: Daniel Berlin

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