This is the mail archive of the
mailing list for the GCC project.
Re: [tree-ssa] Loop analysis
- From: Diego Novillo <dnovillo at redhat dot com>
- To: David Edelsohn <dje at watson dot ibm dot com>
- Cc: Jason Merrill <jason at redhat dot com>,Pop Sébastian <pop at gauvain dot u-strasbg dot fr>,Jan Hubicka <jh at suse dot cz>,"gcc-patches at gcc dot gnu dot org" <gcc-patches at gcc dot gnu dot org>
- Date: 09 May 2003 14:02:57 -0400
- Subject: Re: [tree-ssa] Loop analysis
- Organization: Red Hat Canada
- References: <200305091747.NAA25318@makai.watson.ibm.com>
On Fri, 2003-05-09 at 13:47, David Edelsohn wrote:
> While working on SSA loop optimizations, I need to know if the
> interaction between the existing loop optimization infrastructure and the
> Tree-SSA design is hobbled from the beginning.
We will not know about infrastructure conflicts until we start having
loop optimizer passes. Sebastian proved that we can build loop data
structures out of the tree CFG. Further work will prove whether we can
optimize those loops.
While we implement the loop optimizers, we may run into design
limitations. When we do, we address the problems. Just like we have
addressed all the various design problems we found in the past. Look at
how much the tree SSA infrastructure has changed since we started
working on it almost two years ago.